| /netbsd/src/external/bsd/pcc/dist/pcc/cc/cpp/ |
| D | cpc.c | 40 void qloop(void (*fun)(ND *), ND *n1, int a0, int a1, int a2, int a3);
43 void expr(ND *n1);
44 void eqcol(ND *n1);
45 void eoror(ND *n1);
46 void eandand(ND *n1);
47 void exor(ND *n1);
48 void eand(ND *n1);
49 void eqne(ND *n1);
50 void eget(ND *n1);
51 void elrs(ND *n1);
[all …]
|
| /netbsd/src/external/gpl3/gcc/dist/libgcc/config/alpha/ |
| D | qrnnd.S | 50 #define n1 $17 macro
60 addq n1,n1,n1
61 bis n1,tmp,n1
63 cmpule d,n1,qb
64 subq n1,d,tmp
65 cmovne qb,tmp,n1
68 addq n1,n1,n1
69 bis n1,tmp,n1
71 cmpule d,n1,qb
72 subq n1,d,tmp
[all …]
|
| /netbsd/src/external/gpl3/gdb/dist/gdb/testsuite/gdb.base/ |
| D | array-indices.exp.tcl | 37 set n1 {[1]}
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 = ${a3po}, $n3 = ${a3po},\
[all …]
|
| /netbsd/src/usr.sbin/mtree/ |
| D | specspec.c | 106 mismatch(NODE *n1, NODE *n2, int differ, char const *path) in mismatch() argument
110 shownode(n1, differ, path); in mismatch()
113 if (n1 == NULL) { in mismatch()
121 shownode(n1, differ, path); in mismatch()
128 compare_nodes(NODE *n1, NODE *n2, char const *path) in compare_nodes() argument
132 if (n1 != NULL && n1->type == F_LINK) in compare_nodes()
133 n1->flags &= ~F_MODE; in compare_nodes()
137 if (n1 == NULL && n2 != NULL) { in compare_nodes()
139 mismatch(n1, n2, differs, path); in compare_nodes()
142 if (n1 != NULL && n2 == NULL) { in compare_nodes()
[all …]
|
| /netbsd/src/external/lgpl3/gmp/dist/mpn/generic/ |
| D | sbpi1_divappr_q.c | 51 mp_limb_t n1, n0; in mpn_sbpi1_divappr_q() local
83 n1 = np[1]; in mpn_sbpi1_divappr_q()
88 if (UNLIKELY (n1 == d1) && np[1] == d0) in mpn_sbpi1_divappr_q()
92 n1 = np[1]; /* update n1, last loop's value will now be invalid */ in mpn_sbpi1_divappr_q()
96 udiv_qr_3by2 (q, n1, n0, n1, np[1], np[0], d1, d0, dinv); in mpn_sbpi1_divappr_q()
102 cy = n1 < cy1; in mpn_sbpi1_divappr_q()
103 n1 -= cy1; in mpn_sbpi1_divappr_q()
108 n1 += d1 + mpn_add_n (np - dn, np - dn, dp, dn + 1); in mpn_sbpi1_divappr_q()
123 if (UNLIKELY (n1 >= (d1 & flag))) in mpn_sbpi1_divappr_q()
128 if (UNLIKELY (n1 != cy)) in mpn_sbpi1_divappr_q()
[all …]
|
| D | sbpi1_div_q.c | 50 mp_limb_t n1, n0; in mpn_sbpi1_div_q() local
86 n1 = np[1]; in mpn_sbpi1_div_q()
91 if (UNLIKELY (n1 == d1) && np[1] == d0) in mpn_sbpi1_div_q()
95 n1 = np[1]; /* update n1, last loop's value will now be invalid */ in mpn_sbpi1_div_q()
99 udiv_qr_3by2 (q, n1, n0, n1, np[1], np[0], d1, d0, dinv); in mpn_sbpi1_div_q()
105 cy = n1 < cy1; in mpn_sbpi1_div_q()
106 n1 -= cy1; in mpn_sbpi1_div_q()
111 n1 += d1 + mpn_add_n (np - dn, np - dn, dp, dn + 1); in mpn_sbpi1_div_q()
126 if (UNLIKELY (n1 >= (d1 & flag))) in mpn_sbpi1_div_q()
131 if (UNLIKELY (n1 != cy)) in mpn_sbpi1_div_q()
[all …]
|
| D | mullo_n.c | 139 mp_size_t n2, n1; in mpn_dc_mullo_n() local
151 n1 = n >> 1; in mpn_dc_mullo_n()
153 n1 = n * 11 / (size_t) 36; /* n1 ~= n*(1-.694...) */ in mpn_dc_mullo_n()
155 n1 = n * 9 / (size_t) 40; /* n1 ~= n*(1-.775...) */ in mpn_dc_mullo_n()
157 n1 = n * 7 / (size_t) 39; /* n1 ~= n*(1-.821...) */ in mpn_dc_mullo_n()
160 n1 = n / (size_t) 10; /* n1 ~= n*(1-.899...) [TOOM88] */ in mpn_dc_mullo_n()
162 n2 = n - n1; in mpn_dc_mullo_n()
172 if (BELOW_THRESHOLD (n1, MULLO_BASECASE_THRESHOLD)) in mpn_dc_mullo_n()
173 mpn_mul_basecase (tp + n, xp + n2, n1, yp, n1); in mpn_dc_mullo_n()
174 else if (BELOW_THRESHOLD (n1, MULLO_DC_THRESHOLD)) in mpn_dc_mullo_n()
[all …]
|
| D | sqrlo.c | 138 mp_size_t n2, n1; in mpn_dc_sqrlo() local
149 n1 = n >> 1; in mpn_dc_sqrlo()
151 n1 = n * 11 / (size_t) 36; /* n1 ~= n*(1-.694...) */ in mpn_dc_sqrlo()
153 n1 = n * 9 / (size_t) 40; /* n1 ~= n*(1-.775...) */ in mpn_dc_sqrlo()
155 n1 = n * 7 / (size_t) 39; /* n1 ~= n*(1-.821...) */ in mpn_dc_sqrlo()
158 n1 = n / (size_t) 10; /* n1 ~= n*(1-.899...) [TOOM88] */ in mpn_dc_sqrlo()
160 n2 = n - n1; in mpn_dc_sqrlo()
169 if (BELOW_THRESHOLD (n1, MULLO_BASECASE_THRESHOLD)) in mpn_dc_sqrlo()
170 mpn_mul_basecase (tp + n, xp + n2, n1, xp, n1); in mpn_dc_sqrlo()
171 else if (BELOW_THRESHOLD (n1, MULLO_DC_THRESHOLD)) in mpn_dc_sqrlo()
[all …]
|
| D | sbpi1_div_qr.c | 50 mp_limb_t n1, n0; in mpn_sbpi1_div_qr() local
74 n1 = np[1]; in mpn_sbpi1_div_qr()
79 if (UNLIKELY (n1 == d1) && np[1] == d0) in mpn_sbpi1_div_qr()
83 n1 = np[1]; /* update n1, last loop's value will now be invalid */ in mpn_sbpi1_div_qr()
87 udiv_qr_3by2 (q, n1, n0, n1, np[1], np[0], d1, d0, dinv); in mpn_sbpi1_div_qr()
93 cy = n1 < cy1; in mpn_sbpi1_div_qr()
94 n1 = (n1 - cy1) & GMP_NUMB_MASK; in mpn_sbpi1_div_qr()
99 n1 += d1 + mpn_add_n (np - dn, np - dn, dp, dn + 1); in mpn_sbpi1_div_qr()
106 np[1] = n1; in mpn_sbpi1_div_qr()
|
| D | divrem_1.c | 94 mp_limb_t n1, n0; in mpn_divrem_1() local
175 n1 = up[un - 1] << GMP_NAIL_BITS; in mpn_divrem_1()
176 if (n1 < d) in mpn_divrem_1()
178 r = n1 >> GMP_NAIL_BITS; in mpn_divrem_1()
201 n1 = up[un - 1] << GMP_NAIL_BITS; in mpn_divrem_1()
202 r |= (n1 >> (GMP_LIMB_BITS - cnt)); in mpn_divrem_1()
206 nshift = (n1 << cnt) | (n0 >> (GMP_NUMB_BITS - cnt)); in mpn_divrem_1()
210 n1 = n0; in mpn_divrem_1()
212 udiv_qrnnd (*qp, r, r, n1 << cnt, d); in mpn_divrem_1()
230 n1 = up[un - 1] << GMP_NAIL_BITS; in mpn_divrem_1()
[all …]
|
| D | hgcd2.c | 412 mp_limb_t n1, mp_limb_t n0, in div2() argument
415 mp_double_limb_t rq = div1 (n1, d1); in div2()
425 n2 = n1 >> (GMP_LIMB_BITS - c); in div2()
426 n1 = (n1 << c) | (n0 >> (GMP_LIMB_BITS - c)); in div2()
431 udiv_qrnnd (q, n1, n2, n1, d1); in div2()
433 if (t1 > n1 || (t1 == n1 && t0 > n0)) in div2()
439 sub_ddmmss (n1, n0, n1, n0, t1, t0); in div2()
442 rp[0] = (n0 >> c) | (n1 << (GMP_LIMB_BITS - c)); in div2()
443 rp[1] = n1 >> c; in div2()
450 n1 = rq.d0; in div2()
[all …]
|
| /netbsd/src/external/gpl3/gdb/dist/gdb/testsuite/gdb.fortran/ |
| D | array-indices.exp | 24 set n1 {(-1)}
29 set a9p9o "($n0 = 9, $n1 = 9, $n2 = 9, $n3 = 9, $n4 = 9, $n5 = 9)"
30 set a1p "($n0 = 1, $n1 = 1, $n2 = 1, $n3 = 1, $n4 = 1)"
31 set a1p9 "($n0 = 1, $n1 = 1, $n2 = 1, $n3 = 1, $n4 = 1, $n5 = 9)"
32 set a2po "($n0 = 2, $n1 = 2, $n2 = 2, $n3 = 2, $n4 = 2)"
33 set a2p "($n0 = ${a2po} $n1 = ${a2po} $n2 = ${a2po} $n3 = ${a2po}\
35 set a2p9o "($n0 = 2, $n1 = 2, $n2 = 2, $n3 = 2, $n4 = 2, $n5 = 9)"
36 set a2p9 "($n0 = ${a2p9o} $n1 = ${a2p9o} $n2 = ${a2p9o} $n3 = ${a2p9o}\
38 set a3po "($n0 = 3, $n1 = 3, $n2 = 3, $n3 = 3, $n4 = 3)"
39 set a3p "($n0 = ${a3po} $n1 = ${a3po} $n2 = ${a3po} $n3 = ${a3po}\
[all …]
|
| /netbsd/src/external/lgpl3/gmp/dist/mpn/pa64/ |
| D | udiv.asm | 47 add,dc n1,n1,n1
48 sub,*<< n1,d,%r22
49 copy %r22,n1')
53 add,dc n1,n1,n1
54 sub n1,d,%r1
56 cmpclr,*<< n1,d,%r0
57 copy %r1,n1
87 std n1,0(remptr) C store remainder
91 shrpd n1,n0,1,n0 C n0 = lo(n1n0 >> 1)
92 shrpd %r0,n1,1,n1 C n1 = hi(n1n0 >> 1)
[all …]
|
| /netbsd/src/usr.bin/spell/spellprog/ |
| D | spellprog.c | 142 int n1; member
150 { .suf = "ssen", .p1 = ily, .n1 = 4,
152 { .suf = "ssel", .p1 = ily, .n1 = 4,
154 { .suf = "se", .p1 = s, .n1 = 1,
157 { .suf = "s'", .p1 = s, .n1 = 2,
159 { .suf = "s", .p1 = s, .n1 = 1,
161 { .suf = "ecn", .p1 = ncy, .n1 = 1,
163 { .suf = "ycn", .p1 = ncy, .n1 = 1,
165 { .suf = "ytilb", .p1 = nop, .n1 = 0,
167 { .suf = "ytilib", .p1 = bility, .n1 = 5,
[all …]
|
| /netbsd/src/external/lgpl3/gmp/dist/mpn/sparc64/ |
| D | divrem_1.c | 89 unsigned *qp, n1, n0, q, r, nshift, norm_rmask; in mpn_divrem_1() local
106 n1 = ap[size-1 + HALF_ENDIAN_ADJ(1)]; in mpn_divrem_1()
111 if (n1 == 0) in mpn_divrem_1()
113 n1 = ap[size-2 + HALF_ENDIAN_ADJ(0)]; in mpn_divrem_1()
123 if (n1 < d_limb) in mpn_divrem_1()
125 r = n1; in mpn_divrem_1()
148 n1 = ap[i + adj]; in mpn_divrem_1()
150 r |= ((n1 >> norm_rshift) & norm_rmask); in mpn_divrem_1()
155 nshift = (n1 << norm) | ((n0 >> norm_rshift) & norm_rmask); in mpn_divrem_1()
158 n1 = n0; in mpn_divrem_1()
[all …]
|
| D | mod_1.c | 81 unsigned *src, n1, n0, r, dummy_q, nshift, norm_rmask; in mpn_mod_1_anynorm() local
118 n1 = src [i + adj]; in mpn_mod_1_anynorm()
119 r = (r << norm) | ((n1 >> norm_rshift) & norm_rmask); in mpn_mod_1_anynorm()
128 nshift = (n1 << norm) | ((n0 >> norm_rshift) & norm_rmask); in mpn_mod_1_anynorm()
130 n1 = n0; in mpn_mod_1_anynorm()
134 nshift = n1 << norm; in mpn_mod_1_anynorm()
144 mp_limb_t n1, n0, r, dinv, dummy_q, nshift, norm_rmask; in mpn_mod_1_anynorm() local
167 n1 = *--src; in mpn_mod_1_anynorm()
168 r = (r << norm) | ((n1 >> norm_rshift) & norm_rmask); in mpn_mod_1_anynorm()
175 nshift = (n1 << norm) | ((n0 >> norm_rshift) & norm_rmask); in mpn_mod_1_anynorm()
[all …]
|
| /netbsd/src/crypto/external/bsd/openssl/dist/crypto/lhash/ |
| D | lhash.c | 215 OPENSSL_LH_NODE **n, **n1, **n2, *np; in expand() local
239 n1 = &(lh->b[p]); in expand()
243 for (np = *n1; np != NULL;) { in expand()
246 *n1 = (*n1)->next; in expand()
250 n1 = &((*n1)->next); in expand()
251 np = *n1; in expand()
259 OPENSSL_LH_NODE **n, *n1, *np; in contract() local
280 n1 = lh->b[(int)lh->p]; in contract()
281 if (n1 == NULL) in contract()
284 while (n1->next != NULL) in contract()
[all …]
|
| /netbsd/src/crypto/external/bsd/heimdal/dist/lib/hcrypto/libtommath/ |
| D | bn_mp_prime_miller_rabin.c | 29 mp_int n1, y, r; in mp_prime_miller_rabin() local
41 if ((err = mp_init_copy (&n1, a)) != MP_OKAY) { in mp_prime_miller_rabin()
44 if ((err = mp_sub_d (&n1, 1, &n1)) != MP_OKAY) { in mp_prime_miller_rabin()
49 if ((err = mp_init_copy (&r, &n1)) != MP_OKAY) { in mp_prime_miller_rabin()
72 if (mp_cmp_d (&y, 1) != MP_EQ && mp_cmp (&y, &n1) != MP_EQ) { in mp_prime_miller_rabin()
75 while ((j <= (s - 1)) && mp_cmp (&y, &n1) != MP_EQ) { in mp_prime_miller_rabin()
89 if (mp_cmp (&y, &n1) != MP_EQ) { in mp_prime_miller_rabin()
98 LBL_N1:mp_clear (&n1); in mp_prime_miller_rabin()
|
| /netbsd/src/external/gpl3/gcc/dist/gcc/ |
| D | pretty-print.cc | 146 long n1, n2; in eat_esc_sequence() local
163 n1 = 1; in eat_esc_sequence()
166 n1 = strtol (esc_head, &eptr, 10); in eat_esc_sequence()
175 if (cr.Y > n1) in eat_esc_sequence()
176 cr.Y -= n1; in eat_esc_sequence()
187 n1 = 1; in eat_esc_sequence()
190 n1 = strtol (esc_head, &eptr, 10); in eat_esc_sequence()
199 if (sb.dwSize.Y - cr.Y > n1) in eat_esc_sequence()
200 cr.Y += n1; in eat_esc_sequence()
211 n1 = 1; in eat_esc_sequence()
[all …]
|
| /netbsd/src/usr.bin/tsort/ |
| D | tsort.c | 206 NODE *n1; in add_arc() local
210 n1 = get_node(s1); in add_arc()
220 for (i = 0; i < n1->n_narcs; i++) in add_arc()
221 if (n1->n_arcs[i] == n2) in add_arc()
226 if (n1->n_narcs == n1->n_arcsize) { in add_arc()
227 if (!n1->n_arcsize) in add_arc()
228 n1->n_arcsize = 10; in add_arc()
229 bsize = n1->n_arcsize * sizeof(*n1->n_arcs) * 2; in add_arc()
230 n1->n_arcs = erealloc(n1->n_arcs, bsize); in add_arc()
231 n1->n_arcsize = bsize / sizeof(*n1->n_arcs); in add_arc()
[all …]
|
| /netbsd/src/bin/ps/ |
| D | keyword.c | 70 #define UID(n1, n2, of) \ argument
71 { .name = n1, .header = n2, .flag = 0, .oproc = pvar, \
73 #define GID(n1, n2, off) UID(n1, n2, off) argument
76 #define PID(n1, n2, of) \ argument
77 { .name = n1, .header = n2, .flag = 0, .oproc = pvar, \
80 #define LVAR(n1, n2, fl, of, ty, fm) \ argument
81 { .name = n1, .header = n2, .flag = (fl) | LWP, .oproc = pvar, \
83 #define PVAR(n1, n2, fl, of, ty, fm) \ argument
84 { .name = n1, .header = n2, .flag = (fl) | 0, .oproc = pvar, \
86 #define PUVAR(n1, n2, fl, of, ty, fm) \ argument
[all …]
|
| /netbsd/src/usr.bin/telnet/ |
| D | terminal.c | 91 int n, n0, n1; in ttyflush() local
94 if ((n1 = n = ring_full_consecutive(&ttyoring)) > 0) { in ttyflush()
111 if (n1 == n && n0 > n) { in ttyflush()
112 n1 = n0 - n; in ttyflush()
114 n1 = TerminalWrite(ttyoring.bottom, n1); in ttyflush()
115 if (n1 > 0) in ttyflush()
116 n += n1; in ttyflush()
|
| /netbsd/src/external/gpl3/gcc/dist/gcc/cp/ |
| D | logic.cc | 366 int n1 = p1.first, n2 = p2.first; in dnf_size_r() local
380 return std::make_pair (n1 + n2, d1 | d2); in dnf_size_r()
383 return std::make_pair (1 + n1 + n2, d1 | d2); in dnf_size_r()
390 return std::make_pair (n1 + n2, d1 | d2); in dnf_size_r()
395 return std::make_pair (1 + n1 + n2, d1 | d2); in dnf_size_r()
404 return std::make_pair (1 + n1 + n2, d1 | d2); in dnf_size_r()
422 return std::make_pair (n1 * n2, true); in dnf_size_r()
425 return std::make_pair (n1 + n2, true); in dnf_size_r()
432 return std::make_pair (n1 * n2, true); in dnf_size_r()
437 return std::make_pair (n1 + n2, true); in dnf_size_r()
[all …]
|
| /netbsd/src/sys/arch/atari/stand/tostools/aptck/ |
| D | setrev.awk | 5 function revcmp(r1, r2, n1, n2, a1, a2, n, i) {
6 n1 = split(r1, a1, "\.")
8 n = (n1 < n2) ? n1 : n2
14 if (n1 != n2)
15 return(n1 - n2)
|
| /netbsd/src/crypto/external/bsd/openssl/dist/ms/ |
| D | cmp.pl | 20 $n1=sysread(IN0,$b1,4096);
23 last if ($n1 != $n2);
25 last if ($n1 < 0);
26 if ($n1 == 0)
31 $tot+=$n1;
49 $nm=$tot+$n1;
|