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
|
/*
* Copyright (C) 2012-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 DFGInsertionSet_h
#define DFGInsertionSet_h
#if ENABLE(DFG_JIT)
#include "DFGGraph.h"
#include <wtf/Insertion.h>
#include <wtf/Vector.h>
namespace JSC { namespace DFG {
typedef WTF::Insertion<Node*> Insertion;
class InsertionSet {
public:
InsertionSet(Graph& graph)
: m_graph(graph)
{
}
Graph& graph() { return m_graph; }
// Adds another code insertion. It's expected that you'll usually insert things in order. If
// you don't, this function will perform a linear search to find the largest insertion point
// at which insertion order would be preserved. This is essentially equivalent to if you did
// a stable sort on the insertions.
Node* insert(const Insertion& insertion)
{
if (LIKELY(!m_insertions.size() || m_insertions.last().index() <= insertion.index()))
m_insertions.append(insertion);
else
insertSlow(insertion);
return insertion.element();
}
Node* insert(size_t index, Node* element)
{
return insert(Insertion(index, element));
}
template<typename... Params>
Node* insertNode(size_t index, SpeculatedType type, Params... params)
{
return insert(index, m_graph.addNode(type, params...));
}
Node* insertConstant(
size_t index, NodeOrigin origin, FrozenValue* value,
NodeType op = JSConstant)
{
return insertNode(
index, speculationFromValue(value->value()), op, origin, OpInfo(value));
}
Edge insertConstantForUse(
size_t index, NodeOrigin origin, FrozenValue* value, UseKind useKind)
{
NodeType op;
if (isDouble(useKind))
op = DoubleConstant;
else if (useKind == Int52RepUse)
op = Int52Constant;
else
op = JSConstant;
return Edge(insertConstant(index, origin, value, op), useKind);
}
Node* insertConstant(size_t index, NodeOrigin origin, JSValue value, NodeType op = JSConstant)
{
return insertConstant(index, origin, m_graph.freeze(value), op);
}
Edge insertConstantForUse(size_t index, NodeOrigin origin, JSValue value, UseKind useKind)
{
return insertConstantForUse(index, origin, m_graph.freeze(value), useKind);
}
Edge insertBottomConstantForUse(size_t index, NodeOrigin origin, UseKind useKind)
{
if (isDouble(useKind))
return insertConstantForUse(index, origin, jsNumber(PNaN), useKind);
if (useKind == Int52RepUse)
return insertConstantForUse(index, origin, jsNumber(0), useKind);
return insertConstantForUse(index, origin, jsUndefined(), useKind);
}
Node* insertCheck(size_t index, NodeOrigin origin, AdjacencyList children)
{
children = children.justChecks();
if (children.isEmpty())
return nullptr;
return insertNode(index, SpecNone, Check, origin, children);
}
Node* insertCheck(size_t index, Node* node)
{
return insertCheck(index, node->origin, node->children);
}
Node* insertCheck(size_t index, NodeOrigin origin, Edge edge)
{
if (edge.willHaveCheck())
return insertNode(index, SpecNone, Check, origin, edge);
return nullptr;
}
void execute(BasicBlock* block);
private:
void insertSlow(const Insertion&);
Graph& m_graph;
Vector<Insertion, 8> m_insertions;
};
} } // namespace JSC::DFG
#endif // ENABLE(DFG_JIT)
#endif // DFGInsertionSet_h
|
