Remove obsolete V8_INFINITY macro.

src/strtod.cc

 // Copyright 2012 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-#include <stdarg.h>
 #include <cmath>
+#include <cstdarg>
+#include <limits>
 
 #include "src/v8.h"
 
 #include "src/bignum.h"
 #include "src/cached-powers.h"
 #include "src/double.h"
 #include "src/globals.h"
 #include "src/strtod.h"
 #include "src/utils.h"
 
@@ skipping 328 matching lines @@
 // Returns the correct double for the buffer*10^exponent.
 // The variable guess should be a close guess that is either the correct double
 // or its lower neighbor (the nearest double less than the correct one).
 // Preconditions:
 //   buffer.length() + exponent <= kMaxDecimalPower + 1
 //   buffer.length() + exponent > kMinDecimalPower
 //   buffer.length() <= kMaxDecimalSignificantDigits
 static double BignumStrtod(Vector<const char> buffer,
                            int exponent,
                            double guess) {
-  if (guess == V8_INFINITY) {
+  if (guess == std::numeric_limits<double>::infinity()) {
     return guess;
   }
 
   DiyFp upper_boundary = Double(guess).UpperBoundary();
 
   DCHECK(buffer.length() + exponent <= kMaxDecimalPower + 1);
   DCHECK(buffer.length() + exponent > kMinDecimalPower);
   DCHECK(buffer.length() <= kMaxSignificantDecimalDigits);
   // Make sure that the Bignum will be able to hold all our numbers.
   // Our Bignum implementation has a separate field for exponents. Shifts will
@@ skipping 35 matching lines @@
   if (trimmed.length() == 0) return 0.0;
   if (trimmed.length() > kMaxSignificantDecimalDigits) {
     char significant_buffer[kMaxSignificantDecimalDigits];
     int significant_exponent;
     TrimToMaxSignificantDigits(trimmed, exponent,
                                significant_buffer, &significant_exponent);
     return Strtod(Vector<const char>(significant_buffer,
                                      kMaxSignificantDecimalDigits),
                   significant_exponent);
   }
-  if (exponent + trimmed.length() - 1 >= kMaxDecimalPower) return V8_INFINITY;
+  if (exponent + trimmed.length() - 1 >= kMaxDecimalPower) {
+    return std::numeric_limits<double>::infinity();
+  }
   if (exponent + trimmed.length() <= kMinDecimalPower) return 0.0;
 
   double guess;
   if (DoubleStrtod(trimmed, exponent, &guess) ||
       DiyFpStrtod(trimmed, exponent, &guess)) {
     return guess;
   }
   return BignumStrtod(trimmed, exponent, guess);
 }
 
 } }  // namespace v8::internal