/external/dropbear/libtommath/ |
H A D | bn_mp_dr_is_modulus.c | 21 int ix; local 31 for (ix = 1; ix < a->used; ix++) { 32 if (a->dp[ix] != MP_MASK) {
|
H A D | bn_reverse.c | 22 int ix, iy; local 25 ix = 0; 27 while (ix < iy) { 28 t = s[ix]; 29 s[ix] = s[iy]; 31 ++ix;
|
H A D | bn_mp_prime_is_divisible.c | 25 int err, ix; local 31 for (ix = 0; ix < PRIME_SIZE; ix++) { 32 /* what is a mod LBL_prime_tab[ix] */ 33 if ((err = mp_mod_d (a, ltm_prime_tab[ix], &res)) != MP_OKAY) {
|
H A D | bn_fast_mp_montgomery_reduce.c | 28 int ix, res, olduse; local 55 for (ix = 0; ix < x->used; ix++) { 60 for (; ix < n->used * 2 + 1; ix++) { 68 for (ix = 0; ix < n->used; ix++) { 73 * that W[ix [all...] |
H A D | bn_mp_reduce_is_2k_l.c | 21 int ix, iy; local 29 for (iy = ix = 0; ix < a->used; ix++) { 30 if (a->dp[ix] == MP_MASK) {
|
H A D | bn_mp_and.c | 22 int res, ix, px; local 39 for (ix = 0; ix < px; ix++) { 40 t.dp[ix] &= x->dp[ix]; 44 for (; ix < t.used; ix++) { 45 t.dp[ix] = 0;
|
H A D | bn_mp_prime_is_prime.c | 28 int ix, err, res; local 39 for (ix = 0; ix < PRIME_SIZE; ix++) { 40 if (mp_cmp_d(a, ltm_prime_tab[ix]) == MP_EQ) { 61 for (ix = 0; ix < t; ix++) { 63 mp_set (&b, ltm_prime_tab[ix]);
|
H A D | bn_fast_s_mp_mul_digs.c | 36 int olduse, res, pa, ix, iz; local 52 for (ix = 0; ix < pa; ix++) { 58 ty = MIN(b->used-1, ix); 59 tx = ix - ty; 77 W[ix] = ((mp_digit)_W) & MP_MASK; 90 for (ix = 0; ix < pa+1; ix [all...] |
H A D | bn_fast_s_mp_mul_high_digs.c | 29 int olduse, res, pa, ix, iz; local 44 for (ix = digs; ix < pa; ix++) { 49 ty = MIN(b->used-1, ix); 50 tx = ix - ty; 67 W[ix] = ((mp_digit)_W) & MP_MASK; 81 for (ix = digs; ix < pa; ix [all...] |
H A D | bn_fast_s_mp_sqr.c | 30 int olduse, res, pa, ix, iz; local 44 for (ix = 0; ix < pa; ix++) { 53 ty = MIN(a->used-1, ix); 54 tx = ix - ty; 80 if ((ix&1) == 0) { 81 _W += ((mp_word)a->dp[ix>>1])*((mp_word)a->dp[ix>>1]); 85 W[ix] [all...] |
H A D | bn_mp_reduce_is_2k.c | 21 int ix, iy, iw; local 34 for (ix = DIGIT_BIT; ix < iy; ix++) {
|
H A D | bn_s_mp_sqr.c | 22 int res, ix, iy, pa; local 34 for (ix = 0; ix < pa; ix++) { 35 /* first calculate the digit at 2*ix */ 37 r = ((mp_word) t.dp[2*ix]) + 38 ((mp_word)a->dp[ix])*((mp_word)a->dp[ix]); 41 t.dp[ix+ix] [all...] |
H A D | bn_mp_mul_d.c | 24 int ix, res, olduse; local 49 for (ix = 0; ix < a->used; ix++) { 60 /* store final carry [if any] and increment ix offset */ 62 ++ix; 65 while (ix++ < olduse) {
|
H A D | bn_mp_or.c | 21 int res, ix, px; local 38 for (ix = 0; ix < px; ix++) { 39 t.dp[ix] |= x->dp[ix];
|
H A D | bn_mp_xor.c | 22 int res, ix, px; local 39 for (ix = 0; ix < px; ix++) { 40 t.dp[ix] ^= x->dp[ix];
|
/external/clang/test/CodeGen/ |
H A D | arrayderef.c | 13 int * bar(unsigned int ix) { argument 15 return &Foo->y[ix];
|
/external/fdlibm/ |
H A D | s_logb.c | 29 int lx,ix; local 30 ix = (__HI(x))&0x7fffffff; /* high |x| */ 32 if((ix|lx)==0) return -1.0/ieee_fabs(x); 33 if(ix>=0x7ff00000) return x*x; 34 if((ix>>=20)==0) /* IEEE 754 logb */ 37 return (double) (ix-1023);
|
H A D | s_tan.c | 54 int n, ix; local 57 ix = __HI(x); 60 ix &= 0x7fffffff; 61 if(ix <= 0x3fe921fb) return __kernel_tan(x,z,1); 64 else if (ix>=0x7ff00000) return x-x; /* NaN */
|
H A D | s_ilogb.c | 29 int hx,lx,ix; local 38 for (ix = -1043; lx>0; lx<<=1) ix -=1; 40 for (ix = -1022,hx<<=11; hx>0; hx<<=1) ix -=1; 42 return ix;
|
H A D | s_frexp.c | 40 int hx, ix, lx; local 42 ix = 0x7fffffff&hx; 45 if(ix>=0x7ff00000||((ix|lx)==0)) return x; /* 0,inf,nan */ 46 if (ix<0x00100000) { /* subnormal */ 49 ix = hx&0x7fffffff; 52 *eptr += (ix>>20)-1022;
|
H A D | s_cos.c | 55 int n, ix; local 58 ix = __HI(x); 61 ix &= 0x7fffffff; 62 if(ix <= 0x3fe921fb) return __kernel_cos(x,z); 65 else if (ix>=0x7ff00000) return x-x;
|
H A D | s_sin.c | 55 int n, ix; local 58 ix = __HI(x); 61 ix &= 0x7fffffff; 62 if(ix <= 0x3fe921fb) return __kernel_sin(x,z,0); 65 else if (ix>=0x7ff00000) return x-x;
|
H A D | e_atanh.c | 51 int hx,ix; local 55 ix = hx&0x7fffffff; 56 if ((ix|((lx|(-lx))>>31))>0x3ff00000) /* |x|>1 */ 58 if(ix==0x3ff00000) 60 if(ix<0x3e300000&&(huge+x)>zero) return x; /* x<2**-28 */ 61 __HI(x) = ix; /* x <- |x| */ 62 if(ix<0x3fe00000) { /* x < 0.5 */
|
H A D | e_cosh.c | 51 int ix; local 55 ix = __HI(x); 56 ix &= 0x7fffffff; 59 if(ix>=0x7ff00000) return x*x; 62 if(ix<0x3fd62e43) { 65 if (ix<0x3c800000) return w; /* ieee_cosh(tiny) = 1 */ 70 if (ix < 0x40360000) { 76 if (ix < 0x40862E42) return half*__ieee754_exp(ieee_fabs(x)); 80 if (ix<0x408633CE || 81 (ix [all...] |
H A D | s_asinh.c | 44 int hx,ix; local 46 ix = hx&0x7fffffff; 47 if(ix>=0x7ff00000) return x+x; /* x is inf or NaN */ 48 if(ix< 0x3e300000) { /* |x|<2**-28 */ 51 if(ix>0x41b00000) { /* |x| > 2**28 */ 53 } else if (ix>0x40000000) { /* 2**28 > |x| > 2.0 */
|