Replace ASSERT, ENABLE(ASSERT), and ASSERT_NOT_REACHED in wtf

third_party/WebKit/Source/wtf/dtoa/diy-fp.h

 // 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 33 matching lines @@
   static const int kSignificandSize = 64;
 
   DiyFp() : f_(0), e_(0) {}
   DiyFp(uint64_t f, int e) : f_(f), e_(e) {}
 
   // this = this - other.
   // The exponents of both numbers must be the same and the significand of this
   // must be bigger than the significand of other.
   // The result will not be normalized.
   void Subtract(const DiyFp& other) {
-    ASSERT(e_ == other.e_);
-    ASSERT(f_ >= other.f_);
+    DCHECK_EQ(e_, other.e_);
+    DCHECK_GE(f_, other.f_);
     f_ -= other.f_;
   }
 
   // Returns a - b.
   // The exponents of both numbers must be the same and this must be bigger
   // than other. The result will not be normalized.
   static DiyFp Minus(const DiyFp& a, const DiyFp& b) {
     DiyFp result = a;
     result.Subtract(b);
     return result;
   }
 
   // this = this * other.
   void Multiply(const DiyFp& other);
 
   // returns a * b;
   static DiyFp Times(const DiyFp& a, const DiyFp& b) {
     DiyFp result = a;
     result.Multiply(b);
     return result;
   }
 
   void Normalize() {
-    ASSERT(f_ != 0);
+    DCHECK_NE(f_, 0u);
     uint64_t f = f_;
     int e = e_;
 
     // This method is mainly called for normalizing boundaries. In general
     // boundaries need to be shifted by 10 bits. We thus optimize for this case.
     const uint64_t k10MSBits = UINT64_2PART_C(0xFFC00000, 00000000);
     while ((f & k10MSBits) == 0) {
       f <<= 10;
       e -= 10;
     }
@@ skipping 22 matching lines @@
 
   uint64_t f_;
   int e_;
 };
 
 }  // namespace double_conversion
 
 }  // namespace WTF
 
 #endif  // DOUBLE_CONVERSION_DIY_FP_H_