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
|
/*
* Copyright (C) 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 VarOffset_h
#define VarOffset_h
#include "DirectArgumentsOffset.h"
#include "ScopeOffset.h"
#include "VirtualRegister.h"
#include <wtf/HashMap.h>
namespace JSC {
enum class VarKind : uint8_t {
Invalid,
Scope,
Stack,
DirectArgument
};
class VarOffset {
public:
VarOffset()
: m_kind(VarKind::Invalid)
, m_offset(UINT_MAX)
{
}
VarOffset(WTF::HashTableDeletedValueType)
: m_kind(VarKind::Invalid)
, m_offset(0)
{
}
explicit VarOffset(VirtualRegister stackOffset)
{
if (!stackOffset.isValid()) {
m_kind = VarKind::Invalid;
m_offset = UINT_MAX;
} else {
m_kind = VarKind::Stack;
m_offset = stackOffset.offset();
}
}
explicit VarOffset(ScopeOffset scopeOffset)
{
if (!scopeOffset) {
m_kind = VarKind::Invalid;
m_offset = UINT_MAX;
} else {
m_kind = VarKind::Scope;
m_offset = scopeOffset.offset();
}
}
explicit VarOffset(DirectArgumentsOffset capturedArgumentsOffset)
{
if (!capturedArgumentsOffset) {
m_kind = VarKind::Invalid;
m_offset = UINT_MAX;
} else {
m_kind = VarKind::DirectArgument;
m_offset = capturedArgumentsOffset.offset();
}
}
static VarOffset assemble(VarKind kind, unsigned offset)
{
VarOffset result;
result.m_kind = kind;
result.m_offset = offset;
result.checkSanity();
return result;
}
bool isValid() const
{
return m_kind != VarKind::Invalid;
}
bool operator!() const
{
return !isValid();
}
VarKind kind() const { return m_kind; }
bool isStack() const
{
return m_kind == VarKind::Stack;
}
bool isScope() const
{
return m_kind == VarKind::Scope;
}
bool isDirectArgument() const
{
return m_kind == VarKind::DirectArgument;
}
VirtualRegister stackOffsetUnchecked() const
{
if (!isStack())
return VirtualRegister();
return VirtualRegister(m_offset);
}
ScopeOffset scopeOffsetUnchecked() const
{
if (!isScope())
return ScopeOffset();
return ScopeOffset(m_offset);
}
DirectArgumentsOffset capturedArgumentsOffsetUnchecked() const
{
if (!isDirectArgument())
return DirectArgumentsOffset();
return DirectArgumentsOffset(m_offset);
}
VirtualRegister stackOffset() const
{
ASSERT(isStack());
return VirtualRegister(m_offset);
}
ScopeOffset scopeOffset() const
{
ASSERT(isScope());
return ScopeOffset(m_offset);
}
DirectArgumentsOffset capturedArgumentsOffset() const
{
ASSERT(isDirectArgument());
return DirectArgumentsOffset(m_offset);
}
unsigned rawOffset() const
{
ASSERT(isValid());
return m_offset;
}
void checkSanity() const
{
if (ASSERT_DISABLED)
return;
switch (m_kind) {
case VarKind::Invalid:
ASSERT(m_offset == UINT_MAX);
return;
case VarKind::Scope:
ASSERT(scopeOffset());
return;
case VarKind::Stack:
ASSERT(stackOffset().isValid());
return;
case VarKind::DirectArgument:
ASSERT(capturedArgumentsOffset());
return;
}
ASSERT_NOT_REACHED();
}
bool operator==(const VarOffset& other) const
{
return m_kind == other.m_kind
&& m_offset == other.m_offset;
}
bool operator!=(const VarOffset& other) const
{
return !(*this == other);
}
unsigned hash() const
{
return WTF::IntHash<unsigned>::hash((static_cast<unsigned>(m_kind) << 20) + m_offset);
}
bool isHashTableDeletedValue() const
{
return m_kind == VarKind::Invalid && !m_offset;
}
void dump(PrintStream&) const;
private:
VarKind m_kind;
unsigned m_offset;
};
struct VarOffsetHash {
static unsigned hash(const VarOffset& key) { return key.hash(); }
static bool equal(const VarOffset& a, const VarOffset& b) { return a == b; }
static const bool safeToCompareToEmptyOrDeleted = true;
};
} // namespace JSC
namespace WTF {
void printInternal(PrintStream&, JSC::VarKind);
template<typename T> struct DefaultHash;
template<> struct DefaultHash<JSC::VarOffset> {
typedef JSC::VarOffsetHash Hash;
};
template<typename T> struct HashTraits;
template<> struct HashTraits<JSC::VarOffset> : SimpleClassHashTraits<JSC::VarOffset> {
static const bool emptyValueIsZero = false;
};
} // namespace WTF
#endif // VarOffset_h
|
