Rename ASSERT* to DCHECK*.

src/transitions.cc

 // 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.
 
 #include "src/v8.h"
 
 #include "src/objects.h"
 #include "src/transitions-inl.h"
 #include "src/utils.h"
 
@@ skipping 46 matching lines @@
     result = Allocate(isolate, 1);
     result->NoIncrementalWriteBarrierSet(0, *name, *target);
   }
   result->set_back_pointer_storage(map->GetBackPointer());
   return result;
 }
 
 
 Handle<TransitionArray> TransitionArray::ExtendToFullTransitionArray(
     Handle<Map> containing_map) {
-  ASSERT(!containing_map->transitions()->IsFullTransitionArray());
+  DCHECK(!containing_map->transitions()->IsFullTransitionArray());
   int nof = containing_map->transitions()->number_of_transitions();
 
   // A transition array may shrink during GC.
   Handle<TransitionArray> result = Allocate(containing_map->GetIsolate(), nof);
   DisallowHeapAllocation no_gc;
   int new_nof = containing_map->transitions()->number_of_transitions();
   if (new_nof != nof) {
-    ASSERT(new_nof == 0);
+    DCHECK(new_nof == 0);
     result->Shrink(ToKeyIndex(0));
   } else if (nof == 1) {
     result->NoIncrementalWriteBarrierCopyFrom(
         containing_map->transitions(), kSimpleTransitionIndex, 0);
   }
 
   result->set_back_pointer_storage(
       containing_map->transitions()->back_pointer_storage());
   return result;
 }
@@ skipping 11 matching lines @@
   int new_size = number_of_transitions;
 
   int insertion_index = map->transitions()->Search(*name);
   if (insertion_index == kNotFound) ++new_size;
 
   Handle<TransitionArray> result = Allocate(map->GetIsolate(), new_size);
 
   // The map's transition array may grown smaller during the allocation above as
   // it was weakly traversed, though it is guaranteed not to disappear. Trim the
   // result copy if needed, and recompute variables.
-  ASSERT(map->HasTransitionArray());
+  DCHECK(map->HasTransitionArray());
   DisallowHeapAllocation no_gc;
   TransitionArray* array = map->transitions();
   if (array->number_of_transitions() != number_of_transitions) {
-    ASSERT(array->number_of_transitions() < number_of_transitions);
+    DCHECK(array->number_of_transitions() < number_of_transitions);
 
     number_of_transitions = array->number_of_transitions();
     new_size = number_of_transitions;
 
     insertion_index = array->Search(*name);
     if (insertion_index == kNotFound) ++new_size;
 
     result->Shrink(ToKeyIndex(new_size));
   }
 
@@ skipping 25 matching lines @@
     result->NoIncrementalWriteBarrierCopyFrom(
         array, insertion_index, insertion_index + 1);
   }
 
   result->set_back_pointer_storage(array->back_pointer_storage());
   return result;
 }
 
 
 } }  // namespace v8::internal