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/all-nodes.h" | 5 #include "src/compiler/all-nodes.h" |
6 | 6 |
7 #include "src/compiler/graph.h" | 7 #include "src/compiler/graph.h" |
8 | 8 |
9 namespace v8 { | 9 namespace v8 { |
10 namespace internal { | 10 namespace internal { |
11 namespace compiler { | 11 namespace compiler { |
12 | 12 |
13 AllNodes::AllNodes(Zone* local_zone, const Graph* graph) | 13 AllNodes::AllNodes(Zone* local_zone, const Graph* graph) |
14 : live(local_zone), is_live(graph->NodeCount(), false, local_zone) { | 14 : live(local_zone), is_live(graph->NodeCount(), false, local_zone) { |
15 Node* end = graph->end(); | 15 Mark(local_zone, graph->end(), graph); |
| 16 } |
| 17 |
| 18 AllNodes::AllNodes(Zone* local_zone, Node* end, const Graph* graph) |
| 19 : live(local_zone), is_live(graph->NodeCount(), false, local_zone) { |
| 20 Mark(local_zone, end, graph); |
| 21 } |
| 22 |
| 23 void AllNodes::Mark(Zone* local_zone, Node* end, const Graph* graph) { |
| 24 DCHECK_LT(end->id(), graph->NodeCount()); |
16 is_live[end->id()] = true; | 25 is_live[end->id()] = true; |
17 live.push_back(end); | 26 live.push_back(end); |
18 // Find all live nodes reachable from end. | 27 // Find all live nodes reachable from end. |
19 for (size_t i = 0; i < live.size(); i++) { | 28 for (size_t i = 0; i < live.size(); i++) { |
20 for (Node* const input : live[i]->inputs()) { | 29 for (Node* const input : live[i]->inputs()) { |
21 if (input == nullptr) { | 30 if (input == nullptr) { |
22 // TODO(titzer): print a warning. | 31 // TODO(titzer): print a warning. |
23 continue; | 32 continue; |
24 } | 33 } |
25 if (input->id() >= graph->NodeCount()) { | 34 if (input->id() >= graph->NodeCount()) { |
26 // TODO(titzer): print a warning. | 35 // TODO(titzer): print a warning. |
27 continue; | 36 continue; |
28 } | 37 } |
29 if (!is_live[input->id()]) { | 38 if (!is_live[input->id()]) { |
30 is_live[input->id()] = true; | 39 is_live[input->id()] = true; |
31 live.push_back(input); | 40 live.push_back(input); |
32 } | 41 } |
33 } | 42 } |
34 } | 43 } |
35 } | 44 } |
36 | 45 |
37 } // namespace compiler | 46 } // namespace compiler |
38 } // namespace internal | 47 } // namespace internal |
39 } // namespace v8 | 48 } // namespace v8 |
OLD | NEW |