/*    numeric.c
		 *
		 *    Copyright (C) 1993, 1994, 1995, 1996, 1997, 1998, 1999,
		 *    2000, 2001, 2002, 2003, 2005 by Larry Wall and others
		 *
		 *    You may distribute under the terms of either the GNU General Public
		 *    License or the Artistic License, as specified in the README file.
		 *
		 */
		
		/*
		 * "That only makes eleven (plus one mislaid) and not fourteen, unless
		 * wizards count differently to other people."
		 */
		
		/*
		=head1 Numeric functions
		
		This file contains all the stuff needed by perl for manipulating numeric
		values, including such things as replacements for the OS's atof() function
		
		=cut
		
		*/
		
		#include "EXTERN.h"
		#define PERL_IN_NUMERIC_C
		#include "perl.h"
		
		U32
		Perl_cast_ulong(pTHX_ NV f)
     3054316    {
     3054316      if (f < 0.0)
      ######        return f < I32_MIN ? (U32) I32_MIN : (U32)(I32) f;
     3054316      if (f < U32_MAX_P1) {
		#if CASTFLAGS & 2
		    if (f < U32_MAX_P1_HALF)
		      return (U32) f;
		    f -= U32_MAX_P1_HALF;
		    return ((U32) f) | (1 + U32_MAX >> 1);
		#else
     3054316        return (U32) f;
		#endif
		  }
      ######      return f > 0 ? U32_MAX : 0 /* NaN */;
		}
		
		I32
		Perl_cast_i32(pTHX_ NV f)
      ######    {
      ######      if (f < I32_MAX_P1)
      ######        return f < I32_MIN ? I32_MIN : (I32) f;
      ######      if (f < U32_MAX_P1) {
		#if CASTFLAGS & 2
		    if (f < U32_MAX_P1_HALF)
		      return (I32)(U32) f;
		    f -= U32_MAX_P1_HALF;
		    return (I32)(((U32) f) | (1 + U32_MAX >> 1));
		#else
      ######        return (I32)(U32) f;
		#endif
		  }
      ######      return f > 0 ? (I32)U32_MAX : 0 /* NaN */;
		}
		
		IV
		Perl_cast_iv(pTHX_ NV f)
     2890309    {
     2890309      if (f < IV_MAX_P1)
     2890309        return f < IV_MIN ? IV_MIN : (IV) f;
      ######      if (f < UV_MAX_P1) {
		#if CASTFLAGS & 2
		    /* For future flexibility allowing for sizeof(UV) >= sizeof(IV)  */
		    if (f < UV_MAX_P1_HALF)
		      return (IV)(UV) f;
		    f -= UV_MAX_P1_HALF;
		    return (IV)(((UV) f) | (1 + UV_MAX >> 1));
		#else
      ######        return (IV)(UV) f;
		#endif
		  }
      ######      return f > 0 ? (IV)UV_MAX : 0 /* NaN */;
		}
		
		UV
		Perl_cast_uv(pTHX_ NV f)
     1557195    {
     1557195      if (f < 0.0)
      ######        return f < IV_MIN ? (UV) IV_MIN : (UV)(IV) f;
     1557195      if (f < UV_MAX_P1) {
		#if CASTFLAGS & 2
		    if (f < UV_MAX_P1_HALF)
		      return (UV) f;
		    f -= UV_MAX_P1_HALF;
		    return ((UV) f) | (1 + UV_MAX >> 1);
		#else
      630024        return (UV) f;
		#endif
		  }
      927171      return f > 0 ? UV_MAX : 0 /* NaN */;
		}
		
		#if defined(HUGE_VAL) || (defined(USE_LONG_DOUBLE) && defined(HUGE_VALL))
		/*
		 * This hack is to force load of "huge" support from libm.a
		 * So it is in perl for (say) POSIX to use.
		 * Needed for SunOS with Sun's 'acc' for example.
		 */
		NV
		Perl_huge(void)
      ######    {
		#   if defined(USE_LONG_DOUBLE) && defined(HUGE_VALL)
		    return HUGE_VALL;
		#   endif
      ######        return HUGE_VAL;
		}
		#endif
		
		/*
		=for apidoc grok_bin
		
		converts a string representing a binary number to numeric form.
		
		On entry I<start> and I<*len> give the string to scan, I<*flags> gives
		conversion flags, and I<result> should be NULL or a pointer to an NV.
		The scan stops at the end of the string, or the first invalid character.
		Unless C<PERL_SCAN_SILENT_ILLDIGIT> is set in I<*flags>, encountering an
		invalid character will also trigger a warning.
		On return I<*len> is set to the length of the scanned string,
		and I<*flags> gives output flags.
		
		If the value is <= C<UV_MAX> it is returned as a UV, the output flags are clear,
		and nothing is written to I<*result>. If the value is > UV_MAX C<grok_bin>
		returns UV_MAX, sets C<PERL_SCAN_GREATER_THAN_UV_MAX> in the output flags,
		and writes the value to I<*result> (or the value is discarded if I<result>
		is NULL).
		
		The binary number may optionally be prefixed with "0b" or "b" unless
		C<PERL_SCAN_DISALLOW_PREFIX> is set in I<*flags> on entry. If
		C<PERL_SCAN_ALLOW_UNDERSCORES> is set in I<*flags> then the binary
		number may use '_' characters to separate digits.
		
		=cut
		 */
		
		UV
        1756    Perl_grok_bin(pTHX_ const char *start, STRLEN *len_p, I32 *flags, NV *result) {
        1756        const char *s = start;
        1756        STRLEN len = *len_p;
        1756        UV value = 0;
        1756        NV value_nv = 0;
		
        1756        const UV max_div_2 = UV_MAX / 2;
        1756        const bool allow_underscores = *flags & PERL_SCAN_ALLOW_UNDERSCORES;
        1756        bool overflowed = FALSE;
        1756        char bit;
		
        1756        if (!(*flags & PERL_SCAN_DISALLOW_PREFIX)) {
		        /* strip off leading b or 0b.
		           for compatibility silently suffer "b" and "0b" as valid binary
		           numbers. */
        1754            if (len >= 1) {
        1754                if (s[0] == 'b') {
        1754                    s++;
        1754                    len--;
		            }
      ######                else if (len >= 2 && s[0] == '0' && s[1] == 'b') {
      ######                    s+=2;
      ######                    len-=2;
		            }
		        }
		    }
		
       74092        for (; len-- && (bit = *s); s++) {
       36174            if (bit == '0' || bit == '1') {
		            /* Write it in this wonky order with a goto to attempt to get the
		               compiler to make the common case integer-only loop pretty tight.
		               With gcc seems to be much straighter code than old scan_bin.  */
		          redo:
       36168                if (!overflowed) {
       36072                    if (value <= max_div_2) {
       36067                        value = (value << 1) | (bit - '0');
       36067                        continue;
		                }
		                /* Bah. We're just overflowed.  */
           5                    if (ckWARN_d(WARN_OVERFLOW))
           2                        Perl_warner(aTHX_ packWARN(WARN_OVERFLOW),
		                                "Integer overflow in binary number");
           5                    overflowed = TRUE;
           5                    value_nv = (NV) value;
		            }
         101                value_nv *= 2.0;
			    /* If an NV has not enough bits in its mantissa to
			     * represent a UV this summing of small low-order numbers
			     * is a waste of time (because the NV cannot preserve
			     * the low-order bits anyway): we could just remember when
			     * did we overflow and in the end just multiply value_nv by the
			     * right amount. */
         101                value_nv += (NV)(bit - '0');
         101                continue;
		        }
          24            if (bit == '_' && len && allow_underscores && (bit = s[1])
		            && (bit == '0' || bit == '1'))
			    {
          18    		--len;
          18    		++s;
          18                    goto redo;
			    }
           6            if (!(*flags & PERL_SCAN_SILENT_ILLDIGIT) && ckWARN(WARN_DIGIT))
           2                Perl_warner(aTHX_ packWARN(WARN_DIGIT),
		                        "Illegal binary digit '%c' ignored", *s);
           2            break;
		    }
		    
        1756        if (   ( overflowed && value_nv > 4294967295.0)
		#if UVSIZE > 4
			|| (!overflowed && value > 0xffffffff  )
		#endif
			) {
           5    	if (ckWARN(WARN_PORTABLE))
           2    	    Perl_warner(aTHX_ packWARN(WARN_PORTABLE),
					"Binary number > 0b11111111111111111111111111111111 non-portable");
		    }
        1756        *len_p = s - start;
        1756        if (!overflowed) {
        1751            *flags = 0;
        1751            return value;
		    }
           5        *flags = PERL_SCAN_GREATER_THAN_UV_MAX;
           5        if (result)
           5            *result = value_nv;
           5        return UV_MAX;
		}
		
		/*
		=for apidoc grok_hex
		
		converts a string representing a hex number to numeric form.
		
		On entry I<start> and I<*len> give the string to scan, I<*flags> gives
		conversion flags, and I<result> should be NULL or a pointer to an NV.
		The scan stops at the end of the string, or the first invalid character.
		Unless C<PERL_SCAN_SILENT_ILLDIGIT> is set in I<*flags>, encountering an
		invalid character will also trigger a warning.
		On return I<*len> is set to the length of the scanned string,
		and I<*flags> gives output flags.
		
		If the value is <= UV_MAX it is returned as a UV, the output flags are clear,
		and nothing is written to I<*result>. If the value is > UV_MAX C<grok_hex>
		returns UV_MAX, sets C<PERL_SCAN_GREATER_THAN_UV_MAX> in the output flags,
		and writes the value to I<*result> (or the value is discarded if I<result>
		is NULL).
		
		The hex number may optionally be prefixed with "0x" or "x" unless
		C<PERL_SCAN_DISALLOW_PREFIX> is set in I<*flags> on entry. If
		C<PERL_SCAN_ALLOW_UNDERSCORES> is set in I<*flags> then the hex
		number may use '_' characters to separate digits.
		
		=cut
		 */
		
		UV
     4480988    Perl_grok_hex(pTHX_ const char *start, STRLEN *len_p, I32 *flags, NV *result) {
		    dVAR;
     4480988        const char *s = start;
     4480988        STRLEN len = *len_p;
     4480988        UV value = 0;
     4480988        NV value_nv = 0;
		
     4480988        const UV max_div_16 = UV_MAX / 16;
     4480988        const bool allow_underscores = *flags & PERL_SCAN_ALLOW_UNDERSCORES;
     4480988        bool overflowed = FALSE;
		
     4480988        if (!(*flags & PERL_SCAN_DISALLOW_PREFIX)) {
		        /* strip off leading x or 0x.
		           for compatibility silently suffer "x" and "0x" as valid hex numbers.
		        */
     1901808            if (len >= 1) {
     1883629                if (s[0] == 'x') {
         253                    s++;
         253                    len--;
		            }
     1883376                else if (len >= 2 && s[0] == '0' && s[1] == 'x') {
          19                    s+=2;
          19                    len-=2;
		            }
		        }
		    }
		
    27961410        for (; len-- && *s; s++) {
    11740282    	const char *hexdigit = strchr(PL_hexdigit, *s);
    11740282            if (hexdigit) {
		            /* Write it in this wonky order with a goto to attempt to get the
		               compiler to make the common case integer-only loop pretty tight.
		               With gcc seems to be much straighter code than old scan_hex.  */
		          redo:
    11740211                if (!overflowed) {
    11740125                    if (value <= max_div_16) {
    11740113                        value = (value << 4) | ((hexdigit - PL_hexdigit) & 15);
    11740113                        continue;
		                }
		                /* Bah. We're just overflowed.  */
          12                    if (ckWARN_d(WARN_OVERFLOW))
           4                        Perl_warner(aTHX_ packWARN(WARN_OVERFLOW),
		                                "Integer overflow in hexadecimal number");
          12                    overflowed = TRUE;
          12                    value_nv = (NV) value;
		            }
          98                value_nv *= 16.0;
			    /* If an NV has not enough bits in its mantissa to
			     * represent a UV this summing of small low-order numbers
			     * is a waste of time (because the NV cannot preserve
			     * the low-order bits anyway): we could just remember when
			     * did we overflow and in the end just multiply value_nv by the
			     * right amount of 16-tuples. */
          98                value_nv += (NV)((hexdigit - PL_hexdigit) & 15);
          98                continue;
		        }
         108            if (*s == '_' && len && allow_underscores && s[1]
				&& (hexdigit = strchr(PL_hexdigit, s[1])))
			    {
          37    		--len;
          37    		++s;
          37                    goto redo;
			    }
          71            if (!(*flags & PERL_SCAN_SILENT_ILLDIGIT) && ckWARN(WARN_DIGIT))
           4                Perl_warner(aTHX_ packWARN(WARN_DIGIT),
		                        "Illegal hexadecimal digit '%c' ignored", *s);
           4            break;
		    }
		    
     4480988        if (   ( overflowed && value_nv > 4294967295.0)
		#if UVSIZE > 4
			|| (!overflowed && value > 0xffffffff  )
		#endif
			) {
          12    	if (ckWARN(WARN_PORTABLE))
           4    	    Perl_warner(aTHX_ packWARN(WARN_PORTABLE),
					"Hexadecimal number > 0xffffffff non-portable");
		    }
     4480988        *len_p = s - start;
     4480988        if (!overflowed) {
     4480976            *flags = 0;
     4480976            return value;
		    }
          12        *flags = PERL_SCAN_GREATER_THAN_UV_MAX;
          12        if (result)
          12            *result = value_nv;
          12        return UV_MAX;
		}
		
		/*
		=for apidoc grok_oct
		
		converts a string representing an octal number to numeric form.
		
		On entry I<start> and I<*len> give the string to scan, I<*flags> gives
		conversion flags, and I<result> should be NULL or a pointer to an NV.
		The scan stops at the end of the string, or the first invalid character.
		Unless C<PERL_SCAN_SILENT_ILLDIGIT> is set in I<*flags>, encountering an
		invalid character will also trigger a warning.
		On return I<*len> is set to the length of the scanned string,
		and I<*flags> gives output flags.
		
		If the value is <= UV_MAX it is returned as a UV, the output flags are clear,
		and nothing is written to I<*result>. If the value is > UV_MAX C<grok_oct>
		returns UV_MAX, sets C<PERL_SCAN_GREATER_THAN_UV_MAX> in the output flags,
		and writes the value to I<*result> (or the value is discarded if I<result>
		is NULL).
		
		If C<PERL_SCAN_ALLOW_UNDERSCORES> is set in I<*flags> then the octal
		number may use '_' characters to separate digits.
		
		=cut
		 */
		
		UV
       38960    Perl_grok_oct(pTHX_ const char *start, STRLEN *len_p, I32 *flags, NV *result) {
       38960        const char *s = start;
       38960        STRLEN len = *len_p;
       38960        UV value = 0;
       38960        NV value_nv = 0;
		
       38960        const UV max_div_8 = UV_MAX / 8;
       38960        const bool allow_underscores = *flags & PERL_SCAN_ALLOW_UNDERSCORES;
       38960        bool overflowed = FALSE;
		
      148408        for (; len-- && *s; s++) {
		         /* gcc 2.95 optimiser not smart enough to figure that this subtraction
		            out front allows slicker code.  */
       81435            int digit = *s - '0';
       81435            if (digit >= 0 && digit <= 7) {
		            /* Write it in this wonky order with a goto to attempt to get the
		               compiler to make the common case integer-only loop pretty tight.
		            */
		          redo:
       54724                if (!overflowed) {
       54538                    if (value <= max_div_8) {
       54528                        value = (value << 3) | digit;
       54528                        continue;
		                }
		                /* Bah. We're just overflowed.  */
          10                    if (ckWARN_d(WARN_OVERFLOW))
           5                        Perl_warner(aTHX_ packWARN(WARN_OVERFLOW),
		                                "Integer overflow in octal number");
          10                    overflowed = TRUE;
          10                    value_nv = (NV) value;
		            }
         196                value_nv *= 8.0;
			    /* If an NV has not enough bits in its mantissa to
			     * represent a UV this summing of small low-order numbers
			     * is a waste of time (because the NV cannot preserve
			     * the low-order bits anyway): we could just remember when
			     * did we overflow and in the end just multiply value_nv by the
			     * right amount of 8-tuples. */
         196                value_nv += (NV)digit;
         196                continue;
		        }
       26717            if (digit == ('_' - '0') && len && allow_underscores
		            && (digit = s[1] - '0') && (digit >= 0 && digit <= 7))
			    {
           6    		--len;
           6    		++s;
           6                    goto redo;
			    }
		        /* Allow \octal to work the DWIM way (that is, stop scanning
		         * as soon as non-octal characters are seen, complain only if
		         * someone seems to want to use the digits eight and nine). */
       26711            if (digit == 8 || digit == 9) {
           8                if (!(*flags & PERL_SCAN_SILENT_ILLDIGIT) && ckWARN(WARN_DIGIT))
           4                    Perl_warner(aTHX_ packWARN(WARN_DIGIT),
		                            "Illegal octal digit '%c' ignored", *s);
		        }
           4            break;
		    }
		    
       38960        if (   ( overflowed && value_nv > 4294967295.0)
		#if UVSIZE > 4
			|| (!overflowed && value > 0xffffffff  )
		#endif
			) {
          10    	if (ckWARN(WARN_PORTABLE))
           4    	    Perl_warner(aTHX_ packWARN(WARN_PORTABLE),
					"Octal number > 037777777777 non-portable");
		    }
       38960        *len_p = s - start;
       38960        if (!overflowed) {
       38950            *flags = 0;
       38950            return value;
		    }
          10        *flags = PERL_SCAN_GREATER_THAN_UV_MAX;
          10        if (result)
          10            *result = value_nv;
          10        return UV_MAX;
		}
		
		/*
		=for apidoc scan_bin
		
		For backwards compatibility. Use C<grok_bin> instead.
		
		=for apidoc scan_hex
		
		For backwards compatibility. Use C<grok_hex> instead.
		
		=for apidoc scan_oct
		
		For backwards compatibility. Use C<grok_oct> instead.
		
		=cut
		 */
		
		NV
		Perl_scan_bin(pTHX_ const char *start, STRLEN len, STRLEN *retlen)
      ######    {
      ######        NV rnv;
      ######        I32 flags = *retlen ? PERL_SCAN_ALLOW_UNDERSCORES : 0;
      ######        const UV ruv = grok_bin (start, &len, &flags, &rnv);
		
      ######        *retlen = len;
      ######        return (flags & PERL_SCAN_GREATER_THAN_UV_MAX) ? rnv : (NV)ruv;
		}
		
		NV
		Perl_scan_oct(pTHX_ const char *start, STRLEN len, STRLEN *retlen)
      ######    {
      ######        NV rnv;
      ######        I32 flags = *retlen ? PERL_SCAN_ALLOW_UNDERSCORES : 0;
      ######        const UV ruv = grok_oct (start, &len, &flags, &rnv);
		
      ######        *retlen = len;
      ######        return (flags & PERL_SCAN_GREATER_THAN_UV_MAX) ? rnv : (NV)ruv;
		}
		
		NV
		Perl_scan_hex(pTHX_ const char *start, STRLEN len, STRLEN *retlen)
      ######    {
      ######        NV rnv;
      ######        I32 flags = *retlen ? PERL_SCAN_ALLOW_UNDERSCORES : 0;
      ######        const UV ruv = grok_hex (start, &len, &flags, &rnv);
		
      ######        *retlen = len;
      ######        return (flags & PERL_SCAN_GREATER_THAN_UV_MAX) ? rnv : (NV)ruv;
		}
		
		/*
		=for apidoc grok_numeric_radix
		
		Scan and skip for a numeric decimal separator (radix).
		
		=cut
		 */
		bool
		Perl_grok_numeric_radix(pTHX_ const char **sp, const char *send)
     1457546    {
		#ifdef USE_LOCALE_NUMERIC
     1457546        if (PL_numeric_radix_sv && IN_LOCALE) { 
        2312            STRLEN len;
        2312            const char* radix = SvPV(PL_numeric_radix_sv, len);
        2312            if (*sp + len <= send && memEQ(*sp, radix, len)) {
        1734                *sp += len;
        1734                return TRUE; 
		        }
		    }
		    /* always try "." if numeric radix didn't match because
		     * we may have data from different locales mixed */
		#endif
     1455812        if (*sp < send && **sp == '.') {
       26682            ++*sp;
       26682            return TRUE;
		    }
     1429130        return FALSE;
		}
		
		/*
		=for apidoc grok_number
		
		Recognise (or not) a number.  The type of the number is returned
		(0 if unrecognised), otherwise it is a bit-ORed combination of
		IS_NUMBER_IN_UV, IS_NUMBER_GREATER_THAN_UV_MAX, IS_NUMBER_NOT_INT,
		IS_NUMBER_NEG, IS_NUMBER_INFINITY, IS_NUMBER_NAN (defined in perl.h).
		
		If the value of the number can fit an in UV, it is returned in the *valuep
		IS_NUMBER_IN_UV will be set to indicate that *valuep is valid, IS_NUMBER_IN_UV
		will never be set unless *valuep is valid, but *valuep may have been assigned
		to during processing even though IS_NUMBER_IN_UV is not set on return.
		If valuep is NULL, IS_NUMBER_IN_UV will be set for the same cases as when
		valuep is non-NULL, but no actual assignment (or SEGV) will occur.
		
		IS_NUMBER_NOT_INT will be set with IS_NUMBER_IN_UV if trailing decimals were
		seen (in which case *valuep gives the true value truncated to an integer), and
		IS_NUMBER_NEG if the number is negative (in which case *valuep holds the
		absolute value).  IS_NUMBER_IN_UV is not set if e notation was used or the
		number is larger than a UV.
		
		=cut
		 */
		int
		Perl_grok_number(pTHX_ const char *pv, STRLEN len, UV *valuep)
     1421022    {
     1421022      const char *s = pv;
     1421022      const char *send = pv + len;
     1421022      const UV max_div_10 = UV_MAX / 10;
     1421022      const char max_mod_10 = UV_MAX % 10;
     1421022      int numtype = 0;
     1421022      int sawinf = 0;
     1421022      int sawnan = 0;
		
     1421164      while (s < send && isSPACE(*s))
         142        s++;
     1421022      if (s == send) {
        5021        return 0;
     1416001      } else if (*s == '-') {
       23751        s++;
       23751        numtype = IS_NUMBER_NEG;
		  }
     1392250      else if (*s == '+')
         714      s++;
		
     1416001      if (s == send)
      ######        return 0;
		
		  /* next must be digit or the radix separator or beginning of infinity */
     1416001      if (isDIGIT(*s)) {
		    /* UVs are at least 32 bits, so the first 9 decimal digits cannot
		       overflow.  */
     1413061        UV value = *s - '0';
		    /* This construction seems to be more optimiser friendly.
		       (without it gcc does the isDIGIT test and the *s - '0' separately)
		       With it gcc on arm is managing 6 instructions (6 cycles) per digit.
		       In theory the optimiser could deduce how far to unroll the loop
		       before checking for overflow.  */
     1413061        if (++s < send) {
      648375          int digit = *s - '0';
      648375          if (digit >= 0 && digit <= 9) {
      644532            value = value * 10 + digit;
      644532            if (++s < send) {
      449662              digit = *s - '0';
      449662              if (digit >= 0 && digit <= 9) {
      449587                value = value * 10 + digit;
      449587                if (++s < send) {
      308545                  digit = *s - '0';
      308545                  if (digit >= 0 && digit <= 9) {
      308527                    value = value * 10 + digit;
      308527    		if (++s < send) {
      181676                      digit = *s - '0';
      181676                      if (digit >= 0 && digit <= 9) {
      181667                        value = value * 10 + digit;
      181667                        if (++s < send) {
      155298                          digit = *s - '0';
      155298                          if (digit >= 0 && digit <= 9) {
      155298                            value = value * 10 + digit;
      155298                            if (++s < send) {
      148771                              digit = *s - '0';
      148771                              if (digit >= 0 && digit <= 9) {
      148771                                value = value * 10 + digit;
      148771                                if (++s < send) {
       39165                                  digit = *s - '0';
       39165                                  if (digit >= 0 && digit <= 9) {
       39157                                    value = value * 10 + digit;
       39157                                    if (++s < send) {
       38972                                      digit = *s - '0';
       38972                                      if (digit >= 0 && digit <= 9) {
       38970                                        value = value * 10 + digit;
       38970                                        if (++s < send) {
		                                      /* Now got 9 digits, so need to check
		                                         each time for overflow.  */
       32535                                          digit = *s - '0';
       32586                                          while (digit >= 0 && digit <= 9
		                                             && (value < max_div_10
		                                                 || (value == max_div_10
		                                                     && digit <= max_mod_10))) {
       26296                                            value = value * 10 + digit;
       26296                                            if (++s < send)
          51                                              digit = *s - '0';
		                                        else
       32535                                              break;
		                                      }
       32535                                          if (digit >= 0 && digit <= 9
		                                          && (s < send)) {
		                                        /* value overflowed.
		                                           skip the remaining digits, don't
		                                           worry about setting *valuep.  */
        6915                                            do {
        6915                                              s++;
        6915                                            } while (s < send && isDIGIT(*s));
        6283                                            numtype |=
		                                          IS_NUMBER_GREATER_THAN_UV_MAX;
        6283                                            goto skip_value;
		                                      }
		                                    }
		                                  }
						}
		                              }
		                            }
		                          }
		                        }
		                      }
		                    }
		                  }
		                }
		              }
		            }
		          }
			}
		      }
		    }
     1406778        numtype |= IS_NUMBER_IN_UV;
     1406778        if (valuep)
     1404761          *valuep = value;
		
		  skip_value:
     1413061        if (GROK_NUMERIC_RADIX(&s, send)) {
        3466          numtype |= IS_NUMBER_NOT_INT;
       14775          while (s < send && isDIGIT(*s))  /* optional digits after the radix */
       11309            s++;
		    }
		  }
        2940      else if (GROK_NUMERIC_RADIX(&s, send)) {
           8        numtype |= IS_NUMBER_NOT_INT | IS_NUMBER_IN_UV; /* valuep assigned below */
		    /* no digits before the radix means we need digits after it */
           8        if (s < send && isDIGIT(*s)) {
          10          do {
          10            s++;
          10          } while (s < send && isDIGIT(*s));
           6          if (valuep) {
		        /* integer approximation is valid - it's 0.  */
           6            *valuep = 0;
		      }
		    }
		    else
           2          return 0;
        2932      } else if (*s == 'I' || *s == 'i') {
          43        s++; if (s == send || (*s != 'N' && *s != 'n')) return 0;
          26        s++; if (s == send || (*s != 'F' && *s != 'f')) return 0;
           4        s++; if (s < send && (*s == 'I' || *s == 'i')) {
           1          s++; if (s == send || (*s != 'N' && *s != 'n')) return 0;
           1          s++; if (s == send || (*s != 'I' && *s != 'i')) return 0;
           1          s++; if (s == send || (*s != 'T' && *s != 't')) return 0;
           1          s++; if (s == send || (*s != 'Y' && *s != 'y')) return 0;
           1          s++;
		    }
           4        sawinf = 1;
        2889      } else if (*s == 'N' || *s == 'n') {
		    /* XXX TODO: There are signaling NaNs and quiet NaNs. */
         587        s++; if (s == send || (*s != 'A' && *s != 'a')) return 0;
         279        s++; if (s == send || (*s != 'N' && *s != 'n')) return 0;
         273        s++;
         273        sawnan = 1;
		  } else
        2302        return 0;
		
     1413344      if (sawinf) {
           4        numtype &= IS_NUMBER_NEG; /* Keep track of sign  */
           4        numtype |= IS_NUMBER_INFINITY | IS_NUMBER_NOT_INT;
     1413340      } else if (sawnan) {
         273        numtype &= IS_NUMBER_NEG; /* Keep track of sign  */
         273        numtype |= IS_NUMBER_NAN | IS_NUMBER_NOT_INT;
     1413067      } else if (s < send) {
		    /* we can have an optional exponent part */
         514        if (*s == 'e' || *s == 'E') {
		      /* The only flag we keep is sign.  Blow away any "it's UV"  */
         339          numtype &= IS_NUMBER_NEG;
         339          numtype |= IS_NUMBER_NOT_INT;
         339          s++;
         339          if (s < send && (*s == '-' || *s == '+'))
         143            s++;
         339          if (s < send && isDIGIT(*s)) {
         341            do {
         341              s++;
         341            } while (s < send && isDIGIT(*s));
		      }
		      else
      ######          return 0;
		    }
		  }
     1413551      while (s < send && isSPACE(*s))
         207        s++;
     1413344      if (s >= send)
     1413270        return numtype;
          74      if (len == 10 && memEQ(pv, "0 but true", 10)) {
           7        if (valuep)
           7          *valuep = 0;
           7        return IS_NUMBER_IN_UV;
		  }
          67      return 0;
		}
		
		STATIC NV
		S_mulexp10(NV value, I32 exponent)
      139807    {
      139807        NV result = 1.0;
      139807        NV power = 10.0;
      139807        bool negative = 0;
      139807        I32 bit;
		
      139807        if (exponent == 0)
       66488    	return value;
       73319        if (value == 0)
       41531    	return (NV)0;
		
		    /* On OpenVMS VAX we by default use the D_FLOAT double format,
		     * and that format does not have *easy* capabilities [1] for
		     * overflowing doubles 'silently' as IEEE fp does.  We also need 
		     * to support G_FLOAT on both VAX and Alpha, and though the exponent 
		     * range is much larger than D_FLOAT it still doesn't do silent 
		     * overflow.  Therefore we need to detect early whether we would 
		     * overflow (this is the behaviour of the native string-to-float 
		     * conversion routines, and therefore of native applications, too).
		     *
		     * [1] Trying to establish a condition handler to trap floating point
		     *     exceptions is not a good idea. */
		
		    /* In UNICOS and in certain Cray models (such as T90) there is no
		     * IEEE fp, and no way at all from C to catch fp overflows gracefully.
		     * There is something you can do if you are willing to use some
		     * inline assembler: the instruction is called DFI-- but that will
		     * disable *all* floating point interrupts, a little bit too large
		     * a hammer.  Therefore we need to catch potential overflows before
		     * it's too late. */
		
		#if ((defined(VMS) && !defined(__IEEE_FP)) || defined(_UNICOS)) && defined(NV_MAX_10_EXP)
		    STMT_START {
			NV exp_v = log10(value);
			if (exponent >= NV_MAX_10_EXP || exponent + exp_v >= NV_MAX_10_EXP)
			    return NV_MAX;
			if (exponent < 0) {
			    if (-(exponent + exp_v) >= NV_MAX_10_EXP)
				return 0.0;
			    while (-exponent >= NV_MAX_10_EXP) {
				/* combination does not overflow, but 10^(-exponent) does */
				value /= 10;
				++exponent;
			    }
			}
		    } STMT_END;
		#endif
		
       31788        if (exponent < 0) {
       24583    	negative = 1;
       24583    	exponent = -exponent;
		    }
       63626        for (bit = 1; exponent; bit <<= 1) {
       63626    	if (exponent & bit) {
       49163    	    exponent ^= bit;
       49163    	    result *= power;
			    /* Floating point exceptions are supposed to be turned off,
			     *  but if we're obviously done, don't risk another iteration.  
			     */
       49163    	     if (exponent == 0) break;
			}
       31838    	power *= power;
		    }
       31788        return negative ? value / result : value * result;
		}
		
		NV
		Perl_my_atof(pTHX_ const char* s)
       39514    {
       39514        NV x = 0.0;
		#ifdef USE_LOCALE_NUMERIC
       39514        if (PL_numeric_local && IN_LOCALE) {
        2031    	NV y;
		
			/* Scan the number twice; once using locale and once without;
			 * choose the larger result (in absolute value). */
        2031    	Perl_atof2(s, x);
        2031    	SET_NUMERIC_STANDARD();
        2031    	Perl_atof2(s, y);
        2031    	SET_NUMERIC_LOCAL();
        2031    	if ((y < 0.0 && y < x) || (y > 0.0 && y > x))
      ######    	    return y;
		    }
		    else
       37483    	Perl_atof2(s, x);
		#else
		    Perl_atof2(s, x);
		#endif
       39514        return x;
		}
		
		char*
		Perl_my_atof2(pTHX_ const char* orig, NV* value)
       41545    {
       41545        NV result[3] = {0.0, 0.0, 0.0};
       41545        const char* s = orig;
		#ifdef USE_PERL_ATOF
       41545        UV accumulator[2] = {0,0};	/* before/after dp */
       41545        bool negative = 0;
       41545        const char* send = s + strlen(orig) - 1;
       41545        bool seen_digit = 0;
       41545        I32 exp_adjust[2] = {0,0};
       41545        I32 exp_acc[2] = {-1, -1};
		    /* the current exponent adjust for the accumulators */
       41545        I32 exponent = 0;
       41545        I32	seen_dp  = 0;
       41545        I32 digit = 0;
       41545        I32 old_digit = 0;
       41545        I32 sig_digits = 0; /* noof significant digits seen so far */
		
		/* There is no point in processing more significant digits
		 * than the NV can hold. Note that NV_DIG is a lower-bound value,
		 * while we need an upper-bound value. We add 2 to account for this;
		 * since it will have been conservative on both the first and last digit.
		 * For example a 32-bit mantissa with an exponent of 4 would have
		 * exact values in the set
		 *               4
		 *               8
		 *              ..
		 *     17179869172
		 *     17179869176
		 *     17179869180
		 *
		 * where for the purposes of calculating NV_DIG we would have to discount
		 * both the first and last digit, since neither can hold all values from
		 * 0..9; but for calculating the value we must examine those two digits.
		 */
		#define MAX_SIG_DIGITS (NV_DIG+2)
		
		/* the max number we can accumulate in a UV, and still safely do 10*N+9 */
		#define MAX_ACCUMULATE ( (UV) ((UV_MAX - 9)/10))
		
		    /* leading whitespace */
       41665        while (isSPACE(*s))
         120    	++s;
		
		    /* sign */
       41545        switch (*s) {
			case '-':
        3314    	    negative = 1;
			    /* fall through */
			case '+':
        3343    	    ++s;
		    }
		
		    /* we accumulate digits into an integer; when this becomes too
		     * large, we add the total to NV and start again */
		
      238499        while (1) {
      238499    	if (isDIGIT(*s)) {
      172012    	    seen_digit = 1;
      172012    	    old_digit = digit;
      172012    	    digit = *s++ - '0';
      172012    	    if (seen_dp)
       78811    		exp_adjust[1]++;
		
			    /* don't start counting until we see the first significant
			     * digit, eg the 5 in 0.00005... */
      172012    	    if (!sig_digits && digit == 0)
        4972    		continue;
		
      167040    	    if (++sig_digits > MAX_SIG_DIGITS) {
				/* limits of precision reached */
          33    	        if (digit > 5) {
          11    		    ++accumulator[seen_dp];
          22    		} else if (digit == 5) {
           2    		    if (old_digit % 2) { /* round to even - Allen */
           1    			++accumulator[seen_dp];
				    }
				}
          33    		if (seen_dp) {
           9    		    exp_adjust[1]--;
				} else {
          24    		    exp_adjust[0]++;
				}
				/* skip remaining digits */
         516    		while (isDIGIT(*s)) {
         483    		    ++s;
         483    		    if (! seen_dp) {
         354    			exp_adjust[0]++;
				    }
				}
				/* warn of loss of precision? */
			    }
			    else {
      167007    		if (accumulator[seen_dp] > MAX_ACCUMULATE) {
				    /* add accumulator to result and start again */
        6833    		    result[seen_dp] = S_mulexp10(result[seen_dp],
								 exp_acc[seen_dp])
					+ (NV)accumulator[seen_dp];
        6833    		    accumulator[seen_dp] = 0;
        6833    		    exp_acc[seen_dp] = 0;
				}
      167007    		accumulator[seen_dp] = accumulator[seen_dp] * 10 + digit;
      167007    		++exp_acc[seen_dp];
			    }
			}
       66487    	else if (!seen_dp && GROK_NUMERIC_RADIX(&s, send)) {
       24942    	    seen_dp = 1;
       24942    	    if (sig_digits > MAX_SIG_DIGITS) {
      ######    		++s;
      ######    		while (isDIGIT(*s)) {
      ######    		    ++s;
				}
       41545    		break;
			    }
			}
			else {
       41545    	    break;
			}
		    }
		
       41545        result[0] = S_mulexp10(result[0], exp_acc[0]) + (NV)accumulator[0];
       41545        if (seen_dp) {
       24942    	result[1] = S_mulexp10(result[1], exp_acc[1]) + (NV)accumulator[1];
		    }
		
       41545        if (seen_digit && (*s == 'e' || *s == 'E')) {
        1084    	bool expnegative = 0;
		
        1084    	++s;
        1084    	switch (*s) {
			    case '-':
         749    		expnegative = 1;
				/* fall through */
			    case '+':
         770    		++s;
			}
        2844    	while (isDIGIT(*s))
        1760    	    exponent = exponent * 10 + (*s++ - '0');
        1084    	if (expnegative)
         749    	    exponent = -exponent;
		    }
		
		
		
		    /* now apply the exponent */
		
       41545        if (seen_dp) {
       24942    	result[2] = S_mulexp10(result[0],exponent+exp_adjust[0])
				+ S_mulexp10(result[1],exponent-exp_adjust[1]);
		    } else {
       16603    	result[2] = S_mulexp10(result[0],exponent+exp_adjust[0]);
		    }
		
		    /* now apply the sign */
       41545        if (negative)
        3314    	result[2] = -result[2];
		#endif /* USE_PERL_ATOF */
       41545        *value = result[2];
       41545        return (char *)s;
		}
		
		#if ! defined(HAS_MODFL) && defined(HAS_AINTL) && defined(HAS_COPYSIGNL)
		long double
		Perl_my_modfl(long double x, long double *ip)
		{
			*ip = aintl(x);
			return (x == *ip ? copysignl(0.0L, x) : x - *ip);
		}
		#endif
		
		#if ! defined(HAS_FREXPL) && defined(HAS_ILOGBL) && defined(HAS_SCALBNL)
		long double
		Perl_my_frexpl(long double x, int *e) {
			*e = x == 0.0L ? 0 : ilogbl(x) + 1;
			return (scalbnl(x, -*e));
		}
		#endif
		
		/*
		 * Local variables:
		 * c-indentation-style: bsd
		 * c-basic-offset: 4
		 * indent-tabs-mode: t
		 * End:
		 *
		 * ex: set ts=8 sts=4 sw=4 noet:
		 */