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
|
/*
* Copyright (C) 2013 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 DFGClobberSet_h
#define DFGClobberSet_h
#if ENABLE(DFG_JIT)
#include "DFGAbstractHeap.h"
#include <wtf/HashMap.h>
#include <wtf/HashSet.h>
#include <wtf/PrintStream.h>
namespace JSC { namespace DFG {
class Graph;
struct Node;
// FIXME: If we ever want to compare if two nodes clobber each other, we should
// have a SmallClobberSet, which just keeps an array of the AbstractHeaps and
// satisfies overlaps() requests by looping over all of them. This will probably
// be faster than a full HashMap in a lot of cases. Or, maybe, we could have
// ClobberSet be smart and use a vector so long as it was small.
class ClobberSet {
public:
ClobberSet();
~ClobberSet();
bool isEmpty() const { return m_clobbers.isEmpty(); }
void add(AbstractHeap);
void addAll(const ClobberSet&);
bool contains(AbstractHeap) const;
bool overlaps(AbstractHeap) const;
void clear();
// Calls useful for debugging the ClobberSet.
HashSet<AbstractHeap> direct() const;
HashSet<AbstractHeap> super() const;
void dump(PrintStream&) const;
private:
HashSet<AbstractHeap> setOf(bool direct) const;
// Maps heap to:
// true --> it's a direct clobber
// false --> it's just a supertype of a direct clobber
HashMap<AbstractHeap, bool> m_clobbers;
};
class ClobberSetAdd {
public:
ClobberSetAdd(ClobberSet& set)
: m_set(set)
{
}
void operator()(AbstractHeap heap) const
{
m_set.add(heap);
}
private:
ClobberSet& m_set;
};
class ClobberSetOverlaps {
public:
ClobberSetOverlaps(const ClobberSet& set)
: m_set(set)
, m_result(false)
{
}
void operator()(AbstractHeap heap) const
{
m_result |= m_set.overlaps(heap);
}
bool result() const { return m_result; }
private:
const ClobberSet& m_set;
mutable bool m_result;
};
void addReads(Graph&, Node*, ClobberSet&);
void addWrites(Graph&, Node*, ClobberSet&);
void addReadsAndWrites(Graph&, Node*, ClobberSet& reads, ClobberSet& writes);
bool readsOverlap(Graph&, Node*, ClobberSet&);
bool writesOverlap(Graph&, Node*, ClobberSet&);
} } // namespace JSC::DFG
#endif // ENABLE(DFG_JIT)
#endif // DFGClobberSet_h
|
