-
Notifications
You must be signed in to change notification settings - Fork 1
/
cptl_stl.hpp
202 lines (182 loc) · 6.41 KB
/
cptl_stl.hpp
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
190
191
192
193
194
195
196
197
198
199
200
201
202
/*********************************************************
*
* Copyright (C) 2014 by Vitaliy Vitsentiy
*
* 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.
*
*********************************************************/
#ifndef __ctpl_stl_thread_pool_H__
#define __ctpl_stl_thread_pool_H__
#include <atomic>
#include <exception>
#include <functional>
#include <future>
#include <memory>
#include <mutex>
#include <queue>
#include <thread>
#include <vector>
// thread pool to run user's functors with signature
// ret func(int id, other_params)
// where id is the index of the thread that runs the functor
// ret is some return type
namespace ctpl {
namespace detail {
template <typename T>
class Queue {
public:
bool push(T const &value)
{
std::unique_lock<std::mutex> lock(this->mutex);
this->q.push(value);
return true;
}
// deletes the retrieved element, do not use for non integral types
bool pop(T &v)
{
std::unique_lock<std::mutex> lock(this->mutex);
if (this->q.empty())
return false;
v = this->q.front();
this->q.pop();
return true;
}
bool empty()
{
std::unique_lock<std::mutex> lock(this->mutex);
return this->q.empty();
}
private:
std::queue<T> q;
std::mutex mutex;
};
} // namespace detail
class thread_pool {
public:
thread_pool() noexcept = default;
thread_pool(int nThreads) noexcept
{
this->threads.resize(nThreads);
for (int i = 0; i < nThreads; ++i) {
this->set_thread(i);
}
}
// the destructor waits for all the functions in the queue to be finished
~thread_pool() { this->stop(); }
// get the number of running threads in the pool
int size() { return static_cast<int>(this->threads.size()); }
// number of idle threads
int n_idle() { return this->nWaiting; }
std::thread &get_thread(int i) { return *this->threads[i]; }
// empty the queue
void clear_queue()
{
std::function<void(int id)> *_f;
while (this->q.pop(_f))
delete _f; // empty the queue
}
// pops a functional wrapper to the original function
std::function<void(int)> pop()
{
std::function<void(int id)> *_f = nullptr;
this->q.pop(_f);
std::unique_ptr<std::function<void(int id)>> func(
_f); // at return, delete the function even if an exception
// occurred
std::function<void(int)> f;
if (_f)
f = *_f;
return f;
}
// wait for all computing threads to finish and stop all threads
// may be called asynchronously to not pause the calling thread while
// waiting. All the functions in the queue are run.
void stop()
{
if (this->isDone)
return;
this->isDone = true; // give the waiting threads a command to finish
{
std::unique_lock<std::mutex> lock(this->mutex);
this->cv.notify_all(); // stop all waiting threads
}
for (int i = 0; i < static_cast<int>(this->threads.size());
++i) { // wait for the computing threads to finish
if (this->threads[i]->joinable())
this->threads[i]->join();
}
// if there were no threads in the pool but some functors in the queue,
// the functors are not deleted by the threads therefore delete them
// here
this->clear_queue();
this->threads.clear();
}
// run the user's function that excepts argument int - id of the running
// thread. returned value is templatized operator returns std::future, where
// the user can get the result and rethrow the catched exceptins
template <typename F>
auto push(F &&f) -> std::future<decltype(f(0))>
{
auto pck = std::make_shared<std::packaged_task<decltype(f(0))(int)>>(
std::forward<F>(f));
auto _f =
new std::function<void(int id)>([pck](int id) { (*pck)(id); });
this->q.push(_f);
std::unique_lock<std::mutex> lock(this->mutex);
this->cv.notify_one();
return pck->get_future();
}
private:
// deleted
thread_pool(const thread_pool &); // = delete;
thread_pool(thread_pool &&); // = delete;
thread_pool &operator=(const thread_pool &); // = delete;
thread_pool &operator=(thread_pool &&); // = delete;
void set_thread(int i)
{
auto f = [this, i]() {
std::function<void(int id)> *_f;
bool isPop = this->q.pop(_f);
while (true) {
while (isPop) { // if there is anything in the queue
std::unique_ptr<std::function<void(int id)>> func(
_f); // at return, delete the function even if an
// exception occurred
(*_f)(i);
isPop = this->q.pop(_f);
}
// the queue is empty here, wait for the next command
std::unique_lock<std::mutex> lock(this->mutex);
++this->nWaiting;
this->cv.wait(lock, [this, &_f, &isPop]() {
isPop = this->q.pop(_f);
return isPop || this->isDone;
});
--this->nWaiting;
if (!isPop)
return; // if the queue is empty and this->isDone == true
// or *flag then return
}
};
this->threads[i].reset(
new std::thread(f)); // compiler may not support std::make_unique()
}
std::vector<std::unique_ptr<std::thread>> threads;
detail::Queue<std::function<void(int id)> *> q;
std::atomic<bool> isDone = false;
std::atomic<int> nWaiting = 0; // how many threads are waiting
std::mutex mutex;
std::condition_variable cv;
};
} // namespace ctpl
#endif // __ctpl_stl_thread_pool_H__