| /src/external/bsd/pcc/dist/pcc/cc/cpp/ |
| 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);
67 ND n1; local
[all...] |
| /src/external/gpl3/gcc/dist/libgcc/config/alpha/ |
| qrnnd.S | 50 #define n1 $17 define
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,n
[all...] |
| /src/external/gpl3/gcc.old/dist/libgcc/config/alpha/ |
| qrnnd.S | 50 #define n1 $17 define
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,n
[all...] |
| /src/sys/arch/atari/stand/tostools/aptck/ |
| 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)
|
| /src/external/gpl3/gcc/dist/libquadmath/printf/ |
| divrem.c | 69 mp_limb_t n1; local
73 n1 = np[nsize - 1];
75 if (n1 >= d)
77 n1 -= d;
83 udiv_qrnnd (qp[i], n1, n1, np[i], d);
87 udiv_qrnnd (qp[i], n1, n1, 0, d);
89 np[0] = n1;
96 mp_limb_t n1, n0, n2 local
188 mp_limb_t n1, n2; local
[all...] |
| /src/external/gpl3/gcc.old/dist/libquadmath/printf/ |
| divrem.c | 69 mp_limb_t n1; local
73 n1 = np[nsize - 1];
75 if (n1 >= d)
77 n1 -= d;
83 udiv_qrnnd (qp[i], n1, n1, np[i], d);
87 udiv_qrnnd (qp[i], n1, n1, 0, d);
89 np[0] = n1;
96 mp_limb_t n1, n0, n2 local
188 mp_limb_t n1, n2; local
[all...] |
| /src/external/gpl3/gcc/dist/libgfortran/generated/ |
| bessel_r10.c | 38 extern void bessel_jn_r10 (gfc_array_r10 * const restrict ret, int n1,
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++)
80 ret->base_addr[(n2-n1)*stride] = last1;
82 if (n1 == n2
[all...] |
| bessel_r16.c | 46 extern void bessel_jn_r16 (gfc_array_r16 * const restrict ret, int n1,
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++)
88 ret->base_addr[(n2-n1)*stride] = last1;
90 if (n1 == n2
[all...] |
| bessel_r17.c | 44 extern void bessel_jn_r17 (gfc_array_r17 * const restrict ret, int n1,
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++)
86 ret->base_addr[(n2-n1)*stride] = last1;
88 if (n1 == n2
[all...] |
| bessel_r4.c | 38 extern void bessel_jn_r4 (gfc_array_r4 * const restrict ret, int n1,
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++)
80 ret->base_addr[(n2-n1)*stride] = last1;
82 if (n1 == n2
[all...] |
| bessel_r8.c | 38 extern void bessel_jn_r8 (gfc_array_r8 * const restrict ret, int n1,
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++)
80 ret->base_addr[(n2-n1)*stride] = last1;
82 if (n1 == n2
[all...] |
| /src/external/gpl3/gcc.old/dist/libgfortran/generated/ |
| bessel_r10.c | 38 extern void bessel_jn_r10 (gfc_array_r10 * const restrict ret, int n1,
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++)
80 ret->base_addr[(n2-n1)*stride] = last1;
82 if (n1 == n2
[all...] |
| bessel_r16.c | 42 extern void bessel_jn_r16 (gfc_array_r16 * const restrict ret, int n1,
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++)
84 ret->base_addr[(n2-n1)*stride] = last1;
86 if (n1 == n2
[all...] |
| bessel_r17.c | 42 extern void bessel_jn_r17 (gfc_array_r17 * const restrict ret, int n1,
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++)
84 ret->base_addr[(n2-n1)*stride] = last1;
86 if (n1 == n2
[all...] |
| bessel_r4.c | 38 extern void bessel_jn_r4 (gfc_array_r4 * const restrict ret, int n1,
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++)
80 ret->base_addr[(n2-n1)*stride] = last1;
82 if (n1 == n2
[all...] |
| bessel_r8.c | 38 extern void bessel_jn_r8 (gfc_array_r8 * const restrict ret, int n1,
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++)
80 ret->base_addr[(n2-n1)*stride] = last1;
82 if (n1 == n2
[all...] |
| /src/external/lgpl3/gmp/dist/mpn/generic/ |
| sbpi1_divappr_q.c | 51 mp_limb_t n1, n0; local
83 n1 = np[1];
88 if (UNLIKELY (n1 == d1) && np[1] == d0)
92 n1 = np[1]; /* update n1, last loop's value will now be invalid */
96 udiv_qr_3by2 (q, n1, n0, n1, np[1], np[0], d1, d0, dinv);
102 cy = n1 < cy1;
103 n1 -= cy1;
108 n1 += d1 + mpn_add_n (np - dn, np - dn, dp, dn + 1)
[all...] |
| 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
149 n1 = n >> 1;
151 n1 = n * 11 / (size_t) 36; /* n1 ~= n*(1-.694...) */
153 n1 = n * 9 / (size_t) 40; /* n1 ~= n*(1-.775...) */
155 n1 = n * 7 / (size_t) 39; /* n1 ~= n*(1-.821...) *
[all...] |
| sbpi1_div_qr.c | 50 mp_limb_t n1, n0; local
74 n1 = np[1];
79 if (UNLIKELY (n1 == d1) && np[1] == d0)
83 n1 = np[1]; /* update n1, last loop's value will now be invalid */
87 udiv_qr_3by2 (q, n1, n0, n1, np[1], np[0], d1, d0, dinv);
93 cy = n1 < cy1;
94 n1 = (n1 - cy1) & GMP_NUMB_MASK
[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
151 n1 = n >> 1;
153 n1 = n * 11 / (size_t) 36; /* n1 ~= n*(1-.694...) */
155 n1 = n * 9 / (size_t) 40; /* n1 ~= n*(1-.775...) */
157 n1 = n * 7 / (size_t) 39; /* n1 ~= n*(1-.821...) *
[all...] |
| /src/crypto/external/apache2/openssl/dist/ms/ |
| 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;
|
| /src/crypto/external/bsd/openssl/dist/ms/ |
| 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;
|
| /src/crypto/external/bsd/openssl.old/dist/ms/ |
| 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;
|
| /src/crypto/external/bsd/heimdal/dist/lib/hcrypto/libtommath/ |
| bn_mp_prime_miller_rabin.c | 29 mp_int n1, y, r; local
40 /* get n1 = a - 1 */
41 if ((err = mp_init_copy (&n1, a)) != MP_OKAY) {
44 if ((err = mp_sub_d (&n1, 1, &n1)) != MP_OKAY) {
48 /* set 2**s * r = n1 */
49 if ((err = mp_init_copy (&r, &n1)) != MP_OKAY) {
71 /* if y != 1 and y != n1 do */
72 if (mp_cmp_d (&y, 1) != MP_EQ && mp_cmp (&y, &n1) != MP_EQ) {
74 /* while j <= s-1 and y != n1 */
[all...] |
| /src/external/gpl3/gcc.old/dist/libgcc/config/spu/ |
| divmodti4.c | 97 qword mask, r1, n1; local
106 // n1 = n0 - d0 in TImode
107 n1 = si_bg (d0, n0);
108 n1 = si_shlqbyi (n1, 4);
109 n1 = si_sf (m1, n1);
110 n1 = si_bgx (d0, n0, n1);
111 n1 = si_shlqbyi (n1, 4)
[all...] |
