Searched refs:n2 (Results 126 - 150 of 501) sorted by relevance

1234567891011>>

/netbsd-current/lib/libm/ld128/
H A Dk_expl.h242 int n, n2; local
244 /* Reduce x to (k*ln2 + endpoint[n2] + r1 + r2). */
247 n2 = (unsigned)n % INTERVALS;
254 /* Evaluate expl(endpoint[n2] + r1 + r2) = tbl[n2] * expl(r1 + r2). */
258 t = tbl[n2].lo + tbl[n2].hi;
259 *hip = tbl[n2].hi;
260 *lop = tbl[n2].lo + t * (q + r1);
/netbsd-current/lib/libm/ld80/
H A Dk_expl.h223 int n, n2; local
225 /* Reduce x to (k*ln2 + endpoint[n2] + r1 + r2). */
229 n2 = (unsigned)n % INTERVALS;
235 /* Evaluate expl(endpoint[n2] + r1 + r2) = tbl[n2] * expl(r1 + r2). */
242 t = (long double)tbl[n2].lo + tbl[n2].hi;
243 *hip = tbl[n2].hi;
244 *lop = tbl[n2].lo + t * (q + r1);
/netbsd-current/tests/ipf/
H A Dt_nat_exec.sh64 test_case n2 nattest text text
104 atf_add_test_case n2
/netbsd-current/external/lgpl3/gmp/dist/tests/mpq/
H A Dt-equal.c62 #define SET4(q, nsize,n3,n2,n1,n0, dsize,d3,d2,d1,d0) \
63 SET4Z (mpq_numref(q), nsize,n3,n2,n1,n0); \
/netbsd-current/external/lgpl3/gmp/dist/mpn/generic/
H A Dhgcd_appr.c189 mp_size_t n2 = (3*n)/4 + 1; local
201 while (n > n2)
H A Ddiv_qr_2.c113 /* Typically used with r1, r0 same as n3, n2. Other types of overlap
115 #define udiv_qr_4by2(q1,q0, r1,r0, n3,n2,n1,n0, d1,d0, di1,di0) \
121 /* [q3,q2,q1,q0] = [n3,n2]*[di1,di0] + [n3,n2,n1,n0] + [0,1,0,0] */ \
122 umul_ppmm (_q2,_q1, n2, di1); \
127 add_sssaaaa (_q3,_q2,_q1, _q2,_q1, n2,_q1c); \
128 umul_ppmm (_q1d,_q0, n2, di0); \
/netbsd-current/external/lgpl3/gmp/dist/tests/mpz/
H A Dt-cmp.c80 #define SET4(z,size, n3,n2,n1,n0) \
81 SIZ(z) = size; PTR(z)[3] = n3; PTR(z)[2] = n2; PTR(z)[1] = n1; PTR(z)[0] = n0
/netbsd-current/crypto/external/bsd/openssl.old/dist/test/
H A Dcms-examples.pl348 $n2 = sysread $fp2, $rd2, 4096;
349 last if ( $n1 != $n2 );
/netbsd-current/crypto/external/bsd/openssl/dist/test/
H A Dcms-examples.pl348 $n2 = sysread $fp2, $rd2, 4096;
349 last if ( $n1 != $n2 );
/netbsd-current/external/gpl3/gcc/dist/gcc/
H A Domp-general.h57 tree v, n1, n2, step, m1, m2; member in struct:omp_for_data_loop
99 tree *n2, tree v, tree step);
H A Domp-expand.cc186 if (fd.collapse > 1 && TREE_CODE (fd.loop.n2) != INTEGER_CST)
197 || !is_gimple_min_invariant (fd.loop.n2)
239 tree n1, n2; local
243 n2 = fd.loop.n2;
255 n2 = OMP_CLAUSE_DECL (innerc);
263 t = fold_convert_loc (loc, long_integer_type_node, n2);
1603 tree e = loop->n2;
1809 && TREE_CODE (fd->loop.n2) != INTEGER_CST)
1854 fold_convert (itype, fd->loops[i].n2));
1886 tree n1, n2; local
2045 tree n1, n2, n1e, n2e; local
2261 tree n1, n2; local
2780 tree n1 = NULL_TREE, n2 = NULL_TREE; local
3173 tree n1, n2; local
3679 tree n2 local
3991 tree n1, n2; local
4864 tree n1, n2, step; local
5655 tree n1, n2, step; local
6363 tree n1, n2; local
7108 tree n1, n2; local
7258 tree n1, n2, step; local
7269 tree n1, n2; local
[all...]
/netbsd-current/external/gpl3/gdb/dist/gdb/testsuite/gdb.base/
H A Darray-indices.exp.tcl38 set n2 {[2]}
42 set a9p9o "{$n0 = 9, $n1 = 9, $n2 = 9, $n3 = 9, $n4 = 9, $n5 = 9}"
43 set a1p "{$n0 = 1, $n1 = 1, $n2 = 1, $n3 = 1, $n4 = 1}"
44 set a1p9 "{$n0 = 1, $n1 = 1, $n2 = 1, $n3 = 1, $n4 = 1, $n5 = 9}"
45 set a2po "{$n0 = 2, $n1 = 2, $n2 = 2, $n3 = 2, $n4 = 2}"
46 set a2p "{$n0 = ${a2po}, $n1 = ${a2po}, $n2 = ${a2po}, $n3 = ${a2po},\
48 set a2p9o "{$n0 = 2, $n1 = 2, $n2 = 2, $n3 = 2, $n4 = 2, $n5 = 9}"
49 set a2p9 "{$n0 = ${a2p9o}, $n1 = ${a2p9o}, $n2 = ${a2p9o}, $n3 = ${a2p9o},\
51 set a3po "{$n0 = 3, $n1 = 3, $n2 = 3, $n3 = 3, $n4 = 3}"
52 set a3p "{$n0 = ${a3po}, $n1 = ${a3po}, $n2
[all...]
/netbsd-current/tests/ipf/input/
H A DMakefile69 n2 \
/netbsd-current/external/gpl3/gcc.old/dist/libphobos/src/std/container/
H A Dslist.d163 const(Node) * n1 = _first, n2 = rhs._first;
165 for (;; n1 = n1._next, n2 = n2._next)
167 if (!n1) return !n2;
168 if (!n2 || n1._payload != n2._payload) return false;
585 auto n2 = findLastNode(orig._head, r.maxLength);
586 n1._next = n2._next;
/netbsd-current/external/gpl3/gdb.old/dist/binutils/testsuite/binutils-all/
H A Dar.exp46 set n2 "abcdefghijklmnopqrstuvwxyz2"
48 set file2 tmpdir/$n2
65 remote_file host delete $n2
67 set status [catch "set f [open tmpdir/$n2 w]" errs]
69 verbose -log "open tmpdir/$n2 returned $errs"
109 remote_file build delete tmpdir/$n2
113 if ![string match "$n1*$n2" $got] {
142 remote_upload host $n2 tmpdir/$n2
144 set file2 tmpdir/$n2
[all...]
/netbsd-current/external/gpl3/gcc/dist/libphobos/src/std/container/
H A Dslist.d219 const(Node) * n1 = _first, n2 = rhs._first;
221 for (;; n1 = n1._next, n2 = n2._next)
223 if (!n1) return !n2;
224 if (!n2 || n1._payload != n2._payload) return false;
616 auto n2 = findLastNode(orig._head, r.maxLength);
617 n1._next = n2._next;
/netbsd-current/external/gpl2/gettext/dist/gettext-tools/src/
H A Dformat-perl-brace.c175 unsigned int n2 = spec2->named_arg_count; local
181 for (i = 0, j = 0; i < n1 || j < n2; )
184 j >= n2 ? -1 :
H A Dformat-sh.c272 unsigned int n2 = spec2->named_arg_count; local
276 for (i = 0, j = 0; i < n1 || j < n2; )
279 j >= n2 ? -1 :
/netbsd-current/usr.bin/infocmp/
H A Dinfocmp.c351 compare_ents(TIENT *ents1, size_t n1, TIENT *ents2, size_t n2) argument
362 while (i1 != n1 || i2 != n2) {
365 else if (i2 == n2)
649 size_t n, n2; local
764 n2 = 5 + strlen(argv[optind]);
766 if (n + n2 > cols) {
789 n2 = load_ents(ents2, t2, 'f');
790 compare_ents(ents, n, ents2, n2);
797 n2 = load_ents(ents2, t2, 'n');
798 compare_ents(ents, n, ents2, n2);
[all...]
/netbsd-current/sys/arch/arm/iomd/
H A Diomd_clock.c357 volatile u_int n2; local
361 n2 = n;
362 while (n2-- > 0) {
/netbsd-current/usr.sbin/autofs/
H A Dautomount.c146 struct node *n, *n2; local
184 TAILQ_FOREACH(n2, &n->n_children, n_next) {
185 mount_if_not_already(n2, n->n_map, n->n_options,
/netbsd-current/external/gpl3/gcc.old/dist/libgcc/config/visium/
H A Dlib2funcs.c117 UWtype d0, d1, n0, n1, n2;
203 n2 = n1 >> b;
207 udiv_qqrnnd (q1, q0, n1, n2, n1, d1);
115 UWtype d0, d1, n0, n1, n2; local
/netbsd-current/external/gpl3/gcc/dist/libgcc/config/visium/
H A Dlib2funcs.c117 UWtype d0, d1, n0, n1, n2;
203 n2 = n1 >> b;
207 udiv_qqrnnd (q1, q0, n1, n2, n1, d1);
115 UWtype d0, d1, n0, n1, n2; local
/netbsd-current/lib/libbluetooth/
H A Dbluetooth.c349 int n1, n2; local
354 if ((n2 = bt_hex_nibble(str[1])) < 0)
357 return ((((n1 & 0x0f) << 4) | (n2 & 0x0f)) & 0xff);
/netbsd-current/external/bsd/unbound/dist/iterator/
H A Diter_fwd.c57 struct iter_forward_zone* n2 = (struct iter_forward_zone*)k2; local
58 if(n1->dclass != n2->dclass) {
59 if(n1->dclass < n2->dclass)
63 return dname_lab_cmp(n1->name, n1->namelabs, n2->name, n2->namelabs,

Completed in 243 milliseconds

1234567891011>>