Lines Matching full:digits
108 #define MP_PREC 32 /* default digits of precision */
110 #define MP_PREC 8 /* default digits of precision */
218 * them. "x" will point to the input with the most digits
270 * if A or B has more digits add those in
288 /* clear digits above oldused */
343 /* now copy higher words if any, e.g. if A has more digits than B */
355 /* clear digits above used (since we may not have grown result above) */
377 /* set the digits to zero */
382 /* set the used to zero, allocated digits to the default precision
399 /* first zero the digits */
506 * have less than MP_WARRAY digits and the number of
507 * digits won't affect carry propagation
689 /* compare digits */
924 /* compare based on # of non-zero digits */
939 /* compare based on digits */
958 /* make sure there are at least two digits */
1051 /* shift by as many digits in the bit count */
1149 /* copy all the digits */
1154 /* clear high digits */
1167 /* shift right a certain amount of digits */
1186 /* shift the digits down */
1191 /* top [offset into digits] */
1195 * the window is b-digits long and digits from
1208 /* zero the top digits */
1214 /* remove excess digits */
1232 /* trim unused digits
1234 * This is used to ensure that leading zero digits are
1237 * are no more leading digits
1263 /* ensure there are always at least MP_PREC digits extra on top */
1281 /* zero excess digits */
1362 /* zero excess digits */
1394 /* shift by as many digits in the bit count */
1493 /* shift left a certain amount of digits */
1503 /* grow to fit the new digits */
1530 /* zero the lower digits */
1551 /* get number of digits and add that */
1586 /* zero digits above the last digit of the modulus */
1676 * the case where digits are removed from 'x' in
1678 * case that y has fewer than three digits, etc..
2001 /* if digidx == -1 we are out of digits */
2329 /* multiplies |a| * |b| and only computes up to digs digits of result
2331 * many digits of output are created.
2355 /* compute the digits of the product directly */
2361 /* limit ourselves to making digs digits of output */
2371 /* an alias for the digits of b */
2411 * digits of output so if say only a half-product is required
2431 /* number of output digits to produce */
2480 /* clear unused digits [that existed in the old copy of c] */
2496 /* pad size so there are always extra digits */
2510 /* zero the digits */
2583 /* multiplies |a| * |b| and does not compute the lower digs digits
2616 /* alias to the address of where the digits will be stored */
2708 /* first we have to get the digits of the input into
2718 /* alias for the digits of x*/
2721 /* copy the digits of a into W[0..a->used-1] */
2732 /* now we proceed to zero successive digits
2753 * column since the Montgomery reduction requires digits of the
2764 /* alias for the digits of the modulus */
2782 * significant digits we zeroed].
2817 /* zero oldused digits, if the input a was larger than
2818 * m->used+1 we'll have to clear the digits
2888 /* now zero any excess digits on the destination
3124 /* if digidx == -1 we are out of digits so break */
3264 /* number of output digits to produce */
3324 /* clear unused digits [that existed in the old copy of c] */
3382 /* now zero digits above the top */