| /src/tests/usr.bin/xlint/lint1/ |
| msg_187.c | 16 char x0[3] = "x\0"; variable
|
| /src/sys/arch/m68k/fpe/ |
| fpu_mul.c | 103 uint32_t a2, a1, a0, x2, x1, x0, bit, m; local
145 x0 = x->fp_mant[0];
151 FPU_ADDC(a0, a0, x0)
|
| fpu_sqrt.c | 58 * Our task is to calculate the square root of a floating point number x0.
127 * a 1 bit in the first trip around the loop (since x0 < 2^NBITS). If the
133 * and the result q will then be sqrt(x0) * 2^floor(NBITS / 2).
135 * value, for which q is some power of two times its square root, x0.)
140 * q = y = 0; x = x0;
156 * If x0 is fixed point, rather than an integer, we can simply alter the
157 * scale factor between q and sqrt(x0). As it happens, we can easily arrange
158 * for the scale factor to be 2**0 or 1, so that sqrt(x0) == q.
160 * In our case, however, x0 (and therefore x, y, q, and t) are multiword
170 * intermediate calculations can overflow. We know that x0 is in [1..4
193 uint32_t x0, x1, x2; local
[all...] |
| /src/sys/external/isc/libsodium/dist/src/libsodium/include/sodium/private/ |
| sse2_64_32.h | 22 union { int64_t as64; int32_t as32[2]; } x0, x1; local
23 x0.as64 = q0; x1.as64 = q1;
24 return _mm_set_epi32(x1.as32[1], x1.as32[0], x0.as32[1], x0.as32[0]);
|
| /src/crypto/external/bsd/heimdal/dist/lib/hcrypto/libtommath/ |
| bn_mp_karatsuba_mul.c | 51 mp_int x0, x1, y0, y1, t1, x0y0, x1y1; local
64 if (mp_init_size (&x0, B) != MP_OKAY)
67 goto X0;
82 x0.used = y0.used = B;
96 tmpx = x0.dp;
117 mp_clamp (&x0);
121 /* after this x0 is no longer required, free temp [x0==t2]! */
122 if (mp_mul (&x0, &y0, &x0y0) != MP_OKAY)
123 goto X1Y1; /* x0y0 = x0*y0 *
[all...] |
| bn_mp_karatsuba_sqr.c | 29 mp_int x0, x1, t1, t2, x0x0, x1x1; local
41 if (mp_init_size (&x0, B) != MP_OKAY)
44 goto X0;
63 dst = x0.dp;
74 x0.used = B;
77 mp_clamp (&x0);
79 /* now calc the products x0*x0 and x1*x1 */
80 if (mp_sqr (&x0, &x0x0) != MP_OKAY)
81 goto X1X1; /* x0x0 = x0*x0 *
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/fortran/ |
| bbt.cc | 56 static int x0 = 5341; local
58 x0 = (22611 * x0 + 10) % 44071;
59 return x0;
|
| /src/external/lgpl3/gmp/dist/mpn/generic/ |
| sqr_basecase.c | 178 mp_limb_t x0, x1; local
211 x0 = rp[i + 0];
212 rp[i + 0] = (-x0) & GMP_NUMB_MASK;
214 rp[i + 1] = (-x1 - (x0 != 0)) & GMP_NUMB_MASK;
215 __GMPN_SUB_1 (cy, rp + i + 2, rp + i + 2, 2, (x1 | x0) != 0);
223 mp_limb_t x0, x1; local
261 x0 = rp[i + 0];
262 rp[i + 0] = (-x0) & GMP_NUMB_MASK;
264 rp[i + 1] = (-x1 - (x0 != 0)) & GMP_NUMB_MASK;
267 __GMPN_SUB_1 (cy, rp + i + 2, rp + i + 2, 2, (x1 | x0) != 0)
[all...] |
| /src/sys/arch/powerpc/fpu/ |
| fpu_mul.c | 109 u_int a3, a2, a1, a0, x3, x2, x1, x0, bit, m; local
166 x0 = x->fp_mant[0];
173 FPU_ADDC(a0, a0, x0)
|
| fpu_sqrt.c | 62 * Our task is to calculate the square root of a floating point number x0.
131 * a 1 bit in the first trip around the loop (since x0 < 2^NBITS). If the
137 * and the result q will then be sqrt(x0) * 2^floor(NBITS / 2).
139 * value, for which q is some power of two times its square root, x0.)
144 * q = y = 0; x = x0;
160 * If x0 is fixed point, rather than an integer, we can simply alter the
161 * scale factor between q and sqrt(x0). As it happens, we can easily arrange
162 * for the scale factor to be 2**0 or 1, so that sqrt(x0) == q.
164 * In our case, however, x0 (and therefore x, y, q, and t) are multiword
174 * intermediate calculations can overflow. We know that x0 is in [1..4
197 u_int x0, x1, x2, x3; local
[all...] |
| /src/sys/arch/sparc/fpu/ |
| fpu_mul.c | 105 u_int a3, a2, a1, a0, x3, x2, x1, x0, bit, m; local
149 x0 = x->fp_mant[0];
156 FPU_ADDC(a0, a0, x0)
|
| fpu_sqrt.c | 58 * Our task is to calculate the square root of a floating point number x0.
127 * a 1 bit in the first trip around the loop (since x0 < 2^NBITS). If the
133 * and the result q will then be sqrt(x0) * 2^floor(NBITS / 2).
135 * value, for which q is some power of two times its square root, x0.)
140 * q = y = 0; x = x0;
156 * If x0 is fixed point, rather than an integer, we can simply alter the
157 * scale factor between q and sqrt(x0). As it happens, we can easily arrange
158 * for the scale factor to be 2**0 or 1, so that sqrt(x0) == q.
160 * In our case, however, x0 (and therefore x, y, q, and t) are multiword
170 * intermediate calculations can overflow. We know that x0 is in [1..4
193 u_int x0, x1, x2, x3; local
[all...] |
| /src/sys/external/isc/libsodium/dist/src/libsodium/crypto_core/hsalsa20/ref2/ |
| core_hsalsa20_ref2.c | 22 uint32_t x0, x1, x2, x3, x4, x5, x6, x7, x8, local
27 x0 = U32C(0x61707865);
32 x0 = LOAD32_LE(c + 0);
51 x4 ^= ROTL32(x0 + x12, 7);
52 x8 ^= ROTL32(x4 + x0, 9);
54 x0 ^= ROTL32(x12 + x8, 18);
67 x1 ^= ROTL32(x0 + x3, 7);
68 x2 ^= ROTL32(x1 + x0, 9);
70 x0 ^= ROTL32(x3 + x2, 18);
85 STORE32_LE(out + 0, x0);
[all...] |
| /src/crypto/external/apache2/openssl/dist/crypto/rc2/ |
| rc2_cbc.c | 98 register RC2_INT x0, x1, x2, x3, t; local
102 x0 = (RC2_INT)l & 0xffff;
113 t = (x0 + (x1 & ~x3) + (x2 & x3) + *(p0++)) & 0xffff;
114 x0 = (t << 1) | (t >> 15);
115 t = (x1 + (x2 & ~x0) + (x3 & x0) + *(p0++)) & 0xffff;
117 t = (x2 + (x3 & ~x1) + (x0 & x1) + *(p0++)) & 0xffff;
119 t = (x3 + (x0 & ~x2) + (x1 & x2) + *(p0++)) & 0xffff;
127 x0 += p1[x3 & 0x3f];
128 x1 += p1[x0 & 0x3f]
142 register RC2_INT x0, x1, x2, x3, t; local
[all...] |
| /src/crypto/external/bsd/openssl/dist/crypto/rc2/ |
| rc2_cbc.c | 98 register RC2_INT x0, x1, x2, x3, t; local
102 x0 = (RC2_INT) l & 0xffff;
113 t = (x0 + (x1 & ~x3) + (x2 & x3) + *(p0++)) & 0xffff;
114 x0 = (t << 1) | (t >> 15);
115 t = (x1 + (x2 & ~x0) + (x3 & x0) + *(p0++)) & 0xffff;
117 t = (x2 + (x3 & ~x1) + (x0 & x1) + *(p0++)) & 0xffff;
119 t = (x3 + (x0 & ~x2) + (x1 & x2) + *(p0++)) & 0xffff;
127 x0 += p1[x3 & 0x3f];
128 x1 += p1[x0 & 0x3f]
144 register RC2_INT x0, x1, x2, x3, t; local
[all...] |
| /src/crypto/external/bsd/openssl.old/dist/crypto/rc2/ |
| rc2_cbc.c | 92 register RC2_INT x0, x1, x2, x3, t; local
96 x0 = (RC2_INT) l & 0xffff;
107 t = (x0 + (x1 & ~x3) + (x2 & x3) + *(p0++)) & 0xffff;
108 x0 = (t << 1) | (t >> 15);
109 t = (x1 + (x2 & ~x0) + (x3 & x0) + *(p0++)) & 0xffff;
111 t = (x2 + (x3 & ~x1) + (x0 & x1) + *(p0++)) & 0xffff;
113 t = (x3 + (x0 & ~x2) + (x1 & x2) + *(p0++)) & 0xffff;
121 x0 += p1[x3 & 0x3f];
122 x1 += p1[x0 & 0x3f]
138 register RC2_INT x0, x1, x2, x3, t; local
[all...] |
| /src/external/gpl3/gcc/dist/gcc/fortran/ |
| bbt.cc | 56 static int x0 = 5341; local
58 x0 = (22611 * x0 + 10) % 44071;
59 return x0;
|
| /src/lib/libc/gdtoa/ |
| smisc.c | 182 ULong *x, *x0, x1, x2; local
196 x0 = x;
198 while(x > x0)
|
| gdtoa.c | 45 ULong *be, *x, *x0; local
61 x = x0 = b->x;
68 ptrdiff_t td = x - x0;
71 while(!x0[--i])
|
| /src/sys/external/isc/libsodium/dist/src/libsodium/crypto_core/hchacha20/ |
| core_hchacha20.c | 21 uint32_t x0, x1, x2, x3, x4, x5, x6, x7; local
25 x0 = 0x61707865;
30 x0 = LOAD32_LE(c + 0);
49 QUARTERROUND(x0, x4, x8, x12);
53 QUARTERROUND(x0, x5, x10, x15);
59 STORE32_LE(out + 0, x0);
|
| /src/tests/dev/usb/ |
| t_hid.c | 187 &hi.loc), 0x0); local
204 &hi.loc), 0x0); local
221 &hi.loc), 0x0); local
|
| /src/crypto/external/cpl/trousers/dist/src/tspi/daa/daa_issuer/ |
| keypair_generator.c | 109 bi_ptr x0 = NULL; local
204 x0 = bi_new_ptr();
205 bi_set(x0, pair[EXPONENT]);
305 xz, x0, x1, x);
339 // FREE_BI(x0);
387 FREE_BI(x0);
388 FREE_BI(x0);
|
| prime_gen.c | 168 bi_t x0; local
190 bi_new(x0);
201 bi_set(x0, x1);
203 // x1 = (x0 ^ 2) % n
204 bi_mod_exp(x1, x0, bi_2, n);
205 if (bi_equals_si(x1, 1) && !bi_equals_si(x0, 1) && !bi_equals(x0, n_1) != 0) {
206 bi_free(x0);
213 bi_free(x0);
|
| /src/external/lgpl3/mpfr/dist/src/ |
| gmp_op.c | 226 mpfr_t x0; local
233 MPFR_ALIAS (x0, x, MPFR_SIGN(x), 0); /* x0 = x / 2^ex */
235 inexact = mpfr_mul_z (tmp, x0, n, MPFR_RNDN);
|
| /src/games/hack/ |
| hack.c | 566 int x, y, i, x0 = 0, y0 = 0, m0 = 0, i0 = 9; local
610 if (corrct == 1 && DIST(x, y, x0, y0) != 1)
614 x0 = x;
647 if (u.dx == y0 - u.uy && u.dy == u.ux - x0)
658 if ((x0 - u.ux == y0 - u.uy && !u.dy) ||
659 (x0 - u.ux != y0 - u.uy && u.dy))
667 u.dx = x0 - u.ux, u.dy = y0 - u.uy;
|
