Lines Matching defs:digits
68 digits, we estimate the output size by taking the least integer
94 /* s_dmap_1 - standard digits and letters */
228 all the used digits of 'from', we'll re-use it to avoid hitting
430 its primary addend (single digits are unsigned anyway).
474 sign of its subtrahend (single digits are unsigned anyway).
519 of its multiplicand (single digits are unsigned anyway)
567 single digit d. Respects the sign of its divisor (single digits are
824 * converts an mp_int with 32-bit "digits" to an array
826 * *digits[0], etc.)
828 * its address in *digits and its size (#of uint64_t's
830 * this function will allocate it and change *digits and
836 uint64_t **digits, int *numdigits)
844 if ((*digits == NULL) || (n > *numdigits)) {
847 d = *digits;
866 *digits = d;
1158 /* now add the squares of the digits of a to sqr. */
1324 /* Loop over low-order digits in ascending order */
1707 /* Loop over digits of b in ascending order, except highest order */
1711 /* Loop over the bits of the lower-order digits */
2685 /* Read the rest of the digits */
2875 /* Generate output digits in reverse order */
2882 /* Generate digits, use capital letters */
2895 /* Reverse the digits and sign indicator */
2961 /* Make sure there are at least 'min' digits allocated to mp */
3018 /* Set 'count' digits pointed to by dp to be zeroes */
3038 /* Copy 'count' digits from sp to dp */
3129 Shift mp leftward by p digits, growing if needed, and zero-filling
3130 the in-shifted digits at the right end. This is a convenient
3157 /* Fill the bottom digits with zeroes */
3212 Shift mp rightward by p digits. Maintains the invariant that
3213 digits above the precision are all zero. Digits shifted off the
3225 /* Shortcut when all digits are to be shifted off */
3240 /* Fill the top digits with zeroes */
3272 /* Shift digits leftward by 1 bit */
3319 /* Flush all digits above the one with 2^d in it */
3364 that we might make good guesses for quotient digits, we want the
3684 Add up all digits up to the precision of b. If b had initially
3688 propagated upward among the higher-order digits of the sum.
3707 /* If we run out of 'b' digits before we're actually done, make
3777 Add up all digits up to the precision of b. If b had initially
3781 propagated upward among the higher-order digits of the sum.
3801 /* If we run out of 'b' digits before we're actually done, make
3860 Add up all digits up to the precision of b. If b had initially
3864 propagated upward among the higher-order digits of the sum.
3881 /* If we run out of 'b' digits before we're actually done, make
3939 accounts for the digits of b; after that, we just make sure the
4013 accounts for the digits of b; after that, we just make sure the
4241 /* Add the squares of the digits of a to the digits of b. */
4547 mu = b^2k / m, where b = RADIX and k = #digits(m). This should be
4876 /* Read the rest of the digits */