Home
last modified time | relevance | path

Searched refs:N (Results 1 – 25 of 498) sorted by relevance

12345678910>>...20

/titanic_44/usr/src/lib/libmvec/common/
H A D__vsincosf.c89 #define PREPROCESS(N, sindex, cindex, label) \ argument
100 y##N = (double)t; \
101 n##N = 0; \
103 y##N = (double)t; \
110 z##N = y##N = (double)t; \
111 hx = HI(y##N); \
112 n##N = ((hx >> 20) & 0x7ff) - 1046; \
113 HI(z##N) = (hx & 0xfffff) | 0x41600000; \
114 n##N = __vlibm_rem_pio2m(&z##N, &y##N, n##N, 1, 0); \
116 y##N = -y##N; \
[all …]
H A D__vlog.c617 #define PROCESS(N) \ argument
618 i##N = (i##N + 0x800) & ~0xfff; \
619 e = (i##N & 0x7ff00000) - 0x3ff00000; \
620 z##N.i[HIWORD] -= e; \
621 w##N.i[HIWORD] = i##N - e; \
622 w##N.i[LOWORD] = 0; \
623 n##N += (e >> 20); \
624 i##N = (i##N >> 10) & 0x3fc; \
625 d##N = z##N.d - w##N.d; \
626 h##N = d##N * TBL[i##N]; \
[all …]
H A D__vlogf.c105 #define PROCESS(N) \ argument
106 iy##N = ival##N & 0x007fffff; \
107 ival##N = (iy##N + 0x20000) & 0xfffc0000; \
108 i##N = ival##N >> 17; \
109 iy##N = iy##N - ival##N; \
110 ty##N = LN2 * (double) exp##N + __TBL_logf[i##N]; \
111 yy##N = (double) iy##N * __TBL_logf[i##N + 1]; \
112 yy##N = ((K3 * yy##N + K2) * yy##N + K1) * yy##N * yy##N + yy##N; \
113 y[0] = (float)(yy##N + ty##N); \
116 #define PREPROCESS(N, index, label) \ argument
[all …]
H A D__vsinf.c89 #define PREPROCESS(N, index, label) \ argument
99 y##N = (double)t; \
100 n##N = 0; \
102 y##N = (double)t; \
109 z##N = y##N = (double)t; \
110 hx = HI(y##N); \
111 n##N = ((hx >> 20) & 0x7ff) - 1046; \
112 HI(z##N) = (hx & 0xfffff) | 0x41600000; \
113 n##N = __vlibm_rem_pio2m(&z##N, &y##N, n##N, 1, 0); \
115 y##N = -y##N; \
[all …]
H A D__vexp.c363 #define PROCESS(N) \ argument
364 y##N = (x##N * invln2_256) + round; \
365 j##N = LO(y##N); \
366 y##N -= round; \
367 k##N = j##N >> 8; \
368 j##N = (j##N & 0xff) << 1; \
369 x##N = (x##N - y##N * ln2_256h) - y##N * ln2_256l; \
370 y##N = x##N * (one + x##N * (B1 + x##N * (B2 + x##N * B3))); \
371 t##N = TBL[j##N]; \
372 y##N = t##N + (TBL[j##N + 1] + t##N * y##N); \
[all …]
H A D__vcosf.c89 #define PREPROCESS(N, index, label) \ argument
99 y##N = (double)t; \
100 n##N = 1; \
102 y##N = (double)t; \
109 z##N = y##N = (double)t; \
110 hx = HI(y##N); \
111 n##N = ((hx >> 20) & 0x7ff) - 1046; \
112 HI(z##N) = (hx & 0xfffff) | 0x41600000; \
113 n##N = __vlibm_rem_pio2m(&z##N, &y##N, n##N, 1, 0) + 1; \
114 z##N = y##N * y##N; \
[all …]
H A D__vexpf.c170 #define PROCESS(N) \ argument
171 x##N *= K256ONLN2; \
172 k##N = (int) x##N; \
173 x##N -= (double) k##N; \
174 x##N = (KA2 * x##N + KA1) * x##N + KA0; \
175 lres##N = ((long long *)__TBL_exp2f)[k##N & 0xff]; \
176 lres##N += (long long)k##N << 44; \
177 *y = (float) (x##N * *(double *)&lres##N); \
182 #define PREPROCESS(N, index, label) \ argument
206 x##N = fx
[all …]
/titanic_44/usr/src/cmd/stat/kstat/
H A Dkstat.h67 #define SAVE_HRTIME(I, S, N) \ argument
70 v.ui64 = S->N; \
71 nvpair_insert(I, #N, &v, KSTAT_DATA_UINT64); \
74 #define SAVE_INT32(I, S, N) \ argument
77 v.i32 = S->N; \
78 nvpair_insert(I, #N, &v, KSTAT_DATA_INT32); \
81 #define SAVE_UINT32(I, S, N) \ argument
84 v.ui32 = S->N; \
85 nvpair_insert(I, #N, &v, KSTAT_DATA_UINT32); \
88 #define SAVE_INT64(I, S, N) \ argument
[all …]
/titanic_44/usr/src/lib/libast/common/port/
H A Dastmath.c30 #if N >= 8
39 #if N & 1 in main()
44 #if N < 5 in main()
48 #if N == 1 in main()
51 #if N == 2 in main()
54 #if N == 3 in main()
57 #if N == 4 in main()
60 #if N == 5 in main()
63 #if N == 6 in main()
66 #if N == 7 in main()
[all …]
/titanic_44/usr/src/lib/libsqlite/test/
H A Dcapi2.test33 sqlite_step $VM N VALUES COLNAMES
36 set N
45 set N x
48 sqlite_step $VM N VALUES COLNAMES
51 list $N $VALUES $COLNAMES
54 set N x
57 sqlite_step $VM N VALUES COLNAMES
60 list $N $VALUES $COLNAMES
149 set N {}
152 list [sqlite_step $VM N VALUE COLNAME] [set N] [set VALUE] [set COLNAME]
[all …]
H A Dbtree4.test42 foreach N {10 100 1000} {
45 do_test btree4-$N.1 {
46 for {set i 1} {$i<=$N} {incr i} {
52 do_test btree4-$N.2 {
55 for {set i 2} {$i<=$N} {incr i} {
56 do_test btree-$N.3.$i.1 {
59 do_test btree-$N.3.$i.2 {
62 do_test btree-$N.3.$i.3 {
66 do_test btree4-$N.4 {
69 do_test btree4-$N.5 {
[all …]
H A Dbtree4rb.test40 foreach N {10 100 1000} {
43 do_test btree4rb-$N.1 {
44 for {set i 1} {$i<=$N} {incr i} {
50 do_test btree4rb-$N.2 {
53 for {set i 2} {$i<=$N} {incr i} {
54 do_test btree-$N.3.$i.1 {
57 do_test btree-$N.3.$i.2 {
60 do_test btree-$N.3.$i.3 {
64 do_test btree4rb-$N.4 {
67 do_test btree4rb-$N.5 {
[all …]
H A Djoin3_28.test26 for {set N 1} {$N<=40} {incr N} {
27 lappend result $N
28 do_test join3-1.$N {
29 execsql "CREATE TABLE t${N}(x);"
30 execsql "INSERT INTO t$N VALUES($N)"
32 for {set i 2} {$i<=$N} {incr i} {append sql ", t$i"}
/titanic_44/usr/src/lib/krb5/plugins/kdb/db2/libdb2/hash/
H A Dpage.h56 #define HI(N) ((u_int16_t)(((N) & HI_MASK) >> 16)) argument
57 #define LO(N) ((u_int16_t)((N) & LO_MASK)) argument
123 #define DATA_OFF(P, N) \ argument
124 REFERENCE(P, indx_t, PAGE_OVERHEAD + N * PAIR_OVERHEAD + sizeof(indx_t))
125 #define KEY_OFF(P, N) \ argument
126 REFERENCE(P, indx_t, PAGE_OVERHEAD + N * PAIR_OVERHEAD)
128 #define KEY(P, N) (((PAGE8 *)(P)) + KEY_OFF((P), (N))) argument
129 #define DATA(P, N) (((PAGE8 *)(P)) + DATA_OFF((P), (N))) argument
142 #define PAGE_META(N) (((N) + 3) * sizeof(u_int16_t)) argument
144 #define ISBIG(N, P) (((N) > ((P)->hdr.bsize * MINFILL)) ? 1 : 0) argument
H A Dhash.h152 #define CLRBIT(A, N) ((A)[(N)/BITS_PER_MAP] &= ~(1<<((N)%BITS_PER_MAP))) argument
153 #define SETBIT(A, N) ((A)[(N)/BITS_PER_MAP] |= (1<<((N)%BITS_PER_MAP))) argument
154 #define ISSET(A, N) ((A)[(N)/BITS_PER_MAP] & (1<<((N)%BITS_PER_MAP))) argument
167 #define SPLITNUM(N) (((u_int32_t)(N)) >> SPLITSHIFT) argument
168 #define OPAGENUM(N) ((N) & SPLITMASK) argument
177 #define POW2(N) (1 << (N)) argument
/titanic_44/usr/src/common/mpi/
H A Dmpmontg.c102 i = MP_USED(T) + MP_USED(&mmm->N) + 2; in s_mp_redc()
104 for (i = 0; i < MP_USED(&mmm->N); ++i ) { in s_mp_redc()
107 MP_CHECKOK( s_mp_mul_d_add_offset(&mmm->N, m_i, T, i) ); in s_mp_redc()
114 if ((res = s_mp_cmp(T, &mmm->N)) >= 0) { in s_mp_redc()
116 MP_CHECKOK( s_mp_sub(T, &mmm->N) ); in s_mp_redc()
118 if ((res = mp_cmp(T, &mmm->N)) >= 0) { in s_mp_redc()
148 ib = MP_USED(a) + MP_MAX(MP_USED(b), MP_USED(&mmm->N)) + 2; in s_mp_mul_mont()
157 s_mp_mul_d_add_offset(&mmm->N, m_i, c, 0); in s_mp_mul_mont()
168 s_mp_mul_d_add_offset(&mmm->N, m_i, c, ib); in s_mp_mul_mont()
170 if (usedb < MP_USED(&mmm->N)) { in s_mp_mul_mont()
[all …]
/titanic_44/usr/src/cmd/refer/papers/
H A DRbstjissue5 %N 6
12 %A E. N. Pinson
16 %N 6
27 %N 6
36 %N 6
45 %N 6
55 %N 6
66 %N 6
77 %N 6
86 %N 6
[all …]
/titanic_44/usr/src/cmd/lp/filter/postscript/dpost/
H A Ddraw.c321 int i, N; in drawspline() local
373 for ( N = 2; N < sizeof(x)/sizeof(x[0]); N++ ) in drawspline()
374 if (fscanf(fp, "%d %d", &x[N], &y[N]) != 2) in drawspline()
380 for (i = 1; i < N; i++) { in drawspline()
385 x[N] = x[N-1]; in drawspline()
386 y[N] = y[N-1]; in drawspline()
388 for (i = ((flag!=1)?0:1); i < ((flag!=1)?N-1:N-2); i++) in drawspline()
391 hgoto(x[N]); /* where troff expects to be */ in drawspline()
392 vgoto(y[N]); in drawspline()
/titanic_44/usr/src/lib/libast/common/uwin/
H A Dlog.c92 #define N 128 macro
108 static double logF_head[N+1] = {
240 static double logF_tail[N+1] = {
410 j = N*(g-1) + .5;
411 F = (1.0/N) * j + 1; /* F*128 is an integer in [128, 512] */
439 u1 += m*logF_head[N] + logF_head[j]; /* exact */
441 u2 += logF_tail[N]*m;
472 j = (int)(N*(g-1) + .5);
473 F = (1.0/N) * j + 1;
486 u1 += m*logF_head[N] + logF_head[j];
[all …]
/titanic_44/usr/src/lib/libshell/common/tests/
H A Dexpand.sh111 set -- ~(N)/dev/null
113 set -- ~(N)/dev/non_existant_file
115 set -- ""~(N)/dev/non_existant_file
117 set -- ~(N)/dev/non_existant_file""
119 for i in ~(N)/dev/non_existent_file
122 for i in ""~(N)/dev/non_existent_file
/titanic_44/usr/src/lib/gss_mechs/mech_krb5/include/
H A Dport-sockets.h14 #define SG_ADVANCE(SG, N) \ argument
15 ((SG)->len < (N) \
17 : ((SG)->buf += (N), (SG)->len -= (N), 0))
21 #define SG_SET(SG, B, N) ((SG)->buf = (char *)(B),(SG)->len = (N)) argument
130 #define SG_ADVANCE(SG, N) \ argument
131 ((SG)->iov_len < (N) \
133 : ((SG)->iov_base = (char *) (SG)->iov_base + (N), \
134 (SG)->iov_len -= (N), 0))
/titanic_44/usr/src/uts/i86pc/boot/
H A Dboot_keyboard_table.c37 #define N | KBTYPE_NUMPAD macro
123 /* 47 */ 0x47 N, '7', NOP, NOP,
124 /* 48 */ 0x48 N, '8', NOP, NOP,
125 /* 49 */ 0x49 N, '9', NOP, NOP,
127 /* 4b */ 0x4b N, '4', NOP, NOP,
129 /* 4d */ 0x4d N, '6', NOP, NOP,
131 /* 4f */ 0x4f N, '1', NOP, NOP,
132 /* 50 */ 0x50 N, '2', NOP, NOP,
133 /* 51 */ 0x51 N, '3', NOP, NOP,
134 /* 52 */ 0x52 N, '0', NOP, NOP,
[all …]
/titanic_44/usr/src/cmd/sendmail/db/include/
H A Dhash.h171 #define ISBIG(I, N) (((N) > ((I)->hdr->pagesize / MINFILL)) ? 1 : 0) argument
183 #define PAIR_ISKEYBIG(N) (N & PAIR_KEYMASK) argument
184 #define PAIR_ISDATABIG(N) (N & PAIR_DATAMASK) argument
185 #define OPCODE_OF(N) (N & ~(PAIR_KEYMASK | PAIR_DATAMASK)) argument
/titanic_44/usr/src/lib/libmtmalloc/tests/
H A Dgeneral.c41 #define N 1000000 macro
65 int i = N; in be_thread()
66 char *bar[N]; in be_thread()
71 i = N; in be_thread()
/titanic_44/usr/src/uts/common/smbsrv/ndl/
H A Dndrtypes.ndl144 #define CASE_INFO_ENT(NAME,N) \
145 case N: size1 = sizeof (struct NAME##N); \
167 #define UNION_INFO_ENT(N,NAME) CASE(N) struct NAME##N info##N
168 #define UNION_INFO_PTR(N,NAME) CASE(N) struct NAME##N *info##N

12345678910>>...20