| /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.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/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/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;
|
| /src/external/bsd/bzip2/dist/ |
| bzmore | 16 n1=''; n2='\c'
18 n1='-n'; n2=''
44 echo $n1 "--More--(Next file: $FILE)$n2"
|
| /src/lib/libm/ld80/ |
| s_expl.c | 162 int k, n, n2; local
219 /* Reduce x to (k*ln2 + endpoint[n2] + r1 + r2). */
222 n2 = (unsigned)n % INTERVALS;
235 * expl(endpoint[n2] + r1 + r2) = tbl[n2] * expl(r1 + r2).
240 t = (long double)tbl[n2].lo + tbl[n2].hi;
243 t = SUM2P(tbl[n2].hi - 1, tbl[n2].lo * (r1 + 1) + t * q +
244 tbl[n2].hi * r1)
[all...] |
| /src/tests/include/sys/ |
| t_list.c | 56 } *n1, *n2, *n3;
64 n2 = malloc(sizeof(struct entry));
65 n2->value = 2;
66 LIST_INSERT_HEAD(&old_head, n2, entries);
|
| /src/external/gpl2/dtc/dist/tests/ |
| path-references.c | 58 int n1, n2, n3, n4; local
66 n2 = fdt_path_offset(fdt, "/node2");
67 if (n2 < 0)
68 FAIL("fdt_path_offset(/node2): %s", fdt_strerror(n2));
71 check_ref(fdt, n2, "/node1");
|
| references.c | 68 int n1, n2, n3, n4, n5, n6, err; local
77 n2 = fdt_path_offset(fdt, "/node2");
78 if (n2 < 0)
79 FAIL("fdt_path_offset(/node2): %s", fdt_strerror(n2));
94 h2 = fdt_get_phandle(fdt, n2);
125 check_ref(fdt, n2, h1);
|
| /src/lib/libm/ld128/ |
| s_expl.c | 205 int k, n, n2; local
266 /* Reduce x to (k*ln2 + endpoint[n2] + r1 + r2). */
269 n2 = (unsigned)n % INTERVALS;
282 * expl(endpoint[n2] + r1 + r2) = tbl[n2] * expl(r1 + r2).
288 t = tbl[n2].lo + tbl[n2].hi;
291 t = SUM2P(tbl[n2].hi - 1, tbl[n2].lo * (r1 + 1) + t * q +
292 tbl[n2].hi * r1)
[all...] |
| /src/external/bsd/bc/dist/ |
| number.c | 150 than N2 and +1 if N1 is greater than N2. If USE_SIGN is false, just
154 _bc_do_compare ( bc_num n1, bc_num n2, int use_sign, int ignore_last )
160 if (use_sign && n1->n_sign != n2->n_sign)
163 return (1); /* Positive N1 > Negative N2 */
169 if (n1->n_len != n2->n_len)
171 if (n1->n_len > n2->n_len)
173 /* Magnitude of n1 > n2. */
181 /* Magnitude of n1 < n2. */
191 count = n1->n_len + MIN (n1->n_scale, n2->n_scale)
[all...] |
| number.h | 110 int bc_compare (bc_num n1, bc_num n2);
118 void bc_add (bc_num n1, bc_num n2, bc_num *result, int scale_min);
120 void bc_sub (bc_num n1, bc_num n2, bc_num *result, int scale_min);
122 void bc_multiply (bc_num n1, bc_num n2, bc_num *prod, int scale);
124 int bc_divide (bc_num n1, bc_num n2, bc_num *quot, int scale);
|
| /src/external/gpl2/xcvs/dist/src/ |
| hardlink.c | 227 Node *n1, *n2; local
234 n2 = links2->list->next;
236 while (n1 != links1->list && n2 != links2->list)
245 p2 = strrchr (n2->key, '/');
247 p2 = n2->key;
256 n2 = n2->next;
261 return (n1 == links1->list && n2 == links2->list);
|
| /src/external/gpl3/gcc.old/dist/libquadmath/printf/ |
| divrem.c | 96 mp_limb_t n1, n0, n2; local
144 n2 = np[0];
146 if (n1 > r || (n1 == r && n0 > n2))
158 sub_ddmmss (n1, n0, r, n2, n1, n0);
188 mp_limb_t n1, n2; local
194 n2 = np[dsize];
198 n2 = np[dsize - 1];
231 if (n2 != cy_limb)
|
| /src/external/gpl2/gettext/dist/gettext-tools/src/ |
| format-php.c | 91 unsigned int n2 = ((const struct numbered_arg *) p2)->number; local
93 return (n1 > n2 ? 1 : n1 < n2 ? -1 : 0);
322 unsigned int n2 = spec2->numbered_arg_count; local
326 for (i = 0, j = 0; i < n1 || j < n2; )
329 j >= n2 ? -1 :
360 for (i = 0, j = 0; j < n2; )
|
| format-boost.c | 111 unsigned int n2 = ((const struct numbered_arg *) p2)->number; local
113 return (n1 > n2 ? 1 : n1 < n2 ? -1 : 0);
574 unsigned int n2 = spec2->numbered_arg_count; local
578 for (i = 0, j = 0; i < n1 || j < n2; )
581 j >= n2 ? -1 :
612 for (i = 0, j = 0; j < n2; )
|
| /src/external/bsd/ipf/dist/tools/ |
| ipsyncm.c | 64 int nfd = -1, lfd = -1, n1, n2, n3, len; local
208 n2 = sizeof(*sh) + len;
209 n3 = write(nfd, buff, n2);
216 if (n3 != n2) {
218 n3, n2);
231 inbuf -= n2;
233 bcopy(buff+n2, buff, inbuf);
|
| /src/bin/ps/ |
| keyword.c | 70 #define UID(n1, n2, of) \
71 { .name = n1, .header = n2, .flag = 0, .oproc = pvar, \
73 #define GID(n1, n2, off) UID(n1, n2, off)
76 #define PID(n1, n2, of) \
77 { .name = n1, .header = n2, .flag = 0, .oproc = pvar, \
80 #define LVAR(n1, n2, fl, of, ty, fm) \
81 { .name = n1, .header = n2, .flag = (fl) | LWP, .oproc = pvar, \
83 #define PVAR(n1, n2, fl, of, ty, fm) \
84 { .name = n1, .header = n2, .flag = (fl) | 0, .oproc = pvar,
[all...] |
| /src/sbin/ldconfig/ |
| shlib.c | 136 cmpndewey(int d1[], int n1, int d2[], int n2)
140 for (i = 0; i < n1 && i < n2; i++) {
147 if (n1 == n2)
153 if (i == n2)
|
