OLD | NEW |
1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2013 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/node.h" | 5 #include "src/compiler/node.h" |
6 #include "src/compiler/graph.h" | 6 #include "src/compiler/graph.h" |
7 #include "src/zone.h" | 7 #include "src/zone.h" |
8 | 8 |
9 namespace v8 { | 9 namespace v8 { |
10 namespace internal { | 10 namespace internal { |
11 namespace compiler { | 11 namespace compiler { |
12 | 12 |
13 Node::Node(Graph* graph, int input_count, int reserve_input_count) | 13 Node::Node(Graph* graph, int input_count, int reserve_input_count) |
14 : NodeData(graph->zone()), | 14 : input_count_(input_count), |
15 input_count_(input_count), | |
16 reserve_input_count_(reserve_input_count), | 15 reserve_input_count_(reserve_input_count), |
17 has_appendable_inputs_(false), | 16 has_appendable_inputs_(false), |
18 use_count_(0), | 17 use_count_(0), |
19 first_use_(NULL), | 18 first_use_(NULL), |
20 last_use_(NULL) { | 19 last_use_(NULL) { |
21 DCHECK(reserve_input_count <= kMaxReservedInputs); | 20 DCHECK(reserve_input_count <= kMaxReservedInputs); |
22 inputs_.static_ = reinterpret_cast<Input*>(this + 1); | 21 inputs_.static_ = reinterpret_cast<Input*>(this + 1); |
23 id_ = graph->NextNodeID(); | 22 id_ = graph->NextNodeID(); |
24 } | 23 } |
25 | 24 |
(...skipping 68 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
94 os << n.InputAt(i)->id(); | 93 os << n.InputAt(i)->id(); |
95 } | 94 } |
96 os << ")"; | 95 os << ")"; |
97 } | 96 } |
98 return os; | 97 return os; |
99 } | 98 } |
100 | 99 |
101 } // namespace compiler | 100 } // namespace compiler |
102 } // namespace internal | 101 } // namespace internal |
103 } // namespace v8 | 102 } // namespace v8 |
OLD | NEW |