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
182
183
184
185
186
|
/*
* Copyright (C) 2016-2021 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.
*/
#pragma once
#if ENABLE(DFG_JIT)
#include <wtf/StdLibExtras.h>
#include <wtf/Vector.h>
namespace JSC { namespace B3 {
// B3::Procedure and Air::Code have a lot of collections of indexed things. This has all of the
// logic.
template<typename T>
class SparseCollection {
typedef Vector<std::unique_ptr<T>> VectorType;
public:
SparseCollection()
{
}
T* add(std::unique_ptr<T> value)
{
T* result = value.get();
size_t index;
if (m_indexFreeList.isEmpty()) {
index = m_vector.size();
m_vector.append(nullptr);
} else
index = m_indexFreeList.takeLast();
value->m_index = index;
ASSERT(!m_vector[index]);
new (NotNull, &m_vector[index]) std::unique_ptr<T>(WTFMove(value));
return result;
}
T* cloneAndAdd(const T& node)
{
return add(makeUnique<T>(node));
}
template<typename... Arguments>
T* addNew(Arguments&&... arguments)
{
return add(std::unique_ptr<T>(new T(std::forward<Arguments>(arguments)...)));
}
void remove(T* value)
{
RELEASE_ASSERT(m_vector[value->m_index].get() == value);
m_indexFreeList.append(value->m_index);
m_vector[value->m_index] = nullptr;
}
void packIndices()
{
if (m_indexFreeList.isEmpty())
return;
unsigned holeIndex = 0;
unsigned endIndex = m_vector.size();
while (true) {
while (holeIndex < endIndex && m_vector[holeIndex])
++holeIndex;
if (holeIndex == endIndex)
break;
ASSERT(holeIndex < m_vector.size());
ASSERT(!m_vector[holeIndex]);
do {
--endIndex;
} while (!m_vector[endIndex] && endIndex > holeIndex);
if (holeIndex == endIndex)
break;
ASSERT(endIndex > holeIndex);
ASSERT(m_vector[endIndex]);
auto& value = m_vector[endIndex];
value->m_index = holeIndex;
m_vector[holeIndex] = WTFMove(value);
++holeIndex;
}
m_indexFreeList.shrink(0);
m_vector.shrink(endIndex);
}
void clearAll()
{
m_indexFreeList.clear();
m_vector.clear();
}
unsigned size() const { return m_vector.size(); }
bool isEmpty() const { return m_vector.isEmpty(); }
T* at(unsigned index) const { return m_vector[index].get(); }
T* operator[](unsigned index) const { return at(index); }
class iterator {
public:
iterator()
: m_collection(nullptr)
, m_index(0)
{
}
iterator(const SparseCollection& collection, unsigned index)
: m_collection(&collection)
, m_index(findNext(index))
{
}
T* operator*()
{
return m_collection->at(m_index);
}
iterator& operator++()
{
m_index = findNext(m_index + 1);
return *this;
}
bool operator==(const iterator& other) const
{
ASSERT(m_collection == other.m_collection);
return m_index == other.m_index;
}
private:
friend class SparseCollection;
unsigned findNext(unsigned index)
{
while (index < m_collection->size() && !m_collection->at(index))
index++;
return index;
}
const SparseCollection* m_collection;
unsigned m_index;
};
iterator begin() const { return iterator(*this, 0); }
iterator end() const { return iterator(*this, size()); }
private:
Vector<std::unique_ptr<T>, 0, UnsafeVectorOverflow> m_vector;
Vector<size_t, 0, UnsafeVectorOverflow> m_indexFreeList;
};
} } // namespace JSC::B3
#endif // ENABLE(DFG_JIT)
|
