mirror of
https://github.com/cookiengineer/audacity
synced 2025-08-16 08:34:10 +02:00
Remove ThreadPool from CMakeLists.txt
Signed-off-by: Edgar <Edgar@AnotherFoxGuy.com>
This commit is contained in:
parent
d900e3a580
commit
4f1d9f6f63
@ -109,15 +109,6 @@ else()
|
|||||||
set ( curl_ssl "openssl" )
|
set ( curl_ssl "openssl" )
|
||||||
endif ()
|
endif ()
|
||||||
|
|
||||||
|
|
||||||
# TODO: is threadpool still needed?
|
|
||||||
# add_conan_lib(
|
|
||||||
# ThreadPool
|
|
||||||
# threadpool/20140926
|
|
||||||
# REQUIRED
|
|
||||||
# ALWAYS_ALLOW_CONAN_FALLBACK
|
|
||||||
# )
|
|
||||||
|
|
||||||
add_conan_lib(
|
add_conan_lib(
|
||||||
RapidJSON
|
RapidJSON
|
||||||
rapidjson/1.1.0
|
rapidjson/1.1.0
|
||||||
|
@ -1,20 +0,0 @@
|
|||||||
Copyright (c) 2012 Jakob Progsch, Václav Zeman
|
|
||||||
|
|
||||||
This software is provided 'as-is', without any express or implied
|
|
||||||
warranty. In no event will the authors be held liable for any damages
|
|
||||||
arising from the use of this software.
|
|
||||||
|
|
||||||
Permission is granted to anyone to use this software for any purpose,
|
|
||||||
including commercial applications, and to alter it and redistribute it
|
|
||||||
freely, subject to the following restrictions:
|
|
||||||
|
|
||||||
1. The origin of this software must not be misrepresented; you must not
|
|
||||||
claim that you wrote the original software. If you use this software
|
|
||||||
in a product, an acknowledgment in the product documentation would be
|
|
||||||
appreciated but is not required.
|
|
||||||
|
|
||||||
2. Altered source versions must be plainly marked as such, and must not be
|
|
||||||
misrepresented as being the original software.
|
|
||||||
|
|
||||||
3. This notice may not be removed or altered from any source
|
|
||||||
distribution.
|
|
@ -1,17 +0,0 @@
|
|||||||
ThreadPool
|
|
||||||
==========
|
|
||||||
|
|
||||||
A simple C++11 Thread Pool implementation.
|
|
||||||
|
|
||||||
Basic usage:
|
|
||||||
```c++
|
|
||||||
// create thread pool with 4 worker threads
|
|
||||||
ThreadPool pool(4);
|
|
||||||
|
|
||||||
// enqueue and store future
|
|
||||||
auto result = pool.enqueue([](int answer) { return answer; }, 42);
|
|
||||||
|
|
||||||
// get result from future
|
|
||||||
std::cout << result.get() << std::endl;
|
|
||||||
|
|
||||||
```
|
|
@ -1,98 +0,0 @@
|
|||||||
#ifndef THREAD_POOL_H
|
|
||||||
#define THREAD_POOL_H
|
|
||||||
|
|
||||||
#include <vector>
|
|
||||||
#include <queue>
|
|
||||||
#include <memory>
|
|
||||||
#include <thread>
|
|
||||||
#include <mutex>
|
|
||||||
#include <condition_variable>
|
|
||||||
#include <future>
|
|
||||||
#include <functional>
|
|
||||||
#include <stdexcept>
|
|
||||||
|
|
||||||
class ThreadPool {
|
|
||||||
public:
|
|
||||||
ThreadPool(size_t);
|
|
||||||
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;
|
|
||||||
|
|
||||||
// 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)
|
|
||||||
: 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();
|
|
||||||
}
|
|
||||||
|
|
||||||
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);
|
|
||||||
|
|
||||||
// don't allow enqueueing after stopping the pool
|
|
||||||
if(stop)
|
|
||||||
throw std::runtime_error("enqueue on stopped ThreadPool");
|
|
||||||
|
|
||||||
tasks.emplace([task](){ (*task)(); });
|
|
||||||
}
|
|
||||||
condition.notify_one();
|
|
||||||
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();
|
|
||||||
}
|
|
||||||
|
|
||||||
#endif
|
|
Loading…
x
Reference in New Issue
Block a user