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
|
/* Copyright(C) 2019 MariaDB Corporation.
This program is free software; you can redistribute itand /or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; version 2 of the License.
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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111 - 1301 USA*/
#include <tpool.h>
#include <queue>
#include <mutex>
#include <condition_variable>
#include <tpool_structs.h>
namespace tpool
{
task::task(callback_func func, void* arg, task_group* group) :
m_func(func), m_arg(arg), m_group(group) {}
void task::execute()
{
if (m_group)
{
/* Executing in a group (limiting concurrency).*/
m_group->execute(this);
}
else
{
/* Execute directly. */
m_func(m_arg);
release();
}
}
/* Task that provide wait() operation. */
waitable_task::waitable_task(callback_func func, void* arg, task_group* group) :
task(func,arg, group),m_mtx(),m_cv(),m_ref_count(),m_waiter_count(){}
void waitable_task::add_ref()
{
std::unique_lock<std::mutex> lk(m_mtx);
m_ref_count++;
}
void waitable_task::release()
{
std::unique_lock<std::mutex> lk(m_mtx);
m_ref_count--;
if (!m_ref_count && m_waiter_count)
m_cv.notify_all();
}
void waitable_task::wait()
{
std::unique_lock<std::mutex> lk(m_mtx);
m_waiter_count++;
while (m_ref_count)
m_cv.wait(lk);
m_waiter_count--;
}
}
|
