Lines Matching full:digs
107 static int s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs);
109 static int s_mp_mul_high_digs(mp_int * a, mp_int * b, mp_int * c, int digs);
111 static int fast_s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs);
465 int digs = a->used + b->used + 1;
467 if ((digs < MP_WARRAY) &&
470 res = fast_s_mp_mul_digs (a, b, c, digs);
2064 /* multiplies |a| * |b| and only computes upto digs digits of result
2068 static int s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs)
2077 if (((digs) < MP_WARRAY) &&
2080 return fast_s_mp_mul_digs (a, b, c, digs);
2083 if ((res = mp_init_size (&t, digs)) != MP_OKAY) {
2086 t.used = digs;
2094 /* limit ourselves to making digs digits of output */
2095 pb = MIN (b->used, digs - ix);
2120 /* set carry if it is placed below digs */
2121 if (ix + iy < digs) {
2150 static int fast_s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs)
2157 if (c->alloc < digs) {
2158 if ((res = mp_grow (c, digs)) != MP_OKAY) {
2164 pa = MIN(digs, a->used + b->used);
2313 /* multiplies |a| * |b| and does not compute the lower digs digits
2316 static int s_mp_mul_high_digs (mp_int * a, mp_int * b, mp_int * c, int digs)
2328 return fast_s_mp_mul_high_digs (a, b, c, digs);
2347 tmpt = &(t.dp[digs]);
2350 tmpy = b->dp + (digs - ix);
2352 for (iy = digs - ix; iy < pb; iy++) {
