forked from WebKit/WebKit-http
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathPolymorphicAccess.h
More file actions
317 lines (259 loc) · 9.45 KB
/
PolymorphicAccess.h
File metadata and controls
317 lines (259 loc) · 9.45 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
/*
* Copyright (C) 2014, 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 PolymorphicAccess_h
#define PolymorphicAccess_h
#if ENABLE(JIT)
#include "CodeOrigin.h"
#include "MacroAssembler.h"
#include "ObjectPropertyConditionSet.h"
#include "Opcode.h"
#include "Structure.h"
#include <wtf/Vector.h>
namespace JSC {
class CodeBlock;
class PolymorphicAccess;
class WatchpointsOnStructureStubInfo;
struct StructureStubInfo;
struct AccessGenerationState;
class AccessCase {
WTF_MAKE_NONCOPYABLE(AccessCase);
WTF_MAKE_FAST_ALLOCATED;
public:
enum AccessType {
Load,
Transition,
Replace,
Miss,
Getter,
Setter,
CustomGetter,
CustomSetter,
InHit,
InMiss,
ArrayLength,
StringLength
};
static bool isGet(AccessType type)
{
switch (type) {
case Transition:
case Replace:
case Setter:
case CustomSetter:
case InHit:
case InMiss:
return false;
case Load:
case Miss:
case Getter:
case CustomGetter:
case ArrayLength:
case StringLength:
return true;
}
}
static bool isPut(AccessType type)
{
switch (type) {
case Load:
case Miss:
case Getter:
case CustomGetter:
case InHit:
case InMiss:
case ArrayLength:
case StringLength:
return false;
case Transition:
case Replace:
case Setter:
case CustomSetter:
return true;
}
}
static bool isIn(AccessType type)
{
switch (type) {
case Load:
case Miss:
case Getter:
case CustomGetter:
case Transition:
case Replace:
case Setter:
case CustomSetter:
case ArrayLength:
case StringLength:
return false;
case InHit:
case InMiss:
return true;
}
}
static std::unique_ptr<AccessCase> get(
VM&, JSCell* owner, AccessType, PropertyOffset, Structure*,
const ObjectPropertyConditionSet& = ObjectPropertyConditionSet(),
bool viaProxy = false,
WatchpointSet* additionalSet = nullptr,
PropertySlot::GetValueFunc = nullptr,
JSObject* customSlotBase = nullptr);
static std::unique_ptr<AccessCase> replace(VM&, JSCell* owner, Structure*, PropertyOffset);
static std::unique_ptr<AccessCase> transition(
VM&, JSCell* owner, Structure* oldStructure, Structure* newStructure, PropertyOffset,
const ObjectPropertyConditionSet& = ObjectPropertyConditionSet());
static std::unique_ptr<AccessCase> setter(
VM&, JSCell* owner, AccessType, Structure*, PropertyOffset,
const ObjectPropertyConditionSet&, PutPropertySlot::PutValueFunc = nullptr,
JSObject* customSlotBase = nullptr);
static std::unique_ptr<AccessCase> in(
VM&, JSCell* owner, AccessType, Structure*,
const ObjectPropertyConditionSet& = ObjectPropertyConditionSet());
static std::unique_ptr<AccessCase> getLength(VM&, JSCell* owner, AccessType);
static std::unique_ptr<AccessCase> fromStructureStubInfo(VM&, JSCell* owner, StructureStubInfo&);
~AccessCase();
std::unique_ptr<AccessCase> clone() const;
AccessType type() const { return m_type; }
PropertyOffset offset() const { return m_offset; }
bool viaProxy() const { return m_rareData ? m_rareData->viaProxy : false; }
Structure* structure() const
{
if (m_type == Transition)
return m_structure->previousID();
return m_structure.get();
}
bool guardedByStructureCheck() const;
Structure* newStructure() const
{
ASSERT(m_type == Transition);
return m_structure.get();
}
ObjectPropertyConditionSet conditionSet() const { return m_conditionSet; }
WatchpointSet* additionalSet() const
{
return m_rareData ? m_rareData->additionalSet.get() : nullptr;
}
JSObject* customSlotBase() const
{
return m_rareData ? m_rareData->customSlotBase.get() : nullptr;
}
JSObject* alternateBase() const;
bool doesCalls() const
{
switch (type()) {
case Getter:
case Setter:
case CustomGetter:
case CustomSetter:
return true;
default:
return false;
}
}
CallLinkInfo* callLinkInfo() const
{
if (!m_rareData)
return nullptr;
return m_rareData->callLinkInfo.get();
}
// If this method returns true, then it's a good idea to remove 'other' from the access once 'this'
// is added. This method assumes that in case of contradictions, 'this' represents a newer, and so
// more useful, truth. This method can be conservative; it will return false when it doubt.
bool canReplace(const AccessCase& other);
void dump(PrintStream& out) const;
private:
friend class CodeBlock;
friend class PolymorphicAccess;
AccessCase();
bool visitWeak(VM&) const;
// Fall through on success. Two kinds of failures are supported: fall-through, which means that we
// should try a different case; and failure, which means that this was the right case but it needs
// help from the slow path.
void generateWithGuard(AccessGenerationState&, MacroAssembler::JumpList& fallThrough);
// Fall through on success, add a jump to the failure list on failure.
void generate(AccessGenerationState&);
AccessType m_type { Load };
PropertyOffset m_offset { invalidOffset };
// Usually this is the structure that we expect the base object to have. But, this is the *new*
// structure for a transition and we rely on the fact that it has a strong reference to the old
// structure. For proxies, this is the structure of the object behind the proxy.
WriteBarrier<Structure> m_structure;
ObjectPropertyConditionSet m_conditionSet;
class RareData {
WTF_MAKE_FAST_ALLOCATED;
public:
RareData()
: viaProxy(false)
{
customAccessor.opaque = nullptr;
}
bool viaProxy;
RefPtr<WatchpointSet> additionalSet;
std::unique_ptr<CallLinkInfo> callLinkInfo;
union {
PropertySlot::GetValueFunc getter;
PutPropertySlot::PutValueFunc setter;
void* opaque;
} customAccessor;
WriteBarrier<JSObject> customSlotBase;
};
std::unique_ptr<RareData> m_rareData;
};
class PolymorphicAccess {
WTF_MAKE_NONCOPYABLE(PolymorphicAccess);
WTF_MAKE_FAST_ALLOCATED;
public:
PolymorphicAccess();
~PolymorphicAccess();
// This may return null, in which case the old stub routine is left intact. You are required to
// pass a vector of non-null access cases. This will prune the access cases by rejecting any case
// in the list that is subsumed by a later case in the list.
MacroAssemblerCodePtr regenerateWithCases(
VM&, CodeBlock*, StructureStubInfo&, const Identifier&, Vector<std::unique_ptr<AccessCase>>);
MacroAssemblerCodePtr regenerateWithCase(
VM&, CodeBlock*, StructureStubInfo&, const Identifier&, std::unique_ptr<AccessCase>);
bool isEmpty() const { return m_list.isEmpty(); }
unsigned size() const { return m_list.size(); }
const AccessCase& at(unsigned i) const { return *m_list[i]; }
const AccessCase& operator[](unsigned i) const { return *m_list[i]; }
// If this returns false then we are requesting a reset of the owning StructureStubInfo.
bool visitWeak(VM&) const;
void dump(PrintStream& out) const;
private:
friend class AccessCase;
friend class CodeBlock;
friend struct AccessGenerationState;
typedef Vector<std::unique_ptr<AccessCase>, 2> ListType;
MacroAssemblerCodePtr regenerate(
VM&, CodeBlock*, StructureStubInfo&, const Identifier&, ListType& cases);
ListType m_list;
RefPtr<JITStubRoutine> m_stubRoutine;
std::unique_ptr<WatchpointsOnStructureStubInfo> m_watchpoints;
};
} // namespace JSC
namespace WTF {
void printInternal(PrintStream&, JSC::AccessCase::AccessType);
} // namespace WTF
#endif // ENABLE(JIT)
#endif // PolymorphicAccess_h