blob: 57d7f61a0c2e890ec5c6b8751f254a879fb58003 [file] [log] [blame]
Mathieu Chartier93c21ba2018-12-10 13:08:30 -08001
Elliott Hughes1aa246d2012-12-13 09:29:36 -08002/*
3 * Copyright (C) 2012 The Android Open Source Project
4 *
5 * Licensed under the Apache License, Version 2.0 (the "License");
6 * you may not use this file except in compliance with the License.
7 * You may obtain a copy of the License at
8 *
9 * http://www.apache.org/licenses/LICENSE-2.0
10 *
11 * Unless required by applicable law or agreed to in writing, software
12 * distributed under the License is distributed on an "AS IS" BASIS,
13 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
14 * See the License for the specific language governing permissions and
15 * limitations under the License.
16 */
17
Mathieu Chartier0e4627e2012-10-23 16:13:36 -070018#include "thread_pool.h"
19
Andreas Gamped4901292017-05-30 18:41:34 -070020#include <sys/mman.h>
Andreas Gampe9e927f52016-02-29 20:49:38 -080021#include <sys/resource.h>
Andreas Gampe8cf9cb32017-07-19 09:28:38 -070022#include <sys/time.h>
23
24#include <pthread.h>
Andreas Gampe9e927f52016-02-29 20:49:38 -080025
Andreas Gampe57943812017-12-06 21:39:13 -080026#include <android-base/logging.h>
27#include <android-base/stringprintf.h>
Andreas Gampe46ee31b2016-12-14 10:11:49 -080028
Vladimir Marko0b6e2832015-09-24 10:41:33 +010029#include "base/bit_utils.h"
Elliott Hughes1aa246d2012-12-13 09:29:36 -080030#include "base/casts.h"
31#include "base/stl_util.h"
Vladimir Marko80afd022015-05-19 18:08:00 +010032#include "base/time_utils.h"
David Sehrc431b9d2018-03-02 12:01:51 -080033#include "base/utils.h"
Elliott Hughes1aa246d2012-12-13 09:29:36 -080034#include "runtime.h"
Andreas Gampeb486a982017-06-01 13:45:54 -070035#include "thread-current-inl.h"
Elliott Hughes1aa246d2012-12-13 09:29:36 -080036
Mathieu Chartier0e4627e2012-10-23 16:13:36 -070037namespace art {
38
Andreas Gampe46ee31b2016-12-14 10:11:49 -080039using android::base::StringPrintf;
40
Mathieu Chartier720ef762013-08-17 14:46:54 -070041static constexpr bool kMeasureWaitTime = false;
Mathieu Chartier94c32c52013-08-09 11:14:04 -070042
Daniel Colascione034ac512020-03-18 19:06:11 -070043#if defined(__BIONIC__)
44static constexpr bool kUseCustomThreadPoolStack = false;
45#else
46static constexpr bool kUseCustomThreadPoolStack = true;
47#endif
48
Mathieu Chartier0e4627e2012-10-23 16:13:36 -070049ThreadPoolWorker::ThreadPoolWorker(ThreadPool* thread_pool, const std::string& name,
50 size_t stack_size)
51 : thread_pool_(thread_pool),
Mathieu Chartierbcd5e9d2013-11-13 14:33:28 -080052 name_(name) {
53 std::string error_msg;
Daniel Colascione034ac512020-03-18 19:06:11 -070054 // On Bionic, we know pthreads will give us a big-enough stack with
55 // a guard page, so don't do anything special on Bionic libc.
56 if (kUseCustomThreadPoolStack) {
57 // Add an inaccessible page to catch stack overflow.
58 stack_size += kPageSize;
59 stack_ = MemMap::MapAnonymous(name.c_str(),
60 stack_size,
61 PROT_READ | PROT_WRITE,
62 /*low_4gb=*/ false,
63 &error_msg);
64 CHECK(stack_.IsValid()) << error_msg;
65 CHECK_ALIGNED(stack_.Begin(), kPageSize);
66 CheckedCall(mprotect,
67 "mprotect bottom page of thread pool worker stack",
68 stack_.Begin(),
69 kPageSize,
70 PROT_NONE);
71 }
Mathieu Chartier0e4627e2012-10-23 16:13:36 -070072 const char* reason = "new thread pool worker thread";
Brian Carlstrombcc29262012-11-02 11:36:03 -070073 pthread_attr_t attr;
Mathieu Chartier0e4627e2012-10-23 16:13:36 -070074 CHECK_PTHREAD_CALL(pthread_attr_init, (&attr), reason);
Daniel Colascione034ac512020-03-18 19:06:11 -070075 if (kUseCustomThreadPoolStack) {
76 CHECK_PTHREAD_CALL(pthread_attr_setstack, (&attr, stack_.Begin(), stack_.Size()), reason);
eric.yanb0298f52021-03-01 19:43:36 +080077 } else {
78 CHECK_PTHREAD_CALL(pthread_attr_setstacksize, (&attr, stack_size), reason);
Daniel Colascione034ac512020-03-18 19:06:11 -070079 }
Mathieu Chartier0e4627e2012-10-23 16:13:36 -070080 CHECK_PTHREAD_CALL(pthread_create, (&pthread_, &attr, &Callback, this), reason);
81 CHECK_PTHREAD_CALL(pthread_attr_destroy, (&attr), reason);
82}
83
84ThreadPoolWorker::~ThreadPoolWorker() {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -070085 CHECK_PTHREAD_CALL(pthread_join, (pthread_, nullptr), "thread pool worker shutdown");
Mathieu Chartier0e4627e2012-10-23 16:13:36 -070086}
87
Andreas Gampe9e927f52016-02-29 20:49:38 -080088void ThreadPoolWorker::SetPthreadPriority(int priority) {
89 CHECK_GE(priority, PRIO_MIN);
90 CHECK_LE(priority, PRIO_MAX);
Bilyan Borisovbb661c02016-04-04 16:27:32 +010091#if defined(ART_TARGET_ANDROID)
Andreas Gampe9e927f52016-02-29 20:49:38 -080092 int result = setpriority(PRIO_PROCESS, pthread_gettid_np(pthread_), priority);
93 if (result != 0) {
94 PLOG(ERROR) << "Failed to setpriority to :" << priority;
95 }
96#else
97 UNUSED(priority);
98#endif
99}
100
Nicolas Geoffrayf9dbb972020-08-27 15:21:11 +0100101int ThreadPoolWorker::GetPthreadPriority() {
102#if defined(ART_TARGET_ANDROID)
103 return getpriority(PRIO_PROCESS, pthread_gettid_np(pthread_));
104#else
105 return 0;
106#endif
107}
108
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700109void ThreadPoolWorker::Run() {
110 Thread* self = Thread::Current();
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700111 Task* task = nullptr;
Mathieu Chartier93c21ba2018-12-10 13:08:30 -0800112 thread_pool_->creation_barier_.Pass(self);
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700113 while ((task = thread_pool_->GetTask(self)) != nullptr) {
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700114 task->Run(self);
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700115 task->Finalize();
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700116 }
117}
118
119void* ThreadPoolWorker::Callback(void* arg) {
120 ThreadPoolWorker* worker = reinterpret_cast<ThreadPoolWorker*>(arg);
121 Runtime* runtime = Runtime::Current();
Alex Light80777ed2019-12-17 17:07:33 +0000122 CHECK(runtime->AttachCurrentThread(
123 worker->name_.c_str(),
124 true,
125 // Thread-groups are only tracked by the peer j.l.Thread objects. If we aren't creating peers
126 // we don't need to specify the thread group. We want to place these threads in the System
127 // thread group because that thread group is where important threads that debuggers and
128 // similar tools should not mess with are placed. As this is an internal-thread-pool we might
129 // rely on being able to (for example) wait for all threads to finish some task. If debuggers
130 // are suspending these threads that might not be possible.
131 worker->thread_pool_->create_peers_ ? runtime->GetSystemThreadGroup() : nullptr,
132 worker->thread_pool_->create_peers_));
Nicolas Geoffray340dafa2016-11-18 16:03:10 +0000133 worker->thread_ = Thread::Current();
Alex Lighte9f61032018-09-24 16:04:51 -0700134 // Mark thread pool workers as runtime-threads.
135 worker->thread_->SetIsRuntimeThread(true);
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700136 // Do work until its time to shut down.
137 worker->Run();
138 runtime->DetachCurrentThread();
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700139 return nullptr;
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700140}
141
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700142void ThreadPool::AddTask(Thread* self, Task* task) {
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700143 MutexLock mu(self, task_queue_lock_);
144 tasks_.push_back(task);
145 // If we have any waiters, signal one.
Mathieu Chartier94c32c52013-08-09 11:14:04 -0700146 if (started_ && waiting_count_ != 0) {
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700147 task_queue_condition_.Signal(self);
148 }
149}
150
Nicolas Geoffray629e9352015-11-04 17:22:16 +0000151void ThreadPool::RemoveAllTasks(Thread* self) {
Nicolas Geoffray714fad62019-06-27 15:32:00 +0100152 // The ThreadPool is responsible for calling Finalize (which usually delete
153 // the task memory) on all the tasks.
154 Task* task = nullptr;
155 while ((task = TryGetTask(self)) != nullptr) {
156 task->Finalize();
157 }
Nicolas Geoffray629e9352015-11-04 17:22:16 +0000158 MutexLock mu(self, task_queue_lock_);
159 tasks_.clear();
160}
161
Mathieu Chartiereac4d6a2018-12-05 12:33:46 -0800162ThreadPool::ThreadPool(const char* name,
163 size_t num_threads,
164 bool create_peers,
165 size_t worker_stack_size)
Mathieu Chartierbcd5e9d2013-11-13 14:33:28 -0800166 : name_(name),
Nicolas Geoffray30ba3a02021-03-31 14:11:58 +0100167 task_queue_lock_("task queue lock", kGenericBottomLock),
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700168 task_queue_condition_("task queue condition", task_queue_lock_),
169 completion_condition_("task completion condition", task_queue_lock_),
170 started_(false),
171 shutting_down_(false),
Mathieu Chartier35883cc2012-11-13 14:08:12 -0800172 waiting_count_(0),
Ian Rogersd914eb22013-04-18 16:11:15 -0700173 start_time_(0),
174 total_wait_time_(0),
Nicolas Geoffrayce9ed362018-11-29 03:19:28 +0000175 creation_barier_(0),
Andreas Gampeb15de0c2017-01-24 13:12:19 -0800176 max_active_workers_(num_threads),
Nicolas Geoffrayce9ed362018-11-29 03:19:28 +0000177 create_peers_(create_peers),
178 worker_stack_size_(worker_stack_size) {
179 CreateThreads();
180}
181
182void ThreadPool::CreateThreads() {
183 CHECK(threads_.empty());
184 Thread* self = Thread::Current();
185 {
186 MutexLock mu(self, task_queue_lock_);
187 shutting_down_ = false;
188 // Add one since the caller of constructor waits on the barrier too.
Mathieu Chartier93c21ba2018-12-10 13:08:30 -0800189 creation_barier_.Init(self, max_active_workers_);
Nicolas Geoffrayce9ed362018-11-29 03:19:28 +0000190 while (GetThreadCount() < max_active_workers_) {
191 const std::string worker_name = StringPrintf("%s worker thread %zu", name_.c_str(),
192 GetThreadCount());
193 threads_.push_back(
194 new ThreadPoolWorker(this, worker_name, worker_stack_size_));
195 }
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700196 }
Mathieu Chartier93c21ba2018-12-10 13:08:30 -0800197}
198
199void ThreadPool::WaitForWorkersToBeCreated() {
200 creation_barier_.Increment(Thread::Current(), 0);
201}
202
203const std::vector<ThreadPoolWorker*>& ThreadPool::GetWorkers() {
204 // Wait for all the workers to be created before returning them.
205 WaitForWorkersToBeCreated();
206 return threads_;
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700207}
208
Nicolas Geoffrayce9ed362018-11-29 03:19:28 +0000209void ThreadPool::DeleteThreads() {
Mathieu Chartiere46cd752012-10-31 16:56:18 -0700210 {
211 Thread* self = Thread::Current();
212 MutexLock mu(self, task_queue_lock_);
213 // Tell any remaining workers to shut down.
214 shutting_down_ = true;
Mathieu Chartiere46cd752012-10-31 16:56:18 -0700215 // Broadcast to everyone waiting.
216 task_queue_condition_.Broadcast(self);
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700217 completion_condition_.Broadcast(self);
Mathieu Chartiere46cd752012-10-31 16:56:18 -0700218 }
Nicolas Geoffrayce9ed362018-11-29 03:19:28 +0000219 // Wait for the threads to finish. We expect the user of the pool
220 // not to run multi-threaded calls to `CreateThreads` and `DeleteThreads`,
221 // so we don't guard the field here.
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700222 STLDeleteElements(&threads_);
223}
224
Nicolas Geoffrayce9ed362018-11-29 03:19:28 +0000225void ThreadPool::SetMaxActiveWorkers(size_t max_workers) {
226 MutexLock mu(Thread::Current(), task_queue_lock_);
227 CHECK_LE(max_workers, GetThreadCount());
228 max_active_workers_ = max_workers;
229}
230
231ThreadPool::~ThreadPool() {
232 DeleteThreads();
Nicolas Geoffray714fad62019-06-27 15:32:00 +0100233 RemoveAllTasks(Thread::Current());
Nicolas Geoffrayce9ed362018-11-29 03:19:28 +0000234}
235
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700236void ThreadPool::StartWorkers(Thread* self) {
237 MutexLock mu(self, task_queue_lock_);
238 started_ = true;
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700239 task_queue_condition_.Broadcast(self);
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700240 start_time_ = NanoTime();
241 total_wait_time_ = 0;
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700242}
243
244void ThreadPool::StopWorkers(Thread* self) {
245 MutexLock mu(self, task_queue_lock_);
246 started_ = false;
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700247}
248
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700249Task* ThreadPool::GetTask(Thread* self) {
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700250 MutexLock mu(self, task_queue_lock_);
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700251 while (!IsShuttingDown()) {
Mathieu Chartier2775ee42013-08-20 17:43:47 -0700252 const size_t thread_count = GetThreadCount();
253 // Ensure that we don't use more threads than the maximum active workers.
254 const size_t active_threads = thread_count - waiting_count_;
255 // <= since self is considered an active worker.
256 if (active_threads <= max_active_workers_) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700257 Task* task = TryGetTaskLocked();
258 if (task != nullptr) {
Mathieu Chartier2775ee42013-08-20 17:43:47 -0700259 return task;
260 }
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700261 }
262
Mathieu Chartier2775ee42013-08-20 17:43:47 -0700263 ++waiting_count_;
Andreas Gampe6f3a70f2016-11-16 13:58:05 -0800264 if (waiting_count_ == GetThreadCount() && !HasOutstandingTasks()) {
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700265 // We may be done, lets broadcast to the completion condition.
266 completion_condition_.Broadcast(self);
267 }
Mathieu Chartier94c32c52013-08-09 11:14:04 -0700268 const uint64_t wait_start = kMeasureWaitTime ? NanoTime() : 0;
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700269 task_queue_condition_.Wait(self);
Mathieu Chartier94c32c52013-08-09 11:14:04 -0700270 if (kMeasureWaitTime) {
271 const uint64_t wait_end = NanoTime();
272 total_wait_time_ += wait_end - std::max(wait_start, start_time_);
273 }
274 --waiting_count_;
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700275 }
276
Mathieu Chartier2cebb242015-04-21 16:50:40 -0700277 // We are shutting down, return null to tell the worker thread to stop looping.
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700278 return nullptr;
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700279}
280
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700281Task* ThreadPool::TryGetTask(Thread* self) {
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700282 MutexLock mu(self, task_queue_lock_);
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700283 return TryGetTaskLocked();
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700284}
285
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700286Task* ThreadPool::TryGetTaskLocked() {
Andreas Gampe6f3a70f2016-11-16 13:58:05 -0800287 if (HasOutstandingTasks()) {
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700288 Task* task = tasks_.front();
289 tasks_.pop_front();
290 return task;
291 }
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700292 return nullptr;
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700293}
294
Ian Rogers1d54e732013-05-02 21:10:01 -0700295void ThreadPool::Wait(Thread* self, bool do_work, bool may_hold_locks) {
296 if (do_work) {
Andreas Gampeb15de0c2017-01-24 13:12:19 -0800297 CHECK(!create_peers_);
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700298 Task* task = nullptr;
299 while ((task = TryGetTask(self)) != nullptr) {
Ian Rogers1d54e732013-05-02 21:10:01 -0700300 task->Run(self);
301 task->Finalize();
302 }
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700303 }
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700304 // Wait until each thread is waiting and the task list is empty.
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700305 MutexLock mu(self, task_queue_lock_);
Andreas Gampe6f3a70f2016-11-16 13:58:05 -0800306 while (!shutting_down_ && (waiting_count_ != GetThreadCount() || HasOutstandingTasks())) {
Ian Rogers1d54e732013-05-02 21:10:01 -0700307 if (!may_hold_locks) {
308 completion_condition_.Wait(self);
309 } else {
310 completion_condition_.WaitHoldingLocks(self);
311 }
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700312 }
313}
314
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700315size_t ThreadPool::GetTaskCount(Thread* self) {
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700316 MutexLock mu(self, task_queue_lock_);
317 return tasks_.size();
318}
319
Andreas Gampe9e927f52016-02-29 20:49:38 -0800320void ThreadPool::SetPthreadPriority(int priority) {
321 for (ThreadPoolWorker* worker : threads_) {
322 worker->SetPthreadPriority(priority);
323 }
324}
325
Nicolas Geoffrayf9dbb972020-08-27 15:21:11 +0100326void ThreadPool::CheckPthreadPriority(int priority) {
327#if defined(ART_TARGET_ANDROID)
328 for (ThreadPoolWorker* worker : threads_) {
329 CHECK_EQ(worker->GetPthreadPriority(), priority);
330 }
331#else
332 UNUSED(priority);
333#endif
334}
335
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700336} // namespace art