Home
last modified time | relevance | path

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

12345678910>>...25

/titanic_51/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
138 PROCESS(N) global() argument
[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
635 PREPROCESS(N,index,label) global() argument
[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; \
116 PREPROCESS(N,index,label) global() 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
130 PROCESS(N) global() argument
[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
382 PREPROCESS(N,index,label) global() argument
[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
126 PROCESS(N) global() argument
[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
182 PREPROCESS(N,index,label) global() argument
210 PREPROCESS(N,index,label) global() argument
[all...]
/titanic_51/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
95 SAVE_UINT64(I,S,N) global() argument
106 SAVE_STRING(I,S,N) global() argument
114 SAVE_HRTIME_X(I,N,V) global() argument
121 SAVE_INT32_X(I,N,V) global() argument
128 SAVE_UINT32_X(I,N,V) global() argument
135 SAVE_UINT64_X(I,N,V) global() argument
142 SAVE_STRING_X(I,N,V) global() argument
150 SAVE_CHAR_X(I,N,V) global() argument
[all...]
/titanic_51/usr/src/contrib/zlib/
H A Dcrc32.c31 A CRC of a message is computed on N braids of words in the message, where
32 each word consists of W bytes (4 or 8). If N is 3, for example, then three
36 of N * W bytes as are available have been processed. The results are combined
37 into a single CRC at the end. For this code, N must be in the range 1..6 and
38 W must be 4 or 8. The upper limit on N can be increased if desired by adding
40 crc32.h would need to be regenerated, if the maximum N value is increased.
42 N and W are chosen empirically by benchmarking the execution time on a given
43 processor. The choices for N and W below were based on testing on Intel Kaby
46 with N=5, W=8. The Sparc, PowerPC, and MIPS64 were all fastest at N
53 # define N Z_TESTN global() macro
55 # define N global() macro
[all...]
/titanic_51/usr/src/contrib/ast/src/lib/libast/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 in main()
[all...]
/titanic_51/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_51/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 VALU
[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
[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
[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_51/usr/src/boot/sys/boot/forth/
H A Dmenu-commands.4th52 : init_boot ( N -- N )
55 s" set menu_keycode[N]=98" \ base command to execute
60 s" set menu_keycode[N]=115" \ base command to execute
62 s" set menu_keycode[N]=98" \ base command to execute
65 17 +c! \ replace 'N' with ASCII numeral
73 : init_altboot ( N -- N )
76 s" set menu_keycode[N]=114" \ base command to execute
81 s" set menu_keycode[N]
[all...]
/titanic_51/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 DATA(P,N) global() argument
142 PAGE_META(N) global() argument
144 ISBIG(N,P) global() argument
[all...]
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_ argument
168 OPAGENUM(N) global() argument
177 POW2(N) global() argument
[all...]
/titanic_51/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()
106 /* T += N * m_i * (MP_RADIX ** 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()
115 /* T = T - N */ 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_ in s_mp_mul_mont()
[all...]
/titanic_51/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
[all...]
/titanic_51/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] in drawspline()
[all...]
/titanic_51/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_51/usr/src/contrib/ast/src/lib/libast/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]
[all...]
/titanic_51/usr/src/contrib/ast/src/cmd/ksh93/tests/
H A Dexpand.sh110 # ~(N) no expand glob pattern option
111 set -- ~(N)/dev/null
112 [[ $# == 1 && $1 == /dev/null ]] || err_exit "~(N)/dev/null not matching /dev/null"
113 set -- ~(N)/dev/non_existant_file
114 [[ $# == 0 ]] || err_exit "~(N)/dev/nonexistant not empty"
115 set -- ""~(N)/dev/non_existant_file
116 [[ $# == 1 && ! $1 ]] || err_exit '""~(N)/dev/nonexistant not null argument'
117 set -- ~(N)/dev/non_existant_file""
118 [[ $# == 1 && ! $1 ]] || err_exit '~(N)/dev/nonexistent"" not null argument'
119 for i in ~(N)/de
[all...]
/titanic_51/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

12345678910>>...25