Lines Matching defs:iy
204 int ix, iy;
208 iy = len - 1;
209 while (ix < iy) {
211 s[ix] = s[iy];
212 s[iy] = t;
214 --iy;
2344 int res, pa, pb, ix, iy;
2383 for (iy = 0; iy < pb; iy++) {
2396 if (ix + iy < digs) {
2446 int iy;
2460 iy = MIN(a->used-tx, ty+1);
2463 for (iz = 0; iz < iy; ++iz) {
2530 int res, ix, iy, pa;
2554 /* left hand side of A[ix] * A[iy] */
2560 for (iy = ix + 1; iy < pa; iy++) {
2562 r = ((mp_word)tmpx) * ((mp_word)a->dp[iy]);
2596 int res, pa, pb, ix, iy;
2620 /* left hand side of A[ix] * B[iy] */
2629 for (iy = digs - ix; iy < pb; iy++) {
2767 register int iy;
2778 for (iy = 0; iy < n->used; iy++) {
3250 * So basically you set up iy like before then you min it with
3274 int tx, ty, iy;
3292 iy = MIN(a->used-tx, ty+1);
3298 iy = MIN(iy, (ty-tx+1)>>1);
3301 for (iz = 0; iz < iy; iz++) {