forked from valyala/gheap
-
Notifications
You must be signed in to change notification settings - Fork 0
/
ops_count_test.cpp
462 lines (380 loc) · 9.19 KB
/
ops_count_test.cpp
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
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
// Compares the number of operations with items in gheap-based algorithms
// to the number of operations with items in the corresponding STL algorithms.
//
// Pass -DNDEBUG for eliminating operations related to debugging checks.
#include "galgorithm.hpp"
#include "gheap.hpp"
#include <algorithm>
#include <cassert>
#include <cstddef>
#include <cstdlib>
#include <iostream>
#include <iterator>
#include <list>
#include <stdint.h> // for uintptr_t (<cstdint> is missing in C++03).
#include <vector>
using namespace std;
// Simulates a LRU list of pages, which can contain up to _max_lru_size entries.
// Each page has size PAGE_MASK + 1.
struct lru
{
typedef list<uintptr_t> lru_t;
static const uintptr_t PAGE_MASK = (((uintptr_t)1) << 12) - 1;
// Maximum number of pages in LRU list.
static const size_t MAX_LRU_SIZE = 16;
// LRU list of pages. Front of the list contains least recently used pages.
static lru_t lru_pages;
// The number of simulated pagefaults since the last lru::init() call.
static int pagefaults;
// Resets the model to initial state.
static void reset()
{
lru_pages.clear();
pagefaults = 0;
}
// Simulates access to a memory pointed by ptr.
// Brings the accessed page to the back of LRU list.
// If the page is absent in LRU list, then increments pagefaults counter.
static void access_ptr(const void *const ptr)
{
assert(lru_pages.size() <= MAX_LRU_SIZE);
uintptr_t page_num = ((uintptr_t)ptr) & ~PAGE_MASK;
lru_t::iterator it = find(lru_pages.begin(), lru_pages.end(),
page_num);
if (it == lru_pages.end()) {
++pagefaults;
lru_pages.push_front(page_num);
if (lru_pages.size() > MAX_LRU_SIZE) {
lru_pages.pop_back();
}
assert(lru_pages.size() <= MAX_LRU_SIZE);
}
else {
lru_pages.splice(lru_pages.begin(), lru_pages, it);
}
}
};
lru::lru_t lru::lru_pages;
int lru::pagefaults = 0;
struct A
{
static int default_ctors;
static int copy_ctors;
static int copy_assignments;
static int swaps;
static int cheap_dtors;
static int expensive_dtors;
static int move_ctors;
static int cheap_move_assignments;
static int expensive_move_assignments;
static int comparisons;
static void reset()
{
default_ctors = 0;
copy_ctors = 0;
copy_assignments = 0;
swaps = 0;
cheap_dtors = 0;
expensive_dtors = 0;
move_ctors = 0;
cheap_move_assignments = 0;
expensive_move_assignments = 0;
comparisons = 0;
lru::reset();
}
static void print()
{
cout << "default_ctors=" << default_ctors << ", copy_ctors=" <<
copy_ctors << ", copy_assignments=" << copy_assignments <<
", swaps=" << swaps << ", cheap_dtors=" << cheap_dtors <<
", expensive_dtors=" << expensive_dtors << ", move_ctors=" <<
move_ctors << ", cheap_move_assignments=" << cheap_move_assignments <<
", expensive_move_assignments=" << expensive_move_assignments <<
", comparisons=" << comparisons << ", pagefaults=" << lru::pagefaults <<
endl;
}
int value;
bool has_value() const
{
return (value >= 0);
}
int get_value() const
{
assert(has_value());
lru::access_ptr(this);
return value;
}
void set_value(const int v)
{
assert(v >= 0);
value = v;
lru::access_ptr(this);
}
void set_value(const A &a)
{
int v = a.get_value();
set_value(v);
}
void clear_value()
{
value = -1;
lru::access_ptr(this);
}
A()
{
++default_ctors;
clear_value();
}
A(const int v)
{
set_value(v);
}
A(const A &a)
{
++copy_ctors;
set_value(a);
}
void operator = (const A &a)
{
if (this == &a) {
return;
}
assert(has_value());
++copy_assignments;
set_value(a);
}
~A()
{
if (has_value()) {
++expensive_dtors;
}
else {
++cheap_dtors;
}
clear_value();
}
#ifdef GHEAP_CPP11
A(A &&a)
{
++move_ctors;
set_value(a);
a.clear_value();
}
void operator = (A &&a)
{
if (this == &a) {
return;
}
if (has_value()) {
++expensive_move_assignments;
}
else {
++cheap_move_assignments;
}
set_value(a);
a.clear_value();
}
#endif
};
int A::default_ctors;
int A::copy_ctors;
int A::copy_assignments;
int A::swaps;
int A::cheap_dtors;
int A::expensive_dtors;
int A::move_ctors;
int A::cheap_move_assignments;
int A::expensive_move_assignments;
int A::comparisons;
namespace std
{
template <>
void swap(A &a, A &b)
{
++A::swaps;
int tmp = a.get_value();
a.set_value(b);
b.set_value(tmp);
}
}
bool operator < (const A &a, const A &b)
{
++A::comparisons;
return (a.get_value() < b.get_value());
}
struct stl
{
static const char *name()
{
return "stl";
}
template <class RandomAccessIterator>
static void push_heap(const RandomAccessIterator &first,
const RandomAccessIterator &last)
{
::std::push_heap(first, last);
}
template <class RandomAccessIterator>
static void pop_heap(const RandomAccessIterator &first,
const RandomAccessIterator &last)
{
::std::pop_heap(first, last);
}
template <class RandomAccessIterator>
static void make_heap(const RandomAccessIterator &first,
const RandomAccessIterator &last)
{
::std::make_heap(first, last);
}
template <class RandomAccessIterator>
static void sort_heap(const RandomAccessIterator &first,
const RandomAccessIterator &last)
{
::std::sort_heap(first, last);
}
};
struct gtl
{
typedef gheap<> heap;
static const char *name()
{
return "gheap<>";
}
template <class RandomAccessIterator>
static void push_heap(const RandomAccessIterator &first,
const RandomAccessIterator &last)
{
heap::push_heap(first, last);
}
template <class RandomAccessIterator>
static void pop_heap(const RandomAccessIterator &first,
const RandomAccessIterator &last)
{
heap::pop_heap(first, last);
}
template <class RandomAccessIterator>
static void make_heap(const RandomAccessIterator &first,
const RandomAccessIterator &last)
{
heap::make_heap(first, last);
}
template <class RandomAccessIterator>
static void sort_heap(const RandomAccessIterator &first,
const RandomAccessIterator &last)
{
heap::sort_heap(first, last);
}
};
namespace {
void init_array(vector<A> &a, const size_t n)
{
a.clear();
srand(0);
generate_n(back_inserter(a), n, rand);
}
template <class Heap>
void test_push_heap(vector<A> &a, const size_t n)
{
cout << " test_push_heap(" << Heap::name() << "): ";
init_array(a, n);
A::reset();
for (size_t i = 2; i <= n; ++i) {
Heap::push_heap(a.begin(), a.begin() + i);
}
A::print();
}
template <class Heap>
void test_pop_heap(vector<A> &a, const size_t n)
{
cout << " test_pop_heap(" << Heap::name() << "): ";
init_array(a, n);
Heap::make_heap(a.begin(), a.end());
A::reset();
for (size_t i = 0; i < n - 1; ++i) {
Heap::pop_heap(a.begin(), a.end() - i);
}
A::print();
}
template <class Heap>
void test_make_heap(vector<A> &a, const size_t n)
{
cout << " test_make_heap(" << Heap::name() << "): ";
init_array(a, n);
A::reset();
Heap::make_heap(a.begin(), a.end());
A::print();
}
template <class Heap>
void test_sort_heap(vector<A> &a, const size_t n)
{
cout << " test_sort_heap(" << Heap::name() << "): ";
init_array(a, n);
Heap::make_heap(a.begin(), a.end());
A::reset();
Heap::sort_heap(a.begin(), a.end());
A::print();
}
void test_nway_mergesort_avg(vector<A> &a, const size_t n)
{
cout << " test_nway_mergesort_avg(" << gtl::name() << "): ";
typedef galgorithm<gtl::heap> algorithm;
init_array(a, n);
A::reset();
algorithm::nway_mergesort(a.begin(), a.end());
A::print();
}
void test_nway_mergesort_worst(vector<A> &a, const size_t n)
{
cout << " test_nway_mergesort_worst(" << gtl::name() << "): ";
typedef galgorithm<gtl::heap> algorithm;
// Simulate worst case for SGI STL sort implementation (aka introsort) -
// see http://en.wikipedia.org/wiki/Introsort .
// Actually n-way mergesort must be free of bad cases.
for (size_t i = 0; i < n; ++i) {
a[i] = n - i;
}
init_array(a, n);
A::reset();
algorithm::nway_mergesort(a.begin(), a.end());
A::print();
}
void test_sort_avg(vector<A> &a, const size_t n)
{
cout << " test_sort_avg(" << stl::name() << "): ";
init_array(a, n);
A::reset();
sort(a.begin(), a.end());
A::print();
}
void test_sort_worst(vector<A> &a, const size_t n)
{
cout << " test_sort_worst(" << stl::name() << "): ";
// Simulate worst case for SGI STL sort implementation (aka introsort) -
// see http://en.wikipedia.org/wiki/Introsort .
for (size_t i = 0; i < n; ++i) {
a[i] = n - i;
}
A::reset();
sort(a.begin(), a.end());
A::print();
}
} // end of anonymous namespace
int main()
{
const size_t N = 1000000;
cout << "N=" << N << endl;
vector<A> a;
a.reserve(N);
test_push_heap<stl>(a, N);
test_push_heap<gtl>(a, N);
test_pop_heap<stl>(a, N);
test_pop_heap<gtl>(a, N);
test_make_heap<stl>(a, N);
test_make_heap<gtl>(a, N);
test_sort_heap<stl>(a, N);
test_sort_heap<gtl>(a, N);
test_nway_mergesort_avg(a, N);
test_nway_mergesort_worst(a, N);
test_sort_avg(a, N);
test_sort_worst(a, N);
}