[turbofan] Cleanup the NodeProperties.

src/compiler/loop-peeling.cc

 // Copyright 2015 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/graph.h"
 #include "src/compiler/loop-peeling.h"
 #include "src/compiler/node.h"
 #include "src/compiler/node-marker.h"
-#include "src/compiler/node-properties-inl.h"
+#include "src/compiler/node-properties.h"
 #include "src/zone.h"
 
 // Loop peeling is an optimization that copies the body of a loop, creating
 // a new copy of the body called the "peeled iteration" that represents the
 // first iteration. Beginning with a loop as follows:
 
 //             E
 //             |                 A
 //             |                 |                     (backedges)
 //             | +---------------|---------------------------------+
@@ skipping 248 matching lines @@
       }
       // There should be a merge or a return for each exit.
       CHECK_NE(NULL, found);
     }
     // Return nodes, the end merge, and the phis associated with the end merge
     // must be duplicated as well.
     for (Node* node : rets) exits.push_back(node);
     if (end != NULL) {
       exits.push_back(end);
       for (Node* use : end->uses()) {
-        if (IrOpcode::IsPhiOpcode(use->opcode())) exits.push_back(use);
+        if (NodeProperties::IsPhi(use)) exits.push_back(use);
       }
     }
   }
 
   //============================================================================
   // Duplicate the loop exit region and add a merge.
   //============================================================================
   NodeRange exit_range(&exits[0], &exits[0] + exits.size());
   peeling.CopyNodes(graph, tmp_zone, dead, exit_range);
 
@@ skipping 40 matching lines @@
       }
     }
   }
 
   return iter;
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8