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
|
/*
Copyright (C) 2022-2024 Sutou Kouhei <kou@clear-code.com>
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
This library 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
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#pragma once
#include "grn.h"
#ifdef GRN_WITH_APACHE_ARROW
# include "grn_arrow.hpp"
# include <arrow/util/thread_pool.h>
# include <mutex>
# include <unordered_map>
#endif
namespace grn {
class TaskExecutor {
private:
grn_ctx *ctx_;
uint32_t n_workers_;
#ifdef GRN_WITH_APACHE_ARROW
std::shared_ptr<::arrow::internal::ThreadPool> thread_pool_;
std::unordered_map<uintptr_t, ::arrow::Future<bool>> futures_;
std::mutex futures_mutex_;
#endif
public:
TaskExecutor(grn_ctx *ctx)
: ctx_(ctx),
n_workers_(0)
#ifdef GRN_WITH_APACHE_ARROW
,
thread_pool_(nullptr),
futures_(),
futures_mutex_()
#endif
{
}
void
set_n_workers(int32_t n_workers)
{
#ifdef GRN_WITH_APACHE_ARROW
if (n_workers < 0) {
n_workers = ::arrow::internal::ThreadPool::DefaultCapacity();
}
if (static_cast<uint32_t>(n_workers) == n_workers_) {
return;
}
n_workers_ = n_workers;
if (n_workers_ > 1) {
if (thread_pool_) {
if (!thread_pool_->SetCapacity(n_workers_).ok()) {
n_workers_ = 0;
}
} else {
auto thread_pool_result =
::arrow::internal::ThreadPool::MakeEternal(n_workers_);
if (thread_pool_result.ok()) {
thread_pool_ = *thread_pool_result;
} else {
n_workers_ = 0;
}
}
}
#endif
}
uint32_t
get_n_workers()
{
return n_workers_;
}
bool
is_parallel()
{
#ifdef GRN_WITH_APACHE_ARROW
if (n_workers_ > 1) {
return true;
}
#endif
return false;
}
template <typename Function>
bool
execute(uintptr_t id, Function &&func, const char *tag)
{
#ifdef GRN_WITH_APACHE_ARROW
if (is_parallel()) {
auto future_result = thread_pool_->Submit(func);
if (!grnarrow::check(ctx_,
future_result,
tag,
" failed to submit a job")) {
return false;
}
{
std::unique_lock<std::mutex> lock(futures_mutex_);
futures_.emplace(id, *future_result);
}
return true;
}
#endif
return func();
}
bool
wait(uintptr_t id, const char *tag)
{
#ifdef GRN_WITH_APACHE_ARROW
if (is_parallel()) {
try {
std::unique_lock<std::mutex> lock(futures_mutex_);
auto future = futures_.at(id);
lock.unlock();
auto status = future.status();
lock.lock();
futures_.erase(id);
lock.unlock();
return grnarrow::check(ctx_,
status,
tag,
" failed to wait a job: ",
id);
} catch (std::out_of_range &) {
return true;
}
}
#endif
return true;
}
bool
wait_all()
{
#ifdef GRN_WITH_APACHE_ARROW
if (is_parallel()) {
thread_pool_->WaitForIdle();
return ctx_->rc == GRN_SUCCESS;
}
#endif
return true;
}
};
} // namespace grn
|
