blob: 587eb320cd601f3bc8b51d500d3f0037bd17ee3b [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
Elliott Hughes1aa246d2012-12-13 09:29:36 -080019#include "base/casts.h"
20#include "base/stl_util.h"
21#include "runtime.h"
Brian Carlstroma3d27182013-11-05 23:22:27 -080022#include "thread-inl.h"
Elliott Hughes1aa246d2012-12-13 09:29:36 -080023
Mathieu Chartier0e4627e2012-10-23 16:13:36 -070024namespace art {
25
Mathieu Chartier720ef762013-08-17 14:46:54 -070026static constexpr bool kMeasureWaitTime = false;
Mathieu Chartier94c32c52013-08-09 11:14:04 -070027
Mathieu Chartier0e4627e2012-10-23 16:13:36 -070028ThreadPoolWorker::ThreadPoolWorker(ThreadPool* thread_pool, const std::string& name,
29 size_t stack_size)
30 : thread_pool_(thread_pool),
Mathieu Chartierbcd5e9d2013-11-13 14:33:28 -080031 name_(name) {
32 std::string error_msg;
33 stack_.reset(MemMap::MapAnonymous(name.c_str(), nullptr, stack_size, PROT_READ | PROT_WRITE,
Ian Rogersef7d42f2014-01-06 12:55:46 -080034 false, &error_msg));
Mathieu Chartierbcd5e9d2013-11-13 14:33:28 -080035 CHECK(stack_.get() != nullptr) << error_msg;
Mathieu Chartier0e4627e2012-10-23 16:13:36 -070036 const char* reason = "new thread pool worker thread";
Brian Carlstrombcc29262012-11-02 11:36:03 -070037 pthread_attr_t attr;
Mathieu Chartier0e4627e2012-10-23 16:13:36 -070038 CHECK_PTHREAD_CALL(pthread_attr_init, (&attr), reason);
Mathieu Chartierbcd5e9d2013-11-13 14:33:28 -080039 CHECK_PTHREAD_CALL(pthread_attr_setstack, (&attr, stack_->Begin(), stack_->Size()), reason);
Mathieu Chartier0e4627e2012-10-23 16:13:36 -070040 CHECK_PTHREAD_CALL(pthread_create, (&pthread_, &attr, &Callback, this), reason);
41 CHECK_PTHREAD_CALL(pthread_attr_destroy, (&attr), reason);
42}
43
44ThreadPoolWorker::~ThreadPoolWorker() {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -070045 CHECK_PTHREAD_CALL(pthread_join, (pthread_, nullptr), "thread pool worker shutdown");
Mathieu Chartier0e4627e2012-10-23 16:13:36 -070046}
47
48void ThreadPoolWorker::Run() {
49 Thread* self = Thread::Current();
Ian Rogers6a3c1fc2014-10-31 00:33:20 -070050 Task* task = nullptr;
Mathieu Chartier35883cc2012-11-13 14:08:12 -080051 thread_pool_->creation_barier_.Wait(self);
Ian Rogers6a3c1fc2014-10-31 00:33:20 -070052 while ((task = thread_pool_->GetTask(self)) != nullptr) {
Mathieu Chartier0e4627e2012-10-23 16:13:36 -070053 task->Run(self);
Mathieu Chartier02b6a782012-10-26 13:51:26 -070054 task->Finalize();
Mathieu Chartier0e4627e2012-10-23 16:13:36 -070055 }
56}
57
58void* ThreadPoolWorker::Callback(void* arg) {
59 ThreadPoolWorker* worker = reinterpret_cast<ThreadPoolWorker*>(arg);
60 Runtime* runtime = Runtime::Current();
Ian Rogers6a3c1fc2014-10-31 00:33:20 -070061 CHECK(runtime->AttachCurrentThread(worker->name_.c_str(), true, nullptr, false));
Mathieu Chartier0e4627e2012-10-23 16:13:36 -070062 // Do work until its time to shut down.
63 worker->Run();
64 runtime->DetachCurrentThread();
Ian Rogers6a3c1fc2014-10-31 00:33:20 -070065 return nullptr;
Mathieu Chartier0e4627e2012-10-23 16:13:36 -070066}
67
Brian Carlstrom2ce745c2013-07-17 17:44:30 -070068void ThreadPool::AddTask(Thread* self, Task* task) {
Mathieu Chartier0e4627e2012-10-23 16:13:36 -070069 MutexLock mu(self, task_queue_lock_);
70 tasks_.push_back(task);
71 // If we have any waiters, signal one.
Mathieu Chartier94c32c52013-08-09 11:14:04 -070072 if (started_ && waiting_count_ != 0) {
Mathieu Chartier0e4627e2012-10-23 16:13:36 -070073 task_queue_condition_.Signal(self);
74 }
75}
76
Mathieu Chartierbcd5e9d2013-11-13 14:33:28 -080077ThreadPool::ThreadPool(const char* name, size_t num_threads)
78 : name_(name),
79 task_queue_lock_("task queue lock"),
Mathieu Chartier0e4627e2012-10-23 16:13:36 -070080 task_queue_condition_("task queue condition", task_queue_lock_),
81 completion_condition_("task completion condition", task_queue_lock_),
82 started_(false),
83 shutting_down_(false),
Mathieu Chartier35883cc2012-11-13 14:08:12 -080084 waiting_count_(0),
Ian Rogersd914eb22013-04-18 16:11:15 -070085 start_time_(0),
86 total_wait_time_(0),
Mathieu Chartier35883cc2012-11-13 14:08:12 -080087 // Add one since the caller of constructor waits on the barrier too.
Mathieu Chartier2775ee42013-08-20 17:43:47 -070088 creation_barier_(num_threads + 1),
89 max_active_workers_(num_threads) {
Mathieu Chartier35883cc2012-11-13 14:08:12 -080090 Thread* self = Thread::Current();
Mathieu Chartier0e4627e2012-10-23 16:13:36 -070091 while (GetThreadCount() < num_threads) {
Andreas Gampe277ccbd2014-11-03 21:36:10 -080092 const std::string worker_name = StringPrintf("%s worker thread %zu", name_.c_str(),
93 GetThreadCount());
94 threads_.push_back(new ThreadPoolWorker(this, worker_name, ThreadPoolWorker::kDefaultStackSize));
Mathieu Chartier0e4627e2012-10-23 16:13:36 -070095 }
Mathieu Chartier35883cc2012-11-13 14:08:12 -080096 // Wait for all of the threads to attach.
97 creation_barier_.Wait(self);
Mathieu Chartier0e4627e2012-10-23 16:13:36 -070098}
99
Mathieu Chartier2775ee42013-08-20 17:43:47 -0700100void ThreadPool::SetMaxActiveWorkers(size_t threads) {
101 MutexLock mu(Thread::Current(), task_queue_lock_);
102 CHECK_LE(threads, GetThreadCount());
103 max_active_workers_ = threads;
104}
105
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700106ThreadPool::~ThreadPool() {
Mathieu Chartiere46cd752012-10-31 16:56:18 -0700107 {
108 Thread* self = Thread::Current();
109 MutexLock mu(self, task_queue_lock_);
110 // Tell any remaining workers to shut down.
111 shutting_down_ = true;
Mathieu Chartiere46cd752012-10-31 16:56:18 -0700112 // Broadcast to everyone waiting.
113 task_queue_condition_.Broadcast(self);
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700114 completion_condition_.Broadcast(self);
Mathieu Chartiere46cd752012-10-31 16:56:18 -0700115 }
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700116 // Wait for the threads to finish.
117 STLDeleteElements(&threads_);
118}
119
120void ThreadPool::StartWorkers(Thread* self) {
121 MutexLock mu(self, task_queue_lock_);
122 started_ = true;
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700123 task_queue_condition_.Broadcast(self);
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700124 start_time_ = NanoTime();
125 total_wait_time_ = 0;
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700126}
127
128void ThreadPool::StopWorkers(Thread* self) {
129 MutexLock mu(self, task_queue_lock_);
130 started_ = false;
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700131}
132
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700133Task* ThreadPool::GetTask(Thread* self) {
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700134 MutexLock mu(self, task_queue_lock_);
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700135 while (!IsShuttingDown()) {
Mathieu Chartier2775ee42013-08-20 17:43:47 -0700136 const size_t thread_count = GetThreadCount();
137 // Ensure that we don't use more threads than the maximum active workers.
138 const size_t active_threads = thread_count - waiting_count_;
139 // <= since self is considered an active worker.
140 if (active_threads <= max_active_workers_) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700141 Task* task = TryGetTaskLocked();
142 if (task != nullptr) {
Mathieu Chartier2775ee42013-08-20 17:43:47 -0700143 return task;
144 }
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700145 }
146
Mathieu Chartier2775ee42013-08-20 17:43:47 -0700147 ++waiting_count_;
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700148 if (waiting_count_ == GetThreadCount() && tasks_.empty()) {
149 // We may be done, lets broadcast to the completion condition.
150 completion_condition_.Broadcast(self);
151 }
Mathieu Chartier94c32c52013-08-09 11:14:04 -0700152 const uint64_t wait_start = kMeasureWaitTime ? NanoTime() : 0;
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700153 task_queue_condition_.Wait(self);
Mathieu Chartier94c32c52013-08-09 11:14:04 -0700154 if (kMeasureWaitTime) {
155 const uint64_t wait_end = NanoTime();
156 total_wait_time_ += wait_end - std::max(wait_start, start_time_);
157 }
158 --waiting_count_;
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700159 }
160
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700161 // We are shutting down, return nullptr to tell the worker thread to stop looping.
162 return nullptr;
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700163}
164
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700165Task* ThreadPool::TryGetTask(Thread* self) {
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700166 MutexLock mu(self, task_queue_lock_);
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700167 return TryGetTaskLocked();
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700168}
169
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700170Task* ThreadPool::TryGetTaskLocked() {
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700171 if (started_ && !tasks_.empty()) {
172 Task* task = tasks_.front();
173 tasks_.pop_front();
174 return task;
175 }
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700176 return nullptr;
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700177}
178
Ian Rogers1d54e732013-05-02 21:10:01 -0700179void ThreadPool::Wait(Thread* self, bool do_work, bool may_hold_locks) {
180 if (do_work) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700181 Task* task = nullptr;
182 while ((task = TryGetTask(self)) != nullptr) {
Ian Rogers1d54e732013-05-02 21:10:01 -0700183 task->Run(self);
184 task->Finalize();
185 }
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700186 }
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700187 // Wait until each thread is waiting and the task list is empty.
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700188 MutexLock mu(self, task_queue_lock_);
189 while (!shutting_down_ && (waiting_count_ != GetThreadCount() || !tasks_.empty())) {
Ian Rogers1d54e732013-05-02 21:10:01 -0700190 if (!may_hold_locks) {
191 completion_condition_.Wait(self);
192 } else {
193 completion_condition_.WaitHoldingLocks(self);
194 }
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700195 }
196}
197
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700198size_t ThreadPool::GetTaskCount(Thread* self) {
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700199 MutexLock mu(self, task_queue_lock_);
200 return tasks_.size();
201}
202
203WorkStealingWorker::WorkStealingWorker(ThreadPool* thread_pool, const std::string& name,
204 size_t stack_size)
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700205 : ThreadPoolWorker(thread_pool, name, stack_size), task_(nullptr) {}
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700206
207void WorkStealingWorker::Run() {
208 Thread* self = Thread::Current();
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700209 Task* task = nullptr;
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700210 WorkStealingThreadPool* thread_pool = down_cast<WorkStealingThreadPool*>(thread_pool_);
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700211 while ((task = thread_pool_->GetTask(self)) != nullptr) {
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700212 WorkStealingTask* stealing_task = down_cast<WorkStealingTask*>(task);
213
214 {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700215 CHECK(task_ == nullptr);
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700216 MutexLock mu(self, thread_pool->work_steal_lock_);
217 // Register that we are running the task
218 ++stealing_task->ref_count_;
219 task_ = stealing_task;
220 }
221 stealing_task->Run(self);
222 // Mark ourselves as not running a task so that nobody tries to steal from us.
223 // There is a race condition that someone starts stealing from us at this point. This is okay
224 // due to the reference counting.
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700225 task_ = nullptr;
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700226
227 bool finalize;
228
229 // Steal work from tasks until there is none left to steal. Note: There is a race, but
230 // all that happens when the race occurs is that we steal some work instead of processing a
231 // task from the queue.
232 while (thread_pool->GetTaskCount(self) == 0) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700233 WorkStealingTask* steal_from_task = nullptr;
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700234
235 {
236 MutexLock mu(self, thread_pool->work_steal_lock_);
237 // Try finding a task to steal from.
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700238 steal_from_task = thread_pool->FindTaskToStealFrom();
239 if (steal_from_task != nullptr) {
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700240 CHECK_NE(stealing_task, steal_from_task)
241 << "Attempting to steal from completed self task";
242 steal_from_task->ref_count_++;
243 } else {
244 break;
245 }
246 }
247
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700248 if (steal_from_task != nullptr) {
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700249 // Task which completed earlier is going to steal some work.
250 stealing_task->StealFrom(self, steal_from_task);
251
252 {
253 // We are done stealing from the task, lets decrement its reference count.
254 MutexLock mu(self, thread_pool->work_steal_lock_);
255 finalize = !--steal_from_task->ref_count_;
256 }
257
258 if (finalize) {
259 steal_from_task->Finalize();
260 }
261 }
262 }
263
264 {
265 MutexLock mu(self, thread_pool->work_steal_lock_);
266 // If nobody is still referencing task_ we can finalize it.
267 finalize = !--stealing_task->ref_count_;
268 }
269
270 if (finalize) {
271 stealing_task->Finalize();
272 }
273 }
274}
275
Brian Carlstrom0cd7ec22013-07-17 23:40:20 -0700276WorkStealingWorker::~WorkStealingWorker() {}
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700277
Mathieu Chartierbcd5e9d2013-11-13 14:33:28 -0800278WorkStealingThreadPool::WorkStealingThreadPool(const char* name, size_t num_threads)
279 : ThreadPool(name, 0),
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700280 work_steal_lock_("work stealing lock"),
281 steal_index_(0) {
282 while (GetThreadCount() < num_threads) {
Andreas Gampe277ccbd2014-11-03 21:36:10 -0800283 const std::string worker_name = StringPrintf("Work stealing worker %zu", GetThreadCount());
284 threads_.push_back(new WorkStealingWorker(this, worker_name,
285 ThreadPoolWorker::kDefaultStackSize));
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700286 }
287}
288
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700289WorkStealingTask* WorkStealingThreadPool::FindTaskToStealFrom() {
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700290 const size_t thread_count = GetThreadCount();
291 for (size_t i = 0; i < thread_count; ++i) {
292 // TODO: Use CAS instead of lock.
293 ++steal_index_;
294 if (steal_index_ >= thread_count) {
295 steal_index_-= thread_count;
296 }
297
298 WorkStealingWorker* worker = down_cast<WorkStealingWorker*>(threads_[steal_index_]);
299 WorkStealingTask* task = worker->task_;
300 if (task) {
301 // Not null, we can probably steal from this worker.
302 return task;
303 }
304 }
305 // Couldn't find something to steal.
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700306 return nullptr;
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700307}
308
Brian Carlstrom0cd7ec22013-07-17 23:40:20 -0700309WorkStealingThreadPool::~WorkStealingThreadPool() {}
Mathieu Chartier02b6a782012-10-26 13:51:26 -0700310
Mathieu Chartier0e4627e2012-10-23 16:13:36 -0700311} // namespace art