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
|
/*
* 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 DFGLazyNode_h
#define DFGLazyNode_h
#if ENABLE(DFG_JIT)
#include "DFGCommon.h"
#include "DFGInsertionSet.h"
#include <wtf/PrintStream.h>
namespace JSC { namespace DFG {
class LazyNode {
public:
static const size_t jsConstantTag = 0;
static const size_t doubleConstantTag = 1;
static const size_t int52ConstantTag = 2;
static const uintptr_t tagMask = 0x3;
static const uintptr_t pointerMask = ~tagMask;
explicit LazyNode(Node* node = nullptr)
: m_node(node)
, m_value(reinterpret_cast<uintptr_t>(nullptr))
{
if (node && node->isConstant())
setFrozenValue(node->constant(), node->op());
}
explicit LazyNode(FrozenValue* value, NodeType op = JSConstant)
: m_node(nullptr)
, m_value(reinterpret_cast<uintptr_t>(nullptr))
{
setFrozenValue(value, op);
}
LazyNode(std::nullptr_t)
: m_node(nullptr)
, m_value(reinterpret_cast<uintptr_t>(nullptr))
{
}
LazyNode(WTF::HashTableDeletedValueType)
: m_node(reinterpret_cast<Node*>(-1))
{
}
void setNode(Node* node)
{
m_node = node;
if (node && node->isConstant())
setFrozenValue(node->constant(), node->op());
}
bool isHashTableDeletedValue() const { return m_node == reinterpret_cast<Node*>(-1); }
bool isNode() const { return m_node; }
NodeType op() const
{
if (m_node)
return m_node->op();
switch (m_value & tagMask) {
case jsConstantTag:
return JSConstant;
case doubleConstantTag:
return DoubleConstant;
case int52ConstantTag:
return Int52Constant;
default:
RELEASE_ASSERT_NOT_REACHED();
}
}
Node* asNode() const
{
ASSERT(m_node || !asValue());
return m_node;
}
FrozenValue* asValue() const
{
return reinterpret_cast<FrozenValue*>(m_value & pointerMask);
}
unsigned hash() const
{
if (asValue())
return WTF::PtrHash<FrozenValue*>::hash(asValue());
return WTF::PtrHash<Node*>::hash(m_node);
}
bool operator==(const LazyNode& other) const
{
if (asValue() || other.asValue())
return m_value == other.m_value;
return m_node == other.m_node;
}
bool operator!=(const LazyNode& other) const
{
return !(*this == other);
}
Node* ensureIsNode(InsertionSet& insertionSet, BasicBlock* block, unsigned nodeIndex)
{
if (!m_node)
m_node = insertionSet.insertConstant(nodeIndex, block->at(nodeIndex)->origin, asValue(), op());
return asNode();
}
Node* operator->() const { return asNode(); }
Node& operator*() const { return *asNode(); }
bool operator!() const { return !asValue() && !asNode(); }
explicit operator bool() const { return !!*this; }
void dump(PrintStream& out) const;
private:
void setFrozenValue(FrozenValue* value, NodeType op)
{
ASSERT(value);
m_value = reinterpret_cast<uintptr_t>(value);
ASSERT(m_value == (m_value & pointerMask));
switch (op) {
case JSConstant:
m_value |= jsConstantTag;
break;
case DoubleConstant:
m_value |= doubleConstantTag;
break;
case Int52Constant:
m_value |= int52ConstantTag;
break;
default:
RELEASE_ASSERT_NOT_REACHED();
break;
}
}
Node* m_node;
uintptr_t m_value;
};
} } // namespace JSC::DFG
namespace WTF {
template<typename T> struct HashTraits;
template<> struct HashTraits<JSC::DFG::LazyNode> : SimpleClassHashTraits<JSC::DFG::LazyNode> {
static const bool emptyValueIsZero = true;
};
} // namespace WTF
#endif // ENABLE(DFG_JIT)
#endif // DFGLazyNode_h
|
