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
|
/*
* Copyright (C) 2014-2019 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
#if ENABLE(DFG_JIT)
#include "DFGGraph.h"
#include "DFGNode.h"
namespace JSC { namespace DFG {
class PureValue {
public:
PureValue()
: m_op(LastNodeType)
, m_info(0)
{
}
PureValue(NodeType op, const AdjacencyList& children, uintptr_t info)
: m_op(op)
, m_children(children.sanitized())
, m_info(info)
{
ASSERT(!(defaultFlags(op) & NodeHasVarArgs));
}
PureValue(NodeType op, const AdjacencyList& children, const void* ptr)
: PureValue(op, children, std::bit_cast<uintptr_t>(ptr))
{
}
PureValue(NodeType op, const AdjacencyList& children)
: PureValue(op, children, static_cast<uintptr_t>(0))
{
}
PureValue(Node* node, uintptr_t info)
: PureValue(node->op(), node->children, info)
{
}
PureValue(Node* node, const void* ptr)
: PureValue(node->op(), node->children, ptr)
{
}
PureValue(Node* node)
: PureValue(node->op(), node->children)
{
}
PureValue(Graph& graph, Node* node, uintptr_t info)
: m_op(node->op())
, m_children(node->children)
, m_info(info)
, m_graph(&graph)
{
ASSERT(node->flags() & NodeHasVarArgs);
ASSERT(isVarargs());
}
PureValue(Graph& graph, Node* node)
: PureValue(graph, node, static_cast<uintptr_t>(0))
{
}
PureValue(WTF::HashTableDeletedValueType)
: m_op(LastNodeType)
, m_info(1)
{
}
bool operator!() const { return m_op == LastNodeType && !m_info; }
NodeType op() const { return m_op; }
uintptr_t info() const { return m_info; }
unsigned hash() const
{
unsigned hash = WTF::IntHash<int>::hash(static_cast<int>(m_op)) + m_info;
if (!isVarargs())
return hash ^ m_children.hash();
for (unsigned i = 0; i < m_children.numChildren(); ++i)
hash ^= m_graph->m_varArgChildren[m_children.firstChild() + i].sanitized().hash();
return hash;
}
bool operator==(const PureValue& other) const
{
if (isVarargs() != other.isVarargs() || m_op != other.m_op || m_info != other.m_info)
return false;
if (!isVarargs())
return m_children == other.m_children;
if (m_children.numChildren() != other.m_children.numChildren())
return false;
for (unsigned i = 0; i < m_children.numChildren(); ++i) {
Edge a = m_graph->m_varArgChildren[m_children.firstChild() + i].sanitized();
Edge b = m_graph->m_varArgChildren[other.m_children.firstChild() + i].sanitized();
if (a != b)
return false;
}
return true;
}
bool isHashTableDeletedValue() const
{
return m_op == LastNodeType && m_info;
}
void dump(PrintStream& out) const;
private:
bool isVarargs() const { return !!m_graph; }
NodeType m_op;
AdjacencyList m_children;
uintptr_t m_info;
Graph* m_graph { nullptr };
};
struct PureValueHash {
static unsigned hash(const PureValue& key) { return key.hash(); }
static bool equal(const PureValue& a, const PureValue& b) { return a == b; }
static constexpr bool safeToCompareToEmptyOrDeleted = true;
};
} } // namespace JSC::DFG
namespace WTF {
template<typename T> struct DefaultHash;
template<> struct DefaultHash<JSC::DFG::PureValue> : JSC::DFG::PureValueHash { };
template<typename T> struct HashTraits;
template<> struct HashTraits<JSC::DFG::PureValue> : SimpleClassHashTraits<JSC::DFG::PureValue> {
static constexpr bool emptyValueIsZero = false;
};
} // namespace WTF
namespace JSC { namespace DFG {
typedef UncheckedKeyHashMap<PureValue, Node*> PureMap;
typedef UncheckedKeyHashMap<PureValue, Vector<Node*>> PureMultiMap;
} } // namespace JSC::DFG
#endif // ENABLE(DFG_JIT)
|
