mirror of https://github.com/milvus-io/milvus.git
113 lines
3.3 KiB
C++
113 lines
3.3 KiB
C++
// Copyright (C) 2019-2020 Zilliz. All rights reserved.
|
|
//
|
|
// 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.
|
|
|
|
#pragma once
|
|
|
|
#include <condition_variable>
|
|
#include <functional>
|
|
#include <future>
|
|
#include <memory>
|
|
#include <mutex>
|
|
#include <queue>
|
|
#include <stdexcept>
|
|
#include <thread>
|
|
#include <utility>
|
|
#include <vector>
|
|
|
|
#define MAX_THREADS_NUM 32
|
|
|
|
namespace milvus_sdk {
|
|
|
|
class ThreadPool {
|
|
public:
|
|
explicit ThreadPool(size_t threads, size_t queue_size = 1000);
|
|
|
|
template <class F, class... Args>
|
|
auto
|
|
enqueue(F&& f, Args&&... args) -> std::future<typename std::result_of<F(Args...)>::type>;
|
|
|
|
~ThreadPool();
|
|
|
|
private:
|
|
// need to keep track of threads so we can join them
|
|
std::vector<std::thread> workers_;
|
|
|
|
// the task queue
|
|
std::queue<std::function<void()> > tasks_;
|
|
|
|
size_t max_queue_size_;
|
|
|
|
// synchronization
|
|
std::mutex queue_mutex_;
|
|
|
|
std::condition_variable condition_;
|
|
|
|
bool stop;
|
|
};
|
|
|
|
// the constructor just launches some amount of workers
|
|
inline ThreadPool::ThreadPool(size_t threads, size_t queue_size) : max_queue_size_(queue_size), stop(false) {
|
|
for (size_t i = 0; i < threads; ++i)
|
|
workers_.emplace_back([this] {
|
|
for (;;) {
|
|
std::function<void()> task;
|
|
|
|
{
|
|
std::unique_lock<std::mutex> lock(this->queue_mutex_);
|
|
this->condition_.wait(lock, [this] { return this->stop || !this->tasks_.empty(); });
|
|
if (this->stop && this->tasks_.empty())
|
|
return;
|
|
task = std::move(this->tasks_.front());
|
|
this->tasks_.pop();
|
|
}
|
|
this->condition_.notify_all();
|
|
|
|
task();
|
|
}
|
|
});
|
|
}
|
|
|
|
// add new work item to the pool
|
|
template <class F, class... Args>
|
|
auto
|
|
ThreadPool::enqueue(F&& f, Args&&... args) -> std::future<typename std::result_of<F(Args...)>::type> {
|
|
using return_type = typename std::result_of<F(Args...)>::type;
|
|
|
|
auto task = std::make_shared<std::packaged_task<return_type()> >(
|
|
std::bind(std::forward<F>(f), std::forward<Args>(args)...));
|
|
std::future<return_type> res = task->get_future();
|
|
{
|
|
std::unique_lock<std::mutex> lock(queue_mutex_);
|
|
this->condition_.wait(lock, [this] { return this->tasks_.size() < max_queue_size_; });
|
|
// don't allow enqueueing after stopping the pool
|
|
if (stop)
|
|
throw std::runtime_error("enqueue on stopped ThreadPool");
|
|
|
|
tasks_.emplace([task]() { (*task)(); });
|
|
}
|
|
condition_.notify_all();
|
|
return res;
|
|
}
|
|
|
|
// the destructor joins all threads
|
|
inline ThreadPool::~ThreadPool() {
|
|
{
|
|
std::unique_lock<std::mutex> lock(queue_mutex_);
|
|
stop = true;
|
|
}
|
|
condition_.notify_all();
|
|
for (std::thread& worker : workers_) {
|
|
worker.join();
|
|
}
|
|
}
|
|
|
|
} // namespace milvus_sdk
|