OLD | NEW |
1 // Copyright 2015 the V8 project authors. All rights reserved. | 1 // Copyright 2015 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-trimmer.h" | 5 #include "src/compiler/graph-trimmer.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 GraphTrimmer::GraphTrimmer(Zone* zone, Graph* graph) | 13 GraphTrimmer::GraphTrimmer(Zone* zone, Graph* graph) |
14 : graph_(graph), is_live_(graph, 2), live_(zone) { | 14 : graph_(graph), is_live_(graph, 2), live_(zone) { |
15 live_.reserve(graph->NodeCount()); | 15 live_.reserve(graph->NodeCount()); |
16 } | 16 } |
17 | 17 |
18 | 18 |
19 GraphTrimmer::~GraphTrimmer() {} | 19 GraphTrimmer::~GraphTrimmer() {} |
20 | 20 |
21 | 21 |
22 void GraphTrimmer::TrimGraph() { | 22 void GraphTrimmer::TrimGraph() { |
23 // Mark end node as live. | 23 // Mark end node as live. |
24 MarkAsLive(graph()->end()); | 24 MarkAsLive(graph()->end()); |
25 // Compute transitive closure of live nodes. | 25 // Compute transitive closure of live nodes. |
26 for (size_t i = 0; i < live_.size(); ++i) { | 26 for (size_t i = 0; i < live_.size(); ++i) { |
27 for (Node* const input : live_[i]->inputs()) { | 27 for (Node* const input : live_[i]->inputs()) MarkAsLive(input); |
28 DCHECK_EQ(IsLive(input), | |
29 std::find(live_.begin(), live_.end(), input) != live_.end()); | |
30 MarkAsLive(input); | |
31 } | |
32 } | 28 } |
33 // Remove dead->live edges. | 29 // Remove dead->live edges. |
34 for (Node* const live : live_) { | 30 for (Node* const live : live_) { |
35 DCHECK(IsLive(live)); | 31 DCHECK(IsLive(live)); |
36 for (Edge edge : live->use_edges()) { | 32 for (Edge edge : live->use_edges()) { |
37 Node* const user = edge.from(); | 33 Node* const user = edge.from(); |
38 DCHECK_EQ(IsLive(user), | |
39 std::find(live_.begin(), live_.end(), user) != live_.end()); | |
40 if (!IsLive(user)) { | 34 if (!IsLive(user)) { |
41 if (FLAG_trace_turbo_reduction) { | 35 if (FLAG_trace_turbo_reduction) { |
42 OFStream os(stdout); | 36 OFStream os(stdout); |
43 os << "DeadLink: " << *user << "(" << edge.index() << ") -> " << *live | 37 os << "DeadLink: " << *user << "(" << edge.index() << ") -> " << *live |
44 << std::endl; | 38 << std::endl; |
45 } | 39 } |
46 edge.UpdateTo(nullptr); | 40 edge.UpdateTo(nullptr); |
47 } | 41 } |
48 } | 42 } |
49 } | 43 } |
50 } | 44 } |
51 | 45 |
52 } // namespace compiler | 46 } // namespace compiler |
53 } // namespace internal | 47 } // namespace internal |
54 } // namespace v8 | 48 } // namespace v8 |
OLD | NEW |