线程池

#ifndef THREAD_POOL_H
#define THREAD_POOL_H

#include <sched.h>          /* for sched_setaffinity() */
#include <sys/syscall.h>    /* for SYS_gettid() */
#include <unistd.h>         /* for syscall() */
#include <sys/prctl.h>
#include <stdio.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, int cpu_mask = 0, const char *name_prefix = NULL);
    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, int cpu_mask, const char *name_prefix)
    :   stop(false)
{
    for(size_t i = 0;i<threads;++i)
        workers.emplace_back(
            [this, cpu_mask, i, name_prefix]
            {
                if (cpu_mask > 0)
                {
                    int cpu_mask_copy = cpu_mask;
                    cpu_set_t cpus;
                    CPU_ZERO(&cpus);
                    int cpu_idx = 0;
                    while (cpu_mask_copy != 0)
                    {
                        int mask = 1 << cpu_idx;
                        if (cpu_mask_copy & mask)
                        {
                            CPU_SET(cpu_idx, &cpus);
                            cpu_mask_copy &= ~mask;
                        }
                        cpu_idx++;
                    }
                    sched_setaffinity((pid_t)syscall(SYS_gettid), sizeof(cpus), &cpus);
                }
                if (name_prefix != NULL)
                {
                    char thread_name[16];
                    snprintf(thread_name, sizeof(thread_name), "%s%d", name_prefix, (int)i);
                    prctl(PR_SET_NAME, (unsigned long)thread_name, 0, 0, 0);
                }

                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
#include <stdio.h>
#include "ThreadPool.h"

int do_something()
{
	printf("in thread\n");
	return 0;
}

main()
{
    /*线程数,CPU,线程名字*/
    ThreadPool tpool(1,0x01,"stt");
    std::future<int> ret = tpool.enqueue(do_something);
    int ret_value = ret.get();

    return ret_value;
	
}

aarch64-linux-gnu-g++ main.cpp -std=c++11 -I./ -lpthread

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值