Rename ASSERT* to DCHECK*.

src/fast-dtoa.cc

 // Copyright 2011 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 "include/v8stdint.h"
 #include "src/base/logging.h"
 #include "src/utils.h"
 
 #include "src/fast-dtoa.h"
 
@@ skipping 102 matching lines @@
   // There are 3 conditions that stop the decrementation process:
   //   1) the buffer is already below w_high
   //   2) decrementing the buffer would make it leave the unsafe interval
   //   3) decrementing the buffer would yield a number below w_high and farther
   //      away than the current number. In other words:
   //              (buffer{-1} < w_high) && w_high - buffer{-1} > buffer - w_high
   // Instead of using the buffer directly we use its distance to too_high.
   // Conceptually rest ~= too_high - buffer
   // We need to do the following tests in this order to avoid over- and
   // underflows.
-  ASSERT(rest <= unsafe_interval);
+  DCHECK(rest <= unsafe_interval);
   while (rest < small_distance &&  // Negated condition 1
          unsafe_interval - rest >= ten_kappa &&  // Negated condition 2
          (rest + ten_kappa < small_distance ||  // buffer{-1} > w_high
           small_distance - rest >= rest + ten_kappa - small_distance)) {
     buffer[length - 1]--;
     rest += ten_kappa;
   }
 
   // We have approached w+ as much as possible. We now test if approaching w-
   // would require changing the buffer. If yes, then we have two possible
@@ skipping 25 matching lines @@
 // imprecision and returns false, if the rounding direction cannot be
 // unambiguously determined.
 //
 // Precondition: rest < ten_kappa.
 static bool RoundWeedCounted(Vector<char> buffer,
                              int length,
                              uint64_t rest,
                              uint64_t ten_kappa,
                              uint64_t unit,
                              int* kappa) {
-  ASSERT(rest < ten_kappa);
+  DCHECK(rest < ten_kappa);
   // The following tests are done in a specific order to avoid overflows. They
   // will work correctly with any uint64 values of rest < ten_kappa and unit.
   //
   // If the unit is too big, then we don't know which way to round. For example
   // a unit of 50 means that the real number lies within rest +/- 50. If
   // 10^kappa == 40 then there is no way to tell which way to round.
   if (unit >= ten_kappa) return false;
   // Even if unit is just half the size of 10^kappa we are already completely
   // lost. (And after the previous test we know that the expression will not
   // over/underflow.)
@@ skipping 178 matching lines @@
 // once we have enough digits. That is, once the digits inside the buffer
 // represent 'w' we can stop. Everything inside the interval low - high
 // represents w. However we have to pay attention to low, high and w's
 // imprecision.
 static bool DigitGen(DiyFp low,
                      DiyFp w,
                      DiyFp high,
                      Vector<char> buffer,
                      int* length,
                      int* kappa) {
-  ASSERT(low.e() == w.e() && w.e() == high.e());
-  ASSERT(low.f() + 1 <= high.f() - 1);
-  ASSERT(kMinimalTargetExponent <= w.e() && w.e() <= kMaximalTargetExponent);
+  DCHECK(low.e() == w.e() && w.e() == high.e());
+  DCHECK(low.f() + 1 <= high.f() - 1);
+  DCHECK(kMinimalTargetExponent <= w.e() && w.e() <= kMaximalTargetExponent);
   // low, w and high are imprecise, but by less than one ulp (unit in the last
   // place).
   // If we remove (resp. add) 1 ulp from low (resp. high) we are certain that
   // the new numbers are outside of the interval we want the final
   // representation to lie in.
   // Inversely adding (resp. removing) 1 ulp from low (resp. high) would yield
   // numbers that are certain to lie in the interval. We will use this fact
   // later on.
   // We will now start by generating the digits within the uncertain
   // interval. Later we will weed out representations that lie outside the safe
@@ skipping 47 matching lines @@
     }
     divisor /= 10;
   }
 
   // The integrals have been generated. We are at the point of the decimal
   // separator. In the following loop we simply multiply the remaining digits by
   // 10 and divide by one. We just need to pay attention to multiply associated
   // data (like the interval or 'unit'), too.
   // Note that the multiplication by 10 does not overflow, because w.e >= -60
   // and thus one.e >= -60.
