1 /* Floating point output for `printf'.
2 Copyright (C) 1995-1999, 2000, 2001, 2002 Free Software Foundation, Inc.
3 This file is part of the GNU C Library.
4 Written by Ulrich Drepper <drepper@gnu.ai.mit.edu>, 1995.
6 The GNU C Library is free software; you can redistribute it and/or
7 modify it under the terms of the GNU Lesser General Public
8 License as published by the Free Software Foundation; either
9 version 2.1 of the License, or (at your option) any later version.
11 The GNU C Library is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 Lesser General Public License for more details.
16 You should have received a copy of the GNU Lesser General Public
17 License along with the GNU C Library; if not, write to the Free
18 Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
21 /* The gmp headers need some configuration frobs. */
32 #include <gmp-mparam.h>
34 #include <stdlib/gmp-impl.h>
35 #include <stdlib/longlong.h>
36 #include <stdlib/fpioconst.h>
37 #include <locale/localeinfo.h>
47 # define NDEBUG /* Undefine this for debugging assertions. */
51 /* This defines make it possible to use the same code for GNU C library and
52 the GNU I/O library. */
54 # define PUT(f, s, n) _IO_sputn (f, s, n)
55 # define PAD(f, c, n) (wide ? _IO_wpadn (f, c, n) : INTUSE(_IO_padn) (f, c, n))
56 /* We use this file GNU C library and GNU I/O library. So make
59 # define putc(c, f) (wide \
60 ? (int)_IO_putwc_unlocked (c, f) : _IO_putc_unlocked (c, f))
61 # define size_t _IO_size_t
62 # define FILE _IO_FILE
63 #else /* ! USE_IN_LIBIO */
64 # define PUT(f, s, n) fwrite (s, 1, n, f)
65 # define PAD(f, c, n) __printf_pad (f, c, n)
66 ssize_t __printf_pad
__P ((FILE *, char pad
, int n
)); /* In vfprintf.c. */
67 #endif /* USE_IN_LIBIO */
69 /* Macros for doing the actual output. */
74 register const int outc = (ch); \
75 if (putc (outc, fp) == EOF) \
80 #define PRINT(ptr, wptr, len) \
83 register size_t outlen = (len); \
86 if (PUT (fp, wide ? (const char *) wptr : ptr, outlen) != outlen) \
94 while (outlen-- > 0) \
97 while (outlen-- > 0) \
102 #define PADN(ch, len) \
105 if (PAD (fp, ch, len) != len) \
111 /* We use the GNU MP library to handle large numbers.
113 An MP variable occupies a varying number of entries in its array. We keep
114 track of this number for efficiency reasons. Otherwise we would always
115 have to process the whole array. */
116 #define MPN_VAR(name) mp_limb_t *name; mp_size_t name##size
118 #define MPN_ASSIGN(dst,src) \
119 memcpy (dst, src, (dst##size = src##size) * sizeof (mp_limb_t))
120 #define MPN_GE(u,v) \
121 (u##size > v##size || (u##size == v##size && __mpn_cmp (u, v, u##size) >= 0))
123 extern int __isinfl_internal (long double) attribute_hidden
;
124 extern int __isnanl_internal (long double) attribute_hidden
;
126 extern mp_size_t
__mpn_extract_double (mp_ptr res_ptr
, mp_size_t size
,
127 int *expt
, int *is_neg
,
129 extern mp_size_t
__mpn_extract_long_double (mp_ptr res_ptr
, mp_size_t size
,
130 int *expt
, int *is_neg
,
132 extern unsigned int __guess_grouping (unsigned int intdig_max
,
133 const char *grouping
);
136 static wchar_t *group_number (wchar_t *buf
, wchar_t *bufend
,
137 unsigned int intdig_no
, const char *grouping
,
138 wchar_t thousands_sep
, int ngroups
)
143 __printf_fp (FILE *fp
,
144 const struct printf_info
*info
,
145 const void *const *args
)
147 /* The floating-point value to output. */
151 __long_double_t ldbl
;
155 /* Locale-dependent representation of decimal point. */
159 /* Locale-dependent thousands separator and grouping specification. */
160 const char *thousands_sep
= NULL
;
161 wchar_t thousands_sepwc
= 0;
162 const char *grouping
;
164 /* "NaN" or "Inf" for the special cases. */
165 const char *special
= NULL
;
166 const wchar_t *wspecial
= NULL
;
168 /* We need just a few limbs for the input before shifting to the right
170 mp_limb_t fp_input
[(LDBL_MANT_DIG
+ BITS_PER_MP_LIMB
- 1) / BITS_PER_MP_LIMB
];
171 /* We need to shift the contents of fp_input by this amount of bits. */
174 /* The fraction of the floting-point value in question */
176 /* and the exponent. */
178 /* Sign of the exponent. */
180 /* Sign of float number. */
183 /* Scaling factor. */
186 /* Temporary bignum value. */
189 /* Digit which is result of last hack_digit() call. */
192 /* The type of output format that will be used: 'e'/'E' or 'f'. */
195 /* Counter for number of written characters. */
198 /* General helper (carry limb). */
201 /* Nonzero if this is output on a wide character stream. */
202 int wide
= info
->wide
;
204 auto wchar_t hack_digit (void);
206 wchar_t hack_digit (void)
210 if (expsign
!= 0 && type
== 'f' && exponent
-- > 0)
212 else if (scalesize
== 0)
214 hi
= frac
[fracsize
- 1];
215 frac
[fracsize
- 1] = __mpn_mul_1 (frac
, frac
, fracsize
- 1, 10);
219 if (fracsize
< scalesize
)
223 hi
= mpn_divmod (tmp
, frac
, fracsize
, scale
, scalesize
);
224 tmp
[fracsize
- scalesize
] = hi
;
227 fracsize
= scalesize
;
228 while (fracsize
!= 0 && frac
[fracsize
- 1] == 0)
232 /* We're not prepared for an mpn variable with zero
239 mp_limb_t _cy
= __mpn_mul_1 (frac
, frac
, fracsize
, 10);
241 frac
[fracsize
++] = _cy
;
248 /* Figure out the decimal point character. */
249 if (info
->extra
== 0)
251 decimal
= _NL_CURRENT (LC_NUMERIC
, DECIMAL_POINT
);
252 decimalwc
= _NL_CURRENT_WORD (LC_NUMERIC
, _NL_NUMERIC_DECIMAL_POINT_WC
);
256 decimal
= _NL_CURRENT (LC_MONETARY
, MON_DECIMAL_POINT
);
257 if (*decimal
== '\0')
258 decimal
= _NL_CURRENT (LC_NUMERIC
, DECIMAL_POINT
);
259 decimalwc
= _NL_CURRENT_WORD (LC_MONETARY
,
260 _NL_MONETARY_DECIMAL_POINT_WC
);
261 if (decimalwc
== L
'\0')
262 decimalwc
= _NL_CURRENT_WORD (LC_NUMERIC
,
263 _NL_NUMERIC_DECIMAL_POINT_WC
);
265 /* The decimal point character must not be zero. */
266 assert (*decimal
!= '\0');
267 assert (decimalwc
!= L
'\0');
271 if (info
->extra
== 0)
272 grouping
= _NL_CURRENT (LC_NUMERIC
, GROUPING
);
274 grouping
= _NL_CURRENT (LC_MONETARY
, MON_GROUPING
);
276 if (*grouping
<= 0 || *grouping
== CHAR_MAX
)
280 /* Figure out the thousands separator character. */
283 if (info
->extra
== 0)
285 _NL_CURRENT_WORD (LC_NUMERIC
, _NL_NUMERIC_THOUSANDS_SEP_WC
);
288 _NL_CURRENT_WORD (LC_MONETARY
,
289 _NL_MONETARY_THOUSANDS_SEP_WC
);
293 if (info
->extra
== 0)
294 thousands_sep
= _NL_CURRENT (LC_NUMERIC
, THOUSANDS_SEP
);
296 thousands_sep
= _NL_CURRENT (LC_MONETARY
, MON_THOUSANDS_SEP
);
299 if ((wide
&& thousands_sepwc
== L
'\0')
300 || (! wide
&& *thousands_sep
== '\0'))
302 else if (thousands_sepwc
== L
'\0')
303 /* If we are printing multibyte characters and there is a
304 multibyte representation for the thousands separator,
305 we must ensure the wide character thousands separator
306 is available, even if it is fake. */
307 thousands_sepwc
= 0xfffffffe;
313 /* Fetch the argument value. */
314 #ifndef __NO_LONG_DOUBLE_MATH
315 if (info
->is_long_double
&& sizeof (long double) > sizeof (double))
317 fpnum
.ldbl
= *(const long double *) args
[0];
319 /* Check for special values: not a number or infinity. */
320 if (__isnanl (fpnum
.ldbl
))
322 if (isupper (info
->spec
))
334 else if (__isinfl (fpnum
.ldbl
))
336 if (isupper (info
->spec
))
346 is_neg
= fpnum
.ldbl
< 0;
350 fracsize
= __mpn_extract_long_double (fp_input
,
352 sizeof (fp_input
[0])),
355 to_shift
= 1 + fracsize
* BITS_PER_MP_LIMB
- LDBL_MANT_DIG
;
359 #endif /* no long double */
361 fpnum
.dbl
= *(const double *) args
[0];
363 /* Check for special values: not a number or infinity. */
364 if (__isnan (fpnum
.dbl
))
367 if (isupper (info
->spec
))
378 else if (__isinf (fpnum
.dbl
))
380 is_neg
= fpnum
.dbl
< 0;
381 if (isupper (info
->spec
))
394 fracsize
= __mpn_extract_double (fp_input
,
396 / sizeof (fp_input
[0])),
397 &exponent
, &is_neg
, fpnum
.dbl
);
398 to_shift
= 1 + fracsize
* BITS_PER_MP_LIMB
- DBL_MANT_DIG
;
404 int width
= info
->width
;
406 if (is_neg
|| info
->showsign
|| info
->space
)
410 if (!info
->left
&& width
> 0)
415 else if (info
->showsign
)
417 else if (info
->space
)
420 PRINT (special
, wspecial
, 3);
422 if (info
->left
&& width
> 0)
429 /* We need three multiprecision variables. Now that we have the exponent
430 of the number we can allocate the needed memory. It would be more
431 efficient to use variables of the fixed maximum size but because this
432 would be really big it could lead to memory problems. */
434 mp_size_t bignum_size
= ((ABS (exponent
) + BITS_PER_MP_LIMB
- 1)
435 / BITS_PER_MP_LIMB
+ 4) * sizeof (mp_limb_t
);
436 frac
= (mp_limb_t
*) alloca (bignum_size
);
437 tmp
= (mp_limb_t
*) alloca (bignum_size
);
438 scale
= (mp_limb_t
*) alloca (bignum_size
);
441 /* We now have to distinguish between numbers with positive and negative
442 exponents because the method used for the one is not applicable/efficient
449 int explog
= LDBL_MAX_10_EXP_LOG
;
451 const struct mp_power
*powers
= &_fpioconst_pow10
[explog
+ 1];
454 if ((exponent
+ to_shift
) % BITS_PER_MP_LIMB
== 0)
456 MPN_COPY_DECR (frac
+ (exponent
+ to_shift
) / BITS_PER_MP_LIMB
,
458 fracsize
+= (exponent
+ to_shift
) / BITS_PER_MP_LIMB
;
462 cy
= __mpn_lshift (frac
+ (exponent
+ to_shift
) / BITS_PER_MP_LIMB
,
464 (exponent
+ to_shift
) % BITS_PER_MP_LIMB
);
465 fracsize
+= (exponent
+ to_shift
) / BITS_PER_MP_LIMB
;
467 frac
[fracsize
++] = cy
;
469 MPN_ZERO (frac
, (exponent
+ to_shift
) / BITS_PER_MP_LIMB
);
471 assert (powers
> &_fpioconst_pow10
[0]);
476 /* The number of the product of two binary numbers with n and m
477 bits respectively has m+n or m+n-1 bits. */
478 if (exponent
>= scaleexpo
+ powers
->p_expo
- 1)
482 #ifndef __NO_LONG_DOUBLE_MATH
483 if (LDBL_MANT_DIG
> _FPIO_CONST_OFFSET
* BITS_PER_MP_LIMB
484 && info
->is_long_double
)
486 #define _FPIO_CONST_SHIFT \
487 (((LDBL_MANT_DIG + BITS_PER_MP_LIMB - 1) / BITS_PER_MP_LIMB) \
488 - _FPIO_CONST_OFFSET)
489 /* 64bit const offset is not enough for
490 IEEE quad long double. */
491 tmpsize
= powers
->arraysize
+ _FPIO_CONST_SHIFT
;
492 memcpy (tmp
+ _FPIO_CONST_SHIFT
,
493 &__tens
[powers
->arrayoff
],
494 tmpsize
* sizeof (mp_limb_t
));
495 MPN_ZERO (tmp
, _FPIO_CONST_SHIFT
);
496 /* Adjust exponent, as scaleexpo will be this much
498 exponent
+= _FPIO_CONST_SHIFT
* BITS_PER_MP_LIMB
;
503 tmpsize
= powers
->arraysize
;
504 memcpy (tmp
, &__tens
[powers
->arrayoff
],
505 tmpsize
* sizeof (mp_limb_t
));
510 cy
= __mpn_mul (tmp
, scale
, scalesize
,
511 &__tens
[powers
->arrayoff
512 + _FPIO_CONST_OFFSET
],
513 powers
->arraysize
- _FPIO_CONST_OFFSET
);
514 tmpsize
= scalesize
+ powers
->arraysize
- _FPIO_CONST_OFFSET
;
519 if (MPN_GE (frac
, tmp
))
522 MPN_ASSIGN (scale
, tmp
);
523 count_leading_zeros (cnt
, scale
[scalesize
- 1]);
524 scaleexpo
= (scalesize
- 2) * BITS_PER_MP_LIMB
- cnt
- 1;
525 exp10
|= 1 << explog
;
530 while (powers
> &_fpioconst_pow10
[0]);
533 /* Optimize number representations. We want to represent the numbers
534 with the lowest number of bytes possible without losing any
535 bytes. Also the highest bit in the scaling factor has to be set
536 (this is a requirement of the MPN division routines). */
539 /* Determine minimum number of zero bits at the end of
541 for (i
= 0; scale
[i
] == 0 && frac
[i
] == 0; i
++)
544 /* Determine number of bits the scaling factor is misplaced. */
545 count_leading_zeros (cnt_h
, scale
[scalesize
- 1]);
549 /* The highest bit of the scaling factor is already set. So
550 we only have to remove the trailing empty limbs. */
553 MPN_COPY_INCR (scale
, scale
+ i
, scalesize
- i
);
555 MPN_COPY_INCR (frac
, frac
+ i
, fracsize
- i
);
563 count_trailing_zeros (cnt_l
, scale
[i
]);
567 count_trailing_zeros (cnt_l2
, frac
[i
]);
573 count_trailing_zeros (cnt_l
, frac
[i
]);
575 /* Now shift the numbers to their optimal position. */
576 if (i
== 0 && BITS_PER_MP_LIMB
- cnt_h
> cnt_l
)
578 /* We cannot save any memory. So just roll both numbers
579 so that the scaling factor has its highest bit set. */
581 (void) __mpn_lshift (scale
, scale
, scalesize
, cnt_h
);
582 cy
= __mpn_lshift (frac
, frac
, fracsize
, cnt_h
);
584 frac
[fracsize
++] = cy
;
586 else if (BITS_PER_MP_LIMB
- cnt_h
<= cnt_l
)
588 /* We can save memory by removing the trailing zero limbs
589 and by packing the non-zero limbs which gain another
592 (void) __mpn_rshift (scale
, scale
+ i
, scalesize
- i
,
593 BITS_PER_MP_LIMB
- cnt_h
);
595 (void) __mpn_rshift (frac
, frac
+ i
, fracsize
- i
,
596 BITS_PER_MP_LIMB
- cnt_h
);
597 fracsize
-= frac
[fracsize
- i
- 1] == 0 ? i
+ 1 : i
;
601 /* We can only save the memory of the limbs which are zero.
602 The non-zero parts occupy the same number of limbs. */
604 (void) __mpn_rshift (scale
, scale
+ (i
- 1),
606 BITS_PER_MP_LIMB
- cnt_h
);
608 (void) __mpn_rshift (frac
, frac
+ (i
- 1),
610 BITS_PER_MP_LIMB
- cnt_h
);
611 fracsize
-= frac
[fracsize
- (i
- 1) - 1] == 0 ? i
: i
- 1;
616 else if (exponent
< 0)
620 int explog
= LDBL_MAX_10_EXP_LOG
;
621 const struct mp_power
*powers
= &_fpioconst_pow10
[explog
+ 1];
622 mp_size_t used_limbs
= fracsize
- 1;
624 /* Now shift the input value to its right place. */
625 cy
= __mpn_lshift (frac
, fp_input
, fracsize
, to_shift
);
626 frac
[fracsize
++] = cy
;
627 assert (cy
== 1 || (frac
[fracsize
- 2] == 0 && frac
[0] == 0));
630 exponent
= -exponent
;
632 assert (powers
!= &_fpioconst_pow10
[0]);
637 if (exponent
>= powers
->m_expo
)
639 int i
, incr
, cnt_h
, cnt_l
;
642 /* The __mpn_mul function expects the first argument to be
643 bigger than the second. */
644 if (fracsize
< powers
->arraysize
- _FPIO_CONST_OFFSET
)
645 cy
= __mpn_mul (tmp
, &__tens
[powers
->arrayoff
646 + _FPIO_CONST_OFFSET
],
647 powers
->arraysize
- _FPIO_CONST_OFFSET
,
650 cy
= __mpn_mul (tmp
, frac
, fracsize
,
651 &__tens
[powers
->arrayoff
+ _FPIO_CONST_OFFSET
],
652 powers
->arraysize
- _FPIO_CONST_OFFSET
);
653 tmpsize
= fracsize
+ powers
->arraysize
- _FPIO_CONST_OFFSET
;
657 count_leading_zeros (cnt_h
, tmp
[tmpsize
- 1]);
658 incr
= (tmpsize
- fracsize
) * BITS_PER_MP_LIMB
659 + BITS_PER_MP_LIMB
- 1 - cnt_h
;
661 assert (incr
<= powers
->p_expo
);
663 /* If we increased the exponent by exactly 3 we have to test
664 for overflow. This is done by comparing with 10 shifted
665 to the right position. */
666 if (incr
== exponent
+ 3)
668 if (cnt_h
<= BITS_PER_MP_LIMB
- 4)
672 = ((mp_limb_t
) 10) << (BITS_PER_MP_LIMB
- 4 - cnt_h
);
676 topval
[0] = ((mp_limb_t
) 10) << (BITS_PER_MP_LIMB
- 4);
678 (void) __mpn_lshift (topval
, topval
, 2,
679 BITS_PER_MP_LIMB
- cnt_h
);
683 /* We have to be careful when multiplying the last factor.
684 If the result is greater than 1.0 be have to test it
685 against 10.0. If it is greater or equal to 10.0 the
686 multiplication was not valid. This is because we cannot
687 determine the number of bits in the result in advance. */
688 if (incr
< exponent
+ 3
689 || (incr
== exponent
+ 3 &&
690 (tmp
[tmpsize
- 1] < topval
[1]
691 || (tmp
[tmpsize
- 1] == topval
[1]
692 && tmp
[tmpsize
- 2] < topval
[0]))))
694 /* The factor is right. Adapt binary and decimal
697 exp10
|= 1 << explog
;
699 /* If this factor yields a number greater or equal to
700 1.0, we must not shift the non-fractional digits down. */
704 /* Now we optimize the number representation. */
705 for (i
= 0; tmp
[i
] == 0; ++i
);
706 if (cnt_h
== BITS_PER_MP_LIMB
- 1)
708 MPN_COPY (frac
, tmp
+ i
, tmpsize
- i
);
709 fracsize
= tmpsize
- i
;
713 count_trailing_zeros (cnt_l
, tmp
[i
]);
715 /* Now shift the numbers to their optimal position. */
716 if (i
== 0 && BITS_PER_MP_LIMB
- 1 - cnt_h
> cnt_l
)
718 /* We cannot save any memory. Just roll the
719 number so that the leading digit is in a
722 cy
= __mpn_lshift (frac
, tmp
, tmpsize
, cnt_h
+ 1);
723 fracsize
= tmpsize
+ 1;
724 frac
[fracsize
- 1] = cy
;
726 else if (BITS_PER_MP_LIMB
- 1 - cnt_h
<= cnt_l
)
728 (void) __mpn_rshift (frac
, tmp
+ i
, tmpsize
- i
,
729 BITS_PER_MP_LIMB
- 1 - cnt_h
);
730 fracsize
= tmpsize
- i
;
734 /* We can only save the memory of the limbs which
735 are zero. The non-zero parts occupy the same
738 (void) __mpn_rshift (frac
, tmp
+ (i
- 1),
740 BITS_PER_MP_LIMB
- 1 - cnt_h
);
741 fracsize
= tmpsize
- (i
- 1);
744 used_limbs
= fracsize
- 1;
749 while (powers
!= &_fpioconst_pow10
[1] && exponent
> 0);
750 /* All factors but 10^-1 are tested now. */
755 cy
= __mpn_mul_1 (tmp
, frac
, fracsize
, 10);
757 assert (cy
== 0 || tmp
[tmpsize
- 1] < 20);
759 count_trailing_zeros (cnt_l
, tmp
[0]);
760 if (cnt_l
< MIN (4, exponent
))
762 cy
= __mpn_lshift (frac
, tmp
, tmpsize
,
763 BITS_PER_MP_LIMB
- MIN (4, exponent
));
765 frac
[tmpsize
++] = cy
;
768 (void) __mpn_rshift (frac
, tmp
, tmpsize
, MIN (4, exponent
));
771 assert (frac
[fracsize
- 1] < 10);
777 /* This is a special case. We don't need a factor because the
778 numbers are in the range of 0.0 <= fp < 8.0. We simply
779 shift it to the right place and divide it by 1.0 to get the
780 leading digit. (Of course this division is not really made.) */
781 assert (0 <= exponent
&& exponent
< 3 &&
782 exponent
+ to_shift
< BITS_PER_MP_LIMB
);
784 /* Now shift the input value to its right place. */
785 cy
= __mpn_lshift (frac
, fp_input
, fracsize
, (exponent
+ to_shift
));
786 frac
[fracsize
++] = cy
;
791 int width
= info
->width
;
792 wchar_t *wbuffer
, *wstartp
, *wcp
;
796 int intdig_max
, intdig_no
= 0;
797 int fracdig_min
, fracdig_max
, fracdig_no
= 0;
802 if (_tolower (info
->spec
) == 'e')
806 fracdig_min
= fracdig_max
= info
->prec
< 0 ? 6 : info
->prec
;
807 chars_needed
= 1 + 1 + fracdig_max
+ 1 + 1 + 4;
808 /* d . ddd e +- ddd */
809 dig_max
= INT_MAX
; /* Unlimited. */
810 significant
= 1; /* Does not matter here. */
812 else if (_tolower (info
->spec
) == 'f')
815 fracdig_min
= fracdig_max
= info
->prec
< 0 ? 6 : info
->prec
;
816 dig_max
= INT_MAX
; /* Unlimited. */
817 significant
= 1; /* Does not matter here. */
820 intdig_max
= exponent
+ 1;
821 /* This can be really big! */ /* XXX Maybe malloc if too big? */
822 chars_needed
= exponent
+ 1 + 1 + fracdig_max
;
827 chars_needed
= 1 + 1 + fracdig_max
;
832 dig_max
= info
->prec
< 0 ? 6 : (info
->prec
== 0 ? 1 : info
->prec
);
833 if ((expsign
== 0 && exponent
>= dig_max
)
834 || (expsign
!= 0 && exponent
> 4))
836 if ('g' - 'G' == 'e' - 'E')
837 type
= 'E' + (info
->spec
- 'G');
839 type
= isupper (info
->spec
) ? 'E' : 'e';
840 fracdig_max
= dig_max
- 1;
842 chars_needed
= 1 + 1 + fracdig_max
+ 1 + 1 + 4;
847 intdig_max
= expsign
== 0 ? exponent
+ 1 : 0;
848 fracdig_max
= dig_max
- intdig_max
;
849 /* We need space for the significant digits and perhaps
850 for leading zeros when < 1.0. The number of leading
851 zeros can be as many as would be required for
852 exponential notation with a negative two-digit
853 exponent, which is 4. */
854 chars_needed
= dig_max
+ 1 + 4;
856 fracdig_min
= info
->alt
? fracdig_max
: 0;
857 significant
= 0; /* We count significant digits. */
862 /* Guess the number of groups we will make, and thus how
863 many spaces we need for separator characters. */
864 ngroups
= __guess_grouping (intdig_max
, grouping
);
865 chars_needed
+= ngroups
;
868 /* Allocate buffer for output. We need two more because while rounding
869 it is possible that we need two more characters in front of all the
870 other output. If the amount of memory we have to allocate is too
871 large use `malloc' instead of `alloca'. */
872 buffer_malloced
= ! __libc_use_alloca (chars_needed
* 2 * sizeof (wchar_t));
875 wbuffer
= (wchar_t *) malloc ((2 + chars_needed
) * sizeof (wchar_t));
877 /* Signal an error to the caller. */
881 wbuffer
= (wchar_t *) alloca ((2 + chars_needed
) * sizeof (wchar_t));
882 wcp
= wstartp
= wbuffer
+ 2; /* Let room for rounding. */
884 /* Do the real work: put digits in allocated buffer. */
885 if (expsign
== 0 || type
!= 'f')
887 assert (expsign
== 0 || intdig_max
== 1);
888 while (intdig_no
< intdig_max
)
891 *wcp
++ = hack_digit ();
896 || (fracdig_max
> 0 && (fracsize
> 1 || frac
[0] != 0)))
901 /* |fp| < 1.0 and the selected type is 'f', so put "0."
908 /* Generate the needed number of fractional digits. */
909 while (fracdig_no
< fracdig_min
910 || (fracdig_no
< fracdig_max
&& (fracsize
> 1 || frac
[0] != 0)))
913 *wcp
= hack_digit ();
916 else if (significant
== 0)
925 digit
= hack_digit ();
931 && ((*(wcp
- 1) != decimalwc
&& (*(wcp
- 1) & 1) == 0)
932 || ((*(wcp
- 1) == decimalwc
&& (*(wcp
- 2) & 1) == 0))))
934 /* This is the critical case. */
935 if (fracsize
== 1 && frac
[0] == 0)
936 /* Rest of the number is zero -> round to even.
937 (IEEE 754-1985 4.1 says this is the default rounding.) */
939 else if (scalesize
== 0)
941 /* Here we have to see whether all limbs are zero since no
942 normalization happened. */
943 size_t lcnt
= fracsize
;
944 while (lcnt
>= 1 && frac
[lcnt
- 1] == 0)
947 /* Rest of the number is zero -> round to even.
948 (IEEE 754-1985 4.1 says this is the default rounding.) */
955 /* Process fractional digits. Terminate if not rounded or
956 radix character is reached. */
957 while (*--wtp
!= decimalwc
&& *wtp
== L
'9')
959 if (*wtp
!= decimalwc
)
964 if (fracdig_no
== 0 || *wtp
== decimalwc
)
966 /* Round the integer digits. */
967 if (*(wtp
- 1) == decimalwc
)
970 while (--wtp
>= wstartp
&& *wtp
== L
'9')
977 /* It is more critical. All digits were 9's. */
982 exponent
+= expsign
== 0 ? 1 : -1;
984 else if (intdig_no
== dig_max
)
986 /* This is the case where for type %g the number fits
987 really in the range for %f output but after rounding
988 the number of digits is too big. */
989 *--wstartp
= decimalwc
;
992 if (info
->alt
|| fracdig_no
> 0)
994 /* Overwrite the old radix character. */
995 wstartp
[intdig_no
+ 2] = L
'0';
999 fracdig_no
+= intdig_no
;
1001 fracdig_max
= intdig_max
- intdig_no
;
1003 /* Now we must print the exponent. */
1004 type
= isupper (info
->spec
) ? 'E' : 'e';
1008 /* We can simply add another another digit before the
1014 /* While rounding the number of digits can change.
1015 If the number now exceeds the limits remove some
1016 fractional digits. */
1017 if (intdig_no
+ fracdig_no
> dig_max
)
1019 wcp
-= intdig_no
+ fracdig_no
- dig_max
;
1020 fracdig_no
-= intdig_no
+ fracdig_no
- dig_max
;
1027 /* Now remove unnecessary '0' at the end of the string. */
1028 while (fracdig_no
> fracdig_min
&& *(wcp
- 1) == L
'0')
1033 /* If we eliminate all fractional digits we perhaps also can remove
1034 the radix character. */
1035 if (fracdig_no
== 0 && !info
->alt
&& *(wcp
- 1) == decimalwc
)
1039 /* Add in separator characters, overwriting the same buffer. */
1040 wcp
= group_number (wstartp
, wcp
, intdig_no
, grouping
, thousands_sepwc
,
1043 /* Write the exponent if it is needed. */
1046 *wcp
++ = (wchar_t) type
;
1047 *wcp
++ = expsign
? L
'-' : L
'+';
1049 /* Find the magnitude of the exponent. */
1051 while (expscale
<= exponent
)
1055 /* Exponent always has at least two digits. */
1061 *wcp
++ = L
'0' + (exponent
/ expscale
);
1062 exponent
%= expscale
;
1064 while (expscale
> 10);
1065 *wcp
++ = L
'0' + exponent
;
1068 /* Compute number of characters which must be filled with the padding
1070 if (is_neg
|| info
->showsign
|| info
->space
)
1072 width
-= wcp
- wstartp
;
1074 if (!info
->left
&& info
->pad
!= '0' && width
> 0)
1075 PADN (info
->pad
, width
);
1079 else if (info
->showsign
)
1081 else if (info
->space
)
1084 if (!info
->left
&& info
->pad
== '0' && width
> 0)
1088 char *buffer
= NULL
;
1094 /* Create the single byte string. */
1096 size_t thousands_sep_len
;
1099 decimal_len
= strlen (decimal
);
1101 if (thousands_sep
== NULL
)
1102 thousands_sep_len
= 0;
1104 thousands_sep_len
= strlen (thousands_sep
);
1106 if (buffer_malloced
)
1108 buffer
= (char *) malloc (2 + chars_needed
+ decimal_len
1109 + ngroups
* thousands_sep_len
);
1111 /* Signal an error to the caller. */
1115 buffer
= (char *) alloca (2 + chars_needed
+ decimal_len
1116 + ngroups
* thousands_sep_len
);
1118 /* Now copy the wide character string. Since the character
1119 (except for the decimal point and thousands separator) must
1120 be coming from the ASCII range we can esily convert the
1121 string without mapping tables. */
1122 for (cp
= buffer
, copywc
= wstartp
; copywc
< wcp
; ++copywc
)
1123 if (*copywc
== decimalwc
)
1124 cp
= (char *) __mempcpy (cp
, decimal
, decimal_len
);
1125 else if (*copywc
== thousands_sepwc
)
1126 cp
= (char *) __mempcpy (cp
, thousands_sep
, thousands_sep_len
);
1128 *cp
++ = (char) *copywc
;
1132 PRINT (tmpptr
, wstartp
, wide
? wcp
- wstartp
: cp
- tmpptr
);
1134 /* Free the memory if necessary. */
1135 if (buffer_malloced
)
1142 if (info
->left
&& width
> 0)
1143 PADN (info
->pad
, width
);
1147 libc_hidden_def (__printf_fp
)
1149 /* Return the number of extra grouping characters that will be inserted
1150 into a number with INTDIG_MAX integer digits. */
1153 __guess_grouping (unsigned int intdig_max
, const char *grouping
)
1155 unsigned int groups
;
1157 /* We treat all negative values like CHAR_MAX. */
1159 if (*grouping
== CHAR_MAX
|| *grouping
<= 0)
1160 /* No grouping should be done. */
1164 while (intdig_max
> (unsigned int) *grouping
)
1167 intdig_max
-= *grouping
++;
1169 if (*grouping
== CHAR_MAX
1174 /* No more grouping should be done. */
1176 else if (*grouping
== 0)
1178 /* Same grouping repeats. */
1179 groups
+= (intdig_max
- 1) / grouping
[-1];
1187 /* Group the INTDIG_NO integer digits of the number in [BUF,BUFEND).
1188 There is guaranteed enough space past BUFEND to extend it.
1189 Return the new end of buffer. */
1193 group_number (wchar_t *buf
, wchar_t *bufend
, unsigned int intdig_no
,
1194 const char *grouping
, wchar_t thousands_sep
, int ngroups
)
1201 /* Move the fractional part down. */
1202 __wmemmove (buf
+ intdig_no
+ ngroups
, buf
+ intdig_no
,
1203 bufend
- (buf
+ intdig_no
));
1205 p
= buf
+ intdig_no
+ ngroups
- 1;
1208 unsigned int len
= *grouping
++;
1210 *p
-- = buf
[--intdig_no
];
1212 *p
-- = thousands_sep
;
1214 if (*grouping
== CHAR_MAX
1219 /* No more grouping should be done. */
1221 else if (*grouping
== 0)
1222 /* Same grouping repeats. */
1224 } while (intdig_no
> (unsigned int) *grouping
);
1226 /* Copy the remaining ungrouped digits. */
1228 *p
-- = buf
[--intdig_no
];
1231 return bufend
+ ngroups
;