Lines Matching refs:mu
184 static int mp_reduce(mp_int * x, mp_int * m, mp_int * mu);
1886 mp_int M[TAB_SIZE], res, mu;
1932 /* create mu, used for Barrett reduction */
1933 if ((err = mp_init (&mu)) != MP_OKAY) {
1938 if ((err = mp_reduce_setup (&mu, P)) != MP_OKAY) {
1943 if ((err = mp_reduce_2k_setup_l (P, &mu)) != MP_OKAY) {
1976 if ((err = redux (&M[1 << (winsize - 1)], P, &mu)) != MP_OKAY) {
1988 if ((err = redux (&M[x], P, &mu)) != MP_OKAY) {
2037 if ((err = redux (&res, P, &mu)) != MP_OKAY) {
2054 if ((err = redux (&res, P, &mu)) != MP_OKAY) {
2063 if ((err = redux (&res, P, &mu)) != MP_OKAY) {
2081 if ((err = redux (&res, P, &mu)) != MP_OKAY) {
2091 if ((err = redux (&res, P, &mu)) != MP_OKAY) {
2101 LBL_MU:mp_clear (&mu);
2255 /* reduces x mod m, assumes 0 < x < m**2, mu is
2259 static int mp_reduce (mp_int * x, mp_int * m, mp_int * mu)
2274 if ((res = mp_mul (&q, mu, &q)) != MP_OKAY) {
2279 if ((res = s_mp_mul_high_digs (&q, mu, &q, um)) != MP_OKAY) {
2283 if ((res = fast_s_mp_mul_high_digs (&q, mu, &q, um)) != MP_OKAY) {
2744 /* mu = ai * m' mod b
2750 register mp_digit mu;
2751 mu = (mp_digit) (((W[ix] & MP_MASK) * rho) & MP_MASK);
2753 /* a = a + mu * m * b**i
2780 *_W++ += ((mp_word)mu) * ((mp_word)*tmpn++);
