Lines Matching defs:ix
151 int ix, iy;
154 ix = 0;
156 while (ix < iy) {
157 t = s[ix];
158 s[ix] = s[iy];
160 ++ix;
2071 int res, pa, pb, ix, iy;
2090 for (ix = 0; ix < pa; ix++) {
2095 pb = MIN (b->used, digs - ix);
2099 tmpx = a->dp[ix];
2101 /* an alias for the destination shifted ix places */
2102 tmpt = t.dp + ix;
2121 if (ix + iy < digs) {
2152 int olduse, res, pa, ix, iz;
2168 for (ix = 0; ix < pa; ix++) {
2174 ty = MIN(b->used-1, ix);
2175 tx = ix - ty;
2193 W[ix] = ((mp_digit)_W) & MP_MASK;
2206 for (ix = 0; ix < pa+1; ix++) {
2208 *tmpc++ = W[ix];
2212 for (; ix < olduse; ix++) {
2253 int res, ix, iy, pa;
2265 for (ix = 0; ix < pa; ix++) {
2266 /* first calculate the digit at 2*ix */
2268 r = ((mp_word) t.dp[2*ix]) +
2269 ((mp_word)a->dp[ix])*((mp_word)a->dp[ix]);
2272 t.dp[ix+ix] = (mp_digit) (r & ((mp_word) MP_MASK));
2277 /* left hand side of A[ix] * A[iy] */
2278 tmpx = a->dp[ix];
2281 tmpt = t.dp + (2*ix + 1);
2283 for (iy = ix + 1; iy < pa; iy++) {
2319 int res, pa, pb, ix, iy;
2339 for (ix = 0; ix < pa; ix++) {
2343 /* left hand side of A[ix] * B[iy] */
2344 tmpx = a->dp[ix];
2350 tmpy = b->dp + (digs - ix);
2352 for (iy = digs - ix; iy < pb; iy++) {
