Replace ASSERT with DHCECK_op in platform/wtf

third_party/WebKit/Source/platform/wtf/dtoa/bignum.cc

 // Copyright 2010 the V8 project authors. All rights reserved.
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 //       notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
 //       copyright notice, this list of conditions and the following
 //       disclaimer in the documentation and/or other materials provided
@@ skipping 30 matching lines @@
     }
 
 
     template<typename S>
     static int BitSize(S value) {
         return 8 * sizeof(value);
     }
 
     // Guaranteed to lie in one Bigit.
     void Bignum::AssignUInt16(uint16_t value) {
-        ASSERT(kBigitSize >= BitSize(value));
+        DCHECK_GE(kBigitSize, BitSize(value));
         Zero();
         if (value == 0) return;
 
         EnsureCapacity(1);
         bigits_[0] = value;
         used_digits_ = 1;
     }
 
 
     void Bignum::AssignUInt64(uint64_t value) {
@@ skipping 25 matching lines @@
         used_digits_ = other.used_digits_;
     }
 
 
     static uint64_t ReadUInt64(Vector<const char> buffer,
                                int from,
                                int digits_to_read) {
         uint64_t result = 0;
         for (int i = from; i < from + digits_to_read; ++i) {
             int digit = buffer[i] - '0';
-            ASSERT(0 <= digit && digit <= 9);
+            DCHECK_LE(0, digit);
+            DCHECK_LE(digit, 9);
             result = result * 10 + digit;
         }
         return result;
     }
 
 
     void Bignum::AssignDecimalString(Vector<const char> value) {
         // 2^64 = 18446744073709551616 > 10^19
         const int kMaxUint64DecimalDigits = 19;
         Zero();
@@ skipping 77 matching lines @@
       // or
       //    aaaaaaaaaa 0000
       //  bbbbbbbbb 0000000
       //  -----------------
       //  cccccccccccc 0000
       // In both cases we might need a carry bigit.
 
       EnsureCapacity(1 + Max(BigitLength(), other.BigitLength()) - exponent_);
       Chunk carry = 0;
       int bigit_pos = other.exponent_ - exponent_;
-      ASSERT(bigit_pos >= 0);
+      DCHECK_GE(bigit_pos, 0);
       for (int i = 0; i < other.used_digits_; ++i) {
         Chunk sum = bigits_[bigit_pos] + other.bigits_[i] + carry;
         bigits_[bigit_pos] = sum & kBigitMask;
         carry = sum >> kBigitSize;
         bigit_pos++;
         }
 
         while (carry != 0) {
             Chunk sum = bigits_[bigit_pos] + carry;
             bigits_[bigit_pos] = sum & kBigitMask;
             carry = sum >> kBigitSize;
             bigit_pos++;
         }
         used_digits_ = Max(bigit_pos, used_digits_);
         DCHECK(IsClamped());
     }
 
 
     void Bignum::SubtractBignum(const Bignum& other) {
       DCHECK(IsClamped());
       DCHECK(other.IsClamped());
       // We require this to be bigger than other.
-      ASSERT(LessEqual(other, *this));
+      DCHECK(LessEqual(other, *this));
 
       Align(other);
 
       int offset = other.exponent_ - exponent_;
       Chunk borrow = 0;
       int i;
       for (i = 0; i < other.used_digits_; ++i) {
-        ASSERT((borrow == 0) || (borrow == 1));
+        DCHECK((borrow == 0) || (borrow == 1));
         Chunk difference = bigits_[i + offset] - other.bigits_[i] - borrow;
         bigits_[i + offset] = difference & kBigitMask;
         borrow = difference >> (kChunkSize - 1);
         }
         while (borrow != 0) {
             Chunk difference = bigits_[i + offset] - borrow;
             bigits_[i + offset] = difference & kBigitMask;
             borrow = difference >> (kChunkSize - 1);
             ++i;
         }
@@ skipping 13 matching lines @@
     void Bignum::MultiplyByUInt32(uint32_t factor) {
         if (factor == 1) return;
         if (factor == 0) {
             Zero();
             return;
         }
         if (used_digits_ == 0) return;
 
         // The product of a bigit with the factor is of size kBigitSize + 32.
         // Assert that this number + 1 (for the carry) fits into double chunk.
-        ASSERT(kDoubleChunkSize >= kBigitSize + 32 + 1);
+        DCHECK_GE(kDoubleChunkSize, kBigitSize + 32 + 1);
         DoubleChunk carry = 0;
         for (int i = 0; i < used_digits_; ++i) {
             DoubleChunk product = static_cast<DoubleChunk>(factor) * bigits_[i] + carry;
             bigits_[i] = static_cast<Chunk>(product & kBigitMask);
             carry = (product >> kBigitSize);
         }
         while (carry != 0) {
             EnsureCapacity(used_digits_ + 1);
             bigits_[used_digits_] = (uint32_t)carry & kBigitMask;
             used_digits_++;
             carry >>= kBigitSize;
         }
     }
 
 
     void Bignum::MultiplyByUInt64(uint64_t factor) {
         if (factor == 1) return;
         if (factor == 0) {
             Zero();
             return;
         }
-        ASSERT(kBigitSize < 32);
+        DCHECK_LT(kBigitSize, 32);
         uint64_t carry = 0;
         uint64_t low = factor & 0xFFFFFFFF;
         uint64_t high = factor >> 32;
         for (int i = 0; i < used_digits_; ++i) {
             uint64_t product_low = low * bigits_[i];
             uint64_t product_high = high * bigits_[i];
             uint64_t tmp = (carry & kBigitMask) + product_low;
             bigits_[i] = (uint32_t)tmp & kBigitMask;
             carry = (carry >> kBigitSize) + (tmp >> kBigitSize) +
             (product_high << (32 - kBigitSize));
@@ skipping 19 matching lines @@
         const uint32_t kFive8 = kFive7 * 5;
         const uint32_t kFive9 = kFive8 * 5;
         const uint32_t kFive10 = kFive9 * 5;
         const uint32_t kFive11 = kFive10 * 5;
         const uint32_t kFive12 = kFive11 * 5;
         const uint32_t kFive13 = kFive12 * 5;
         const uint32_t kFive1_to_12[] =
         { kFive1, kFive2, kFive3, kFive4, kFive5, kFive6,
             kFive7, kFive8, kFive9, kFive10, kFive11, kFive12 };
 
-        ASSERT(exponent >= 0);
+        DCHECK_GE(exponent, 0);
         if (exponent == 0) return;
         if (used_digits_ == 0) return;
 
         // We shift by exponent at the end just before returning.
         int remaining_exponent = exponent;
         while (remaining_exponent >= 27) {
             MultiplyByUInt64(kFive27);
             remaining_exponent -= 27;
         }
         while (remaining_exponent >= 13) {
@@ skipping 64 matching lines @@
                 bigit_index2++;
             }
             // The overwritten bigits_[i] will never be read in further loop iterations,
             // because bigit_index1 and bigit_index2 are always greater
             // than i - used_digits_.
             bigits_[i] = static_cast<Chunk>(accumulator) & kBigitMask;
             accumulator >>= kBigitSize;
         }
         // Since the result was guaranteed to lie inside the number the
         // accumulator must be 0 now.
-        ASSERT(accumulator == 0);
+        DCHECK_EQ(accumulator, 0u);
 
         // Don't forget to update the used_digits and the exponent.
         used_digits_ = product_length;
         exponent_ *= 2;
         Clamp();
     }
 
 
     void Bignum::AssignPowerUInt16(uint16_t base, int power_exponent) {
-        ASSERT(base != 0);
-        ASSERT(power_exponent >= 0);
+        DCHECK_NE(base, 0);
+        DCHECK_GE(power_exponent, 0);
         if (power_exponent == 0) {
             AssignUInt16(1);
             return;
         }
         Zero();
         int shifts = 0;
         // We expect base to be in range 2-32, and most often to be 10.
         // It does not make much sense to implement different algorithms for counting
         // the bits.
         while ((base & 1) == 0) {
@@ skipping 54 matching lines @@
 
         // And finally add the saved shifts.
         ShiftLeft(shifts * power_exponent);
     }
 
 
     // Precondition: this/other < 16bit.
     uint16_t Bignum::DivideModuloIntBignum(const Bignum& other) {
       DCHECK(IsClamped());
       DCHECK(other.IsClamped());
-      ASSERT(other.used_digits_ > 0);
+      DCHECK_GT(other.used_digits_, 0);
 
       // Easy case: if we have less digits than the divisor than the result is
       // 0. Note: this handles the case where this == 0, too.
       if (BigitLength() < other.BigitLength()) {
         return 0;
         }
 
         Align(other);
 
         uint16_t result = 0;
 
         // Start by removing multiples of 'other' until both numbers have the same
         // number of digits.
         while (BigitLength() > other.BigitLength()) {
             // This naive approach is extremely inefficient if the this divided other
             // might be big. This function is implemented for doubleToString where
             // the result should be small (less than 10).
-            ASSERT(other.bigits_[other.used_digits_ - 1] >= ((1 << kBigitSize) / 16));
+            DCHECK_GE(other.bigits_[other.used_digits_ - 1], ((1u << kBigitSize) / 16));
             // Remove the multiples of the first digit.
             // Example this = 23 and other equals 9. -> Remove 2 multiples.
             result += static_cast<uint16_t>(bigits_[used_digits_ - 1]);
             SubtractTimes(other, bigits_[used_digits_ - 1]);
         }
 
-        ASSERT(BigitLength() == other.BigitLength());
+        DCHECK_EQ(BigitLength(), other.BigitLength());
 
         // Both bignums are at the same length now.
         // Since other has more than 0 digits we know that the access to
         // bigits_[used_digits_ - 1] is safe.
         Chunk this_bigit = bigits_[used_digits_ - 1];
         Chunk other_bigit = other.bigits_[other.used_digits_ - 1];
 
         if (other.used_digits_ == 1) {
             // Shortcut for easy (and common) case.
             uint16_t quotient = static_cast<uint16_t>(this_bigit / other_bigit);
@@ skipping 16 matching lines @@
         while (LessEqual(other, *this)) {
             SubtractBignum(other);
             result++;
         }
         return result;
     }
 
 
     template<typename S>
     static int SizeInHexChars(S number) {
-        ASSERT(number > 0);
+        DCHECK_GT(number, 0u);
         int result = 0;
         while (number != 0) {
             number >>= 4;
             result++;
         }
         return result;
     }
 
 
     static char HexCharOfValue(uint8_t value) {
-        ASSERT(0 <= value && value <= 16);
+        DCHECK_LE(0, value);
+        DCHECK_LE(value, 16);
         if (value < 10) return value + '0';
         return value - 10 + 'A';
     }
 
 
     bool Bignum::ToHexString(char* buffer, int buffer_size) const {
       DCHECK(IsClamped());
       // Each bigit must be printable as separate hex-character.
-      ASSERT(kBigitSize % 4 == 0);
+      DCHECK_EQ(kBigitSize % 4, 0);
       const int kHexCharsPerBigit = kBigitSize / 4;
 
       if (used_digits_ == 0) {
         if (buffer_size < 2)
           return false;
         buffer[0] = '0';
         buffer[1] = '\0';
         return true;
         }
         // We add 1 for the terminating '\0' character.
@@ skipping 127 matching lines @@
             int zero_digits = exponent_ - other.exponent_;
             EnsureCapacity(used_digits_ + zero_digits);
             for (int i = used_digits_ - 1; i >= 0; --i) {
                 bigits_[i + zero_digits] = bigits_[i];
             }
             for (int i = 0; i < zero_digits; ++i) {
                 bigits_[i] = 0;
             }
             used_digits_ += zero_digits;
             exponent_ -= zero_digits;
-            ASSERT(used_digits_ >= 0);
-            ASSERT(exponent_ >= 0);
+            DCHECK_GE(used_digits_, 0);
+            DCHECK_GE(exponent_, 0);
         }
     }
 
 
     void Bignum::BigitsShiftLeft(int shift_amount) {
-        ASSERT(shift_amount < kBigitSize);
-        ASSERT(shift_amount >= 0);
+        DCHECK_LT(shift_amount, kBigitSize);
+        DCHECK_GE(shift_amount, 0);
         Chunk carry = 0;
         for (int i = 0; i < used_digits_; ++i) {
             Chunk new_carry = bigits_[i] >> (kBigitSize - shift_amount);
             bigits_[i] = ((bigits_[i] << shift_amount) + carry) & kBigitMask;
             carry = new_carry;
         }
         if (carry != 0) {
             bigits_[used_digits_] = carry;
             used_digits_++;
         }
     }
 
 
     void Bignum::SubtractTimes(const Bignum& other, int factor) {
-        ASSERT(exponent_ <= other.exponent_);
+        DCHECK_LE(exponent_, other.exponent_);
         if (factor < 3) {
             for (int i = 0; i < factor; ++i) {
                 SubtractBignum(other);
             }
             return;
         }
         Chunk borrow = 0;
         int exponent_diff = other.exponent_ - exponent_;
         for (int i = 0; i < other.used_digits_; ++i) {
             DoubleChunk product = static_cast<DoubleChunk>(factor) * other.bigits_[i];
             DoubleChunk remove = borrow + product;
             Chunk difference = bigits_[i + exponent_diff] - ((uint32_t)remove & kBigitMask);
             bigits_[i + exponent_diff] = difference & kBigitMask;
             borrow = static_cast<Chunk>((difference >> (kChunkSize - 1)) +
                                         (remove >> kBigitSize));
         }
         for (int i = other.used_digits_ + exponent_diff; i < used_digits_; ++i) {
             if (borrow == 0) return;
             Chunk difference = bigits_[i] - borrow;
             bigits_[i] = difference & kBigitMask;
             borrow = difference >> (kChunkSize - 1);
         }
         Clamp();
     }
 
 
 }  // namespace double_conversion
 
 } // namespace WTF