Lines Matching refs:x
62 #define MIN(x,y) ((x)<(y)?(x):(y)) argument
66 #define MAX(x,y) ((x)>(y)?(x):(y)) argument
69 #define OPT_CAST(x) (x *) argument
173 static int mp_reduce(mp_int * x, mp_int * m, mp_int * mu);
213 mp_int *x; in s_mp_add() local
222 x = a; in s_mp_add()
226 x = b; in s_mp_add()
274 *tmpc = x->dp[i] + u; in s_mp_add()
774 mp_int x, y, u, v, A, B, C, D; in mp_invmod_slow() local
783 if ((res = mp_init_multi(&x, &y, &u, &v, in mp_invmod_slow()
789 if ((res = mp_mod(a, b, &x)) != MP_OKAY) { in mp_invmod_slow()
797 if (mp_iseven (&x) == 1 && mp_iseven (&y) == 1) { in mp_invmod_slow()
803 if ((res = mp_copy (&x, &u)) != MP_OKAY) { in mp_invmod_slow()
825 if ((res = mp_sub (&B, &x, &B)) != MP_OKAY) { in mp_invmod_slow()
850 if ((res = mp_sub (&D, &x, &D)) != MP_OKAY) { in mp_invmod_slow()
921 LBL_ERR:mp_clear_multi (&x, &y, &u, &v, &A, &B, &C, &D, NULL); in mp_invmod_slow()
1003 int x, res; in mp_to_unsigned_bin() local
1010 x = 0; in mp_to_unsigned_bin()
1013 b[x++] = (unsigned char) (t.dp[0] & 255); in mp_to_unsigned_bin()
1015 b[x++] = (unsigned char) (t.dp[0] | ((t.dp[1] & 0x01) << 7)); in mp_to_unsigned_bin()
1022 bn_reverse (b, x); in mp_to_unsigned_bin()
1033 int x, res; in mp_div_2d() local
1085 for (x = c->used - 1; x >= 0; x--) { in mp_div_2d()
1187 int x; in mp_rshd() local
1221 for (x = 0; x < (a->used - b); x++) { in mp_rshd()
1226 for (; x < a->used; x++) { in mp_rshd()
1352 int x, res, oldused; in mp_div_2() local
1374 for (x = b->used - 1; x >= 0; x--) { in mp_div_2()
1387 for (x = b->used; x < oldused; x++) { in mp_div_2()
1429 register int x; in mp_mul_2d() local
1442 for (x = 0; x < c->used; x++) { in mp_mul_2d()
1524 int x, res; in mp_lshd() local
1554 for (x = a->used - 1; x >= b; x--) { in mp_lshd()
1560 for (x = 0; x < b; x++) { in mp_lshd()
1597 int x, res; in mp_mod_2d() local
1617 for (x = (b / DIGIT_BIT) + ((b % DIGIT_BIT) == 0 ? 0 : 1); x < c->used; x++) { in mp_mod_2d()
1618 c->dp[x] = 0; in mp_mod_2d()
1717 mp_int q, x, y, t1, t2; in mp_div() local
1751 if ((res = mp_init_copy (&x, a)) != MP_OKAY) { in mp_div()
1761 x.sign = y.sign = MP_ZPOS; in mp_div()
1767 if ((res = mp_mul_2d (&x, norm, &x)) != MP_OKAY) { in mp_div()
1778 n = x.used - 1; in mp_div()
1786 while (mp_cmp (&x, &y) != MP_LT) { in mp_div()
1788 if ((res = mp_sub (&x, &y, &x)) != MP_OKAY) { in mp_div()
1798 if (i > x.used) { in mp_div()
1804 if (x.dp[i] == y.dp[t]) { in mp_div()
1808 tmp = ((mp_word) x.dp[i]) << ((mp_word) DIGIT_BIT); in mp_div()
1809 tmp |= ((mp_word) x.dp[i - 1]); in mp_div()
1835 t2.dp[0] = (i - 2 < 0) ? 0 : x.dp[i - 2]; in mp_div()
1836 t2.dp[1] = (i - 1 < 0) ? 0 : x.dp[i - 1]; in mp_div()
1837 t2.dp[2] = x.dp[i]; in mp_div()
1850 if ((res = mp_sub (&x, &t1, &x)) != MP_OKAY) { in mp_div()
1855 if (x.sign == MP_NEG) { in mp_div()
1862 if ((res = mp_add (&x, &t1, &x)) != MP_OKAY) { in mp_div()
1875 x.sign = x.used == 0 ? MP_ZPOS : a->sign; in mp_div()
1884 mp_div_2d (&x, norm, &x, NULL); in mp_div()
1885 mp_exch (&x, d); in mp_div()
1891 LBL_X:mp_clear (&x); in mp_div()
1912 int err, bitbuf, bitcpy, bitcnt, mode, digidx, x, y, winsize; in s_mp_exptmod() local
1916 x = mp_count_bits (X); in s_mp_exptmod()
1917 if (x <= 7) { in s_mp_exptmod()
1919 } else if (x <= 36) { in s_mp_exptmod()
1921 } else if (x <= 140) { in s_mp_exptmod()
1923 } else if (x <= 450) { in s_mp_exptmod()
1925 } else if (x <= 1303) { in s_mp_exptmod()
1927 } else if (x <= 3529) { in s_mp_exptmod()
1946 for (x = 1<<(winsize-1); x < (1 << winsize); x++) { in s_mp_exptmod()
1947 if ((err = mp_init(&M[x])) != MP_OKAY) { in s_mp_exptmod()
1948 for (y = 1<<(winsize-1); y < x; y++) { in s_mp_exptmod()
1992 for (x = 0; x < (winsize - 1); x++) { in s_mp_exptmod()
2008 for (x = (1 << (winsize - 1)) + 1; x < (1 << winsize); x++) { in s_mp_exptmod()
2009 if ((err = mp_mul (&M[x - 1], &M[1], &M[x])) != MP_OKAY) { in s_mp_exptmod()
2012 if ((err = redux (&M[x], P, &mu)) != MP_OKAY) { in s_mp_exptmod()
2074 for (x = 0; x < winsize; x++) { in s_mp_exptmod()
2101 for (x = 0; x < bitcpy; x++) { in s_mp_exptmod()
2128 for (x = 1<<(winsize-1); x < (1 << winsize); x++) { in s_mp_exptmod()
2129 mp_clear (&M[x]); in s_mp_exptmod()
2289 mp_reduce (mp_int * x, mp_int * m, mp_int * mu) in mp_reduce() argument
2295 if ((res = mp_init_copy (&q, x)) != MP_OKAY) { in mp_reduce()
2329 if ((res = mp_mod_2d (x, DIGIT_BIT * (um + 1), x)) != MP_OKAY) { in mp_reduce()
2339 if ((res = mp_sub (x, &q, x)) != MP_OKAY) { in mp_reduce()
2344 if (mp_cmp_d (x, 0) == MP_LT) { in mp_reduce()
2349 if ((res = mp_add (x, &q, x)) != MP_OKAY) { in mp_reduce()
2355 while (mp_cmp (x, m) != MP_LT) { in mp_reduce()
2356 if ((res = s_mp_sub (x, m, x)) != MP_OKAY) { in mp_reduce()
2531 int x; in mp_init_size() local
2548 for (x = 0; x < size; x++) { in mp_init_size()
2549 a->dp[x] = 0; in mp_init_size()
2687 mp_digit x, b; in mp_montgomery_setup() local
2703 x = (((b + 2) & 4) << 1) + b; /* here x*a==1 mod 2**4 */ in mp_montgomery_setup()
2704 x *= 2 - b * x; /* here x*a==1 mod 2**8 */ in mp_montgomery_setup()
2706 x *= 2 - b * x; /* here x*a==1 mod 2**16 */ in mp_montgomery_setup()
2709 x *= 2 - b * x; /* here x*a==1 mod 2**32 */ in mp_montgomery_setup()
2712 x *= 2 - b * x; /* here x*a==1 mod 2**64 */ in mp_montgomery_setup()
2716 *rho = (unsigned long)(((mp_word)1 << ((mp_word) DIGIT_BIT)) - x) & MP_MASK; in mp_montgomery_setup()
2733 fast_mp_montgomery_reduce (mp_int * x, mp_int * n, mp_digit rho) in fast_mp_montgomery_reduce() argument
2739 olduse = x->used; in fast_mp_montgomery_reduce()
2742 if (x->alloc < n->used + 1) { in fast_mp_montgomery_reduce()
2743 if ((res = mp_grow (x, n->used + 1)) != MP_OKAY) { in fast_mp_montgomery_reduce()
2759 tmpx = x->dp; in fast_mp_montgomery_reduce()
2762 for (ix = 0; ix < x->used; ix++) { in fast_mp_montgomery_reduce()
2848 tmpx = x->dp; in fast_mp_montgomery_reduce()
2866 x->used = n->used + 1; in fast_mp_montgomery_reduce()
2867 mp_clamp (x); in fast_mp_montgomery_reduce()
2870 if (mp_cmp_mag (x, n) != MP_LT) { in fast_mp_montgomery_reduce()
2871 return s_mp_sub (x, n, x); in fast_mp_montgomery_reduce()
2883 int x, res, oldused; in mp_mul_2() local
2906 for (x = 0; x < a->used; x++) { in mp_mul_2()
2933 for (x = b->used; x < oldused; x++) { in mp_mul_2()
2953 int x, bits, res; in mp_montgomery_calc_normalization() local
2969 for (x = bits - 1; x < (int)DIGIT_BIT; x++) { in mp_montgomery_calc_normalization()
2999 int err, bitbuf, bitcpy, bitcnt, mode, digidx, x, y, winsize; in mp_exptmod_fast() local
3008 x = mp_count_bits (X); in mp_exptmod_fast()
3009 if (x <= 7) { in mp_exptmod_fast()
3011 } else if (x <= 36) { in mp_exptmod_fast()
3013 } else if (x <= 140) { in mp_exptmod_fast()
3015 } else if (x <= 450) { in mp_exptmod_fast()
3017 } else if (x <= 1303) { in mp_exptmod_fast()
3019 } else if (x <= 3529) { in mp_exptmod_fast()
3038 for (x = 1<<(winsize-1); x < (1 << winsize); x++) { in mp_exptmod_fast()
3039 if ((err = mp_init(&M[x])) != MP_OKAY) { in mp_exptmod_fast()
3040 for (y = 1<<(winsize-1); y < x; y++) { in mp_exptmod_fast()
3137 for (x = 0; x < (winsize - 1); x++) { in mp_exptmod_fast()
3147 for (x = (1 << (winsize - 1)) + 1; x < (1 << winsize); x++) { in mp_exptmod_fast()
3148 if ((err = mp_mul (&M[x - 1], &M[1], &M[x])) != MP_OKAY) { in mp_exptmod_fast()
3151 if ((err = redux (&M[x], P, mp)) != MP_OKAY) { in mp_exptmod_fast()
3207 for (x = 0; x < winsize; x++) { in mp_exptmod_fast()
3234 for (x = 0; x < bitcpy; x++) { in mp_exptmod_fast()
3274 for (x = 1<<(winsize-1); x < (1 << winsize); x++) { in mp_exptmod_fast()
3275 mp_clear (&M[x]); in mp_exptmod_fast()