Symbol: N
usr/src/boot/efi/loader/arch/amd64/trap.c
209
#define PREPARE_EXCEPTION(N) \
usr/src/boot/efi/loader/arch/amd64/trap.c
210
extern char EXC##N##_handler[]; \
usr/src/boot/efi/loader/arch/amd64/trap.c
211
prepare_exception(N, (uintptr_t)EXC##N##_handler, ist_use_table);
usr/src/cmd/audio/utilities/AudioTypePcm.cc
261
#define COPY(N) if (inptr != outptr) memcpy(outptr, inptr, frames * N)
usr/src/cmd/fdformat/fdformat.c
59
#define getbyte(A, N) (((unsigned char *)(&(A)))[N])
usr/src/cmd/fm/eversholt/common/literals.h
128
L_DECL(N);
usr/src/cmd/isns/isnsd/isns_dd.h
53
#define MATRIX_X_UNIT(M, N) &(M)->m[(N) * ((M)->x + MATRIX_X_HEADER)]
usr/src/cmd/lp/filter/postscript/dpost/draw.c
319
int i, N;
usr/src/cmd/lp/filter/postscript/dpost/draw.c
371
for ( N = 2; N < sizeof(x)/sizeof(x[0]); N++ )
usr/src/cmd/lp/filter/postscript/dpost/draw.c
372
if (fscanf(fp, "%d %d", &x[N], &y[N]) != 2)
usr/src/cmd/lp/filter/postscript/dpost/draw.c
378
for (i = 1; i < N; i++) {
usr/src/cmd/lp/filter/postscript/dpost/draw.c
383
x[N] = x[N-1];
usr/src/cmd/lp/filter/postscript/dpost/draw.c
384
y[N] = y[N-1];
usr/src/cmd/lp/filter/postscript/dpost/draw.c
386
for (i = ((flag!=1)?0:1); i < ((flag!=1)?N-1:N-2); i++)
usr/src/cmd/lp/filter/postscript/dpost/draw.c
389
hgoto(x[N]); /* where troff expects to be */
usr/src/cmd/lp/filter/postscript/dpost/draw.c
390
vgoto(y[N]);
usr/src/cmd/lp/include/lp.h
288
#define STRNEQU(A, B, N) ((!(A) || !(B)) ? 0 : (strncmp((A), (B), (N)) == 0))
usr/src/cmd/lp/include/lp.h
290
#define CS_STRNEQU(A, B, N) (cs_strncmp((A), (B), (N)) == 0)
usr/src/cmd/lp/include/msgs.h
252
#define TAIL_ENDSYNC(N) (N - TAIL_ENDSYNC_LEN)
usr/src/cmd/lp/include/msgs.h
254
#define TAIL_CHKSUM(N) (TAIL_ENDSYNC(N) - TAIL_CHKSUM_LEN)
usr/src/cmd/lp/lib/msgs/read_fifo.c
106
#define SYNCHED_READ(N) \
usr/src/cmd/lp/lib/msgs/read_fifo.c
107
if (fbp->psave_end - fbp->psave < N || fbp->psave >= fbp->psave_end) \
usr/src/cmd/lp/lib/msgs/read_fifo.c
92
#define UNSYNCHED_READ(N) \
usr/src/cmd/lp/lib/msgs/read_fifo.c
93
if (fbp->psave_end - fbp->psave < N || fbp->psave >= fbp->psave_end) \
usr/src/cmd/lp/model/lp.cat.c
366
#define DELAY(N, D) R(SAFETY_FACTOR * ((N) / (double)(D)))
usr/src/cmd/sendmail/db/include/hash.h
171
#define ISBIG(I, N) (((N) > ((I)->hdr->pagesize / MINFILL)) ? 1 : 0)
usr/src/cmd/sendmail/db/include/hash.h
183
#define PAIR_ISKEYBIG(N) (N & PAIR_KEYMASK)
usr/src/cmd/sendmail/db/include/hash.h
184
#define PAIR_ISDATABIG(N) (N & PAIR_DATAMASK)
usr/src/cmd/sendmail/db/include/hash.h
185
#define OPCODE_OF(N) (N & ~(PAIR_KEYMASK | PAIR_DATAMASK))
usr/src/cmd/sendmail/db/include/lock.h
188
#define STRING_SIZE(N) (16 * N)
usr/src/cmd/sendmail/db/include/lock.h
190
#define LOCK_REGION_SIZE(M, N, H) \
usr/src/cmd/sendmail/db/include/lock.h
193
(N) * ALIGN(sizeof(struct __db_lock), MUTEX_ALIGNMENT) + \
usr/src/cmd/sendmail/db/include/lock.h
194
ALIGN((N) * sizeof(DB_LOCKOBJ), sizeof(size_t)) + \
usr/src/cmd/sendmail/db/include/lock.h
195
ALIGN(STRING_SIZE(N), sizeof(size_t)))
usr/src/cmd/sendmail/db/include/txn.h
115
#define TXN_REGION_SIZE(N) \
usr/src/cmd/sendmail/db/include/txn.h
116
(sizeof(DB_TXNREGION) + N * sizeof(TXN_DETAIL) + 1000)
usr/src/cmd/sendmail/db/lock/lock_deadlock.c
27
#define ISSET_MAP(M, N) (M[(N) / 32] & (1 << (N) % 32))
usr/src/cmd/sendmail/db/lock/lock_deadlock.c
29
#define CLEAR_MAP(M, N) { \
usr/src/cmd/sendmail/db/lock/lock_deadlock.c
31
for (__i = 0; __i < (N); __i++) \
usr/src/cmd/sendmail/db/lock/lock_deadlock.c
38
#define OR_MAP(D, S, N) { \
usr/src/cmd/sendmail/db/lock/lock_deadlock.c
40
for (__i = 0; __i < (N); __i++) \
usr/src/cmd/sendmail/libsm/t-strl.c
31
char src1[N][SIZE], dst1[SIZE], dst2[SIZE];
usr/src/cmd/sendmail/libsm/t-strl.c
90
for (k = 0; k < N; k++)
usr/src/cmd/sgs/error/common/errorsubr.c
371
static char *N = "";
usr/src/cmd/sgs/error/common/errorsubr.c
376
return (n > 1 ? S : N);
usr/src/cmd/sgs/error/common/errorsubr.c
382
return (n > 1 ? N : S);
usr/src/cmd/sort/merge.c
233
heap_down(stream_t **A, int k, int N, flag_t coll_flags)
usr/src/cmd/sort/merge.c
237
while (2 * k <= N) {
usr/src/cmd/sort/merge.c
239
if (j < N && pq_coll_fcn(&A[j]->s_current,
usr/src/cmd/sqlite/shell.c
971
static int _ends_with_semicolon(const char *z, int N){
usr/src/cmd/sqlite/shell.c
972
while( N>0 && isspace(z[N-1]) ){ N--; }
usr/src/cmd/sqlite/shell.c
973
return N>0 && z[N-1]==';';
usr/src/cmd/stat/kstat/kstat.h
104
#define SAVE_STRING(I, S, N) \
usr/src/cmd/stat/kstat/kstat.h
107
v.str.addr.ptr = safe_strdup(S->N); \
usr/src/cmd/stat/kstat/kstat.h
108
v.str.len = strlen(S->N); \
usr/src/cmd/stat/kstat/kstat.h
109
nvpair_insert(I, #N, &v, KSTAT_DATA_STRING); \
usr/src/cmd/stat/kstat/kstat.h
112
#define SAVE_HRTIME_X(I, N, V) \
usr/src/cmd/stat/kstat/kstat.h
116
nvpair_insert(I, N, &v, KSTAT_DATA_HRTIME); \
usr/src/cmd/stat/kstat/kstat.h
119
#define SAVE_INT32_X(I, N, V) \
usr/src/cmd/stat/kstat/kstat.h
123
nvpair_insert(I, N, &v, KSTAT_DATA_INT32); \
usr/src/cmd/stat/kstat/kstat.h
126
#define SAVE_UINT32_X(I, N, V) \
usr/src/cmd/stat/kstat/kstat.h
130
nvpair_insert(I, N, &v, KSTAT_DATA_UINT32); \
usr/src/cmd/stat/kstat/kstat.h
133
#define SAVE_UINT64_X(I, N, V) \
usr/src/cmd/stat/kstat/kstat.h
137
nvpair_insert(I, N, &v, KSTAT_DATA_UINT64); \
usr/src/cmd/stat/kstat/kstat.h
140
#define SAVE_STRING_X(I, N, V) \
usr/src/cmd/stat/kstat/kstat.h
145
nvpair_insert(I, N, &v, KSTAT_DATA_STRING); \
usr/src/cmd/stat/kstat/kstat.h
148
#define SAVE_CHAR_X(I, N, V) \
usr/src/cmd/stat/kstat/kstat.h
153
nvpair_insert(I, N, &v, KSTAT_DATA_STRING); \
usr/src/cmd/stat/kstat/kstat.h
65
#define SAVE_HRTIME(I, S, N) \
usr/src/cmd/stat/kstat/kstat.h
68
v.ui64 = S->N; \
usr/src/cmd/stat/kstat/kstat.h
69
nvpair_insert(I, #N, &v, KSTAT_DATA_UINT64); \
usr/src/cmd/stat/kstat/kstat.h
72
#define SAVE_INT32(I, S, N) \
usr/src/cmd/stat/kstat/kstat.h
75
v.i32 = S->N; \
usr/src/cmd/stat/kstat/kstat.h
76
nvpair_insert(I, #N, &v, KSTAT_DATA_INT32); \
usr/src/cmd/stat/kstat/kstat.h
79
#define SAVE_UINT32(I, S, N) \
usr/src/cmd/stat/kstat/kstat.h
82
v.ui32 = S->N; \
usr/src/cmd/stat/kstat/kstat.h
83
nvpair_insert(I, #N, &v, KSTAT_DATA_UINT32); \
usr/src/cmd/stat/kstat/kstat.h
86
#define SAVE_INT64(I, S, N) \
usr/src/cmd/stat/kstat/kstat.h
89
v.i64 = S->N; \
usr/src/cmd/stat/kstat/kstat.h
90
nvpair_insert(I, #N, &v, KSTAT_DATA_INT64); \
usr/src/cmd/stat/kstat/kstat.h
93
#define SAVE_UINT64(I, S, N) \
usr/src/cmd/stat/kstat/kstat.h
96
v.ui64 = S->N; \
usr/src/cmd/stat/kstat/kstat.h
97
nvpair_insert(I, #N, &v, KSTAT_DATA_UINT64); \
usr/src/cmd/tar/tar.c
4986
char b[N];
usr/src/cmd/tar/tar.c
4993
m = l + (h-l)/2 - N/2;
usr/src/cmd/tar/tar.c
4998
(void) fread(b+1, 1, N-1, tfile);
usr/src/cmd/tar/tar.c
5002
(void) fread(b, 1, N, tfile);
usr/src/cmd/tar/tar.c
5003
for (i = 0; i < N; i++) {
usr/src/cmd/tar/tar.c
5012
for (i++; i < N; i++) {
usr/src/cmd/tr/cmap.c
164
struct cmapnode N, *l, *r, *y;
usr/src/cmd/tr/cmap.c
172
N.cmn_left = N.cmn_right = NULL;
usr/src/cmd/tr/cmap.c
173
l = r = &N;
usr/src/cmd/tr/cmap.c
206
t->cmn_left = N.cmn_right;
usr/src/cmd/tr/cmap.c
207
t->cmn_right = N.cmn_left;
usr/src/cmd/tr/cset.c
224
struct csnode N, *l, *r, *y;
usr/src/cmd/tr/cset.c
232
N.csn_left = N.csn_right = NULL;
usr/src/cmd/tr/cset.c
233
l = r = &N;
usr/src/cmd/tr/cset.c
266
t->csn_left = N.csn_right;
usr/src/cmd/tr/cset.c
267
t->csn_right = N.csn_left;
usr/src/cmd/troff/troff.d/draw.c
152
int i, j, numdots, N;
usr/src/cmd/troff/troff.d/draw.c
159
for (N = 2; (p=getstr(p,temp)) != NULL && N < sizeof(x)/sizeof(x[0]); N++) {
usr/src/cmd/troff/troff.d/draw.c
160
x[N] = atoi(temp);
usr/src/cmd/troff/troff.d/draw.c
162
y[N] = atoi(temp);
usr/src/cmd/troff/troff.d/draw.c
166
for (i = 1; i < N; i++) {
usr/src/cmd/troff/troff.d/draw.c
170
x[N] = x[N-1];
usr/src/cmd/troff/troff.d/draw.c
171
y[N] = y[N-1];
usr/src/cmd/troff/troff.d/draw.c
173
for (i = 0; i < N-1; i++) { /* interval */
usr/src/common/bzip2/decompress.c
128
Int32 N;
usr/src/common/bzip2/decompress.c
182
N = s->save_N;
usr/src/common/bzip2/decompress.c
383
N = 1;
usr/src/common/bzip2/decompress.c
391
if (N >= 2*1024*1024) RETURN(BZ_DATA_ERROR);
usr/src/common/bzip2/decompress.c
392
if (nextSym == BZ_RUNA) es = es + (0+1) * N; else
usr/src/common/bzip2/decompress.c
393
if (nextSym == BZ_RUNB) es = es + (1+1) * N;
usr/src/common/bzip2/decompress.c
394
N = N * 2;
usr/src/common/bzip2/decompress.c
631
s->save_N = N;
usr/src/common/crypto/ecc/ecp_mont.c
177
MP_CHECKOK(mp_mod(r, &mmm->N, r));
usr/src/common/crypto/ecc/ecp_mont.c
92
mmm->N = meth->irr;
usr/src/common/crypto/skein/skein_port.h
22
#define RotL_64(x, N) (((x) << (N)) | ((x) >> (64 - (N))))
usr/src/common/mpi/mpi-priv.h
306
mp_int N; /* modulus N */
usr/src/common/mpi/mpi.h
234
#define MP_DIGIT(MP,N) (MP)->dp[(N)]
usr/src/common/mpi/mpi.h
375
#define DIGIT(MP,N) MP_DIGIT(MP,N)
usr/src/common/mpi/mpmontg.c
102
i = MP_USED(T) + MP_USED(&mmm->N) + 2;
usr/src/common/mpi/mpmontg.c
104
for (i = 0; i < MP_USED(&mmm->N); ++i ) {
usr/src/common/mpi/mpmontg.c
107
s_mp_mul_d_add_offset(&mmm->N, m_i, T, i);
usr/src/common/mpi/mpmontg.c
114
if ((res = s_mp_cmp(T, &mmm->N)) >= 0) {
usr/src/common/mpi/mpmontg.c
116
MP_CHECKOK( s_mp_sub(T, &mmm->N) );
usr/src/common/mpi/mpmontg.c
118
if ((res = mp_cmp(T, &mmm->N)) >= 0) {
usr/src/common/mpi/mpmontg.c
148
ib = MP_USED(a) + MP_MAX(MP_USED(b), MP_USED(&mmm->N)) + 2;
usr/src/common/mpi/mpmontg.c
157
s_mp_mul_d_add_offset(&mmm->N, m_i, c, 0);
usr/src/common/mpi/mpmontg.c
168
s_mp_mul_d_add_offset(&mmm->N, m_i, c, ib);
usr/src/common/mpi/mpmontg.c
170
if (usedb < MP_USED(&mmm->N)) {
usr/src/common/mpi/mpmontg.c
171
for (usedb = MP_USED(&mmm->N); ib < usedb; ++ib ) {
usr/src/common/mpi/mpmontg.c
173
s_mp_mul_d_add_offset(&mmm->N, m_i, c, ib);
usr/src/common/mpi/mpmontg.c
178
if (s_mp_cmp(c, &mmm->N) >= 0) {
usr/src/common/mpi/mpmontg.c
179
MP_CHECKOK( s_mp_sub(c, &mmm->N) );
usr/src/grub/grub-0.97/netboot/tg3.c
52
#define NEXT_TX(N) (((N) + 1) & (TG3_TX_RING_SIZE - 1))
usr/src/grub/grub-0.97/netboot/tg3.c
53
#define PREV_TX(N) (((N) - 1) & (TG3_TX_RING_SIZE - 1))
usr/src/lib/crypt_modules/sha256/crypt_sha.c
100
#define b64_from_24bit(B2, B1, B0, N) \
usr/src/lib/crypt_modules/sha256/crypt_sha.c
103
int n = (N); \
usr/src/lib/gss_mechs/mech_krb5/include/port-sockets.h
130
#define SG_ADVANCE(SG, N) \
usr/src/lib/gss_mechs/mech_krb5/include/port-sockets.h
131
((SG)->iov_len < (N) \
usr/src/lib/gss_mechs/mech_krb5/include/port-sockets.h
133
: ((SG)->iov_base = (char *) (SG)->iov_base + (N), \
usr/src/lib/gss_mechs/mech_krb5/include/port-sockets.h
134
(SG)->iov_len -= (N), 0))
usr/src/lib/gss_mechs/mech_krb5/include/port-sockets.h
14
#define SG_ADVANCE(SG, N) \
usr/src/lib/gss_mechs/mech_krb5/include/port-sockets.h
15
((SG)->len < (N) \
usr/src/lib/gss_mechs/mech_krb5/include/port-sockets.h
17
: ((SG)->buf += (N), (SG)->len -= (N), 0))
usr/src/lib/gss_mechs/mech_krb5/include/port-sockets.h
21
#define SG_SET(SG, B, N) ((SG)->buf = (char *)(B),(SG)->len = (N))
usr/src/lib/gss_mechs/mech_krb5/krb5/krb/str_conv.c
375
#define isleap(N) ((N % 4) == 0 && (N % 100 != 0 || N % 400 == 0))
usr/src/lib/gss_mechs/mech_krb5/support/fake-addrinfo.c
358
#define X(N) if (p == IPPROTO_ ## N) return #N
usr/src/lib/krb5/plugins/kdb/db2/libdb2/hash/hash.h
150
#define CLRBIT(A, N) ((A)[(N)/BITS_PER_MAP] &= ~(1<<((N)%BITS_PER_MAP)))
usr/src/lib/krb5/plugins/kdb/db2/libdb2/hash/hash.h
151
#define SETBIT(A, N) ((A)[(N)/BITS_PER_MAP] |= (1<<((N)%BITS_PER_MAP)))
usr/src/lib/krb5/plugins/kdb/db2/libdb2/hash/hash.h
152
#define ISSET(A, N) ((A)[(N)/BITS_PER_MAP] & (1<<((N)%BITS_PER_MAP)))
usr/src/lib/krb5/plugins/kdb/db2/libdb2/hash/hash.h
165
#define SPLITNUM(N) (((u_int32_t)(N)) >> SPLITSHIFT)
usr/src/lib/krb5/plugins/kdb/db2/libdb2/hash/hash.h
166
#define OPAGENUM(N) ((N) & SPLITMASK)
usr/src/lib/krb5/plugins/kdb/db2/libdb2/hash/hash.h
175
#define POW2(N) (1 << (N))
usr/src/lib/krb5/plugins/kdb/db2/libdb2/hash/page.h
121
#define DATA_OFF(P, N) \
usr/src/lib/krb5/plugins/kdb/db2/libdb2/hash/page.h
122
REFERENCE(P, indx_t, PAGE_OVERHEAD + N * PAIR_OVERHEAD + sizeof(indx_t))
usr/src/lib/krb5/plugins/kdb/db2/libdb2/hash/page.h
123
#define KEY_OFF(P, N) \
usr/src/lib/krb5/plugins/kdb/db2/libdb2/hash/page.h
124
REFERENCE(P, indx_t, PAGE_OVERHEAD + N * PAIR_OVERHEAD)
usr/src/lib/krb5/plugins/kdb/db2/libdb2/hash/page.h
126
#define KEY(P, N) (((PAGE8 *)(P)) + KEY_OFF((P), (N)))
usr/src/lib/krb5/plugins/kdb/db2/libdb2/hash/page.h
127
#define DATA(P, N) (((PAGE8 *)(P)) + DATA_OFF((P), (N)))
usr/src/lib/krb5/plugins/kdb/db2/libdb2/hash/page.h
140
#define PAGE_META(N) (((N) + 3) * sizeof(u_int16_t))
usr/src/lib/krb5/plugins/kdb/db2/libdb2/hash/page.h
142
#define ISBIG(N, P) (((N) > ((P)->hdr.bsize * MINFILL)) ? 1 : 0)
usr/src/lib/krb5/plugins/kdb/db2/libdb2/hash/page.h
54
#define HI(N) ((u_int16_t)(((N) & HI_MASK) >> 16))
usr/src/lib/krb5/plugins/kdb/db2/libdb2/hash/page.h
55
#define LO(N) ((u_int16_t)((N) & LO_MASK))
usr/src/lib/lib9p/common/pack.c
525
fcall->twalk.wname, N(fcall->twalk.wname));
usr/src/lib/lib9p/common/request.c
182
{ "<none>", l9p_handlers_no_version, N(l9p_handlers_no_version) },
usr/src/lib/lib9p/common/request.c
183
{ "9P2000", l9p_handlers_base, N(l9p_handlers_base) },
usr/src/lib/lib9p/common/request.c
184
{ "9P2000.u", l9p_handlers_dotu, N(l9p_handlers_dotu), },
usr/src/lib/lib9p/common/request.c
185
{ "9P2000.L", l9p_handlers_dotL, N(l9p_handlers_dotL), },
usr/src/lib/lib9p/common/request.c
252
if ((size_t)errnum < N(table) && table[errnum] != 0)
usr/src/lib/lib9p/common/request.c
348
if ((size_t)errnum < N(table) && table[errnum] != 0)
usr/src/lib/lib9p/common/request.c
588
for (i = 0; i < N(l9p_versions); i++) {
usr/src/lib/lib9p/common/utils.c
911
if ((size_t)linux_errno < N(table) && table[linux_errno] != NULL)
usr/src/lib/libc/port/gen/drand48.c
105
static double two16m = 1.0 / ((int32_t)1 << N);
usr/src/lib/libc/port/gen/drand48.c
117
return ((long)((int32_t)x[2] << (N - 1)) + (x[1] >> 1));
usr/src/lib/libc/port/gen/drand48.c
124
return ((long)((int32_t)x[2] << N) + x[1]);
usr/src/lib/libc/port/gen/drand48.c
69
#define MASK ((unsigned)(1 << (N - 1)) + (1 << (N - 1)) - 1)
usr/src/lib/libc/port/gen/drand48.c
71
#define HIGH(x) LOW((x) >> N)
usr/src/lib/libc/port/regex/regcomp.c
1167
#define MAP(n) (((n) <= 1) ? (n) : ((n) == INFINITY) ? INF : N)
usr/src/lib/libc/port/regex/regcomp.c
1180
case REP(0, N): /* as x{1,n}? */
usr/src/lib/libc/port/regex/regcomp.c
1194
case REP(1, N): /* as x?x{1,n-1} */
usr/src/lib/libc/port/regex/regcomp.c
1210
case REP(N, N): /* as xx{m-1,n-1} */
usr/src/lib/libc/port/regex/regcomp.c
1214
case REP(N, INF): /* as xx{n-1,INF} */
usr/src/lib/libm/common/complex/k_clog_r.c
225
static double k_log_NKz(int N, int K, double zh, double *zt)
usr/src/lib/libm/common/complex/k_clog_r.c
239
P += N * ln2_t + TBL_log1k[K + K + 1];
usr/src/lib/libm/common/complex/k_clog_r.c
240
t = N*ln2_h + TBL_log1k[K+K];
usr/src/lib/libm/common/complex/k_clog_rl.c
363
static long double k_log_NKzl(int N, int K, long double zh, long double *zt)
usr/src/lib/libm/common/complex/k_clog_rl.c
400
P += N * ln2_t + TBL_log1k[K + K + 1];
usr/src/lib/libm/common/complex/k_clog_rl.c
401
t = N*ln2_h + TBL_log1k[K+K];
usr/src/lib/libmlrpc/common/libmlrpc.h
447
#define NDR_NEWN(XA, T, N) ndr_heap_malloc((XA)->heap, sizeof (T)*(N))
usr/src/lib/libmlrpc/common/ndr_ops.c
58
#define NDR_PDU_ALIGN(N) \
usr/src/lib/libmlrpc/common/ndr_ops.c
59
(((N) + NDR_PDU_BLOCK_SIZE) & ~NDR_PDU_BLOCK_MASK)
usr/src/lib/libmtmalloc/tests/align.c
42
char *bar[N];
usr/src/lib/libmtmalloc/tests/general.c
63
int i = N;
usr/src/lib/libmtmalloc/tests/general.c
64
char *bar[N];
usr/src/lib/libmtmalloc/tests/general.c
69
i = N;
usr/src/lib/libmvec/common/__vcosf.c
100
n##N = 1; \
usr/src/lib/libmvec/common/__vcosf.c
102
y##N = (double)t; \
usr/src/lib/libmvec/common/__vcosf.c
109
z##N = y##N = (double)t; \
usr/src/lib/libmvec/common/__vcosf.c
110
hx = HI(y##N); \
usr/src/lib/libmvec/common/__vcosf.c
111
n##N = ((hx >> 20) & 0x7ff) - 1046; \
usr/src/lib/libmvec/common/__vcosf.c
112
HI(z##N) = (hx & 0xfffff) | 0x41600000; \
usr/src/lib/libmvec/common/__vcosf.c
113
n##N = __vlibm_rem_pio2m(&z##N, &y##N, n##N, 1, 0) + 1; \
usr/src/lib/libmvec/common/__vcosf.c
114
z##N = y##N * y##N; \
usr/src/lib/libmvec/common/__vcosf.c
115
if (n##N & 1) { /* compute cos y */ \
usr/src/lib/libmvec/common/__vcosf.c
116
f##N = (float)(one + z##N * (mhalf + z##N * \
usr/src/lib/libmvec/common/__vcosf.c
117
(C0 + z##N * (C1 + z##N * C2)))); \
usr/src/lib/libmvec/common/__vcosf.c
119
f##N = (float)(y##N + y##N * z##N * (S0 + \
usr/src/lib/libmvec/common/__vcosf.c
120
z##N * (S1 + z##N * S2))); \
usr/src/lib/libmvec/common/__vcosf.c
122
y[index] = (n##N & 2)? -f##N : f##N; \
usr/src/lib/libmvec/common/__vcosf.c
126
#define PROCESS(N) \
usr/src/lib/libmvec/common/__vcosf.c
128
z##N = y##N * invpio2 + c3two51; \
usr/src/lib/libmvec/common/__vcosf.c
129
n##N = LO(z##N) + 1; \
usr/src/lib/libmvec/common/__vcosf.c
130
z##N -= c3two51; \
usr/src/lib/libmvec/common/__vcosf.c
131
y##N = (y##N - z##N * pio2_1) - z##N * pio2_t; \
usr/src/lib/libmvec/common/__vcosf.c
133
z##N = y##N * y##N; \
usr/src/lib/libmvec/common/__vcosf.c
134
if (n##N & 1) { /* compute cos y */ \
usr/src/lib/libmvec/common/__vcosf.c
135
f##N = (float)(one + z##N * (mhalf + z##N * (C0 + \
usr/src/lib/libmvec/common/__vcosf.c
136
z##N * (C1 + z##N * C2)))); \
usr/src/lib/libmvec/common/__vcosf.c
138
f##N = (float)(y##N + y##N * z##N * (S0 + z##N * (S1 + \
usr/src/lib/libmvec/common/__vcosf.c
139
z##N * S2))); \
usr/src/lib/libmvec/common/__vcosf.c
141
*y = (n##N & 2)? -f##N : f##N; \
usr/src/lib/libmvec/common/__vcosf.c
89
#define PREPROCESS(N, index, label) \
usr/src/lib/libmvec/common/__vcosf.c
99
y##N = (double)t; \
usr/src/lib/libmvec/common/__vexp.c
363
#define PROCESS(N) \
usr/src/lib/libmvec/common/__vexp.c
364
y##N = (x##N * invln2_256) + round; \
usr/src/lib/libmvec/common/__vexp.c
365
j##N = LO(y##N); \
usr/src/lib/libmvec/common/__vexp.c
366
y##N -= round; \
usr/src/lib/libmvec/common/__vexp.c
367
k##N = j##N >> 8; \
usr/src/lib/libmvec/common/__vexp.c
368
j##N = (j##N & 0xff) << 1; \
usr/src/lib/libmvec/common/__vexp.c
369
x##N = (x##N - y##N * ln2_256h) - y##N * ln2_256l; \
usr/src/lib/libmvec/common/__vexp.c
370
y##N = x##N * (one + x##N * (B1 + x##N * (B2 + x##N * B3))); \
usr/src/lib/libmvec/common/__vexp.c
371
t##N = TBL[j##N]; \
usr/src/lib/libmvec/common/__vexp.c
372
y##N = t##N + (TBL[j##N + 1] + t##N * y##N); \
usr/src/lib/libmvec/common/__vexp.c
373
if (k##N < -1021) { \
usr/src/lib/libmvec/common/__vexp.c
374
HI(y##N) += (k##N + 0x3ef) << 20; \
usr/src/lib/libmvec/common/__vexp.c
375
y##N *= tiny; \
usr/src/lib/libmvec/common/__vexp.c
377
HI(y##N) += k##N << 20; \
usr/src/lib/libmvec/common/__vexp.c
379
*y = y##N; \
usr/src/lib/libmvec/common/__vexp.c
382
#define PREPROCESS(N, index, label) \
usr/src/lib/libmvec/common/__vexp.c
385
x##N = *x; \
usr/src/lib/libmvec/common/__vexp.c
389
y[index] = (x##N == neginf)? zero : \
usr/src/lib/libmvec/common/__vexp.c
390
x##N * x##N; \
usr/src/lib/libmvec/common/__vexp.c
393
if (x##N > othresh) { \
usr/src/lib/libmvec/common/__vexp.c
397
if (x##N < uthresh) { \
usr/src/lib/libmvec/common/__vexp.c
402
y[index] = one + x##N; \
usr/src/lib/libmvec/common/__vexpf.c
170
#define PROCESS(N) \
usr/src/lib/libmvec/common/__vexpf.c
171
x##N *= K256ONLN2; \
usr/src/lib/libmvec/common/__vexpf.c
172
k##N = (int) x##N; \
usr/src/lib/libmvec/common/__vexpf.c
173
x##N -= (double) k##N; \
usr/src/lib/libmvec/common/__vexpf.c
174
x##N = (KA2 * x##N + KA1) * x##N + KA0; \
usr/src/lib/libmvec/common/__vexpf.c
175
lres##N = ((long long *)__TBL_exp2f)[k##N & 0xff]; \
usr/src/lib/libmvec/common/__vexpf.c
176
lres##N += (long long)k##N << 44; \
usr/src/lib/libmvec/common/__vexpf.c
177
*y = (float) (x##N * *(double *)&lres##N); \
usr/src/lib/libmvec/common/__vexpf.c
182
#define PREPROCESS(N, index, label) \
usr/src/lib/libmvec/common/__vexpf.c
206
x##N = fx
usr/src/lib/libmvec/common/__vexpf.c
210
#define PREPROCESS(N, index, label) \
usr/src/lib/libmvec/common/__vexpf.c
232
x##N = fx
usr/src/lib/libmvec/common/__vlog.c
617
#define PROCESS(N) \
usr/src/lib/libmvec/common/__vlog.c
618
i##N = (i##N + 0x800) & ~0xfff; \
usr/src/lib/libmvec/common/__vlog.c
619
e = (i##N & 0x7ff00000) - 0x3ff00000; \
usr/src/lib/libmvec/common/__vlog.c
620
z##N.i[HIWORD] -= e; \
usr/src/lib/libmvec/common/__vlog.c
621
w##N.i[HIWORD] = i##N - e; \
usr/src/lib/libmvec/common/__vlog.c
622
w##N.i[LOWORD] = 0; \
usr/src/lib/libmvec/common/__vlog.c
623
n##N += (e >> 20); \
usr/src/lib/libmvec/common/__vlog.c
624
i##N = (i##N >> 10) & 0x3fc; \
usr/src/lib/libmvec/common/__vlog.c
625
d##N = z##N.d - w##N.d; \
usr/src/lib/libmvec/common/__vlog.c
626
h##N = d##N * TBL[i##N]; \
usr/src/lib/libmvec/common/__vlog.c
627
l##N = d##N * TBL[i##N+1]; \
usr/src/lib/libmvec/common/__vlog.c
628
s##N = h##N + l##N; \
usr/src/lib/libmvec/common/__vlog.c
629
b##N = (s##N * s##N) * (mhalf + s##N * (P3 + s##N * (P4 + \
usr/src/lib/libmvec/common/__vlog.c
630
s##N * (P5 + s##N * P6)))); \
usr/src/lib/libmvec/common/__vlog.c
631
*y = (n##N * ln2hi + TBL[i##N+2]) + (h##N + (l##N + \
usr/src/lib/libmvec/common/__vlog.c
632
(n##N * ln2lo + TBL[i##N+3]) + b##N)); \
usr/src/lib/libmvec/common/__vlog.c
635
#define PREPROCESS(N, index, label) \
usr/src/lib/libmvec/common/__vlog.c
636
i##N = HI(*x); \
usr/src/lib/libmvec/common/__vlog.c
637
z##N.d = *x; \
usr/src/lib/libmvec/common/__vlog.c
639
n##N = 0; \
usr/src/lib/libmvec/common/__vlog.c
640
if ((i##N & 0x7ff00000) == 0x7ff00000) { /* inf or NaN */ \
usr/src/lib/libmvec/common/__vlog.c
641
y[index] = z##N.d * ((i##N < 0)? zero : z##N.d); \
usr/src/lib/libmvec/common/__vlog.c
643
} else if (i##N < 0x00100000) { /* subnormal, negative, zero */ \
usr/src/lib/libmvec/common/__vlog.c
644
if (((i##N << 1) | z##N.i[LOWORD]) == 0) { \
usr/src/lib/libmvec/common/__vlog.c
647
} else if (i##N < 0) { \
usr/src/lib/libmvec/common/__vlog.c
651
z##N.d *= two52; \
usr/src/lib/libmvec/common/__vlog.c
652
n##N = -52; \
usr/src/lib/libmvec/common/__vlog.c
653
i##N = z##N.i[HIWORD]; \
usr/src/lib/libmvec/common/__vlogf.c
105
#define PROCESS(N) \
usr/src/lib/libmvec/common/__vlogf.c
106
iy##N = ival##N & 0x007fffff; \
usr/src/lib/libmvec/common/__vlogf.c
107
ival##N = (iy##N + 0x20000) & 0xfffc0000; \
usr/src/lib/libmvec/common/__vlogf.c
108
i##N = ival##N >> 17; \
usr/src/lib/libmvec/common/__vlogf.c
109
iy##N = iy##N - ival##N; \
usr/src/lib/libmvec/common/__vlogf.c
110
ty##N = LN2 * (double) exp##N + __TBL_logf[i##N]; \
usr/src/lib/libmvec/common/__vlogf.c
111
yy##N = (double) iy##N * __TBL_logf[i##N + 1]; \
usr/src/lib/libmvec/common/__vlogf.c
112
yy##N = ((K3 * yy##N + K2) * yy##N + K1) * yy##N * yy##N + yy##N; \
usr/src/lib/libmvec/common/__vlogf.c
113
y[0] = (float)(yy##N + ty##N); \
usr/src/lib/libmvec/common/__vlogf.c
116
#define PREPROCESS(N, index, label) \
usr/src/lib/libmvec/common/__vlogf.c
117
ival##N = *(int*)x; \
usr/src/lib/libmvec/common/__vlogf.c
120
exp##N = (ival##N >> 23) - 127; \
usr/src/lib/libmvec/common/__vlogf.c
121
if ((ival##N & 0x7fffffff) >= 0x7f800000) /* X = NaN or Inf */ \
usr/src/lib/libmvec/common/__vlogf.c
126
if (ival##N < 0x00800000) \
usr/src/lib/libmvec/common/__vlogf.c
128
if (ival##N > 0) /* X = denormal */ \
usr/src/lib/libmvec/common/__vlogf.c
130
value = (float) ival##N; \
usr/src/lib/libmvec/common/__vlogf.c
131
ival##N = *(int*) &value; \
usr/src/lib/libmvec/common/__vlogf.c
132
exp##N = (ival##N >> 23) - (127 + 149); \
usr/src/lib/libmvec/common/__vlogf.c
137
y[index] = ((ival##N & 0x7fffffff) == 0) ? \
usr/src/lib/libmvec/common/__vsincosf.c
100
y##N = (double)t; \
usr/src/lib/libmvec/common/__vsincosf.c
101
n##N = 0; \
usr/src/lib/libmvec/common/__vsincosf.c
103
y##N = (double)t; \
usr/src/lib/libmvec/common/__vsincosf.c
110
z##N = y##N = (double)t; \
usr/src/lib/libmvec/common/__vsincosf.c
111
hx = HI(y##N); \
usr/src/lib/libmvec/common/__vsincosf.c
112
n##N = ((hx >> 20) & 0x7ff) - 1046; \
usr/src/lib/libmvec/common/__vsincosf.c
113
HI(z##N) = (hx & 0xfffff) | 0x41600000; \
usr/src/lib/libmvec/common/__vsincosf.c
114
n##N = __vlibm_rem_pio2m(&z##N, &y##N, n##N, 1, 0); \
usr/src/lib/libmvec/common/__vsincosf.c
116
y##N = -y##N; \
usr/src/lib/libmvec/common/__vsincosf.c
117
n##N = -n##N; \
usr/src/lib/libmvec/common/__vsincosf.c
119
z##N = y##N * y##N; \
usr/src/lib/libmvec/common/__vsincosf.c
120
f##N = (float)(y##N + y##N * z##N * (S0 + z##N * \
usr/src/lib/libmvec/common/__vsincosf.c
121
(S1 + z##N * S2))); \
usr/src/lib/libmvec/common/__vsincosf.c
122
g##N = (float)(one + z##N * (mhalf + z##N * (C0 + \
usr/src/lib/libmvec/common/__vsincosf.c
123
z##N * (C1 + z##N * C2)))); \
usr/src/lib/libmvec/common/__vsincosf.c
124
if (n##N & 2) { \
usr/src/lib/libmvec/common/__vsincosf.c
125
f##N = -f##N; \
usr/src/lib/libmvec/common/__vsincosf.c
126
g##N = -g##N; \
usr/src/lib/libmvec/common/__vsincosf.c
128
if (n##N & 1) { \
usr/src/lib/libmvec/common/__vsincosf.c
129
s[sindex] = g##N; \
usr/src/lib/libmvec/common/__vsincosf.c
130
c[cindex] = -f##N; \
usr/src/lib/libmvec/common/__vsincosf.c
132
s[sindex] = f##N; \
usr/src/lib/libmvec/common/__vsincosf.c
133
c[cindex] = g##N; \
usr/src/lib/libmvec/common/__vsincosf.c
138
#define PROCESS(N) \
usr/src/lib/libmvec/common/__vsincosf.c
140
z##N = y##N * invpio2 + c3two51; \
usr/src/lib/libmvec/common/__vsincosf.c
141
n##N = LO(z##N); \
usr/src/lib/libmvec/common/__vsincosf.c
142
z##N -= c3two51; \
usr/src/lib/libmvec/common/__vsincosf.c
143
y##N = (y##N - z##N * pio2_1) - z##N * pio2_t; \
usr/src/lib/libmvec/common/__vsincosf.c
145
z##N = y##N * y##N; \
usr/src/lib/libmvec/common/__vsincosf.c
146
f##N = (float)(y##N + y##N * z##N * (S0 + z##N * (S1 + z##N * S2)));\
usr/src/lib/libmvec/common/__vsincosf.c
147
g##N = (float)(one + z##N * (mhalf + z##N * (C0 + z##N * \
usr/src/lib/libmvec/common/__vsincosf.c
148
(C1 + z##N * C2)))); \
usr/src/lib/libmvec/common/__vsincosf.c
149
if (n##N & 2) { \
usr/src/lib/libmvec/common/__vsincosf.c
150
f##N = -f##N; \
usr/src/lib/libmvec/common/__vsincosf.c
151
g##N = -g##N; \
usr/src/lib/libmvec/common/__vsincosf.c
153
if (n##N & 1) { \
usr/src/lib/libmvec/common/__vsincosf.c
154
*s = g##N; \
usr/src/lib/libmvec/common/__vsincosf.c
155
*c = -f##N; \
usr/src/lib/libmvec/common/__vsincosf.c
157
*s = f##N; \
usr/src/lib/libmvec/common/__vsincosf.c
158
*c = g##N; \
usr/src/lib/libmvec/common/__vsincosf.c
89
#define PREPROCESS(N, sindex, cindex, label) \
usr/src/lib/libmvec/common/__vsinf.c
100
n##N = 0; \
usr/src/lib/libmvec/common/__vsinf.c
102
y##N = (double)t; \
usr/src/lib/libmvec/common/__vsinf.c
109
z##N = y##N = (double)t; \
usr/src/lib/libmvec/common/__vsinf.c
110
hx = HI(y##N); \
usr/src/lib/libmvec/common/__vsinf.c
111
n##N = ((hx >> 20) & 0x7ff) - 1046; \
usr/src/lib/libmvec/common/__vsinf.c
112
HI(z##N) = (hx & 0xfffff) | 0x41600000; \
usr/src/lib/libmvec/common/__vsinf.c
113
n##N = __vlibm_rem_pio2m(&z##N, &y##N, n##N, 1, 0); \
usr/src/lib/libmvec/common/__vsinf.c
115
y##N = -y##N; \
usr/src/lib/libmvec/common/__vsinf.c
116
n##N = -n##N; \
usr/src/lib/libmvec/common/__vsinf.c
118
z##N = y##N * y##N; \
usr/src/lib/libmvec/common/__vsinf.c
119
if (n##N & 1) { /* compute cos y */ \
usr/src/lib/libmvec/common/__vsinf.c
120
f##N = (float)(one + z##N * (mhalf + z##N * \
usr/src/lib/libmvec/common/__vsinf.c
121
(C0 + z##N * (C1 + z##N * C2)))); \
usr/src/lib/libmvec/common/__vsinf.c
123
f##N = (float)(y##N + y##N * z##N * (S0 + \
usr/src/lib/libmvec/common/__vsinf.c
124
z##N * (S1 + z##N * S2))); \
usr/src/lib/libmvec/common/__vsinf.c
126
y[index] = (n##N & 2)? -f##N : f##N; \
usr/src/lib/libmvec/common/__vsinf.c
130
#define PROCESS(N) \
usr/src/lib/libmvec/common/__vsinf.c
132
z##N = y##N * invpio2 + c3two51; \
usr/src/lib/libmvec/common/__vsinf.c
133
n##N = LO(z##N); \
usr/src/lib/libmvec/common/__vsinf.c
134
z##N -= c3two51; \
usr/src/lib/libmvec/common/__vsinf.c
135
y##N = (y##N - z##N * pio2_1) - z##N * pio2_t; \
usr/src/lib/libmvec/common/__vsinf.c
137
z##N = y##N * y##N; \
usr/src/lib/libmvec/common/__vsinf.c
138
if (n##N & 1) { /* compute cos y */ \
usr/src/lib/libmvec/common/__vsinf.c
139
f##N = (float)(one + z##N * (mhalf + z##N * (C0 + \
usr/src/lib/libmvec/common/__vsinf.c
140
z##N * (C1 + z##N * C2)))); \
usr/src/lib/libmvec/common/__vsinf.c
142
f##N = (float)(y##N + y##N * z##N * (S0 + z##N * (S1 + \
usr/src/lib/libmvec/common/__vsinf.c
143
z##N * S2))); \
usr/src/lib/libmvec/common/__vsinf.c
145
*y = (n##N & 2)? -f##N : f##N; \
usr/src/lib/libmvec/common/__vsinf.c
89
#define PREPROCESS(N, index, label) \
usr/src/lib/libmvec/common/__vsinf.c
99
y##N = (double)t; \
usr/src/lib/libsqlite/src/btree.c
3223
int N, /* Expected number of pages in the list */
usr/src/lib/libsqlite/src/btree.c
3228
while( N-- > 0 ){
usr/src/lib/libsqlite/src/btree.c
3231
sprintf(zMsg, "%d pages missing from overflow list", N+1);
usr/src/lib/libsqlite/src/btree.c
3247
N -= n;
usr/src/lib/libsqlite/src/date.c
100
N = va_arg(ap, int);
usr/src/lib/libsqlite/src/date.c
106
while( N-- ){
usr/src/lib/libsqlite/src/date.c
92
int N;
usr/src/lib/libsqlite/src/pager.c
130
# define CODEC(P,D,N,X) if( P->xCodec ){ P->xCodec(P->pCodecArg,D,N,X); }
usr/src/lib/libsqlite/src/pager.c
132
# define CODEC(P,D,N,X)
usr/src/lib/libsqlite/src/parse.y
369
seltablist(A) ::= stl_prefix(X) nm(Y) dbnm(D) as(Z) on_opt(N) using_opt(U). {
usr/src/lib/libsqlite/src/parse.y
372
if( N ){
usr/src/lib/libsqlite/src/parse.y
373
if( A && A->nSrc>1 ){ A->a[A->nSrc-2].pOn = N; }
usr/src/lib/libsqlite/src/parse.y
374
else { sqliteExprDelete(N); }
usr/src/lib/libsqlite/src/parse.y
382
as(Z) on_opt(N) using_opt(U). {
usr/src/lib/libsqlite/src/parse.y
386
if( N ){
usr/src/lib/libsqlite/src/parse.y
387
if( A && A->nSrc>1 ){ A->a[A->nSrc-2].pOn = N; }
usr/src/lib/libsqlite/src/parse.y
388
else { sqliteExprDelete(N); }
usr/src/lib/libsqlite/src/parse.y
422
on_opt(N) ::= ON expr(E). {N = E;}
usr/src/lib/libsqlite/src/parse.y
423
on_opt(N) ::= . {N = 0;}
usr/src/lib/libsqlite/src/random.c
90
void sqliteRandomness(int N, void *pBuf){
usr/src/lib/libsqlite/src/random.c
93
while( N-- ){
usr/src/lib/libsqlite/src/tclsqlite.c
617
int N;
usr/src/lib/libsqlite/src/tclsqlite.c
618
if( TCL_OK!=Tcl_GetIntFromObj(interp, objv[2], &N) ){
usr/src/lib/libsqlite/src/tclsqlite.c
634
sqlite_progress_handler(pDb->db, N, DbProgressHandler, pDb);
usr/src/lib/libsqlite/src/test1.c
790
int N = 0;
usr/src/lib/libsqlite/src/test1.c
799
rc = sqlite_step(vm, argc>=3?&N:0, argc>=4?&azValue:0, argc==5?&azColName:0);
usr/src/lib/libsqlite/src/test1.c
801
sprintf(zBuf, "%d", N);
usr/src/lib/libsqlite/src/test1.c
807
for(i=0; i<N; i++){
usr/src/lib/libsqlite/src/test1.c
816
for(i=0; i<N*2; i++){
usr/src/lib/libsqlite/src/util.c
106
assert( N>=0 && N<n );
usr/src/lib/libsqlite/src/util.c
509
int sqliteStrNICmp(const char *zLeft, const char *zRight, int N){
usr/src/lib/libsqlite/src/util.c
513
while( N-- > 0 && *a!=0 && UpperToLower[*a]==UpperToLower[*b]){ a++; b++; }
usr/src/lib/libsqlite/src/util.c
514
return N<0 ? 0 : UpperToLower[*a] - UpperToLower[*b];
usr/src/lib/libsqlite/src/util.c
98
void sqliteCheckMemory(void *p, int N){
usr/src/lib/libsqlite/src/vdbe.c
278
static void popStack(Mem **ppTos, int N){
usr/src/lib/libsqlite/src/vdbe.c
280
while( N>0 ){
usr/src/lib/libsqlite/src/vdbe.c
281
N--;
usr/src/lib/libsqlite/src/vdbe.h
95
void sqliteVdbeChangeP3(Vdbe*, int addr, const char *zP1, int N);
usr/src/lib/libsqlite/tool/lemon.c
420
#define acttab_yyaction(X,N) ((X)->aAction[N].action)
usr/src/lib/libsqlite/tool/lemon.c
423
#define acttab_yylookahead(X,N) ((X)->aAction[N].lookahead)
usr/src/lib/libxcurses/h/posix/mkslocal.h
177
#define DEF_NLSPATH "/lib/nls/locale/%L/%N.cat"
usr/src/test/crypto-tests/tests/digest/parser_runner.c
310
uint8_t N[1024];
usr/src/test/crypto-tests/tests/digest/parser_runner.c
315
.out = N,
usr/src/test/crypto-tests/tests/digest/parser_runner.c
316
.outlen = sizeof (N),
usr/src/test/crypto-tests/tests/hmac/main.c
46
uint8_t N[1024];
usr/src/test/crypto-tests/tests/hmac/main.c
48
.out = N,
usr/src/test/crypto-tests/tests/hmac/main.c
49
.outlen = sizeof (N),
usr/src/test/crypto-tests/tests/modes/aes/cbc/aes_cbc.c
33
uint8_t N[1024];
usr/src/test/crypto-tests/tests/modes/aes/cbc/aes_cbc.c
35
.out = N,
usr/src/test/crypto-tests/tests/modes/aes/cbc/aes_cbc.c
36
.outlen = sizeof (N),
usr/src/test/crypto-tests/tests/modes/aes/cbc_pad/aes_cbc_pad.c
41
uint8_t N[1024];
usr/src/test/crypto-tests/tests/modes/aes/cbc_pad/aes_cbc_pad.c
43
.out = N,
usr/src/test/crypto-tests/tests/modes/aes/cbc_pad/aes_cbc_pad.c
44
.outlen = sizeof (N),
usr/src/test/crypto-tests/tests/modes/aes/ccm/aes_ccm.c
40
uint8_t N[1024];
usr/src/test/crypto-tests/tests/modes/aes/ccm/aes_ccm.c
44
.out = N,
usr/src/test/crypto-tests/tests/modes/aes/ccm/aes_ccm.c
45
.outlen = sizeof (N),
usr/src/test/crypto-tests/tests/modes/aes/cmac/aes_cmac.c
33
uint8_t N[AES_BLOCK_LEN];
usr/src/test/crypto-tests/tests/modes/aes/cmac/aes_cmac.c
36
.out = N,
usr/src/test/crypto-tests/tests/modes/aes/cmac/aes_cmac.c
37
.outlen = sizeof (N),
usr/src/test/crypto-tests/tests/modes/aes/ctr/aes_ctr.c
37
uint8_t N[1024];
usr/src/test/crypto-tests/tests/modes/aes/ctr/aes_ctr.c
44
.out = N,
usr/src/test/crypto-tests/tests/modes/aes/ctr/aes_ctr.c
45
.outlen = sizeof (N),
usr/src/test/crypto-tests/tests/modes/aes/ecb/aes_ecb.c
32
uint8_t N[1024];
usr/src/test/crypto-tests/tests/modes/aes/ecb/aes_ecb.c
36
.out = N,
usr/src/test/crypto-tests/tests/modes/aes/ecb/aes_ecb.c
37
.outlen = sizeof (N),
usr/src/test/crypto-tests/tests/modes/aes/gcm/aes_gcm.c
35
uint8_t N[1024];
usr/src/test/crypto-tests/tests/modes/aes/gcm/aes_gcm.c
46
.out = N,
usr/src/test/crypto-tests/tests/modes/aes/gcm/aes_gcm.c
47
.outlen = sizeof (N),
usr/src/test/crypto-tests/tests/modes/aes/gmac/aes_gmac.c
48
uint8_t N[1024];
usr/src/test/crypto-tests/tests/modes/aes/gmac/aes_gmac.c
52
.out = N,
usr/src/test/crypto-tests/tests/modes/aes/gmac/aes_gmac.c
53
.outlen = sizeof (N),
usr/src/test/crypto-tests/tests/modes/aes/gmac/aes_gmac_enc.c
51
uint8_t N[1024];
usr/src/test/crypto-tests/tests/modes/aes/gmac/aes_gmac_enc.c
55
.out = N,
usr/src/test/crypto-tests/tests/modes/aes/gmac/aes_gmac_enc.c
56
.outlen = sizeof (N),
usr/src/tools/cscope-fast/cgrep.c
204
#define NEW(N) (froot?(t = froot, froot = froot->next, t->next = NULL, \
usr/src/tools/cscope-fast/cgrep.c
205
t->node = N, t): newlink(0, N))
usr/src/tools/cscope-fast/cgrep.c
206
#define ADD(N) if (qtail) qtail = qtail->next = NEW(N); \
usr/src/tools/cscope-fast/cgrep.c
207
else qtail = qhead = NEW(N)
usr/src/tools/smatch/src/opcode.c
26
#define OPCODE(OP,NG,SW,TF,N,FL) \
usr/src/tools/smatch/src/opcode.c
31
.arity = N, \
usr/src/tools/smatch/src/test-sort.c
21
const int N = argv[1] ? atoi (argv[1]) : 10000;
usr/src/tools/smatch/src/test-sort.c
23
srand (N);
usr/src/tools/smatch/src/test-sort.c
27
for (i = 0; i < N; i++) {
usr/src/tools/smatch/src/validation/mem2reg/quadra00.c
1
#define TEST(N) \
usr/src/tools/smatch/src/validation/mem2reg/quadra00.c
3
d = b + a[N]; \
usr/src/tools/smatch/src/validation/repeat.h
24
#define REPEAT2(N, P) REPEAT_(R##N,P)
usr/src/tools/smatch/src/validation/type-attribute-align.c
1
#define __aligned(N) __attribute__((aligned(N)))
usr/src/tools/smatch/src/validation/vla-sizeof0.c
6
T a[(1,N)];
usr/src/tools/smatch/src/validation/vla-sizeof0.c
8
return sizeof(a) == (N * sizeof(T));
usr/src/tools/smatch/src/validation/vla-sizeof1.c
6
T a[(x,N)];
usr/src/tools/smatch/src/validation/vla-sizeof1.c
8
return sizeof(a) == (N * sizeof(T));
usr/src/tools/smatch/src/validation/vla-sizeof3.c
6
T a[x][N];
usr/src/tools/smatch/src/validation/vla-sizeof3.c
8
return sizeof(a) == (N * x * sizeof(T));
usr/src/uts/common/fs/zfs/hkdf.c
109
for (i = 1; i <= N; i++) {
usr/src/uts/common/fs/zfs/hkdf.c
140
(i != N) ? SHA512_DIGEST_LENGTH : (out_len - pos));
usr/src/uts/common/fs/zfs/hkdf.c
76
uint_t N = (out_len + SHA512_DIGEST_LENGTH) / SHA512_DIGEST_LENGTH;
usr/src/uts/common/fs/zfs/hkdf.c
79
if (N > 255)
usr/src/uts/common/fs/zfs/vdev_raidz_math_avx2.c
33
#define _REG_CNT(_0, _1, _2, _3, _4, _5, _6, _7, N, ...) N
usr/src/uts/common/fs/zfs/vdev_raidz_math_sse2.c
35
#define _REG_CNT(_0, _1, _2, _3, _4, _5, _6, _7, N, ...) N
usr/src/uts/common/fs/zfs/vdev_raidz_math_ssse3.c
34
#define _REG_CNT(_0, _1, _2, _3, _4, _5, _6, _7, N, ...) N
usr/src/uts/common/inet/ipf/drand48.c
104
return ((long)((int32_t)x[2] << (N - 1)) + (x[1] >> 1));
usr/src/uts/common/inet/ipf/drand48.c
118
return ((long)((int32_t)x[2] << N) + x[1]);
usr/src/uts/common/inet/ipf/drand48.c
67
#define MASK ((unsigned)(1 << (N - 1)) + (1 << (N - 1)) - 1)
usr/src/uts/common/inet/ipf/drand48.c
69
#define HIGH(x) LOW((x) >> N)
usr/src/uts/common/io/audio/drv/audioens/audioens.c
289
unsigned short N, truncM, truncStart;
usr/src/uts/common/io/audio/drv/audioens/audioens.c
318
N = rate / 3000U;
usr/src/uts/common/io/audio/drv/audioens/audioens.c
319
if (N == 15 || N == 13 || N == 11 || N == 9)
usr/src/uts/common/io/audio/drv/audioens/audioens.c
320
--N;
usr/src/uts/common/io/audio/drv/audioens/audioens.c
323
truncM = (21 * N - 1) | 1;
usr/src/uts/common/io/audio/drv/audioens/audioens.c
330
(truncStart << 9) | (N << 4));
usr/src/uts/common/io/audio/drv/audioens/audioens.c
337
0x8000U | (truncStart << 9) | (N << 4));
usr/src/uts/common/io/audio/drv/audioens/audioens.c
341
freq = ((48000UL << 16) / rate) * N;
usr/src/uts/common/io/audio/drv/audioens/audioens.c
348
SRCRegWrite(dev, SRC_ADC_VOL_L, N << 8);
usr/src/uts/common/io/audio/drv/audioens/audioens.c
349
SRCRegWrite(dev, SRC_ADC_VOL_R, N << 8);
usr/src/uts/common/io/hme/hme_mac.h
646
register int N = n / HMEWAITPERIOD; \
usr/src/uts/common/io/hme/hme_mac.h
647
while (--N > 0) { \
usr/src/uts/common/io/mii/mii_other.c
67
#define IDN(MFG, N, MODEL, DESC) \
usr/src/uts/common/io/mii/mii_other.c
68
{ MII_OUI_##MFG##_##N, MII_MODEL_##MFG##_##MODEL, DESC }
usr/src/uts/common/io/mwl/mwl.c
741
if (ac >= N(sc->sc_ac2q)) {
usr/src/uts/common/io/mwl/mwl.c
744
ac, (uint_t)N(sc->sc_ac2q));
usr/src/uts/common/io/ntxn/unm_inc.h
1347
#define PEG_NETWORK_BASE(N) (UNM_CRB_PEG_NET_0 + (((N)&3) << 20))
usr/src/uts/common/io/ral/rt2560.c
1853
for (i = 0; i < N(rt2560_def_bbp); i++) {
usr/src/uts/common/io/ral/rt2560.c
1956
for (i = 0; i < N(rt2560_def_mac); i++)
usr/src/uts/common/io/rwd/rt2661.c
2196
for (i = 0; i < N(rt2661_def_bbp); i++) {
usr/src/uts/common/io/rwd/rt2661.c
2475
for (i = 0; i < N(rt2661_def_mac); i++)
usr/src/uts/common/io/rwd/rt2661.c
2528
for (i = 0; i < N(sta); i++) {
usr/src/uts/common/io/rwn/rt2860.c
2341
for (i = 0; i < N(rt2860_def_mac); i++)
usr/src/uts/common/io/uath/uath.c
634
if (code < N(names))
usr/src/uts/common/io/urtw/urtw.c
1890
for (i = 0; i < N(urtw_ratetable); i++) {
usr/src/uts/common/io/urtw/urtw.c
1904
for (i = 0; i < N(urtw_ratetable); i++) {
usr/src/uts/common/io/urtw/urtw.c
2335
for (i = 0; i < N(urtw_8225_rf_part1); i++) {
usr/src/uts/common/io/urtw/urtw.c
2374
for (i = 0; i < N(urtw_8225_rf_part2); i++) {
usr/src/uts/common/io/urtw/urtw.c
2385
for (i = 0; i < N(urtw_8225_rf_part3); i++) {
usr/src/uts/common/io/urtw/urtw.c
2712
for (i = 0; i < N(urtw_8225v2_rf_part1); i++) {
usr/src/uts/common/io/urtw/urtw.c
2783
for (i = 0; i < N(urtw_8225v2_rf_part2); i++) {
usr/src/uts/common/io/urtw/urtw.c
2794
for (i = 0; i < N(urtw_8225v2_rf_part3); i++) {
usr/src/uts/common/sys/fs/pc_label.h
110
#define getbyte(A, N) (((unsigned char *)(&(A)))[N])
usr/src/uts/common/sys/param.h
316
register int N = n; \
usr/src/uts/common/sys/param.h
317
while (--N > 0) { \
usr/src/uts/i86pc/boot/boot_keyboard_table.c
121
/* 47 */ 0x47 N, '7', NOP, NOP,
usr/src/uts/i86pc/boot/boot_keyboard_table.c
122
/* 48 */ 0x48 N, '8', NOP, NOP,
usr/src/uts/i86pc/boot/boot_keyboard_table.c
123
/* 49 */ 0x49 N, '9', NOP, NOP,
usr/src/uts/i86pc/boot/boot_keyboard_table.c
125
/* 4b */ 0x4b N, '4', NOP, NOP,
usr/src/uts/i86pc/boot/boot_keyboard_table.c
127
/* 4d */ 0x4d N, '6', NOP, NOP,
usr/src/uts/i86pc/boot/boot_keyboard_table.c
129
/* 4f */ 0x4f N, '1', NOP, NOP,
usr/src/uts/i86pc/boot/boot_keyboard_table.c
130
/* 50 */ 0x50 N, '2', NOP, NOP,
usr/src/uts/i86pc/boot/boot_keyboard_table.c
131
/* 51 */ 0x51 N, '3', NOP, NOP,
usr/src/uts/i86pc/boot/boot_keyboard_table.c
132
/* 52 */ 0x52 N, '0', NOP, NOP,
usr/src/uts/i86pc/boot/boot_keyboard_table.c
133
/* 53 */ 0x53 N, '.', REBOOT, REBOOT,
usr/src/uts/intel/sys/acpi/platform/acefi.h
238
_0,_1,_2,_3,_4,_5,_6,_7,_8,_9,_10,N,...) N
usr/src/uts/sun/io/eri/eri_mac.h
1329
register int N = n / ERI_WAITPERIOD; \
usr/src/uts/sun/io/eri/eri_mac.h
1330
while (--N > 0) { \
usr/src/uts/sun/io/eri/eri_mac.h
1339
register int N = n / ERI_WAITPERIOD; \
usr/src/uts/sun/io/eri/eri_mac.h
1343
while (--N > 0) { \