[thirdparty/glibc.git] / stdio-common / _itoa.c

/* Internal function for converting integers to ASCII.
   Copyright (C) 1994, 1995, 1996, 1999, 2000, 2002, 2003, 2004, 2007
   Free Software Foundation, Inc.
   This file is part of the GNU C Library.
   Contributed by Torbjorn Granlund <tege@matematik.su.se>
   and Ulrich Drepper <drepper@gnu.org>.

   The GNU C Library is free software; you can redistribute it and/or
   modify it under the terms of the GNU Lesser General Public
   License as published by the Free Software Foundation; either
   version 2.1 of the License, or (at your option) any later version.

   The GNU C Library is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
   Lesser General Public License for more details.

   You should have received a copy of the GNU Lesser General Public
   License along with the GNU C Library; if not, write to the Free
   Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
   02111-1307 USA.  */

#include <gmp-mparam.h>
#include <gmp.h>
#include <limits.h>
#include <stdlib/gmp-impl.h>
#include <stdlib/longlong.h>

#include "_itoa.h"


/* Canonize environment.  For some architectures not all values might
   be defined in the GMP header files.  */
#ifndef UMUL_TIME
# define UMUL_TIME 1
#endif
#ifndef UDIV_TIME
# define UDIV_TIME 3
#endif

/* Control memory layout.  */
#ifdef PACK
# undef PACK
# define PACK __attribute__ ((packed))
#else
# define PACK
#endif


/* Declare local types.  */
struct base_table_t
{
#if (UDIV_TIME > 2 * UMUL_TIME)
  mp_limb_t base_multiplier;
#endif
  char flag;
  char post_shift;
#if BITS_PER_MP_LIMB == 32
  struct
    {
      char normalization_steps;
      char ndigits;
      mp_limb_t base PACK;
#if UDIV_TIME > 2 * UMUL_TIME
      mp_limb_t base_ninv PACK;
#endif
    } big;
#endif
};

/* To reduce the memory needed we include some fields of the tables
   only conditionally.  */
#if UDIV_TIME > 2 * UMUL_TIME
# define SEL1(X) X,
# define SEL2(X) ,X
#else
# define SEL1(X)
# define SEL2(X)
#endif


