[turbofan] Move node verification methods to the Verifier class.

src/compiler/graph-reducer.cc

Index: src/compiler/graph-reducer.cc
diff --git a/src/compiler/graph-reducer.cc b/src/compiler/graph-reducer.cc
index cd4822d8a34bd98cbcfde69af64788d66e3b4378..1be0b6dec7b6ecbfe4d38a3d19f9e7329dc69fdb 100644
--- a/src/compiler/graph-reducer.cc
+++ b/src/compiler/graph-reducer.cc
@@ -9,6 +9,7 @@
 #include "src/compiler/graph-reducer.h"
 #include "src/compiler/node.h"
 #include "src/compiler/node-properties.h"
+#include "src/compiler/verifier.h"
 
 namespace v8 {
 namespace internal {
@@ -159,22 +160,6 @@ void GraphReducer::Replace(Node* node, Node* replacement) {
 }
 
 
-namespace {
-
-
-void VerifyUseReplacement(const Edge& edge, const Node* replacement) {
-  // Check that the user does not misuse the replacement.
-  DCHECK(!NodeProperties::IsControlEdge(edge) ||
-         replacement->op()->ControlOutputCount() > 0);
-  DCHECK(!NodeProperties::IsEffectEdge(edge) ||
-         replacement->op()->EffectOutputCount() > 0);
-  DCHECK(!NodeProperties::IsFrameStateEdge(edge) ||
-         replacement->opcode() == IrOpcode::kFrameState);
-}
-
-}  // namespace
-
-
 void GraphReducer::Replace(Node* node, Node* replacement, NodeId max_id) {
   if (node == graph()->start()) graph()->SetStart(replacement);
   if (node == graph()->end()) graph()->SetEnd(replacement);
@@ -183,7 +168,7 @@ void GraphReducer::Replace(Node* node, Node* replacement, NodeId max_id) {
     // {replacement} was already reduced and finish.
     for (Edge edge : node->use_edges()) {
       Node* const user = edge.from();
-      VerifyUseReplacement(edge, replacement);
+      Verifier::VerifyEdgeInputReplacement(edge, replacement);
       edge.UpdateTo(replacement);
       // Don't revisit this node if it refers to itself.
       if (user != node) Revisit(user);