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
|
/*
* 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 B3PhiChildren_h
#define B3PhiChildren_h
#if ENABLE(B3_JIT)
#include "B3IndexMap.h"
#include "B3Procedure.h"
#include "B3UpsilonValue.h"
#include <wtf/GraphNodeWorklist.h>
namespace JSC { namespace B3 {
class PhiChildren {
public:
PhiChildren(Procedure&);
~PhiChildren();
class ValueCollection {
public:
ValueCollection(Vector<UpsilonValue*>* values = nullptr)
: m_values(values)
{
}
unsigned size() const { return m_values->size(); }
Value* at(unsigned index) const { return m_values->at(index)->child(0); }
Value* operator[](unsigned index) const { return at(index); }
bool contains(Value* value) const
{
for (unsigned i = size(); i--;) {
if (at(i) == value)
return true;
}
return false;
}
class iterator {
public:
iterator(Vector<UpsilonValue*>* values = nullptr, unsigned index = 0)
: m_values(values)
, m_index(index)
{
}
Value* operator*() const
{
return m_values->at(m_index)->child(0);
}
iterator& operator++()
{
m_index++;
return *this;
}
bool operator==(const iterator& other) const
{
ASSERT(m_values == other.m_values);
return m_index == other.m_index;
}
bool operator!=(const iterator& other) const
{
return !(*this == other);
}
private:
Vector<UpsilonValue*>* m_values;
unsigned m_index;
};
iterator begin() const { return iterator(m_values); }
iterator end() const { return iterator(m_values, m_values->size()); }
private:
Vector<UpsilonValue*>* m_values;
};
class UpsilonCollection {
public:
UpsilonCollection()
{
}
UpsilonCollection(PhiChildren* phiChildren, Value* value, Vector<UpsilonValue*>* values)
: m_phiChildren(phiChildren)
, m_value(value)
, m_values(values)
{
}
unsigned size() const { return m_values->size(); }
Value* at(unsigned index) const { return m_values->at(index); }
Value* operator[](unsigned index) const { return at(index); }
bool contains(Value* value) const { return m_values->contains(value); }
typedef Vector<UpsilonValue*>::const_iterator iterator;
Vector<UpsilonValue*>::const_iterator begin() const { return m_values->begin(); }
Vector<UpsilonValue*>::const_iterator end() const { return m_values->end(); }
ValueCollection values() { return ValueCollection(m_values); }
template<typename Functor>
void forAllTransitiveIncomingValues(const Functor& functor)
{
if (m_value->opcode() != Phi) {
functor(m_value);
return;
}
GraphNodeWorklist<Value*> worklist;
worklist.push(m_value);
while (Value* phi = worklist.pop()) {
for (Value* child : m_phiChildren->at(phi).values()) {
if (child->opcode() == Phi)
worklist.push(child);
else
functor(child);
}
}
}
bool transitivelyUses(Value* candidate)
{
bool result = false;
forAllTransitiveIncomingValues(
[&] (Value* child) {
result |= child == candidate;
});
return result;
}
private:
PhiChildren* m_phiChildren { nullptr };
Value* m_value { nullptr };
Vector<UpsilonValue*>* m_values { nullptr };
};
UpsilonCollection at(Value* value) { return UpsilonCollection(this, value, &m_upsilons[value]); }
UpsilonCollection operator[](Value* value) { return at(value); }
const Vector<Value*, 8>& phis() const { return m_phis; }
private:
IndexMap<Value, Vector<UpsilonValue*>> m_upsilons;
Vector<Value*, 8> m_phis;
};
} } // namespace JSC::B3
#endif // ENABLE(B3_JIT)
#endif // B3PhiChildren_h
|
