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
|
/*
* Copyright (C) 2015-2016 Apple Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef B3ValueInlines_h
#define B3ValueInlines_h
#if ENABLE(B3_JIT)
#include "B3CheckValue.h"
#include "B3Const32Value.h"
#include "B3Const64Value.h"
#include "B3ConstDoubleValue.h"
#include "B3ConstFloatValue.h"
#include "B3PatchpointValue.h"
#include "B3PhiChildren.h"
#include "B3Procedure.h"
#include "B3Value.h"
#include <wtf/GraphNodeWorklist.h>
namespace JSC { namespace B3 {
template<typename T>
T* Value::as()
{
if (T::accepts(opcode()))
return static_cast<T*>(this);
return nullptr;
}
template<typename T>
const T* Value::as() const
{
return const_cast<Value*>(this)->as<T>();
}
inline bool Value::isConstant() const
{
return B3::isConstant(opcode());
}
inline bool Value::isInteger() const
{
return type() == Int32 || type() == Int64;
}
inline bool Value::hasInt32() const
{
return !!as<Const32Value>();
}
inline int32_t Value::asInt32() const
{
return as<Const32Value>()->value();
}
inline bool Value::isInt32(int32_t value) const
{
return hasInt32() && asInt32() == value;
}
inline bool Value::hasInt64() const
{
return !!as<Const64Value>();
}
inline int64_t Value::asInt64() const
{
return as<Const64Value>()->value();
}
inline bool Value::isInt64(int64_t value) const
{
return hasInt64() && asInt64() == value;
}
inline bool Value::hasInt() const
{
return hasInt32() || hasInt64();
}
inline int64_t Value::asInt() const
{
return hasInt32() ? asInt32() : asInt64();
}
inline bool Value::isInt(int64_t value) const
{
return hasInt() && asInt() == value;
}
inline bool Value::hasIntPtr() const
{
if (is64Bit())
return hasInt64();
return hasInt32();
}
inline intptr_t Value::asIntPtr() const
{
if (is64Bit())
return asInt64();
return asInt32();
}
inline bool Value::isIntPtr(intptr_t value) const
{
return hasIntPtr() && asIntPtr() == value;
}
inline bool Value::hasDouble() const
{
return !!as<ConstDoubleValue>();
}
inline double Value::asDouble() const
{
return as<ConstDoubleValue>()->value();
}
inline bool Value::isEqualToDouble(double value) const
{
return hasDouble() && asDouble() == value;
}
inline bool Value::hasFloat() const
{
return !!as<ConstFloatValue>();
}
inline float Value::asFloat() const
{
return as<ConstFloatValue>()->value();
}
inline bool Value::hasNumber() const
{
return hasInt() || hasDouble() || hasFloat();
}
inline bool Value::isNegativeZero() const
{
if (hasDouble()) {
double value = asDouble();
return !value && std::signbit(value);
}
if (hasFloat()) {
float value = asFloat();
return !value && std::signbit(value);
}
return false;
}
template<typename T>
inline bool Value::representableAs() const
{
switch (opcode()) {
case Const32:
return isRepresentableAs<T>(asInt32());
case Const64:
return isRepresentableAs<T>(asInt64());
case ConstDouble:
return isRepresentableAs<T>(asDouble());
case ConstFloat:
return isRepresentableAs<T>(asFloat());
default:
return false;
}
}
template<typename T>
inline T Value::asNumber() const
{
switch (opcode()) {
case Const32:
return static_cast<T>(asInt32());
case Const64:
return static_cast<T>(asInt64());
case ConstDouble:
return static_cast<T>(asDouble());
case ConstFloat:
return static_cast<T>(asFloat());
default:
return T();
}
}
template<typename Functor>
void Value::walk(const Functor& functor, PhiChildren* phiChildren)
{
GraphNodeWorklist<Value*> worklist;
worklist.push(this);
while (Value* value = worklist.pop()) {
WalkStatus status = functor(value);
switch (status) {
case Continue:
if (value->opcode() == Phi) {
if (phiChildren)
worklist.pushAll(phiChildren->at(value).values());
} else
worklist.pushAll(value->children());
break;
case IgnoreChildren:
break;
case Stop:
return;
}
}
}
} } // namespace JSC::B3
#endif // ENABLE(B3_JIT)
#endif // B3ValueInlines_h
|
