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
// Copyright (c) 2014 Baidu, Inc.
// Author: Ge,Jun (gejun@baidu.com)
#include <algorithm> // std::sort
#include <gtest/gtest.h>
#include "base/time.h"
#include "base/macros.h"
#include "base/scoped_lock.h"
#include "bthread/work_stealing_queue.h"
namespace {
typedef size_t value_type;
bool g_stop = false;
const size_t N = 1024*512;
const size_t CAP = 8;
pthread_mutex_t mutex = PTHREAD_MUTEX_INITIALIZER;
void* steal_thread(void* arg) {
std::vector<value_type> *stolen = new std::vector<value_type>;
stolen->reserve(N);
bthread::WorkStealingQueue<value_type> *q =
(bthread::WorkStealingQueue<value_type>*)arg;
value_type val;
while (!g_stop) {
if (q->steal(&val)) {
stolen->push_back(val);
} else {
asm volatile("pause\n": : :"memory");
}
}
return stolen;
}
void* push_thread(void* arg) {
size_t npushed = 0;
value_type seed = 0;
bthread::WorkStealingQueue<value_type> *q =
(bthread::WorkStealingQueue<value_type>*)arg;
while (true) {
pthread_mutex_lock(&mutex);
const bool pushed = q->push(seed);
pthread_mutex_unlock(&mutex);
if (pushed) {
++seed;
if (++npushed == N) {
g_stop = true;
break;
}
}
}
return NULL;
}
void* pop_thread(void* arg) {
std::vector<value_type> *popped = new std::vector<value_type>;
popped->reserve(N);
bthread::WorkStealingQueue<value_type> *q =
(bthread::WorkStealingQueue<value_type>*)arg;
while (!g_stop) {
value_type val;
pthread_mutex_lock(&mutex);
const bool res = q->pop(&val);
pthread_mutex_unlock(&mutex);
if (res) {
popped->push_back(val);
}
}
return popped;
}
TEST(WSQTest, sanity) {
bthread::WorkStealingQueue<value_type> q;
ASSERT_EQ(0, q.init(CAP));
pthread_t rth[8];
pthread_t wth, pop_th;
for (size_t i = 0; i < ARRAY_SIZE(rth); ++i) {
ASSERT_EQ(0, pthread_create(&rth[i], NULL, steal_thread, &q));
}
ASSERT_EQ(0, pthread_create(&wth, NULL, push_thread, &q));
ASSERT_EQ(0, pthread_create(&pop_th, NULL, pop_thread, &q));
std::vector<value_type> values;
values.reserve(N);
size_t nstolen = 0, npopped = 0;
for (size_t i = 0; i < ARRAY_SIZE(rth); ++i) {
std::vector<value_type>* res = NULL;
pthread_join(rth[i], (void**)&res);
for (size_t j = 0; j < res->size(); ++j, ++nstolen) {
values.push_back((*res)[j]);
}
}
pthread_join(wth, NULL);
std::vector<value_type>* res = NULL;
pthread_join(pop_th, (void**)&res);
for (size_t j = 0; j < res->size(); ++j, ++npopped) {
values.push_back((*res)[j]);
}
value_type val;
while (q.pop(&val)) {
values.push_back(val);
}
std::sort(values.begin(), values.end());
values.resize(std::unique(values.begin(), values.end()) - values.begin());
ASSERT_EQ(N, values.size());
for (size_t i = 0; i < N; ++i) {
ASSERT_EQ(i, values[i]);
}
std::cout << "stolen=" << nstolen
<< " popped=" << npopped
<< " left=" << (N - nstolen - npopped) << std::endl;
}
} // namespace