blob: c03fb2eea54f5958ca2625563d6f51265a511774 [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 Gampee701f082016-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 Gampee701f082016-02-29 20:49:38 -080061void ThreadPoolWorker::SetPthreadPriority(int priority) {
62 CHECK_GE(priority, PRIO_MIN);
63 CHECK_LE(priority, PRIO_MAX);
64#if defined(__ANDROID__)
65 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();
Andreas Gampe2db6c402017-01-24 13:12:19 -080087 CHECK(runtime->AttachCurrentThread(worker->name_.c_str(),
88 true,
89 nullptr,
90 worker->thread_pool_->create_peers_));
Calin Juravlef5f462b2016-12-15 17:57:38 +000091 // Thread pool workers cannot call into java.
92 Thread::Current()->SetCanCallIntoJava(false);
Mathieu Chartier0e4627e2012-10-23 16:13:36 -070093 // Do work until its time to shut down.
94 worker->Run();
95 runtime->DetachCurrentThread();
Ian Rogers6a3c1fc2014-10-31 00:33:20 -070096 return nullptr;
Mathieu Chartier0e4627e2012-10-23 16:13:36 -070097}
98
Brian Carlstrom2ce745c2013-07-17 17:44:30 -070099void ThreadPool::AddTask(Thread* self, Task* task) {
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700100 MutexLock mu(self, task_queue_lock_);
101 tasks_.push_back(task);
102 // If we have any waiters, signal one.
Mathieu Chartier94c32c52013-08-09 11:14:04 -0700103 if (started_ && waiting_count_ != 0) {
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700104 task_queue_condition_.Signal(self);
105 }
106}
107
Nicolas Geoffray629e9352015-11-04 17:22:16 +0000108void ThreadPool::RemoveAllTasks(Thread* self) {
109 MutexLock mu(self, task_queue_lock_);
110 tasks_.clear();
111}
112
Andreas Gampe2db6c402017-01-24 13:12:19 -0800113ThreadPool::ThreadPool(const char* name, size_t num_threads, bool create_peers)
Mathieu Chartierbcd5e9d2013-11-13 14:33:28 -0800114 : name_(name),
115 task_queue_lock_("task queue lock"),
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700116 task_queue_condition_("task queue condition", task_queue_lock_),
117 completion_condition_("task completion condition", task_queue_lock_),
118 started_(false),
119 shutting_down_(false),
Mathieu Chartier35883cc2012-11-13 14:08:12 -0800120 waiting_count_(0),
Ian Rogersd914eb22013-04-18 16:11:15 -0700121 start_time_(0),
122 total_wait_time_(0),
Mathieu Chartier35883cc2012-11-13 14:08:12 -0800123 // Add one since the caller of constructor waits on the barrier too.
Mathieu Chartier2775ee42013-08-20 17:43:47 -0700124 creation_barier_(num_threads + 1),
Andreas Gampe2db6c402017-01-24 13:12:19 -0800125 max_active_workers_(num_threads),
126 create_peers_(create_peers) {
Mathieu Chartier35883cc2012-11-13 14:08:12 -0800127 Thread* self = Thread::Current();
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700128 while (GetThreadCount() < num_threads) {
Andreas Gampe277ccbd2014-11-03 21:36:10 -0800129 const std::string worker_name = StringPrintf("%s worker thread %zu", name_.c_str(),
130 GetThreadCount());
Vladimir Marko0b6e2832015-09-24 10:41:33 +0100131 threads_.push_back(
132 new ThreadPoolWorker(this, worker_name, ThreadPoolWorker::kDefaultStackSize));
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700133 }
Mathieu Chartier35883cc2012-11-13 14:08:12 -0800134 // Wait for all of the threads to attach.
135 creation_barier_.Wait(self);
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700136}
137
Mathieu Chartier2775ee42013-08-20 17:43:47 -0700138void ThreadPool::SetMaxActiveWorkers(size_t threads) {
139 MutexLock mu(Thread::Current(), task_queue_lock_);
140 CHECK_LE(threads, GetThreadCount());
141 max_active_workers_ = threads;
142}
143
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700144ThreadPool::~ThreadPool() {
Mathieu Chartiere46cd752012-10-31 16:56:18 -0700145 {
146 Thread* self = Thread::Current();
147 MutexLock mu(self, task_queue_lock_);
148 // Tell any remaining workers to shut down.
149 shutting_down_ = true;
Mathieu Chartiere46cd752012-10-31 16:56:18 -0700150 // Broadcast to everyone waiting.
151 task_queue_condition_.Broadcast(self);
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700152 completion_condition_.Broadcast(self);
Mathieu Chartiere46cd752012-10-31 16:56:18 -0700153 }
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700154 // Wait for the threads to finish.
155 STLDeleteElements(&threads_);
156}
157
158void ThreadPool::StartWorkers(Thread* self) {
159 MutexLock mu(self, task_queue_lock_);
160 started_ = true;
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700161 task_queue_condition_.Broadcast(self);
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700162 start_time_ = NanoTime();
163 total_wait_time_ = 0;
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700164}
165
166void ThreadPool::StopWorkers(Thread* self) {
167 MutexLock mu(self, task_queue_lock_);
168 started_ = false;
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700169}
170
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700171Task* ThreadPool::GetTask(Thread* self) {
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700172 MutexLock mu(self, task_queue_lock_);
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700173 while (!IsShuttingDown()) {
Mathieu Chartier2775ee42013-08-20 17:43:47 -0700174 const size_t thread_count = GetThreadCount();
175 // Ensure that we don't use more threads than the maximum active workers.
176 const size_t active_threads = thread_count - waiting_count_;
177 // <= since self is considered an active worker.
178 if (active_threads <= max_active_workers_) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700179 Task* task = TryGetTaskLocked();
180 if (task != nullptr) {
Mathieu Chartier2775ee42013-08-20 17:43:47 -0700181 return task;
182 }
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700183 }
184
Mathieu Chartier2775ee42013-08-20 17:43:47 -0700185 ++waiting_count_;
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700186 if (waiting_count_ == GetThreadCount() && tasks_.empty()) {
187 // We may be done, lets broadcast to the completion condition.
188 completion_condition_.Broadcast(self);
189 }
Mathieu Chartier94c32c52013-08-09 11:14:04 -0700190 const uint64_t wait_start = kMeasureWaitTime ? NanoTime() : 0;
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700191 task_queue_condition_.Wait(self);
Mathieu Chartier94c32c52013-08-09 11:14:04 -0700192 if (kMeasureWaitTime) {
193 const uint64_t wait_end = NanoTime();
194 total_wait_time_ += wait_end - std::max(wait_start, start_time_);
195 }
196 --waiting_count_;
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700197 }
198
Mathieu Chartier2cebb242015-04-21 16:50:40 -0700199 // We are shutting down, return null to tell the worker thread to stop looping.
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700200 return nullptr;
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700201}
202
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700203Task* ThreadPool::TryGetTask(Thread* self) {
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700204 MutexLock mu(self, task_queue_lock_);
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700205 return TryGetTaskLocked();
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700206}
207
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700208Task* ThreadPool::TryGetTaskLocked() {
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700209 if (started_ && !tasks_.empty()) {
210 Task* task = tasks_.front();
211 tasks_.pop_front();
212 return task;
213 }
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700214 return nullptr;
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700215}
216
Ian Rogers1d54e732013-05-02 21:10:01 -0700217void ThreadPool::Wait(Thread* self, bool do_work, bool may_hold_locks) {
218 if (do_work) {
Andreas Gampe2db6c402017-01-24 13:12:19 -0800219 CHECK(!create_peers_);
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700220 Task* task = nullptr;
221 while ((task = TryGetTask(self)) != nullptr) {
Ian Rogers1d54e732013-05-02 21:10:01 -0700222 task->Run(self);
223 task->Finalize();
224 }
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700225 }
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700226 // Wait until each thread is waiting and the task list is empty.
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700227 MutexLock mu(self, task_queue_lock_);
228 while (!shutting_down_ && (waiting_count_ != GetThreadCount() || !tasks_.empty())) {
Ian Rogers1d54e732013-05-02 21:10:01 -0700229 if (!may_hold_locks) {
230 completion_condition_.Wait(self);
231 } else {
232 completion_condition_.WaitHoldingLocks(self);
233 }
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700234 }
235}
236
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700237size_t ThreadPool::GetTaskCount(Thread* self) {
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700238 MutexLock mu(self, task_queue_lock_);
239 return tasks_.size();
240}
241
Andreas Gampee701f082016-02-29 20:49:38 -0800242void ThreadPool::SetPthreadPriority(int priority) {
243 for (ThreadPoolWorker* worker : threads_) {
244 worker->SetPthreadPriority(priority);
245 }
246}
247
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700248} // namespace art