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