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
|
/*
* Copyright (c) 2020, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2020 SAP SE. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*
*/
#include "precompiled.hpp"
#include "memory/metaspace/binList.hpp"
#include "memory/metaspace/counters.hpp"
//#define LOG_PLEASE
#include "metaspaceGtestCommon.hpp"
using metaspace::BinList32;
using metaspace::BinListImpl;
using metaspace::MemRangeCounter;
#define CHECK_BL_CONTENT(bl, expected_num, expected_size) { \
EXPECT_EQ(bl.count(), (unsigned)expected_num); \
EXPECT_EQ(bl.total_size(), (size_t)expected_size); \
if (expected_num == 0) { \
EXPECT_TRUE(bl.is_empty()); \
} else { \
EXPECT_FALSE(bl.is_empty()); \
} \
}
template <class BINLISTTYPE>
struct BinListBasicTest {
static const size_t minws;
static const size_t maxws;
static void basic_test() {
BINLISTTYPE bl;
CHECK_BL_CONTENT(bl, 0, 0);
MetaWord arr[1000];
size_t innocous_size = minws + ((maxws - minws) / 2);
// Try to get a block from an empty list.
size_t real_size = 4711;
MetaWord* p = bl.remove_block(innocous_size, &real_size);
EXPECT_EQ(p, (MetaWord*)NULL);
EXPECT_EQ((size_t)0, real_size);
// Add a block...
bl.add_block(arr, innocous_size);
CHECK_BL_CONTENT(bl, 1, innocous_size);
DEBUG_ONLY(bl.verify();)
// And retrieve it.
real_size = 4711;
p = bl.remove_block(innocous_size, &real_size);
EXPECT_EQ(p, arr);
EXPECT_EQ((size_t)innocous_size, real_size);
CHECK_BL_CONTENT(bl, 0, 0);
DEBUG_ONLY(bl.verify();)
}
static void basic_test_2() {
BINLISTTYPE bl;
CHECK_BL_CONTENT(bl, 0, 0);
MetaWord arr[1000];
for (size_t s1 = minws; s1 <= maxws; s1++) {
for (size_t s2 = minws; s2 <= maxws; s2++) {
bl.add_block(arr, s1);
CHECK_BL_CONTENT(bl, 1, s1);
DEBUG_ONLY(bl.verify();)
size_t real_size = 4711;
MetaWord* p = bl.remove_block(s2, &real_size);
if (s1 >= s2) {
EXPECT_EQ(p, arr);
EXPECT_EQ((size_t)s1, real_size);
CHECK_BL_CONTENT(bl, 0, 0);
DEBUG_ONLY(bl.verify();)
} else {
EXPECT_EQ(p, (MetaWord*)NULL);
EXPECT_EQ((size_t)0, real_size);
CHECK_BL_CONTENT(bl, 1, s1);
DEBUG_ONLY(bl.verify();)
// drain bl
p = bl.remove_block(minws, &real_size);
EXPECT_EQ(p, arr);
EXPECT_EQ((size_t)s1, real_size);
CHECK_BL_CONTENT(bl, 0, 0);
}
}
}
}
static void random_test() {
BINLISTTYPE bl[2];
MemRangeCounter cnt[2];
#define CHECK_COUNTERS \
ASSERT_EQ(cnt[0].count(), bl[0].count()); \
ASSERT_EQ(cnt[1].count(), bl[1].count()); \
ASSERT_EQ(cnt[0].total_size(), bl[0].total_size()); \
ASSERT_EQ(cnt[1].total_size(), bl[1].total_size());
FeederBuffer fb(1024);
RandSizeGenerator rgen(minws, maxws + 1);
// feed all
int which = 0;
for (;;) {
size_t s = rgen.get();
MetaWord* p = fb.get(s);
if (p != NULL) {
bl[which].add_block(p, s);
cnt[which].add(s);
which = which == 0 ? 1 : 0;
} else {
break;
}
}
CHECK_COUNTERS;
DEBUG_ONLY(bl[0].verify();)
DEBUG_ONLY(bl[1].verify();)
// play pingpong
for (int iter = 0; iter < 1000; iter++) {
size_t s = rgen.get();
int taker = iter % 2;
int giver = taker == 0 ? 1 : 0;
size_t real_size = 4711;
MetaWord* p = bl[giver].remove_block(s, &real_size);
if (p != NULL) {
ASSERT_TRUE(fb.is_valid_range(p, real_size));
ASSERT_GE(real_size, s);
cnt[giver].sub(real_size);
bl[taker].add_block(p, real_size);
cnt[taker].add(real_size);
} else {
ASSERT_EQ(real_size, (size_t)NULL);
}
CHECK_COUNTERS;
}
CHECK_COUNTERS;
DEBUG_ONLY(bl[0].verify();)
DEBUG_ONLY(bl[1].verify();)
// drain both lists.
for (int which = 0; which < 2; which++) {
size_t last_size = 0;
while (bl[which].is_empty() == false) {
size_t real_size = 4711;
MetaWord* p = bl[which].remove_block(minws, &real_size);
ASSERT_NE(p, (MetaWord*) NULL);
ASSERT_GE(real_size, minws);
ASSERT_TRUE(fb.is_valid_range(p, real_size));
// This must hold true since we always return the smallest fit.
ASSERT_GE(real_size, last_size);
if (real_size > last_size) {
last_size = real_size;
}
cnt[which].sub(real_size);
CHECK_COUNTERS;
}
}
}
};
template <typename BINLISTTYPE> const size_t BinListBasicTest<BINLISTTYPE>::minws = BINLISTTYPE::MinWordSize;
template <typename BINLISTTYPE> const size_t BinListBasicTest<BINLISTTYPE>::maxws = BINLISTTYPE::MaxWordSize;
TEST_VM(metaspace, BinList_basic_8) { BinListBasicTest< BinListImpl<2, 8> >::basic_test(); }
TEST_VM(metaspace, BinList_basic_16) { BinListBasicTest< BinListImpl<2, 16> >::basic_test(); }
TEST_VM(metaspace, BinList_basic_32) { BinListBasicTest<BinList32>::basic_test(); }
TEST_VM(metaspace, BinList_basic_1331) { BinListBasicTest< BinListImpl<13, 31> >::basic_test(); }
TEST_VM(metaspace, BinList_basic_131) { BinListBasicTest< BinListImpl<13, 1> >::basic_test(); }
TEST_VM(metaspace, BinList_basic2_8) { BinListBasicTest< BinListImpl<2, 8> >::basic_test_2(); }
TEST_VM(metaspace, BinList_basic2_16) { BinListBasicTest< BinListImpl<2, 16> >::basic_test_2(); }
TEST_VM(metaspace, BinList_basic2_32) { BinListBasicTest<BinList32 >::basic_test_2(); }
TEST_VM(metaspace, BinList_basic2_1331) { BinListBasicTest< BinListImpl<13, 31> >::basic_test_2(); }
TEST_VM(metaspace, BinList_basic2_131) { BinListBasicTest< BinListImpl<13, 1> >::basic_test_2(); }
TEST_VM(metaspace, BinList_random_test_8) { BinListBasicTest< BinListImpl<2, 8> >::random_test(); }
TEST_VM(metaspace, BinList_random_test_16) { BinListBasicTest< BinListImpl<2, 16> >::random_test(); }
TEST_VM(metaspace, BinList_random_test_32) { BinListBasicTest<BinList32>::random_test(); }
TEST_VM(metaspace, BinList_random_test_1331) { BinListBasicTest< BinListImpl<13, 31> >::random_test(); }
TEST_VM(metaspace, BinList_random_test_131) { BinListBasicTest< BinListImpl<13, 1> >::random_test(); }
|
