HomeSort by relevance Sort by last modified time
    Searched refs:ix (Results 1 - 25 of 179) sorted by null

1 2 3 4 5 6 7 8

  /bionic/libm/src/
s_logbf.c 29 int32_t ix; local
30 GET_FLOAT_WORD(ix,x);
31 ix &= 0x7fffffff; /* high |x| */
32 if(ix==0) return (float)-1.0/fabsf(x);
33 if(ix>=0x7f800000) return x*x;
34 if(ix<0x00800000) {
36 GET_FLOAT_WORD(ix,x);
37 ix &= 0x7fffffff;
38 return (float) ((ix>>23)-127-25);
40 return (float) ((ix>>23)-127)
    [all...]
s_logb.c 32 int32_t lx,ix; local
33 EXTRACT_WORDS(ix,lx,x);
34 ix &= 0x7fffffff; /* high |x| */
35 if((ix|lx)==0) return -1.0/fabs(x);
36 if(ix>=0x7ff00000) return x*x;
37 if(ix<0x00100000) {
39 GET_FLOAT_WORD(ix,x);
40 ix &= 0x7fffffff;
41 return (float) ((ix>>20)-1023-54);
43 return (double) ((ix>>20)-1023)
    [all...]
s_fabsf.c 30 u_int32_t ix; local
31 GET_FLOAT_WORD(ix,x);
32 SET_FLOAT_WORD(x,ix&0x7fffffff);
s_finitef.c 30 int32_t ix; local
31 GET_FLOAT_WORD(ix,x);
32 return (int)((u_int32_t)((ix&0x7fffffff)-0x7f800000)>>31);
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_frexpf.c 29 int32_t hx,ix; local
31 ix = 0x7fffffff&hx;
33 if(ix>=0x7f800000||(ix==0)) return x; /* 0,inf,nan */
34 if (ix<0x00800000) { /* subnormal */
37 ix = hx&0x7fffffff;
40 *eptr += (ix>>23)-126;
s_ilogb.c 31 int32_t hx,lx,ix; local
40 for (ix = -1043; lx>0; lx<<=1) ix -=1;
42 for (ix = -1022,hx<<=11; hx>0; hx<<=1) ix -=1;
44 return ix;
s_tan.c 54 int32_t n, ix; local
57 GET_HIGH_WORD(ix,x);
60 ix &= 0x7fffffff;
61 if(ix <= 0x3fe921fb) {
62 if(ix<0x3e300000) /* x < 2**-28 */
68 else if (ix>=0x7ff00000) return x-x; /* NaN */
s_ilogbf.c 27 int32_t hx,ix; local
35 for (ix = -126,hx<<=8; hx>0; hx<<=1) ix -=1;
36 return ix;
s_frexp.c 39 int32_t hx, ix, lx; local
41 ix = 0x7fffffff&hx;
43 if(ix>=0x7ff00000||((ix|lx)==0)) return x; /* 0,inf,nan */
44 if (ix<0x00100000) { /* subnormal */
47 ix = hx&0x7fffffff;
50 *eptr += (ix>>20)-1022;
e_cosh.c 48 int32_t ix; local
52 GET_HIGH_WORD(ix,x);
53 ix &= 0x7fffffff;
56 if(ix>=0x7ff00000) return x*x;
59 if(ix<0x3fd62e43) {
62 if (ix<0x3c800000) return w; /* cosh(tiny) = 1 */
67 if (ix < 0x40360000) {
73 if (ix < 0x40862E42) return half*__ieee754_exp(fabs(x));
77 if (ix<0x408633CE ||
78 ((ix==0x408633ce)&&(lx<=(u_int32_t)0x8fb9f87d)))
    [all...]
e_coshf.c 29 int32_t ix; local
31 GET_FLOAT_WORD(ix,x);
32 ix &= 0x7fffffff;
35 if(ix>=0x7f800000) return x*x;
38 if(ix<0x3eb17218) {
41 if (ix<0x39800000) return one; /* cosh(tiny) = 1 */
46 if (ix < 0x41100000) {
52 if (ix < 0x42b17217) return half*__ieee754_expf(fabsf(x));
55 if (ix<=0x42b2d4fc) {
e_sinh.c 45 int32_t ix,jx; local
50 ix = jx&0x7fffffff;
53 if(ix>=0x7ff00000) return x+x;
58 if (ix < 0x40360000) { /* |x|<22 */
59 if (ix<0x3e300000) /* |x|<2**-28 */
62 if(ix<0x3ff00000) return h*(2.0*t-t*t/(t+one));
67 if (ix < 0x40862E42) return h*__ieee754_exp(fabs(x));
71 if (ix<0x408633CE || ((ix==0x408633ce)&&(lx<=(u_int32_t)0x8fb9f87d))) {
s_tanf.c 37 int32_t n, hx, ix; local
40 ix = hx & 0x7fffffff;
42 if(ix <= 0x3f490fda) { /* |x| ~<= pi/4 */
43 if(ix<0x39800000) /* |x| < 2**-12 */
47 if(ix<=0x407b53d1) { /* |x| ~<= 5*pi/4 */
48 if(ix<=0x4016cbe3) /* |x| ~<= 3pi/4 */
53 if(ix<=0x40e231d5) { /* |x| ~<= 9*pi/4 */
54 if(ix<=0x40afeddf) /* |x| ~<= 7*pi/4 */
61 else if (ix>=0x7f800000) return x-x;
  /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) {
  /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;

Completed in 3346 milliseconds

1 2 3 4 5 6 7 8