/* We do not compile _itoa if we always can use _itoa_word.  */
#if LLONG_MAX != LONG_MAX
/* Local variables.  */
const struct base_table_t _itoa_base_table[] attribute_hidden =
{
# if BITS_PER_MP_LIMB == 64
  /*  2 */ {SEL1(0ull) 1, 1},
  /*  3 */ {SEL1(0xaaaaaaaaaaaaaaabull) 0, 1},
  /*  4 */ {SEL1(0ull) 1, 2},
  /*  5 */ {SEL1(0xcccccccccccccccdull) 0, 2},
  /*  6 */ {SEL1(0xaaaaaaaaaaaaaaabull) 0, 2},
  /*  7 */ {SEL1(0x2492492492492493ull) 1, 3},
  /*  8 */ {SEL1(0ull) 1, 3},
  /*  9 */ {SEL1(0xe38e38e38e38e38full) 0, 3},
  /* 10 */ {SEL1(0xcccccccccccccccdull) 0, 3},
  /* 11 */ {SEL1(0x2e8ba2e8ba2e8ba3ull) 0, 1},
  /* 12 */ {SEL1(0xaaaaaaaaaaaaaaabull) 0, 3},
  /* 13 */ {SEL1(0x4ec4ec4ec4ec4ec5ull) 0, 2},
  /* 14 */ {SEL1(0x2492492492492493ull) 1, 4},
  /* 15 */ {SEL1(0x8888888888888889ull) 0, 3},
  /* 16 */ {SEL1(0ull) 1, 4},
  /* 17 */ {SEL1(0xf0f0f0f0f0f0f0f1ull) 0, 4},
  /* 18 */ {SEL1(0xe38e38e38e38e38full) 0, 4},
  /* 19 */ {SEL1(0xd79435e50d79435full) 0, 4},
  /* 20 */ {SEL1(0xcccccccccccccccdull) 0, 4},
  /* 21 */ {SEL1(0x8618618618618619ull) 1, 5},
  /* 22 */ {SEL1(0x2e8ba2e8ba2e8ba3ull) 0, 2},
  /* 23 */ {SEL1(0x642c8590b21642c9ull) 1, 5},
  /* 24 */ {SEL1(0xaaaaaaaaaaaaaaabull) 0, 4},
  /* 25 */ {SEL1(0x47ae147ae147ae15ull) 1, 5},
  /* 26 */ {SEL1(0x4ec4ec4ec4ec4ec5ull) 0, 3},
  /* 27 */ {SEL1(0x97b425ed097b425full) 0, 4},
  /* 28 */ {SEL1(0x2492492492492493ull) 1, 5},
  /* 29 */ {SEL1(0x1a7b9611a7b9611bull) 1, 5},
  /* 30 */ {SEL1(0x8888888888888889ull) 0, 4},
  /* 31 */ {SEL1(0x0842108421084211ull) 1, 5},
  /* 32 */ {SEL1(0ull) 1, 5},
  /* 33 */ {SEL1(0x0f83e0f83e0f83e1ull) 0, 1},
  /* 34 */ {SEL1(0xf0f0f0f0f0f0f0f1ull) 0, 5},
  /* 35 */ {SEL1(0xea0ea0ea0ea0ea0full) 0, 5},
  /* 36 */ {SEL1(0xe38e38e38e38e38full) 0, 5}
# endif
# if BITS_PER_MP_LIMB == 32
  /*  2 */ {SEL1(0ul) 1, 1, {0, 31, 0x80000000ul SEL2(0xfffffffful)}},
  /*  3 */ {SEL1(0xaaaaaaabul) 0, 1, {0, 20, 0xcfd41b91ul SEL2(0x3b563c24ul)}},
  /*  4 */ {SEL1(0ul) 1, 2, {1, 15, 0x40000000ul SEL2(0xfffffffful)}},
  /*  5 */ {SEL1(0xcccccccdul) 0, 2, {1, 13, 0x48c27395ul SEL2(0xc25c2684ul)}},
  /*  6 */ {SEL1(0xaaaaaaabul) 0, 2, {0, 12, 0x81bf1000ul SEL2(0xf91bd1b6ul)}},
  /*  7 */ {SEL1(0x24924925ul) 1, 3, {1, 11, 0x75db9c97ul SEL2(0x1607a2cbul)}},
  /*  8 */ {SEL1(0ul) 1, 3, {1, 10, 0x40000000ul SEL2(0xfffffffful)}},
  /*  9 */ {SEL1(0x38e38e39ul) 0, 1, {0, 10, 0xcfd41b91ul SEL2(0x3b563c24ul)}},
  /* 10 */ {SEL1(0xcccccccdul) 0, 3, {2, 9, 0x3b9aca00ul SEL2(0x12e0be82ul)}},
  /* 11 */ {SEL1(0xba2e8ba3ul) 0, 3, {0, 9, 0x8c8b6d2bul SEL2(0xd24cde04ul)}},
  /* 12 */ {SEL1(0xaaaaaaabul) 0, 3, {3, 8, 0x19a10000ul SEL2(0x3fa39ab5ul)}},
  /* 13 */ {SEL1(0x4ec4ec4ful) 0, 2, {2, 8, 0x309f1021ul SEL2(0x50f8ac5ful)}},
  /* 14 */ {SEL1(0x24924925ul) 1, 4, {1, 8, 0x57f6c100ul SEL2(0x74843b1eul)}},
  /* 15 */ {SEL1(0x88888889ul) 0, 3, {0, 8, 0x98c29b81ul SEL2(0xad0326c2ul)}},
  /* 16 */ {SEL1(0ul) 1, 4, {3, 7, 0x10000000ul SEL2(0xfffffffful)}},
  /* 17 */ {SEL1(0xf0f0f0f1ul) 0, 4, {3, 7, 0x18754571ul SEL2(0x4ef0b6bdul)}},
  /* 18 */ {SEL1(0x38e38e39ul) 0, 2, {2, 7, 0x247dbc80ul SEL2(0xc0fc48a1ul)}},
  /* 19 */ {SEL1(0xaf286bcbul) 1, 5, {2, 7, 0x3547667bul SEL2(0x33838942ul)}},
  /* 20 */ {SEL1(0xcccccccdul) 0, 4, {1, 7, 0x4c4b4000ul SEL2(0xad7f29abul)}},
  /* 21 */ {SEL1(0x86186187ul) 1, 5, {1, 7, 0x6b5a6e1dul SEL2(0x313c3d15ul)}},
  /* 22 */ {SEL1(0xba2e8ba3ul) 0, 4, {0, 7, 0x94ace180ul SEL2(0xb8cca9e0ul)}},
  /* 23 */ {SEL1(0xb21642c9ul) 0, 4, {0, 7, 0xcaf18367ul SEL2(0x42ed6de9ul)}},
  /* 24 */ {SEL1(0xaaaaaaabul) 0, 4, {4, 6, 0x0b640000ul SEL2(0x67980e0bul)}},
  /* 25 */ {SEL1(0x51eb851ful) 0, 3, {4, 6, 0x0e8d4a51ul SEL2(0x19799812ul)}},
  /* 26 */ {SEL1(0x4ec4ec4ful) 0, 3, {3, 6, 0x1269ae40ul SEL2(0xbce85396ul)}},
  /* 27 */ {SEL1(0x2f684bdbul) 1, 5, {3, 6, 0x17179149ul SEL2(0x62c103a9ul)}},
  /* 28 */ {SEL1(0x24924925ul) 1, 5, {3, 6, 0x1cb91000ul SEL2(0x1d353d43ul)}},
  /* 29 */ {SEL1(0x8d3dcb09ul) 0, 4, {2, 6, 0x23744899ul SEL2(0xce1deceaul)}},
  /* 30 */ {SEL1(0x88888889ul) 0, 4, {2, 6, 0x2b73a840ul SEL2(0x790fc511ul)}},
  /* 31 */ {SEL1(0x08421085ul) 1, 5, {2, 6, 0x34e63b41ul SEL2(0x35b865a0ul)}},
  /* 32 */ {SEL1(0ul) 1, 5, {1, 6, 0x40000000ul SEL2(0xfffffffful)}},
  /* 33 */ {SEL1(0x3e0f83e1ul) 0, 3, {1, 6, 0x4cfa3cc1ul SEL2(0xa9aed1b3ul)}},
  /* 34 */ {SEL1(0xf0f0f0f1ul) 0, 5, {1, 6, 0x5c13d840ul SEL2(0x63dfc229ul)}},
  /* 35 */ {SEL1(0xd41d41d5ul) 1, 6, {1, 6, 0x6d91b519ul SEL2(0x2b0fee30ul)}},
  /* 36 */ {SEL1(0x38e38e39ul) 0, 3, {0, 6, 0x81bf1000ul SEL2(0xf91bd1b6ul)}}
# endif
};
#endif

