| /src/sys/arch/atari/stand/tostools/aptck/ |
| setrev.awk | 5 function revcmp(r1, r2, n1, n2, a1, a2, n, i) {
7 n2 = split(r2, a2, "\.")
8 n = (n1 < n2) ? n1 : n2
14 if (n1 != n2)
15 return(n1 - n2)
|
| /src/external/bsd/libarchive/dist/libarchive/test/ |
| test_compat_lz4.c | 89 const char *n2[7] = { "xfile", "README", "NEWS", NULL }; local
100 verify("test_compat_lz4_B4.tar.lz4.uu", n2);
102 verify("test_compat_lz4_skippable_frames_B4.tar.lz4.uu", n2);
104 verify("test_compat_lz4_B5.tar.lz4.uu", n2);
106 verify("test_compat_lz4_B6.tar.lz4.uu", n2);
108 verify("test_compat_lz4_B7.tar.lz4.uu", n2);
110 verify("test_compat_lz4_B4BD.tar.lz4.uu", n2);
112 verify("test_compat_lz4_B5BD.tar.lz4.uu", n2);
114 verify("test_compat_lz4_B6BD.tar.lz4.uu", n2);
116 verify("test_compat_lz4_B7BD.tar.lz4.uu", n2);
[all...] |
| /src/external/gpl3/gcc/dist/libgfortran/generated/ |
| bessel_r10.c | 39 int n2, GFC_REAL_10 x);
43 bessel_jn_r10 (gfc_array_r10 * const restrict ret, int n1, int n2, GFC_REAL_10 x)
54 size_t size = n2 < n1 ? 0 : n2-n1+1;
60 if (unlikely (n2 < n1))
64 && GFC_DESCRIPTOR_EXTENT(ret,0) != (n2-n1+1))
66 "(%ld vs. %ld)", (long int) n2-n1,
74 for (i = 1; i <= n2-n1; i++)
79 last1 = MATHFUNC(jn) (n2, x);
80 ret->base_addr[(n2-n1)*stride] = last1
[all...] |
| bessel_r16.c | 47 int n2, GFC_REAL_16 x);
51 bessel_jn_r16 (gfc_array_r16 * const restrict ret, int n1, int n2, GFC_REAL_16 x)
62 size_t size = n2 < n1 ? 0 : n2-n1+1;
68 if (unlikely (n2 < n1))
72 && GFC_DESCRIPTOR_EXTENT(ret,0) != (n2-n1+1))
74 "(%ld vs. %ld)", (long int) n2-n1,
82 for (i = 1; i <= n2-n1; i++)
87 last1 = MATHFUNC(jn) (n2, x);
88 ret->base_addr[(n2-n1)*stride] = last1
[all...] |
| bessel_r17.c | 45 int n2, GFC_REAL_17 x);
49 bessel_jn_r17 (gfc_array_r17 * const restrict ret, int n1, int n2, GFC_REAL_17 x)
60 size_t size = n2 < n1 ? 0 : n2-n1+1;
66 if (unlikely (n2 < n1))
70 && GFC_DESCRIPTOR_EXTENT(ret,0) != (n2-n1+1))
72 "(%ld vs. %ld)", (long int) n2-n1,
80 for (i = 1; i <= n2-n1; i++)
85 last1 = MATHFUNC(jn) (n2, x);
86 ret->base_addr[(n2-n1)*stride] = last1
[all...] |
| bessel_r4.c | 39 int n2, GFC_REAL_4 x);
43 bessel_jn_r4 (gfc_array_r4 * const restrict ret, int n1, int n2, GFC_REAL_4 x)
54 size_t size = n2 < n1 ? 0 : n2-n1+1;
60 if (unlikely (n2 < n1))
64 && GFC_DESCRIPTOR_EXTENT(ret,0) != (n2-n1+1))
66 "(%ld vs. %ld)", (long int) n2-n1,
74 for (i = 1; i <= n2-n1; i++)
79 last1 = MATHFUNC(jn) (n2, x);
80 ret->base_addr[(n2-n1)*stride] = last1
[all...] |
| bessel_r8.c | 39 int n2, GFC_REAL_8 x);
43 bessel_jn_r8 (gfc_array_r8 * const restrict ret, int n1, int n2, GFC_REAL_8 x)
54 size_t size = n2 < n1 ? 0 : n2-n1+1;
60 if (unlikely (n2 < n1))
64 && GFC_DESCRIPTOR_EXTENT(ret,0) != (n2-n1+1))
66 "(%ld vs. %ld)", (long int) n2-n1,
74 for (i = 1; i <= n2-n1; i++)
79 last1 = MATHFUNC(jn) (n2, x);
80 ret->base_addr[(n2-n1)*stride] = last1
[all...] |
| /src/external/gpl3/gcc.old/dist/libgfortran/generated/ |
| bessel_r10.c | 39 int n2, GFC_REAL_10 x);
43 bessel_jn_r10 (gfc_array_r10 * const restrict ret, int n1, int n2, GFC_REAL_10 x)
54 size_t size = n2 < n1 ? 0 : n2-n1+1;
60 if (unlikely (n2 < n1))
64 && GFC_DESCRIPTOR_EXTENT(ret,0) != (n2-n1+1))
66 "(%ld vs. %ld)", (long int) n2-n1,
74 for (i = 1; i <= n2-n1; i++)
79 last1 = MATHFUNC(jn) (n2, x);
80 ret->base_addr[(n2-n1)*stride] = last1
[all...] |
| bessel_r16.c | 43 int n2, GFC_REAL_16 x);
47 bessel_jn_r16 (gfc_array_r16 * const restrict ret, int n1, int n2, GFC_REAL_16 x)
58 size_t size = n2 < n1 ? 0 : n2-n1+1;
64 if (unlikely (n2 < n1))
68 && GFC_DESCRIPTOR_EXTENT(ret,0) != (n2-n1+1))
70 "(%ld vs. %ld)", (long int) n2-n1,
78 for (i = 1; i <= n2-n1; i++)
83 last1 = MATHFUNC(jn) (n2, x);
84 ret->base_addr[(n2-n1)*stride] = last1
[all...] |
| bessel_r17.c | 43 int n2, GFC_REAL_17 x);
47 bessel_jn_r17 (gfc_array_r17 * const restrict ret, int n1, int n2, GFC_REAL_17 x)
58 size_t size = n2 < n1 ? 0 : n2-n1+1;
64 if (unlikely (n2 < n1))
68 && GFC_DESCRIPTOR_EXTENT(ret,0) != (n2-n1+1))
70 "(%ld vs. %ld)", (long int) n2-n1,
78 for (i = 1; i <= n2-n1; i++)
83 last1 = MATHFUNC(jn) (n2, x);
84 ret->base_addr[(n2-n1)*stride] = last1
[all...] |
| bessel_r4.c | 39 int n2, GFC_REAL_4 x);
43 bessel_jn_r4 (gfc_array_r4 * const restrict ret, int n1, int n2, GFC_REAL_4 x)
54 size_t size = n2 < n1 ? 0 : n2-n1+1;
60 if (unlikely (n2 < n1))
64 && GFC_DESCRIPTOR_EXTENT(ret,0) != (n2-n1+1))
66 "(%ld vs. %ld)", (long int) n2-n1,
74 for (i = 1; i <= n2-n1; i++)
79 last1 = MATHFUNC(jn) (n2, x);
80 ret->base_addr[(n2-n1)*stride] = last1
[all...] |
| bessel_r8.c | 39 int n2, GFC_REAL_8 x);
43 bessel_jn_r8 (gfc_array_r8 * const restrict ret, int n1, int n2, GFC_REAL_8 x)
54 size_t size = n2 < n1 ? 0 : n2-n1+1;
60 if (unlikely (n2 < n1))
64 && GFC_DESCRIPTOR_EXTENT(ret,0) != (n2-n1+1))
66 "(%ld vs. %ld)", (long int) n2-n1,
74 for (i = 1; i <= n2-n1; i++)
79 last1 = MATHFUNC(jn) (n2, x);
80 ret->base_addr[(n2-n1)*stride] = last1
[all...] |
| /src/external/bsd/pcc/dist/pcc/cc/cpp/ |
| cpc.c | 55 void eval(int op, ND *n1, ND *n2);
98 ND n2, n3; local
105 expr(&n2);
111 n1->nd_val = n2.nd_val, n1->op = n2.op;
176 ND n2; local
183 fun(&n2);
184 eval(op, n1, &n2);
238 eval(int op, ND *n1, ND *n2)
241 if ((op == '/' || op == '%') && n2->nd_val == 0
[all...] |
| /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.cp/ |
| rtti1.cc | 57 // keep around a reference to 'obj' in n2::func - GCC 3.4 had been
59 void refer_to (n2::C2 *obj)
64 void refer_to (n2::n3::C3 *obj)
69 namespace n2 namespace
96 using namespace n2;
101 n2::func(); // main-constructs-done
102 n2::n3::func3();
|
| rtti2.cc | 25 namespace n2 { namespace
|
| /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.cp/ |
| rtti1.cc | 57 // keep around a reference to 'obj' in n2::func - GCC 3.4 had been
59 void refer_to (n2::C2 *obj)
64 void refer_to (n2::n3::C3 *obj)
69 namespace n2 namespace
96 using namespace n2;
101 n2::func(); // main-constructs-done
102 n2::n3::func3();
|
| rtti2.cc | 25 namespace n2 { namespace
|
| /src/usr.sbin/mtree/ |
| specspec.c | 106 mismatch(NODE *n1, NODE *n2, int differ, char const *path)
109 if (n2 == NULL) {
115 shownode(n2, differ, path);
123 shownode(n2, differ, path);
128 compare_nodes(NODE *n1, NODE *n2, char const *path)
134 if (n2 != NULL && n2->type == F_LINK)
135 n2->flags &= ~F_MODE;
137 if (n1 == NULL && n2 != NULL) {
138 differs = n2->flags
196 NODE *c1, *c2, *n1, *n2; local
[all...] |
| /src/external/lgpl3/gmp/dist/mpn/generic/ |
| sqrlo.c | 65 split n = n1 + n2, where an = n1 <= n2 = (1-a)n; i.e. 0 < a <= 1/2.
109 ^ n2 ^n1^
138 mp_size_t n2, n1; local
160 n2 = n - n1;
162 /* Split as x = x1 2^(n2 GMP_NUMB_BITS) + x0 */
165 mpn_sqr (tp, xp, n2);
166 MPN_COPY (rp, tp, n2);
168 /* x1 * x0 * 2^(n2 GMP_NUMB_BITS) */
170 mpn_mul_basecase (tp + n, xp + n2, n1, xp, n1)
[all...] |
| mullo_n.c | 66 split n = n1 + n2, where an = n1 <= n2 = (1-a)n; i.e. 0 < a <= 1/2.
110 ^ n2 ^n1^
139 mp_size_t n2, n1; local
162 n2 = n - n1;
164 /* Split as x = x1 2^(n2 GMP_NUMB_BITS) + x0,
165 y = y1 2^(n2 GMP_NUMB_BITS) + y0 */
168 mpn_mul_n (tp, xp, yp, n2);
169 MPN_COPY (rp, tp, n2);
171 /* x1 * y0 * 2^(n2 GMP_NUMB_BITS) *
[all...] |
| /src/crypto/external/apache2/openssl/dist/crypto/bn/ |
| bn_mul.c | 164 * r is 2*n2 words in size,
165 * a and b are both n2 words in size.
166 * n2 must be a power of 2.
168 * t must be 2*n2 words in size
174 /* dnX may not be positive, but n2/2+dnX has to be */
175 void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
178 int n = n2 / 2, c1, c2;
185 if (n2 == 4) {
191 * Only call bn_mul_comba 8 if n2 == 8 and the two arrays are complete
194 if (n2 == 8 && dna == 0 && dnb == 0)
325 int i, j, n2 = n * 2; local
[all...] |
| bn_sqr.c | 156 void bn_sqr_recursive(BN_ULONG *r, const BN_ULONG *a, int n2, BN_ULONG *t)
158 int n = n2 / 2;
162 if (n2 == 4) {
169 } else if (n2 == 8) {
177 if (n2 < BN_SQR_RECURSIVE_SIZE_NORMAL) {
178 bn_sqr_normal(r, a, n2, t);
192 p = &(t[n2 * 2]);
195 bn_sqr_recursive(&(t[n2]), t, n, p);
197 memset(&t[n2], 0, sizeof(*t) * n2);
[all...] |
| /src/crypto/external/bsd/openssl/dist/crypto/bn/ |
| bn_mul.c | 164 * r is 2*n2 words in size,
165 * a and b are both n2 words in size.
166 * n2 must be a power of 2.
168 * t must be 2*n2 words in size
174 /* dnX may not be positive, but n2/2+dnX has to be */
175 void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
178 int n = n2 / 2, c1, c2;
185 if (n2 == 4) {
191 * Only call bn_mul_comba 8 if n2 == 8 and the two arrays are complete
194 if (n2 == 8 && dna == 0 && dnb == 0)
325 int i, j, n2 = n * 2; local
[all...] |
| /src/crypto/external/bsd/openssl.old/dist/crypto/bn/ |
| bn_mul.c | 164 * r is 2*n2 words in size,
165 * a and b are both n2 words in size.
166 * n2 must be a power of 2.
168 * t must be 2*n2 words in size
174 /* dnX may not be positive, but n2/2+dnX has to be */
175 void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
178 int n = n2 / 2, c1, c2;
185 if (n2 == 4) {
191 * Only call bn_mul_comba 8 if n2 == 8 and the two arrays are complete
194 if (n2 == 8 && dna == 0 && dnb == 0)
325 int i, j, n2 = n * 2; local
[all...] |
| /src/sys/arch/arm/amlogic/ |
| meson_clk_mpll.c | 47 uint64_t parent_rate, sdm, n2; local
66 val = CLK_READ(sc, mpll->n2.reg);
67 n2 = __SHIFTOUT(val, mpll->n2.mask);
71 const uint64_t div = (SDM_DEN * n2) + sdm;
|
