Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(103)

Issues Search
    My Issues | Starred     Open | Closed | All

Unified Diff: src/compiler/graph-visualizer.cc

Issue 985023002: [turbofan] Add schedule to visualizer output (Closed) Base URL: https://chromium.googlesource.com/v8/v8.git@master
Patch Set: Remove redundant cdoe Created 5 years, 9 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View side-by-side diff with in-line comments
Download patch
« no previous file with comments | « src/compiler/graph-visualizer.h ('k') | src/compiler/js-inlining.cc » ('j') | src/compiler/visualizer.cc » ('J')
Expand Comments ('e') | Collapse Comments ('c') | Show Comments Hide Comments ('s')
Index: src/compiler/graph-visualizer.cc
diff --git a/src/compiler/graph-visualizer.cc b/src/compiler/graph-visualizer.cc
deleted file mode 100644
index 6157b76900118ce49107d39b5de98f2ed43ae84c..0000000000000000000000000000000000000000
--- a/src/compiler/graph-visualizer.cc
+++ /dev/null
@@ -1,824 +0,0 @@
-// 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/graph-visualizer.h"
-
-#include <sstream>
-#include <string>
-
-#include "src/code-stubs.h"
-#include "src/compiler/all-nodes.h"
-#include "src/compiler/graph.h"
-#include "src/compiler/node.h"
-#include "src/compiler/node-properties.h"
-#include "src/compiler/opcodes.h"
-#include "src/compiler/operator.h"
-#include "src/compiler/operator-properties.h"
-#include "src/compiler/register-allocator.h"
-#include "src/compiler/schedule.h"
-#include "src/compiler/scheduler.h"
-#include "src/ostreams.h"
-
-namespace v8 {
-namespace internal {
-namespace compiler {
-
-
-FILE* OpenVisualizerLogFile(CompilationInfo* info, const char* phase,
- const char* suffix, const char* mode) {
- EmbeddedVector<char, 256> filename;
- SmartArrayPointer<char> function_name;
- if (!info->shared_info().is_null()) {
- function_name = info->shared_info()->DebugName()->ToCString();
- if (strlen(function_name.get()) > 0) {
- SNPrintF(filename, "turbo-%s", function_name.get());
- } else {
- SNPrintF(filename, "turbo-%p", static_cast<void*>(info));
- }
- } else {
- SNPrintF(filename, "turbo-none-%s", phase);
- }
- std::replace(filename.start(), filename.start() + filename.length(), ' ',
- '_');
-
- EmbeddedVector<char, 256> full_filename;
- if (phase == NULL) {
- SNPrintF(full_filename, "%s.%s", filename.start(), suffix);
- } else {
- SNPrintF(full_filename, "%s-%s.%s", filename.start(), phase, suffix);
- }
- return base::OS::FOpen(full_filename.start(), mode);
-}
-
-
-static int SafeId(Node* node) { return node == NULL ? -1 : node->id(); }
-static const char* SafeMnemonic(Node* node) {
- return node == NULL ? "null" : node->op()->mnemonic();
-}
-
-#define DEAD_COLOR "#999999"
-
-class Escaped {
- public:
- explicit Escaped(const std::ostringstream& os,
- const char* escaped_chars = "<>|{}")
- : str_(os.str()), escaped_chars_(escaped_chars) {}
-
- friend std::ostream& operator<<(std::ostream& os, const Escaped& e) {
- for (std::string::const_iterator i = e.str_.begin(); i != e.str_.end();
- ++i) {
- if (e.needs_escape(*i)) os << "\\";
- os << *i;
- }
- return os;
- }
-
- private:
- bool needs_escape(char ch) const {
- for (size_t i = 0; i < strlen(escaped_chars_); ++i) {
- if (ch == escaped_chars_[i]) return true;
- }
- return false;
- }
-
- const std::string str_;
- const char* const escaped_chars_;
-};
-
-class JSONGraphNodeWriter {
- public:
- JSONGraphNodeWriter(std::ostream& os, Zone* zone, const Graph* graph,
- const SourcePositionTable* positions)
- : os_(os), all_(zone, graph), positions_(positions), first_node_(true) {}
-
- void Print() {
- for (Node* const node : all_.live) PrintNode(node);
- os_ << "\n";
- }
-
- void PrintNode(Node* node) {
- if (first_node_) {
- first_node_ = false;
- } else {
- os_ << ",\n";
- }
- std::ostringstream label;
- label << *node->op();
- os_ << "{\"id\":" << SafeId(node) << ",\"label\":\"" << Escaped(label, "\"")
- << "\"";
- IrOpcode::Value opcode = node->opcode();
- if (IrOpcode::IsPhiOpcode(opcode)) {
- os_ << ",\"rankInputs\":[0," << NodeProperties::FirstControlIndex(node)
- << "]";
- os_ << ",\"rankWithInput\":[" << NodeProperties::FirstControlIndex(node)
- << "]";
- } else if (opcode == IrOpcode::kIfTrue || opcode == IrOpcode::kIfFalse ||
- opcode == IrOpcode::kLoop) {
- os_ << ",\"rankInputs\":[" << NodeProperties::FirstControlIndex(node)
- << "]";
- }
- if (opcode == IrOpcode::kBranch) {
- os_ << ",\"rankInputs\":[0]";
- }
- SourcePosition position = positions_->GetSourcePosition(node);
- if (!position.IsUnknown()) {
- DCHECK(!position.IsInvalid());
- os_ << ",\"pos\":" << position.raw();
- }
- os_ << ",\"opcode\":\"" << IrOpcode::Mnemonic(node->opcode()) << "\"";
- os_ << ",\"control\":" << (NodeProperties::IsControl(node) ? "true"
- : "false");
- os_ << "}";
- }
-
- private:
- std::ostream& os_;
- AllNodes all_;
- const SourcePositionTable* positions_;
- bool first_node_;
-
- DISALLOW_COPY_AND_ASSIGN(JSONGraphNodeWriter);
-};
-
-
-class JSONGraphEdgeWriter {
- public:
- JSONGraphEdgeWriter(std::ostream& os, Zone* zone, const Graph* graph)
- : os_(os), all_(zone, graph), first_edge_(true) {}
-
- void Print() {
- for (Node* const node : all_.live) PrintEdges(node);
- os_ << "\n";
- }
-
- void PrintEdges(Node* node) {
- for (int i = 0; i < node->InputCount(); i++) {
- Node* input = node->InputAt(i);
- if (input == NULL) continue;
- PrintEdge(node, i, input);
- }
- }
-
- void PrintEdge(Node* from, int index, Node* to) {
- if (first_edge_) {
- first_edge_ = false;
- } else {
- os_ << ",\n";
- }
- const char* edge_type = NULL;
- if (index < NodeProperties::FirstValueIndex(from)) {
- edge_type = "unknown";
- } else if (index < NodeProperties::FirstContextIndex(from)) {
- edge_type = "value";
- } else if (index < NodeProperties::FirstFrameStateIndex(from)) {
- edge_type = "context";
- } else if (index < NodeProperties::FirstEffectIndex(from)) {
- edge_type = "frame-state";
- } else if (index < NodeProperties::FirstControlIndex(from)) {
- edge_type = "effect";
- } else {
- edge_type = "control";
- }
- os_ << "{\"source\":" << SafeId(to) << ",\"target\":" << SafeId(from)
- << ",\"index\":" << index << ",\"type\":\"" << edge_type << "\"}";
- }
-
- private:
- std::ostream& os_;
- AllNodes all_;
- bool first_edge_;
-
- DISALLOW_COPY_AND_ASSIGN(JSONGraphEdgeWriter);
-};
-
-
-std::ostream& operator<<(std::ostream& os, const AsJSON& ad) {
- Zone tmp_zone;
- os << "{\n\"nodes\":[";
- JSONGraphNodeWriter(os, &tmp_zone, &ad.graph, ad.positions).Print();
- os << "],\n\"edges\":[";
- JSONGraphEdgeWriter(os, &tmp_zone, &ad.graph).Print();
- os << "]}";
- return os;
-}
-
-
-class GraphVisualizer {
- public:
- GraphVisualizer(std::ostream& os, Zone* zone, const Graph* graph)
- : all_(zone, graph), os_(os) {}
-
- void Print();
-
- void PrintNode(Node* node, bool gray);
-
- private:
- void PrintEdge(Edge edge);
-
- AllNodes all_;
- std::ostream& os_;
-
- DISALLOW_COPY_AND_ASSIGN(GraphVisualizer);
-};
-
-
-static Node* GetControlCluster(Node* node) {
- if (OperatorProperties::IsBasicBlockBegin(node->op())) {
- return node;
- } else if (node->op()->ControlInputCount() == 1) {
- Node* control = NodeProperties::GetControlInput(node, 0);
- return control != NULL &&
- OperatorProperties::IsBasicBlockBegin(control->op())
- ? control
- : NULL;
- } else {
- return NULL;
- }
-}
-
-
-void GraphVisualizer::PrintNode(Node* node, bool gray) {
- Node* control_cluster = GetControlCluster(node);
- if (control_cluster != NULL) {
- os_ << " subgraph cluster_BasicBlock" << control_cluster->id() << " {\n";
- }
- os_ << " ID" << SafeId(node) << " [\n";
-
- os_ << " shape=\"record\"\n";
- switch (node->opcode()) {
- case IrOpcode::kEnd:
- case IrOpcode::kDead:
- case IrOpcode::kStart:
- os_ << " style=\"diagonals\"\n";
- break;
- case IrOpcode::kMerge:
- case IrOpcode::kIfTrue:
- case IrOpcode::kIfFalse:
- case IrOpcode::kLoop:
- os_ << " style=\"rounded\"\n";
- break;
- default:
- break;
- }
-
- if (gray) {
- os_ << " style=\"filled\"\n"
- << " fillcolor=\"" DEAD_COLOR "\"\n";
- }
-
- std::ostringstream label;
- label << *node->op();
- os_ << " label=\"{{#" << SafeId(node) << ":" << Escaped(label);
-
- auto i = node->input_edges().begin();
- for (int j = node->op()->ValueInputCount(); j > 0; ++i, j--) {
- os_ << "|<I" << (*i).index() << ">#" << SafeId((*i).to());
- }
- for (int j = OperatorProperties::GetContextInputCount(node->op()); j > 0;
- ++i, j--) {
- os_ << "|<I" << (*i).index() << ">X #" << SafeId((*i).to());
- }
- for (int j = OperatorProperties::GetFrameStateInputCount(node->op()); j > 0;
- ++i, j--) {
- os_ << "|<I" << (*i).index() << ">F #" << SafeId((*i).to());
- }
- for (int j = node->op()->EffectInputCount(); j > 0; ++i, j--) {
- os_ << "|<I" << (*i).index() << ">E #" << SafeId((*i).to());
- }
-
- if (OperatorProperties::IsBasicBlockBegin(node->op()) ||
- GetControlCluster(node) == NULL) {
- for (int j = node->op()->ControlInputCount(); j > 0; ++i, j--) {
- os_ << "|<I" << (*i).index() << ">C #" << SafeId((*i).to());
- }
- }
- os_ << "}";
-
- if (FLAG_trace_turbo_types && NodeProperties::IsTyped(node)) {
- Bounds bounds = NodeProperties::GetBounds(node);
- std::ostringstream upper;
- bounds.upper->PrintTo(upper);
- std::ostringstream lower;
- bounds.lower->PrintTo(lower);
- os_ << "|" << Escaped(upper) << "|" << Escaped(lower);
- }
- os_ << "}\"\n";
-
- os_ << " ]\n";
- if (control_cluster != NULL) os_ << " }\n";
-}
-
-
-static bool IsLikelyBackEdge(Node* from, int index, Node* to) {
- if (NodeProperties::IsPhi(from)) {
- Node* control = NodeProperties::GetControlInput(from, 0);
- return control != NULL && control->opcode() != IrOpcode::kMerge &&
- control != to && index != 0;
- } else if (from->opcode() == IrOpcode::kLoop) {
- return index != 0;
- } else {
- return false;
- }
-}
-
-
-void GraphVisualizer::PrintEdge(Edge edge) {
- Node* from = edge.from();
- int index = edge.index();
- Node* to = edge.to();
-
- if (!all_.IsLive(to)) return; // skip inputs that point to dead or NULL.
-
- bool unconstrained = IsLikelyBackEdge(from, index, to);
- os_ << " ID" << SafeId(from);
-
- if (OperatorProperties::IsBasicBlockBegin(from->op()) ||
- GetControlCluster(from) == NULL ||
- (from->op()->ControlInputCount() > 0 &&
- NodeProperties::GetControlInput(from) != to)) {
- os_ << ":I" << index << ":n -> ID" << SafeId(to) << ":s"
- << "[" << (unconstrained ? "constraint=false, " : "")
- << (NodeProperties::IsControlEdge(edge) ? "style=bold, " : "")
- << (NodeProperties::IsEffectEdge(edge) ? "style=dotted, " : "")
- << (NodeProperties::IsContextEdge(edge) ? "style=dashed, " : "") << "]";
- } else {
- os_ << " -> ID" << SafeId(to) << ":s [color=transparent, "
- << (unconstrained ? "constraint=false, " : "")
- << (NodeProperties::IsControlEdge(edge) ? "style=dashed, " : "") << "]";
- }
- os_ << "\n";
-}
-
-
-void GraphVisualizer::Print() {
- os_ << "digraph D {\n"
- << " node [fontsize=8,height=0.25]\n"
- << " rankdir=\"BT\"\n"
- << " ranksep=\"1.2 equally\"\n"
- << " overlap=\"false\"\n"
- << " splines=\"true\"\n"
- << " concentrate=\"true\"\n"
- << " \n";
-
- // Find all nodes that are not reachable from end that use live nodes.
- std::set<Node*> gray;
- for (Node* const node : all_.live) {
- for (Node* const use : node->uses()) {
- if (!all_.IsLive(use)) gray.insert(use);
- }
- }
-
- // Make sure all nodes have been output before writing out the edges.
- for (Node* const node : all_.live) PrintNode(node, false);
- for (Node* const node : gray) PrintNode(node, true);
-
- // With all the nodes written, add the edges.
- for (Node* const node : all_.live) {
- for (Edge edge : node->use_edges()) {
- PrintEdge(edge);
- }
- }
- os_ << "}\n";
-}
-
-
-std::ostream& operator<<(std::ostream& os, const AsDOT& ad) {
- Zone tmp_zone;
- GraphVisualizer(os, &tmp_zone, &ad.graph).Print();
- return os;
-}
-
-
-class GraphC1Visualizer {
- public:
- GraphC1Visualizer(std::ostream& os, Zone* zone); // NOLINT
-
- void PrintCompilation(const CompilationInfo* info);
- void PrintSchedule(const char* phase, const Schedule* schedule,
- const SourcePositionTable* positions,
- const InstructionSequence* instructions);
- void PrintAllocator(const char* phase, const RegisterAllocator* allocator);
- Zone* zone() const { return zone_; }
-
- private:
- void PrintIndent();
- void PrintStringProperty(const char* name, const char* value);
- void PrintLongProperty(const char* name, int64_t value);
- void PrintIntProperty(const char* name, int value);
- void PrintBlockProperty(const char* name, int rpo_number);
- void PrintNodeId(Node* n);
- void PrintNode(Node* n);
- void PrintInputs(Node* n);
- template <typename InputIterator>
- void PrintInputs(InputIterator* i, int count, const char* prefix);
- void PrintType(Node* node);
-
- void PrintLiveRange(LiveRange* range, const char* type);
- class Tag FINAL BASE_EMBEDDED {
- public:
- Tag(GraphC1Visualizer* visualizer, const char* name) {
- name_ = name;
- visualizer_ = visualizer;
- visualizer->PrintIndent();
- visualizer_->os_ << "begin_" << name << "\n";
- visualizer->indent_++;
- }
-
- ~Tag() {
- visualizer_->indent_--;
- visualizer_->PrintIndent();
- visualizer_->os_ << "end_" << name_ << "\n";
- DCHECK(visualizer_->indent_ >= 0);
- }
-
- private:
- GraphC1Visualizer* visualizer_;
- const char* name_;
- };
-
- std::ostream& os_;
- int indent_;
- Zone* zone_;
-
- DISALLOW_COPY_AND_ASSIGN(GraphC1Visualizer);
-};
-
-
-void GraphC1Visualizer::PrintIndent() {
- for (int i = 0; i < indent_; i++) {
- os_ << " ";
- }
-}
-
-
-GraphC1Visualizer::GraphC1Visualizer(std::ostream& os, Zone* zone)
- : os_(os), indent_(0), zone_(zone) {}
-
-
-void GraphC1Visualizer::PrintStringProperty(const char* name,
- const char* value) {
- PrintIndent();
- os_ << name << " \"" << value << "\"\n";
-}
-
-
-void GraphC1Visualizer::PrintLongProperty(const char* name, int64_t value) {
- PrintIndent();
- os_ << name << " " << static_cast<int>(value / 1000) << "\n";
-}
-
-
-void GraphC1Visualizer::PrintBlockProperty(const char* name, int rpo_number) {
- PrintIndent();
- os_ << name << " \"B" << rpo_number << "\"\n";
-}
-
-
-void GraphC1Visualizer::PrintIntProperty(const char* name, int value) {
- PrintIndent();
- os_ << name << " " << value << "\n";
-}
-
-
-void GraphC1Visualizer::PrintCompilation(const CompilationInfo* info) {
- Tag tag(this, "compilation");
- if (info->IsOptimizing()) {
- Handle<String> name = info->function()->debug_name();
- PrintStringProperty("name", name->ToCString().get());
- PrintIndent();
- os_ << "method \"" << name->ToCString().get() << ":"
- << info->optimization_id() << "\"\n";
- } else {
- CodeStub::Major major_key = info->code_stub()->MajorKey();
- PrintStringProperty("name", CodeStub::MajorName(major_key, false));
- PrintStringProperty("method", "stub");
- }
- PrintLongProperty("date",
- static_cast<int64_t>(base::OS::TimeCurrentMillis()));
-}
-
-
-void GraphC1Visualizer::PrintNodeId(Node* n) { os_ << "n" << SafeId(n); }
-
-
-void GraphC1Visualizer::PrintNode(Node* n) {
- PrintNodeId(n);
- os_ << " " << *n->op() << " ";
- PrintInputs(n);
-}
-
-
-template <typename InputIterator>
-void GraphC1Visualizer::PrintInputs(InputIterator* i, int count,
- const char* prefix) {
- if (count > 0) {
- os_ << prefix;
- }
- while (count > 0) {
- os_ << " ";
- PrintNodeId(**i);
- ++(*i);
- count--;
- }
-}
-
-
-void GraphC1Visualizer::PrintInputs(Node* node) {
- auto i = node->inputs().begin();
- PrintInputs(&i, node->op()->ValueInputCount(), " ");
- PrintInputs(&i, OperatorProperties::GetContextInputCount(node->op()),
- " Ctx:");
- PrintInputs(&i, OperatorProperties::GetFrameStateInputCount(node->op()),
- " FS:");
- PrintInputs(&i, node->op()->EffectInputCount(), " Eff:");
- PrintInputs(&i, node->op()->ControlInputCount(), " Ctrl:");
-}
-
-
-void GraphC1Visualizer::PrintType(Node* node) {
- if (NodeProperties::IsTyped(node)) {
- Bounds bounds = NodeProperties::GetBounds(node);
- os_ << " type:";
- bounds.upper->PrintTo(os_);
- os_ << "..";
- bounds.lower->PrintTo(os_);
- }
-}
-
-
-void GraphC1Visualizer::PrintSchedule(const char* phase,
- const Schedule* schedule,
- const SourcePositionTable* positions,
- const InstructionSequence* instructions) {
- Tag tag(this, "cfg");
- PrintStringProperty("name", phase);
- const BasicBlockVector* rpo = schedule->rpo_order();
- for (size_t i = 0; i < rpo->size(); i++) {
- BasicBlock* current = (*rpo)[i];
- Tag block_tag(this, "block");
- PrintBlockProperty("name", current->rpo_number());
- PrintIntProperty("from_bci", -1);
- PrintIntProperty("to_bci", -1);
-
- PrintIndent();
- os_ << "predecessors";
- for (BasicBlock* predecessor : current->predecessors()) {
- os_ << " \"B" << predecessor->rpo_number() << "\"";
- }
- os_ << "\n";
-
- PrintIndent();
- os_ << "successors";
- for (BasicBlock* successor : current->successors()) {
- os_ << " \"B" << successor->rpo_number() << "\"";
- }
- os_ << "\n";
-
- PrintIndent();
- os_ << "xhandlers\n";
-
- PrintIndent();
- os_ << "flags\n";
-
- if (current->dominator() != NULL) {
- PrintBlockProperty("dominator", current->dominator()->rpo_number());
- }
-
- PrintIntProperty("loop_depth", current->loop_depth());
-
- const InstructionBlock* instruction_block =
- instructions->InstructionBlockAt(
- RpoNumber::FromInt(current->rpo_number()));
- if (instruction_block->code_start() >= 0) {
- int first_index = instruction_block->first_instruction_index();
- int last_index = instruction_block->last_instruction_index();
- PrintIntProperty("first_lir_id", LifetimePosition::FromInstructionIndex(
- first_index).Value());
- PrintIntProperty("last_lir_id", LifetimePosition::FromInstructionIndex(
- last_index).Value());
- }
-
- {
- Tag states_tag(this, "states");
- Tag locals_tag(this, "locals");
- int total = 0;
- for (BasicBlock::const_iterator i = current->begin(); i != current->end();
- ++i) {
- if ((*i)->opcode() == IrOpcode::kPhi) total++;
- }
- PrintIntProperty("size", total);
- PrintStringProperty("method", "None");
- int index = 0;
- for (BasicBlock::const_iterator i = current->begin(); i != current->end();
- ++i) {
- if ((*i)->opcode() != IrOpcode::kPhi) continue;
- PrintIndent();
- os_ << index << " ";
- PrintNodeId(*i);
- os_ << " [";
- PrintInputs(*i);
- os_ << "]\n";
- index++;
- }
- }
-
- {
- Tag HIR_tag(this, "HIR");
- for (BasicBlock::const_iterator i = current->begin(); i != current->end();
- ++i) {
- Node* node = *i;
- if (node->opcode() == IrOpcode::kPhi) continue;
- int uses = node->UseCount();
- PrintIndent();
- os_ << "0 " << uses << " ";
- PrintNode(node);
- if (FLAG_trace_turbo_types) {
- os_ << " ";
- PrintType(node);
- }
- if (positions != NULL) {
- SourcePosition position = positions->GetSourcePosition(node);
- if (!position.IsUnknown()) {
- DCHECK(!position.IsInvalid());
- os_ << " pos:" << position.raw();
- }
- }
- os_ << " <|@\n";
- }
-
- BasicBlock::Control control = current->control();
- if (control != BasicBlock::kNone) {
- PrintIndent();
- os_ << "0 0 ";
- if (current->control_input() != NULL) {
- PrintNode(current->control_input());
- } else {
- os_ << -1 - current->rpo_number() << " Goto";
- }
- os_ << " ->";
- for (BasicBlock* successor : current->successors()) {
- os_ << " B" << successor->rpo_number();
- }
- if (FLAG_trace_turbo_types && current->control_input() != NULL) {
- os_ << " ";
- PrintType(current->control_input());
- }
- os_ << " <|@\n";
- }
- }
-
- if (instructions != NULL) {
- Tag LIR_tag(this, "LIR");
- for (int j = instruction_block->first_instruction_index();
- j <= instruction_block->last_instruction_index(); j++) {
- PrintIndent();
- PrintableInstruction printable = {RegisterConfiguration::ArchDefault(),
- instructions->InstructionAt(j)};
- os_ << j << " " << printable << " <|@\n";
- }
- }
- }
-}
-
-
-void GraphC1Visualizer::PrintAllocator(const char* phase,
- const RegisterAllocator* allocator) {
- Tag tag(this, "intervals");
- PrintStringProperty("name", phase);
-
- for (auto range : allocator->fixed_double_live_ranges()) {
- PrintLiveRange(range, "fixed");
- }
-
- for (auto range : allocator->fixed_live_ranges()) {
- PrintLiveRange(range, "fixed");
- }
-
- for (auto range : allocator->live_ranges()) {
- PrintLiveRange(range, "object");
- }
-}
-
-
-void GraphC1Visualizer::PrintLiveRange(LiveRange* range, const char* type) {
- if (range != NULL && !range->IsEmpty()) {
- PrintIndent();
- os_ << range->id() << " " << type;
- if (range->HasRegisterAssigned()) {
- InstructionOperand op = range->GetAssignedOperand();
- int assigned_reg = op.index();
- if (op.IsDoubleRegister()) {
- os_ << " \"" << DoubleRegister::AllocationIndexToString(assigned_reg)
- << "\"";
- } else {
- DCHECK(op.IsRegister());
- os_ << " \"" << Register::AllocationIndexToString(assigned_reg) << "\"";
- }
- } else if (range->IsSpilled()) {
- int index = -1;
- if (range->TopLevel()->HasSpillRange()) {
- index = kMaxInt; // This hasn't been set yet.
- } else {
- index = range->TopLevel()->GetSpillOperand()->index();
- }
- if (range->TopLevel()->Kind() == DOUBLE_REGISTERS) {
- os_ << " \"double_stack:" << index << "\"";
- } else if (range->TopLevel()->Kind() == GENERAL_REGISTERS) {
- os_ << " \"stack:" << index << "\"";
- } else {
- os_ << " \"const(nostack):" << index << "\"";
- }
- }
- int parent_index = -1;
- if (range->IsChild()) {
- parent_index = range->parent()->id();
- } else {
- parent_index = range->id();
- }
- InstructionOperand* op = range->FirstHint();
- int hint_index = -1;
- if (op != NULL && op->IsUnallocated()) {
- hint_index = UnallocatedOperand::cast(op)->virtual_register();
- }
- os_ << " " << parent_index << " " << hint_index;
- UseInterval* cur_interval = range->first_interval();
- while (cur_interval != NULL && range->Covers(cur_interval->start())) {
- os_ << " [" << cur_interval->start().Value() << ", "
- << cur_interval->end().Value() << "[";
- cur_interval = cur_interval->next();
- }
-
- UsePosition* current_pos = range->first_pos();
- while (current_pos != NULL) {
- if (current_pos->RegisterIsBeneficial() || FLAG_trace_all_uses) {
- os_ << " " << current_pos->pos().Value() << " M";
- }
- current_pos = current_pos->next();
- }
-
- os_ << " \"\"\n";
- }
-}
-
-
-std::ostream& operator<<(std::ostream& os, const AsC1VCompilation& ac) {
- Zone tmp_zone;
- GraphC1Visualizer(os, &tmp_zone).PrintCompilation(ac.info_);
- return os;
-}
-
-
-std::ostream& operator<<(std::ostream& os, const AsC1V& ac) {
- Zone tmp_zone;
- GraphC1Visualizer(os, &tmp_zone)
- .PrintSchedule(ac.phase_, ac.schedule_, ac.positions_, ac.instructions_);
- return os;
-}
-
-
-std::ostream& operator<<(std::ostream& os, const AsC1VAllocator& ac) {
- Zone tmp_zone;
- GraphC1Visualizer(os, &tmp_zone).PrintAllocator(ac.phase_, ac.allocator_);
- return os;
-}
-
-const int kUnvisited = 0;
-const int kOnStack = 1;
-const int kVisited = 2;
-
-std::ostream& operator<<(std::ostream& os, const AsRPO& ar) {
- Zone local_zone;
- ZoneVector<byte> state(ar.graph.NodeCount(), kUnvisited, &local_zone);
- ZoneStack<Node*> stack(&local_zone);
-
- stack.push(ar.graph.end());
- state[ar.graph.end()->id()] = kOnStack;
- while (!stack.empty()) {
- Node* n = stack.top();
- bool pop = true;
- for (Node* const i : n->inputs()) {
- if (state[i->id()] == kUnvisited) {
- state[i->id()] = kOnStack;
- stack.push(i);
- pop = false;
- break;
- }
- }
- if (pop) {
- state[n->id()] = kVisited;
- stack.pop();
- os << "#" << n->id() << ":" << *n->op() << "(";
- int j = 0;
- for (Node* const i : n->inputs()) {
- if (j++ > 0) os << ", ";
- os << "#" << SafeId(i) << ":" << SafeMnemonic(i);
- }
- os << ")" << std::endl;
- }
- }
- return os;
-}
-}
-}
-} // namespace v8::internal::compiler
« no previous file with comments | « src/compiler/graph-visualizer.h ('k') | src/compiler/js-inlining.cc » ('j') | src/compiler/visualizer.cc » ('J')

Powered by Google App Engine
This is Rietveld 408576698