blob: 629e5b7223f046b686b7dbaa57b77d3645b5be06 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
|
//
// Copyright Aliaksei Levin (levlam@telegram.org), Arseny Smirnov (arseny30@gmail.com) 2014-2018
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
//
#include "td/utils/format.h"
#include "td/utils/logging.h"
#include "td/utils/MpscLinkQueue.h"
#include "td/utils/port/thread.h"
#include "td/utils/tests.h"
class NodeX : public td::MpscLinkQueueImpl::Node {
public:
explicit NodeX(int value) : value_(value) {
}
td::MpscLinkQueueImpl::Node *to_mpsc_link_queue_node() {
return static_cast<td::MpscLinkQueueImpl::Node *>(this);
}
static NodeX *from_mpsc_link_queue_node(td::MpscLinkQueueImpl::Node *node) {
return static_cast<NodeX *>(node);
}
int value() {
return value_;
}
private:
int value_;
};
using QueueNode = td::MpscLinkQueueUniquePtrNode<NodeX>;
QueueNode create_node(int value) {
return QueueNode(std::make_unique<NodeX>(value));
}
TEST(MpscLinkQueue, one_thread) {
td::MpscLinkQueue<QueueNode> queue;
{
queue.push(create_node(1));
queue.push(create_node(2));
queue.push(create_node(3));
td::MpscLinkQueue<QueueNode>::Reader reader;
queue.pop_all(reader);
queue.push(create_node(4));
queue.pop_all(reader);
std::vector<int> v;
while (auto node = reader.read()) {
v.push_back(node.value().value());
}
CHECK((v == std::vector<int>{1, 2, 3, 4})) << td::format::as_array(v);
v.clear();
queue.push(create_node(5));
queue.pop_all(reader);
while (auto node = reader.read()) {
v.push_back(node.value().value());
}
CHECK((v == std::vector<int>{5})) << td::format::as_array(v);
}
{
queue.push_unsafe(create_node(3));
queue.push_unsafe(create_node(2));
queue.push_unsafe(create_node(1));
queue.push_unsafe(create_node(0));
td::MpscLinkQueue<QueueNode>::Reader reader;
queue.pop_all_unsafe(reader);
std::vector<int> v;
while (auto node = reader.read()) {
v.push_back(node.value().value());
}
CHECK((v == std::vector<int>{3, 2, 1, 0})) << td::format::as_array(v);
}
}
#if !TD_THREAD_UNSUPPORTED
TEST(MpscLinkQueue, multi_thread) {
td::MpscLinkQueue<QueueNode> queue;
int threads_n = 10;
int queries_n = 1000000;
std::vector<int> next_value(threads_n);
std::vector<td::thread> threads(threads_n);
int thread_i = 0;
for (auto &thread : threads) {
thread = td::thread([&, id = thread_i] {
for (int i = 0; i < queries_n; i++) {
queue.push(create_node(i * threads_n + id));
}
});
thread_i++;
}
int active_threads = threads_n;
td::MpscLinkQueue<QueueNode>::Reader reader;
while (active_threads) {
queue.pop_all(reader);
while (auto value = reader.read()) {
auto x = value.value().value();
auto thread_id = x % threads_n;
x /= threads_n;
CHECK(next_value[thread_id] == x);
next_value[thread_id]++;
if (x + 1 == queries_n) {
active_threads--;
}
}
}
for (auto &thread : threads) {
thread.join();
}
}
#endif //!TD_THREAD_UNSUPPORTED
|
