Initial switch to Chromium-style CHECK_* and DCHECK_* macros.

test/cctest/compiler/test-node.cc

 // Copyright 2013 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 <functional>
 
 #include "src/v8.h"
 
 #include "graph-tester.h"
 #include "src/compiler/node.h"
@@ skipping 614 matching lines @@
       n2->AppendInput(graph.zone(), n1);  // with out-of-line input.
     }
 
     n0->RemoveAllInputs();
     CHECK_EQ(0, n0->InputCount());
 
     CHECK_EQ(2, n0->UseCount());
     n1->RemoveAllInputs();
     CHECK_EQ(1, n1->InputCount());
     CHECK_EQ(1, n0->UseCount());
-    CHECK_EQ(NULL, n1->InputAt(0));
+    CHECK(!n1->InputAt(0));
 
     CHECK_EQ(1, n1->UseCount());
     n2->RemoveAllInputs();
     CHECK_EQ(2, n2->InputCount());
     CHECK_EQ(0, n0->UseCount());
     CHECK_EQ(0, n1->UseCount());
-    CHECK_EQ(NULL, n2->InputAt(0));
-    CHECK_EQ(NULL, n2->InputAt(1));
+    CHECK(!n2->InputAt(0));
+    CHECK(!n2->InputAt(1));
   }
 
   {
     Node* n0 = graph.NewNode(&dummy_operator);
     Node* n1 = graph.NewNode(&dummy_operator, n0);
     n1->ReplaceInput(0, n1);  // self-reference.
 
     CHECK_EQ(0, n0->UseCount());
     CHECK_EQ(1, n1->UseCount());
     n1->RemoveAllInputs();
     CHECK_EQ(1, n1->InputCount());
     CHECK_EQ(0, n1->UseCount());
-    CHECK_EQ(NULL, n1->InputAt(0));
+    CHECK(!n1->InputAt(0));
   }
 }