| /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/crypto/external/apache2/openssl/dist/crypto/bn/asm/ |
| ia64-mont.pl | 375 n1=r24; n2=r25; n3=r26; n4=r27; n5=r28; n6=r29; n7=r30; n8=r31;
605 { .mii; (p16) getf.sig n1=nlo[1] // 19:
630 (p16) add a1=a1,n1 } // (p16) a1+=n1
640 { .mfi; (p16) cmp.ltu.unc p42,p40=a1,n1
676 { .mmi; (p0) getf.sig n1=ni0 // 0:
774 sub n1=t0,n1 };;
775 { .mmi; cmp.gtu p34,p32=n1,t0;;
820 { .mmi; (p32)st8 [rptr]=n1,
766 sub n1=t0,n1 };; subroutine
[all...] |
| /src/crypto/external/bsd/openssl/dist/crypto/bn/asm/ |
| ia64-mont.pl | 375 n1=r24; n2=r25; n3=r26; n4=r27; n5=r28; n6=r29; n7=r30; n8=r31;
605 { .mii; (p16) getf.sig n1=nlo[1] // 19:
630 (p16) add a1=a1,n1 } // (p16) a1+=n1
640 { .mfi; (p16) cmp.ltu.unc p42,p40=a1,n1
676 { .mmi; (p0) getf.sig n1=ni0 // 0:
774 sub n1=t0,n1 };;
775 { .mmi; cmp.gtu p34,p32=n1,t0;;
820 { .mmi; (p32)st8 [rptr]=n1,
766 sub n1=t0,n1 };; subroutine
[all...] |
| /src/crypto/external/bsd/openssl.old/dist/crypto/bn/asm/ |
| ia64-mont.pl | 374 n1=r24; n2=r25; n3=r26; n4=r27; n5=r28; n6=r29; n7=r30; n8=r31;
604 { .mii; (p16) getf.sig n1=nlo[1] // 19:
629 (p16) add a1=a1,n1 } // (p16) a1+=n1
639 { .mfi; (p16) cmp.ltu.unc p42,p40=a1,n1
675 { .mmi; (p0) getf.sig n1=ni0 // 0:
773 sub n1=t0,n1 };;
774 { .mmi; cmp.gtu p34,p32=n1,t0;;
819 { .mmi; (p32)st8 [rptr]=n1,
765 sub n1=t0,n1 };; subroutine
[all...] |
| /src/external/lgpl3/gmp/dist/mpn/generic/ |
| 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...] |
| pre_divrem_1.c | 67 mp_limb_t n1, n0; local
118 n1 = ap[size-1];
119 r |= n1 >> (GMP_LIMB_BITS - shift);
126 ((n1 << shift) | (n0 >> (GMP_LIMB_BITS - shift))),
129 n1 = n0;
131 udiv_qrnnd_preinv (*qp, r, r, n1 << shift, d, dinv);
|
| 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...] |
| 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...] |
| dcpi1_div_qr.c | 126 mp_limb_t q, n2, n1, n0, d1, d0; local
136 n1 = np[-1];
141 ASSERT (n2 < d1 || (n2 == d1 && n1 <= d0));
143 if (UNLIKELY (n2 == d1) && n1 == d0)
151 udiv_qr_3by2 (q, n1, n0, n2, n1, n0, d1, d0, dinv->inv32);
160 cy = n1 < cy1;
161 n1 = (n1 - cy1) & GMP_NUMB_MASK;
166 n1 += d1 + mpn_add_n (np - dn, np - dn, dp - dn, dn - 1)
[all...] |
| divrem_1.c | 94 mp_limb_t n1, n0; local
175 n1 = up[un - 1] << GMP_NAIL_BITS;
176 if (n1 < d)
178 r = n1 >> GMP_NAIL_BITS;
201 n1 = up[un - 1] << GMP_NAIL_BITS;
202 r |= (n1 >> (GMP_LIMB_BITS - cnt));
206 nshift = (n1 << cnt) | (n0 >> (GMP_NUMB_BITS - cnt));
210 n1 = n0;
212 udiv_qrnnd (*qp, r, r, n1 << cnt, d);
230 n1 = up[un - 1] << GMP_NAIL_BITS
[all...] |
| 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...] |
| /src/external/lgpl3/mpc/dist/src/ |
| cmp_abs.c | 28 mpfr_t n1, n2; local
77 mpfr_init (n1);
81 mpfr_set_prec (n1, prec);
83 inex1 = mpc_norm (n1, z1, MPFR_RNDD);
85 ret = mpfr_cmp (n1, n2);
89 if (inex1 == 0) /* n1 = norm(z1) */
100 else /* n1 < norm(z1) */
109 mpfr_clear (n1);
|
| /src/usr.bin/telnet/ |
| network.c | 131 ssize_t n, n1; local
137 if ((n1 = n = ring_full_consecutive(&netoring)) > 0) {
172 if ((n1 == n) && ring_full_consecutive(&netoring)) {
|
| terminal.c | 91 int n, n0, n1; local
94 if ((n1 = n = ring_full_consecutive(&ttyoring)) > 0) {
111 if (n1 == n && n0 > n) {
112 n1 = n0 - n;
114 n1 = TerminalWrite(ttyoring.bottom, n1);
115 if (n1 > 0)
116 n += n1;
|
| /src/external/gpl2/dtc/dist/tests/ |
| path-references.c | 58 int n1, n2, n3, n4; local
63 n1 = fdt_path_offset(fdt, "/node1");
64 if (n1 < 0)
65 FAIL("fdt_path_offset(/node1): %s", fdt_strerror(n1));
70 check_ref(fdt, n1, "/node2");
|
| references.c | 68 int n1, n2, n3, n4, n5, n6, err; local
74 n1 = fdt_path_offset(fdt, "/node1");
75 if (n1 < 0)
76 FAIL("fdt_path_offset(/node1): %s", fdt_strerror(n1));
93 h1 = fdt_get_phandle(fdt, n1);
124 check_ref(fdt, n1, h2);
|
| /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/lgpl3/mpfr/dist/src/ |
| mpn_exp.c | 82 size_t bits, n1; local
126 n1 = (n * GMP_NUMB_BITS - bits) / GMP_NUMB_BITS;
128 /* square of A : {c+2n1, 2(n-n1)} = {a+n1, n-n1}^2 */
131 mpn_sqr (c + 2 * n1, a + n1, n - n1);
133 /* set {c+n, 2n1-n} to 0 : {c, n} = {a, n}^2*K^n *
[all...] |
| /src/usr.bin/uudecode/ |
| uudecode.c | 131 int n1; local
191 n1 = strlen(p);
192 if (n + n1 + 2 > MAXPATHLEN) {
197 memmove(buf + n + 1, p, n1 + 1);
|
| /src/crypto/external/apache2/openssl/dist/crypto/idea/ |
| i_skey.c | 93 long n1, n2, q, r, b1, b2, t; local
98 n1 = 0x10001;
104 r = (n1 % n2);
105 q = (n1 - r) / n2;
110 n1 = n2;
|
| /src/crypto/external/bsd/openssl/dist/crypto/idea/ |
| i_skey.c | 94 int32_t n1, n2, q, r, b1, b2, t; local
99 n1 = 0x10001;
105 r = (n1 % n2);
106 q = (n1 - r) / n2;
111 n1 = n2;
|
| /src/crypto/external/bsd/openssl.old/dist/crypto/idea/ |
| i_skey.c | 87 int32_t n1, n2, q, r, b1, b2, t; local
92 n1 = 0x10001;
98 r = (n1 % n2);
99 q = (n1 - r) / n2;
104 n1 = n2;
|
| /src/external/apache2/mDNSResponder/dist/mDNSShared/utilities/ |
| mdns_addr_tailq.c | 43 mdns_addr_with_port_t * n1 = STAILQ_FIRST(me); local
45 while (n1 != NULL) {
46 n2 = STAILQ_NEXT(n1, __entries);
47 mdns_free(n1);
48 n1 = n2;
|
| /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...] |
