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
|
/*
* This file is open source software, licensed to you under the terms
* of the Apache License, Version 2.0 (the "License"). See the NOTICE file
* distributed with this work for additional information regarding copyright
* ownership. You may not use this file except in compliance with the License.
*
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed on an
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* KIND, either express or implied. See the License for the
* specific language governing permissions and limitations
* under the License.
*/
/*
* Copyright 2014 Cloudius Systems
*/
#include <seastar/core/memory.hh>
#include <seastar/core/timer.hh>
#include <seastar/testing/random.hh>
#include <seastar/testing/test_runner.hh>
#include <seastar/util/assert.hh>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <memory>
#include <chrono>
#include <boost/program_options.hpp>
using namespace seastar;
struct allocation {
size_t n;
std::unique_ptr<char[]> data;
char poison;
allocation(size_t n, char poison) : n(n), data(new char[n]), poison(poison) {
std::fill_n(data.get(), n, poison);
}
~allocation() {
verify();
}
allocation(allocation&& x) noexcept = default;
void verify() {
if (data) {
SEASTAR_ASSERT(std::find_if(data.get(), data.get() + n, [this] (char c) {
return c != poison;
}) == data.get() + n);
}
}
allocation& operator=(allocation&& x) {
verify();
if (this != &x) {
data = std::move(x.data);
n = x.n;
poison = x.poison;
}
return *this;
}
};
template <size_t N>
struct alignas(N) cpp17_allocation final {
char v;
};
struct test17 {
struct handle {
const test17* d;
void* p;
handle(const test17* d, void* p) : d(d), p(p) {}
handle(const handle&) = delete;
handle(handle&& x) noexcept : d(std::exchange(x.d, nullptr)), p(std::exchange(x.p, nullptr)) {}
handle& operator=(const handle&) = delete;
handle& operator=(handle&& x) noexcept {
std::swap(d, x.d);
std::swap(p, x.p);
return *this;
}
~handle() {
if (d) {
d->free(p);
}
}
};
virtual ~test17() {}
virtual handle alloc() const = 0;
virtual void free(void* ptr) const = 0;
};
template <size_t N>
struct test17_concrete : test17 {
using value_type = cpp17_allocation<N>;
static_assert(sizeof(value_type) == N, "language does not guarantee size >= align");
virtual handle alloc() const override {
auto ptr = new value_type();
SEASTAR_ASSERT((reinterpret_cast<uintptr_t>(ptr) & (N - 1)) == 0);
return handle{this, ptr};
}
virtual void free(void* ptr) const override {
delete static_cast<value_type*>(ptr);
}
};
void test_cpp17_aligned_allocator() {
std::vector<std::unique_ptr<test17>> tv;
tv.push_back(std::make_unique<test17_concrete<1>>());
tv.push_back(std::make_unique<test17_concrete<2>>());
tv.push_back(std::make_unique<test17_concrete<4>>());
tv.push_back(std::make_unique<test17_concrete<8>>());
tv.push_back(std::make_unique<test17_concrete<16>>());
tv.push_back(std::make_unique<test17_concrete<64>>());
tv.push_back(std::make_unique<test17_concrete<128>>());
tv.push_back(std::make_unique<test17_concrete<2048>>());
tv.push_back(std::make_unique<test17_concrete<4096>>());
tv.push_back(std::make_unique<test17_concrete<4096*16>>());
tv.push_back(std::make_unique<test17_concrete<4096*256>>());
std::default_random_engine random_engine(testing::local_random_engine());
std::uniform_int_distribution<> type_dist(0, 1);
std::uniform_int_distribution<size_t> size_dist(0, tv.size() - 1);
std::uniform_real_distribution<> which_dist(0, 1);
std::vector<test17::handle> allocs;
for (unsigned i = 0; i < 10000; ++i) {
auto type = type_dist(random_engine);
switch (type) {
case 0: {
size_t sz_idx = size_dist(random_engine);
allocs.push_back(tv[sz_idx]->alloc());
break;
}
case 1:
if (!allocs.empty()) {
size_t idx = which_dist(random_engine) * allocs.size();
std::swap(allocs[idx], allocs.back());
allocs.pop_back();
}
break;
}
}
}
int main(int ac, char** av) {
namespace bpo = boost::program_options;
bpo::options_description opts("Allowed options");
opts.add_options()
("help", "produce this help message")
("iterations", bpo::value<unsigned>(), "run s specified number of iterations")
("time", bpo::value<float>()->default_value(5.0), "run for a specified amount of time, in seconds")
("random-seed", boost::program_options::value<unsigned>(), "Random number generator seed");
;
bpo::variables_map vm;
bpo::store(bpo::parse_command_line(ac, av, opts), vm);
bpo::notify(vm);
test_cpp17_aligned_allocator();
auto seed = vm.count("random-seed") ? vm["random-seed"].as<unsigned>() : std::random_device{}();
std::default_random_engine random_engine(seed);
std::exponential_distribution<> distr(0.2);
std::uniform_int_distribution<> type(0, 1);
std::uniform_int_distribution<int> poison(-128, 127);
std::uniform_real_distribution<> which(0, 1);
std::vector<allocation> allocations;
auto iteration = [&] {
auto typ = type(random_engine);
switch (typ) {
case 0: {
size_t n = std::min<double>(std::exp(distr(random_engine)), 1 << 25);
try {
allocations.emplace_back(n, poison(random_engine));
} catch (std::bad_alloc&) {
}
break;
}
case 1: {
if (allocations.empty()) {
break;
}
size_t i = which(random_engine) * allocations.size();
allocations[i] = std::move(allocations.back());
allocations.pop_back();
break;
}
}
};
if (vm.count("help")) {
std::cout << opts << "\n";
return 1;
}
std::cout << "random-seed=" << seed << "\n";
if (vm.count("iterations")) {
auto iterations = vm["iterations"].as<unsigned>();
for (unsigned i = 0; i < iterations; ++i) {
iteration();
}
} else {
auto time = vm["time"].as<float>();
using clock = steady_clock_type;
auto end = clock::now() + std::chrono::duration_cast<std::chrono::nanoseconds>(std::chrono::seconds(1) * time);
while (clock::now() < end) {
for (unsigned i = 0; i < 1000; ++i) {
iteration();
}
}
}
return 0;
}
|
