Rename ASSERT* to DCHECK*.

src/compiler/typer.cc

 // Copyright 2014 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/compiler/graph-inl.h"
 #include "src/compiler/js-operator.h"
 #include "src/compiler/node.h"
 #include "src/compiler/node-properties-inl.h"
 #include "src/compiler/node-properties.h"
 #include "src/compiler/simplified-operator.h"
@@ skipping 79 matching lines @@
   VALUE_OP_LIST(DECLARE_METHOD)
 #undef DECLARE_METHOD
 
   Bounds OperandType(Node* node, int i) {
     return NodeProperties::GetBounds(NodeProperties::GetValueInput(node, i));
   }
 
   Type* ContextType(Node* node) {
     Bounds result =
         NodeProperties::GetBounds(NodeProperties::GetContextInput(node));
-    ASSERT(result.upper->Is(Type::Internal()));
-    ASSERT(result.lower->Equals(result.upper));
+    DCHECK(result.upper->Is(Type::Internal()));
+    DCHECK(result.lower->Equals(result.upper));
     return result.upper;
   }
 
   Zone* zone() { return typer_->zone(); }
   Isolate* isolate() { return typer_->isolate(); }
   MaybeHandle<Context> context() { return context_; }
 
  private:
   Typer* typer_;
   MaybeHandle<Context> context_;
@@ skipping 32 matching lines @@
 
 class Typer::NarrowVisitor : public Typer::Visitor {
  public:
   NarrowVisitor(Typer* typer, MaybeHandle<Context> context)
       : Visitor(typer, context) {}
 
   GenericGraphVisit::Control Pre(Node* node) {
     Bounds previous = NodeProperties::GetBounds(node);
     Bounds bounds = TypeNode(node);
     NodeProperties::SetBounds(node, Bounds::Both(bounds, previous, zone()));
-    ASSERT(bounds.Narrows(previous));
+    DCHECK(bounds.Narrows(previous));
     // Stop when nothing changed (but allow reentry in case it does later).
     return previous.Narrows(bounds) ? GenericGraphVisit::DEFER
                                     : GenericGraphVisit::REENTER;
   }
 
   GenericGraphVisit::Control Post(Node* node) {
     return GenericGraphVisit::REENTER;
   }
 };
 
 
 class Typer::WidenVisitor : public Typer::Visitor {
  public:
   WidenVisitor(Typer* typer, MaybeHandle<Context> context)
       : Visitor(typer, context) {}
 
   GenericGraphVisit::Control Pre(Node* node) {
     Bounds previous = NodeProperties::GetBounds(node);
     Bounds bounds = TypeNode(node);
-    ASSERT(previous.lower->Is(bounds.lower));
-    ASSERT(previous.upper->Is(bounds.upper));
+    DCHECK(previous.lower->Is(bounds.lower));
+    DCHECK(previous.upper->Is(bounds.upper));
     NodeProperties::SetBounds(node, bounds);  // TODO(rossberg): Either?
     // Stop when nothing changed (but allow reentry in case it does later).
     return bounds.Narrows(previous) ? GenericGraphVisit::DEFER
                                     : GenericGraphVisit::REENTER;
   }
 
   GenericGraphVisit::Control Post(Node* node) {
     return GenericGraphVisit::REENTER;
   }
 };
@@ skipping 289 matching lines @@
 
 Bounds Typer::Visitor::TypeJSInstanceOf(Node* node) {
   return Bounds(Type::Boolean(zone()));
 }
 
 
 // JS context operators.
 
 Bounds Typer::Visitor::TypeJSLoadContext(Node* node) {
   Bounds outer = OperandType(node, 0);
-  ASSERT(outer.upper->Is(Type::Internal()));
-  ASSERT(outer.lower->Equals(outer.upper));
+  DCHECK(outer.upper->Is(Type::Internal()));
+  DCHECK(outer.lower->Equals(outer.upper));
   ContextAccess access = OpParameter<ContextAccess>(node);
   Type* context_type = outer.upper;
   MaybeHandle<Context> context;
   if (context_type->IsConstant()) {
     context = Handle<Context>::cast(context_type->AsConstant()->Value());
   }
   // Walk context chain (as far as known), mirroring dynamic lookup.
   // Since contexts are mutable, the information is only useful as a lower
   // bound.
   // TODO(rossberg): Could use scope info to fix upper bounds for constant
@@ skipping 336 matching lines @@
 };
 }
 
 
 void Typer::DecorateGraph(Graph* graph) {
   graph->AddDecorator(new (zone()) TyperDecorator(this));
 }
 }
 }
 }  // namespace v8::internal::compiler