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
|
/*
* Copyright (C) 2025 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.
*/
#include "config.h"
#include "DFGCloneHelper.h"
#if ENABLE(DFG_JIT)
#include "DFGBasicBlockInlines.h"
namespace JSC { namespace DFG {
namespace {
enum class NodeCloneStatus {
Common, // Use shared logic to clone this node
Special, // Requires special handling for cloning
PreCloned, // Cloned earlier (e.g. Phi), shouldn't reach cloneNodeImpl
Unsupported // Not yet supported, future work
};
NodeCloneStatus nodeCloneStatusFor(NodeType op)
{
switch (op) {
#define HANDLE_CASE(op, kind) \
case op: \
return NodeCloneStatus::kind;
FOR_EACH_NODE_CLONE_STATUS(HANDLE_CASE)
#undef HANDLE_CASE
default:
return NodeCloneStatus::Unsupported;
}
}
} // anonymous namespace
bool CloneHelper::isNodeCloneable(Graph& graph, UncheckedKeyHashSet<Node*>& cloneableCache, Node* node)
{
if (cloneableCache.contains(node))
return true;
#if ASSERT_ENABLED
UncheckedKeyHashSet<Node*>& visiting = CloneHelper::debugVisitingSet();
ASSERT(visiting.add(node).isNewEntry);
auto exitScope = makeScopeExit([&] {
visiting.remove(node);
});
#endif
bool result = true;
switch (nodeCloneStatusFor(node->op())) {
case NodeCloneStatus::Common:
case NodeCloneStatus::Special: {
graph.doToChildrenBreakOnDone(node, [&](Edge& edge) {
if (isNodeCloneable(graph, cloneableCache, edge.node()))
return IterationStatus::Continue;
result = false;
return IterationStatus::Done;
});
break;
}
case NodeCloneStatus::PreCloned:
break;
case NodeCloneStatus::Unsupported:
result = false;
break;
default:
RELEASE_ASSERT_NOT_REACHED();
}
if (result)
cloneableCache.add(node);
return result;
}
Node* CloneHelper::cloneNode(BasicBlock* into, Node* node)
{
ASSERT(node);
auto iter = m_nodeClones.find(node);
if (iter != m_nodeClones.end())
return iter->value;
Node* result = cloneNodeImpl(into, node);
ASSERT(result);
m_nodeClones.add(node, result);
return result;
}
Node* CloneHelper::cloneNodeImpl(BasicBlock* into, Node* node)
{
#if ASSERT_ENABLED
m_graph.doToChildren(node, [&](Edge& e) {
ASSERT(e.node()->owner == node->owner);
});
#endif
auto cloneEdge = [&](Edge& edge) {
return edge ? Edge(cloneNode(into, edge.node()), edge.useKind()) : Edge();
};
switch (nodeCloneStatusFor(node->op())) {
case NodeCloneStatus::Common: {
if (node->hasVarArgs()) {
size_t firstChild = m_graph.m_varArgChildren.size();
m_graph.doToAllChildren(node, [&](Edge& edge) {
m_graph.m_varArgChildren.append(cloneEdge(edge));
});
Node* clone = into->cloneAndAppend(m_graph, node);
clone->children.setFirstChild(firstChild);
return clone;
}
Node* clone = into->cloneAndAppend(m_graph, node);
clone->child1() = cloneEdge(node->child1());
clone->child2() = cloneEdge(node->child2());
clone->child3() = cloneEdge(node->child3());
return clone;
}
case NodeCloneStatus::Special:
switch (node->op()) {
case Branch: {
Node* clone = into->cloneAndAppend(m_graph, node);
clone->setOpInfo(OpInfo(m_graph.m_branchData.add(WTFMove(*node->branchData()))));
clone->child1() = cloneEdge(node->child1());
return clone;
}
case Switch: {
Node* clone = into->cloneAndAppend(m_graph, node);
SwitchData& cloneData = *m_graph.m_switchData.add();
cloneData = *clone->switchData();
clone->setOpInfo(OpInfo(&cloneData));
clone->child1() = cloneEdge(node->child1());
return clone;
}
default:
RELEASE_ASSERT_NOT_REACHED();
return nullptr;
}
case NodeCloneStatus::PreCloned:
RELEASE_ASSERT_NOT_REACHED(); // e.g. Phi
return nullptr;
case NodeCloneStatus::Unsupported:
dataLogLn("Node not cloneable: ", node->op());
RELEASE_ASSERT_NOT_REACHED();
return nullptr;
}
RELEASE_ASSERT_NOT_REACHED();
}
BasicBlock* CloneHelper::blockClone(BasicBlock* block)
{
ASSERT(block);
auto iter = m_blockClones.find(block);
if (iter != m_blockClones.end())
return iter->value;
RELEASE_ASSERT_NOT_REACHED();
return nullptr;
}
void CloneHelper::finalize()
{
if (!m_blockInsertionSet.execute()) {
m_graph.invalidateCFG();
m_graph.dethread();
}
m_graph.resetReachability();
m_graph.killUnreachableBlocks();
}
void CloneHelper::clear()
{
m_blockClones.clear();
m_nodeClones.clear();
}
} } // namespace JSC::DFG
#endif // ENABLE(DFG_JIT)
|
