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

src/compiler/control-reducer.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/common-operator.h"
 #include "src/compiler/control-reducer.h"
 #include "src/compiler/graph.h"
 #include "src/compiler/js-graph.h"
 #include "src/compiler/node-marker.h"
 #include "src/compiler/node-matchers.h"
@@ skipping 278 matching lines @@
                  node->op()->mnemonic()));
           edge.UpdateTo(NULL);
         }
       }
     }
 #if DEBUG
     // Verify that no inputs to live nodes are NULL.
     for (size_t j = 0; j < nodes.size(); j++) {
       Node* node = nodes[j];
       for (Node* const input : node->inputs()) {
-        CHECK_NE(NULL, input);
+        CHECK(input);
       }
       for (Node* const use : node->uses()) {
         CHECK(marked.IsReachableFromEnd(use));
       }
     }
 #endif
   }
 
   // Reduce the node on the top of the stack.
   // If an input {i} is not yet visited or needs to be revisited, push {i} onto
   // the stack and return. Otherwise, all inputs are visited, so apply
   // reductions for {node} and pop it off the stack.
   void ReduceTop() {
     size_t height = stack_.size();
     Node* node = stack_.back();
 
     if (node->IsDead()) return Pop();  // Node was killed while on stack.
 
     TRACE(("ControlReduce: #%d:%s\n", node->id(), node->op()->mnemonic()));
 
     // Recurse on an input if necessary.
     for (Node* const input : node->inputs()) {
-      CHECK_NE(NULL, input);
+      DCHECK(input);
       if (Recurse(input)) return;
     }
 
     // All inputs should be visited or on stack. Apply reductions to node.
     Node* replacement = ReduceNode(node);
     if (replacement != node) ReplaceNode(node, replacement);
 
     // After reducing the node, pop it off the stack.
     CHECK_EQ(static_cast<int>(height), static_cast<int>(stack_.size()));
     Pop();
@@ skipping 301 matching lines @@
       return impl.ReduceIfTrue(node);
     case IrOpcode::kIfFalse:
       return impl.ReduceIfFalse(node);
     default:
       return node;
   }
 }
 }
 }
 }  // namespace v8::internal::compiler