big_normalization_steps);
brec->big.base_ninv);
_itoa (value, buflim, base, upper_case)     unsigned long long int value;     char *buflim;     unsigned int base;     int upper_case;{  const char *digits = upper_case ? _itoa_upper_digits : _itoa_lower_digits;  char *bp = buflim;  const struct base_table_t *brec = &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)	  \		    {							  \		      *--bp = 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);		  \		      *--bp = digits[work_lo];				  \		      work_hi >>= BITS - BITS_PER_MP_LIMB % BITS;	  \		    }							  \		}							  \	      else							  \		work_hi = value & 0xfffffffful;				  \	    }								  \	  do								  \	    {								  \	      *--bp = 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:      {#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;	      *--bp = 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;	      *--bp = 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,				   big_normalization_steps);		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,				   big_normalization_steps);		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;		  *--bp = 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;		  *--bp = digits[rem];		  ti = quo;		  ++ndig_for_this_limb;		}#else	    while (ti != 0)	      {		mp_limb_t quo, rem;		quo = ti / base;		rem = ti % base;		*--bp = 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)		{		  *--bp = '0';		  ++ndig_for_this_limb;		}	  }	while (n != 0);#endif      }      break;    }  return bp;}