This repository was archived by the owner on Jun 24, 2022. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 2k
Expand file tree
/
Copy pathArrayProfile.h
More file actions
245 lines (200 loc) · 9.62 KB
/
ArrayProfile.h
File metadata and controls
245 lines (200 loc) · 9.62 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
/*
* Copyright (C) 2012-2018 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.
*/
#pragma once
#include "ConcurrentJSLock.h"
#include "Structure.h"
namespace JSC {
class CodeBlock;
class LLIntOffsetsExtractor;
// This is a bitfield where each bit represents an type of array access that we have seen.
// There are 19 indexing types that use the lower bits.
// There are 9 typed array types taking the bits 16 to 25.
typedef unsigned ArrayModes;
// The possible IndexingTypes are limited within (0 - 16, 21, 23, 25).
// This is because CoW types only appear for JSArrays.
static_assert(CopyOnWriteArrayWithInt32 == 21, "");
static_assert(CopyOnWriteArrayWithDouble == 23, "");
static_assert(CopyOnWriteArrayWithContiguous == 25, "");
const ArrayModes CopyOnWriteArrayWithInt32ArrayMode = 1 << CopyOnWriteArrayWithInt32;
const ArrayModes CopyOnWriteArrayWithDoubleArrayMode = 1 << CopyOnWriteArrayWithDouble;
const ArrayModes CopyOnWriteArrayWithContiguousArrayMode = 1 << CopyOnWriteArrayWithContiguous;
const ArrayModes Int8ArrayMode = 1 << 16;
const ArrayModes Int16ArrayMode = 1 << 17;
const ArrayModes Int32ArrayMode = 1 << 18;
const ArrayModes Uint8ArrayMode = 1 << 19;
const ArrayModes Uint8ClampedArrayMode = 1 << 20; // 21 - 25 are used for CoW arrays.
const ArrayModes Uint16ArrayMode = 1 << 26;
const ArrayModes Uint32ArrayMode = 1 << 27;
const ArrayModes Float32ArrayMode = 1 << 28;
const ArrayModes Float64ArrayMode = 1 << 29;
JS_EXPORT_PRIVATE extern const ArrayModes typedArrayModes[NumberOfTypedArrayTypesExcludingDataView];
constexpr ArrayModes asArrayModesIgnoringTypedArrays(IndexingType indexingMode)
{
return static_cast<unsigned>(1) << static_cast<unsigned>(indexingMode);
}
#define ALL_TYPED_ARRAY_MODES \
(Int8ArrayMode \
| Int16ArrayMode \
| Int32ArrayMode \
| Uint8ArrayMode \
| Uint8ClampedArrayMode \
| Uint16ArrayMode \
| Uint32ArrayMode \
| Float32ArrayMode \
| Float64ArrayMode \
)
#define ALL_NON_ARRAY_ARRAY_MODES \
(asArrayModesIgnoringTypedArrays(NonArray) \
| asArrayModesIgnoringTypedArrays(NonArrayWithInt32) \
| asArrayModesIgnoringTypedArrays(NonArrayWithDouble) \
| asArrayModesIgnoringTypedArrays(NonArrayWithContiguous) \
| asArrayModesIgnoringTypedArrays(NonArrayWithArrayStorage) \
| asArrayModesIgnoringTypedArrays(NonArrayWithSlowPutArrayStorage) \
| ALL_TYPED_ARRAY_MODES)
#define ALL_COPY_ON_WRITE_ARRAY_MODES \
(CopyOnWriteArrayWithInt32ArrayMode \
| CopyOnWriteArrayWithDoubleArrayMode \
| CopyOnWriteArrayWithContiguousArrayMode)
#define ALL_WRITABLE_ARRAY_ARRAY_MODES \
(asArrayModesIgnoringTypedArrays(ArrayClass) \
| asArrayModesIgnoringTypedArrays(ArrayWithUndecided) \
| asArrayModesIgnoringTypedArrays(ArrayWithInt32) \
| asArrayModesIgnoringTypedArrays(ArrayWithDouble) \
| asArrayModesIgnoringTypedArrays(ArrayWithContiguous) \
| asArrayModesIgnoringTypedArrays(ArrayWithArrayStorage) \
| asArrayModesIgnoringTypedArrays(ArrayWithSlowPutArrayStorage))
#define ALL_ARRAY_ARRAY_MODES \
(ALL_WRITABLE_ARRAY_ARRAY_MODES \
| ALL_COPY_ON_WRITE_ARRAY_MODES)
#define ALL_ARRAY_MODES (ALL_NON_ARRAY_ARRAY_MODES | ALL_ARRAY_ARRAY_MODES)
inline ArrayModes arrayModesFromStructure(Structure* structure)
{
JSType type = structure->typeInfo().type();
if (isTypedArrayType(type))
return typedArrayModes[type - FirstTypedArrayType];
return asArrayModesIgnoringTypedArrays(structure->indexingMode());
}
void dumpArrayModes(PrintStream&, ArrayModes);
MAKE_PRINT_ADAPTOR(ArrayModesDump, ArrayModes, dumpArrayModes);
inline bool mergeArrayModes(ArrayModes& left, ArrayModes right)
{
ArrayModes newModes = left | right;
if (newModes == left)
return false;
left = newModes;
return true;
}
inline bool arrayModesAreClearOrTop(ArrayModes modes)
{
return !modes || modes == ALL_ARRAY_MODES;
}
// Checks if proven is a subset of expected.
inline bool arrayModesAlreadyChecked(ArrayModes proven, ArrayModes expected)
{
return (expected | proven) == expected;
}
inline bool arrayModesIncludeIgnoringTypedArrays(ArrayModes arrayModes, IndexingType shape)
{
ArrayModes modes = asArrayModesIgnoringTypedArrays(NonArray | shape) | asArrayModesIgnoringTypedArrays(ArrayClass | shape);
if (hasInt32(shape) || hasDouble(shape) || hasContiguous(shape))
modes |= asArrayModesIgnoringTypedArrays(ArrayClass | shape | CopyOnWrite);
return !!(arrayModes & modes);
}
inline bool shouldUseSlowPutArrayStorage(ArrayModes arrayModes)
{
return arrayModesIncludeIgnoringTypedArrays(arrayModes, SlowPutArrayStorageShape);
}
inline bool shouldUseFastArrayStorage(ArrayModes arrayModes)
{
return arrayModesIncludeIgnoringTypedArrays(arrayModes, ArrayStorageShape);
}
inline bool shouldUseContiguous(ArrayModes arrayModes)
{
return arrayModesIncludeIgnoringTypedArrays(arrayModes, ContiguousShape);
}
inline bool shouldUseDouble(ArrayModes arrayModes)
{
return arrayModesIncludeIgnoringTypedArrays(arrayModes, DoubleShape);
}
inline bool shouldUseInt32(ArrayModes arrayModes)
{
return arrayModesIncludeIgnoringTypedArrays(arrayModes, Int32Shape);
}
inline bool hasSeenArray(ArrayModes arrayModes)
{
return arrayModes & ALL_ARRAY_ARRAY_MODES;
}
inline bool hasSeenNonArray(ArrayModes arrayModes)
{
return arrayModes & ALL_NON_ARRAY_ARRAY_MODES;
}
inline bool hasSeenWritableArray(ArrayModes arrayModes)
{
return arrayModes & ALL_WRITABLE_ARRAY_ARRAY_MODES;
}
inline bool hasSeenCopyOnWriteArray(ArrayModes arrayModes)
{
return arrayModes & ALL_COPY_ON_WRITE_ARRAY_MODES;
}
class ArrayProfile {
friend class CodeBlock;
public:
explicit ArrayProfile()
: m_mayInterceptIndexedAccesses(false)
, m_usesOriginalArrayStructures(true)
, m_didPerformFirstRunPruning(false)
{
}
StructureID* addressOfLastSeenStructureID() { return &m_lastSeenStructureID; }
ArrayModes* addressOfArrayModes() { return &m_observedArrayModes; }
bool* addressOfMayStoreToHole() { return &m_mayStoreToHole; }
void setOutOfBounds() { m_outOfBounds = true; }
bool* addressOfOutOfBounds() { return &m_outOfBounds; }
void observeStructureID(StructureID structureID) { m_lastSeenStructureID = structureID; }
void observeStructure(Structure* structure) { m_lastSeenStructureID = structure->id(); }
void computeUpdatedPrediction(const ConcurrentJSLocker&, CodeBlock*);
void computeUpdatedPrediction(const ConcurrentJSLocker&, CodeBlock*, Structure* lastSeenStructure);
void observeArrayMode(ArrayModes mode) { m_observedArrayModes |= mode; }
void observeIndexedRead(VM&, JSCell*, unsigned index);
ArrayModes observedArrayModes(const ConcurrentJSLocker&) const { return m_observedArrayModes; }
bool mayInterceptIndexedAccesses(const ConcurrentJSLocker&) const { return m_mayInterceptIndexedAccesses; }
bool mayStoreToHole(const ConcurrentJSLocker&) const { return m_mayStoreToHole; }
bool outOfBounds(const ConcurrentJSLocker&) const { return m_outOfBounds; }
bool usesOriginalArrayStructures(const ConcurrentJSLocker&) const { return m_usesOriginalArrayStructures; }
CString briefDescription(const ConcurrentJSLocker&, CodeBlock*);
CString briefDescriptionWithoutUpdating(const ConcurrentJSLocker&);
private:
friend class LLIntOffsetsExtractor;
static Structure* polymorphicStructure() { return static_cast<Structure*>(reinterpret_cast<void*>(1)); }
StructureID m_lastSeenStructureID { 0 };
bool m_mayStoreToHole { false }; // This flag may become overloaded to indicate other special cases that were encountered during array access, as it depends on indexing type. Since we currently have basically just one indexing type (two variants of ArrayStorage), this flag for now just means exactly what its name implies.
bool m_outOfBounds { false };
bool m_mayInterceptIndexedAccesses : 1;
bool m_usesOriginalArrayStructures : 1;
bool m_didPerformFirstRunPruning : 1;
ArrayModes m_observedArrayModes { 0 };
};
static_assert(sizeof(ArrayProfile) == 12);
} // namespace JSC