forked from jegonzal/PowerGraph
-
Notifications
You must be signed in to change notification settings - Fork 0
/
test_lock_free_pool.cxx
74 lines (66 loc) · 1.77 KB
/
test_lock_free_pool.cxx
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
/*
* Copyright (c) 2009 Carnegie Mellon University.
* All rights reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* 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.
*
* For more about this software visit:
*
* http://www.graphlab.ml.cmu.edu
*
*/
#include <graphlab/util/lock_free_pool.hpp>
#include <graphlab/parallel/pthread_tools.hpp>
#include <graphlab/logger/assertions.hpp>
using namespace graphlab;
lock_free_pool<size_t> pool;
void exec() {
size_t *s = NULL;
for (size_t i = 0;i < 1000000; ++i) {
while(1) {
s = pool.alloc();
if (s == NULL) continue;
else {
for (size_t j = 0;j < 10; ++j) (*s)++;
pool.free(s);
break;
}
}
}
}
class LockFreePoolTestSuite: public CxxTest::TestSuite {
public:
void test_lock_free_pool() {
size_t nthreads = 8;
pool.reset_pool(32);
thread_group g;
for (size_t i = 0; i < nthreads; ++i) {
g.launch(exec);
}
while(1) {
try {
g.join();
break;
}
catch(const char* c ) {
std::cout << c << "\n";
}
}
std::vector<size_t> alldata = pool.unsafe_get_pool_ref();
size_t total = 0;
for (size_t i = 0;i < alldata.size(); ++i) {
total += alldata[i];
}
TS_ASSERT_EQUALS(total, 10000000 * nthreads);
}
};