]>
Commit | Line | Data |
---|---|---|
28f540f4 | 1 | /* Floating point output for `printf'. |
bfff8b1b | 2 | Copyright (C) 1995-2017 Free Software Foundation, Inc. |
4c02bf1a | 3 | |
feb3c934 UD |
4 | This file is part of the GNU C Library. |
5 | Written by Ulrich Drepper <drepper@gnu.ai.mit.edu>, 1995. | |
6 | ||
7 | The GNU C Library is free software; you can redistribute it and/or | |
41bdb6e2 AJ |
8 | modify it under the terms of the GNU Lesser General Public |
9 | License as published by the Free Software Foundation; either | |
10 | version 2.1 of the License, or (at your option) any later version. | |
feb3c934 UD |
11 | |
12 | The GNU C Library is distributed in the hope that it will be useful, | |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
41bdb6e2 | 15 | Lesser General Public License for more details. |
feb3c934 | 16 | |
41bdb6e2 | 17 | You should have received a copy of the GNU Lesser General Public |
59ba27a6 PE |
18 | License along with the GNU C Library; if not, see |
19 | <http://www.gnu.org/licenses/>. */ | |
28f540f4 | 20 | |
3f92886a RM |
21 | /* The gmp headers need some configuration frobs. */ |
22 | #define HAVE_ALLOCA 1 | |
23 | ||
8a7455e7 | 24 | #include <libioP.h> |
28f540f4 | 25 | #include <alloca.h> |
28f540f4 RM |
26 | #include <ctype.h> |
27 | #include <float.h> | |
28 | #include <gmp-mparam.h> | |
48896b9d | 29 | #include <gmp.h> |
003c9895 | 30 | #include <ieee754.h> |
8f2ece69 UD |
31 | #include <stdlib/gmp-impl.h> |
32 | #include <stdlib/longlong.h> | |
33 | #include <stdlib/fpioconst.h> | |
34 | #include <locale/localeinfo.h> | |
933e73fa | 35 | #include <limits.h> |
28f540f4 RM |
36 | #include <math.h> |
37 | #include <printf.h> | |
28f540f4 RM |
38 | #include <string.h> |
39 | #include <unistd.h> | |
40 | #include <stdlib.h> | |
8d8c6efa | 41 | #include <wchar.h> |
784761be JM |
42 | #include <stdbool.h> |
43 | #include <rounding-mode.h> | |
28f540f4 | 44 | |
8a7455e7 UD |
45 | #ifdef COMPILE_WPRINTF |
46 | # define CHAR_T wchar_t | |
47 | #else | |
48 | # define CHAR_T char | |
49 | #endif | |
50 | ||
51 | #include "_i18n_number.h" | |
52 | ||
6973fc01 UD |
53 | #ifndef NDEBUG |
54 | # define NDEBUG /* Undefine this for debugging assertions. */ | |
55 | #endif | |
28f540f4 RM |
56 | #include <assert.h> |
57 | ||
58 | /* This defines make it possible to use the same code for GNU C library and | |
59 | the GNU I/O library. */ | |
8a7455e7 | 60 | #define PUT(f, s, n) _IO_sputn (f, s, n) |
d18ea0c5 | 61 | #define PAD(f, c, n) (wide ? _IO_wpadn (f, c, n) : _IO_padn (f, c, n)) |
28f540f4 RM |
62 | /* We use this file GNU C library and GNU I/O library. So make |
63 | names equal. */ | |
8a7455e7 UD |
64 | #undef putc |
65 | #define putc(c, f) (wide \ | |
66 | ? (int)_IO_putwc_unlocked (c, f) : _IO_putc_unlocked (c, f)) | |
67 | #define size_t _IO_size_t | |
68 | #define FILE _IO_FILE | |
28f540f4 RM |
69 | \f |
70 | /* Macros for doing the actual output. */ | |
71 | ||
72 | #define outchar(ch) \ | |
73 | do \ | |
74 | { \ | |
2e09a79a | 75 | const int outc = (ch); \ |
28f540f4 | 76 | if (putc (outc, fp) == EOF) \ |
c7df983c UD |
77 | { \ |
78 | if (buffer_malloced) \ | |
79 | free (wbuffer); \ | |
80 | return -1; \ | |
81 | } \ | |
28f540f4 RM |
82 | ++done; \ |
83 | } while (0) | |
84 | ||
a1d84548 | 85 | #define PRINT(ptr, wptr, len) \ |
28f540f4 RM |
86 | do \ |
87 | { \ | |
2e09a79a | 88 | size_t outlen = (len); \ |
28f540f4 RM |
89 | if (len > 20) \ |
90 | { \ | |
a1d84548 | 91 | if (PUT (fp, wide ? (const char *) wptr : ptr, outlen) != outlen) \ |
c7df983c UD |
92 | { \ |
93 | if (buffer_malloced) \ | |
94 | free (wbuffer); \ | |
95 | return -1; \ | |
96 | } \ | |
28f540f4 RM |
97 | ptr += outlen; \ |
98 | done += outlen; \ | |
99 | } \ | |
100 | else \ | |
101 | { \ | |
a1d84548 UD |
102 | if (wide) \ |
103 | while (outlen-- > 0) \ | |
104 | outchar (*wptr++); \ | |
105 | else \ | |
106 | while (outlen-- > 0) \ | |
107 | outchar (*ptr++); \ | |
28f540f4 RM |
108 | } \ |
109 | } while (0) | |
110 | ||
111 | #define PADN(ch, len) \ | |
112 | do \ | |
113 | { \ | |
114 | if (PAD (fp, ch, len) != len) \ | |
c7df983c UD |
115 | { \ |
116 | if (buffer_malloced) \ | |
117 | free (wbuffer); \ | |
118 | return -1; \ | |
119 | } \ | |
28f540f4 RM |
120 | done += len; \ |
121 | } \ | |
122 | while (0) | |
123 | \f | |
124 | /* We use the GNU MP library to handle large numbers. | |
125 | ||
126 | An MP variable occupies a varying number of entries in its array. We keep | |
127 | track of this number for efficiency reasons. Otherwise we would always | |
128 | have to process the whole array. */ | |
0e3426bb | 129 | #define MPN_VAR(name) mp_limb_t *name; mp_size_t name##size |
28f540f4 RM |
130 | |
131 | #define MPN_ASSIGN(dst,src) \ | |
0e3426bb | 132 | memcpy (dst, src, (dst##size = src##size) * sizeof (mp_limb_t)) |
28f540f4 RM |
133 | #define MPN_GE(u,v) \ |
134 | (u##size > v##size || (u##size == v##size && __mpn_cmp (u, v, u##size) >= 0)) | |
135 | ||
28f540f4 RM |
136 | extern mp_size_t __mpn_extract_double (mp_ptr res_ptr, mp_size_t size, |
137 | int *expt, int *is_neg, | |
138 | double value); | |
139 | extern mp_size_t __mpn_extract_long_double (mp_ptr res_ptr, mp_size_t size, | |
140 | int *expt, int *is_neg, | |
141 | long double value); | |
142 | ||
28f540f4 | 143 | |
a1d84548 UD |
144 | static wchar_t *group_number (wchar_t *buf, wchar_t *bufend, |
145 | unsigned int intdig_no, const char *grouping, | |
2fa6d086 | 146 | wchar_t thousands_sep, int ngroups); |
28f540f4 | 147 | |
8e257a29 KS |
148 | struct hack_digit_param |
149 | { | |
150 | /* Sign of the exponent. */ | |
151 | int expsign; | |
152 | /* The type of output format that will be used: 'e'/'E' or 'f'. */ | |
153 | int type; | |
154 | /* and the exponent. */ | |
155 | int exponent; | |
156 | /* The fraction of the floting-point value in question */ | |
157 | MPN_VAR(frac); | |
158 | /* Scaling factor. */ | |
159 | MPN_VAR(scale); | |
160 | /* Temporary bignum value. */ | |
161 | MPN_VAR(tmp); | |
162 | }; | |
163 | ||
164 | static wchar_t | |
165 | hack_digit (struct hack_digit_param *p) | |
166 | { | |
167 | mp_limb_t hi; | |
168 | ||
169 | if (p->expsign != 0 && p->type == 'f' && p->exponent-- > 0) | |
170 | hi = 0; | |
171 | else if (p->scalesize == 0) | |
172 | { | |
173 | hi = p->frac[p->fracsize - 1]; | |
174 | p->frac[p->fracsize - 1] = __mpn_mul_1 (p->frac, p->frac, | |
175 | p->fracsize - 1, 10); | |
176 | } | |
177 | else | |
178 | { | |
179 | if (p->fracsize < p->scalesize) | |
180 | hi = 0; | |
181 | else | |
182 | { | |
183 | hi = mpn_divmod (p->tmp, p->frac, p->fracsize, | |
184 | p->scale, p->scalesize); | |
185 | p->tmp[p->fracsize - p->scalesize] = hi; | |
186 | hi = p->tmp[0]; | |
187 | ||
188 | p->fracsize = p->scalesize; | |
189 | while (p->fracsize != 0 && p->frac[p->fracsize - 1] == 0) | |
190 | --p->fracsize; | |
191 | if (p->fracsize == 0) | |
192 | { | |
193 | /* We're not prepared for an mpn variable with zero | |
194 | limbs. */ | |
195 | p->fracsize = 1; | |
196 | return L'0' + hi; | |
197 | } | |
198 | } | |
199 | ||
200 | mp_limb_t _cy = __mpn_mul_1 (p->frac, p->frac, p->fracsize, 10); | |
201 | if (_cy != 0) | |
202 | p->frac[p->fracsize++] = _cy; | |
203 | } | |
204 | ||
205 | return L'0' + hi; | |
206 | } | |
28f540f4 RM |
207 | |
208 | int | |
b1b8f5d8 SL |
209 | __printf_fp_l (FILE *fp, locale_t loc, |
210 | const struct printf_info *info, | |
211 | const void *const *args) | |
28f540f4 RM |
212 | { |
213 | /* The floating-point value to output. */ | |
214 | union | |
215 | { | |
216 | double dbl; | |
8b164787 | 217 | long double ldbl; |
cf2046ec GG |
218 | #if __HAVE_DISTINCT_FLOAT128 |
219 | _Float128 f128; | |
220 | #endif | |
28f540f4 RM |
221 | } |
222 | fpnum; | |
223 | ||
224 | /* Locale-dependent representation of decimal point. */ | |
a1d84548 UD |
225 | const char *decimal; |
226 | wchar_t decimalwc; | |
28f540f4 RM |
227 | |
228 | /* Locale-dependent thousands separator and grouping specification. */ | |
a1d84548 UD |
229 | const char *thousands_sep = NULL; |
230 | wchar_t thousands_sepwc = 0; | |
28f540f4 RM |
231 | const char *grouping; |
232 | ||
233 | /* "NaN" or "Inf" for the special cases. */ | |
0e3426bb | 234 | const char *special = NULL; |
a1d84548 | 235 | const wchar_t *wspecial = NULL; |
28f540f4 | 236 | |
cf2046ec GG |
237 | /* When _Float128 is enabled in the library and ABI-distinct from long |
238 | double, we need mp_limbs enough for any of them. */ | |
239 | #if __HAVE_DISTINCT_FLOAT128 | |
240 | # define GREATER_MANT_DIG FLT128_MANT_DIG | |
241 | #else | |
242 | # define GREATER_MANT_DIG LDBL_MANT_DIG | |
243 | #endif | |
28f540f4 RM |
244 | /* We need just a few limbs for the input before shifting to the right |
245 | position. */ | |
cf2046ec GG |
246 | mp_limb_t fp_input[(GREATER_MANT_DIG + BITS_PER_MP_LIMB - 1) |
247 | / BITS_PER_MP_LIMB]; | |
28f540f4 | 248 | /* We need to shift the contents of fp_input by this amount of bits. */ |
ba1ffaa1 | 249 | int to_shift = 0; |
28f540f4 | 250 | |
8e257a29 | 251 | struct hack_digit_param p; |
28f540f4 RM |
252 | /* Sign of float number. */ |
253 | int is_neg = 0; | |
254 | ||
28f540f4 RM |
255 | /* Counter for number of written characters. */ |
256 | int done = 0; | |
257 | ||
258 | /* General helper (carry limb). */ | |
0e3426bb | 259 | mp_limb_t cy; |
28f540f4 | 260 | |
d64b6ad0 UD |
261 | /* Nonzero if this is output on a wide character stream. */ |
262 | int wide = info->wide; | |
263 | ||
c7df983c UD |
264 | /* Buffer in which we produce the output. */ |
265 | wchar_t *wbuffer = NULL; | |
266 | /* Flag whether wbuffer is malloc'ed or not. */ | |
267 | int buffer_malloced = 0; | |
268 | ||
8e257a29 | 269 | p.expsign = 0; |
28f540f4 RM |
270 | |
271 | /* Figure out the decimal point character. */ | |
b8fe19fa RM |
272 | if (info->extra == 0) |
273 | { | |
985fc132 FW |
274 | decimal = _nl_lookup (loc, LC_NUMERIC, DECIMAL_POINT); |
275 | decimalwc = _nl_lookup_word | |
276 | (loc, LC_NUMERIC, _NL_NUMERIC_DECIMAL_POINT_WC); | |
b8fe19fa RM |
277 | } |
278 | else | |
279 | { | |
985fc132 | 280 | decimal = _nl_lookup (loc, LC_MONETARY, MON_DECIMAL_POINT); |
d8337213 | 281 | if (*decimal == '\0') |
985fc132 FW |
282 | decimal = _nl_lookup (loc, LC_NUMERIC, DECIMAL_POINT); |
283 | decimalwc = _nl_lookup_word (loc, LC_MONETARY, | |
a1d84548 | 284 | _NL_MONETARY_DECIMAL_POINT_WC); |
d8337213 | 285 | if (decimalwc == L'\0') |
985fc132 | 286 | decimalwc = _nl_lookup_word (loc, LC_NUMERIC, |
d8337213 | 287 | _NL_NUMERIC_DECIMAL_POINT_WC); |
b8fe19fa | 288 | } |
a1d84548 | 289 | /* The decimal point character must not be zero. */ |
d8337213 UD |
290 | assert (*decimal != '\0'); |
291 | assert (decimalwc != L'\0'); | |
28f540f4 RM |
292 | |
293 | if (info->group) | |
294 | { | |
b8fe19fa | 295 | if (info->extra == 0) |
985fc132 | 296 | grouping = _nl_lookup (loc, LC_NUMERIC, GROUPING); |
b8fe19fa | 297 | else |
985fc132 | 298 | grouping = _nl_lookup (loc, LC_MONETARY, MON_GROUPING); |
14bab8de | 299 | |
28f540f4 RM |
300 | if (*grouping <= 0 || *grouping == CHAR_MAX) |
301 | grouping = NULL; | |
302 | else | |
303 | { | |
6d52618b | 304 | /* Figure out the thousands separator character. */ |
a1d84548 | 305 | if (wide) |
b8fe19fa | 306 | { |
a1d84548 | 307 | if (info->extra == 0) |
985fc132 FW |
308 | thousands_sepwc = _nl_lookup_word |
309 | (loc, LC_NUMERIC, _NL_NUMERIC_THOUSANDS_SEP_WC); | |
a1d84548 UD |
310 | else |
311 | thousands_sepwc = | |
985fc132 | 312 | _nl_lookup_word (loc, LC_MONETARY, |
a1d84548 | 313 | _NL_MONETARY_THOUSANDS_SEP_WC); |
b8fe19fa RM |
314 | } |
315 | else | |
316 | { | |
a1d84548 | 317 | if (info->extra == 0) |
985fc132 | 318 | thousands_sep = _nl_lookup (loc, LC_NUMERIC, THOUSANDS_SEP); |
a1d84548 | 319 | else |
985fc132 FW |
320 | thousands_sep = _nl_lookup |
321 | (loc, LC_MONETARY, MON_THOUSANDS_SEP); | |
b8fe19fa | 322 | } |
14bab8de | 323 | |
a1d84548 UD |
324 | if ((wide && thousands_sepwc == L'\0') |
325 | || (! wide && *thousands_sep == '\0')) | |
28f540f4 | 326 | grouping = NULL; |
a1d84548 UD |
327 | else if (thousands_sepwc == L'\0') |
328 | /* If we are printing multibyte characters and there is a | |
329 | multibyte representation for the thousands separator, | |
330 | we must ensure the wide character thousands separator | |
331 | is available, even if it is fake. */ | |
332 | thousands_sepwc = 0xfffffffe; | |
28f540f4 RM |
333 | } |
334 | } | |
335 | else | |
336 | grouping = NULL; | |
337 | ||
aab0f374 GG |
338 | #define PRINTF_FP_FETCH(FLOAT, VAR, SUFFIX, MANT_DIG) \ |
339 | { \ | |
340 | (VAR) = *(const FLOAT *) args[0]; \ | |
341 | \ | |
342 | /* Check for special values: not a number or infinity. */ \ | |
343 | if (isnan (VAR)) \ | |
344 | { \ | |
345 | is_neg = signbit (VAR); \ | |
346 | if (isupper (info->spec)) \ | |
347 | { \ | |
348 | special = "NAN"; \ | |
349 | wspecial = L"NAN"; \ | |
350 | } \ | |
351 | else \ | |
352 | { \ | |
353 | special = "nan"; \ | |
354 | wspecial = L"nan"; \ | |
355 | } \ | |
356 | } \ | |
357 | else if (isinf (VAR)) \ | |
358 | { \ | |
359 | is_neg = signbit (VAR); \ | |
360 | if (isupper (info->spec)) \ | |
361 | { \ | |
362 | special = "INF"; \ | |
363 | wspecial = L"INF"; \ | |
364 | } \ | |
365 | else \ | |
366 | { \ | |
367 | special = "inf"; \ | |
368 | wspecial = L"inf"; \ | |
369 | } \ | |
370 | } \ | |
371 | else \ | |
372 | { \ | |
373 | p.fracsize = __mpn_extract_##SUFFIX \ | |
374 | (fp_input, \ | |
375 | (sizeof (fp_input) / sizeof (fp_input[0])), \ | |
376 | &p.exponent, &is_neg, VAR); \ | |
377 | to_shift = 1 + p.fracsize * BITS_PER_MP_LIMB - MANT_DIG; \ | |
378 | } \ | |
379 | } | |
380 | ||
28f540f4 | 381 | /* Fetch the argument value. */ |
cf2046ec GG |
382 | #if __HAVE_DISTINCT_FLOAT128 |
383 | if (info->is_binary128) | |
384 | PRINTF_FP_FETCH (_Float128, fpnum.f128, float128, FLT128_MANT_DIG) | |
385 | else | |
386 | #endif | |
f98b4bbd | 387 | #ifndef __NO_LONG_DOUBLE_MATH |
28f540f4 | 388 | if (info->is_long_double && sizeof (long double) > sizeof (double)) |
aab0f374 | 389 | PRINTF_FP_FETCH (long double, fpnum.ldbl, long_double, LDBL_MANT_DIG) |
28f540f4 | 390 | else |
aab0f374 GG |
391 | #endif |
392 | PRINTF_FP_FETCH (double, fpnum.dbl, double, DBL_MANT_DIG) | |
28f540f4 | 393 | |
aab0f374 | 394 | #undef PRINTF_FP_FETCH |
28f540f4 RM |
395 | |
396 | if (special) | |
397 | { | |
1f205a47 | 398 | int width = info->width; |
28f540f4 RM |
399 | |
400 | if (is_neg || info->showsign || info->space) | |
401 | --width; | |
402 | width -= 3; | |
403 | ||
404 | if (!info->left && width > 0) | |
405 | PADN (' ', width); | |
406 | ||
407 | if (is_neg) | |
408 | outchar ('-'); | |
409 | else if (info->showsign) | |
410 | outchar ('+'); | |
411 | else if (info->space) | |
412 | outchar (' '); | |
413 | ||
a1d84548 | 414 | PRINT (special, wspecial, 3); |
28f540f4 RM |
415 | |
416 | if (info->left && width > 0) | |
417 | PADN (' ', width); | |
418 | ||
419 | return done; | |
420 | } | |
421 | ||
422 | ||
8e257a29 | 423 | /* We need three multiprecision variables. Now that we have the p.exponent |
28f540f4 RM |
424 | of the number we can allocate the needed memory. It would be more |
425 | efficient to use variables of the fixed maximum size but because this | |
426 | would be really big it could lead to memory problems. */ | |
427 | { | |
0e9be4db | 428 | mp_size_t bignum_size = ((abs (p.exponent) + BITS_PER_MP_LIMB - 1) |
9ce0ecbe | 429 | / BITS_PER_MP_LIMB |
cf2046ec GG |
430 | + (GREATER_MANT_DIG / BITS_PER_MP_LIMB > 2 |
431 | ? 8 : 4)) | |
9ce0ecbe | 432 | * sizeof (mp_limb_t); |
8e257a29 KS |
433 | p.frac = (mp_limb_t *) alloca (bignum_size); |
434 | p.tmp = (mp_limb_t *) alloca (bignum_size); | |
435 | p.scale = (mp_limb_t *) alloca (bignum_size); | |
28f540f4 RM |
436 | } |
437 | ||
438 | /* We now have to distinguish between numbers with positive and negative | |
439 | exponents because the method used for the one is not applicable/efficient | |
440 | for the other. */ | |
8e257a29 KS |
441 | p.scalesize = 0; |
442 | if (p.exponent > 2) | |
28f540f4 | 443 | { |
77a58cad | 444 | /* |FP| >= 8.0. */ |
28f540f4 | 445 | int scaleexpo = 0; |
cf2046ec GG |
446 | int explog; |
447 | #if __HAVE_DISTINCT_FLOAT128 | |
448 | if (info->is_binary128) | |
449 | explog = FLT128_MAX_10_EXP_LOG; | |
450 | else | |
451 | explog = LDBL_MAX_10_EXP_LOG; | |
452 | #else | |
453 | explog = LDBL_MAX_10_EXP_LOG; | |
454 | #endif | |
28f540f4 | 455 | int exp10 = 0; |
c4563d2d | 456 | const struct mp_power *powers = &_fpioconst_pow10[explog + 1]; |
28f540f4 RM |
457 | int cnt_h, cnt_l, i; |
458 | ||
8e257a29 | 459 | if ((p.exponent + to_shift) % BITS_PER_MP_LIMB == 0) |
28f540f4 | 460 | { |
8e257a29 KS |
461 | MPN_COPY_DECR (p.frac + (p.exponent + to_shift) / BITS_PER_MP_LIMB, |
462 | fp_input, p.fracsize); | |
463 | p.fracsize += (p.exponent + to_shift) / BITS_PER_MP_LIMB; | |
28f540f4 RM |
464 | } |
465 | else | |
466 | { | |
8e257a29 KS |
467 | cy = __mpn_lshift (p.frac + |
468 | (p.exponent + to_shift) / BITS_PER_MP_LIMB, | |
469 | fp_input, p.fracsize, | |
470 | (p.exponent + to_shift) % BITS_PER_MP_LIMB); | |
471 | p.fracsize += (p.exponent + to_shift) / BITS_PER_MP_LIMB; | |
28f540f4 | 472 | if (cy) |
8e257a29 | 473 | p.frac[p.fracsize++] = cy; |
28f540f4 | 474 | } |
8e257a29 | 475 | MPN_ZERO (p.frac, (p.exponent + to_shift) / BITS_PER_MP_LIMB); |
28f540f4 | 476 | |
c4563d2d | 477 | assert (powers > &_fpioconst_pow10[0]); |
28f540f4 RM |
478 | do |
479 | { | |
c4563d2d | 480 | --powers; |
28f540f4 RM |
481 | |
482 | /* The number of the product of two binary numbers with n and m | |
483 | bits respectively has m+n or m+n-1 bits. */ | |
8e257a29 | 484 | if (p.exponent >= scaleexpo + powers->p_expo - 1) |
28f540f4 | 485 | { |
8e257a29 | 486 | if (p.scalesize == 0) |
c4563d2d | 487 | { |
cf2046ec GG |
488 | #if __HAVE_DISTINCT_FLOAT128 |
489 | if ((FLT128_MANT_DIG | |
490 | > _FPIO_CONST_OFFSET * BITS_PER_MP_LIMB) | |
491 | && info->is_binary128) | |
492 | { | |
493 | #define _FLT128_FPIO_CONST_SHIFT \ | |
494 | (((FLT128_MANT_DIG + BITS_PER_MP_LIMB - 1) / BITS_PER_MP_LIMB) \ | |
495 | - _FPIO_CONST_OFFSET) | |
496 | /* 64bit const offset is not enough for | |
497 | IEEE 854 quad long double (_Float128). */ | |
498 | p.tmpsize = powers->arraysize + _FLT128_FPIO_CONST_SHIFT; | |
499 | memcpy (p.tmp + _FLT128_FPIO_CONST_SHIFT, | |
500 | &__tens[powers->arrayoff], | |
501 | p.tmpsize * sizeof (mp_limb_t)); | |
502 | MPN_ZERO (p.tmp, _FLT128_FPIO_CONST_SHIFT); | |
503 | /* Adjust p.exponent, as scaleexpo will be this much | |
504 | bigger too. */ | |
505 | p.exponent += _FLT128_FPIO_CONST_SHIFT * BITS_PER_MP_LIMB; | |
506 | } | |
507 | else | |
508 | #endif /* __HAVE_DISTINCT_FLOAT128 */ | |
abfbdde1 UD |
509 | #ifndef __NO_LONG_DOUBLE_MATH |
510 | if (LDBL_MANT_DIG > _FPIO_CONST_OFFSET * BITS_PER_MP_LIMB | |
511 | && info->is_long_double) | |
512 | { | |
513 | #define _FPIO_CONST_SHIFT \ | |
514 | (((LDBL_MANT_DIG + BITS_PER_MP_LIMB - 1) / BITS_PER_MP_LIMB) \ | |
515 | - _FPIO_CONST_OFFSET) | |
516 | /* 64bit const offset is not enough for | |
517 | IEEE quad long double. */ | |
8e257a29 KS |
518 | p.tmpsize = powers->arraysize + _FPIO_CONST_SHIFT; |
519 | memcpy (p.tmp + _FPIO_CONST_SHIFT, | |
abfbdde1 | 520 | &__tens[powers->arrayoff], |
8e257a29 KS |
521 | p.tmpsize * sizeof (mp_limb_t)); |
522 | MPN_ZERO (p.tmp, _FPIO_CONST_SHIFT); | |
523 | /* Adjust p.exponent, as scaleexpo will be this much | |
52e1b618 | 524 | bigger too. */ |
8e257a29 | 525 | p.exponent += _FPIO_CONST_SHIFT * BITS_PER_MP_LIMB; |
abfbdde1 UD |
526 | } |
527 | else | |
528 | #endif | |
529 | { | |
8e257a29 KS |
530 | p.tmpsize = powers->arraysize; |
531 | memcpy (p.tmp, &__tens[powers->arrayoff], | |
532 | p.tmpsize * sizeof (mp_limb_t)); | |
abfbdde1 | 533 | } |
c4563d2d | 534 | } |
28f540f4 RM |
535 | else |
536 | { | |
8e257a29 | 537 | cy = __mpn_mul (p.tmp, p.scale, p.scalesize, |
c4563d2d UD |
538 | &__tens[powers->arrayoff |
539 | + _FPIO_CONST_OFFSET], | |
540 | powers->arraysize - _FPIO_CONST_OFFSET); | |
8e257a29 KS |
541 | p.tmpsize = p.scalesize + |
542 | powers->arraysize - _FPIO_CONST_OFFSET; | |
28f540f4 | 543 | if (cy == 0) |
8e257a29 | 544 | --p.tmpsize; |
28f540f4 RM |
545 | } |
546 | ||
8e257a29 | 547 | if (MPN_GE (p.frac, p.tmp)) |
28f540f4 RM |
548 | { |
549 | int cnt; | |
8e257a29 KS |
550 | MPN_ASSIGN (p.scale, p.tmp); |
551 | count_leading_zeros (cnt, p.scale[p.scalesize - 1]); | |
552 | scaleexpo = (p.scalesize - 2) * BITS_PER_MP_LIMB - cnt - 1; | |
28f540f4 RM |
553 | exp10 |= 1 << explog; |
554 | } | |
555 | } | |
556 | --explog; | |
557 | } | |
c4563d2d | 558 | while (powers > &_fpioconst_pow10[0]); |
8e257a29 | 559 | p.exponent = exp10; |
28f540f4 RM |
560 | |
561 | /* Optimize number representations. We want to represent the numbers | |
562 | with the lowest number of bytes possible without losing any | |
563 | bytes. Also the highest bit in the scaling factor has to be set | |
564 | (this is a requirement of the MPN division routines). */ | |
8e257a29 | 565 | if (p.scalesize > 0) |
28f540f4 RM |
566 | { |
567 | /* Determine minimum number of zero bits at the end of | |
568 | both numbers. */ | |
8e257a29 | 569 | for (i = 0; p.scale[i] == 0 && p.frac[i] == 0; i++) |
28f540f4 RM |
570 | ; |
571 | ||
572 | /* Determine number of bits the scaling factor is misplaced. */ | |
8e257a29 | 573 | count_leading_zeros (cnt_h, p.scale[p.scalesize - 1]); |
28f540f4 RM |
574 | |
575 | if (cnt_h == 0) | |
576 | { | |
577 | /* The highest bit of the scaling factor is already set. So | |
578 | we only have to remove the trailing empty limbs. */ | |
579 | if (i > 0) | |
580 | { | |
8e257a29 KS |
581 | MPN_COPY_INCR (p.scale, p.scale + i, p.scalesize - i); |
582 | p.scalesize -= i; | |
583 | MPN_COPY_INCR (p.frac, p.frac + i, p.fracsize - i); | |
584 | p.fracsize -= i; | |
28f540f4 RM |
585 | } |
586 | } | |
587 | else | |
588 | { | |
8e257a29 | 589 | if (p.scale[i] != 0) |
28f540f4 | 590 | { |
8e257a29 KS |
591 | count_trailing_zeros (cnt_l, p.scale[i]); |
592 | if (p.frac[i] != 0) | |
28f540f4 RM |
593 | { |
594 | int cnt_l2; | |
8e257a29 | 595 | count_trailing_zeros (cnt_l2, p.frac[i]); |
28f540f4 RM |
596 | if (cnt_l2 < cnt_l) |
597 | cnt_l = cnt_l2; | |
598 | } | |
599 | } | |
600 | else | |
8e257a29 | 601 | count_trailing_zeros (cnt_l, p.frac[i]); |
28f540f4 RM |
602 | |
603 | /* Now shift the numbers to their optimal position. */ | |
604 | if (i == 0 && BITS_PER_MP_LIMB - cnt_h > cnt_l) | |
605 | { | |
606 | /* We cannot save any memory. So just roll both numbers | |
607 | so that the scaling factor has its highest bit set. */ | |
608 | ||
8e257a29 KS |
609 | (void) __mpn_lshift (p.scale, p.scale, p.scalesize, cnt_h); |
610 | cy = __mpn_lshift (p.frac, p.frac, p.fracsize, cnt_h); | |
28f540f4 | 611 | if (cy != 0) |
8e257a29 | 612 | p.frac[p.fracsize++] = cy; |
28f540f4 RM |
613 | } |
614 | else if (BITS_PER_MP_LIMB - cnt_h <= cnt_l) | |
615 | { | |
616 | /* We can save memory by removing the trailing zero limbs | |
617 | and by packing the non-zero limbs which gain another | |
618 | free one. */ | |
619 | ||
8e257a29 | 620 | (void) __mpn_rshift (p.scale, p.scale + i, p.scalesize - i, |
28f540f4 | 621 | BITS_PER_MP_LIMB - cnt_h); |
8e257a29 KS |
622 | p.scalesize -= i + 1; |
623 | (void) __mpn_rshift (p.frac, p.frac + i, p.fracsize - i, | |
28f540f4 | 624 | BITS_PER_MP_LIMB - cnt_h); |
8e257a29 | 625 | p.fracsize -= p.frac[p.fracsize - i - 1] == 0 ? i + 1 : i; |
28f540f4 RM |
626 | } |
627 | else | |
628 | { | |
629 | /* We can only save the memory of the limbs which are zero. | |
630 | The non-zero parts occupy the same number of limbs. */ | |
631 | ||
8e257a29 KS |
632 | (void) __mpn_rshift (p.scale, p.scale + (i - 1), |
633 | p.scalesize - (i - 1), | |
28f540f4 | 634 | BITS_PER_MP_LIMB - cnt_h); |
8e257a29 KS |
635 | p.scalesize -= i; |
636 | (void) __mpn_rshift (p.frac, p.frac + (i - 1), | |
637 | p.fracsize - (i - 1), | |
28f540f4 | 638 | BITS_PER_MP_LIMB - cnt_h); |
8e257a29 KS |
639 | p.fracsize -= |
640 | p.frac[p.fracsize - (i - 1) - 1] == 0 ? i : i - 1; | |
28f540f4 RM |
641 | } |
642 | } | |
643 | } | |
644 | } | |
8e257a29 | 645 | else if (p.exponent < 0) |
28f540f4 RM |
646 | { |
647 | /* |FP| < 1.0. */ | |
648 | int exp10 = 0; | |
cf2046ec GG |
649 | int explog; |
650 | #if __HAVE_DISTINCT_FLOAT128 | |
651 | if (info->is_binary128) | |
652 | explog = FLT128_MAX_10_EXP_LOG; | |
653 | else | |
654 | explog = LDBL_MAX_10_EXP_LOG; | |
655 | #else | |
656 | explog = LDBL_MAX_10_EXP_LOG; | |
657 | #endif | |
c4563d2d | 658 | const struct mp_power *powers = &_fpioconst_pow10[explog + 1]; |
28f540f4 RM |
659 | |
660 | /* Now shift the input value to its right place. */ | |
8e257a29 KS |
661 | cy = __mpn_lshift (p.frac, fp_input, p.fracsize, to_shift); |
662 | p.frac[p.fracsize++] = cy; | |
663 | assert (cy == 1 || (p.frac[p.fracsize - 2] == 0 && p.frac[0] == 0)); | |
28f540f4 | 664 | |
8e257a29 KS |
665 | p.expsign = 1; |
666 | p.exponent = -p.exponent; | |
28f540f4 | 667 | |
c4563d2d | 668 | assert (powers != &_fpioconst_pow10[0]); |
28f540f4 RM |
669 | do |
670 | { | |
c4563d2d | 671 | --powers; |
28f540f4 | 672 | |
8e257a29 | 673 | if (p.exponent >= powers->m_expo) |
28f540f4 RM |
674 | { |
675 | int i, incr, cnt_h, cnt_l; | |
0e3426bb | 676 | mp_limb_t topval[2]; |
28f540f4 RM |
677 | |
678 | /* The __mpn_mul function expects the first argument to be | |
679 | bigger than the second. */ | |
8e257a29 KS |
680 | if (p.fracsize < powers->arraysize - _FPIO_CONST_OFFSET) |
681 | cy = __mpn_mul (p.tmp, &__tens[powers->arrayoff | |
c4563d2d UD |
682 | + _FPIO_CONST_OFFSET], |
683 | powers->arraysize - _FPIO_CONST_OFFSET, | |
8e257a29 | 684 | p.frac, p.fracsize); |
28f540f4 | 685 | else |
8e257a29 | 686 | cy = __mpn_mul (p.tmp, p.frac, p.fracsize, |
c4563d2d UD |
687 | &__tens[powers->arrayoff + _FPIO_CONST_OFFSET], |
688 | powers->arraysize - _FPIO_CONST_OFFSET); | |
8e257a29 | 689 | p.tmpsize = p.fracsize + powers->arraysize - _FPIO_CONST_OFFSET; |
28f540f4 | 690 | if (cy == 0) |
8e257a29 | 691 | --p.tmpsize; |
28f540f4 | 692 | |
8e257a29 KS |
693 | count_leading_zeros (cnt_h, p.tmp[p.tmpsize - 1]); |
694 | incr = (p.tmpsize - p.fracsize) * BITS_PER_MP_LIMB | |
28f540f4 RM |
695 | + BITS_PER_MP_LIMB - 1 - cnt_h; |
696 | ||
c4563d2d | 697 | assert (incr <= powers->p_expo); |
28f540f4 | 698 | |
8e257a29 | 699 | /* If we increased the p.exponent by exactly 3 we have to test |
28f540f4 RM |
700 | for overflow. This is done by comparing with 10 shifted |
701 | to the right position. */ | |
8e257a29 | 702 | if (incr == p.exponent + 3) |
6e4c40ba UD |
703 | { |
704 | if (cnt_h <= BITS_PER_MP_LIMB - 4) | |
705 | { | |
706 | topval[0] = 0; | |
707 | topval[1] | |
708 | = ((mp_limb_t) 10) << (BITS_PER_MP_LIMB - 4 - cnt_h); | |
709 | } | |
710 | else | |
711 | { | |
712 | topval[0] = ((mp_limb_t) 10) << (BITS_PER_MP_LIMB - 4); | |
713 | topval[1] = 0; | |
714 | (void) __mpn_lshift (topval, topval, 2, | |
715 | BITS_PER_MP_LIMB - cnt_h); | |
716 | } | |
717 | } | |
28f540f4 RM |
718 | |
719 | /* We have to be careful when multiplying the last factor. | |
720 | If the result is greater than 1.0 be have to test it | |
721 | against 10.0. If it is greater or equal to 10.0 the | |
722 | multiplication was not valid. This is because we cannot | |
723 | determine the number of bits in the result in advance. */ | |
8e257a29 KS |
724 | if (incr < p.exponent + 3 |
725 | || (incr == p.exponent + 3 && | |
726 | (p.tmp[p.tmpsize - 1] < topval[1] | |
727 | || (p.tmp[p.tmpsize - 1] == topval[1] | |
728 | && p.tmp[p.tmpsize - 2] < topval[0])))) | |
28f540f4 RM |
729 | { |
730 | /* The factor is right. Adapt binary and decimal | |
96aa2d94 | 731 | exponents. */ |
8e257a29 | 732 | p.exponent -= incr; |
28f540f4 RM |
733 | exp10 |= 1 << explog; |
734 | ||
735 | /* If this factor yields a number greater or equal to | |
736 | 1.0, we must not shift the non-fractional digits down. */ | |
8e257a29 KS |
737 | if (p.exponent < 0) |
738 | cnt_h += -p.exponent; | |
28f540f4 RM |
739 | |
740 | /* Now we optimize the number representation. */ | |
8e257a29 | 741 | for (i = 0; p.tmp[i] == 0; ++i); |
28f540f4 RM |
742 | if (cnt_h == BITS_PER_MP_LIMB - 1) |
743 | { | |
8e257a29 KS |
744 | MPN_COPY (p.frac, p.tmp + i, p.tmpsize - i); |
745 | p.fracsize = p.tmpsize - i; | |
28f540f4 RM |
746 | } |
747 | else | |
748 | { | |
8e257a29 | 749 | count_trailing_zeros (cnt_l, p.tmp[i]); |
28f540f4 RM |
750 | |
751 | /* Now shift the numbers to their optimal position. */ | |
752 | if (i == 0 && BITS_PER_MP_LIMB - 1 - cnt_h > cnt_l) | |
753 | { | |
754 | /* We cannot save any memory. Just roll the | |
755 | number so that the leading digit is in a | |
6d52618b | 756 | separate limb. */ |
28f540f4 | 757 | |
8e257a29 KS |
758 | cy = __mpn_lshift (p.frac, p.tmp, p.tmpsize, |
759 | cnt_h + 1); | |
760 | p.fracsize = p.tmpsize + 1; | |
761 | p.frac[p.fracsize - 1] = cy; | |
28f540f4 RM |
762 | } |
763 | else if (BITS_PER_MP_LIMB - 1 - cnt_h <= cnt_l) | |
764 | { | |
8e257a29 | 765 | (void) __mpn_rshift (p.frac, p.tmp + i, p.tmpsize - i, |
28f540f4 | 766 | BITS_PER_MP_LIMB - 1 - cnt_h); |
8e257a29 | 767 | p.fracsize = p.tmpsize - i; |
28f540f4 RM |
768 | } |
769 | else | |
770 | { | |
771 | /* We can only save the memory of the limbs which | |
772 | are zero. The non-zero parts occupy the same | |
773 | number of limbs. */ | |
774 | ||
8e257a29 KS |
775 | (void) __mpn_rshift (p.frac, p.tmp + (i - 1), |
776 | p.tmpsize - (i - 1), | |
28f540f4 | 777 | BITS_PER_MP_LIMB - 1 - cnt_h); |
8e257a29 | 778 | p.fracsize = p.tmpsize - (i - 1); |
28f540f4 RM |
779 | } |
780 | } | |
28f540f4 RM |
781 | } |
782 | } | |
783 | --explog; | |
784 | } | |
8e257a29 | 785 | while (powers != &_fpioconst_pow10[1] && p.exponent > 0); |
28f540f4 | 786 | /* All factors but 10^-1 are tested now. */ |
8e257a29 | 787 | if (p.exponent > 0) |
28f540f4 | 788 | { |
19bc17a9 RM |
789 | int cnt_l; |
790 | ||
8e257a29 KS |
791 | cy = __mpn_mul_1 (p.tmp, p.frac, p.fracsize, 10); |
792 | p.tmpsize = p.fracsize; | |
793 | assert (cy == 0 || p.tmp[p.tmpsize - 1] < 20); | |
28f540f4 | 794 | |
8e257a29 KS |
795 | count_trailing_zeros (cnt_l, p.tmp[0]); |
796 | if (cnt_l < MIN (4, p.exponent)) | |
19bc17a9 | 797 | { |
8e257a29 KS |
798 | cy = __mpn_lshift (p.frac, p.tmp, p.tmpsize, |
799 | BITS_PER_MP_LIMB - MIN (4, p.exponent)); | |
19bc17a9 | 800 | if (cy != 0) |
8e257a29 | 801 | p.frac[p.tmpsize++] = cy; |
19bc17a9 RM |
802 | } |
803 | else | |
8e257a29 KS |
804 | (void) __mpn_rshift (p.frac, p.tmp, p.tmpsize, MIN (4, p.exponent)); |
805 | p.fracsize = p.tmpsize; | |
28f540f4 | 806 | exp10 |= 1; |
8e257a29 | 807 | assert (p.frac[p.fracsize - 1] < 10); |
28f540f4 | 808 | } |
8e257a29 | 809 | p.exponent = exp10; |
28f540f4 RM |
810 | } |
811 | else | |
812 | { | |
813 | /* This is a special case. We don't need a factor because the | |
b866373d | 814 | numbers are in the range of 1.0 <= |fp| < 8.0. We simply |
28f540f4 RM |
815 | shift it to the right place and divide it by 1.0 to get the |
816 | leading digit. (Of course this division is not really made.) */ | |
8e257a29 KS |
817 | assert (0 <= p.exponent && p.exponent < 3 && |
818 | p.exponent + to_shift < BITS_PER_MP_LIMB); | |
28f540f4 RM |
819 | |
820 | /* Now shift the input value to its right place. */ | |
8e257a29 KS |
821 | cy = __mpn_lshift (p.frac, fp_input, p.fracsize, (p.exponent + to_shift)); |
822 | p.frac[p.fracsize++] = cy; | |
823 | p.exponent = 0; | |
28f540f4 RM |
824 | } |
825 | ||
826 | { | |
827 | int width = info->width; | |
c7df983c | 828 | wchar_t *wstartp, *wcp; |
9ca230d6 | 829 | size_t chars_needed; |
28f540f4 RM |
830 | int expscale; |
831 | int intdig_max, intdig_no = 0; | |
4c02bf1a UD |
832 | int fracdig_min; |
833 | int fracdig_max; | |
28f540f4 RM |
834 | int dig_max; |
835 | int significant; | |
a1d84548 | 836 | int ngroups = 0; |
4c02bf1a | 837 | char spec = _tolower (info->spec); |
28f540f4 | 838 | |
4c02bf1a | 839 | if (spec == 'e') |
28f540f4 | 840 | { |
8e257a29 | 841 | p.type = info->spec; |
28f540f4 RM |
842 | intdig_max = 1; |
843 | fracdig_min = fracdig_max = info->prec < 0 ? 6 : info->prec; | |
9ca230d6 | 844 | chars_needed = 1 + 1 + (size_t) fracdig_max + 1 + 1 + 4; |
28f540f4 RM |
845 | /* d . ddd e +- ddd */ |
846 | dig_max = INT_MAX; /* Unlimited. */ | |
847 | significant = 1; /* Does not matter here. */ | |
848 | } | |
4c02bf1a | 849 | else if (spec == 'f') |
28f540f4 | 850 | { |
8e257a29 | 851 | p.type = 'f'; |
28f540f4 | 852 | fracdig_min = fracdig_max = info->prec < 0 ? 6 : info->prec; |
a3022b82 UD |
853 | dig_max = INT_MAX; /* Unlimited. */ |
854 | significant = 1; /* Does not matter here. */ | |
8e257a29 | 855 | if (p.expsign == 0) |
28f540f4 | 856 | { |
8e257a29 | 857 | intdig_max = p.exponent + 1; |
28f540f4 | 858 | /* This can be really big! */ /* XXX Maybe malloc if too big? */ |
8e257a29 | 859 | chars_needed = (size_t) p.exponent + 1 + 1 + (size_t) fracdig_max; |
28f540f4 RM |
860 | } |
861 | else | |
862 | { | |
863 | intdig_max = 1; | |
9ca230d6 | 864 | chars_needed = 1 + 1 + (size_t) fracdig_max; |
28f540f4 | 865 | } |
28f540f4 RM |
866 | } |
867 | else | |
868 | { | |
869 | dig_max = info->prec < 0 ? 6 : (info->prec == 0 ? 1 : info->prec); | |
8e257a29 KS |
870 | if ((p.expsign == 0 && p.exponent >= dig_max) |
871 | || (p.expsign != 0 && p.exponent > 4)) | |
28f540f4 | 872 | { |
d64b6ad0 | 873 | if ('g' - 'G' == 'e' - 'E') |
8e257a29 | 874 | p.type = 'E' + (info->spec - 'G'); |
d64b6ad0 | 875 | else |
8e257a29 | 876 | p.type = isupper (info->spec) ? 'E' : 'e'; |
28f540f4 RM |
877 | fracdig_max = dig_max - 1; |
878 | intdig_max = 1; | |
9ca230d6 | 879 | chars_needed = 1 + 1 + (size_t) fracdig_max + 1 + 1 + 4; |
28f540f4 RM |
880 | } |
881 | else | |
882 | { | |
8e257a29 KS |
883 | p.type = 'f'; |
884 | intdig_max = p.expsign == 0 ? p.exponent + 1 : 0; | |
28f540f4 | 885 | fracdig_max = dig_max - intdig_max; |
0f6b172f UD |
886 | /* We need space for the significant digits and perhaps |
887 | for leading zeros when < 1.0. The number of leading | |
888 | zeros can be as many as would be required for | |
889 | exponential notation with a negative two-digit | |
8e257a29 | 890 | p.exponent, which is 4. */ |
9ca230d6 | 891 | chars_needed = (size_t) dig_max + 1 + 4; |
28f540f4 RM |
892 | } |
893 | fracdig_min = info->alt ? fracdig_max : 0; | |
894 | significant = 0; /* We count significant digits. */ | |
895 | } | |
896 | ||
897 | if (grouping) | |
a1d84548 UD |
898 | { |
899 | /* Guess the number of groups we will make, and thus how | |
900 | many spaces we need for separator characters. */ | |
901 | ngroups = __guess_grouping (intdig_max, grouping); | |
f57e41a5 UD |
902 | /* Allocate one more character in case rounding increases the |
903 | number of groups. */ | |
904 | chars_needed += ngroups + 1; | |
a1d84548 | 905 | } |
28f540f4 RM |
906 | |
907 | /* Allocate buffer for output. We need two more because while rounding | |
908 | it is possible that we need two more characters in front of all the | |
b526f8ac UD |
909 | other output. If the amount of memory we have to allocate is too |
910 | large use `malloc' instead of `alloca'. */ | |
199eb0de AS |
911 | if (__builtin_expect (chars_needed >= (size_t) -1 / sizeof (wchar_t) - 2 |
912 | || chars_needed < fracdig_max, 0)) | |
913 | { | |
914 | /* Some overflow occurred. */ | |
915 | __set_errno (ERANGE); | |
916 | return -1; | |
917 | } | |
918 | size_t wbuffer_to_alloc = (2 + chars_needed) * sizeof (wchar_t); | |
919 | buffer_malloced = ! __libc_use_alloca (wbuffer_to_alloc); | |
4c02bf1a | 920 | if (__builtin_expect (buffer_malloced, 0)) |
b526f8ac | 921 | { |
9ca230d6 | 922 | wbuffer = (wchar_t *) malloc (wbuffer_to_alloc); |
a1d84548 | 923 | if (wbuffer == NULL) |
b526f8ac UD |
924 | /* Signal an error to the caller. */ |
925 | return -1; | |
926 | } | |
927 | else | |
9ca230d6 | 928 | wbuffer = (wchar_t *) alloca (wbuffer_to_alloc); |
a1d84548 | 929 | wcp = wstartp = wbuffer + 2; /* Let room for rounding. */ |
28f540f4 RM |
930 | |
931 | /* Do the real work: put digits in allocated buffer. */ | |
8e257a29 | 932 | if (p.expsign == 0 || p.type != 'f') |
28f540f4 | 933 | { |
8e257a29 | 934 | assert (p.expsign == 0 || intdig_max == 1); |
28f540f4 RM |
935 | while (intdig_no < intdig_max) |
936 | { | |
937 | ++intdig_no; | |
8e257a29 | 938 | *wcp++ = hack_digit (&p); |
28f540f4 RM |
939 | } |
940 | significant = 1; | |
941 | if (info->alt | |
942 | || fracdig_min > 0 | |
8e257a29 | 943 | || (fracdig_max > 0 && (p.fracsize > 1 || p.frac[0] != 0))) |
a1d84548 | 944 | *wcp++ = decimalwc; |
28f540f4 RM |
945 | } |
946 | else | |
947 | { | |
8e257a29 | 948 | /* |fp| < 1.0 and the selected p.type is 'f', so put "0." |
28f540f4 | 949 | in the buffer. */ |
a1d84548 | 950 | *wcp++ = L'0'; |
8e257a29 | 951 | --p.exponent; |
a1d84548 | 952 | *wcp++ = decimalwc; |
28f540f4 RM |
953 | } |
954 | ||
955 | /* Generate the needed number of fractional digits. */ | |
4c02bf1a | 956 | int fracdig_no = 0; |
0f7769f7 UD |
957 | int added_zeros = 0; |
958 | while (fracdig_no < fracdig_min + added_zeros | |
8e257a29 | 959 | || (fracdig_no < fracdig_max && (p.fracsize > 1 || p.frac[0] != 0))) |
28f540f4 RM |
960 | { |
961 | ++fracdig_no; | |
8e257a29 | 962 | *wcp = hack_digit (&p); |
a3022b82 | 963 | if (*wcp++ != L'0') |
28f540f4 RM |
964 | significant = 1; |
965 | else if (significant == 0) | |
966 | { | |
967 | ++fracdig_max; | |
968 | if (fracdig_min > 0) | |
0f7769f7 | 969 | ++added_zeros; |
28f540f4 | 970 | } |
28f540f4 RM |
971 | } |
972 | ||
973 | /* Do rounding. */ | |
784761be | 974 | wchar_t last_digit = wcp[-1] != decimalwc ? wcp[-1] : wcp[-2]; |
8e257a29 | 975 | wchar_t next_digit = hack_digit (&p); |
784761be JM |
976 | bool more_bits; |
977 | if (next_digit != L'0' && next_digit != L'5') | |
978 | more_bits = true; | |
8e257a29 | 979 | else if (p.fracsize == 1 && p.frac[0] == 0) |
784761be JM |
980 | /* Rest of the number is zero. */ |
981 | more_bits = false; | |
8e257a29 | 982 | else if (p.scalesize == 0) |
784761be JM |
983 | { |
984 | /* Here we have to see whether all limbs are zero since no | |
985 | normalization happened. */ | |
8e257a29 KS |
986 | size_t lcnt = p.fracsize; |
987 | while (lcnt >= 1 && p.frac[lcnt - 1] == 0) | |
784761be JM |
988 | --lcnt; |
989 | more_bits = lcnt > 0; | |
990 | } | |
991 | else | |
992 | more_bits = true; | |
993 | int rounding_mode = get_rounding_mode (); | |
994 | if (round_away (is_neg, (last_digit - L'0') & 1, next_digit >= L'5', | |
995 | more_bits, rounding_mode)) | |
28f540f4 | 996 | { |
a1d84548 | 997 | wchar_t *wtp = wcp; |
28f540f4 | 998 | |
28f540f4 RM |
999 | if (fracdig_no > 0) |
1000 | { | |
1001 | /* Process fractional digits. Terminate if not rounded or | |
1002 | radix character is reached. */ | |
0f7769f7 | 1003 | int removed = 0; |
a1d84548 | 1004 | while (*--wtp != decimalwc && *wtp == L'9') |
0f7769f7 UD |
1005 | { |
1006 | *wtp = L'0'; | |
1007 | ++removed; | |
1008 | } | |
1009 | if (removed == fracdig_min && added_zeros > 0) | |
1010 | --added_zeros; | |
a1d84548 | 1011 | if (*wtp != decimalwc) |
28f540f4 | 1012 | /* Round up. */ |
a1d84548 | 1013 | (*wtp)++; |
8e257a29 | 1014 | else if (__builtin_expect (spec == 'g' && p.type == 'f' && info->alt |
8f5e1400 UD |
1015 | && wtp == wstartp + 1 |
1016 | && wstartp[0] == L'0', | |
0f7769f7 UD |
1017 | 0)) |
1018 | /* This is a special case: the rounded number is 1.0, | |
1019 | the format is 'g' or 'G', and the alternative format | |
d40e67f5 | 1020 | is selected. This means the result must be "1.". */ |
0f7769f7 | 1021 | --added_zeros; |
28f540f4 RM |
1022 | } |
1023 | ||
a1d84548 | 1024 | if (fracdig_no == 0 || *wtp == decimalwc) |
28f540f4 RM |
1025 | { |
1026 | /* Round the integer digits. */ | |
a1d84548 UD |
1027 | if (*(wtp - 1) == decimalwc) |
1028 | --wtp; | |
28f540f4 | 1029 | |
a1d84548 UD |
1030 | while (--wtp >= wstartp && *wtp == L'9') |
1031 | *wtp = L'0'; | |
28f540f4 | 1032 | |
a1d84548 | 1033 | if (wtp >= wstartp) |
28f540f4 | 1034 | /* Round up. */ |
a1d84548 | 1035 | (*wtp)++; |
28f540f4 | 1036 | else |
6d52618b | 1037 | /* It is more critical. All digits were 9's. */ |
28f540f4 | 1038 | { |
8e257a29 | 1039 | if (p.type != 'f') |
28f540f4 | 1040 | { |
a1d84548 | 1041 | *wstartp = '1'; |
8e257a29 | 1042 | p.exponent += p.expsign == 0 ? 1 : -1; |
b866373d | 1043 | |
8e257a29 KS |
1044 | /* The above p.exponent adjustment could lead to 1.0e-00, |
1045 | e.g. for 0.999999999. Make sure p.exponent 0 always | |
b866373d | 1046 | uses + sign. */ |
8e257a29 KS |
1047 | if (p.exponent == 0) |
1048 | p.expsign = 0; | |
28f540f4 RM |
1049 | } |
1050 | else if (intdig_no == dig_max) | |
1051 | { | |
8e257a29 | 1052 | /* This is the case where for p.type %g the number fits |
28f540f4 RM |
1053 | really in the range for %f output but after rounding |
1054 | the number of digits is too big. */ | |
a1d84548 UD |
1055 | *--wstartp = decimalwc; |
1056 | *--wstartp = L'1'; | |
28f540f4 RM |
1057 | |
1058 | if (info->alt || fracdig_no > 0) | |
1059 | { | |
1060 | /* Overwrite the old radix character. */ | |
a1d84548 | 1061 | wstartp[intdig_no + 2] = L'0'; |
28f540f4 RM |
1062 | ++fracdig_no; |
1063 | } | |
1064 | ||
1065 | fracdig_no += intdig_no; | |
1066 | intdig_no = 1; | |
1067 | fracdig_max = intdig_max - intdig_no; | |
8e257a29 KS |
1068 | ++p.exponent; |
1069 | /* Now we must print the p.exponent. */ | |
1070 | p.type = isupper (info->spec) ? 'E' : 'e'; | |
28f540f4 RM |
1071 | } |
1072 | else | |
1073 | { | |
1074 | /* We can simply add another another digit before the | |
1075 | radix. */ | |
a1d84548 | 1076 | *--wstartp = L'1'; |
28f540f4 RM |
1077 | ++intdig_no; |
1078 | } | |
1079 | ||
1080 | /* While rounding the number of digits can change. | |
1081 | If the number now exceeds the limits remove some | |
1082 | fractional digits. */ | |
1083 | if (intdig_no + fracdig_no > dig_max) | |
1084 | { | |
a1d84548 | 1085 | wcp -= intdig_no + fracdig_no - dig_max; |
28f540f4 RM |
1086 | fracdig_no -= intdig_no + fracdig_no - dig_max; |
1087 | } | |
1088 | } | |
1089 | } | |
1090 | } | |
1091 | ||
28f540f4 | 1092 | /* Now remove unnecessary '0' at the end of the string. */ |
0f7769f7 | 1093 | while (fracdig_no > fracdig_min + added_zeros && *(wcp - 1) == L'0') |
28f540f4 | 1094 | { |
a1d84548 | 1095 | --wcp; |
28f540f4 RM |
1096 | --fracdig_no; |
1097 | } | |
1098 | /* If we eliminate all fractional digits we perhaps also can remove | |
1099 | the radix character. */ | |
a1d84548 UD |
1100 | if (fracdig_no == 0 && !info->alt && *(wcp - 1) == decimalwc) |
1101 | --wcp; | |
28f540f4 RM |
1102 | |
1103 | if (grouping) | |
f57e41a5 UD |
1104 | { |
1105 | /* Rounding might have changed the number of groups. We allocated | |
1106 | enough memory but we need here the correct number of groups. */ | |
1107 | if (intdig_no != intdig_max) | |
1108 | ngroups = __guess_grouping (intdig_no, grouping); | |
1109 | ||
1110 | /* Add in separator characters, overwriting the same buffer. */ | |
1111 | wcp = group_number (wstartp, wcp, intdig_no, grouping, thousands_sepwc, | |
1112 | ngroups); | |
1113 | } | |
28f540f4 | 1114 | |
8e257a29 KS |
1115 | /* Write the p.exponent if it is needed. */ |
1116 | if (p.type != 'f') | |
28f540f4 | 1117 | { |
8e257a29 | 1118 | if (__glibc_unlikely (p.expsign != 0 && p.exponent == 4 && spec == 'g')) |
0f7769f7 | 1119 | { |
8e257a29 | 1120 | /* This is another special case. The p.exponent of the number is |
0f7769f7 | 1121 | really smaller than -4, which requires the 'e'/'E' format. |
8e257a29 | 1122 | But after rounding the number has an p.exponent of -4. */ |
d40e67f5 | 1123 | assert (wcp >= wstartp + 1); |
0f7769f7 UD |
1124 | assert (wstartp[0] == L'1'); |
1125 | __wmemcpy (wstartp, L"0.0001", 6); | |
1126 | wstartp[1] = decimalwc; | |
d40e67f5 UD |
1127 | if (wcp >= wstartp + 2) |
1128 | { | |
01cad84e | 1129 | __wmemset (wstartp + 6, L'0', wcp - (wstartp + 2)); |
d40e67f5 UD |
1130 | wcp += 4; |
1131 | } | |
1132 | else | |
1133 | wcp += 5; | |
0f7769f7 UD |
1134 | } |
1135 | else | |
1136 | { | |
8e257a29 KS |
1137 | *wcp++ = (wchar_t) p.type; |
1138 | *wcp++ = p.expsign ? L'-' : L'+'; | |
28f540f4 | 1139 | |
8e257a29 | 1140 | /* Find the magnitude of the p.exponent. */ |
0f7769f7 | 1141 | expscale = 10; |
8e257a29 | 1142 | while (expscale <= p.exponent) |
0f7769f7 | 1143 | expscale *= 10; |
28f540f4 | 1144 | |
8e257a29 | 1145 | if (p.exponent < 10) |
0f7769f7 UD |
1146 | /* Exponent always has at least two digits. */ |
1147 | *wcp++ = L'0'; | |
1148 | else | |
1149 | do | |
1150 | { | |
1151 | expscale /= 10; | |
8e257a29 KS |
1152 | *wcp++ = L'0' + (p.exponent / expscale); |
1153 | p.exponent %= expscale; | |
0f7769f7 UD |
1154 | } |
1155 | while (expscale > 10); | |
8e257a29 | 1156 | *wcp++ = L'0' + p.exponent; |
0f7769f7 | 1157 | } |
28f540f4 RM |
1158 | } |
1159 | ||
1160 | /* Compute number of characters which must be filled with the padding | |
96aa2d94 | 1161 | character. */ |
28f540f4 RM |
1162 | if (is_neg || info->showsign || info->space) |
1163 | --width; | |
a1d84548 | 1164 | width -= wcp - wstartp; |
28f540f4 RM |
1165 | |
1166 | if (!info->left && info->pad != '0' && width > 0) | |
1167 | PADN (info->pad, width); | |
1168 | ||
1169 | if (is_neg) | |
1170 | outchar ('-'); | |
1171 | else if (info->showsign) | |
1172 | outchar ('+'); | |
1173 | else if (info->space) | |
1174 | outchar (' '); | |
1175 | ||
1176 | if (!info->left && info->pad == '0' && width > 0) | |
1177 | PADN ('0', width); | |
1178 | ||
a1d84548 UD |
1179 | { |
1180 | char *buffer = NULL; | |
3703468e | 1181 | char *buffer_end = NULL; |
a1d84548 | 1182 | char *cp = NULL; |
a5707dad | 1183 | char *tmpptr; |
a1d84548 UD |
1184 | |
1185 | if (! wide) | |
1186 | { | |
1187 | /* Create the single byte string. */ | |
a1d84548 UD |
1188 | size_t decimal_len; |
1189 | size_t thousands_sep_len; | |
1190 | wchar_t *copywc; | |
985fc132 FW |
1191 | size_t factor; |
1192 | if (info->i18n) | |
1193 | factor = _nl_lookup_word (loc, LC_CTYPE, _NL_CTYPE_MB_CUR_MAX); | |
1194 | else | |
1195 | factor = 1; | |
a1d84548 | 1196 | |
a1d84548 UD |
1197 | decimal_len = strlen (decimal); |
1198 | ||
1199 | if (thousands_sep == NULL) | |
1200 | thousands_sep_len = 0; | |
1201 | else | |
1202 | thousands_sep_len = strlen (thousands_sep); | |
1203 | ||
3703468e UD |
1204 | size_t nbuffer = (2 + chars_needed * factor + decimal_len |
1205 | + ngroups * thousands_sep_len); | |
a1ffb40e | 1206 | if (__glibc_unlikely (buffer_malloced)) |
a1d84548 | 1207 | { |
3703468e | 1208 | buffer = (char *) malloc (nbuffer); |
a1d84548 | 1209 | if (buffer == NULL) |
c7df983c UD |
1210 | { |
1211 | /* Signal an error to the caller. */ | |
0f7769f7 | 1212 | free (wbuffer); |
c7df983c UD |
1213 | return -1; |
1214 | } | |
a1d84548 UD |
1215 | } |
1216 | else | |
3703468e UD |
1217 | buffer = (char *) alloca (nbuffer); |
1218 | buffer_end = buffer + nbuffer; | |
a1d84548 UD |
1219 | |
1220 | /* Now copy the wide character string. Since the character | |
1221 | (except for the decimal point and thousands separator) must | |
1222 | be coming from the ASCII range we can esily convert the | |
1223 | string without mapping tables. */ | |
1224 | for (cp = buffer, copywc = wstartp; copywc < wcp; ++copywc) | |
1225 | if (*copywc == decimalwc) | |
1226 | cp = (char *) __mempcpy (cp, decimal, decimal_len); | |
1227 | else if (*copywc == thousands_sepwc) | |
1228 | cp = (char *) __mempcpy (cp, thousands_sep, thousands_sep_len); | |
1229 | else | |
1230 | *cp++ = (char) *copywc; | |
1231 | } | |
1232 | ||
a5707dad | 1233 | tmpptr = buffer; |
a1ffb40e | 1234 | if (__glibc_unlikely (info->i18n)) |
f57e41a5 | 1235 | { |
8a7455e7 | 1236 | #ifdef COMPILE_WPRINTF |
3703468e UD |
1237 | wstartp = _i18n_number_rewrite (wstartp, wcp, |
1238 | wbuffer + wbuffer_to_alloc); | |
1311b164 UD |
1239 | wcp = wbuffer + wbuffer_to_alloc; |
1240 | assert ((uintptr_t) wbuffer <= (uintptr_t) wstartp); | |
1241 | assert ((uintptr_t) wstartp | |
1242 | < (uintptr_t) wbuffer + wbuffer_to_alloc); | |
8a7455e7 | 1243 | #else |
3703468e UD |
1244 | tmpptr = _i18n_number_rewrite (tmpptr, cp, buffer_end); |
1245 | cp = buffer_end; | |
1246 | assert ((uintptr_t) buffer <= (uintptr_t) tmpptr); | |
1247 | assert ((uintptr_t) tmpptr < (uintptr_t) buffer_end); | |
8a7455e7 | 1248 | #endif |
f57e41a5 | 1249 | } |
8a7455e7 | 1250 | |
a5707dad | 1251 | PRINT (tmpptr, wstartp, wide ? wcp - wstartp : cp - tmpptr); |
a1d84548 UD |
1252 | |
1253 | /* Free the memory if necessary. */ | |
a1ffb40e | 1254 | if (__glibc_unlikely (buffer_malloced)) |
a1d84548 UD |
1255 | { |
1256 | free (buffer); | |
1257 | free (wbuffer); | |
1258 | } | |
1259 | } | |
28f540f4 RM |
1260 | |
1261 | if (info->left && width > 0) | |
1262 | PADN (info->pad, width); | |
1263 | } | |
1264 | return done; | |
1265 | } | |
b1b8f5d8 | 1266 | libc_hidden_def (__printf_fp_l) |
985fc132 FW |
1267 | |
1268 | int | |
1269 | ___printf_fp (FILE *fp, const struct printf_info *info, | |
1270 | const void *const *args) | |
1271 | { | |
b1b8f5d8 | 1272 | return __printf_fp_l (fp, _NL_CURRENT_LOCALE, info, args); |
985fc132 | 1273 | } |
c6251f03 RM |
1274 | ldbl_hidden_def (___printf_fp, __printf_fp) |
1275 | ldbl_strong_alias (___printf_fp, __printf_fp) | |
985fc132 | 1276 | |
28f540f4 RM |
1277 | \f |
1278 | /* Return the number of extra grouping characters that will be inserted | |
1279 | into a number with INTDIG_MAX integer digits. */ | |
1280 | ||
b8fe19fa | 1281 | unsigned int |
a1d84548 | 1282 | __guess_grouping (unsigned int intdig_max, const char *grouping) |
28f540f4 RM |
1283 | { |
1284 | unsigned int groups; | |
1285 | ||
1286 | /* We treat all negative values like CHAR_MAX. */ | |
1287 | ||
1288 | if (*grouping == CHAR_MAX || *grouping <= 0) | |
1289 | /* No grouping should be done. */ | |
1290 | return 0; | |
1291 | ||
1292 | groups = 0; | |
67a3a8ac | 1293 | while (intdig_max > (unsigned int) *grouping) |
28f540f4 RM |
1294 | { |
1295 | ++groups; | |
1296 | intdig_max -= *grouping++; | |
1297 | ||
60c96635 UD |
1298 | if (*grouping == CHAR_MAX |
1299 | #if CHAR_MIN < 0 | |
1300 | || *grouping < 0 | |
1301 | #endif | |
1302 | ) | |
28f540f4 RM |
1303 | /* No more grouping should be done. */ |
1304 | break; | |
1305 | else if (*grouping == 0) | |
1306 | { | |
1307 | /* Same grouping repeats. */ | |
8a4b65b4 | 1308 | groups += (intdig_max - 1) / grouping[-1]; |
28f540f4 RM |
1309 | break; |
1310 | } | |
1311 | } | |
1312 | ||
1313 | return groups; | |
1314 | } | |
1315 | ||
1316 | /* Group the INTDIG_NO integer digits of the number in [BUF,BUFEND). | |
1317 | There is guaranteed enough space past BUFEND to extend it. | |
1318 | Return the new end of buffer. */ | |
1319 | ||
a1d84548 | 1320 | static wchar_t * |
a1d84548 UD |
1321 | group_number (wchar_t *buf, wchar_t *bufend, unsigned int intdig_no, |
1322 | const char *grouping, wchar_t thousands_sep, int ngroups) | |
28f540f4 | 1323 | { |
a1d84548 | 1324 | wchar_t *p; |
28f540f4 | 1325 | |
a1d84548 | 1326 | if (ngroups == 0) |
28f540f4 RM |
1327 | return bufend; |
1328 | ||
1329 | /* Move the fractional part down. */ | |
4aebaa6b UD |
1330 | __wmemmove (buf + intdig_no + ngroups, buf + intdig_no, |
1331 | bufend - (buf + intdig_no)); | |
28f540f4 | 1332 | |
a1d84548 | 1333 | p = buf + intdig_no + ngroups - 1; |
28f540f4 RM |
1334 | do |
1335 | { | |
1336 | unsigned int len = *grouping++; | |
1337 | do | |
1338 | *p-- = buf[--intdig_no]; | |
1339 | while (--len > 0); | |
1340 | *p-- = thousands_sep; | |
1341 | ||
60c96635 UD |
1342 | if (*grouping == CHAR_MAX |
1343 | #if CHAR_MIN < 0 | |
1344 | || *grouping < 0 | |
1345 | #endif | |
1346 | ) | |
28f540f4 RM |
1347 | /* No more grouping should be done. */ |
1348 | break; | |
1349 | else if (*grouping == 0) | |
1350 | /* Same grouping repeats. */ | |
1351 | --grouping; | |
67a3a8ac | 1352 | } while (intdig_no > (unsigned int) *grouping); |
28f540f4 RM |
1353 | |
1354 | /* Copy the remaining ungrouped digits. */ | |
1355 | do | |
1356 | *p-- = buf[--intdig_no]; | |
1357 | while (p > buf); | |
1358 | ||
a1d84548 | 1359 | return bufend + ngroups; |
28f540f4 | 1360 | } |