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