[turbofan] Induction variable bound analysis.

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.h"
@@ skipping 168 matching lines @@
             unmarked_exit = (node->InputAt(1) != loop_node);
             break;
           case IrOpcode::kLoopExitValue:
           case IrOpcode::kLoopExitEffect:
             unmarked_exit = (node->InputAt(1)->InputAt(1) != loop_node);
             break;
           default:
             unmarked_exit = (use->opcode() != IrOpcode::kTerminate);
         }
         if (unmarked_exit) {
-          if (FLAG_trace_turbo_graph) {
+          if (FLAG_trace_turbo_loop) {
             Node* loop_node = loop_tree->GetLoopControl(loop);
             PrintF(
                 "Cannot peel loop %i. Loop exit without explicit mark: Node %i "
                 "(%s) is inside "
                 "loop, but its use %i (%s) is outside.\n",
                 loop_node->id(), node->id(), node->op()->mnemonic(), use->id(),
                 use->op()->mnemonic());
           }
           return false;
         }
@@ skipping 105 matching lines @@
                     Zone* temp_zone) {
   // If the loop has nested loops, peel inside those.
   if (!loop->children().empty()) {
     for (LoopTree::Loop* inner_loop : loop->children()) {
       PeelInnerLoops(graph, common, loop_tree, inner_loop, temp_zone);
     }
     return;
   }
   // Only peel small-enough loops.
   if (loop->TotalSize() > LoopPeeler::kMaxPeeledNodes) return;
-  if (FLAG_trace_turbo_graph) {
+  if (FLAG_trace_turbo_loop) {
     PrintF("Peeling loop with header: ");
     for (Node* node : loop_tree->HeaderNodes(loop)) {
       PrintF("%i ", node->id());
     }
+    PrintF("\n");
   }
 
   LoopPeeler::Peel(graph, common, loop_tree, loop, temp_zone);
 }
 
 void EliminateLoopExit(Node* node) {
   DCHECK_EQ(IrOpcode::kLoopExit, node->opcode());
   // The exit markers take the loop exit as input. We iterate over uses
   // and remove all the markers from the graph.
   for (Edge edge : node->use_edges()) {
@@ skipping 51 matching lines @@
           queue.push(control);
         }
       }
     }
   }
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8