| /bionic/libm/upstream-freebsd/lib/msun/src/ |
| s_copysignf.c | 31 u_int32_t ix,iy; local
33 GET_FLOAT_WORD(iy,y);
34 SET_FLOAT_WORD(x,(ix&0x7fffffff)|(iy&0x80000000));
|
| s_nextafterf.c | 26 int32_t hx,hy,ix,iy; local
31 iy = hy&0x7fffffff; /* |y| */
34 (iy>0x7f800000)) /* y is nan */
|
| s_ccoshf.c | 45 int32_t hx, hy, ix, iy; local
54 iy = 0x7fffffff & hy;
56 if (ix < 0x7f800000 && iy < 0x7f800000) {
57 if (iy == 0)
78 if (ix == 0 && iy >= 0x7f800000)
81 if (iy == 0 && ix >= 0x7f800000) {
87 if (ix < 0x7f800000 && iy >= 0x7f800000)
91 if (iy >= 0x7f800000)
|
| s_csinhf.c | 45 int32_t hx, hy, ix, iy; local
54 iy = 0x7fffffff & hy;
56 if (ix < 0x7f800000 && iy < 0x7f800000) {
57 if (iy == 0)
78 if (ix == 0 && iy >= 0x7f800000)
81 if (iy == 0 && ix >= 0x7f800000) {
87 if (ix < 0x7f800000 && iy >= 0x7f800000)
91 if (iy >= 0x7f800000)
|
| s_nextafter.c | 32 int32_t hx,hy,ix,iy; local
38 iy = hy&0x7fffffff; /* |y| */
41 ((iy>=0x7ff00000)&&((iy-0x7ff00000)|ly)!=0)) /* y is nan */
|
| e_atan2.c | 22 * ARG (x+iy) = arctan(y/x) ... if x > 0,
23 * ARG (x+iy) = pi - arctan[y/(-x)] ... if x < 0,
64 int32_t k,m,hx,hy,ix,iy; local
70 iy = hy&0x7fffffff;
72 ((iy|((ly|-ly)>>31))>0x7ff00000)) /* x or y is NaN */
78 if((iy|ly)==0) {
91 if(iy==0x7ff00000) {
108 if(iy==0x7ff00000) return (hy<0)? -pi_o_2-tiny: pi_o_2+tiny;
111 k = (iy-ix)>>20;
|
| e_atan2f.c | 36 int32_t k,m,hx,hy,ix,iy; local
41 iy = hy&0x7fffffff;
43 (iy>0x7f800000)) /* x or y is NaN */
49 if(iy==0) {
62 if(iy==0x7f800000) {
79 if(iy==0x7f800000) return (hy<0)? -pi_o_2-tiny: pi_o_2+tiny;
82 k = (iy-ix)>>23;
|
| e_fmod.c | 31 int32_t n,hx,hy,hz,ix,iy,sx,i; local
59 /* determine iy = ilogb(y) */
62 for (iy = -1043, i=ly; i>0; i<<=1) iy -=1;
64 for (iy = -1022,i=(hy<<11); i>0; i<<=1) iy -=1;
66 } else iy = (hy>>20)-1023;
81 if(iy >= -1022)
84 n = -1022-iy;
95 n = ix - iy;
[all...] |
| e_fmodf.c | 33 int32_t n,hx,hy,hz,ix,iy,sx,i; local
54 /* determine iy = ilogb(y) */
56 for (iy = -126,i=(hy<<8); i>=0; i<<=1) iy -=1;
57 } else iy = (hy>>23)-127;
66 if(iy >= -126)
69 n = -126-iy;
74 n = ix - iy;
92 iy -= 1;
94 if(iy>= -126) { /* normalize output *
[all...] |
| s_ccosh.c | 30 * cosh(z) = cosh(x+iy)
51 int32_t hx, hy, ix, iy, lx, ly; local
60 iy = 0x7fffffff & hy;
63 if (ix < 0x7ff00000 && iy < 0x7ff00000) {
64 if ((iy | ly) == 0)
94 if ((ix | lx) == 0 && iy >= 0x7ff00000)
103 if ((iy | ly) == 0 && ix >= 0x7ff00000) {
117 if (ix < 0x7ff00000 && iy >= 0x7ff00000)
130 if (iy >= 0x7ff00000)
|
| s_csinh.c | 30 * sinh(z) = sinh(x+iy)
51 int32_t hx, hy, ix, iy, lx, ly; local
60 iy = 0x7fffffff & hy;
63 if (ix < 0x7ff00000 && iy < 0x7ff00000) {
64 if ((iy | ly) == 0)
94 if ((ix | lx) == 0 && iy >= 0x7ff00000)
102 if ((iy | ly) == 0 && ix >= 0x7ff00000) {
116 if (ix < 0x7ff00000 && iy >= 0x7ff00000)
131 if (iy >= 0x7ff00000)
|
| s_remquo.c | 34 int32_t n,hx,hy,hz,ix,iy,sx,i; local
68 /* determine iy = ilogb(y) */
71 for (iy = -1043, i=ly; i>0; i<<=1) iy -=1;
73 for (iy = -1022,i=(hy<<11); i>0; i<<=1) iy -=1;
75 } else iy = (hy>>20)-1023;
90 if(iy >= -1022)
93 n = -1022-iy;
104 n = ix - iy;
[all...] |
| s_remquof.c | 32 int32_t n,hx,hy,hz,ix,iy,sx,i; local
58 /* determine iy = ilogb(y) */
60 for (iy = -126,i=(hy<<8); i>0; i<<=1) iy -=1;
61 } else iy = (hy>>23)-127;
70 if(iy >= -126)
73 n = -126-iy;
78 n = ix - iy;
97 iy -= 1;
99 if(iy>= -126) { /* normalize output *
[all...] |
| /external/dropbear/libtommath/ |
| bn_mp_reduce_is_2k_l.c | 21 int ix, iy; local
29 for (iy = ix = 0; ix < a->used; ix++) {
31 ++iy;
34 return (iy >= (a->used/2)) ? MP_YES : MP_NO;
|
| bn_reverse.c | 22 int ix, iy; local
26 iy = len - 1;
27 while (ix < iy) {
29 s[ix] = s[iy];
30 s[iy] = t;
32 --iy;
|
| bn_mp_reduce_is_2k.c | 21 int ix, iy, iw; local
29 iy = mp_count_bits(a);
34 for (ix = DIGIT_BIT; ix < iy; ix++) {
|
| bn_mp_montgomery_reduce.c | 59 register int iy; local
73 for (iy = 0; iy < n->used; iy++) {
|
| bn_s_mp_sqr.c | 22 int res, ix, iy, pa; local
46 /* left hand side of A[ix] * A[iy] */
52 for (iy = ix + 1; iy < pa; iy++) {
54 r = ((mp_word)tmpx) * ((mp_word)a->dp[iy]);
|
| bn_fast_mp_montgomery_reduce.c | 93 register int iy; local
104 for (iy = 0; iy < n->used; iy++) {
|
| bn_fast_s_mp_mul_digs.c | 54 int iy; local
68 iy = MIN(a->used-tx, ty+1);
71 for (iz = 0; iz < iy; ++iz) {
|
| bn_fast_s_mp_mul_high_digs.c | 45 int tx, ty, iy; local
59 iy = MIN(a->used-tx, ty+1);
62 for (iz = 0; iz < iy; iz++) {
|
| bn_fast_s_mp_sqr.c | 21 * So basically you set up iy like before then you min it with
45 int tx, ty, iy; local
63 iy = MIN(a->used-tx, ty+1);
69 iy = MIN(iy, (ty-tx+1)>>1);
72 for (iz = 0; iz < iy; iz++) {
|
| bn_s_mp_mul_digs.c | 25 int res, pa, pb, ix, iy; local
62 for (iy = 0; iy < pb; iy++) {
75 if (ix + iy < digs) {
|
| /external/fdlibm/ |
| s_nextafter.c | 30 int hx,hy,ix,iy; local
38 iy = hy&0x7fffffff; /* |y| */
41 ((iy>=0x7ff00000)&&((iy-0x7ff00000)|ly)!=0)) /* y is nan */
|
| /external/skia/tests/ |
| TestSize.cpp | 38 int iy = 3; local
40 SkScalar y = SkIntToScalar(iy);
61 ia.set(ix, iy);
|
