| 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134 | /* * * Copyright 2015, Google Inc. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions are * met: * *     * Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. *     * Redistributions in binary form must reproduce the above * copyright notice, this list of conditions and the following disclaimer * in the documentation and/or other materials provided with the * distribution. *     * Neither the name of Google Inc. nor the names of its * contributors may be used to endorse or promote products derived from * this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * */#include <mutex>#include <thread>#include "src/cpp/server/dynamic_thread_pool.h"namespace grpc {DynamicThreadPool::DynamicThread::DynamicThread(DynamicThreadPool* pool)    : pool_(pool),      thd_(new std::thread(&DynamicThreadPool::DynamicThread::ThreadFunc,                           this)) {}DynamicThreadPool::DynamicThread::~DynamicThread() {  thd_->join();  thd_.reset();}void DynamicThreadPool::DynamicThread::ThreadFunc() {  pool_->ThreadFunc();  // Now that we have killed ourselves, we should reduce the thread count  std::unique_lock<std::mutex> lock(pool_->mu_);  pool_->nthreads_--;  // Move ourselves to dead list  pool_->dead_threads_.push_back(this);  if ((pool_->shutdown_) && (pool_->nthreads_ == 0)) {    pool_->shutdown_cv_.notify_one();  }}void DynamicThreadPool::ThreadFunc() {  for (;;) {    // Wait until work is available or we are shutting down.    std::unique_lock<std::mutex> lock(mu_);    if (!shutdown_ && callbacks_.empty()) {      // If there are too many threads waiting, then quit this thread      if (threads_waiting_ >= reserve_threads_) {        break;      }      threads_waiting_++;      cv_.wait(lock);      threads_waiting_--;    }    // Drain callbacks before considering shutdown to ensure all work    // gets completed.    if (!callbacks_.empty()) {      auto cb = callbacks_.front();      callbacks_.pop();      lock.unlock();      cb();    } else if (shutdown_) {      break;    }  }}DynamicThreadPool::DynamicThreadPool(int reserve_threads)    : shutdown_(false),      reserve_threads_(reserve_threads),      nthreads_(0),      threads_waiting_(0) {  for (int i = 0; i < reserve_threads_; i++) {    std::lock_guard<std::mutex> lock(mu_);    nthreads_++;    new DynamicThread(this);  }}void DynamicThreadPool::ReapThreads(std::list<DynamicThread*>* tlist) {  for (auto t = tlist->begin(); t != tlist->end(); t = tlist->erase(t)) {    delete *t;  }}DynamicThreadPool::~DynamicThreadPool() {  std::unique_lock<std::mutex> lock(mu_);  shutdown_ = true;  cv_.notify_all();  while (nthreads_ != 0) {    shutdown_cv_.wait(lock);  }  ReapThreads(&dead_threads_);}void DynamicThreadPool::Add(const std::function<void()>& callback) {  std::lock_guard<std::mutex> lock(mu_);  // Add works to the callbacks list  callbacks_.push(callback);  // Increase pool size or notify as needed  if (threads_waiting_ == 0) {    // Kick off a new thread    nthreads_++;    new DynamicThread(this);  } else {    cv_.notify_one();  }  // Also use this chance to harvest dead threads  if (!dead_threads_.empty()) {    ReapThreads(&dead_threads_);  }}}  // namespace grpc
 |