| /external/dropbear/libtommath/ |
| 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) {
|
| 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;
|
| 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) {
|
| 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-1] have the carry cleared (see after the inner loop
[all...] |
| 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) {
|
| 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;
|
| /bionic/libm/upstream-freebsd/lib/msun/src/ |
| s_logb.c | 33 int32_t lx,ix; local
34 EXTRACT_WORDS(ix,lx,x);
35 ix &= 0x7fffffff; /* high |x| */
36 if((ix|lx)==0) return -1.0/fabs(x);
37 if(ix>=0x7ff00000) return x*x;
38 if(ix<0x00100000) {
40 GET_HIGH_WORD(ix,x);
41 ix &= 0x7fffffff;
42 return (double) ((ix>>20)-1023-54);
44 return (double) ((ix>>20)-1023)
[all...] |
| s_logbf.c | 28 int32_t ix; local
29 GET_FLOAT_WORD(ix,x);
30 ix &= 0x7fffffff; /* high |x| */
31 if(ix==0) return (float)-1.0/fabsf(x);
32 if(ix>=0x7f800000) return x*x;
33 if(ix<0x00800000) {
35 GET_FLOAT_WORD(ix,x);
36 ix &= 0x7fffffff;
37 return (float) ((ix>>23)-127-25);
39 return (float) ((ix>>23)-127)
[all...] |
| e_sqrtf.c | 30 int32_t ix,s,q,m,t,i; local
33 GET_FLOAT_WORD(ix,x);
36 if((ix&0x7f800000)==0x7f800000) {
41 if(ix<=0) {
42 if((ix&(~sign))==0) return x;/* sqrt(+-0) = +-0 */
43 else if(ix<0)
47 m = (ix>>23);
49 for(i=0;(ix&0x00800000)==0;i++) ix<<=1;
53 ix = (ix&0x007fffff)|0x00800000
[all...] |
| s_fabsf.c | 29 u_int32_t ix; local
30 GET_FLOAT_WORD(ix,x);
31 SET_FLOAT_WORD(x,ix&0x7fffffff);
|
| s_finitef.c | 29 int32_t ix; local
30 GET_FLOAT_WORD(ix,x);
31 return (int)((u_int32_t)((ix&0x7fffffff)-0x7f800000)>>31);
|
| s_frexp.c | 37 int32_t hx, ix, lx; local
39 ix = 0x7fffffff&hx;
41 if(ix>=0x7ff00000||((ix|lx)==0)) return x; /* 0,inf,nan */
42 if (ix<0x00100000) { /* subnormal */
45 ix = hx&0x7fffffff;
48 *eptr += (ix>>20)-1022;
|
| s_frexpf.c | 28 int32_t hx,ix; local
30 ix = 0x7fffffff&hx;
32 if(ix>=0x7f800000||(ix==0)) return x; /* 0,inf,nan */
33 if (ix<0x00800000) { /* subnormal */
36 ix = hx&0x7fffffff;
39 *eptr += (ix>>23)-126;
|
| e_cosh.c | 47 int32_t ix; local
50 GET_HIGH_WORD(ix,x);
51 ix &= 0x7fffffff;
54 if(ix>=0x7ff00000) return x*x;
57 if(ix<0x3fd62e43) {
60 if (ix<0x3c800000) return w; /* cosh(tiny) = 1 */
65 if (ix < 0x40360000) {
71 if (ix < 0x40862E42) return half*__ieee754_exp(fabs(x));
74 if (ix<=0x408633CE)
|
| e_coshf.c | 28 int32_t ix; local
30 GET_FLOAT_WORD(ix,x);
31 ix &= 0x7fffffff;
34 if(ix>=0x7f800000) return x*x;
37 if(ix<0x3eb17218) {
40 if (ix<0x39800000) return one; /* cosh(tiny) = 1 */
45 if (ix < 0x41100000) {
51 if (ix < 0x42b17217) return half*__ieee754_expf(fabsf(x));
54 if (ix<=0x42b2d4fc)
|
| s_tanf.c | 40 int32_t n, hx, ix; local
43 ix = hx & 0x7fffffff;
45 if(ix <= 0x3f490fda) { /* |x| ~<= pi/4 */
46 if(ix<0x39800000) /* |x| < 2**-12 */
50 if(ix<=0x407b53d1) { /* |x| ~<= 5*pi/4 */
51 if(ix<=0x4016cbe3) /* |x| ~<= 3pi/4 */
56 if(ix<=0x40e231d5) { /* |x| ~<= 9*pi/4 */
57 if(ix<=0x40afeddf) /* |x| ~<= 7*pi/4 */
64 else if (ix>=0x7f800000) return x-x;
|
| /external/clang/test/CodeGen/ |
| arrayderef.c | 13 int * bar(unsigned int ix) {
15 return &Foo->y[ix];
|
| /external/fdlibm/ |
| 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);
|
| 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 */
|
| 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;
|
| 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;
|
| 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;
|
| 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;
|
| /external/chromium_org/third_party/opus/src/silk/ |
| stereo_decode_pred.c | 40 opus_int n, ix[ 2 ][ 3 ]; local
45 ix[ 0 ][ 2 ] = silk_DIV32_16( n, 5 );
46 ix[ 1 ][ 2 ] = n - 5 * ix[ 0 ][ 2 ];
48 ix[ n ][ 0 ] = ec_dec_icdf( psRangeDec, silk_uniform3_iCDF, 8 );
49 ix[ n ][ 1 ] = ec_dec_icdf( psRangeDec, silk_uniform5_iCDF, 8 );
54 ix[ n ][ 0 ] += 3 * ix[ n ][ 2 ];
55 low_Q13 = silk_stereo_pred_quant_Q13[ ix[ n ][ 0 ] ];
56 step_Q13 = silk_SMULWB( silk_stereo_pred_quant_Q13[ ix[ n ][ 0 ] + 1 ] - low_Q13
[all...] |
| stereo_encode_pred.c | 37 opus_int8 ix[ 2 ][ 3 ] /* I Quantization indices */
43 n = 5 * ix[ 0 ][ 2 ] + ix[ 1 ][ 2 ];
47 silk_assert( ix[ n ][ 0 ] < 3 );
48 silk_assert( ix[ n ][ 1 ] < STEREO_QUANT_SUB_STEPS );
49 ec_enc_icdf( psRangeEnc, ix[ n ][ 0 ], silk_uniform3_iCDF, 8 );
50 ec_enc_icdf( psRangeEnc, ix[ n ][ 1 ], silk_uniform5_iCDF, 8 );
|
