1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
|
// Copyright 2014 the V8 project authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "src/compiler/simplified-operator-reducer.h"
#include "src/compiler/js-graph.h"
#include "src/compiler/machine-operator.h"
#include "src/compiler/node-matchers.h"
#include "src/compiler/operator-properties.h"
#include "src/compiler/simplified-operator.h"
#include "src/compiler/type-cache.h"
#include "src/numbers/conversions-inl.h"
namespace v8 {
namespace internal {
namespace compiler {
namespace {
Decision DecideObjectIsSmi(Node* const input) {
NumberMatcher m(input);
if (m.HasValue()) {
return IsSmiDouble(m.Value()) ? Decision::kTrue : Decision::kFalse;
}
if (m.IsAllocate()) return Decision::kFalse;
if (m.IsChangeBitToTagged()) return Decision::kFalse;
if (m.IsChangeInt31ToTaggedSigned()) return Decision::kTrue;
if (m.IsHeapConstant()) return Decision::kFalse;
return Decision::kUnknown;
}
} // namespace
SimplifiedOperatorReducer::SimplifiedOperatorReducer(Editor* editor,
JSGraph* jsgraph,
JSHeapBroker* broker)
: AdvancedReducer(editor), jsgraph_(jsgraph), broker_(broker) {}
SimplifiedOperatorReducer::~SimplifiedOperatorReducer() = default;
Reduction SimplifiedOperatorReducer::Reduce(Node* node) {
DisallowHeapAccess no_heap_access;
switch (node->opcode()) {
case IrOpcode::kBooleanNot: {
// TODO(neis): Provide HeapObjectRefMatcher?
HeapObjectMatcher m(node->InputAt(0));
if (m.Is(factory()->true_value())) return ReplaceBoolean(false);
if (m.Is(factory()->false_value())) return ReplaceBoolean(true);
if (m.IsBooleanNot()) return Replace(m.InputAt(0));
break;
}
case IrOpcode::kChangeBitToTagged: {
Int32Matcher m(node->InputAt(0));
if (m.Is(0)) return Replace(jsgraph()->FalseConstant());
if (m.Is(1)) return Replace(jsgraph()->TrueConstant());
if (m.IsChangeTaggedToBit()) return Replace(m.InputAt(0));
break;
}
case IrOpcode::kChangeTaggedToBit: {
HeapObjectMatcher m(node->InputAt(0));
if (m.HasValue()) {
return ReplaceInt32(m.Ref(broker()).BooleanValue());
}
if (m.IsChangeBitToTagged()) return Replace(m.InputAt(0));
break;
}
case IrOpcode::kChangeFloat64ToTagged: {
Float64Matcher m(node->InputAt(0));
if (m.HasValue()) return ReplaceNumber(m.Value());
if (m.IsChangeTaggedToFloat64()) return Replace(m.node()->InputAt(0));
break;
}
case IrOpcode::kChangeInt31ToTaggedSigned:
case IrOpcode::kChangeInt32ToTagged: {
Int32Matcher m(node->InputAt(0));
if (m.HasValue()) return ReplaceNumber(m.Value());
if (m.IsChangeTaggedToInt32() || m.IsChangeTaggedSignedToInt32()) {
return Replace(m.InputAt(0));
}
break;
}
case IrOpcode::kChangeTaggedToFloat64:
case IrOpcode::kTruncateTaggedToFloat64: {
NumberMatcher m(node->InputAt(0));
if (m.HasValue()) return ReplaceFloat64(m.Value());
if (m.IsChangeFloat64ToTagged() || m.IsChangeFloat64ToTaggedPointer()) {
return Replace(m.node()->InputAt(0));
}
if (m.IsChangeInt31ToTaggedSigned() || m.IsChangeInt32ToTagged()) {
return Change(node, machine()->ChangeInt32ToFloat64(), m.InputAt(0));
}
if (m.IsChangeUint32ToTagged()) {
return Change(node, machine()->ChangeUint32ToFloat64(), m.InputAt(0));
}
break;
}
case IrOpcode::kChangeTaggedSignedToInt32:
case IrOpcode::kChangeTaggedToInt32: {
NumberMatcher m(node->InputAt(0));
if (m.HasValue()) return ReplaceInt32(DoubleToInt32(m.Value()));
if (m.IsChangeFloat64ToTagged() || m.IsChangeFloat64ToTaggedPointer()) {
return Change(node, machine()->ChangeFloat64ToInt32(), m.InputAt(0));
}
if (m.IsChangeInt31ToTaggedSigned() || m.IsChangeInt32ToTagged()) {
return Replace(m.InputAt(0));
}
if (m.IsChangeCompressedSignedToTaggedSigned()) {
Node* new_node = graph()->NewNode(
simplified()->ChangeCompressedSignedToInt32(), m.InputAt(0));
return Replace(new_node);
}
break;
}
case IrOpcode::kChangeTaggedToUint32: {
NumberMatcher m(node->InputAt(0));
if (m.HasValue()) return ReplaceUint32(DoubleToUint32(m.Value()));
if (m.IsChangeFloat64ToTagged() || m.IsChangeFloat64ToTaggedPointer()) {
return Change(node, machine()->ChangeFloat64ToUint32(), m.InputAt(0));
}
if (m.IsChangeUint32ToTagged()) return Replace(m.InputAt(0));
break;
}
case IrOpcode::kChangeUint32ToTagged: {
Uint32Matcher m(node->InputAt(0));
if (m.HasValue()) return ReplaceNumber(FastUI2D(m.Value()));
break;
}
case IrOpcode::kTruncateTaggedToWord32: {
NumberMatcher m(node->InputAt(0));
if (m.HasValue()) return ReplaceInt32(DoubleToInt32(m.Value()));
if (m.IsChangeInt31ToTaggedSigned() || m.IsChangeInt32ToTagged() ||
m.IsChangeUint32ToTagged()) {
return Replace(m.InputAt(0));
}
if (m.IsChangeFloat64ToTagged() || m.IsChangeFloat64ToTaggedPointer()) {
return Change(node, machine()->TruncateFloat64ToWord32(), m.InputAt(0));
}
break;
}
case IrOpcode::kCheckedFloat64ToInt32: {
Float64Matcher m(node->InputAt(0));
if (m.HasValue() && IsInt32Double(m.Value())) {
Node* value = jsgraph()->Int32Constant(static_cast<int32_t>(m.Value()));
ReplaceWithValue(node, value);
return Replace(value);
}
break;
}
case IrOpcode::kChangeTaggedSignedToCompressedSigned: {
DCHECK(COMPRESS_POINTERS_BOOL);
NodeMatcher m(node->InputAt(0));
if (m.IsChangeInt31ToTaggedSigned()) {
Node* new_node = graph()->NewNode(
simplified()->ChangeInt31ToCompressedSigned(), m.InputAt(0));
return Replace(new_node);
} else if (m.IsCheckedInt32ToTaggedSigned()) {
// Create a new checked node that outputs CompressedSigned values, with
// an explicit decompression after it.
Node* new_checked = graph()->CloneNode(m.node());
NodeProperties::ChangeOp(
new_checked, simplified()->CheckedInt32ToCompressedSigned(
CheckParametersOf(m.node()->op()).feedback()));
Node* new_decompression = graph()->NewNode(
machine()->ChangeCompressedSignedToTaggedSigned(), new_checked);
// For all uses of the old checked node, instead insert the new "checked
// + decompression". Also, update control and effect.
ReplaceWithValue(m.node(), new_decompression, new_checked, new_checked);
// In the current node, we can skip the decompression since we are going
// to have a Decompression + Compression combo.
return Replace(new_checked);
}
break;
}
case IrOpcode::kChangeCompressedSignedToInt32: {
NodeMatcher m(node->InputAt(0));
if (m.IsCheckedInt32ToCompressedSigned()) {
return Replace(m.InputAt(0));
}
break;
}
case IrOpcode::kCheckedTaggedToInt32:
case IrOpcode::kCheckedTaggedSignedToInt32: {
NodeMatcher m(node->InputAt(0));
if (m.IsConvertTaggedHoleToUndefined()) {
node->ReplaceInput(0, m.InputAt(0));
return Changed(node);
}
break;
}
case IrOpcode::kCheckedTaggedToTaggedPointer: {
NodeMatcher m(node->InputAt(0));
if (m.IsChangeCompressedPointerToTaggedPointer()) {
RelaxEffectsAndControls(node);
return Replace(m.node());
}
break;
}
case IrOpcode::kCheckIf: {
HeapObjectMatcher m(node->InputAt(0));
if (m.Is(factory()->true_value())) {
Node* const effect = NodeProperties::GetEffectInput(node);
return Replace(effect);
}
break;
}
case IrOpcode::kCheckNumber: {
NodeMatcher m(node->InputAt(0));
if (m.IsConvertTaggedHoleToUndefined()) {
node->ReplaceInput(0, m.InputAt(0));
return Changed(node);
}
break;
}
case IrOpcode::kCheckHeapObject: {
Node* const input = node->InputAt(0);
if (DecideObjectIsSmi(input) == Decision::kFalse) {
ReplaceWithValue(node, input);
return Replace(input);
}
NodeMatcher m(input);
if (m.IsCheckHeapObject()) {
ReplaceWithValue(node, input);
return Replace(input);
}
break;
}
case IrOpcode::kCheckSmi: {
Node* const input = node->InputAt(0);
if (DecideObjectIsSmi(input) == Decision::kTrue) {
ReplaceWithValue(node, input);
return Replace(input);
}
NodeMatcher m(input);
if (m.IsCheckSmi()) {
ReplaceWithValue(node, input);
return Replace(input);
} else if (m.IsConvertTaggedHoleToUndefined()) {
node->ReplaceInput(0, m.InputAt(0));
return Changed(node);
}
break;
}
case IrOpcode::kObjectIsSmi: {
Node* const input = node->InputAt(0);
switch (DecideObjectIsSmi(input)) {
case Decision::kTrue:
return ReplaceBoolean(true);
case Decision::kFalse:
return ReplaceBoolean(false);
case Decision::kUnknown:
break;
}
break;
}
case IrOpcode::kNumberAbs: {
NumberMatcher m(node->InputAt(0));
if (m.HasValue()) return ReplaceNumber(std::fabs(m.Value()));
break;
}
case IrOpcode::kReferenceEqual: {
HeapObjectBinopMatcher m(node);
if (m.left().node() == m.right().node()) return ReplaceBoolean(true);
break;
}
default:
break;
}
return NoChange();
}
Reduction SimplifiedOperatorReducer::Change(Node* node, const Operator* op,
Node* a) {
DCHECK_EQ(node->InputCount(), OperatorProperties::GetTotalInputCount(op));
DCHECK_LE(1, node->InputCount());
node->ReplaceInput(0, a);
NodeProperties::ChangeOp(node, op);
return Changed(node);
}
Reduction SimplifiedOperatorReducer::ReplaceBoolean(bool value) {
return Replace(jsgraph()->BooleanConstant(value));
}
Reduction SimplifiedOperatorReducer::ReplaceFloat64(double value) {
return Replace(jsgraph()->Float64Constant(value));
}
Reduction SimplifiedOperatorReducer::ReplaceInt32(int32_t value) {
return Replace(jsgraph()->Int32Constant(value));
}
Reduction SimplifiedOperatorReducer::ReplaceNumber(double value) {
return Replace(jsgraph()->Constant(value));
}
Reduction SimplifiedOperatorReducer::ReplaceNumber(int32_t value) {
return Replace(jsgraph()->Constant(value));
}
Factory* SimplifiedOperatorReducer::factory() const {
return jsgraph()->isolate()->factory();
}
Graph* SimplifiedOperatorReducer::graph() const { return jsgraph()->graph(); }
MachineOperatorBuilder* SimplifiedOperatorReducer::machine() const {
return jsgraph()->machine();
}
SimplifiedOperatorBuilder* SimplifiedOperatorReducer::simplified() const {
return jsgraph()->simplified();
}
} // namespace compiler
} // namespace internal
} // namespace v8
|
