blob: 0d296141e1486d0752b5dcb6dee6820b506595c4 [file] [log] [blame]
Ben Murdochb8a8cc12014-11-26 15:28:44 +00001// 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
3// found in the LICENSE file.
4
5#ifndef V8_COMPILER_NODE_PROPERTIES_INL_H_
6#define V8_COMPILER_NODE_PROPERTIES_INL_H_
7
8#include "src/v8.h"
9
10#include "src/compiler/common-operator.h"
Ben Murdochb8a8cc12014-11-26 15:28:44 +000011#include "src/compiler/node-properties.h"
12#include "src/compiler/opcodes.h"
13#include "src/compiler/operator.h"
Ben Murdochb8a8cc12014-11-26 15:28:44 +000014#include "src/compiler/operator-properties.h"
15
16namespace v8 {
17namespace internal {
18namespace compiler {
19
20// -----------------------------------------------------------------------------
21// Input layout.
22// Inputs are always arranged in order as follows:
23// 0 [ values, context, effects, control ] node->InputCount()
24
25inline int NodeProperties::FirstValueIndex(Node* node) { return 0; }
26
27inline int NodeProperties::FirstContextIndex(Node* node) {
28 return PastValueIndex(node);
29}
30
31inline int NodeProperties::FirstFrameStateIndex(Node* node) {
32 return PastContextIndex(node);
33}
34
35inline int NodeProperties::FirstEffectIndex(Node* node) {
36 return PastFrameStateIndex(node);
37}
38
39inline int NodeProperties::FirstControlIndex(Node* node) {
40 return PastEffectIndex(node);
41}
42
43
44inline int NodeProperties::PastValueIndex(Node* node) {
Emily Bernierd0a1eb72015-03-24 16:35:39 -040045 return FirstValueIndex(node) + node->op()->ValueInputCount();
Ben Murdochb8a8cc12014-11-26 15:28:44 +000046}
47
48inline int NodeProperties::PastContextIndex(Node* node) {
49 return FirstContextIndex(node) +
50 OperatorProperties::GetContextInputCount(node->op());
51}
52
53inline int NodeProperties::PastFrameStateIndex(Node* node) {
54 return FirstFrameStateIndex(node) +
55 OperatorProperties::GetFrameStateInputCount(node->op());
56}
57
58inline int NodeProperties::PastEffectIndex(Node* node) {
Emily Bernierd0a1eb72015-03-24 16:35:39 -040059 return FirstEffectIndex(node) + node->op()->EffectInputCount();
Ben Murdochb8a8cc12014-11-26 15:28:44 +000060}
61
62inline int NodeProperties::PastControlIndex(Node* node) {
Emily Bernierd0a1eb72015-03-24 16:35:39 -040063 return FirstControlIndex(node) + node->op()->ControlInputCount();
Ben Murdochb8a8cc12014-11-26 15:28:44 +000064}
65
66
67// -----------------------------------------------------------------------------
68// Input accessors.
69
70inline Node* NodeProperties::GetValueInput(Node* node, int index) {
Emily Bernierd0a1eb72015-03-24 16:35:39 -040071 DCHECK(0 <= index && index < node->op()->ValueInputCount());
Ben Murdochb8a8cc12014-11-26 15:28:44 +000072 return node->InputAt(FirstValueIndex(node) + index);
73}
74
75inline Node* NodeProperties::GetContextInput(Node* node) {
76 DCHECK(OperatorProperties::HasContextInput(node->op()));
77 return node->InputAt(FirstContextIndex(node));
78}
79
80inline Node* NodeProperties::GetFrameStateInput(Node* node) {
81 DCHECK(OperatorProperties::HasFrameStateInput(node->op()));
82 return node->InputAt(FirstFrameStateIndex(node));
83}
84
85inline Node* NodeProperties::GetEffectInput(Node* node, int index) {
Emily Bernierd0a1eb72015-03-24 16:35:39 -040086 DCHECK(0 <= index && index < node->op()->EffectInputCount());
Ben Murdochb8a8cc12014-11-26 15:28:44 +000087 return node->InputAt(FirstEffectIndex(node) + index);
88}
89
90inline Node* NodeProperties::GetControlInput(Node* node, int index) {
Emily Bernierd0a1eb72015-03-24 16:35:39 -040091 DCHECK(0 <= index && index < node->op()->ControlInputCount());
Ben Murdochb8a8cc12014-11-26 15:28:44 +000092 return node->InputAt(FirstControlIndex(node) + index);
93}
94
95inline int NodeProperties::GetFrameStateIndex(Node* node) {
96 DCHECK(OperatorProperties::HasFrameStateInput(node->op()));
97 return FirstFrameStateIndex(node);
98}
99
100// -----------------------------------------------------------------------------
101// Edge kinds.
102
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400103inline bool NodeProperties::IsInputRange(Edge edge, int first, int num) {
Ben Murdochb8a8cc12014-11-26 15:28:44 +0000104 // TODO(titzer): edge.index() is linear time;
105 // edges maybe need to be marked as value/effect/control.
106 if (num == 0) return false;
107 int index = edge.index();
108 return first <= index && index < first + num;
109}
110
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400111inline bool NodeProperties::IsValueEdge(Edge edge) {
Ben Murdochb8a8cc12014-11-26 15:28:44 +0000112 Node* node = edge.from();
113 return IsInputRange(edge, FirstValueIndex(node),
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400114 node->op()->ValueInputCount());
Ben Murdochb8a8cc12014-11-26 15:28:44 +0000115}
116
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400117inline bool NodeProperties::IsContextEdge(Edge edge) {
Ben Murdochb8a8cc12014-11-26 15:28:44 +0000118 Node* node = edge.from();
119 return IsInputRange(edge, FirstContextIndex(node),
120 OperatorProperties::GetContextInputCount(node->op()));
121}
122
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400123inline bool NodeProperties::IsEffectEdge(Edge edge) {
Ben Murdochb8a8cc12014-11-26 15:28:44 +0000124 Node* node = edge.from();
125 return IsInputRange(edge, FirstEffectIndex(node),
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400126 node->op()->EffectInputCount());
Ben Murdochb8a8cc12014-11-26 15:28:44 +0000127}
128
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400129inline bool NodeProperties::IsControlEdge(Edge edge) {
Ben Murdochb8a8cc12014-11-26 15:28:44 +0000130 Node* node = edge.from();
131 return IsInputRange(edge, FirstControlIndex(node),
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400132 node->op()->ControlInputCount());
Ben Murdochb8a8cc12014-11-26 15:28:44 +0000133}
134
135
136// -----------------------------------------------------------------------------
137// Miscellaneous predicates.
138
139inline bool NodeProperties::IsControl(Node* node) {
140 return IrOpcode::IsControlOpcode(node->opcode());
141}
142
143
144// -----------------------------------------------------------------------------
145// Miscellaneous mutators.
146
147inline void NodeProperties::ReplaceControlInput(Node* node, Node* control) {
148 node->ReplaceInput(FirstControlIndex(node), control);
149}
150
151inline void NodeProperties::ReplaceEffectInput(Node* node, Node* effect,
152 int index) {
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400153 DCHECK(index < node->op()->EffectInputCount());
Ben Murdochb8a8cc12014-11-26 15:28:44 +0000154 return node->ReplaceInput(FirstEffectIndex(node) + index, effect);
155}
156
157inline void NodeProperties::ReplaceFrameStateInput(Node* node,
158 Node* frame_state) {
159 DCHECK(OperatorProperties::HasFrameStateInput(node->op()));
160 node->ReplaceInput(FirstFrameStateIndex(node), frame_state);
161}
162
163inline void NodeProperties::RemoveNonValueInputs(Node* node) {
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400164 node->TrimInputCount(node->op()->ValueInputCount());
Ben Murdochb8a8cc12014-11-26 15:28:44 +0000165}
166
167
168// Replace value uses of {node} with {value} and effect uses of {node} with
169// {effect}. If {effect == NULL}, then use the effect input to {node}.
170inline void NodeProperties::ReplaceWithValue(Node* node, Node* value,
171 Node* effect) {
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400172 DCHECK(node->op()->ControlOutputCount() == 0);
173 if (effect == NULL && node->op()->EffectInputCount() > 0) {
Ben Murdochb8a8cc12014-11-26 15:28:44 +0000174 effect = NodeProperties::GetEffectInput(node);
175 }
176
177 // Requires distinguishing between value and effect edges.
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400178 for (Edge edge : node->use_edges()) {
179 if (NodeProperties::IsEffectEdge(edge)) {
Ben Murdochb8a8cc12014-11-26 15:28:44 +0000180 DCHECK_NE(NULL, effect);
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400181 edge.UpdateTo(effect);
Ben Murdochb8a8cc12014-11-26 15:28:44 +0000182 } else {
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400183 edge.UpdateTo(value);
Ben Murdochb8a8cc12014-11-26 15:28:44 +0000184 }
185 }
186}
187
188
189// -----------------------------------------------------------------------------
190// Type Bounds.
191
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400192inline bool NodeProperties::IsTyped(Node* node) {
193 Bounds bounds = node->bounds();
194 DCHECK((bounds.lower == NULL) == (bounds.upper == NULL));
195 return bounds.upper != NULL;
196}
197
198inline Bounds NodeProperties::GetBounds(Node* node) {
199 DCHECK(IsTyped(node));
200 return node->bounds();
201}
202
203inline void NodeProperties::RemoveBounds(Node* node) {
204 Bounds empty;
205 node->set_bounds(empty);
206}
Ben Murdochb8a8cc12014-11-26 15:28:44 +0000207
208inline void NodeProperties::SetBounds(Node* node, Bounds b) {
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400209 DCHECK(b.lower != NULL && b.upper != NULL);
Ben Murdochb8a8cc12014-11-26 15:28:44 +0000210 node->set_bounds(b);
211}
212
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400213inline bool NodeProperties::AllValueInputsAreTyped(Node* node) {
214 int input_count = node->op()->ValueInputCount();
215 for (int i = 0; i < input_count; ++i) {
216 if (!IsTyped(GetValueInput(node, i))) return false;
217 }
218 return true;
219}
220
Ben Murdochb8a8cc12014-11-26 15:28:44 +0000221
222}
223}
224} // namespace v8::internal::compiler
225
226#endif // V8_COMPILER_NODE_PROPERTIES_INL_H_