-  ASSERT(one.e() >= -60);
-  ASSERT(fractionals < one.f());
-  ASSERT(V8_2PART_UINT64_C(0xFFFFFFFF, FFFFFFFF) / 10 >= one.f());
+  DCHECK(one.e() >= -60);
+  DCHECK(fractionals < one.f());
+  DCHECK(V8_2PART_UINT64_C(0xFFFFFFFF, FFFFFFFF) / 10 >= one.f());
   while (true) {
     fractionals *= 10;
     unit *= 10;
     unsafe_interval.set_f(unsafe_interval.f() * 10);
     // Integer division by one.
     int digit = static_cast<int>(fractionals >> -one.e());
     buffer[*length] = '0' + digit;
     (*length)++;
     fractionals &= one.f() - 1;  // Modulo by one.
     (*kappa)--;
@@ skipping 32 matching lines @@
 //
 // Remark: This procedure takes into account the imprecision of its input
 //   numbers. If the precision is not enough to guarantee all the postconditions
 //   then false is returned. This usually happens rarely, but the failure-rate
 //   increases with higher requested_digits.
 static bool DigitGenCounted(DiyFp w,
                             int requested_digits,
                             Vector<char> buffer,
                             int* length,
                             int* kappa) {
-  ASSERT(kMinimalTargetExponent <= w.e() && w.e() <= kMaximalTargetExponent);
-  ASSERT(kMinimalTargetExponent >= -60);
-  ASSERT(kMaximalTargetExponent <= -32);
+  DCHECK(kMinimalTargetExponent <= w.e() && w.e() <= kMaximalTargetExponent);
+  DCHECK(kMinimalTargetExponent >= -60);
+  DCHECK(kMaximalTargetExponent <= -32);
   // w is assumed to have an error less than 1 unit. Whenever w is scaled we
   // also scale its error.
   uint64_t w_error = 1;
   // We cut the input number into two parts: the integral digits and the
   // fractional digits. We don't emit any decimal separator, but adapt kappa
   // instead. Example: instead of writing "1.2" we put "12" into the buffer and
   // increase kappa by 1.
   DiyFp one = DiyFp(static_cast<uint64_t>(1) << -w.e(), w.e());
   // Division by one is a shift.
   uint32_t integrals = static_cast<uint32_t>(w.f() >> -one.e());
@@ skipping 30 matching lines @@
                             static_cast<uint64_t>(divisor) << -one.e(), w_error,
                             kappa);
   }
 
   // The integrals have been generated. We are at the point of the decimal
   // separator. In the following loop we simply multiply the remaining digits by
   // 10 and divide by one. We just need to pay attention to multiply associated
   // data (the 'unit'), too.
   // Note that the multiplication by 10 does not overflow, because w.e >= -60
   // and thus one.e >= -60.
