Lines Matching refs:DIGIT
313 /* now fix carry for next digit, W[ix+1] */
471 /* now extract the previous digit [below the carry] */
573 /* now extract the previous digit [below the carry] */
885 /* single digit addition */
930 /* add digit, after this we're propagating
953 /* the result is a single digit */
1110 * trimed and the leading "used" digit will be non-zero
1117 /* decrease used while the most significant digit is
1288 /* compare a digit */
1301 /* compare the only digit of a to b */
1415 /* now scan this digit until a 1 is found */
1539 /* take the last digit and count the bits in it */
1898 /* shift the current digit, add in carry and store */
2138 /* single digit division (based on routine from MPI) */
2250 * but the first digit must be equal to -1 (mod b).
2819 /* grab next digit as required */
2825 /* read next digit and reset bitcnt */
3054 /* if first digit is - then set negative */
3295 /* get most significant digit of result */
3296 res = DIGIT(a,i);
3299 res = (res << DIGIT_BIT) | DIGIT(a,i);
3541 /* initialize and set a digit */
3577 /* initialize and set a digit */
3933 if (rem_128[127 & DIGIT(arg,0)] == 1) {
4127 * digit) multiplications are performed, a0b0, a1b1 and
4618 /* zero digits above the last digit of the modulus */
4622 /* clear the digit that is not completely outside/inside the modulus */
4695 /* how many bits of last digit does b use */
4783 * input one digit at a time
4811 /* fix digit */
4814 /* At this point the ix'th digit of x should be zero */
5032 * MSB of the current digit
5036 /* now shift up this digit, add in the carry [from the previous] */
5040 * digit into the next iteration
5045 /* new leading digit? */
5178 /* multiply by a digit */
5213 /* mask off higher bits to get a single digit */
6237 /* digs is the digit count */
6334 /* first place a random non-zero digit */
6387 /* zero the digit bignum */
6395 /* if the leading digit is a
6408 /* process each digit of the string */
6745 than a single digit.
6923 /* Test every bit from the second digit up, must be 1 */
7126 /* set to a digit */
7536 /* single digit subtraction */
7569 /* if a <= b simply fix the single digit */
7578 /* negative/1digit */
7586 /* subtract first digit */
8398 * to the first digit [exluding the sign] of the number]
8490 * to the first digit [exluding the sign] of the number
8789 /* get old used digit count and set new one */
8797 /* alias for digit pointers */
8811 /* Compute the sum at one digit, T[i] = A[i] + B[i] + U */
9004 /* grab next digit as required */
9010 /* read next digit and reset the bitcnt */
9165 /* copy of the digit from a used within the nested loop */
9327 /* first calculate the digit at 2*ix */
9421 /* alias for digit pointers */
