forked from facebook/hermes
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMarkBitArrayNCTest.cpp
More file actions
244 lines (202 loc) · 6.78 KB
/
Copy pathMarkBitArrayNCTest.cpp
File metadata and controls
244 lines (202 loc) · 6.78 KB
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
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
/*
* Copyright (c) Facebook, Inc. and its affiliates.
*
* This source code is licensed under the MIT license found in the
* LICENSE file in the root directory of this source tree.
*/
#ifdef HERMESVM_GC_NONCONTIG_GENERATIONAL
#include "gtest/gtest.h"
#include "hermes/VM/AlignedStorage.h"
#include "hermes/VM/HeapAlign.h"
#include "hermes/VM/MarkBitArrayNC.h"
#include "hermes/VM/StorageProvider.h"
#include "llvh/Support/MathExtras.h"
#include <ios>
#include <queue>
#include <utility>
#include <vector>
using namespace hermes::vm;
namespace {
struct MarkBitArrayNCTest : public ::testing::Test {
MarkBitArrayNCTest();
protected:
std::unique_ptr<StorageProvider> provider;
AlignedStorage as;
MarkBitArrayNC *mba;
// Addresses in the aligned storage to interact with during the tests.
std::vector<char *> addrs;
};
MarkBitArrayNCTest::MarkBitArrayNCTest()
: provider(StorageProvider::mmapProvider()),
as{std::move(AlignedStorage::create(provider.get()).get())},
mba(new (as.lowLim()) MarkBitArrayNC()) {
auto first = as.lowLim();
auto last = reinterpret_cast<char *>(
llvh::alignDown(reinterpret_cast<uintptr_t>(as.hiLim() - 1), HeapAlign));
addrs = {
first,
first + HeapAlign,
first + HeapAlign * 42,
last - HeapAlign * 42,
last - HeapAlign,
last};
EXPECT_TRUE(std::is_sorted(addrs.begin(), addrs.end()));
}
TEST_F(MarkBitArrayNCTest, AddressToIndex) {
// Expected indices in the mark bit array corresponding to the probe
// addresses into the storage.
size_t lastIx = MarkBitArrayNC::kNumBits - 1;
std::vector<size_t> indices{0, 1, 42, lastIx - 42, lastIx - 1, lastIx};
for (unsigned i = 0; i < addrs.size(); i++) {
char *addr = addrs.at(i);
size_t ind = indices.at(i);
EXPECT_EQ(ind, mba->addressToIndex(addr))
<< "0x" << std::hex << (void *)addr << " -> " << ind;
EXPECT_EQ(mba->indexToAddress(ind), addr)
<< "0x" << std::hex << (void *)addr << " <- " << ind;
}
}
TEST_F(MarkBitArrayNCTest, MarkGet) {
const size_t lastIx = MarkBitArrayNC::kNumBits - 1;
for (char *addr : addrs) {
size_t ind = mba->addressToIndex(addr);
EXPECT_FALSE(ind > 0 && mba->at(ind - 1)) << "initial " << ind << " - 1";
EXPECT_FALSE(mba->at(ind)) << "initial " << ind;
EXPECT_FALSE(ind < lastIx && mba->at(ind + 1))
<< "initial " << ind << " + 1";
mba->mark(ind);
EXPECT_FALSE(ind > 0 && mba->at(ind - 1)) << "mark " << ind << " - 1";
EXPECT_TRUE(mba->at(ind)) << "mark " << ind;
EXPECT_FALSE(ind < lastIx && mba->at(ind + 1)) << "mark " << ind << " + 1";
mba->clear();
}
}
TEST_F(MarkBitArrayNCTest, Initial) {
for (char *addr : addrs) {
size_t ind = mba->addressToIndex(addr);
EXPECT_FALSE(mba->at(ind));
}
}
TEST_F(MarkBitArrayNCTest, Clear) {
for (char *addr : addrs) {
size_t ind = mba->addressToIndex(addr);
ASSERT_FALSE(mba->at(ind));
}
for (char *addr : addrs) {
size_t ind = mba->addressToIndex(addr);
mba->mark(ind);
}
for (char *addr : addrs) {
size_t ind = mba->addressToIndex(addr);
ASSERT_TRUE(mba->at(ind));
}
mba->clear();
for (char *addr : addrs) {
size_t ind = mba->addressToIndex(addr);
EXPECT_FALSE(mba->at(ind));
}
}
TEST_F(MarkBitArrayNCTest, NextMarkedBitImmediate) {
char *addr = addrs.at(addrs.size() / 2);
size_t ind = mba->addressToIndex(addr);
mba->mark(ind);
EXPECT_EQ(ind, mba->findNextMarkedBitFrom(ind));
}
TEST_F(MarkBitArrayNCTest, NextMarkedBit) {
constexpr size_t FOUND_NONE = MarkBitArrayNC::kNumBits;
// Empty case: No marked bits
EXPECT_EQ(FOUND_NONE, mba->findNextMarkedBitFrom(0));
std::queue<size_t> indices;
for (char *addr : addrs) {
auto ind = mba->addressToIndex(addr);
mba->mark(ind);
indices.push(ind);
}
// Use the same style of loop we use elsewhere for scanning the array.
for (size_t from = mba->findNextMarkedBitFrom(0);
from < MarkBitArrayNC::kNumBits;
from = mba->findNextMarkedBitFrom(from + 1)) {
EXPECT_EQ(indices.front(), from);
indices.pop();
}
}
TEST_F(MarkBitArrayNCTest, NextUnmarkedBitImmediate) {
char *addr = addrs.at(addrs.size() / 2);
size_t ind = mba->addressToIndex(addr);
mba->markAll();
mba->bitArray_.set(ind, false);
EXPECT_EQ(ind, mba->findNextUnmarkedBitFrom(ind));
}
TEST_F(MarkBitArrayNCTest, NextUnmarkedBit) {
constexpr size_t FOUND_NONE = MarkBitArrayNC::kNumBits;
mba->markAll();
/// Full case: No unmarked bits
EXPECT_EQ(FOUND_NONE, mba->findNextUnmarkedBitFrom(0));
std::queue<size_t> indices;
for (char *addr : addrs) {
auto ind = mba->addressToIndex(addr);
mba->bitArray_.set(ind, false);
indices.push(ind);
}
// Use the same style of loop we use elsewhere for scanning the array.
for (size_t from = mba->findNextUnmarkedBitFrom(0);
from < MarkBitArrayNC::kNumBits;
from = mba->findNextUnmarkedBitFrom(from + 1)) {
EXPECT_EQ(indices.front(), from);
indices.pop();
}
}
TEST_F(MarkBitArrayNCTest, PrevMarkedBitImmediate) {
char *addr = addrs.at(addrs.size() / 2);
size_t ind = mba->addressToIndex(addr);
mba->bitArray_.set(ind, true);
EXPECT_EQ(ind, mba->findPrevMarkedBitFrom(ind + 1));
}
TEST_F(MarkBitArrayNCTest, PrevMarkedBit) {
constexpr size_t FOUND_NONE = MarkBitArrayNC::kNumBits;
size_t from = MarkBitArrayNC::kNumBits;
/// Empty case: No unmarked bits
EXPECT_EQ(FOUND_NONE, mba->findPrevMarkedBitFrom(from));
std::queue<size_t> indices;
size_t addrIdx = addrs.size();
while (addrIdx-- > 0) {
auto ind = mba->addressToIndex(addrs[addrIdx]);
mba->bitArray_.set(ind, true);
indices.push(ind);
}
for (size_t from = mba->findPrevMarkedBitFrom(MarkBitArrayNC::kNumBits);
from != MarkBitArrayNC::kNumBits;
from = mba->findPrevMarkedBitFrom(from)) {
EXPECT_EQ(indices.front(), from);
indices.pop();
}
}
TEST_F(MarkBitArrayNCTest, PrevUnmarkedBitImmediate) {
char *addr = addrs.at(addrs.size() / 2);
size_t ind = mba->addressToIndex(addr);
mba->markAll();
mba->bitArray_.set(ind, false);
EXPECT_EQ(ind, mba->findPrevUnmarkedBitFrom(ind + 1));
}
TEST_F(MarkBitArrayNCTest, PrevUnmarkedBit) {
constexpr size_t FOUND_NONE = MarkBitArrayNC::kNumBits;
mba->markAll();
size_t from = MarkBitArrayNC::kNumBits;
/// Full case: No unmarked bits
EXPECT_EQ(FOUND_NONE, mba->findPrevUnmarkedBitFrom(from));
std::queue<size_t> indices;
size_t addrIdx = addrs.size();
while (addrIdx-- > 0) {
auto ind = mba->addressToIndex(addrs[addrIdx]);
mba->bitArray_.set(ind, false);
indices.push(ind);
}
for (size_t from = mba->findPrevUnmarkedBitFrom(MarkBitArrayNC::kNumBits);
from != MarkBitArrayNC::kNumBits;
from = mba->findPrevUnmarkedBitFrom(from)) {
EXPECT_EQ(indices.front(), from);
indices.pop();
}
}
} // namespace
#endif // HERMESVM_GC_NONCONTIG_GENERATIONAL