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
|
/*
* Copyright (C) 2012, 2015 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 ByValInfo_h
#define ByValInfo_h
#include "ClassInfo.h"
#include "CodeLocation.h"
#include "CodeOrigin.h"
#include "IndexingType.h"
#include "JITStubRoutine.h"
#include "Structure.h"
#include "StructureStubInfo.h"
namespace JSC {
#if ENABLE(JIT)
enum JITArrayMode {
JITInt32,
JITDouble,
JITContiguous,
JITArrayStorage,
JITDirectArguments,
JITScopedArguments,
JITInt8Array,
JITInt16Array,
JITInt32Array,
JITUint8Array,
JITUint8ClampedArray,
JITUint16Array,
JITUint32Array,
JITFloat32Array,
JITFloat64Array
};
inline bool isOptimizableIndexingType(IndexingType indexingType)
{
switch (indexingType) {
case ALL_INT32_INDEXING_TYPES:
case ALL_DOUBLE_INDEXING_TYPES:
case ALL_CONTIGUOUS_INDEXING_TYPES:
case ARRAY_WITH_ARRAY_STORAGE_INDEXING_TYPES:
return true;
default:
return false;
}
}
inline bool hasOptimizableIndexingForJSType(JSType type)
{
switch (type) {
case DirectArgumentsType:
case ScopedArgumentsType:
return true;
default:
return false;
}
}
inline bool hasOptimizableIndexingForClassInfo(const ClassInfo* classInfo)
{
return isTypedView(classInfo->typedArrayStorageType);
}
inline bool hasOptimizableIndexing(Structure* structure)
{
return isOptimizableIndexingType(structure->indexingType())
|| hasOptimizableIndexingForJSType(structure->typeInfo().type())
|| hasOptimizableIndexingForClassInfo(structure->classInfo());
}
inline JITArrayMode jitArrayModeForIndexingType(IndexingType indexingType)
{
switch (indexingType) {
case ALL_INT32_INDEXING_TYPES:
return JITInt32;
case ALL_DOUBLE_INDEXING_TYPES:
return JITDouble;
case ALL_CONTIGUOUS_INDEXING_TYPES:
return JITContiguous;
case ARRAY_WITH_ARRAY_STORAGE_INDEXING_TYPES:
return JITArrayStorage;
default:
CRASH();
return JITContiguous;
}
}
inline JITArrayMode jitArrayModeForJSType(JSType type)
{
switch (type) {
case DirectArgumentsType:
return JITDirectArguments;
case ScopedArgumentsType:
return JITScopedArguments;
default:
RELEASE_ASSERT_NOT_REACHED();
return JITContiguous;
}
}
inline JITArrayMode jitArrayModeForClassInfo(const ClassInfo* classInfo)
{
switch (classInfo->typedArrayStorageType) {
case TypeInt8:
return JITInt8Array;
case TypeInt16:
return JITInt16Array;
case TypeInt32:
return JITInt32Array;
case TypeUint8:
return JITUint8Array;
case TypeUint8Clamped:
return JITUint8ClampedArray;
case TypeUint16:
return JITUint16Array;
case TypeUint32:
return JITUint32Array;
case TypeFloat32:
return JITFloat32Array;
case TypeFloat64:
return JITFloat64Array;
default:
CRASH();
return JITContiguous;
}
}
inline bool jitArrayModePermitsPut(JITArrayMode mode)
{
switch (mode) {
case JITDirectArguments:
case JITScopedArguments:
// We could support put_by_val on these at some point, but it's just not that profitable
// at the moment.
return false;
default:
return true;
}
}
inline TypedArrayType typedArrayTypeForJITArrayMode(JITArrayMode mode)
{
switch (mode) {
case JITInt8Array:
return TypeInt8;
case JITInt16Array:
return TypeInt16;
case JITInt32Array:
return TypeInt32;
case JITUint8Array:
return TypeUint8;
case JITUint8ClampedArray:
return TypeUint8Clamped;
case JITUint16Array:
return TypeUint16;
case JITUint32Array:
return TypeUint32;
case JITFloat32Array:
return TypeFloat32;
case JITFloat64Array:
return TypeFloat64;
default:
CRASH();
return NotTypedArray;
}
}
inline JITArrayMode jitArrayModeForStructure(Structure* structure)
{
if (isOptimizableIndexingType(structure->indexingType()))
return jitArrayModeForIndexingType(structure->indexingType());
if (hasOptimizableIndexingForJSType(structure->typeInfo().type()))
return jitArrayModeForJSType(structure->typeInfo().type());
ASSERT(hasOptimizableIndexingForClassInfo(structure->classInfo()));
return jitArrayModeForClassInfo(structure->classInfo());
}
struct ByValInfo {
ByValInfo() { }
ByValInfo(unsigned bytecodeIndex, CodeLocationJump notIndexJump, CodeLocationJump badTypeJump, CodeLocationLabel exceptionHandler, JITArrayMode arrayMode, ArrayProfile* arrayProfile, int16_t badTypeJumpToDone, int16_t badTypeJumpToNextHotPath, int16_t returnAddressToSlowPath)
: bytecodeIndex(bytecodeIndex)
, notIndexJump(notIndexJump)
, badTypeJump(badTypeJump)
, exceptionHandler(exceptionHandler)
, arrayMode(arrayMode)
, arrayProfile(arrayProfile)
, badTypeJumpToDone(badTypeJumpToDone)
, badTypeJumpToNextHotPath(badTypeJumpToNextHotPath)
, returnAddressToSlowPath(returnAddressToSlowPath)
, slowPathCount(0)
, stubInfo(nullptr)
, tookSlowPath(false)
, seen(false)
{
}
unsigned bytecodeIndex;
CodeLocationJump notIndexJump;
CodeLocationJump badTypeJump;
CodeLocationLabel exceptionHandler;
JITArrayMode arrayMode; // The array mode that was baked into the inline JIT code.
ArrayProfile* arrayProfile;
int16_t badTypeJumpToDone;
int16_t badTypeJumpToNextHotPath;
int16_t returnAddressToSlowPath;
unsigned slowPathCount;
RefPtr<JITStubRoutine> stubRoutine;
Identifier cachedId;
StructureStubInfo* stubInfo;
bool tookSlowPath : 1;
bool seen : 1;
};
inline unsigned getByValInfoBytecodeIndex(ByValInfo* info)
{
return info->bytecodeIndex;
}
typedef HashMap<CodeOrigin, ByValInfo*, CodeOriginApproximateHash> ByValInfoMap;
#else // ENABLE(JIT)
typedef HashMap<int, void*> ByValInfoMap;
#endif // ENABLE(JIT)
} // namespace JSC
#endif // ByValInfo_h
|
