This repository was archived by the owner on Jul 11, 2025. It is now read-only.
forked from phoboslab/JavaScriptCore-iOS
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathFTLCapabilities.cpp
More file actions
321 lines (301 loc) · 9.5 KB
/
FTLCapabilities.cpp
File metadata and controls
321 lines (301 loc) · 9.5 KB
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
/*
* Copyright (C) 2013 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.
*/
#include "config.h"
#include "FTLCapabilities.h"
#if ENABLE(FTL_JIT)
namespace JSC { namespace FTL {
using namespace DFG;
inline CapabilityLevel canCompile(Node* node)
{
// NOTE: If we ever have phantom arguments, we can compile them but we cannot
// OSR enter.
switch (node->op()) {
case JSConstant:
case WeakJSConstant:
case GetLocal:
case SetLocal:
case MovHint:
case ZombieHint:
case Phantom:
case Flush:
case PhantomLocal:
case SetArgument:
case Return:
case BitAnd:
case BitOr:
case BitXor:
case BitRShift:
case BitLShift:
case BitURShift:
case CheckStructure:
case StructureTransitionWatchpoint:
case ArrayifyToStructure:
case PutStructure:
case PhantomPutStructure:
case GetButterfly:
case NewObject:
case NewArray:
case NewArrayBuffer:
case GetByOffset:
case PutByOffset:
case GetGlobalVar:
case PutGlobalVar:
case ValueAdd:
case ArithAdd:
case ArithSub:
case ArithMul:
case ArithDiv:
case ArithMod:
case ArithMin:
case ArithMax:
case ArithAbs:
case ArithNegate:
case UInt32ToNumber:
case Int32ToDouble:
case CompareEqConstant:
case CompareStrictEqConstant:
case Jump:
case ForceOSRExit:
case Phi:
case Upsilon:
case ExtractOSREntryLocal:
case LoopHint:
case Call:
case Construct:
case GetMyScope:
case SkipScope:
case GetClosureRegisters:
case GetClosureVar:
case PutClosureVar:
case Int52ToValue:
case InvalidationPoint:
case StringCharAt:
case CheckFunction:
case StringCharCodeAt:
case AllocatePropertyStorage:
case FunctionReentryWatchpoint:
case TypedArrayWatchpoint:
case VariableWatchpoint:
case NotifyWrite:
case StoreBarrier:
case ConditionalStoreBarrier:
case StoreBarrierWithNullCheck:
case ValueToInt32:
case Branch:
case LogicalNot:
case CheckInBounds:
case ConstantStoragePointer:
case Check:
// These are OK.
break;
case GetById:
case PutById:
if (node->child1().useKind() == CellUse)
break;
return CannotCompile;
case GetIndexedPropertyStorage:
if (node->arrayMode().type() == Array::String)
break;
if (isTypedView(node->arrayMode().typedArrayType()))
break;
return CannotCompile;
case CheckArray:
switch (node->arrayMode().type()) {
case Array::Int32:
case Array::Double:
case Array::Contiguous:
break;
default:
if (isTypedView(node->arrayMode().typedArrayType()))
break;
return CannotCompile;
}
break;
case GetArrayLength:
switch (node->arrayMode().type()) {
case Array::Int32:
case Array::Double:
case Array::Contiguous:
case Array::String:
break;
default:
if (isTypedView(node->arrayMode().typedArrayType()))
break;
return CannotCompile;
}
break;
case GetByVal:
switch (node->arrayMode().type()) {
case Array::ForceExit:
case Array::Generic:
case Array::String:
case Array::Int32:
case Array::Double:
case Array::Contiguous:
break;
default:
if (isTypedView(node->arrayMode().typedArrayType()))
return CanCompileAndOSREnter;
return CannotCompile;
}
break;
case PutByVal:
case PutByValAlias:
case PutByValDirect:
switch (node->arrayMode().type()) {
case Array::ForceExit:
case Array::Generic:
case Array::Int32:
case Array::Double:
case Array::Contiguous:
break;
default:
if (isTypedView(node->arrayMode().typedArrayType()))
return CanCompileAndOSREnter;
return CannotCompile;
}
break;
case CompareEq:
if (node->isBinaryUseKind(Int32Use))
break;
if (node->isBinaryUseKind(MachineIntUse))
break;
if (node->isBinaryUseKind(NumberUse))
break;
if (node->isBinaryUseKind(ObjectUse))
break;
if (node->isBinaryUseKind(UntypedUse))
break;
return CannotCompile;
case CompareStrictEq:
if (node->isBinaryUseKind(Int32Use))
break;
if (node->isBinaryUseKind(MachineIntUse))
break;
if (node->isBinaryUseKind(NumberUse))
break;
if (node->isBinaryUseKind(ObjectUse))
break;
return CannotCompile;
case CompareLess:
case CompareLessEq:
case CompareGreater:
case CompareGreaterEq:
if (node->isBinaryUseKind(Int32Use))
break;
if (node->isBinaryUseKind(MachineIntUse))
break;
if (node->isBinaryUseKind(NumberUse))
break;
if (node->isBinaryUseKind(UntypedUse))
break;
return CannotCompile;
case Switch:
switch (node->switchData()->kind) {
case SwitchImm:
case SwitchChar:
break;
default:
return CannotCompile;
}
break;
default:
// Don't know how to handle anything else.
return CannotCompile;
}
return CanCompileAndOSREnter;
}
CapabilityLevel canCompile(Graph& graph)
{
if (graph.m_codeBlock->codeType() != FunctionCode) {
if (verboseCompilationEnabled())
dataLog("FTL rejecting code block that doesn't belong to a function.\n");
return CannotCompile;
}
CapabilityLevel result = CanCompileAndOSREnter;
for (BlockIndex blockIndex = graph.numBlocks(); blockIndex--;) {
BasicBlock* block = graph.block(blockIndex);
if (!block)
continue;
// We don't care if we can compile blocks that the CFA hasn't visited.
if (!block->cfaHasVisited)
continue;
for (unsigned nodeIndex = 0; nodeIndex < block->size(); ++nodeIndex) {
Node* node = block->at(nodeIndex);
for (unsigned childIndex = graph.numChildren(node); childIndex--;) {
Edge edge = graph.child(node, childIndex);
if (!edge)
continue;
switch (edge.useKind()) {
case UntypedUse:
case Int32Use:
case KnownInt32Use:
case MachineIntUse:
case NumberUse:
case KnownNumberUse:
case RealNumberUse:
case BooleanUse:
case CellUse:
case KnownCellUse:
case ObjectUse:
case ObjectOrOtherUse:
case StringUse:
case FinalObjectUse:
// These are OK.
break;
default:
// Don't know how to handle anything else.
if (verboseCompilationEnabled()) {
dataLog("FTL rejecting node because of bad use kind: ", edge.useKind(), " in node:\n");
graph.dump(WTF::dataFile(), " ", node);
}
return CannotCompile;
}
}
switch (canCompile(node)) {
case CannotCompile:
if (verboseCompilationEnabled()) {
dataLog("FTL rejecting node:\n");
graph.dump(WTF::dataFile(), " ", node);
}
return CannotCompile;
case CanCompile:
if (result == CanCompileAndOSREnter && verboseCompilationEnabled()) {
dataLog("FTL disabling OSR entry because of node:\n");
graph.dump(WTF::dataFile(), " ", node);
}
result = CanCompile;
break;
case CanCompileAndOSREnter:
break;
}
if (node->op() == ForceOSRExit)
break;
}
}
return result;
}
} } // namespace JSC::FTL
#endif // ENABLE(FTL_JIT)