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
|
/*
* Copyright (C) 2014, 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.
*/
#include "config.h"
#include "DFGAvailabilityMap.h"
#if ENABLE(DFG_JIT)
#include "DFGGraph.h"
#include "JSCJSValueInlines.h"
#include "OperandsInlines.h"
#include <wtf/ListDump.h>
namespace JSC { namespace DFG {
void AvailabilityMap::pruneHeap()
{
if (m_heap.isEmpty())
return;
NodeSet possibleNodes;
for (unsigned i = m_locals.size(); i--;) {
if (m_locals[i].hasNode())
possibleNodes.addVoid(m_locals[i].node());
}
closeOverNodes(
[&] (Node* node) -> bool {
return possibleNodes.contains(node);
},
[&] (Node* node) -> bool {
return possibleNodes.add(node).isNewEntry;
});
UncheckedKeyHashMap<PromotedHeapLocation, Availability> newHeap;
for (auto pair : m_heap) {
if (possibleNodes.contains(pair.key.base()))
newHeap.add(pair.key, pair.value);
}
m_heap = WTFMove(newHeap);
}
void AvailabilityMap::pruneByLiveness(Graph& graph, CodeOrigin where)
{
Operands<Availability> localsCopy(OperandsLike, m_locals, Availability::unavailable());
graph.forAllLiveInBytecode(
where,
[&] (Operand reg) {
localsCopy.operand(reg) = m_locals.operand(reg);
});
m_locals = WTFMove(localsCopy);
pruneHeap();
}
void AvailabilityMap::clear()
{
m_locals.fill(Availability());
m_heap.clear();
}
void AvailabilityMap::dump(PrintStream& out) const
{
out.print("{locals = ", m_locals, "; heap = ", mapDump(m_heap), "}");
}
void AvailabilityMap::merge(const AvailabilityMap& other)
{
for (unsigned i = other.m_locals.size(); i--;)
m_locals[i] = other.m_locals[i].merge(m_locals[i]);
for (auto pair : other.m_heap) {
auto result = m_heap.add(pair.key, Availability());
result.iterator->value = pair.value.merge(result.iterator->value);
}
}
} } // namespace JSC::DFG
#endif // ENABLE(DFG_JIT)
|
