Greedy allocator: perf work

src/compiler/schedule.cc

 // Copyright 2013 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/schedule.h"
 
 #include "src/compiler/node.h"
 #include "src/compiler/node-properties.h"
 #include "src/ostreams.h"
 
@@ skipping 318 matching lines @@
     nodeid_to_block_.resize(node->id() + 1);
   }
   nodeid_to_block_[node->id()] = block;
 }
 
 
 std::ostream& operator<<(std::ostream& os, const Schedule& s) {
   for (BasicBlock* block : *s.rpo_order()) {
     os << "--- BLOCK B" << block->rpo_number();
     if (block->deferred()) os << " (deferred)";
+    if (block->loop_header() != nullptr)
+      os << " (in loop: B" << block->loop_header()->rpo_number() << ")";

[Mircea Trofin, 2015/06/03 05:25:51]

much easier to profile when information whether block is in loop is locally
available.

     if (block->PredecessorCount() != 0) os << " <- ";
     bool comma = false;
     for (BasicBlock const* predecessor : block->predecessors()) {
       if (comma) os << ", ";
       comma = true;
       os << "B" << predecessor->rpo_number();
     }
     os << " ---\n";
     for (Node* node : *block) {
       os << "  " << *node;
@@ skipping 25 matching lines @@
       }
       os << "\n";
     }
   }
   return os;
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8