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
|
// 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/access-builder.h"
#include "src/compiler/common-operator.h"
#include "src/compiler/diamond.h"
#include "src/compiler/js-intrinsic-builder.h"
#include "src/compiler/js-operator.h"
#include "src/compiler/simplified-operator.h"
namespace v8 {
namespace internal {
namespace compiler {
ResultAndEffect JSIntrinsicBuilder::BuildGraphFor(Runtime::FunctionId id,
const NodeVector& arguments) {
switch (id) {
case Runtime::kInlineIsSmi:
return BuildGraphFor_IsSmi(arguments);
case Runtime::kInlineIsNonNegativeSmi:
return BuildGraphFor_IsNonNegativeSmi(arguments);
case Runtime::kInlineIsArray:
return BuildMapCheck(arguments[0], arguments[2], JS_ARRAY_TYPE);
case Runtime::kInlineIsRegExp:
return BuildMapCheck(arguments[0], arguments[2], JS_REGEXP_TYPE);
case Runtime::kInlineIsFunction:
return BuildMapCheck(arguments[0], arguments[2], JS_FUNCTION_TYPE);
case Runtime::kInlineValueOf:
return BuildGraphFor_ValueOf(arguments);
default:
break;
}
return ResultAndEffect();
}
ResultAndEffect JSIntrinsicBuilder::BuildGraphFor_IsSmi(
const NodeVector& arguments) {
Node* object = arguments[0];
SimplifiedOperatorBuilder simplified(jsgraph_->zone());
Node* condition = graph()->NewNode(simplified.ObjectIsSmi(), object);
return ResultAndEffect(condition, arguments[2]);
}
ResultAndEffect JSIntrinsicBuilder::BuildGraphFor_IsNonNegativeSmi(
const NodeVector& arguments) {
Node* object = arguments[0];
SimplifiedOperatorBuilder simplified(jsgraph_->zone());
Node* condition =
graph()->NewNode(simplified.ObjectIsNonNegativeSmi(), object);
return ResultAndEffect(condition, arguments[2]);
}
/*
* if (_isSmi(object)) {
* return false
* } else {
* return %_GetMapInstanceType(object) == map_type
* }
*/
ResultAndEffect JSIntrinsicBuilder::BuildMapCheck(Node* object, Node* effect,
InstanceType map_type) {
SimplifiedOperatorBuilder simplified(jsgraph_->zone());
Node* is_smi = graph()->NewNode(simplified.ObjectIsSmi(), object);
Diamond d(graph(), common(), is_smi);
Node* map = graph()->NewNode(simplified.LoadField(AccessBuilder::ForMap()),
object, effect, d.if_false);
Node* instance_type = graph()->NewNode(
simplified.LoadField(AccessBuilder::ForMapInstanceType()), map, map,
d.if_false);
Node* has_map_type =
graph()->NewNode(jsgraph_->machine()->Word32Equal(), instance_type,
jsgraph_->Int32Constant(map_type));
Node* phi = d.Phi(static_cast<MachineType>(kTypeBool | kRepTagged),
jsgraph_->FalseConstant(), has_map_type);
Node* ephi = d.EffectPhi(effect, instance_type);
return ResultAndEffect(phi, ephi);
}
/*
* if (%_isSmi(object)) {
* return object;
* } else if (%_GetMapInstanceType(object) == JS_VALUE_TYPE) {
* return %_LoadValueField(object);
* } else {
* return object;
* }
*/
ResultAndEffect JSIntrinsicBuilder::BuildGraphFor_ValueOf(
const NodeVector& arguments) {
Node* object = arguments[0];
Node* effect = arguments[2];
SimplifiedOperatorBuilder simplified(jsgraph_->zone());
Node* is_smi = graph()->NewNode(simplified.ObjectIsSmi(), object);
Diamond if_is_smi(graph(), common(), is_smi);
Node* map = graph()->NewNode(simplified.LoadField(AccessBuilder::ForMap()),
object, effect, if_is_smi.if_false);
Node* instance_type = graph()->NewNode(
simplified.LoadField(AccessBuilder::ForMapInstanceType()), map, map,
if_is_smi.if_false);
Node* is_value =
graph()->NewNode(jsgraph_->machine()->Word32Equal(), instance_type,
jsgraph_->Constant(JS_VALUE_TYPE));
Diamond if_is_value(graph(), common(), is_value);
if_is_value.Nest(if_is_smi, false);
Node* value =
graph()->NewNode(simplified.LoadField(AccessBuilder::ForValue()), object,
instance_type, if_is_value.if_true);
Node* phi_is_value = if_is_value.Phi(kTypeAny, value, object);
Node* phi = if_is_smi.Phi(kTypeAny, object, phi_is_value);
Node* ephi = if_is_smi.EffectPhi(effect, instance_type);
return ResultAndEffect(phi, ephi);
}
}
}
} // namespace v8::internal::compiler
|
