Remove redundant check from ControlEquivalence traversal.

src/compiler/control-equivalence.h

 // 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.
 
 #ifndef V8_COMPILER_CONTROL_EQUIVALENCE_H_
 #define V8_COMPILER_CONTROL_EQUIVALENCE_H_
 
 #include "src/compiler/graph.h"
 #include "src/compiler/node.h"
 #include "src/compiler/node-properties.h"
@@ skipping 165 matching lines @@
 
     while (!stack.empty()) {  // Undirected depth-first backwards traversal.
       DFSStackEntry& entry = stack.top();
       Node* node = entry.node;
 
       if (entry.direction == kInputDirection) {
         if (entry.input != node->input_edges().end()) {
           Edge edge = *entry.input;
           Node* input = edge.to();
           ++(entry.input);
-          if (NodeProperties::IsControlEdge(edge) &&
-              NodeProperties::IsControl(input)) {
+          if (NodeProperties::IsControlEdge(edge)) {
             // Visit next control input.
             if (!GetData(input)->participates) continue;
             if (GetData(input)->visited) continue;
             if (GetData(input)->on_stack) {
               // Found backedge if input is on stack.
               if (input != entry.parent_node) {
                 VisitBackedge(node, input, kInputDirection);
               }
             } else {
               // Push input onto stack.
               DFSPush(stack, input, node, kInputDirection);
               VisitPre(input);
             }
           }
           continue;
         }
         if (entry.use != node->use_edges().end()) {
           // Switch direction to uses.
           entry.direction = kUseDirection;
           VisitMid(node, kInputDirection);
           continue;
         }
       }
 
       if (entry.direction == kUseDirection) {
         if (entry.use != node->use_edges().end()) {
           Edge edge = *entry.use;
           Node* use = edge.from();
           ++(entry.use);
-          if (NodeProperties::IsControlEdge(edge) &&
-              NodeProperties::IsControl(use)) {
+          if (NodeProperties::IsControlEdge(edge)) {
             // Visit next control use.
             if (!GetData(use)->participates) continue;
             if (GetData(use)->visited) continue;
             if (GetData(use)->on_stack) {
               // Found backedge if use is on stack.
               if (use != entry.parent_node) {
                 VisitBackedge(node, use, kUseDirection);
               }
             } else {
               // Push use onto stack.
@@ skipping 121 matching lines @@
   int dfs_number_;    // Generates new DFS pre-order numbers on demand.
   int class_number_;  // Generates new equivalence class numbers on demand.
   Data node_data_;    // Per-node data stored as a side-table.
 };
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8
 
 #endif  // V8_COMPILER_CONTROL_EQUIVALENCE_H_