/bionic/libm/src/ |
s_nexttowardf.c | 29 int32_t hx,ix; local 32 ix = hx&0x7fffffff; /* |x| */ 35 if((ix>0x7f800000) || 40 if(ix==0) { /* x == 0 */ 49 ix = hx&0x7f800000; 50 if(ix>=0x7f800000) return x+x; /* overflow */ 51 if(ix<0x00800000) { /* underflow */
|
s_sin.c | 55 int32_t n, ix; local 58 GET_HIGH_WORD(ix,x); 61 ix &= 0x7fffffff; 62 if(ix <= 0x3fe921fb) { 63 if(ix<0x3e400000) /* |x| < 2**-27 */ 69 else if (ix>=0x7ff00000) return x-x;
|
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 */
|
e_atanh.c | 47 int32_t hx,ix; local 50 ix = hx&0x7fffffff; 51 if ((ix|((lx|(-lx))>>31))>0x3ff00000) /* |x|>1 */ 53 if(ix==0x3ff00000) 55 if(ix<0x3e300000&&(huge+x)>zero) return x; /* x<2**-28 */ 56 SET_HIGH_WORD(x,ix); 57 if(ix<0x3fe00000) { /* x < 0.5 */
|
e_atanhf.c | 31 int32_t hx,ix; local 33 ix = hx&0x7fffffff; 34 if (ix>0x3f800000) /* |x|>1 */ 36 if(ix==0x3f800000) 38 if(ix<0x31800000&&(huge+x)>zero) return x; /* x<2**-28 */ 39 SET_FLOAT_WORD(x,ix); 40 if(ix<0x3f000000) { /* x < 0.5 */
|
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))) {
|
e_sinhf.c | 29 int32_t ix,jx; local 32 ix = jx&0x7fffffff; 35 if(ix>=0x7f800000) return x+x; 40 if (ix < 0x41100000) { /* |x|<9 */ 41 if (ix<0x39800000) /* |x|<2**-12 */ 44 if(ix<0x3f800000) return h*((float)2.0*t-t*t/(t+one)); 49 if (ix < 0x42b17217) return h*__ieee754_expf(fabsf(x)); 52 if (ix<=0x42b2d4fc) {
|
s_asinh.c | 40 int32_t hx,ix; local 42 ix = hx&0x7fffffff; 43 if(ix>=0x7ff00000) return x+x; /* x is inf or NaN */ 44 if(ix< 0x3e300000) { /* |x|<2**-28 */ 47 if(ix>0x41b00000) { /* |x| > 2**28 */ 49 } else if (ix>0x40000000) { /* 2**28 > |x| > 2.0 */
|
s_asinhf.c | 32 int32_t hx,ix; local 34 ix = hx&0x7fffffff; 35 if(ix>=0x7f800000) return x+x; /* x is inf or NaN */ 36 if(ix< 0x31800000) { /* |x|<2**-28 */ 39 if(ix>0x4d800000) { /* |x| > 2**28 */ 41 } else if (ix>0x40000000) { /* 2**28 > |x| > 2.0 */
|
s_nextafter.c | 34 int32_t hx,hy,ix,iy; local 39 ix = hx&0x7fffffff; /* |x| */ 42 if(((ix>=0x7ff00000)&&((ix-0x7ff00000)|lx)!=0) || /* x is nan */ 46 if((ix|lx)==0) { /* x == 0 */
|
s_scalbnf.c | 34 int32_t k,ix; local 35 GET_FLOAT_WORD(ix,x); 36 k = (ix&0x7f800000)>>23; /* extract exponent */ 38 if ((ix&0x7fffffff)==0) return x; /* +-0 */ 40 GET_FLOAT_WORD(ix,x); 41 k = ((ix&0x7f800000)>>23) - 25; 48 {SET_FLOAT_WORD(x,(ix&0x807fffff)|(k<<23)); return x;} 54 SET_FLOAT_WORD(x,(ix&0x807fffff)|(k<<23));
|
s_tanh.c | 50 int32_t jx,ix; local 54 ix = jx&0x7fffffff; 57 if(ix>=0x7ff00000) { 63 if (ix < 0x40360000) { /* |x|<22 */ 64 if (ix<0x3c800000) /* |x|<2**-55 */ 66 if (ix>=0x3ff00000) { /* |x|>=1 */
|
s_tanhf.c | 28 int32_t jx,ix; local 31 ix = jx&0x7fffffff; 34 if(ix>=0x7f800000) { 40 if (ix < 0x41100000) { /* |x|<9 */ 41 if (ix<0x39800000) { /* |x|<2**-12 */ 44 if (ix>=0x3f800000) { /* |x|>=1 */
|
/external/dropbear/libtommath/ |
bn_mp_add_d.c | 22 int res, ix, oldused; local 71 for (ix = 1; ix < a->used; ix++) { 77 ix++; 96 ix = 1; 100 while (ix++ < oldused) {
|
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;
|
bn_mp_div_3.c | 25 int res, ix; local 37 for (ix = a->used - 1; ix >= 0; ix--) { 38 w = (w << ((mp_word)DIGIT_BIT)) | ((mp_word)a->dp[ix]); 57 q.dp[ix] = (mp_digit)t;
|
bn_mp_or.c | 21 int res, ix, px; local 38 for (ix = 0; ix < px; ix++) { 39 t.dp[ix] |= x->dp[ix];
|
bn_mp_sub_d.c | 23 int res, ix, oldused; local 58 ix = 1; 74 for (ix = 1; ix < a->used; ix++) { 82 while (ix++ < oldused) {
|
bn_mp_xor.c | 22 int res, ix, px; local 39 for (ix = 0; ix < px; ix++) { 40 t.dp[ix] ^= x->dp[ix];
|
bn_mp_div_d.c | 37 int res, ix; local 56 if (s_is_power_of_two(b, &ix) == 1) { 58 *d = a->dp[0] & ((((mp_digit)1)<<ix) - 1); 61 return mp_div_2d(a, ix, c, NULL); 81 for (ix = a->used - 1; ix >= 0; ix--) { 82 w = (w << ((mp_word)DIGIT_BIT)) | ((mp_word)a->dp[ix]); 90 q.dp[ix] = (mp_digit)t;
|
bn_mp_montgomery_reduce.c | 22 int ix, res, digs; local 46 for (ix = 0; ix < n->used; ix++) { 55 mu = (mp_digit) (((mp_word)x->dp[ix]) * ((mp_word)rho) & MP_MASK); 67 tmpx = x->dp + ix; 84 /* At this point the ix'th digit of x should be zero */
|
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) {
|
/external/fdlibm/ |
s_nextafter.c | 30 int hx,hy,ix,iy; local 37 ix = hx&0x7fffffff; /* |x| */ 40 if(((ix>=0x7ff00000)&&((ix-0x7ff00000)|lx)!=0) || /* x is nan */ 44 if((ix|lx)==0) { /* x == 0 */
|