Home | History | Annotate | Download | only in src

Lines Matching refs:number

125 static void FillDigits32FixedLength(uint32_t number, int requested_length,
128 buffer[(*length) + i] = '0' + number % 10;
129 number /= 10;
135 static void FillDigits32(uint32_t number, Vector<char> buffer, int* length) {
138 while (number != 0) {
139 int digit = number % 10;
140 number /= 10;
158 static void FillDigits64FixedLength(uint64_t number, int requested_length,
161 // For efficiency cut the number into 3 uint32_t parts, and print those.
162 uint32_t part2 = static_cast<uint32_t>(number % kTen7);
163 number /= kTen7;
164 uint32_t part1 = static_cast<uint32_t>(number % kTen7);
165 uint32_t part0 = static_cast<uint32_t>(number / kTen7);
173 static void FillDigits64(uint64_t number, Vector<char> buffer, int* length) {
175 // For efficiency cut the number into 3 uint32_t parts, and print those.
176 uint32_t part2 = static_cast<uint32_t>(number % kTen7);
177 number /= kTen7;
178 uint32_t part1 = static_cast<uint32_t>(number % kTen7);
179 uint32_t part0 = static_cast<uint32_t>(number / kTen7);
224 // The given fractionals number represents a fixed-point number with binary
239 // 'fractionals' is a fixed-point number, with binary point at bit
241 // is a fixed-point number, with binary point at bit 'point'.
243 // One 64 bit number is sufficient.
321 // If the exponent is larger than 20 (i.e. we may have a 73bit number) then we
338 // bit number.
374 // We have to cut the number.