Rename ASSERT* to DCHECK*.

src/list-inl.h

 // Copyright 2006-2009 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_LIST_INL_H_
 #define V8_LIST_INL_H_
 
 #include "src/list.h"
 
 #include "src/base/platform/platform.h"
@@ skipping 32 matching lines @@
 // Use two layers of inlining so that the non-inlined function can
 // use the same implementation as the inlined version.
 template<typename T, class P>
 void List<T, P>::ResizeAdd(const T& element, P alloc) {
   ResizeAddInternal(element, alloc);
 }
 
 
 template<typename T, class P>
 void List<T, P>::ResizeAddInternal(const T& element, P alloc) {
-  ASSERT(length_ >= capacity_);
+  DCHECK(length_ >= capacity_);
   // Grow the list capacity by 100%, but make sure to let it grow
   // even when the capacity is zero (possible initial case).
   int new_capacity = 1 + 2 * capacity_;
   // Since the element reference could be an element of the list, copy
   // it out of the old backing storage before resizing.
   T temp = element;
   Resize(new_capacity, alloc);
   data_[length_++] = temp;
 }
 
 
 template<typename T, class P>
 void List<T, P>::Resize(int new_capacity, P alloc) {
-  ASSERT_LE(length_, new_capacity);
+  DCHECK_LE(length_, new_capacity);
   T* new_data = NewData(new_capacity, alloc);
   MemCopy(new_data, data_, length_ * sizeof(T));
   List<T, P>::DeleteData(data_);
   data_ = new_data;
   capacity_ = new_capacity;
 }
 
 
 template<typename T, class P>
 Vector<T> List<T, P>::AddBlock(T value, int count, P alloc) {
   int start = length_;
   for (int i = 0; i < count; i++) Add(value, alloc);
   return Vector<T>(&data_[start], count);
 }
 
 
 template<typename T, class P>
 void List<T, P>::Set(int index, const T& elm) {
-  ASSERT(index >= 0 && index <= length_);
+  DCHECK(index >= 0 && index <= length_);
   data_[index] = elm;
 }
 
 
 template<typename T, class P>
 void List<T, P>::InsertAt(int index, const T& elm, P alloc) {
-  ASSERT(index >= 0 && index <= length_);
+  DCHECK(index >= 0 && index <= length_);
   Add(elm, alloc);
   for (int i = length_ - 1; i > index; --i) {
     data_[i] = data_[i - 1];
   }
   data_[index] = elm;
 }
 
 
 template<typename T, class P>
 T List<T, P>::Remove(int i) {
@@ skipping 33 matching lines @@
   // We don't call Initialize(0) since that requires passing a Zone,
   // which we don't really need.
   data_ = NULL;
   capacity_ = 0;
   length_ = 0;
 }
 
 
 template<typename T, class P>
 void List<T, P>::Rewind(int pos) {
-  ASSERT(0 <= pos && pos <= length_);
+  DCHECK(0 <= pos && pos <= length_);
   length_ = pos;
 }
 
 
 template<typename T, class P>
 void List<T, P>::Trim(P alloc) {
   if (length_ < capacity_ / 4) {
     Resize(capacity_ / 2, alloc);
   }
 }
@@ skipping 30 matching lines @@
   }
   return result;
 }
 
 
 template<typename T, class P>
 void List<T, P>::Sort(int (*cmp)(const T* x, const T* y)) {
   ToVector().Sort(cmp);
 #ifdef DEBUG
   for (int i = 1; i < length_; i++)
-    ASSERT(cmp(&data_[i - 1], &data_[i]) <= 0);
+    DCHECK(cmp(&data_[i - 1], &data_[i]) <= 0);
 #endif
 }
 
 
 template<typename T, class P>
 void List<T, P>::Sort() {
   ToVector().Sort();
 }
 
 
 template<typename T, class P>
 void List<T, P>::Initialize(int capacity, P allocator) {
-  ASSERT(capacity >= 0);
+  DCHECK(capacity >= 0);
   data_ = (capacity > 0) ? NewData(capacity, allocator) : NULL;
   capacity_ = capacity;
   length_ = 0;
 }
 
 
 template <typename T, typename P>
 int SortedListBSearch(const List<T>& list, P cmp) {
   int low = 0;
   int high = list.length() - 1;
@@ skipping 30 matching lines @@
 
 template <typename T>
 int SortedListBSearch(const List<T>& list, T elem) {
   return SortedListBSearch<T, ElementCmp<T> > (list, ElementCmp<T>(elem));
 }
 
 
 } }  // namespace v8::internal
 
 #endif  // V8_LIST_INL_H_