对CircularQueLight进行测试，多线程push，多线程pop，有小概率会出现并发问题

```
#include <memory>
#include <vector>
#include <thread>
#include <iomanip>
#include <iostream>
#include "lock_free_queue.h"
#include <unordered_map>

int th_num = 4;
int ops = 100000;

void test3() {
    CircularQueLight<int,1023> queue;
    std::vector<int> vec(th_num * ops);
    bool flag = false;

// 生产者线程
    auto producer = [&queue, &flag](int id) {
        while(!flag);
        for (int i = 0; i < ops; ++i) {
            while(!queue.push(id * ops + i)) {

}
        }
    };

// 消费者线程
    auto consumer = [&queue, &vec, &flag](int id) {
        while(!flag);
        for (int i = 0; i < ops; ++i) {
            int item;
            while (!queue.pop(item)) {
                // 忙等待，直到取出成功
            }
            vec[item]++;
        }
    };

std::vector<std::thread> producers;
    std::vector<std::thread> consumers;

// 创建多个生产者线程
    for (int i = 0; i < th_num; ++i) {
        producers.emplace_back(producer, i);
    }

// 创建多个消费者线程
    for (int i = 0; i < th_num; ++i) {
        consumers.emplace_back(consumer, i);
    }

flag = true;
    auto start = std::chrono::high_resolution_clock::now();

// 等待所有生产者线程完成
    for (auto& p : producers) {
        p.join();
    }

// 等待所有消费者线程完成
    for (auto& c : consumers) {
        c.join();
    }
    auto end = std::chrono::high_resolution_clock::now();
    std::chrono::duration<double, std::nano> elapsed = end - start;
    std::cout << std::endl << "queue push and pop performance: " << std::fixed << std::setprecision(2) << ((th_num * ops) / elapsed.count()) * 1e9 << " ops/s" << std::endl;

for(int i=0; i<vec.size(); ++i) {
        assert(vec[i] == 1);
    }

assert(queue.size() == 0);
}

int main() {
    for(int i=0; i<10000; ++i)
        test3();
}
```

secondtonone1/boostasio-learn

内容风险标识

评论 (0)

secondtonone1/boostasio-learn .gitee-modal { width: 500px !important; }

内容风险标识