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
|
/*
* Copyright (C) 2015-2016 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 B3ValueKey_h
#define B3ValueKey_h
#if ENABLE(B3_JIT)
#include "B3HeapRange.h"
#include "B3Opcode.h"
#include "B3Origin.h"
#include "B3Type.h"
#include <wtf/HashTable.h>
#include <wtf/Vector.h>
namespace JSC { namespace B3 {
class Procedure;
class Value;
// ValueKeys are useful for CSE. They abstractly describe the value that a Value returns when it
// executes. Any Value that has the same ValueKey is guaranteed to return the same value, provided
// that they return a non-empty ValueKey. Operations that have effects, or that can have their
// behavior affected by other operations' effects, will return an empty ValueKey. You have to use
// other mechanisms for doing CSE for impure operations.
class ValueKey {
public:
ValueKey()
{
}
ValueKey(Opcode opcode, Type type)
: m_opcode(opcode)
, m_type(type)
{
}
ValueKey(Opcode, Type, Value* child);
ValueKey(Opcode, Type, Value* left, Value* right);
ValueKey(Opcode, Type, Value* a, Value* b, Value* c);
ValueKey(Opcode opcode, Type type, int64_t value)
: m_opcode(opcode)
, m_type(type)
{
u.value = value;
}
ValueKey(Opcode opcode, Type type, double value)
: m_opcode(opcode)
, m_type(type)
{
u.doubleValue = value;
}
ValueKey(Opcode opcode, Type type, float value)
: m_opcode(opcode)
, m_type(type)
{
u.floatValue = value;
}
static ValueKey intConstant(Type type, int64_t value);
Opcode opcode() const { return m_opcode; }
Type type() const { return m_type; }
unsigned childIndex(unsigned index) const { return u.indices[index]; }
Value* child(Procedure&, unsigned index) const;
int64_t value() const { return u.value; }
double doubleValue() const { return u.doubleValue; }
double floatValue() const { return u.floatValue; }
bool operator==(const ValueKey& other) const
{
return m_opcode == other.m_opcode
&& m_type == other.m_type
&& u == other.u;
}
bool operator!=(const ValueKey& other) const
{
return !(*this == other);
}
unsigned hash() const
{
return m_opcode + m_type + WTF::IntHash<int32_t>::hash(u.indices[0]) + u.indices[1] + u.indices[2];
}
explicit operator bool() const { return *this != ValueKey(); }
void dump(PrintStream&) const;
bool canMaterialize() const
{
if (!*this)
return false;
switch (opcode()) {
case CheckAdd:
case CheckSub:
case CheckMul:
return false;
default:
return true;
}
}
bool isConstant() const
{
return B3::isConstant(opcode());
}
// Attempts to materialize the Value for this ValueKey. May return nullptr if the value cannot
// be materialized. This happens for CheckAdd and friends. You can use canMaterialize() to check
// if your key is materializable.
Value* materialize(Procedure&, Origin) const;
ValueKey(WTF::HashTableDeletedValueType)
: m_type { Int32 }
{
}
bool isHashTableDeletedValue() const
{
return *this == ValueKey(WTF::HashTableDeletedValue);
}
private:
Opcode m_opcode { Oops };
Type m_type { Void };
union U {
unsigned indices[3];
int64_t value;
double doubleValue;
float floatValue;
U()
{
indices[0] = 0;
indices[1] = 0;
indices[2] = 0;
}
bool operator==(const U& other) const
{
return indices[0] == other.indices[0]
&& indices[1] == other.indices[1]
&& indices[2] == other.indices[2];
}
} u;
};
struct ValueKeyHash {
static unsigned hash(const ValueKey& key) { return key.hash(); }
static bool equal(const ValueKey& a, const ValueKey& b) { return a == b; }
static const bool safeToCompareToEmptyOrDeleted = true;
};
} } // namespace JSC::B3
namespace WTF {
template<typename T> struct DefaultHash;
template<> struct DefaultHash<JSC::B3::ValueKey> {
typedef JSC::B3::ValueKeyHash Hash;
};
template<typename T> struct HashTraits;
template<> struct HashTraits<JSC::B3::ValueKey> : public SimpleClassHashTraits<JSC::B3::ValueKey> {
static const bool emptyValueIsZero = false;
};
} // namespace WTF
#endif // ENABLE(B3_JIT)
#endif // B3ValueKey_h
|
