Lines Matching defs:mu

176 static int mp_reduce(mp_int * x, mp_int * m, mp_int * mu);
1877   mp_int  M[TAB_SIZE], res, mu;
1923   /* create mu, used for Barrett reduction */
1924   if ((err = mp_init (&mu)) != MP_OKAY) {
1929      if ((err = mp_reduce_setup (&mu, P)) != MP_OKAY) {
1934      if ((err = mp_reduce_2k_setup_l (P, &mu)) != MP_OKAY) {
1967     if ((err = redux (&M[1 << (winsize - 1)], P, &mu)) != MP_OKAY) {
1979     if ((err = redux (&M[x], P, &mu)) != MP_OKAY) {
2028       if ((err = redux (&res, P, &mu)) != MP_OKAY) {
2045         if ((err = redux (&res, P, &mu)) != MP_OKAY) {
2054       if ((err = redux (&res, P, &mu)) != MP_OKAY) {
2072       if ((err = redux (&res, P, &mu)) != MP_OKAY) {
2082         if ((err = redux (&res, P, &mu)) != MP_OKAY) {
2092 LBL_MU:mp_clear (&mu);
2246 /* reduces x mod m, assumes 0 < x < m**2, mu is
2250 static int mp_reduce (mp_int * x, mp_int * m, mp_int * mu)
2265     if ((res = mp_mul (&q, mu, &q)) != MP_OKAY) {
2270     if ((res = s_mp_mul_high_digs (&q, mu, &q, um)) != MP_OKAY) {
2274     if ((res = fast_s_mp_mul_high_digs (&q, mu, &q, um)) != MP_OKAY) {
2736     /* mu = ai * m' mod b
2742     register mp_digit mu;
2743     mu = (mp_digit) (((W[ix] & MP_MASK) * rho) & MP_MASK);
2745     /* a = a + mu * m * b**i
2772           *_W++ += ((mp_word)mu) * ((mp_word)*tmpn++);