Rename ASSERT* to DCHECK*.

src/data-flow.h

 // 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.
 
 #ifndef V8_DATAFLOW_H_
 #define V8_DATAFLOW_H_
 
 #include "src/v8.h"
 
 #include "src/allocation.h"
 #include "src/ast.h"
 #include "src/compiler.h"
 #include "src/zone-inl.h"
 
 namespace v8 {
 namespace internal {
 
 class BitVector: public ZoneObject {
  public:
   // Iterator for the elements of this BitVector.
   class Iterator BASE_EMBEDDED {
    public:
     explicit Iterator(BitVector* target)
         : target_(target),
           current_index_(0),
           current_value_(target->data_[0]),
           current_(-1) {
-      ASSERT(target->data_length_ > 0);
+      DCHECK(target->data_length_ > 0);
       Advance();
     }
     ~Iterator() { }
 
     bool Done() const { return current_index_ >= target_->data_length_; }
     void Advance();
 
     int Current() const {
-      ASSERT(!Done());
+      DCHECK(!Done());
       return current_;
     }
 
    private:
     uint32_t SkipZeroBytes(uint32_t val) {
       while ((val & 0xFF) == 0) {
         val >>= 8;
         current_ += 8;
       }
       return val;
@@ skipping 11 matching lines @@
     uint32_t current_value_;
     int current_;
 
     friend class BitVector;
   };
 
   BitVector(int length, Zone* zone)
       : length_(length),
         data_length_(SizeFor(length)),
         data_(zone->NewArray<uint32_t>(data_length_)) {
-    ASSERT(length > 0);
+    DCHECK(length > 0);
     Clear();
   }
 
   BitVector(const BitVector& other, Zone* zone)
       : length_(other.length()),
         data_length_(SizeFor(length_)),
         data_(zone->NewArray<uint32_t>(data_length_)) {
     CopyFrom(other);
   }
 
   static int SizeFor(int length) {
     return 1 + ((length - 1) / 32);
   }
 
   BitVector& operator=(const BitVector& rhs) {
     if (this != &rhs) CopyFrom(rhs);
     return *this;
   }
 
   void CopyFrom(const BitVector& other) {
-    ASSERT(other.length() <= length());
+    DCHECK(other.length() <= length());
     for (int i = 0; i < other.data_length_; i++) {
       data_[i] = other.data_[i];
     }
     for (int i = other.data_length_; i < data_length_; i++) {
       data_[i] = 0;
     }
   }
 
   bool Contains(int i) const {
-    ASSERT(i >= 0 && i < length());
+    DCHECK(i >= 0 && i < length());
     uint32_t block = data_[i / 32];
     return (block & (1U << (i % 32))) != 0;
   }
 
   void Add(int i) {
-    ASSERT(i >= 0 && i < length());
+    DCHECK(i >= 0 && i < length());
     data_[i / 32] |= (1U << (i % 32));
   }
 
   void Remove(int i) {
-    ASSERT(i >= 0 && i < length());
+    DCHECK(i >= 0 && i < length());
     data_[i / 32] &= ~(1U << (i % 32));
   }
 
   void Union(const BitVector& other) {
-    ASSERT(other.length() == length());
+    DCHECK(other.length() == length());
     for (int i = 0; i < data_length_; i++) {
       data_[i] |= other.data_[i];
     }
   }
 
   bool UnionIsChanged(const BitVector& other) {
-    ASSERT(other.length() == length());
+    DCHECK(other.length() == length());
     bool changed = false;
     for (int i = 0; i < data_length_; i++) {
       uint32_t old_data = data_[i];
       data_[i] |= other.data_[i];
       if (data_[i] != old_data) changed = true;
     }
     return changed;
   }
 
   void Intersect(const BitVector& other) {
-    ASSERT(other.length() == length());
+    DCHECK(other.length() == length());
     for (int i = 0; i < data_length_; i++) {
       data_[i] &= other.data_[i];
     }
   }
 
   void Subtract(const BitVector& other) {
-    ASSERT(other.length() == length());
+    DCHECK(other.length() == length());
     for (int i = 0; i < data_length_; i++) {
       data_[i] &= ~other.data_[i];
     }
   }
 
   void Clear() {
     for (int i = 0; i < data_length_; i++) {
       data_[i] = 0;
     }
   }
@@ skipping 87 matching lines @@
   }
 
   BitVector* bits_;
 };
 
 
 } }  // namespace v8::internal
 
 
 #endif  // V8_DATAFLOW_H_