OLD | NEW |
1 // Copyright 2014 the V8 project authors. All rights reserved. | 1 // Copyright 2014 the V8 project authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 #include "src/compiler/graph-replay.h" | 5 #include "src/compiler/graph-replay.h" |
6 | 6 |
7 #include "src/compiler/all-nodes.h" | 7 #include "src/compiler/all-nodes.h" |
8 #include "src/compiler/common-operator.h" | 8 #include "src/compiler/common-operator.h" |
9 #include "src/compiler/graph.h" | 9 #include "src/compiler/graph.h" |
10 #include "src/compiler/node.h" | 10 #include "src/compiler/node.h" |
11 #include "src/compiler/operator.h" | 11 #include "src/compiler/operator.h" |
12 #include "src/compiler/operator-properties.h" | 12 #include "src/compiler/operator-properties.h" |
13 | 13 |
14 namespace v8 { | 14 namespace v8 { |
15 namespace internal { | 15 namespace internal { |
16 namespace compiler { | 16 namespace compiler { |
17 | 17 |
18 #ifdef DEBUG | 18 #ifdef DEBUG |
19 | 19 |
20 void GraphReplayPrinter::PrintReplay(Graph* graph) { | 20 void GraphReplayPrinter::PrintReplay(Graph* graph) { |
21 GraphReplayPrinter replay; | 21 GraphReplayPrinter replay; |
22 PrintF(" Node* nil = graph()->NewNode(common()->Dead());\n"); | 22 PrintF(" Node* nil = graph()->NewNode(common()->Dead());\n"); |
23 Zone zone(graph->zone()->allocator()); | 23 Zone zone(graph->zone()->allocator(), ZONE_NAME); |
24 AllNodes nodes(&zone, graph); | 24 AllNodes nodes(&zone, graph); |
25 | 25 |
26 // Allocate the nodes first. | 26 // Allocate the nodes first. |
27 for (Node* node : nodes.reachable) { | 27 for (Node* node : nodes.reachable) { |
28 PrintReplayOpCreator(node->op()); | 28 PrintReplayOpCreator(node->op()); |
29 PrintF(" Node* n%d = graph()->NewNode(op", node->id()); | 29 PrintF(" Node* n%d = graph()->NewNode(op", node->id()); |
30 for (int i = 0; i < node->InputCount(); ++i) { | 30 for (int i = 0; i < node->InputCount(); ++i) { |
31 PrintF(", nil"); | 31 PrintF(", nil"); |
32 } | 32 } |
33 PrintF("); USE(n%d);\n", node->id()); | 33 PrintF("); USE(n%d);\n", node->id()); |
(...skipping 49 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
83 break; | 83 break; |
84 } | 84 } |
85 PrintF(");\n"); | 85 PrintF(");\n"); |
86 } | 86 } |
87 | 87 |
88 #endif // DEBUG | 88 #endif // DEBUG |
89 | 89 |
90 } // namespace compiler | 90 } // namespace compiler |
91 } // namespace internal | 91 } // namespace internal |
92 } // namespace v8 | 92 } // namespace v8 |
OLD | NEW |