-  ASSERT(one.e() >= -60);
-  ASSERT(fractionals < one.f());
-  ASSERT(V8_2PART_UINT64_C(0xFFFFFFFF, FFFFFFFF) / 10 >= one.f());
+  DCHECK(one.e() >= -60);
+  DCHECK(fractionals < one.f());
+  DCHECK(V8_2PART_UINT64_C(0xFFFFFFFF, FFFFFFFF) / 10 >= one.f());
   while (requested_digits > 0 && fractionals > w_error) {
     fractionals *= 10;
     w_error *= 10;
     // Integer division by one.
     int digit = static_cast<int>(fractionals >> -one.e());
     buffer[*length] = '0' + digit;
     (*length)++;
     requested_digits--;
     fractionals &= one.f() - 1;  // Modulo by one.
     (*kappa)--;
@@ skipping 19 matching lines @@
                    Vector<char> buffer,
                    int* length,
                    int* decimal_exponent) {
   DiyFp w = Double(v).AsNormalizedDiyFp();
   // boundary_minus and boundary_plus are the boundaries between v and its
   // closest floating-point neighbors. Any number strictly between
   // boundary_minus and boundary_plus will round to v when convert to a double.
   // Grisu3 will never output representations that lie exactly on a boundary.
   DiyFp boundary_minus, boundary_plus;
   Double(v).NormalizedBoundaries(&boundary_minus, &boundary_plus);
-  ASSERT(boundary_plus.e() == w.e());
+  DCHECK(boundary_plus.e() == w.e());
   DiyFp ten_mk;  // Cached power of ten: 10^-k
   int mk;        // -k
   int ten_mk_minimal_binary_exponent =
      kMinimalTargetExponent - (w.e() + DiyFp::kSignificandSize);
   int ten_mk_maximal_binary_exponent =
      kMaximalTargetExponent - (w.e() + DiyFp::kSignificandSize);
   PowersOfTenCache::GetCachedPowerForBinaryExponentRange(
       ten_mk_minimal_binary_exponent,
       ten_mk_maximal_binary_exponent,
       &ten_mk, &mk);
-  ASSERT((kMinimalTargetExponent <= w.e() + ten_mk.e() +
+  DCHECK((kMinimalTargetExponent <= w.e() + ten_mk.e() +
           DiyFp::kSignificandSize) &&
          (kMaximalTargetExponent >= w.e() + ten_mk.e() +
           DiyFp::kSignificandSize));
   // Note that ten_mk is only an approximation of 10^-k. A DiyFp only contains a
   // 64 bit significand and ten_mk is thus only precise up to 64 bits.
 
   // The DiyFp::Times procedure rounds its result, and ten_mk is approximated
   // too. The variable scaled_w (as well as scaled_boundary_minus/plus) are now
   // off by a small amount.
   // In fact: scaled_w - w*10^k < 1ulp (unit in the last place) of scaled_w.
   // In other words: let f = scaled_w.f() and e = scaled_w.e(), then
   //           (f-1) * 2^e < w*10^k < (f+1) * 2^e
   DiyFp scaled_w = DiyFp::Times(w, ten_mk);
-  ASSERT(scaled_w.e() ==
+  DCHECK(scaled_w.e() ==
          boundary_plus.e() + ten_mk.e() + DiyFp::kSignificandSize);
   // In theory it would be possible to avoid some recomputations by computing
   // the difference between w and boundary_minus/plus (a power of 2) and to
   // compute scaled_boundary_minus/plus by subtracting/adding from
   // scaled_w. However the code becomes much less readable and the speed
   // enhancements are not terriffic.
   DiyFp scaled_boundary_minus = DiyFp::Times(boundary_minus, ten_mk);
   DiyFp scaled_boundary_plus  = DiyFp::Times(boundary_plus,  ten_mk);
 
   // DigitGen will generate the digits of scaled_w. Therefore we have
@@ skipping 24 matching lines @@
   DiyFp ten_mk;  // Cached power of ten: 10^-k
   int mk;        // -k
   int ten_mk_minimal_binary_exponent =
      kMinimalTargetExponent - (w.e() + DiyFp::kSignificandSize);
   int ten_mk_maximal_binary_exponent =
      kMaximalTargetExponent - (w.e() + DiyFp::kSignificandSize);
   PowersOfTenCache::GetCachedPowerForBinaryExponentRange(
       ten_mk_minimal_binary_exponent,
       ten_mk_maximal_binary_exponent,
       &ten_mk, &mk);
-  ASSERT((kMinimalTargetExponent <= w.e() + ten_mk.e() +
+  DCHECK((kMinimalTargetExponent <= w.e() + ten_mk.e() +
           DiyFp::kSignificandSize) &&
          (kMaximalTargetExponent >= w.e() + ten_mk.e() +
           DiyFp::kSignificandSize));
   // Note that ten_mk is only an approximation of 10^-k. A DiyFp only contains a
   // 64 bit significand and ten_mk is thus only precise up to 64 bits.
 
   // The DiyFp::Times procedure rounds its result, and ten_mk is approximated
   // too. The variable scaled_w (as well as scaled_boundary_minus/plus) are now
   // off by a small amount.
   // In fact: scaled_w - w*10^k < 1ulp (unit in the last place) of scaled_w.
@@ skipping 13 matching lines @@
   return result;
 }
 
 
 bool FastDtoa(double v,
               FastDtoaMode mode,
               int requested_digits,
               Vector<char> buffer,
               int* length,
               int* decimal_point) {
-  ASSERT(v > 0);
-  ASSERT(!Double(v).IsSpecial());
+  DCHECK(v > 0);
+  DCHECK(!Double(v).IsSpecial());
 
   bool result = false;
   int decimal_exponent = 0;
   switch (mode) {
     case FAST_DTOA_SHORTEST:
       result = Grisu3(v, buffer, length, &decimal_exponent);
       break;
     case FAST_DTOA_PRECISION:
       result = Grisu3Counted(v, requested_digits,
                              buffer, length, &decimal_exponent);
       break;
     default:
       UNREACHABLE();
   }
   if (result) {
     *decimal_point = *length + decimal_exponent;
     buffer[*length] = '\0';
   }
   return result;
 }
 
 } }  // namespace v8::internal