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
|
#include <iostream>
#include <cmath>
#include <unistd.h> // for usleep
#include <aocommon/threadpool.h>
#include <boost/test/unit_test.hpp>
using namespace aocommon;
BOOST_AUTO_TEST_SUITE(threadpool)
BOOST_AUTO_TEST_CASE(empty) {
ThreadPool();
BOOST_CHECK(true);
BOOST_CHECK_THROW(ThreadPool(0), std::runtime_error);
}
BOOST_AUTO_TEST_CASE(single) {
ThreadPool pool;
std::mutex mutex;
std::vector<size_t> counts(10, 0);
pool.For(0, 10, [&](size_t iter, size_t) {
std::unique_lock<std::mutex> lock(mutex);
counts[iter]++;
});
std::vector<size_t> ref(10, 1);
BOOST_CHECK_EQUAL_COLLECTIONS(counts.begin(), counts.end(), ref.begin(),
ref.end());
}
BOOST_AUTO_TEST_CASE(recursive) {
ThreadPool pool;
std::mutex mutex;
std::vector<size_t> counts(800, 0);
pool.For(0, 100, [&](size_t iter1, size_t) {
pool.For(0, 8, [&](size_t iter2, size_t) {
std::unique_lock<std::mutex> lock(mutex);
counts[iter1 + iter2 * 100]++;
});
});
std::vector<size_t> ref(800, 1);
BOOST_CHECK_EQUAL_COLLECTIONS(counts.begin(), counts.end(), ref.begin(),
ref.end());
}
BOOST_AUTO_TEST_CASE(slow_task) {
std::mutex mutex;
ThreadPool pool;
std::vector<size_t> counts(5 * pool.NThreads(), 0);
pool.For(0, 5 * pool.NThreads(), [&](size_t iter, size_t) {
usleep(1000);
std::unique_lock<std::mutex> lock(mutex);
counts[iter]++;
});
std::vector<size_t> ref(5 * pool.NThreads(), 1);
BOOST_CHECK_EQUAL_COLLECTIONS(counts.begin(), counts.end(), ref.begin(),
ref.end());
}
BOOST_AUTO_TEST_CASE(reuse) {
ThreadPool pool;
for (size_t i = 0; i != 100; ++i) {
volatile double x = 0.1;
pool.For(0, 100, [&](size_t iter, size_t) { (void)sin(x); });
}
}
BOOST_AUTO_TEST_CASE(set_n_threads) {
ThreadPool pool(1);
BOOST_CHECK_EQUAL(pool.NThreads(), 1);
pool.SetNThreads(4);
BOOST_CHECK_EQUAL(pool.NThreads(), 4);
}
BOOST_AUTO_TEST_SUITE_END()
|
