forked from ChunelFeng/CGraph
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathUWorkStealingQueue.h
More file actions
165 lines (138 loc) · 3.86 KB
/
UWorkStealingQueue.h
File metadata and controls
165 lines (138 loc) · 3.86 KB
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
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
/***************************
@Author: Chunel
@Contact: chunel@foxmail.com
@File: UWorkStealingQueue.h
@Time: 2021/7/2 11:29 下午
@Desc: 实现了一个包含盗取功能的安全队列
***************************/
#ifndef CGRAPH_UWORKSTEALINGQUEUE_H
#define CGRAPH_UWORKSTEALINGQUEUE_H
#include <deque>
#include "UQueueObject.h"
CGRAPH_NAMESPACE_BEGIN
template<typename T>
class UWorkStealingQueue : public UQueueObject {
public:
/**
* 向队列中写入信息
* @param value
*/
CVoid push(T&& value) {
while (true) {
if (mutex_.try_lock()) {
deque_.emplace_back(std::forward<T>(value));
mutex_.unlock();
break;
} else {
CGRAPH_YIELD();
}
}
}
/**
* 尝试往队列里写入信息
* @param value
* @return
*/
CBool tryPush(T&& value) {
CBool result = false;
if (mutex_.try_lock()) {
deque_.emplace_back(std::forward<T>(value));
mutex_.unlock();
result = true;
}
return result;
}
/**
* 向队列中写入信息
* @param values
*/
CVoid push(const std::vector<T>& values) {
while (true) {
if (mutex_.try_lock()) {
for (auto& value : values) {
deque_.emplace_back(value);
}
mutex_.unlock();
break;
} else {
CGRAPH_YIELD();
}
}
}
/**
* 弹出节点，从头部进行
* @param value
* @return
*/
CBool tryPop(T& value) {
// 这里不使用raii锁，主要是考虑到多线程的情况下，可能会重复进入
bool result = false;
if (!deque_.empty() && mutex_.try_lock()) {
if (!deque_.empty()) {
value = std::forward<T>(deque_.front()); // 从前方弹出
deque_.pop_front();
result = true;
}
mutex_.unlock();
}
return result;
}
/**
* 从头部开始批量获取可执行任务信息
* @param values
* @param maxLocalBatchSize
* @return
*/
CBool tryPop(std::vector<T>& values, int maxLocalBatchSize) {
bool result = false;
if (!deque_.empty() && mutex_.try_lock()) {
while (!deque_.empty() && maxLocalBatchSize--) {
values.emplace_back(std::forward<T>(deque_.front()));
deque_.pop_front();
result = true;
}
mutex_.unlock();
}
return result;
}
/**
* 窃取节点，从尾部进行
* @param task
* @return
*/
CBool trySteal(T& value) {
bool result = false;
if (!deque_.empty() && mutex_.try_lock()) {
if (!deque_.empty()) {
value = std::forward<T>(deque_.back()); // 从后方窃取
deque_.pop_back();
result = true;
}
mutex_.unlock();
}
return result;
}
/**
* 批量窃取节点，从尾部进行
* @param values
* @return
*/
CBool trySteal(std::vector<T>& values, int maxStealBatchSize) {
bool result = false;
if (!deque_.empty() && mutex_.try_lock()) {
while (!deque_.empty() && maxStealBatchSize--) {
values.emplace_back(std::forward<T>(deque_.back()));
deque_.pop_back();
result = true;
}
mutex_.unlock();
}
return result; // 如果非空，表示盗取成功
}
UWorkStealingQueue() = default;
CGRAPH_NO_ALLOWED_COPY(UWorkStealingQueue)
private:
std::deque<T> deque_; // 存放任务的双向队列
};
CGRAPH_NAMESPACE_END
#endif //CGRAPH_UWORKSTEALINGQUEUE_H