/external/dropbear/libtommath/ |
H A D | 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;
|
H A D | 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++) {
|
H A D | 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;
|
H A D | bn_fast_mp_montgomery_reduce.c | 93 register int iy; local 104 for (iy = 0; iy < n->used; iy++) {
|
H A D | bn_mp_montgomery_reduce.c | 59 register int iy; local 73 for (iy = 0; iy < n->used; iy++) {
|
H A D | 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) {
|
H A D | 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++) {
|
H A D | 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]);
|
H A D | 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) {
|
H A D | 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++) {
|
H A D | 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++) {
|
/external/fdlibm/ |
H A D | 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 */
|
H A D | 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...] |
H A D | 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) argument 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);
|
H A D | 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;
|
H A D | k_tan.c | 74 __kernel_tan(double x, double y, int iy) { argument 82 if (((ix | __LO(x)) | (iy + 1)) == 0) 85 if (iy == 1) 127 v = (double) iy; 131 if (iy == 1)
|
/external/skia/tests/ |
H A D | TestSize.cpp | 39 int iy = 3; local 41 SkScalar y = SkIntToScalar(iy); 62 ia.set(ix, iy);
|
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/llvmpipe/ |
H A D | lp_tile_soa.h | 68 unsigned iy = (y / TILE_VECTOR_HEIGHT) * TILE_Y_STRIDE; local 69 unsigned offset = iy + ix + c * TILE_C_STRIDE +
|
/external/mesa3d/src/gallium/drivers/llvmpipe/ |
H A D | lp_tile_soa.h | 68 unsigned iy = (y / TILE_VECTOR_HEIGHT) * TILE_Y_STRIDE; local 69 unsigned offset = iy + ix + c * TILE_C_STRIDE +
|
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/softpipe/ |
H A D | sp_quad_depth_test_tmp.h | 55 const unsigned iy = quads[0]->input.y0; local 57 const float fy = (float) iy; 74 tile = sp_get_cached_tile(qs->softpipe->zsbuf_cache, ix, iy); 88 &tile->data.depth16[iy % TILE_SIZE][(ix + dx)% TILE_SIZE];
|
/external/mesa3d/src/gallium/drivers/softpipe/ |
H A D | sp_quad_depth_test_tmp.h | 55 const unsigned iy = quads[0]->input.y0; local 57 const float fy = (float) iy; 74 tile = sp_get_cached_tile(qs->softpipe->zsbuf_cache, ix, iy); 88 &tile->data.depth16[iy % TILE_SIZE][(ix + dx)% TILE_SIZE];
|
/external/chromium_org/third_party/mesa/src/src/mesa/swrast/ |
H A D | s_aalinetemp.h | 34 * \param iy - integer fragment window Y coordiante 37 NAME(plot)(struct gl_context *ctx, struct LineInfo *line, int ix, int iy) argument 41 const GLfloat fy = (GLfloat) iy; 42 const GLfloat coverage = compute_coveragef(line, ix, iy); 53 line->span.array->y[i] = iy; 57 * solving the plane equations at (ix,iy).
|
/external/chromium_org/third_party/skia/src/core/ |
H A D | ARGB32_Clamp_Bilinear_BitmapShader.h | 25 int iy = fy >> 16; local 30 + SkClampMax(iy, srcMaxY) * srcRB)) 37 if ((unsigned)iy < srcMaxY)
|
H A D | SkBitmapShader16BilerpTemplate.h | 50 int iy = fy >> 16; local 52 int y = SkClampMax(iy, srcMaxY); 61 if ((unsigned)iy < srcMaxY) 101 int iy = fy >> 16; local 106 SkClampMax(iy, srcMaxY) * srcRB)) + 112 if ((unsigned)iy < srcMaxY) 159 int iy = fy >> 16; local 164 SkClampMax(iy, srcMaxY) * srcRB)) + 170 if ((unsigned)iy < srcMaxY) 209 int iy local [all...] |
/external/mesa3d/src/mesa/swrast/ |
H A D | s_aalinetemp.h | 34 * \param iy - integer fragment window Y coordiante 37 NAME(plot)(struct gl_context *ctx, struct LineInfo *line, int ix, int iy) argument 41 const GLfloat fy = (GLfloat) iy; 42 const GLfloat coverage = compute_coveragef(line, ix, iy); 53 line->span.array->y[i] = iy; 57 * solving the plane equations at (ix,iy).
|