133 static int s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs);
135 static int s_mp_mul_high_digs(mp_int * a, mp_int * b, mp_int * c, int digs);
138 static int fast_s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs);
510     int     digs = a->used + b->used + 1;  in mp_mul()  local
512     if ((digs < MP_WARRAY) &&  in mp_mul()
515       res = fast_s_mp_mul_digs (a, b, c, digs);  in mp_mul()
2333 static int s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs)  in s_mp_mul_digs()  argument
2343   if (((digs) < MP_WARRAY) &&  in s_mp_mul_digs()
2346     return fast_s_mp_mul_digs (a, b, c, digs);  in s_mp_mul_digs()
2350   if ((res = mp_init_size (&t, digs)) != MP_OKAY) {  in s_mp_mul_digs()
2353   t.used = digs;  in s_mp_mul_digs()
2362     pb = MIN (b->used, digs - ix);  in s_mp_mul_digs()
2388     if (ix + iy < digs) {  in s_mp_mul_digs()
2418 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
2425   if (c->alloc < digs) {  in fast_s_mp_mul_digs()
2426     if ((res = mp_grow (c, digs)) != MP_OKAY) {  in fast_s_mp_mul_digs()
2432   pa = MIN(digs, a->used + b->used);  in fast_s_mp_mul_digs()
2586 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
2598     return fast_s_mp_mul_high_digs (a, b, c, digs);  in s_mp_mul_high_digs()
2617     tmpt = &(t.dp[digs]);  in s_mp_mul_high_digs()
2620     tmpy = b->dp + (digs - ix);  in s_mp_mul_high_digs()
2622     for (iy = digs - ix; iy < pb; iy++) {  in s_mp_mul_high_digs()