Lines Matching refs:digs

414 int fast_s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs)
421 if (c->alloc < digs) {
422 if ((res = mp_grow (c, digs)) != MP_OKAY) {
428 pa = MIN(digs, a->used + b->used);
510 * output digits *above* digs. See the comments for fast_s_mul_digs
518 int fast_s_mp_mul_high_digs (mp_int * a, mp_int * b, mp_int * c, int digs)
535 for (ix = digs; ix < pa; ix++) {
571 tmpc = c->dp + digs;
572 for (ix = digs; ix < pa; ix++) {
4757 int ix, res, digs;
4766 digs = n->used * 2 + 1;
4767 if ((digs < MP_WARRAY) &&
4774 if (x->alloc < digs) {
4775 if ((res = mp_grow (x, digs)) != MP_OKAY) {
4779 x->used = digs;
4963 int digs = a->used + b->used + 1;
4966 if ((digs < MP_WARRAY) &&
4969 res = fast_s_mp_mul_digs (a, b, c, digs);
6220 int res, digs;
6242 /* digs is the digit count */
6243 digs = 0;
6247 ++digs;
6264 ++digs;
6268 /* return digs + 1, the 1 is for the NULL byte that would be required. */
6269 *size = digs + 1;
8369 int res, digs;
8397 digs = 0;
8404 ++digs;
8410 bn_reverse ((unsigned char *)_s, digs);
8451 int res, digs;
8485 digs = 0;
8496 ++digs;
8502 bn_reverse ((unsigned char *)_s, digs);
9141 /* multiplies |a| * |b| and only computes upto digs digits of result
9145 int s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs)
9154 if (((digs) < MP_WARRAY) &&
9157 return fast_s_mp_mul_digs (a, b, c, digs);
9160 if ((res = mp_init_size (&t, digs)) != MP_OKAY) {
9163 t.used = digs;
9171 /* limit ourselves to making digs digits of output */
9172 pb = MIN (b->used, digs - ix);
9197 /* set carry if it is placed below digs */
9198 if (ix + iy < digs) {
9235 /* multiplies |a| * |b| and does not compute the lower digs digits
9239 s_mp_mul_high_digs (mp_int * a, mp_int * b, mp_int * c, int digs)
9251 return fast_s_mp_mul_high_digs (a, b, c, digs);
9270 tmpt = &(t.dp[digs]);
9273 tmpy = b->dp + (digs - ix);
9275 for (iy = digs - ix; iy < pb; iy++) {