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

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;
}
相关推荐
LZQqqqqo2 小时前
WinForm 对话框的 Show 与 ShowDialog:阻塞与非阻塞的抉择
服务器·windows·microsoft·winform
yqwang_cn6 小时前
使用Python提取PDF大纲(书签)完整指南
windows·python·pdf
悦人楼6 小时前
深入理解Java集合框架:核心接口、实现类与实战选择
java·windows·python
Bruce_Liuxiaowei19 小时前
县级融媒体中心备份与恢复策略(精简版3-2-1架构)
运维·windows·网络安全·媒体
weixin_307779132 天前
Redis Windows迁移方案与测试
c++·windows·redis·算法·系统架构
陈陈爱java2 天前
实习文档背诵
linux·服务器·windows
测试界2 天前
部署Web UI自动化测试平台:SeleniumFlaskTester
windows·selenium·flask
隐-梵2 天前
2025年测绘程序设计模拟赛一--地形图图幅编号及图廓点经纬度计算
windows·经验分享·visualstudio·c#
呉師傅2 天前
奔图P2500NW打印机手机无线连接方法
运维·网络·windows·智能手机·计算机外设·电脑
许野平2 天前
Rust:如何开发32位的DLL动态库
windows·rust·动态库·dll·32位