| /netbsd/external/bsd/pcc/dist/pcc/cc/cpp/ |
| H A D | cpc.c | 98 ND n2, n3; in eqcol() local
105 expr(&n2); in eqcol()
111 n1->nd_val = n2.nd_val, n1->op = n2.op; in eqcol()
176 ND n2; in qloop() local
183 fun(&n2); in qloop()
184 eval(op, n1, &n2); in qloop()
238 eval(int op, ND *n1, ND *n2) in eval() argument
248 if (n2 == 0) { in eval()
267 if (n2->op == 0) { in eval()
272 if (n2->op == UNUMBER) in eval()
[all …]
|
| /netbsd/usr.sbin/mtree/ |
| H A D | specspec.c | 109 if (n2 == NULL) { in mismatch()
123 shownode(n2, differ, path); in mismatch()
134 if (n2 != NULL && n2->type == F_LINK) in compare_nodes()
135 n2->flags &= ~F_MODE; in compare_nodes()
138 differs = n2->flags; in compare_nodes()
196 NODE *c1, *c2, *n1, *n2; in walk_in_the_forest() local
210 n1 = n2 = NULL; in walk_in_the_forest()
214 n2 = c2->next; in walk_in_the_forest()
217 n2 = c2; in walk_in_the_forest()
228 n2 = c2; in walk_in_the_forest()
[all …]
|
| /netbsd/external/gpl3/gcc.old/dist/libgfortran/generated/ |
| H A D | bessel_r16.c | 43 int n2, GFC_REAL_16 x);
58 size_t size = n2 < n1 ? 0 : n2-n1+1; in bessel_jn_r16()
64 if (unlikely (n2 < n1)) in bessel_jn_r16()
83 last1 = MATHFUNC(jn) (n2, x); in bessel_jn_r16()
86 if (n1 == n2) in bessel_jn_r16()
92 if (n1 + 1 == n2) in bessel_jn_r16()
97 for (i = n2-n1-2; i >= 0; i--) in bessel_jn_r16()
125 size_t size = n2 < n1 ? 0 : n2-n1+1; in bessel_yn_r16()
131 if (unlikely (n2 < n1)) in bessel_yn_r16()
156 if (n1 == n2) in bessel_yn_r16()
[all …]
|
| H A D | bessel_r10.c | 39 int n2, GFC_REAL_10 x);
54 size_t size = n2 < n1 ? 0 : n2-n1+1; in bessel_jn_r10()
60 if (unlikely (n2 < n1)) in bessel_jn_r10()
79 last1 = MATHFUNC(jn) (n2, x); in bessel_jn_r10()
82 if (n1 == n2) in bessel_jn_r10()
88 if (n1 + 1 == n2) in bessel_jn_r10()
93 for (i = n2-n1-2; i >= 0; i--) in bessel_jn_r10()
121 size_t size = n2 < n1 ? 0 : n2-n1+1; in bessel_yn_r10()
127 if (unlikely (n2 < n1)) in bessel_yn_r10()
152 if (n1 == n2) in bessel_yn_r10()
[all …]
|
| H A D | bessel_r4.c | 39 int n2, GFC_REAL_4 x);
54 size_t size = n2 < n1 ? 0 : n2-n1+1; in bessel_jn_r4()
60 if (unlikely (n2 < n1)) in bessel_jn_r4()
79 last1 = MATHFUNC(jn) (n2, x); in bessel_jn_r4()
82 if (n1 == n2) in bessel_jn_r4()
88 if (n1 + 1 == n2) in bessel_jn_r4()
93 for (i = n2-n1-2; i >= 0; i--) in bessel_jn_r4()
121 size_t size = n2 < n1 ? 0 : n2-n1+1; in bessel_yn_r4()
127 if (unlikely (n2 < n1)) in bessel_yn_r4()
152 if (n1 == n2) in bessel_yn_r4()
[all …]
|
| H A D | bessel_r8.c | 39 int n2, GFC_REAL_8 x);
54 size_t size = n2 < n1 ? 0 : n2-n1+1; in bessel_jn_r8()
60 if (unlikely (n2 < n1)) in bessel_jn_r8()
79 last1 = MATHFUNC(jn) (n2, x); in bessel_jn_r8()
82 if (n1 == n2) in bessel_jn_r8()
88 if (n1 + 1 == n2) in bessel_jn_r8()
93 for (i = n2-n1-2; i >= 0; i--) in bessel_jn_r8()
121 size_t size = n2 < n1 ? 0 : n2-n1+1; in bessel_yn_r8()
127 if (unlikely (n2 < n1)) in bessel_yn_r8()
152 if (n1 == n2) in bessel_yn_r8()
[all …]
|
| /netbsd/external/gpl3/gcc/dist/libgfortran/generated/ |
| H A D | bessel_r10.c | 39 int n2, GFC_REAL_10 x);
54 size_t size = n2 < n1 ? 0 : n2-n1+1; in bessel_jn_r10()
60 if (unlikely (n2 < n1)) in bessel_jn_r10()
79 last1 = MATHFUNC(jn) (n2, x); in bessel_jn_r10()
82 if (n1 == n2) in bessel_jn_r10()
88 if (n1 + 1 == n2) in bessel_jn_r10()
93 for (i = n2-n1-2; i >= 0; i--) in bessel_jn_r10()
121 size_t size = n2 < n1 ? 0 : n2-n1+1; in bessel_yn_r10()
127 if (unlikely (n2 < n1)) in bessel_yn_r10()
152 if (n1 == n2) in bessel_yn_r10()
[all …]
|
| H A D | bessel_r16.c | 43 int n2, GFC_REAL_16 x);
58 size_t size = n2 < n1 ? 0 : n2-n1+1; in bessel_jn_r16()
64 if (unlikely (n2 < n1)) in bessel_jn_r16()
83 last1 = MATHFUNC(jn) (n2, x); in bessel_jn_r16()
86 if (n1 == n2) in bessel_jn_r16()
92 if (n1 + 1 == n2) in bessel_jn_r16()
97 for (i = n2-n1-2; i >= 0; i--) in bessel_jn_r16()
125 size_t size = n2 < n1 ? 0 : n2-n1+1; in bessel_yn_r16()
131 if (unlikely (n2 < n1)) in bessel_yn_r16()
156 if (n1 == n2) in bessel_yn_r16()
[all …]
|
| H A D | bessel_r17.c | 43 int n2, GFC_REAL_17 x);
58 size_t size = n2 < n1 ? 0 : n2-n1+1; in bessel_jn_r17()
64 if (unlikely (n2 < n1)) in bessel_jn_r17()
83 last1 = MATHFUNC(jn) (n2, x); in bessel_jn_r17()
86 if (n1 == n2) in bessel_jn_r17()
92 if (n1 + 1 == n2) in bessel_jn_r17()
97 for (i = n2-n1-2; i >= 0; i--) in bessel_jn_r17()
125 size_t size = n2 < n1 ? 0 : n2-n1+1; in bessel_yn_r17()
131 if (unlikely (n2 < n1)) in bessel_yn_r17()
156 if (n1 == n2) in bessel_yn_r17()
[all …]
|
| H A D | bessel_r4.c | 39 int n2, GFC_REAL_4 x);
54 size_t size = n2 < n1 ? 0 : n2-n1+1; in bessel_jn_r4()
60 if (unlikely (n2 < n1)) in bessel_jn_r4()
79 last1 = MATHFUNC(jn) (n2, x); in bessel_jn_r4()
82 if (n1 == n2) in bessel_jn_r4()
88 if (n1 + 1 == n2) in bessel_jn_r4()
93 for (i = n2-n1-2; i >= 0; i--) in bessel_jn_r4()
121 size_t size = n2 < n1 ? 0 : n2-n1+1; in bessel_yn_r4()
127 if (unlikely (n2 < n1)) in bessel_yn_r4()
152 if (n1 == n2) in bessel_yn_r4()
[all …]
|
| H A D | bessel_r8.c | 39 int n2, GFC_REAL_8 x);
54 size_t size = n2 < n1 ? 0 : n2-n1+1; in bessel_jn_r8()
60 if (unlikely (n2 < n1)) in bessel_jn_r8()
79 last1 = MATHFUNC(jn) (n2, x); in bessel_jn_r8()
82 if (n1 == n2) in bessel_jn_r8()
88 if (n1 + 1 == n2) in bessel_jn_r8()
93 for (i = n2-n1-2; i >= 0; i--) in bessel_jn_r8()
121 size_t size = n2 < n1 ? 0 : n2-n1+1; in bessel_yn_r8()
127 if (unlikely (n2 < n1)) in bessel_yn_r8()
152 if (n1 == n2) in bessel_yn_r8()
[all …]
|
| /netbsd/crypto/external/bsd/openssl.old/dist/crypto/bn/ |
| H A D | bn_mul.c | 201 bn_mul_normal(r, a, n2 + dna, b, n2 + dnb); in bn_mul_recursive()
270 memset(&t[n2], 0, sizeof(*t) * n2); in bn_mul_recursive()
281 c1 = (int)(bn_add_words(t, r, &(r[n2]), n2)); in bn_mul_recursive()
284 c1 -= (int)(bn_sub_words(&(t[n2]), t, &(t[n2]), n2)); in bn_mul_recursive()
287 c1 += (int)(bn_add_words(&(t[n2]), &(t[n2]), t, n2)); in bn_mul_recursive()
296 c1 += (int)(bn_add_words(&(r[n]), &(r[n]), &(t[n2]), n2)); in bn_mul_recursive()
403 memset(&r[n2], 0, sizeof(*r) * n2); in bn_mul_part_recursive()
436 c1 = (int)(bn_add_words(t, r, &(r[n2]), n2)); in bn_mul_part_recursive()
439 c1 -= (int)(bn_sub_words(&(t[n2]), t, &(t[n2]), n2)); in bn_mul_part_recursive()
442 c1 += (int)(bn_add_words(&(t[n2]), &(t[n2]), t, n2)); in bn_mul_part_recursive()
[all …]
|
| H A D | bn_sqr.c | 158 int n = n2 / 2; in bn_sqr_recursive()
162 if (n2 == 4) { in bn_sqr_recursive()
169 } else if (n2 == 8) { in bn_sqr_recursive()
177 if (n2 < BN_SQR_RECURSIVE_SIZE_NORMAL) { in bn_sqr_recursive()
178 bn_sqr_normal(r, a, n2, t); in bn_sqr_recursive()
192 p = &(t[n2 * 2]); in bn_sqr_recursive()
197 memset(&t[n2], 0, sizeof(*t) * n2); in bn_sqr_recursive()
207 c1 = (int)(bn_add_words(t, r, &(r[n2]), n2)); in bn_sqr_recursive()
210 c1 -= (int)(bn_sub_words(&(t[n2]), t, &(t[n2]), n2)); in bn_sqr_recursive()
218 c1 += (int)(bn_add_words(&(r[n]), &(r[n]), &(t[n2]), n2)); in bn_sqr_recursive()
[all …]
|
| /netbsd/crypto/external/bsd/openssl/dist/crypto/bn/ |
| H A D | bn_mul.c | 201 bn_mul_normal(r, a, n2 + dna, b, n2 + dnb); in bn_mul_recursive()
270 memset(&t[n2], 0, sizeof(*t) * n2); in bn_mul_recursive()
281 c1 = (int)(bn_add_words(t, r, &(r[n2]), n2)); in bn_mul_recursive()
284 c1 -= (int)(bn_sub_words(&(t[n2]), t, &(t[n2]), n2)); in bn_mul_recursive()
287 c1 += (int)(bn_add_words(&(t[n2]), &(t[n2]), t, n2)); in bn_mul_recursive()
296 c1 += (int)(bn_add_words(&(r[n]), &(r[n]), &(t[n2]), n2)); in bn_mul_recursive()
403 memset(&r[n2], 0, sizeof(*r) * n2); in bn_mul_part_recursive()
436 c1 = (int)(bn_add_words(t, r, &(r[n2]), n2)); in bn_mul_part_recursive()
439 c1 -= (int)(bn_sub_words(&(t[n2]), t, &(t[n2]), n2)); in bn_mul_part_recursive()
442 c1 += (int)(bn_add_words(&(t[n2]), &(t[n2]), t, n2)); in bn_mul_part_recursive()
[all …]
|
| H A D | bn_sqr.c | 158 int n = n2 / 2; in bn_sqr_recursive()
162 if (n2 == 4) { in bn_sqr_recursive()
169 } else if (n2 == 8) { in bn_sqr_recursive()
177 if (n2 < BN_SQR_RECURSIVE_SIZE_NORMAL) { in bn_sqr_recursive()
178 bn_sqr_normal(r, a, n2, t); in bn_sqr_recursive()
192 p = &(t[n2 * 2]); in bn_sqr_recursive()
197 memset(&t[n2], 0, sizeof(*t) * n2); in bn_sqr_recursive()
207 c1 = (int)(bn_add_words(t, r, &(r[n2]), n2)); in bn_sqr_recursive()
210 c1 -= (int)(bn_sub_words(&(t[n2]), t, &(t[n2]), n2)); in bn_sqr_recursive()
218 c1 += (int)(bn_add_words(&(r[n]), &(r[n]), &(t[n2]), n2)); in bn_sqr_recursive()
[all …]
|
| /netbsd/external/gpl3/gcc.old/dist/libgfortran/m4/ |
| H A D | bessel.m4 | 40 int n2, 'rtype_name` x);
55 size_t size = n2 < n1 ? 0 : n2-n1+1;
61 if (unlikely (n2 < n1))
80 last1 = MATHFUNC(jn) (n2, x);
83 if (n1 == n2)
89 if (n1 + 1 == n2)
94 for (i = n2-n1-2; i >= 0; i--)
122 size_t size = n2 < n1 ? 0 : n2-n1+1;
128 if (unlikely (n2 < n1))
153 if (n1 == n2)
[all …]
|
| /netbsd/external/gpl3/gcc/dist/libgfortran/m4/ |
| H A D | bessel.m4 | 40 int n2, 'rtype_name` x);
55 size_t size = n2 < n1 ? 0 : n2-n1+1;
61 if (unlikely (n2 < n1))
80 last1 = MATHFUNC(jn) (n2, x);
83 if (n1 == n2)
89 if (n1 + 1 == n2)
94 for (i = n2-n1-2; i >= 0; i--)
122 size_t size = n2 < n1 ? 0 : n2-n1+1;
128 if (unlikely (n2 < n1))
153 if (n1 == n2)
[all …]
|
| /netbsd/external/lgpl3/gmp/dist/mpn/generic/ |
| H A D | sqrlo.c | 138 mp_size_t n2, n1; in mpn_dc_sqrlo() local
160 n2 = n - n1; in mpn_dc_sqrlo()
165 mpn_sqr (tp, xp, n2); in mpn_dc_sqrlo()
166 MPN_COPY (rp, tp, n2); in mpn_dc_sqrlo()
170 mpn_mul_basecase (tp + n, xp + n2, n1, xp, n1); in mpn_dc_sqrlo()
172 mpn_mullo_basecase (tp + n, xp + n2, xp, n1); in mpn_dc_sqrlo()
174 mpn_mullo_n (tp + n, xp + n2, xp, n1); in mpn_dc_sqrlo()
177 mpn_addlsh1_n (rp + n2, tp + n2, tp + n, n1); in mpn_dc_sqrlo()
179 mpn_lshift (rp + n2, tp + n, n1, 1); in mpn_dc_sqrlo()
180 mpn_add_n (rp + n2, rp + n2, tp + n2, n1); in mpn_dc_sqrlo()
|
| H A D | mullo_n.c | 139 mp_size_t n2, n1; in mpn_dc_mullo_n() local
162 n2 = n - n1; in mpn_dc_mullo_n()
168 mpn_mul_n (tp, xp, yp, n2); in mpn_dc_mullo_n()
169 MPN_COPY (rp, tp, n2); in mpn_dc_mullo_n()
173 mpn_mul_basecase (tp + n, xp + n2, n1, yp, n1); in mpn_dc_mullo_n()
175 mpn_mullo_basecase (tp + n, xp + n2, yp, n1); in mpn_dc_mullo_n()
177 mpn_dc_mullo_n (tp + n, xp + n2, yp, n1, tp + n); in mpn_dc_mullo_n()
178 mpn_add_n (rp + n2, tp + n2, tp + n, n1); in mpn_dc_mullo_n()
182 mpn_mul_basecase (tp + n, xp, n1, yp + n2, n1); in mpn_dc_mullo_n()
184 mpn_mullo_basecase (tp + n, xp, yp + n2, n1); in mpn_dc_mullo_n()
[all …]
|
| /netbsd/external/bsd/bc/dist/ |
| H A D | number.c | 169 if (n1->n_len != n2->n_len) in _bc_do_compare()
193 n2ptr = n2->n_value; in _bc_do_compare()
353 n2bytes = n2->n_scale; in _bc_do_add()
355 n2ptr = (char *) (n2->n_value + n2->n_len + n2bytes - 1); in _bc_do_add()
371 n2bytes += n2->n_len; in _bc_do_add()
445 n2ptr = (char *) (n2->n_value + n2->n_len + n2->n_scale -1); in _bc_do_sub()
843 len2 = n2->n_len + n2->n_scale; in bc_multiply()
921 if (n2->n_scale == 0) in bc_divide()
923 if (n2->n_len == 1 && *n2->n_value == 1) in bc_divide()
937 scale2 = n2->n_scale; in bc_divide()
[all …]
|
| /netbsd/crypto/external/bsd/openssl.old/dist/test/testutil/ |
| H A D | format_output.c | 48 size_t n1, n2, i; in test_fail_string_common() local
71 n1 = n2 = 0; in test_fail_string_common()
85 const size_t j = n1 < n2 ? n1 : n2; in test_fail_string_common()
105 else if (n2 > 0) in test_fail_string_common()
113 m2 += n2; in test_fail_string_common()
115 l2 -= n2; in test_fail_string_common()
433 size_t n1, n2, i; in test_fail_memory_common() local
456 n1 = n2 = 0; in test_fail_memory_common()
470 const size_t j = n1 < n2 ? n1 : n2; in test_fail_memory_common()
504 m2 += n2; in test_fail_memory_common()
[all …]
|
| /netbsd/crypto/external/bsd/openssl/dist/test/testutil/ |
| H A D | format_output.c | 49 size_t n1, n2, i; in test_fail_string_common() local
72 n1 = n2 = 0; in test_fail_string_common()
86 const size_t j = n1 < n2 ? n1 : n2; in test_fail_string_common()
106 else if (n2 > 0) in test_fail_string_common()
114 m2 += n2; in test_fail_string_common()
116 l2 -= n2; in test_fail_string_common()
434 size_t n1, n2, i; in test_fail_memory_common() local
457 n1 = n2 = 0; in test_fail_memory_common()
471 const size_t j = n1 < n2 ? n1 : n2; in test_fail_memory_common()
505 m2 += n2; in test_fail_memory_common()
[all …]
|
| /netbsd/external/bsd/libarchive/dist/libarchive/test/ |
| H A D | test_compat_lz4.c | 90 const char *n2[7] = { "xfile", "README", "NEWS", NULL }; in DEFINE_TEST() local
101 verify("test_compat_lz4_B4.tar.lz4.uu", n2); in DEFINE_TEST()
103 verify("test_compat_lz4_B5.tar.lz4.uu", n2); in DEFINE_TEST()
105 verify("test_compat_lz4_B6.tar.lz4.uu", n2); in DEFINE_TEST()
107 verify("test_compat_lz4_B7.tar.lz4.uu", n2); in DEFINE_TEST()
109 verify("test_compat_lz4_B4BD.tar.lz4.uu", n2); in DEFINE_TEST()
111 verify("test_compat_lz4_B5BD.tar.lz4.uu", n2); in DEFINE_TEST()
113 verify("test_compat_lz4_B6BD.tar.lz4.uu", n2); in DEFINE_TEST()
115 verify("test_compat_lz4_B7BD.tar.lz4.uu", n2); in DEFINE_TEST()
117 verify("test_compat_lz4_B4BDBX.tar.lz4.uu", n2); in DEFINE_TEST()
|
| /netbsd/external/lgpl3/gmp/dist/mpn/x86/pentium4/sse2/ |
| H A D | divrem_1.asm | 385 C 2 paddd n1+n2
386 C 8 pmuludq m*(n1+n2)
387 C 2 paddq n2:nadj + m*(n1+n2)
434 paddd %mm0, %mm2 C n2+n1
441 paddq %mm2, %mm1 C n2:nadj + m*(n2+n1)
446 psrlq $32, %mm1 C q1 = high(n2:nadj + m*(n2+n1))
508 paddd %mm0, %mm2 C n2+n1
515 paddq %mm2, %mm1 C n2:nadj + m*(n2+n1)
519 psrlq $32, %mm1 C q1 = high(n2:nadj + m*(n2+n1))
601 movq %mm0, %mm1 C n2
[all …]
|
| /netbsd/external/gpl3/gcc.old/dist/gcc/cp/ |
| H A D | logic.cc | 375 int n1 = p1.first, n2 = p2.first; in dnf_size_r() local
431 return std::make_pair (n1 * n2, true); in dnf_size_r()
434 return std::make_pair (n1 + n2, true); in dnf_size_r()
441 return std::make_pair (n1 * n2, true); in dnf_size_r()
446 return std::make_pair (n1 + n2, true); in dnf_size_r()
455 return std::make_pair (n1 + n2, true); in dnf_size_r()
483 int n1 = p1.first, n2 = p2.first; in cnf_size_r() local
498 return std::make_pair (n1 * n2, true); in cnf_size_r()
863 int n2 = cnf_size (rhs); in subsumes_constraints_nonnull() local
868 if (n1 < n2) in subsumes_constraints_nonnull()
[all …]
|