-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathThreadPool.cpp
More file actions
94 lines (83 loc) · 2.76 KB
/
ThreadPool.cpp
File metadata and controls
94 lines (83 loc) · 2.76 KB
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
//
// MIT License
//
// Copyright(c) 2016 - 2017 Martin - Pierrat Louis(louismartinpierrat@gmail.com)
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files(the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and / or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions :
//
// The above copyright notice and this permission notice shall be included in all
// copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
// SOFTWARE.
//
#include <iostream>
#include <cassert>
#include "ThreadPool.hpp"
ThreadPool::ThreadPool(std::size_t workers_number) :
m_terminate(false),
m_busy_workers_number(0)
{
for (std::size_t i = 0; i < workers_number; ++i)
{
this->m_workers.emplace_back(&ThreadPool::worker_routine, this);
}
}
ThreadPool::~ThreadPool(void)
{
{
std::lock_guard<std::mutex> lock(this->m_mutex);
this->m_terminate = true;
}
this->m_job_available.notify_all();
for (std::thread &worker : this->m_workers)
worker.join();
}
void
ThreadPool::add(const std::function<void()> &new_job)
{
{
std::lock_guard<std::mutex> lock(this->m_mutex);
this->m_jobs.push(new_job);
}
this->m_job_available.notify_one();
}
void
ThreadPool::wait_unfinished_jobs(void)
{
std::unique_lock<std::mutex> lock(this->m_mutex);
this->m_job_finished.wait(lock, [this]() {
return this->m_jobs.empty() && this->m_busy_workers_number == 0;
});
}
void
ThreadPool::worker_routine(void)
{
while (true)
{
std::function<void()> job;
{
std::unique_lock<std::mutex> lock(this->m_mutex);
this->m_job_available.wait(lock, [this]() {
return this->m_terminate || !this->m_jobs.empty();
});
if (this->m_terminate == true) break;
job = this->m_jobs.front();
this->m_jobs.pop();
}
this->m_busy_workers_number += 1;
job();
this->m_busy_workers_number -= 1;
this->m_job_finished.notify_all();
}
}