Searched refs:iy (Results 1 - 25 of 87) sorted by relevance

1234

/external/dropbear/libtommath/
H A Dbn_reverse.c22 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 Dbn_mp_reduce_is_2k_l.c21 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 Dbn_mp_reduce_is_2k.c21 int ix, iy, iw; local
29 iy = mp_count_bits(a);
34 for (ix = DIGIT_BIT; ix < iy; ix++) {
H A Dbn_s_mp_mul_digs.c25 int res, pa, pb, ix, iy; local
62 for (iy = 0; iy < pb; iy++) {
75 if (ix + iy < digs) {
H A Dbn_s_mp_sqr.c22 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 Dbn_mp_montgomery_reduce.c59 register int iy; local
73 for (iy = 0; iy < n->used; iy++) {
H A Dbn_s_mp_mul_high_digs.c25 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 Dbn_fast_s_mp_sqr.c21 * 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++) {
H A Dbn_fast_mp_montgomery_reduce.c93 register int iy; local
104 for (iy = 0; iy < n->used; iy++) {
H A Dbn_fast_s_mp_mul_digs.c54 int iy; local
68 iy = MIN(a->used-tx, ty+1);
71 for (iz = 0; iz < iy; ++iz) {
H A Dbn_fast_s_mp_mul_high_digs.c45 int tx, ty, iy; local
59 iy = MIN(a->used-tx, ty+1);
62 for (iz = 0; iz < iy; iz++) {
/external/fdlibm/
H A Dk_sin.c14 /* __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 De_atan2.c19 * 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 De_fmod.c35 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 Ds_nextafter.c30 int hx,hy,ix,iy; local
38 iy = hy&0x7fffffff; /* |y| */
41 ((iy>=0x7ff00000)&&((iy-0x7ff00000)|ly)!=0)) /* y is nan */
H A Dk_tan.c74 __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)
H A De_pow.c110 int hx,hy,ix,iy; local
116 ix = hx&0x7fffffff; iy = hy&0x7fffffff;
119 if((iy|ly)==0) return one;
123 iy > 0x7ff00000 || ((iy==0x7ff00000)&&(ly!=0)))
133 if(iy>=0x43400000) yisint = 2; /* even integer y */
134 else if(iy>=0x3ff00000) {
135 k = (iy>>20)-0x3ff; /* exponent */
140 j = iy>>(20-k);
141 if((j<<(20-k))==iy) yisin
[all...]
/external/chromium_org/third_party/opus/src/celt/
H A Dvq.c112 static void normalise_residual(int * OPUS_RESTRICT iy, celt_norm * OPUS_RESTRICT X, argument
130 X[i] = EXTRACT16(PSHR32(MULT16_16(g, iy[i]), k+1));
134 static unsigned extract_collapse_mask(int *iy, int N, int B) argument
148 collapse_mask |= (iy[i*N0+j]!=0)<<i;
161 VARDECL(int, iy);
176 ALLOC(iy, N, int);
190 iy[j] = 0;
225 iy[j] = MULT16_16_Q15(X[j],rcp);
227 iy[j] = (int)floor(rcp*X[j]);
229 y[j] = (celt_norm)iy[
[all...]
/external/chromium_org/third_party/mesa/src/src/mesa/swrast/
H A Ds_aatritemp.h184 GLint iy;
186 #pragma omp parallel for schedule(dynamic) private(iy) firstprivate(span)
188 for (iy = iyMin; iy < iyMax; iy++) {
189 GLfloat x = pMin[0] - (yMin - iy) * dxdy;
200 coverage = compute_coveragef(pMin, pMid, pMax, startX, iy);
211 span.attrStart[FRAG_ATTRIB_WPOS][3] = solve_plane(ix + 0.5F, iy + 0.5F, wPlane);
215 span.attrStart[attr][c] = solve_plane(ix + 0.5F, iy + 0.5F, attrPlane[attr][c]);
223 const GLfloat cx = ix + 0.5F, cy = iy
[all...]
/external/mesa3d/src/mesa/swrast/
H A Ds_aatritemp.h184 GLint iy;
186 #pragma omp parallel for schedule(dynamic) private(iy) firstprivate(span)
188 for (iy = iyMin; iy < iyMax; iy++) {
189 GLfloat x = pMin[0] - (yMin - iy) * dxdy;
200 coverage = compute_coveragef(pMin, pMid, pMax, startX, iy);
211 span.attrStart[FRAG_ATTRIB_WPOS][3] = solve_plane(ix + 0.5F, iy + 0.5F, wPlane);
215 span.attrStart[attr][c] = solve_plane(ix + 0.5F, iy + 0.5F, attrPlane[attr][c]);
223 const GLfloat cx = ix + 0.5F, cy = iy
[all...]
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/llvmpipe/
H A Dlp_tile_soa.h68 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 Dlp_tile_soa.h68 unsigned iy = (y / TILE_VECTOR_HEIGHT) * TILE_Y_STRIDE; local
69 unsigned offset = iy + ix + c * TILE_C_STRIDE +
/external/chromium_org/third_party/skia/src/core/
H A DSkBitmapShader16BilerpTemplate.h50 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/skia/src/core/
H A DSkBitmapShader16BilerpTemplate.h50 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/skia/gm/
H A Dninepatchstretch.cpp98 for (int iy = 0; iy < 2; ++iy) {
100 int i = ix * 2 + iy;
101 SkRect r = SkRect::MakeXYWH(x + ix * fixed, y + iy * fixed,

Completed in 1488 milliseconds

1234