stdio-common/_itoa.c

   1 /* Internal function for converting integers to ASCII.
   2    Copyright (C) 1994-2012 Free Software Foundation, Inc.
   3    This file is part of the GNU C Library.
   4    Contributed by Torbjorn Granlund <tege@matematik.su.se>
   5    and Ulrich Drepper <drepper@gnu.org>.
   6
   7    The GNU C Library is free software; you can redistribute it and/or
   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.
  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
  15    Lesser General Public License for more details.
  16
  17    You should have received a copy of the GNU Lesser General Public
  18    License along with the GNU C Library; if not, see
  19    <http://www.gnu.org/licenses/>.  */
  20
  21 #include <gmp-mparam.h>
  22 #include <gmp.h>
  23 #include <limits.h>
  24 #include <stdlib/gmp-impl.h>
  25 #include <stdlib/longlong.h>
  26
  27 #include <_itoa.h>
  28
  29
  30 /* Canonize environment.  For some architectures not all values might
  31    be defined in the GMP header files.  */
  32 #ifndef UMUL_TIME
  33 # define UMUL_TIME 1
  34 #endif
  35 #ifndef UDIV_TIME
  36 # define UDIV_TIME 3
  37 #endif
  38
  39 /* Control memory layout.  */
  40 #ifdef PACK
  41 # undef PACK
  42 # define PACK __attribute__ ((packed))
  43 #else
  44 # define PACK
  45 #endif
  46
  47
  48 /* Declare local types.  */
  49 struct base_table_t
  50 {
  51 #if (UDIV_TIME > 2 * UMUL_TIME)
  52   mp_limb_t base_multiplier;
  53 #endif
  54   char flag;
  55   char post_shift;
  56 #if BITS_PER_MP_LIMB == 32
  57   struct
  58     {
  59       char normalization_steps;
  60       char ndigits;
  61       mp_limb_t base PACK;
  62 #if UDIV_TIME > 2 * UMUL_TIME
  63       mp_limb_t base_ninv PACK;
  64 #endif
  65     } big;
  66 #endif
  67 };
  68
  69 /* To reduce the memory needed we include some fields of the tables
  70    only conditionally.  */
  71 #if UDIV_TIME > 2 * UMUL_TIME
  72 # define SEL1(X) X,
  73 # define SEL2(X) ,X
  74 #else
  75 # define SEL1(X)
  76 # define SEL2(X)
  77 #endif
  78
  79
  80 /* We do not compile _itoa if we always can use _itoa_word.  */
  81 #if _ITOA_NEEDED
  82 /* Local variables.  */
  83 const struct base_table_t _itoa_base_table[] attribute_hidden =
  84 {
  85 # if BITS_PER_MP_LIMB == 64
  86   /*  2 */ {SEL1(0ull) 1, 1},
  87   /*  3 */ {SEL1(0xaaaaaaaaaaaaaaabull) 0, 1},
  88   /*  4 */ {SEL1(0ull) 1, 2},
  89   /*  5 */ {SEL1(0xcccccccccccccccdull) 0, 2},
  90   /*  6 */ {SEL1(0xaaaaaaaaaaaaaaabull) 0, 2},
  91   /*  7 */ {SEL1(0x2492492492492493ull) 1, 3},
  92   /*  8 */ {SEL1(0ull) 1, 3},
  93   /*  9 */ {SEL1(0xe38e38e38e38e38full) 0, 3},
  94   /* 10 */ {SEL1(0xcccccccccccccccdull) 0, 3},
  95   /* 11 */ {SEL1(0x2e8ba2e8ba2e8ba3ull) 0, 1},
  96   /* 12 */ {SEL1(0xaaaaaaaaaaaaaaabull) 0, 3},
  97   /* 13 */ {SEL1(0x4ec4ec4ec4ec4ec5ull) 0, 2},
  98   /* 14 */ {SEL1(0x2492492492492493ull) 1, 4},
  99   /* 15 */ {SEL1(0x8888888888888889ull) 0, 3},
 100   /* 16 */ {SEL1(0ull) 1, 4},
 101   /* 17 */ {SEL1(0xf0f0f0f0f0f0f0f1ull) 0, 4},
 102   /* 18 */ {SEL1(0xe38e38e38e38e38full) 0, 4},
 103   /* 19 */ {SEL1(0xd79435e50d79435full) 0, 4},
 104   /* 20 */ {SEL1(0xcccccccccccccccdull) 0, 4},
 105   /* 21 */ {SEL1(0x8618618618618619ull) 1, 5},
 106   /* 22 */ {SEL1(0x2e8ba2e8ba2e8ba3ull) 0, 2},
 107   /* 23 */ {SEL1(0x642c8590b21642c9ull) 1, 5},
 108   /* 24 */ {SEL1(0xaaaaaaaaaaaaaaabull) 0, 4},
 109   /* 25 */ {SEL1(0x47ae147ae147ae15ull) 1, 5},
 110   /* 26 */ {SEL1(0x4ec4ec4ec4ec4ec5ull) 0, 3},
 111   /* 27 */ {SEL1(0x97b425ed097b425full) 0, 4},
 112   /* 28 */ {SEL1(0x2492492492492493ull) 1, 5},
 113   /* 29 */ {SEL1(0x1a7b9611a7b9611bull) 1, 5},
 114   /* 30 */ {SEL1(0x8888888888888889ull) 0, 4},
 115   /* 31 */ {SEL1(0x0842108421084211ull) 1, 5},
 116   /* 32 */ {SEL1(0ull) 1, 5},
 117   /* 33 */ {SEL1(0x0f83e0f83e0f83e1ull) 0, 1},
 118   /* 34 */ {SEL1(0xf0f0f0f0f0f0f0f1ull) 0, 5},
 119   /* 35 */ {SEL1(0xea0ea0ea0ea0ea0full) 0, 5},
 120   /* 36 */ {SEL1(0xe38e38e38e38e38full) 0, 5}
 121 # endif
 122 # if BITS_PER_MP_LIMB == 32
 123   /*  2 */ {SEL1(0ul) 1, 1, {0, 31, 0x80000000ul SEL2(0xfffffffful)}},
 124   /*  3 */ {SEL1(0xaaaaaaabul) 0, 1, {0, 20, 0xcfd41b91ul SEL2(0x3b563c24ul)}},
 125   /*  4 */ {SEL1(0ul) 1, 2, {1, 15, 0x40000000ul SEL2(0xfffffffful)}},
 126   /*  5 */ {SEL1(0xcccccccdul) 0, 2, {1, 13, 0x48c27395ul SEL2(0xc25c2684ul)}},
 127   /*  6 */ {SEL1(0xaaaaaaabul) 0, 2, {0, 12, 0x81bf1000ul SEL2(0xf91bd1b6ul)}},
 128   /*  7 */ {SEL1(0x24924925ul) 1, 3, {1, 11, 0x75db9c97ul SEL2(0x1607a2cbul)}},
 129   /*  8 */ {SEL1(0ul) 1, 3, {1, 10, 0x40000000ul SEL2(0xfffffffful)}},
 130   /*  9 */ {SEL1(0x38e38e39ul) 0, 1, {0, 10, 0xcfd41b91ul SEL2(0x3b563c24ul)}},
 131   /* 10 */ {SEL1(0xcccccccdul) 0, 3, {2, 9, 0x3b9aca00ul SEL2(0x12e0be82ul)}},
 132   /* 11 */ {SEL1(0xba2e8ba3ul) 0, 3, {0, 9, 0x8c8b6d2bul SEL2(0xd24cde04ul)}},
 133   /* 12 */ {SEL1(0xaaaaaaabul) 0, 3, {3, 8, 0x19a10000ul SEL2(0x3fa39ab5ul)}},
 134   /* 13 */ {SEL1(0x4ec4ec4ful) 0, 2, {2, 8, 0x309f1021ul SEL2(0x50f8ac5ful)}},
 135   /* 14 */ {SEL1(0x24924925ul) 1, 4, {1, 8, 0x57f6c100ul SEL2(0x74843b1eul)}},
 136   /* 15 */ {SEL1(0x88888889ul) 0, 3, {0, 8, 0x98c29b81ul SEL2(0xad0326c2ul)}},
 137   /* 16 */ {SEL1(0ul) 1, 4, {3, 7, 0x10000000ul SEL2(0xfffffffful)}},
 138   /* 17 */ {SEL1(0xf0f0f0f1ul) 0, 4, {3, 7, 0x18754571ul SEL2(0x4ef0b6bdul)}},
 139   /* 18 */ {SEL1(0x38e38e39ul) 0, 2, {2, 7, 0x247dbc80ul SEL2(0xc0fc48a1ul)}},
 140   /* 19 */ {SEL1(0xaf286bcbul) 1, 5, {2, 7, 0x3547667bul SEL2(0x33838942ul)}},
 141   /* 20 */ {SEL1(0xcccccccdul) 0, 4, {1, 7, 0x4c4b4000ul SEL2(0xad7f29abul)}},
 142   /* 21 */ {SEL1(0x86186187ul) 1, 5, {1, 7, 0x6b5a6e1dul SEL2(0x313c3d15ul)}},
 143   /* 22 */ {SEL1(0xba2e8ba3ul) 0, 4, {0, 7, 0x94ace180ul SEL2(0xb8cca9e0ul)}},
 144   /* 23 */ {SEL1(0xb21642c9ul) 0, 4, {0, 7, 0xcaf18367ul SEL2(0x42ed6de9ul)}},
 145   /* 24 */ {SEL1(0xaaaaaaabul) 0, 4, {4, 6, 0x0b640000ul SEL2(0x67980e0bul)}},
 146   /* 25 */ {SEL1(0x51eb851ful) 0, 3, {4, 6, 0x0e8d4a51ul SEL2(0x19799812ul)}},
 147   /* 26 */ {SEL1(0x4ec4ec4ful) 0, 3, {3, 6, 0x1269ae40ul SEL2(0xbce85396ul)}},
 148   /* 27 */ {SEL1(0x2f684bdbul) 1, 5, {3, 6, 0x17179149ul SEL2(0x62c103a9ul)}},
 149   /* 28 */ {SEL1(0x24924925ul) 1, 5, {3, 6, 0x1cb91000ul SEL2(0x1d353d43ul)}},
 150   /* 29 */ {SEL1(0x8d3dcb09ul) 0, 4, {2, 6, 0x23744899ul SEL2(0xce1deceaul)}},
 151   /* 30 */ {SEL1(0x88888889ul) 0, 4, {2, 6, 0x2b73a840ul SEL2(0x790fc511ul)}},
 152   /* 31 */ {SEL1(0x08421085ul) 1, 5, {2, 6, 0x34e63b41ul SEL2(0x35b865a0ul)}},
 153   /* 32 */ {SEL1(0ul) 1, 5, {1, 6, 0x40000000ul SEL2(0xfffffffful)}},
 154   /* 33 */ {SEL1(0x3e0f83e1ul) 0, 3, {1, 6, 0x4cfa3cc1ul SEL2(0xa9aed1b3ul)}},
 155   /* 34 */ {SEL1(0xf0f0f0f1ul) 0, 5, {1, 6, 0x5c13d840ul SEL2(0x63dfc229ul)}},
 156   /* 35 */ {SEL1(0xd41d41d5ul) 1, 6, {1, 6, 0x6d91b519ul SEL2(0x2b0fee30ul)}},
 157   /* 36 */ {SEL1(0x38e38e39ul) 0, 3, {0, 6, 0x81bf1000ul SEL2(0xf91bd1b6ul)}}
 158 # endif
 159 };
 160 #endif
 161
 162 char *
 163 _itoa_word (_ITOA_WORD_TYPE value, char *buflim,
 164             unsigned int base, int upper_case)
 165 {
 166   const char *digits = (upper_case
 167                         ? _itoa_upper_digits
 168                         : _itoa_lower_digits);
 169
 170   switch (base)
 171     {
 172 #define SPECIAL(Base)                                                         \
 173     case Base:                                                                \
 174       do                                                                      \
 175         *--buflim = digits[value % Base];                                     \
 176       while ((value /= Base) != 0);                                           \
 177       break
 178
 179       SPECIAL (10);
 180       SPECIAL (16);
 181       SPECIAL (8);
 182     default:
 183       do
 184         *--buflim = digits[value % base];
 185       while ((value /= base) != 0);
 186     }
 187   return buflim;
 188 }
 189 #undef SPECIAL
 190
 191
 192 #if _ITOA_NEEDED
 193 char *
 194 _itoa (value, buflim, base, upper_case)
 195      unsigned long long int value;
 196      char *buflim;
 197      unsigned int base;
 198      int upper_case;
 199 {
 200   const char *digits = (upper_case
 201                         ? _itoa_upper_digits
 202                         : _itoa_lower_digits);
 203   const struct base_table_t *brec = &_itoa_base_table[base - 2];
 204
 205   switch (base)
 206     {
 207 # define RUN_2N(BITS) \
 208       do                                                                      \
 209         {                                                                     \
 210           /* `unsigned long long int' always has 64 bits.  */                 \
 211           mp_limb_t work_hi = value >> (64 - BITS_PER_MP_LIMB);               \
 212                                                                               \
 213           if (BITS_PER_MP_LIMB == 32)                                         \
 214             {                                                                 \
 215               if (work_hi != 0)                                               \
 216                 {                                                             \
 217                   mp_limb_t work_lo;                                          \
 218                   int cnt;                                                    \
 219                                                                               \
 220                   work_lo = value & 0xfffffffful;                             \
 221                   for (cnt = BITS_PER_MP_LIMB / BITS; cnt > 0; --cnt)         \
 222                     {                                                         \
 223                       *--buflim = digits[work_lo & ((1ul << BITS) - 1)];      \
 224                       work_lo >>= BITS;                                       \
 225                     }                                                         \
 226                   if (BITS_PER_MP_LIMB % BITS != 0)                           \
 227                     {                                                         \
 228                       work_lo                                                 \
 229                         |= ((work_hi                                          \
 230                              & ((1 << (BITS - BITS_PER_MP_LIMB%BITS))         \
 231                                 - 1))                                         \
 232                             << BITS_PER_MP_LIMB % BITS);                      \
 233                       work_hi >>= BITS - BITS_PER_MP_LIMB % BITS;             \
 234                       if (work_hi == 0)                                       \
 235                         work_hi = work_lo;                                    \
 236                       else                                                    \
 237                         *--buflim = digits[work_lo];                          \
 238                     }                                                         \
 239                 }                                                             \
 240               else                                                            \
 241                 work_hi = value & 0xfffffffful;                               \
 242             }                                                                 \
 243           do                                                                  \
 244             {                                                                 \
 245               *--buflim = digits[work_hi & ((1 << BITS) - 1)];                \
 246               work_hi >>= BITS;                                               \
 247             }                                                                 \
 248           while (work_hi != 0);                                               \
 249         }                                                                     \
 250       while (0)
 251     case 8:
 252       RUN_2N (3);
 253       break;
 254
 255     case 16:
 256       RUN_2N (4);
 257       break;
 258
 259     default:
 260       {
 261         char *bufend = buflim;
 262 # if BITS_PER_MP_LIMB == 64
 263         mp_limb_t base_multiplier = brec->base_multiplier;
 264         if (brec->flag)
 265           while (value != 0)
 266             {
 267               mp_limb_t quo, rem, x;
 268               mp_limb_t __attribute__ ((unused));
 269
 270               umul_ppmm (x, dummy, value, base_multiplier);
 271               quo = (x + ((value - x) >> 1)) >> (brec->post_shift - 1);
 272               rem = value - quo * base;
 273               *--buflim = digits[rem];
 274               value = quo;
 275             }
 276         else
 277           while (value != 0)
 278             {
 279               mp_limb_t quo, rem, x;
 280               mp_limb_t __attribute__ ((unused));
 281
 282               umul_ppmm (x, dummy, value, base_multiplier);
 283               quo = x >> brec->post_shift;
 284               rem = value - quo * base;
 285               *--buflim = digits[rem];
 286               value = quo;
 287             }
 288 # endif
 289 # if BITS_PER_MP_LIMB == 32
 290         mp_limb_t t[3];
 291         int n;
 292
 293         /* First convert x0 to 1-3 words in base s->big.base.
 294            Optimize for frequent cases of 32 bit numbers.  */
 295         if ((mp_limb_t) (value >> 32) >= 1)
 296           {
 297 #  if UDIV_TIME > 2 * UMUL_TIME || UDIV_NEEDS_NORMALIZATION
 298             int big_normalization_steps = brec->big.normalization_steps;
 299             mp_limb_t big_base_norm
 300               = brec->big.base << big_normalization_steps;
 301 #  endif
 302             if ((mp_limb_t) (value >> 32) >= brec->big.base)
 303               {
 304                 mp_limb_t x1hi, x1lo, r;
 305                 /* If you want to optimize this, take advantage of
 306                    that the quotient in the first udiv_qrnnd will
 307                    always be very small.  It might be faster just to
 308                    subtract in a tight loop.  */
 309
 310 #  if UDIV_TIME > 2 * UMUL_TIME
 311                 mp_limb_t x, xh, xl;
 312
 313                 if (big_normalization_steps == 0)
 314                   xh = 0;
 315                 else
 316                   xh = (mp_limb_t) (value >> (64 - big_normalization_steps));
 317                 xl = (mp_limb_t) (value >> (32 - big_normalization_steps));
 318                 udiv_qrnnd_preinv (x1hi, r, xh, xl, big_base_norm,
 319                                    brec->big.base_ninv);
 320
 321                 xl = ((mp_limb_t) value) << big_normalization_steps;
 322                 udiv_qrnnd_preinv (x1lo, x, r, xl, big_base_norm,
 323                                    brec->big.base_ninv);
 324                 t[2] = x >> big_normalization_steps;
 325
 326                 if (big_normalization_steps == 0)
 327                   xh = x1hi;
 328                 else
 329                   xh = ((x1hi << big_normalization_steps)
 330                         | (x1lo >> (32 - big_normalization_steps)));
 331                 xl = x1lo << big_normalization_steps;
 332                 udiv_qrnnd_preinv (t[0], x, xh, xl, big_base_norm,
 333                                    brec->big.base_ninv);
 334                 t[1] = x >> big_normalization_steps;
 335 #  elif UDIV_NEEDS_NORMALIZATION
 336                 mp_limb_t x, xh, xl;
 337
 338                 if (big_normalization_steps == 0)
 339                   xh = 0;
 340                 else
 341                   xh = (mp_limb_t) (value >> 64 - big_normalization_steps);
 342                 xl = (mp_limb_t) (value >> 32 - big_normalization_steps);
 343                 udiv_qrnnd (x1hi, r, xh, xl, big_base_norm);
 344
 345                 xl = ((mp_limb_t) value) << big_normalization_steps;
 346                 udiv_qrnnd (x1lo, x, r, xl, big_base_norm);
 347                 t[2] = x >> big_normalization_steps;
 348
 349                 if (big_normalization_steps == 0)
 350                   xh = x1hi;
 351                 else
 352                   xh = ((x1hi << big_normalization_steps)
 353                         | (x1lo >> 32 - big_normalization_steps));
 354                 xl = x1lo << big_normalization_steps;
 355                 udiv_qrnnd (t[0], x, xh, xl, big_base_norm);
 356                 t[1] = x >> big_normalization_steps;
 357 #  else
 358                 udiv_qrnnd (x1hi, r, 0, (mp_limb_t) (value >> 32),
 359                             brec->big.base);
 360                 udiv_qrnnd (x1lo, t[2], r, (mp_limb_t) value, brec->big.base);
 361                 udiv_qrnnd (t[0], t[1], x1hi, x1lo, brec->big.base);
 362 #  endif
 363                 n = 3;
 364               }
 365             else
 366               {
 367 #  if UDIV_TIME > 2 * UMUL_TIME
 368                 mp_limb_t x;
 369
 370                 value <<= brec->big.normalization_steps;
 371                 udiv_qrnnd_preinv (t[0], x, (mp_limb_t) (value >> 32),
 372                                    (mp_limb_t) value, big_base_norm,
 373                                    brec->big.base_ninv);
 374                 t[1] = x >> brec->big.normalization_steps;
 375 #  elif UDIV_NEEDS_NORMALIZATION
 376                 mp_limb_t x;
 377
 378                 value <<= big_normalization_steps;
 379                 udiv_qrnnd (t[0], x, (mp_limb_t) (value >> 32),
 380                             (mp_limb_t) value, big_base_norm);
 381                 t[1] = x >> big_normalization_steps;
 382 #  else
 383                 udiv_qrnnd (t[0], t[1], (mp_limb_t) (value >> 32),
 384                             (mp_limb_t) value, brec->big.base);
 385 #  endif
 386                 n = 2;
 387               }
 388           }
 389         else
 390           {
 391             t[0] = value;
 392             n = 1;
 393           }
 394
 395         /* Convert the 1-3 words in t[], word by word, to ASCII.  */
 396         do
 397           {
 398             mp_limb_t ti = t[--n];
 399             int ndig_for_this_limb = 0;
 400
 401 #  if UDIV_TIME > 2 * UMUL_TIME
 402             mp_limb_t base_multiplier = brec->base_multiplier;
 403             if (brec->flag)
 404               while (ti != 0)
 405                 {
 406                   mp_limb_t quo, rem, x;
 407                   mp_limb_t dummy __attribute__ ((unused));
 408
 409                   umul_ppmm (x, dummy, ti, base_multiplier);
 410                   quo = (x + ((ti - x) >> 1)) >> (brec->post_shift - 1);
 411                   rem = ti - quo * base;
 412                   *--buflim = digits[rem];
 413                   ti = quo;
 414                   ++ndig_for_this_limb;
 415                 }
 416             else
 417               while (ti != 0)
 418                 {
 419                   mp_limb_t quo, rem, x;
 420                   mp_limb_t dummy __attribute__ ((unused));
 421
 422                   umul_ppmm (x, dummy, ti, base_multiplier);
 423                   quo = x >> brec->post_shift;
 424                   rem = ti - quo * base;
 425                   *--buflim = digits[rem];
 426                   ti = quo;
 427                   ++ndig_for_this_limb;
 428                 }
 429 #  else
 430             while (ti != 0)
 431               {
 432                 mp_limb_t quo, rem;
 433
 434                 quo = ti / base;
 435                 rem = ti % base;
 436                 *--buflim = digits[rem];
 437                 ti = quo;
 438                 ++ndig_for_this_limb;
 439               }
 440 #  endif
 441             /* If this wasn't the most significant word, pad with zeros.  */
 442             if (n != 0)
 443               while (ndig_for_this_limb < brec->big.ndigits)
 444                 {
 445                   *--buflim = '0';
 446                   ++ndig_for_this_limb;
 447                 }
 448           }
 449         while (n != 0);
 450 # endif
 451         if (buflim == bufend)
 452           *--buflim = '0';
 453       }
 454       break;
 455     }
 456
 457   return buflim;
 458 }
 459 #endif
 460
 461 char *
 462 _fitoa_word (_ITOA_WORD_TYPE value, char *buf, unsigned int base,
 463              int upper_case)
 464 {
 465   char tmpbuf[sizeof (value) * 4];            /* Worst case length: base 2.  */
 466   char *cp = _itoa_word (value, tmpbuf + sizeof (value) * 4, base, upper_case);
 467   while (cp < tmpbuf + sizeof (value) * 4)
 468     *buf++ = *cp++;
 469   return buf;
 470 }
 471
 472 #if _ITOA_NEEDED
 473 char *
 474 _fitoa (unsigned long long value, char *buf, unsigned int base, int upper_case)
 475 {
 476   char tmpbuf[sizeof (value) * 4];            /* Worst case length: base 2.  */
 477   char *cp = _itoa (value, tmpbuf + sizeof (value) * 4, base, upper_case);
 478   while (cp < tmpbuf + sizeof (value) * 4)
 479     *buf++ = *cp++;
 480   return buf;
 481 }
 482 #endif