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
|
/*
* Copyright (C) 2013, 2014 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 "DFGClobberSet.h"
#if ENABLE(DFG_JIT)
#include "DFGClobberize.h"
#include "JSCInlines.h"
#include <wtf/ListDump.h>
namespace JSC { namespace DFG {
ClobberSet::ClobberSet() { }
ClobberSet::~ClobberSet() { }
void ClobberSet::add(AbstractHeap heap)
{
HashMap<AbstractHeap, bool>::AddResult result = m_clobbers.add(heap, true);
if (!result.isNewEntry) {
if (result.iterator->value)
return;
result.iterator->value = true;
}
while (heap.kind() != World) {
heap = heap.supertype();
if (!m_clobbers.add(heap, false).isNewEntry)
return;
}
}
void ClobberSet::addAll(const ClobberSet& other)
{
// If the other set has a direct heap, we make sure we have it and we set its
// value to be true.
//
// If the other heap has a super heap, we make sure it's present but don't
// modify its value - so we had it directly already then this doesn't change.
if (this == &other)
return;
HashMap<AbstractHeap, bool>::const_iterator iter = other.m_clobbers.begin();
HashMap<AbstractHeap, bool>::const_iterator end = other.m_clobbers.end();
for (; iter != end; ++iter)
m_clobbers.add(iter->key, iter->value).iterator->value |= iter->value;
}
bool ClobberSet::contains(AbstractHeap heap) const
{
HashMap<AbstractHeap, bool>::const_iterator iter = m_clobbers.find(heap);
if (iter == m_clobbers.end())
return false;
return iter->value;
}
bool ClobberSet::overlaps(AbstractHeap heap) const
{
if (m_clobbers.find(heap) != m_clobbers.end())
return true;
while (heap.kind() != World) {
heap = heap.supertype();
if (contains(heap))
return true;
}
return false;
}
void ClobberSet::clear()
{
m_clobbers.clear();
}
HashSet<AbstractHeap> ClobberSet::direct() const
{
return setOf(true);
}
HashSet<AbstractHeap> ClobberSet::super() const
{
return setOf(false);
}
void ClobberSet::dump(PrintStream& out) const
{
out.print("(Direct:[", sortedListDump(direct()), "], Super:[", sortedListDump(super()), "])");
}
HashSet<AbstractHeap> ClobberSet::setOf(bool direct) const
{
HashSet<AbstractHeap> result;
for (HashMap<AbstractHeap, bool>::const_iterator iter = m_clobbers.begin(); iter != m_clobbers.end(); ++iter) {
if (iter->value == direct)
result.add(iter->key);
}
return result;
}
void addReads(Graph& graph, Node* node, ClobberSet& readSet)
{
ClobberSetAdd addRead(readSet);
NoOpClobberize noOp;
clobberize(graph, node, addRead, noOp, noOp);
}
void addWrites(Graph& graph, Node* node, ClobberSet& writeSet)
{
NoOpClobberize noOp;
ClobberSetAdd addWrite(writeSet);
clobberize(graph, node, noOp, addWrite, noOp);
}
void addReadsAndWrites(Graph& graph, Node* node, ClobberSet& readSet, ClobberSet& writeSet)
{
ClobberSetAdd addRead(readSet);
ClobberSetAdd addWrite(writeSet);
NoOpClobberize noOp;
clobberize(graph, node, addRead, addWrite, noOp);
}
bool readsOverlap(Graph& graph, Node* node, ClobberSet& readSet)
{
ClobberSetOverlaps addRead(readSet);
NoOpClobberize noOp;
clobberize(graph, node, addRead, noOp, noOp);
return addRead.result();
}
bool writesOverlap(Graph& graph, Node* node, ClobberSet& writeSet)
{
NoOpClobberize noOp;
ClobberSetOverlaps addWrite(writeSet);
clobberize(graph, node, noOp, addWrite, noOp);
return addWrite.result();
}
} } // namespace JSC::DFG
#endif // ENABLE(DFG_JIT)
|
