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
|
// Copyright Yahoo. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include "producerconsumer.h"
#include <vespa/vespalib/testkit/testapp.h>
#include <vespamalloc/malloc/allocchunk.h>
#include <vespamalloc/util/callstack.h>
#include <thread>
#include <vespa/log/log.h>
LOG_SETUP("linklist_test");
using vespalib::Consumer;
using vespalib::Producer;
using vespalib::ProducerConsumer;
TEST_SETUP(Test);
//-----------------------------------------------------------------------------
template <size_t MinSizeClassC, size_t MaxSizeClassMultiAllocC>
class MemBlockT : public vespamalloc::CommonT<MinSizeClassC>
{
public:
typedef vespamalloc::StackEntry Stack;
enum {
MaxSizeClassMultiAlloc = MaxSizeClassMultiAllocC,
SizeClassSpan = (MaxSizeClassMultiAllocC-MinSizeClassC)
};
MemBlockT() : _ptr(nullptr) { }
MemBlockT(void * p) : _ptr(p) { }
MemBlockT(void * p, size_t /*sz*/) : _ptr(p) { }
void *ptr() { return _ptr; }
const void *ptr() const { return _ptr; }
bool validAlloc() const { return _ptr != nullptr; }
bool validFree() const { return _ptr != nullptr; }
void setExact(size_t ) { }
void alloc(bool ) { }
void threadId(int ) { }
void free() { }
size_t size() const { return 0; }
bool allocated() const { return false; }
int threadId() const { return 0; }
void info(FILE *, unsigned level=0) const { (void) level; }
Stack * callStack() { return nullptr; }
size_t callStackLen() const { return 0; }
static size_t adjustSize(size_t sz) { return sz; }
static size_t unAdjustSize(size_t sz) { return sz; }
static void dumpInfo(size_t level);
private:
void * _ptr;
};
typedef MemBlockT<5, 20> DummyMemBlock;
typedef vespamalloc::AFList<DummyMemBlock> List;
const size_t NumBlocks((64*(32+2)+16)*2);
List globalList[NumBlocks];
class LinkIn : public Consumer {
public:
LinkIn(List::AtomicHeadPtr & list, uint32_t maxQueue, bool inverse);
private:
List::AtomicHeadPtr & _head;
void consume(void * p) override {
List * l((List *) p);
if ( ! ((l >= &globalList[0]) && (l < &globalList[NumBlocks]))) { abort(); }
List::linkIn(_head, l, l);
}
};
LinkIn::LinkIn(List::AtomicHeadPtr & list, uint32_t maxQueue, bool inverse) :
Consumer (maxQueue, inverse),
_head(list)
{
}
//-----------------------------------------------------------------------------
class LinkOut : public Producer {
public:
LinkOut(List::AtomicHeadPtr & list, uint32_t cnt, LinkIn &target)
: Producer(cnt, target), _head(list) {}
private:
List::AtomicHeadPtr & _head;
void * produce() override {
void *p = List::linkOut(_head);
List *l((List *)p);
if ( ! ((l >= &globalList[0]) && (l < &globalList[NumBlocks]))) { abort(); }
return p;
}
};
//-----------------------------------------------------------------------------
class LinkInOutAndIn : public ProducerConsumer {
public:
LinkInOutAndIn(List::AtomicHeadPtr & list, uint32_t cnt, bool inverse)
: ProducerConsumer(cnt, inverse), _head(list) { }
private:
List::AtomicHeadPtr & _head;
void * produce() override {
void *p = List::linkOut(_head);
List *l((List *)p);
if ( !((l >= &globalList[0]) && (l < &globalList[NumBlocks]))) { abort(); }
return p;
}
void consume(void * p) override {
List * l((List *) p);
if ( !((l >= &globalList[0]) && (l < &globalList[NumBlocks]))) { abort(); }
List::linkIn(_head, l, l);
}
};
//-----------------------------------------------------------------------------
int Test::Main() {
int duration = 10;
if (_argc > 1) {
duration = atoi(_argv[1]);
}
TEST_INIT("allocfree_test");
ASSERT_EQUAL(1024ul, sizeof(List));
vespalib::ThreadPool pool;
List::AtomicHeadPtr sharedList(List::HeadPtr(nullptr, 1));
fprintf(stderr, "Start populating list\n");
for (size_t i=0; i < NumBlocks; i++) {
List * l(&globalList[i]);
List::linkIn(sharedList, l, l);
}
fprintf(stderr, "Finished populating list with %ld elements\n", NumBlocks);
fprintf(stderr, "Start verifying result 1.\n");
for (size_t i=0; i < NumBlocks; i++) {
List *l = List::linkOut(sharedList);
ASSERT_TRUE((l >= &globalList[0]) && (l < &globalList[NumBlocks]));
}
List *n = List::linkOut(sharedList);
ASSERT_TRUE(n == nullptr);
List::HeadPtr tmp(sharedList.load());
tmp._tag = 1;
sharedList.store(tmp);
fprintf(stderr, "Start populating list\n");
for (size_t i=0; i < NumBlocks; i++) {
List * l(&globalList[i]);
List::linkIn(sharedList, l, l);
}
fprintf(stderr, "Finished populating list with %ld elements\n", NumBlocks);
LinkIn c1(sharedList, 64, false);
LinkIn c2(sharedList, 64, true);
LinkOut p1(sharedList, 32, c1);
LinkOut p2(sharedList, 32, c2);
LinkInOutAndIn pc1(sharedList, 16, false);
LinkInOutAndIn pc2(sharedList, 16, true);
std::atomic<bool> stop_flag(false);
c1.start(pool, stop_flag);
c2.start(pool, stop_flag);
p1.start(pool, stop_flag);
p2.start(pool, stop_flag);
pc1.start(pool, stop_flag);
pc2.start(pool, stop_flag);
for (; duration > 0; --duration) {
LOG(info, "%d seconds left...", duration);
std::this_thread::sleep_for(1s);
}
stop_flag = true;
pool.join();
fprintf(stderr, "Did (%lu + %lu) = %lu linkIn operations\n",
c1.operations(), c2.operations(), c1.operations() + c2.operations());
fprintf(stderr, "Did (%lu + %lu) = %lu linkOut operations\n",
p1.operations(), p2.operations(), p1.operations() + p2.operations());
fprintf(stderr, "Did (%lu + %lu) = %lu linkInOut operations\n",
pc1.operationsConsumed(), pc2.operationsConsumed(), pc1.operationsConsumed() + pc2.operationsConsumed());
fprintf(stderr, "Did %lu Total operations\n",
c1.operations() + c2.operations() + p1.operations() + p2.operations() + pc1.operationsConsumed() + pc2.operationsConsumed());
fprintf(stderr, "Start verifying result 2.\n");
for (size_t i=0; i < NumBlocks; i++) {
List *l = List::linkOut(sharedList);
ASSERT_TRUE((l >= &globalList[0]) && (l < &globalList[NumBlocks]));
}
n = List::linkOut(sharedList);
ASSERT_TRUE(n == nullptr);
TEST_DONE();
}
|
