Lines Matching refs:ix
232 int ix, res, olduse;
259 for (ix = 0; ix < x->used; ix++) {
264 for (; ix < n->used * 2 + 1; ix++) {
272 for (ix = 0; ix < n->used; ix++) {
277 * that W[ix-1] have the carry cleared (see after the inner loop)
280 mu = (mp_digit) (((W[ix] & MP_MASK) * rho) & MP_MASK);
304 /* Alias for the columns set by an offset of ix */
305 _W = W + ix;
313 /* now fix carry for next digit, W[ix+1] */
314 W[ix + 1] += W[ix] >> ((mp_word) DIGIT_BIT);
328 _W1 = W + ix;
331 _W = W + ++ix;
333 for (; ix <= n->used * 2 + 1; ix++) {
350 for (ix = 0; ix < n->used + 1; ix++) {
357 for (; ix < olduse; ix++) {
416 int olduse, res, pa, ix, iz;
432 for (ix = 0; ix < pa; ix++) {
438 ty = MIN(b->used-1, ix);
439 tx = ix - ty;
457 W[ix] = ((mp_digit)_W) & MP_MASK;
470 for (ix = 0; ix < pa+1; ix++) {
472 *tmpc++ = W[ix];
476 for (; ix < olduse; ix++) {
520 int olduse, res, pa, ix, iz;
535 for (ix = digs; ix < pa; ix++) {
540 ty = MIN(b->used-1, ix);
541 tx = ix - ty;
558 W[ix] = ((mp_digit)_W) & MP_MASK;
572 for (ix = digs; ix < pa; ix++) {
574 *tmpc++ = W[ix];
578 for (; ix < olduse; ix++) {
623 int olduse, res, pa, ix, iz;
637 for (ix = 0; ix < pa; ix++) {
646 ty = MIN(a->used-1, ix);
647 tx = ix - ty;
673 if ((ix&1) == 0) {
674 _W += ((mp_word)a->dp[ix>>1])*((mp_word)a->dp[ix>>1]);
678 W[ix] = (mp_digit)(_W & MP_MASK);
691 for (ix = 0; ix < pa; ix++) {
692 *tmpb++ = W[ix] & MP_MASK;
696 for (; ix < olduse; ix++) {
889 int res, ix, oldused;
938 for (ix = 1; ix < a->used; ix++) {
944 ix++;
963 ix = 1;
967 while (ix++ < oldused) {
1050 int res, ix, px;
1067 for (ix = 0; ix < px; ix++) {
1068 t.dp[ix] &= x->dp[ix];
1072 for (; ix < t.used; ix++) {
1073 t.dp[ix] = 0;
2049 int res, ix;
2061 for (ix = a->used - 1; ix >= 0; ix--) {
2062 w = (w << ((mp_word)DIGIT_BIT)) | ((mp_word)a->dp[ix]);
2081 q.dp[ix] = (mp_digit)t;
2144 int res, ix;
2163 if (s_is_power_of_two(b, &ix) == 1) {
2165 *d = a->dp[0] & ((((mp_digit)1)<<ix) - 1);
2168 return mp_div_2d(a, ix, c, NULL);
2188 for (ix = a->used - 1; ix >= 0; ix--) {
2189 w = (w << ((mp_word)DIGIT_BIT)) | ((mp_word)a->dp[ix]);
2197 q.dp[ix] = (mp_digit)t;
2242 int ix;
2252 for (ix = 1; ix < a->used; ix++) {
2253 if (a->dp[ix] != MP_MASK) {
4752 int ix, res, digs;
4776 for (ix = 0; ix < n->used; ix++) {
4785 mu = (mp_digit) (((mp_word)x->dp[ix]) * ((mp_word)rho) & MP_MASK);
4797 tmpx = x->dp + ix;
4814 /* At this point the ix'th digit of x should be zero */
5184 int ix, res, olduse;
5209 for (ix = 0; ix < a->used; ix++) {
5220 /* store final carry [if any] and increment ix offset */
5222 ++ix;
5225 while (ix++ < olduse) {
5488 int res, ix, px;
5505 for (ix = 0; ix < px; ix++) {
5506 t.dp[ix] |= x->dp[ix];
5612 int err, ix;
5618 for (ix = 0; ix < PRIME_SIZE; ix++) {
5619 /* what is a mod LBL_prime_tab[ix] */
5620 if ((err = mp_mod_d (a, ltm_prime_tab[ix], &res)) != MP_OKAY) {
5669 int ix, err, res;
5680 for (ix = 0; ix < PRIME_SIZE; ix++) {
5681 if (mp_cmp_d(a, ltm_prime_tab[ix]) == MP_EQ) {
5702 for (ix = 0; ix < t; ix++) {
5704 mp_set (&b, ltm_prime_tab[ix]);
6911 int ix, iy, iw;
6924 for (ix = DIGIT_BIT; ix < iy; ix++) {
6967 int ix, iy;
6975 for (iy = ix = 0; ix < a->used; ix++) {
6976 if (a->dp[ix] == MP_MASK) {
7541 int res, ix, oldused;
7576 ix = 1;
7592 for (ix = 1; ix < a->used; ix++) {
7600 while (ix++ < oldused) {
8563 int res, ix, px;
8580 for (ix = 0; ix < px; ix++) {
8581 t.dp[ix] ^= x->dp[ix];
8723 int ix, iy;
8726 ix = 0;
8728 while (ix < iy) {
8729 t = s[ix];
8730 s[ix] = s[iy];
8732 ++ix;
9138 int res, pa, pb, ix, iy;
9157 for (ix = 0; ix < pa; ix++) {
9162 pb = MIN (b->used, digs - ix);
9166 tmpx = a->dp[ix];
9168 /* an alias for the destination shifted ix places */
9169 tmpt = t.dp + ix;
9188 if (ix + iy < digs) {
9232 int res, pa, pb, ix, iy;
9252 for (ix = 0; ix < pa; ix++) {
9256 /* left hand side of A[ix] * B[iy] */
9257 tmpx = a->dp[ix];
9263 tmpy = b->dp + (digs - ix);
9265 for (iy = digs - ix; iy < pb; iy++) {
9314 int res, ix, iy, pa;
9326 for (ix = 0; ix < pa; ix++) {
9327 /* first calculate the digit at 2*ix */
9329 r = ((mp_word) t.dp[2*ix]) +
9330 ((mp_word)a->dp[ix])*((mp_word)a->dp[ix]);
9333 t.dp[ix+ix] = (mp_digit) (r & ((mp_word) MP_MASK));
9338 /* left hand side of A[ix] * A[iy] */
9339 tmpx = a->dp[ix];
9342 tmpt = t.dp + (2*ix + 1);
9344 for (iy = ix + 1; iy < pa; iy++) {
