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
|
// threadedtests.cpp - Tests for threaded code
//
/**
* Copyright (C) 2008 10gen Inc.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License, version 3,
* as published by the Free Software Foundation.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include "stdafx.h"
#include "../util/atomic_int.h"
#include "../util/mvar.h"
#include "../util/thread_pool.h"
#include <boost/thread.hpp>
#include <boost/bind.hpp>
#include "dbtests.h"
namespace ThreadedTests {
template <int nthreads_param=10>
class ThreadedTest{
public:
virtual void setup() {} //optional
virtual void subthread() = 0;
virtual void validate() = 0;
static const int nthreads = nthreads_param;
void run(){
setup();
launch_subthreads(nthreads);
validate();
}
virtual ~ThreadedTest() {}; // not necessary, but makes compilers happy
private:
void launch_subthreads(int remaining){
if (!remaining) return;
boost::thread athread(boost::bind(&ThreadedTest::subthread, this));
launch_subthreads(remaining - 1);
athread.join();
}
};
// Tested with up to 30k threads
class IsAtomicUIntAtomic : public ThreadedTest<> {
static const int iterations = 1000000;
AtomicUInt target;
void subthread(){
for(int i=0; i < iterations; i++){
//target.x++; // verified to fail with this version
target++;
}
}
void validate(){
ASSERT_EQUALS(target.x , unsigned(nthreads * iterations));
AtomicUInt u;
ASSERT_EQUALS(0u, u);
ASSERT_EQUALS(0u, u++);
ASSERT_EQUALS(2u, ++u);
ASSERT_EQUALS(2u, u--);
ASSERT_EQUALS(0u, --u);
ASSERT_EQUALS(0u, u);
}
};
class MVarTest : public ThreadedTest<> {
static const int iterations = 10000;
MVar<int> target;
public:
MVarTest() : target(0) {}
void subthread(){
for(int i=0; i < iterations; i++){
int val = target.take();
#if BOOST_VERSION >= 103500
//increase chances of catching failure
boost::this_thread::yield();
#endif
target.put(val+1);
}
}
void validate(){
ASSERT_EQUALS(target.take() , nthreads * iterations);
}
};
class ThreadPoolTest{
static const int iterations = 10000;
static const int nThreads = 8;
AtomicUInt counter;
void increment(int n){
for (int i=0; i<n; i++){
counter++;
}
}
public:
void run(){
ThreadPool tp(nThreads);
for (int i=0; i < iterations; i++){
tp.schedule(&ThreadPoolTest::increment, this, 2);
}
tp.join();
ASSERT(counter == (unsigned)(iterations * 2));
}
};
class All : public Suite {
public:
All() : Suite( "threading" ){
}
void setupTests(){
add< IsAtomicUIntAtomic >();
add< MVarTest >();
add< ThreadPoolTest >();
}
} myall;
}
|
