Lines Matching defs:zeros
500 zeros. */
519 if we can delete some of the leading zeros */
536 /* If there are fewer than 2 digits, add zeros
538 int zeros = MIN_EXPONENT_DIGITS - exponent_digit_cnt;
539 if (start + zeros + exponent_digit_cnt + 1
541 memmove(start + zeros, start,
543 memset(start, '0', zeros);
549 /* Remove trailing zeros after the decimal point from a numeric string; also
580 /* scan back from fraction_end, looking for removable zeros */
777 for the extra zeros. Also, if there are more than
778 MIN_EXPONENT_DIGITS, remove as many zeros as possible until we get
1094 either on the left or right (or both) with extra zeros, so in
1097 [<sign>]<zeros><digits><zeros>[<exponent>]
1099 where either of the <zeros> pieces could be empty, and there's a
1101 leading or trailing <zeros>.
1105 right with infinite strings of zeros. We want to output a slice
1110 up producing some leading zeros; if vdigits_end > digits_len there
1111 will be trailing zeros in the output. The next section of code
1134 when a 16-digit 'shortest' repr is padded with bogus zeros.
1222 /* And zeros on the right */