Lines Matching defs:ix
191 int ix, iy;
194 ix = 0;
196 while (ix < iy) {
197 t = s[ix];
198 s[ix] = s[iy];
200 ++ix;
2329 int res, pa, pb, ix, iy;
2348 for (ix = 0; ix < pa; ix++) {
2353 pb = MIN (b->used, digs - ix);
2357 tmpx = a->dp[ix];
2359 /* an alias for the destination shifted ix places */
2360 tmpt = t.dp + ix;
2379 if (ix + iy < digs) {
2410 int olduse, res, pa, ix, iz;
2426 for (ix = 0; ix < pa; ix++) {
2432 ty = MIN(b->used-1, ix);
2433 tx = ix - ty;
2451 W[ix] = ((mp_digit)_W) & MP_MASK;
2464 for (ix = 0; ix < pa+1; ix++) {
2466 *tmpc++ = W[ix];
2470 for (; ix < olduse; ix++) {
2511 int res, ix, iy, pa;
2523 for (ix = 0; ix < pa; ix++) {
2524 /* first calculate the digit at 2*ix */
2526 r = ((mp_word) t.dp[2*ix]) +
2527 ((mp_word)a->dp[ix])*((mp_word)a->dp[ix]);
2530 t.dp[ix+ix] = (mp_digit) (r & ((mp_word) MP_MASK));
2535 /* left hand side of A[ix] * A[iy] */
2536 tmpx = a->dp[ix];
2539 tmpt = t.dp + (2*ix + 1);
2541 for (iy = ix + 1; iy < pa; iy++) {
2577 int res, pa, pb, ix, iy;
2597 for (ix = 0; ix < pa; ix++) {
2601 /* left hand side of A[ix] * B[iy] */
2602 tmpx = a->dp[ix];
2608 tmpy = b->dp + (digs - ix);
2610 for (iy = digs - ix; iy < pb; iy++) {
2683 int ix, res, olduse;
2710 for (ix = 0; ix < x->used; ix++) {
2715 for (; ix < n->used * 2 + 1; ix++) {
2723 for (ix = 0; ix < n->used; ix++) {
2728 * that W[ix-1] have the carry cleared (see after the inner loop)
2731 mu = (mp_digit) (((W[ix] & MP_MASK) * rho) & MP_MASK);
2755 /* Alias for the columns set by an offset of ix */
2756 _W = W + ix;
2764 /* now fix carry for next digit, W[ix+1] */
2765 W[ix + 1] += W[ix] >> ((mp_word) DIGIT_BIT);
2779 _W1 = W + ix;
2782 _W = W + ++ix;
2784 for (; ix <= n->used * 2 + 1; ix++) {
2801 for (ix = 0; ix < n->used + 1; ix++) {
2808 for (; ix < olduse; ix++) {
3240 int olduse, res, pa, ix, iz;
3254 for (ix = 0; ix < pa; ix++) {
3263 ty = MIN(a->used-1, ix);
3264 tx = ix - ty;
3290 if ((ix&1) == 0) {
3291 _W += ((mp_word)a->dp[ix>>1])*((mp_word)a->dp[ix>>1]);
3295 W[ix] = (mp_digit)(_W & MP_MASK);
3308 for (ix = 0; ix < pa; ix++) {
3309 *tmpb++ = W[ix] & MP_MASK;
3313 for (; ix < olduse; ix++) {
3330 int ix, res, olduse;
3355 for (ix = 0; ix < a->used; ix++) {
3366 /* store final carry [if any] and increment ix offset */
3368 ++ix;
3371 while (ix++ < olduse) {