/* Lower-case digits.  */
extern const char _itoa_lower_digits[];
extern const char _itoa_lower_digits_internal[] attribute_hidden;
/* Upper-case digits.  */
extern const char _itoa_upper_digits[];
extern const char _itoa_upper_digits_internal[] attribute_hidden;


char *
_itoa_word (unsigned long value, char *buflim,
	    unsigned int base, int upper_case)
{
  const char *digits = (upper_case
#if !defined NOT_IN_libc || defined IS_IN_rtld
			? INTUSE(_itoa_upper_digits)
			: INTUSE(_itoa_lower_digits)
#else
			? _itoa_upper_digits
			: _itoa_lower_digits
#endif
		       );

  switch (base)
    {
#define SPECIAL(Base)							      \
    case Base:								      \
      do								      \
	*--buflim = digits[value % Base];				      \
      while ((value /= Base) != 0);					      \
      break

      SPECIAL (10);
      SPECIAL (16);
      SPECIAL (8);
    default:
      do
	*--buflim = digits[value % base];
      while ((value /= base) != 0);
    }
  return buflim;
}
#undef SPECIAL


#if LLONG_MAX != LONG_MAX
char *
_itoa (value, buflim, base, upper_case)
     unsigned long long int value;
     char *buflim;
     unsigned int base;
     int upper_case;
{
  const char *digits = (upper_case
			? INTUSE(_itoa_upper_digits)
			: INTUSE(_itoa_lower_digits));
  const struct base_table_t *brec = &_itoa_base_table[base - 2];

  switch (base)
    {
# define RUN_2N(BITS) \
      do								      \
        {								      \
	  /* `unsigned long long int' always has 64 bits.  */		      \
	  mp_limb_t work_hi = value >> (64 - BITS_PER_MP_LIMB);		      \
									      \
	  if (BITS_PER_MP_LIMB == 32)					      \
	    {								      \
	      if (work_hi != 0)						      \
		{							      \
		  mp_limb_t work_lo;					      \
		  int cnt;						      \
									      \
		  work_lo = value & 0xfffffffful;			      \
		  for (cnt = BITS_PER_MP_LIMB / BITS; cnt > 0; --cnt)	      \
		    {							      \
		      *--buflim = digits[work_lo & ((1ul << BITS) - 1)];      \
		      work_lo >>= BITS;					      \
		    }							      \
		  if (BITS_PER_MP_LIMB % BITS != 0)			      \
		    {							      \
		      work_lo						      \
			|= ((work_hi					      \
			     & ((1 << (BITS - BITS_PER_MP_LIMB%BITS))	      \
				- 1))					      \
			    << BITS_PER_MP_LIMB % BITS);		      \
		      work_hi >>= BITS - BITS_PER_MP_LIMB % BITS;	      \
		      if (work_hi == 0)					      \
			work_hi = work_lo;				      \
		      else						      \
			*--buflim = digits[work_lo];			      \
		    }							      \
		}							      \
	      else							      \
		work_hi = value & 0xfffffffful;				      \
	    }								      \
	  do								      \
	    {								      \
	      *--buflim = digits[work_hi & ((1 << BITS) - 1)];		      \
	      work_hi >>= BITS;						      \
	    }								      \
	  while (work_hi != 0);						      \
	}								      \
      while (0)
    case 8:
      RUN_2N (3);
      break;

    case 16:
      RUN_2N (4);
      break;

    default:
      {
	char *bufend = buflim;
# if BITS_PER_MP_LIMB == 64
	mp_limb_t base_multiplier = brec->base_multiplier;
	if (brec->flag)
	  while (value != 0)
	    {
	      mp_limb_t quo, rem, x, dummy;

	      umul_ppmm (x, dummy, value, base_multiplier);
	      quo = (x + ((value - x) >> 1)) >> (brec->post_shift - 1);
	      rem = value - quo * base;
	      *--buflim = digits[rem];
	      value = quo;
	    }
	else
	  while (value != 0)
	    {
	      mp_limb_t quo, rem, x, dummy;

	      umul_ppmm (x, dummy, value, base_multiplier);
	      quo = x >> brec->post_shift;
	      rem = value - quo * base;
	      *--buflim = digits[rem];
	      value = quo;
	    }
# endif
# if BITS_PER_MP_LIMB == 32
	mp_limb_t t[3];
	int n;

	/* First convert x0 to 1-3 words in base s->big.base.
	   Optimize for frequent cases of 32 bit numbers.  */
	if ((mp_limb_t) (value >> 32) >= 1)
	  {
#  if UDIV_TIME > 2 * UMUL_TIME || UDIV_NEEDS_NORMALIZATION
	    int big_normalization_steps = brec->big.normalization_steps;
	    mp_limb_t big_base_norm
	      = brec->big.base << big_normalization_steps;
#  endif
	    if ((mp_limb_t) (value >> 32) >= brec->big.base)
	      {
		mp_limb_t x1hi, x1lo, r;
		/* If you want to optimize this, take advantage of
		   that the quotient in the first udiv_qrnnd will
		   always be very small.  It might be faster just to
		   subtract in a tight loop.  */

#  if UDIV_TIME > 2 * UMUL_TIME
		mp_limb_t x, xh, xl;

		if (big_normalization_steps == 0)
		  xh = 0;
		else
		  xh = (mp_limb_t) (value >> (64 - big_normalization_steps));
		xl = (mp_limb_t) (value >> (32 - big_normalization_steps));
		udiv_qrnnd_preinv (x1hi, r, xh, xl, big_base_norm,
				   brec->big.base_ninv);

		xl = ((mp_limb_t) value) << big_normalization_steps;
		udiv_qrnnd_preinv (x1lo, x, r, xl, big_base_norm,
				   brec->big.base_ninv);
		t[2] = x >> big_normalization_steps;

		if (big_normalization_steps == 0)
		  xh = x1hi;
		else
		  xh = ((x1hi << big_normalization_steps)
			| (x1lo >> (32 - big_normalization_steps)));
		xl = x1lo << big_normalization_steps;
		udiv_qrnnd_preinv (t[0], x, xh, xl, big_base_norm,
				   brec->big.base_ninv);
		t[1] = x >> big_normalization_steps;
#  elif UDIV_NEEDS_NORMALIZATION
		mp_limb_t x, xh, xl;

		if (big_normalization_steps == 0)
		  xh = 0;
		else
		  xh = (mp_limb_t) (value >> 64 - big_normalization_steps);
		xl = (mp_limb_t) (value >> 32 - big_normalization_steps);
		udiv_qrnnd (x1hi, r, xh, xl, big_base_norm);

		xl = ((mp_limb_t) value) << big_normalization_steps;
		udiv_qrnnd (x1lo, x, r, xl, big_base_norm);
		t[2] = x >> big_normalization_steps;

		if (big_normalization_steps == 0)
		  xh = x1hi;
		else
		  xh = ((x1hi << big_normalization_steps)
			| (x1lo >> 32 - big_normalization_steps));
		xl = x1lo << big_normalization_steps;
		udiv_qrnnd (t[0], x, xh, xl, big_base_norm);
		t[1] = x >> big_normalization_steps;
#  else
		udiv_qrnnd (x1hi, r, 0, (mp_limb_t) (value >> 32),
			    brec->big.base);
		udiv_qrnnd (x1lo, t[2], r, (mp_limb_t) value, brec->big.base);
		udiv_qrnnd (t[0], t[1], x1hi, x1lo, brec->big.base);
#  endif
		n = 3;
	      }
	    else
	      {
#  if UDIV_TIME > 2 * UMUL_TIME
		mp_limb_t x;

		value <<= brec->big.normalization_steps;
		udiv_qrnnd_preinv (t[0], x, (mp_limb_t) (value >> 32),
				   (mp_limb_t) value, big_base_norm,
				   brec->big.base_ninv);
		t[1] = x >> brec->big.normalization_steps;
#  elif UDIV_NEEDS_NORMALIZATION
		mp_limb_t x;

		value <<= big_normalization_steps;
		udiv_qrnnd (t[0], x, (mp_limb_t) (value >> 32),
			    (mp_limb_t) value, big_base_norm);
		t[1] = x >> big_normalization_steps;
#  else
		udiv_qrnnd (t[0], t[1], (mp_limb_t) (value >> 32),
			    (mp_limb_t) value, brec->big.base);
#  endif
		n = 2;
	      }
	  }
	else
	  {
	    t[0] = value;
	    n = 1;
	  }

	/* Convert the 1-3 words in t[], word by word, to ASCII.  */
	do
	  {
	    mp_limb_t ti = t[--n];
	    int ndig_for_this_limb = 0;

#  if UDIV_TIME > 2 * UMUL_TIME
	    mp_limb_t base_multiplier = brec->base_multiplier;
	    if (brec->flag)
	      while (ti != 0)
		{
		  mp_limb_t quo, rem, x, dummy;

		  umul_ppmm (x, dummy, ti, base_multiplier);
		  quo = (x + ((ti - x) >> 1)) >> (brec->post_shift - 1);
		  rem = ti - quo * base;
		  *--buflim = digits[rem];
		  ti = quo;
		  ++ndig_for_this_limb;
		}
	    else
	      while (ti != 0)
		{
		  mp_limb_t quo, rem, x, dummy;

		  umul_ppmm (x, dummy, ti, base_multiplier);
		  quo = x >> brec->post_shift;
		  rem = ti - quo * base;
		  *--buflim = digits[rem];
		  ti = quo;
		  ++ndig_for_this_limb;
		}
#  else
	    while (ti != 0)
	      {
		mp_limb_t quo, rem;

		quo = ti / base;
		rem = ti % base;
		*--buflim = digits[rem];
		ti = quo;
		++ndig_for_this_limb;
	      }
#  endif
	    /* If this wasn't the most significant word, pad with zeros.  */
	    if (n != 0)
	      while (ndig_for_this_limb < brec->big.ndigits)
		{
		  *--buflim = '0';
		  ++ndig_for_this_limb;
		}
	  }
	while (n != 0);
# endif
	if (buflim == bufend)
	  *--buflim = '0';
      }
      break;
    }

  return buflim;
}
#endif

char *
_fitoa_word (unsigned long value, char *buf, unsigned int base, int upper_case)
{
  char tmpbuf[sizeof (value) * 4];	      /* Worst case length: base 2.  */
  char *cp = _itoa_word (value, tmpbuf + sizeof (value) * 4, base, upper_case);
  while (cp < tmpbuf + sizeof (value) * 4)
    *buf++ = *cp++;
  return buf;
}

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