多线程消息处理(支持动态调整线程数)

MultiThreadEx.h

cpp 复制代码
#pragma once

#include <thread>
#include <map>
#include <list>
#include <queue>
#include <mutex>
#include <memory>
#include <condition_variable>
#include <atomic>

using TaskFun = std::function<void(void)>;

class CMultiThreadEx {
public:
    CMultiThreadEx();
    ~CMultiThreadEx();

    bool start();

    void stop();

    bool post(const TaskFun& task_fun);

private:
    void exec();
    void add_thread();
    void del_thread();
    void del_thread_oper();
private:

    std::atomic_bool exist_;
    std::mutex thread_mutex_;
    std::map<std::thread::id, std::shared_ptr<std::thread>> threads_;
    std::list<std::thread::id> threads_need_del_;
    std::atomic<int32_t> thread_num_;
    std::atomic<int32_t> task_num_;
    std::queue<TaskFun> tasks_;
    std::mutex task_mutex_;
    std::condition_variable condition_;

    int32_t min_thead_num_;
    int32_t max_thead_num_;
    int32_t task_avg_num_;
};

MultiThreadEx.cpp:

cpp 复制代码
#include "MultiThreadEx.h"
#include <iostream>

CMultiThreadEx::CMultiThreadEx()
    : exist_(false)
    , min_thead_num_(1)
    , max_thead_num_(1024)
    , task_avg_num_(10)
{
}

CMultiThreadEx::~CMultiThreadEx() {}

bool CMultiThreadEx::start() {
    if (exist_) {
        return false;
    }

    exist_ = true;

    for (size_t i = 0; i < min_thead_num_; i++)
    {
        add_thread();
    }

    return true;
}

void CMultiThreadEx::stop() {
    if (!exist_) {
        return;
    }

    exist_ = false;
    condition_.notify_all();

    for (auto& iter_thread : threads_)
    {
        if (iter_thread.second->joinable()) {
            iter_thread.second->join();
        }
    }

    return;
}

bool CMultiThreadEx::post(const TaskFun& task_fun) {
    if (!exist_) {
        return false;
    }

    {
        std::lock_guard<std::mutex> lock(task_mutex_);
        tasks_.push(task_fun);
        ++task_num_;
    }

    if (thread_num_ < min_thead_num_
        || task_num_ > thread_num_ * task_avg_num_)
    {
        add_thread();
    }

    condition_.notify_one();
    return true;
}

void CMultiThreadEx::exec() {
    while (exist_)
    {
        TaskFun task = nullptr;
        del_thread_oper();

        {
            std::unique_lock<std::mutex> lock(task_mutex_);
            if (tasks_.empty()) {

                if (thread_num_ > min_thead_num_) {

                    auto ret =condition_.wait_for(lock, std::chrono::milliseconds(1000));
                    if (std::cv_status::timeout == ret)
                    {
                        // 退出线程
                        del_thread();
                        break;
                    }

                    if (!exist_) {
                        break;
                    }

                }

                condition_.wait(lock);
            }

            if (!exist_) {
                break;
            }

            if (!tasks_.empty())
            {
                task = tasks_.front();
                tasks_.pop();
                --task_num_;
            }
        }

        if (nullptr != task) {
            task();
        }
    }

    return;
}

void CMultiThreadEx::add_thread() {
    std::lock_guard<std::mutex> lock(thread_mutex_);

    std::shared_ptr<std::thread> sptr_thread =
        std::make_shared<std::thread>(std::thread(std::bind(&CMultiThreadEx::exec, this)));
    threads_.insert(std::make_pair(sptr_thread->get_id(), sptr_thread));
    ++thread_num_;
}

void CMultiThreadEx::del_thread(){
    std::lock_guard<std::mutex> lock(thread_mutex_);

    auto id = std::this_thread::get_id();
    auto iter_thread = threads_.find(id);

    if (threads_.end() != iter_thread) {
        threads_need_del_.push_back(id);
        --thread_num_;
    }
}

void CMultiThreadEx::del_thread_oper(){
    std::lock_guard<std::mutex> lock(thread_mutex_);

    if (threads_need_del_.empty())
    {
        return;
    }

    for (auto& id : threads_need_del_)
    {
        auto iter_thread = threads_.find(id);

        if (threads_.end() != iter_thread){
            if (iter_thread->second->joinable()) {
                iter_thread->second->join();
            }
            threads_.erase(id);
        }
    }
}

main:

cpp 复制代码
#include <iostream>
#include "MultiThreadEx.h"

int main() {

    std::mutex m;

    CMultiThreadEx t;
    t.start();

    auto fun = [&]()
    {
        std::lock_guard<std::mutex> lock(m);

        static int count = 0;
        std::cout << "Count: " << ++count << "thread-id: " << std::this_thread::get_id() << std::endl;
        std::this_thread::sleep_for(std::chrono::seconds(1));
    };

    for (int i = 0; i < 20; ++i)
    {
        t.post(fun);
        //std::this_thread::sleep_for(std::chrono::microseconds(500));
    }

    getchar();
    t.post(fun);
    getchar();
    t.stop();

    return 0;
}
相关推荐
x***r15112 小时前
SuperScan4单文件扫描安装步骤详解(附端口扫描与主机存活检测教程)
windows
不爱学习的老登13 小时前
Windows客户端与Linux服务器配置ssh无密码登录
linux·服务器·windows
陌陌龙14 小时前
全免去水印大师 v1.7.6 | 安卓端高效水印处理神器
windows
csdn2015_15 小时前
将object转换成list
开发语言·windows·python
SJjiemo18 小时前
LeafView 图片查看器
windows
ENEN988119 小时前
【精品珍藏自购付费资源】2026年日历PSD模板合集【PSD CDR多格式可编辑】已分类含预览 [7.5G]
windows·经验分享·电脑
njsgcs20 小时前
windows ui窗口post 我wsl开放的flask llm端点
windows·ui·flask·post
这波不该贪内存的21 小时前
数据结构三个典型的类型整理
数据结构·windows
love530love21 小时前
突破 Windows 编译禁区:BitNet 1-bit LLM 推理框架 GPU 加速部署编译 BitNet CUDA 算子全记录
c++·人工智能·pytorch·windows·python·cuda·bitnet
咚咚王者21 小时前
人工智能之视觉领域 计算机视觉 第二章 环境搭建(Windows/Mac/Linux通用)
人工智能·windows·计算机视觉