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
|
/*
* Copyright (C) 2015-2016 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 B3IndexSet_h
#define B3IndexSet_h
#include <wtf/BitVector.h>
#include <wtf/CommaPrinter.h>
namespace JSC { namespace B3 {
// This is a set for things that have an index(). It's super efficient for BasicBlocks. It's only
// efficient for Values if you don't create too many of these sets, since Values can have very sparse
// indices and there are a lot of Values.
// If you want a set of BasicBlocks, you do IndexSet<BasicBlock>. So, T = BasicBlock.
template<typename T>
class IndexSet {
public:
IndexSet()
{
}
bool add(T* value)
{
return !m_set.set(value->index());
}
template<typename Iterable>
bool addAll(const Iterable& iterable)
{
bool result = false;
for (T* value : iterable)
result |= add(value);
return result;
}
bool remove(T* value)
{
return m_set.clear(value->index());
}
bool contains(T* value) const
{
if (!value)
return false;
return m_set.get(value->index());
}
size_t size() const
{
return m_set.bitCount();
}
bool isEmpty() const
{
return !size();
}
template<typename CollectionType>
class Iterable {
public:
Iterable(const CollectionType& collection, const BitVector& set)
: m_collection(collection)
, m_set(set)
{
}
class iterator {
public:
iterator()
: m_collection(nullptr)
{
}
iterator(const CollectionType& collection, BitVector::iterator iter)
: m_collection(&collection)
, m_iter(iter)
{
}
T* operator*()
{
return m_collection->at(*m_iter);
}
iterator& operator++()
{
++m_iter;
return *this;
}
bool operator==(const iterator& other) const
{
return m_iter == other.m_iter;
}
bool operator!=(const iterator& other) const
{
return !(*this == other);
}
private:
const CollectionType* m_collection;
BitVector::iterator m_iter;
};
iterator begin() const { return iterator(m_collection, m_set.begin()); }
iterator end() const { return iterator(m_collection, m_set.end()); }
private:
const CollectionType& m_collection;
const BitVector& m_set;
};
// For basic blocks, you do:
// indexSet.values(procedure);
//
// For values, you do:
// indexSet.values(procedure.values());
template<typename CollectionType>
Iterable<CollectionType> values(const CollectionType& collection) const
{
return Iterable<CollectionType>(collection, indices());
}
const BitVector& indices() const { return m_set; }
void dump(PrintStream& out) const
{
CommaPrinter comma;
for (size_t index : indices())
out.print(comma, T::dumpPrefix, index);
}
private:
BitVector m_set;
};
} } // namespace JSC::B3
#endif // B3IndexSet_h
|
