blob: b14f340c4c7ee1bec24748a972666b5f33f5f191 [file] [log] [blame]
Elliott Hughes1aa246d2012-12-13 09:29:36 -08001/*
2 * Copyright (C) 2012 The Android Open Source Project
3 *
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
7 *
8 * http://www.apache.org/licenses/LICENSE-2.0
9 *
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
15 */
16
Mathieu Chartier0e4627e2012-10-23 16:13:36 -070017#include "thread_pool.h"
18
Andreas Gampe9e927f52016-02-29 20:49:38 -080019#include <pthread.h>
20
21#include <sys/time.h>
22#include <sys/resource.h>
23
Vladimir Marko0b6e2832015-09-24 10:41:33 +010024#include "base/bit_utils.h"
Elliott Hughes1aa246d2012-12-13 09:29:36 -080025#include "base/casts.h"
Vladimir Marko0b6e2832015-09-24 10:41:33 +010026#include "base/logging.h"
Elliott Hughes1aa246d2012-12-13 09:29:36 -080027#include "base/stl_util.h"
Vladimir Marko80afd022015-05-19 18:08:00 +010028#include "base/time_utils.h"
Elliott Hughes1aa246d2012-12-13 09:29:36 -080029#include "runtime.h"
Brian Carlstroma3d27182013-11-05 23:22:27 -080030#include "thread-inl.h"
Elliott Hughes1aa246d2012-12-13 09:29:36 -080031
Mathieu Chartier0e4627e2012-10-23 16:13:36 -070032namespace art {
33
Mathieu Chartier720ef762013-08-17 14:46:54 -070034static constexpr bool kMeasureWaitTime = false;
Mathieu Chartier94c32c52013-08-09 11:14:04 -070035
Mathieu Chartier0e4627e2012-10-23 16:13:36 -070036ThreadPoolWorker::ThreadPoolWorker(ThreadPool* thread_pool, const std::string& name,
37 size_t stack_size)
38 : thread_pool_(thread_pool),
Mathieu Chartierbcd5e9d2013-11-13 14:33:28 -080039 name_(name) {
Vladimir Marko0b6e2832015-09-24 10:41:33 +010040 // Add an inaccessible page to catch stack overflow.
41 stack_size += kPageSize;
Mathieu Chartierbcd5e9d2013-11-13 14:33:28 -080042 std::string error_msg;
43 stack_.reset(MemMap::MapAnonymous(name.c_str(), nullptr, stack_size, PROT_READ | PROT_WRITE,
Vladimir Marko5c42c292015-02-25 12:02:49 +000044 false, false, &error_msg));
Mathieu Chartierbcd5e9d2013-11-13 14:33:28 -080045 CHECK(stack_.get() != nullptr) << error_msg;
Vladimir Marko0b6e2832015-09-24 10:41:33 +010046 CHECK_ALIGNED(stack_->Begin(), kPageSize);
47 int mprotect_result = mprotect(stack_->Begin(), kPageSize, PROT_NONE);
48 CHECK_EQ(mprotect_result, 0) << "Failed to mprotect() bottom page of thread pool worker stack.";
Mathieu Chartier0e4627e2012-10-23 16:13:36 -070049 const char* reason = "new thread pool worker thread";
Brian Carlstrombcc29262012-11-02 11:36:03 -070050 pthread_attr_t attr;
Mathieu Chartier0e4627e2012-10-23 16:13:36 -070051 CHECK_PTHREAD_CALL(pthread_attr_init, (&attr), reason);
Mathieu Chartierbcd5e9d2013-11-13 14:33:28 -080052 CHECK_PTHREAD_CALL(pthread_attr_setstack, (&attr, stack_->Begin(), stack_->Size()), reason);
Mathieu Chartier0e4627e2012-10-23 16:13:36 -070053 CHECK_PTHREAD_CALL(pthread_create, (&pthread_, &attr, &Callback, this), reason);
54 CHECK_PTHREAD_CALL(pthread_attr_destroy, (&attr), reason);
55}
56
57ThreadPoolWorker::~ThreadPoolWorker() {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -070058 CHECK_PTHREAD_CALL(pthread_join, (pthread_, nullptr), "thread pool worker shutdown");
Mathieu Chartier0e4627e2012-10-23 16:13:36 -070059}
60
Andreas Gampe9e927f52016-02-29 20:49:38 -080061void ThreadPoolWorker::SetPthreadPriority(int priority) {
62 CHECK_GE(priority, PRIO_MIN);
63 CHECK_LE(priority, PRIO_MAX);
Bilyan Borisovbb661c02016-04-04 16:27:32 +010064#if defined(ART_TARGET_ANDROID)
Andreas Gampe9e927f52016-02-29 20:49:38 -080065 int result = setpriority(PRIO_PROCESS, pthread_gettid_np(pthread_), priority);
66 if (result != 0) {
67 PLOG(ERROR) << "Failed to setpriority to :" << priority;
68 }
69#else
70 UNUSED(priority);
71#endif
72}
73
Mathieu Chartier0e4627e2012-10-23 16:13:36 -070074void ThreadPoolWorker::Run() {
75 Thread* self = Thread::Current();
Ian Rogers6a3c1fc2014-10-31 00:33:20 -070076 Task* task = nullptr;
Mathieu Chartier35883cc2012-11-13 14:08:12 -080077 thread_pool_->creation_barier_.Wait(self);
Ian Rogers6a3c1fc2014-10-31 00:33:20 -070078 while ((task = thread_pool_->GetTask(self)) != nullptr) {
Mathieu Chartier0e4627e2012-10-23 16:13:36 -070079 task->Run(self);
Mathieu Chartier02b6a782012-10-26 13:51:26 -070080 task->Finalize();
Mathieu Chartier0e4627e2012-10-23 16:13:36 -070081 }
82}
83
84void* ThreadPoolWorker::Callback(void* arg) {
85 ThreadPoolWorker* worker = reinterpret_cast<ThreadPoolWorker*>(arg);
86 Runtime* runtime = Runtime::Current();
Ian Rogers6a3c1fc2014-10-31 00:33:20 -070087 CHECK(runtime->AttachCurrentThread(worker->name_.c_str(), true, nullptr, false));
Mathieu Chartier0e4627e2012-10-23 16:13:36 -070088 // Do work until its time to shut down.
89 worker->Run();
90 runtime->DetachCurrentThread();
Ian Rogers6a3c1fc2014-10-31 00:33:20 -070091 return nullptr;
Mathieu Chartier0e4627e2012-10-23 16:13:36 -070092}
93
Brian Carlstrom2ce745c2013-07-17 17:44:30 -070094void ThreadPool::AddTask(Thread* self, Task* task) {
Mathieu Chartier0e4627e2012-10-23 16:13:36 -070095 MutexLock mu(self, task_queue_lock_);
96 tasks_.push_back(task);
97 // If we have any waiters, signal one.
Mathieu Chartier94c32c52013-08-09 11:14:04 -070098 if (started_ && waiting_count_ != 0) {
Mathieu Chartier0e4627e2012-10-23 16:13:36 -070099 task_queue_condition_.Signal(self);
100 }
101}
102
Nicolas Geoffray629e9352015-11-04 17:22:16 +0000103void ThreadPool::RemoveAllTasks(Thread* self) {
104 MutexLock mu(self, task_queue_lock_);
105 tasks_.clear();
106}
107
Mathieu Chartierbcd5e9d2013-11-13 14:33:28 -0800108ThreadPool::ThreadPool(const char* name, size_t num_threads)
109 : name_(name),
110 task_queue_lock_("task queue lock"),
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700111 task_queue_condition_("task queue condition", task_queue_lock_),
112 completion_condition_("task completion condition", task_queue_lock_),
113 started_(false),
114 shutting_down_(false),
Mathieu Chartier35883cc2012-11-13 14:08:12 -0800115 waiting_count_(0),
Ian Rogersd914eb22013-04-18 16:11:15 -0700116 start_time_(0),
117 total_wait_time_(0),
Mathieu Chartier35883cc2012-11-13 14:08:12 -0800118 // Add one since the caller of constructor waits on the barrier too.
Mathieu Chartier2775ee42013-08-20 17:43:47 -0700119 creation_barier_(num_threads + 1),
120 max_active_workers_(num_threads) {
Mathieu Chartier35883cc2012-11-13 14:08:12 -0800121 Thread* self = Thread::Current();
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700122 while (GetThreadCount() < num_threads) {
Andreas Gampe277ccbd2014-11-03 21:36:10 -0800123 const std::string worker_name = StringPrintf("%s worker thread %zu", name_.c_str(),
124 GetThreadCount());
Vladimir Marko0b6e2832015-09-24 10:41:33 +0100125 threads_.push_back(
126 new ThreadPoolWorker(this, worker_name, ThreadPoolWorker::kDefaultStackSize));
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700127 }
Mathieu Chartier35883cc2012-11-13 14:08:12 -0800128 // Wait for all of the threads to attach.
129 creation_barier_.Wait(self);
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700130}
131
Mathieu Chartier2775ee42013-08-20 17:43:47 -0700132void ThreadPool::SetMaxActiveWorkers(size_t threads) {
133 MutexLock mu(Thread::Current(), task_queue_lock_);
134 CHECK_LE(threads, GetThreadCount());
135 max_active_workers_ = threads;
136}
137
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700138ThreadPool::~ThreadPool() {
Mathieu Chartiere46cd752012-10-31 16:56:18 -0700139 {
140 Thread* self = Thread::Current();
141 MutexLock mu(self, task_queue_lock_);
142 // Tell any remaining workers to shut down.
143 shutting_down_ = true;
Mathieu Chartiere46cd752012-10-31 16:56:18 -0700144 // Broadcast to everyone waiting.
145 task_queue_condition_.Broadcast(self);
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700146 completion_condition_.Broadcast(self);
Mathieu Chartiere46cd752012-10-31 16:56:18 -0700147 }
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700148 // Wait for the threads to finish.
149 STLDeleteElements(&threads_);
150}
151
152void ThreadPool::StartWorkers(Thread* self) {
153 MutexLock mu(self, task_queue_lock_);
154 started_ = true;
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700155 task_queue_condition_.Broadcast(self);
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700156 start_time_ = NanoTime();
157 total_wait_time_ = 0;
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700158}
159
160void ThreadPool::StopWorkers(Thread* self) {
161 MutexLock mu(self, task_queue_lock_);
162 started_ = false;
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700163}
164
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700165Task* ThreadPool::GetTask(Thread* self) {
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700166 MutexLock mu(self, task_queue_lock_);
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700167 while (!IsShuttingDown()) {
Mathieu Chartier2775ee42013-08-20 17:43:47 -0700168 const size_t thread_count = GetThreadCount();
169 // Ensure that we don't use more threads than the maximum active workers.
170 const size_t active_threads = thread_count - waiting_count_;
171 // <= since self is considered an active worker.
172 if (active_threads <= max_active_workers_) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700173 Task* task = TryGetTaskLocked();
174 if (task != nullptr) {
Mathieu Chartier2775ee42013-08-20 17:43:47 -0700175 return task;
176 }
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700177 }
178
Mathieu Chartier2775ee42013-08-20 17:43:47 -0700179 ++waiting_count_;
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700180 if (waiting_count_ == GetThreadCount() && tasks_.empty()) {
181 // We may be done, lets broadcast to the completion condition.
182 completion_condition_.Broadcast(self);
183 }
Mathieu Chartier94c32c52013-08-09 11:14:04 -0700184 const uint64_t wait_start = kMeasureWaitTime ? NanoTime() : 0;
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700185 task_queue_condition_.Wait(self);
Mathieu Chartier94c32c52013-08-09 11:14:04 -0700186 if (kMeasureWaitTime) {
187 const uint64_t wait_end = NanoTime();
188 total_wait_time_ += wait_end - std::max(wait_start, start_time_);
189 }
190 --waiting_count_;
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700191 }
192
Mathieu Chartier2cebb242015-04-21 16:50:40 -0700193 // We are shutting down, return null to tell the worker thread to stop looping.
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700194 return nullptr;
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700195}
196
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700197Task* ThreadPool::TryGetTask(Thread* self) {
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700198 MutexLock mu(self, task_queue_lock_);
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700199 return TryGetTaskLocked();
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700200}
201
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700202Task* ThreadPool::TryGetTaskLocked() {
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700203 if (started_ && !tasks_.empty()) {
204 Task* task = tasks_.front();
205 tasks_.pop_front();
206 return task;
207 }
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700208 return nullptr;
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700209}
210
Ian Rogers1d54e732013-05-02 21:10:01 -0700211void ThreadPool::Wait(Thread* self, bool do_work, bool may_hold_locks) {
212 if (do_work) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700213 Task* task = nullptr;
214 while ((task = TryGetTask(self)) != nullptr) {
Ian Rogers1d54e732013-05-02 21:10:01 -0700215 task->Run(self);
216 task->Finalize();
217 }
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700218 }
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700219 // Wait until each thread is waiting and the task list is empty.
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700220 MutexLock mu(self, task_queue_lock_);
221 while (!shutting_down_ && (waiting_count_ != GetThreadCount() || !tasks_.empty())) {
Ian Rogers1d54e732013-05-02 21:10:01 -0700222 if (!may_hold_locks) {
223 completion_condition_.Wait(self);
224 } else {
225 completion_condition_.WaitHoldingLocks(self);
226 }
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700227 }
228}
229
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700230size_t ThreadPool::GetTaskCount(Thread* self) {
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700231 MutexLock mu(self, task_queue_lock_);
232 return tasks_.size();
233}
234
Andreas Gampe9e927f52016-02-29 20:49:38 -0800235void ThreadPool::SetPthreadPriority(int priority) {
236 for (ThreadPoolWorker* worker : threads_) {
237 worker->SetPthreadPriority(priority);
238 }
239}
240
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700241} // namespace art