141 static int s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs);
143 static int s_mp_mul_high_digs(mp_int * a, mp_int * b, mp_int * c, int digs);
146 static int fast_s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs);
518     int     digs = a->used + b->used + 1;  in mp_mul()  local
520     if ((digs < MP_WARRAY) &&  in mp_mul()
523       res = fast_s_mp_mul_digs (a, b, c, digs);  in mp_mul()
2341 static int s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs)  in s_mp_mul_digs()  argument
2351   if (((digs) < MP_WARRAY) &&  in s_mp_mul_digs()
2354     return fast_s_mp_mul_digs (a, b, c, digs);  in s_mp_mul_digs()
2358   if ((res = mp_init_size (&t, digs)) != MP_OKAY) {  in s_mp_mul_digs()
2361   t.used = digs;  in s_mp_mul_digs()
2370     pb = MIN (b->used, digs - ix);  in s_mp_mul_digs()
2396     if (ix + iy < digs) {  in s_mp_mul_digs()
2426 static int fast_s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs)  in fast_s_mp_mul_digs()  argument
2433   if (c->alloc < digs) {  in fast_s_mp_mul_digs()
2434     if ((res = mp_grow (c, digs)) != MP_OKAY) {  in fast_s_mp_mul_digs()
2440   pa = MIN(digs, a->used + b->used);  in fast_s_mp_mul_digs()
2593 static int s_mp_mul_high_digs (mp_int * a, mp_int * b, mp_int * c, int digs)  in s_mp_mul_high_digs()  argument
2605     return fast_s_mp_mul_high_digs (a, b, c, digs);  in s_mp_mul_high_digs()
2624     tmpt = &(t.dp[digs]);  in s_mp_mul_high_digs()
2627     tmpy = b->dp + (digs - ix);  in s_mp_mul_high_digs()
2629     for (iy = digs - ix; iy < pb; iy++) {  in s_mp_mul_high_digs()