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

1 2 3

  /external/dropbear/libtommath/
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_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_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_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) {
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_mp_montgomery_reduce.c 59 register int iy; local
73 for (iy = 0; iy < n->used; iy++) {
bn_s_mp_mul_high_digs.c 25 int res, pa, pb, ix, iy; local
49 /* left hand side of A[ix] * B[iy] */
58 for (iy = digs - ix; iy < pb; iy++) {
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_fast_mp_montgomery_reduce.c 93 register int iy; local
104 for (iy = 0; iy < n->used; iy++) {
  /bionic/libm/src/
s_copysignf.c 32 u_int32_t ix,iy; local
34 GET_FLOAT_WORD(iy,y);
35 SET_FLOAT_WORD(x,(ix&0x7fffffff)|(iy&0x80000000));
e_fmodf.c 34 int32_t n,hx,hy,hz,ix,iy,sx,i; local
55 /* determine iy = ilogb(y) */
57 for (iy = -126,i=(hy<<8); i>=0; i<<=1) iy -=1;
58 } else iy = (hy>>23)-127;
67 if(iy >= -126)
70 n = -126-iy;
75 n = ix - iy;
93 iy -= 1;
95 if(iy>= -126) { /* normalize output *
    [all...]
e_atan2f.c 35 int32_t k,m,hx,hy,ix,iy; local
40 iy = hy&0x7fffffff;
42 (iy>0x7f800000)) /* x or y is NaN */
48 if(iy==0) {
61 if(iy==0x7f800000) {
78 if(iy==0x7f800000) return (hy<0)? -pi_o_2-tiny: pi_o_2+tiny;
81 k = (iy-ix)>>23;
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;
96 iy -= 1;
98 if(iy>= -126) { /* normalize output *
    [all...]
e_atan2.c 23 * ARG (x+iy) = arctan(y/x) ... if x > 0,
24 * ARG (x+iy) = pi - arctan[y/(-x)] ... if x < 0,
61 int32_t k,m,hx,hy,ix,iy; local
67 iy = hy&0x7fffffff;
69 ((iy|((ly|-ly)>>31))>0x7ff00000)) /* x or y is NaN */
75 if((iy|ly)==0) {
88 if(iy==0x7ff00000) {
105 if(iy==0x7ff00000) return (hy<0)? -pi_o_2-tiny: pi_o_2+tiny;
108 k = (iy-ix)>>20;
e_fmod.c 32 int32_t n,hx,hy,hz,ix,iy,sx,i; local
60 /* determine iy = ilogb(y) */
63 for (iy = -1043, i=ly; i>0; i<<=1) iy -=1;
65 for (iy = -1022,i=(hy<<11); i>0; i<<=1) iy -=1;
67 } else iy = (hy>>20)-1023;
82 if(iy >= -1022)
85 n = -1022-iy;
96 n = ix - iy;
    [all...]
s_remquo.c 32 int32_t n,hx,hy,hz,ix,iy,sx,i; local
66 /* determine iy = ilogb(y) */
69 for (iy = -1043, i=ly; i>0; i<<=1) iy -=1;
71 for (iy = -1022,i=(hy<<11); i>0; i<<=1) iy -=1;
73 } else iy = (hy>>20)-1023;
88 if(iy >= -1022)
91 n = -1022-iy;
102 n = ix - iy;
    [all...]
s_nextafterf.c 27 int32_t hx,hy,ix,iy; local
32 iy = hy&0x7fffffff; /* |y| */
35 (iy>0x7f800000)) /* y is nan */
k_sin.c 18 /* __kernel_sin( x, y, iy)
22 * Input iy indicates whether y is 0. (if iy=0, y assume to be 0).
61 __kernel_sin(double x, double y, int iy)
68 if(iy==0) return x+v*(S1+z*r);
s_nextafter.c 34 int32_t hx,hy,ix,iy; local
40 iy = hy&0x7fffffff; /* |y| */
43 ((iy>=0x7ff00000)&&((iy-0x7ff00000)|ly)!=0)) /* y is nan */
k_tanf.c 40 __kernel_tandf(double x, int iy)
65 if(iy==1) return r;
  /external/fdlibm/
k_sin.c 14 /* __kernel_sin( x, y, iy)
18 * Input iy indicates whether y is 0. (if iy=0, y assume to be 0).
58 double __kernel_sin(double x, double y, int iy)
60 double __kernel_sin(x, y, iy)
61 double x,y; int iy; /* iy=0 if y is zero */
72 if(iy==0) return x+v*(S1+z*r);
e_atan2.c 19 * ARG (x+iy) = arctan(y/x) ... if x > 0,
20 * ARG (x+iy) = pi - arctan[y/(-x)] ... if x < 0,
64 int k,m,hx,hy,ix,iy; local
69 hy = __HI(y); 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_fmod.c 35 int n,hx,hy,hz,ix,iy,sx,i; local
65 /* determine iy = ieee_ilogb(y) */
68 for (iy = -1043, i=ly; i>0; i<<=1) iy -=1;
70 for (iy = -1022,i=(hy<<11); i>0; i<<=1) iy -=1;
72 } else iy = (hy>>20)-1023;
87 if(iy >= -1022)
90 n = -1022-iy;
101 n = ix - iy;
    [all...]
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 */
  /frameworks/base/tools/layoutlib/bridge/src/android/graphics/
LinearGradient.java 123 for (int iy = 0 ; iy < h ; iy++) {
124 int color = getColor(iy + y, mY0, mDy);
136 for (int iy = 0 ; iy < h ; iy++) {
137 System.arraycopy(line, 0, data, iy*w, line.length);
141 for (int iy = 0 ; iy < h ; iy++)
    [all...]

Completed in 338 milliseconds

1 2 3