|
|
|
/*
|
|
|
|
*
|
|
|
|
* Copyright 2016 gRPC authors.
|
|
|
|
*
|
|
|
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
|
|
|
* you may not use this file except in compliance with the License.
|
|
|
|
* You may obtain a copy of the License at
|
|
|
|
*
|
|
|
|
* http://www.apache.org/licenses/LICENSE-2.0
|
|
|
|
*
|
|
|
|
* Unless required by applicable law or agreed to in writing, software
|
|
|
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
|
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
|
|
* See the License for the specific language governing permissions and
|
|
|
|
* limitations under the License.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "src/cpp/thread_manager/thread_manager.h"
|
|
|
|
|
|
|
|
#include <climits>
|
|
|
|
#include <mutex>
|
|
|
|
#include <thread>
|
|
|
|
|
|
|
|
#include <grpc/support/log.h>
|
|
|
|
|
|
|
|
namespace grpc {
|
|
|
|
|
|
|
|
ThreadManager::WorkerThread::WorkerThread(ThreadManager* thd_mgr)
|
|
|
|
: thd_mgr_(thd_mgr), thd_(&ThreadManager::WorkerThread::Run, this) {}
|
|
|
|
|
|
|
|
void ThreadManager::WorkerThread::Run() {
|
|
|
|
thd_mgr_->MainWorkLoop();
|
|
|
|
thd_mgr_->MarkAsCompleted(this);
|
|
|
|
}
|
|
|
|
|
|
|
|
ThreadManager::WorkerThread::~WorkerThread() { thd_.join(); }
|
|
|
|
|
|
|
|
ThreadManager::ThreadManager(int min_pollers, int max_pollers)
|
|
|
|
: shutdown_(false),
|
|
|
|
num_pollers_(0),
|
|
|
|
min_pollers_(min_pollers),
|
|
|
|
max_pollers_(max_pollers == -1 ? INT_MAX : max_pollers),
|
|
|
|
num_threads_(0) {}
|
|
|
|
|
|
|
|
ThreadManager::~ThreadManager() {
|
|
|
|
{
|
|
|
|
std::unique_lock<std::mutex> lock(mu_);
|
|
|
|
GPR_ASSERT(num_threads_ == 0);
|
|
|
|
}
|
|
|
|
|
|
|
|
CleanupCompletedThreads();
|
|
|
|
}
|
|
|
|
|
|
|
|
void ThreadManager::Wait() {
|
|
|
|
std::unique_lock<std::mutex> lock(mu_);
|
|
|
|
while (num_threads_ != 0) {
|
|
|
|
shutdown_cv_.wait(lock);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void ThreadManager::Shutdown() {
|
|
|
|
std::unique_lock<std::mutex> lock(mu_);
|
|
|
|
shutdown_ = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool ThreadManager::IsShutdown() {
|
|
|
|
std::unique_lock<std::mutex> lock(mu_);
|
|
|
|
return shutdown_;
|
|
|
|
}
|
|
|
|
|
|
|
|
void ThreadManager::MarkAsCompleted(WorkerThread* thd) {
|
|
|
|
{
|
|
|
|
std::unique_lock<std::mutex> list_lock(list_mu_);
|
|
|
|
completed_threads_.push_back(thd);
|
|
|
|
}
|
|
|
|
|
|
|
|
std::unique_lock<std::mutex> lock(mu_);
|
|
|
|
num_threads_--;
|
|
|
|
if (num_threads_ == 0) {
|
|
|
|
shutdown_cv_.notify_one();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void ThreadManager::CleanupCompletedThreads() {
|
|
|
|
std::list<WorkerThread*> completed_threads;
|
|
|
|
{
|
|
|
|
// swap out the completed threads list: allows other threads to clean up
|
|
|
|
// more quickly
|
|
|
|
std::unique_lock<std::mutex> lock(list_mu_);
|
|
|
|
completed_threads.swap(completed_threads_);
|
|
|
|
}
|
|
|
|
for (auto thd : completed_threads) delete thd;
|
|
|
|
}
|
|
|
|
|
|
|
|
void ThreadManager::Initialize() {
|
|
|
|
{
|
|
|
|
std::unique_lock<std::mutex> lock(mu_);
|
|
|
|
num_pollers_ = min_pollers_;
|
|
|
|
num_threads_ = min_pollers_;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (int i = 0; i < min_pollers_; i++) {
|
|
|
|
// Create a new thread (which ends up calling the MainWorkLoop() function
|
|
|
|
new WorkerThread(this);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void ThreadManager::MainWorkLoop() {
|
|
|
|
while (true) {
|
|
|
|
void* tag;
|
|
|
|
bool ok;
|
|
|
|
WorkStatus work_status = PollForWork(&tag, &ok);
|
|
|
|
|
|
|
|
std::unique_lock<std::mutex> lock(mu_);
|
|
|
|
// Reduce the number of pollers by 1 and check what happened with the poll
|
|
|
|
num_pollers_--;
|
|
|
|
bool done = false;
|
|
|
|
switch (work_status) {
|
|
|
|
case TIMEOUT:
|
|
|
|
// If we timed out and we have more pollers than we need (or we are
|
|
|
|
// shutdown), finish this thread
|
|
|
|
if (shutdown_ || num_pollers_ > max_pollers_) done = true;
|
|
|
|
break;
|
|
|
|
case SHUTDOWN:
|
|
|
|
// If the thread manager is shutdown, finish this thread
|
|
|
|
done = true;
|
|
|
|
break;
|
|
|
|
case WORK_FOUND:
|
|
|
|
// If we got work and there are now insufficient pollers, start a new
|
|
|
|
// one
|
|
|
|
if (!shutdown_ && num_pollers_ < min_pollers_) {
|
|
|
|
num_pollers_++;
|
|
|
|
num_threads_++;
|
|
|
|
// Drop lock before spawning thread to avoid contention
|
|
|
|
lock.unlock();
|
|
|
|
new WorkerThread(this);
|
|
|
|
} else {
|
|
|
|
// Drop lock for consistency with above branch
|
|
|
|
lock.unlock();
|
|
|
|
}
|
|
|
|
// Lock is always released at this point - do the application work
|
|
|
|
DoWork(tag, ok);
|
|
|
|
// Take the lock again to check post conditions
|
|
|
|
lock.lock();
|
|
|
|
// If we're shutdown, we should finish at this point.
|
|
|
|
if (shutdown_) done = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
// If we decided to finish the thread, break out of the while loop
|
|
|
|
if (done) break;
|
|
|
|
// ... otherwise increase poller count and continue
|
|
|
|
// There's a chance that we'll exceed the max poller count: that is
|
|
|
|
// explicitly ok - we'll decrease after one poll timeout, and prevent
|
|
|
|
// some thrashing starting up and shutting down threads
|
|
|
|
num_pollers_++;
|
|
|
|
};
|
|
|
|
|
|
|
|
CleanupCompletedThreads();
|
|
|
|
|
|
|
|
// If we are here, either ThreadManager is shutting down or it already has
|
|
|
|
// enough threads.
|
|
|
|
}
|
|
|
|
|
|
|
|
} // namespace grpc
|