Lines Matching refs:digit
9 #include "src/bigint/digit-arithmetic.h"
181 // When processing the last (most significant) digit, don't write leading
183 char* BasecaseLast(digit_t digit, char* out) {
184 if (radix_ == 10) return BasecaseFixedLast<10>(digit, out);
187 *(--out) = kConversionChars[digit % radix_];
188 digit /= radix_;
189 } while (digit > 0);
193 // When processing a middle (non-most significant) digit, always write the
195 char* BasecaseMiddle(digit_t digit, char* out) {
198 *(--out) = kConversionChars[digit % radix_];
199 digit /= radix_;
201 DCHECK(digit == 0);
245 digit_t digit = 0;
246 // Keeps track of how many unprocessed bits there are in {digit}.
251 int current = (digit | (new_digit << available_bits)) & char_mask;
254 digit = new_digit >> consumed_bits;
257 *(--out_) = kConversionChars[digit & char_mask];
258 digit >>= bits_per_char;
264 int current = (digit | (msd << available_bits)) & char_mask;
266 digit = msd >> (bits_per_char - available_bits);
267 while (digit != 0) {
268 *(--out_) = kConversionChars[digit & char_mask];
269 digit >>= bits_per_char;
448 // Step 0: if only one digit is left, bail out to the base case.
500 // Allocate one extra digit so the next level can left-shift in-place.
502 // Allocate one extra digit because DivideBarrett requires it.