-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathqueue.h
202 lines (172 loc) · 3.97 KB
/
queue.h
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
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
// -*- c++ -*-
#ifndef QUEUE_H
#define QUEUE_H
#include <pthread.h>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <cstdint>
#include <mutex>
#include <stdexcept>
#include <utility>
using std::atomic;
using std::chrono::time_point;
namespace queue {
class queue_closed : public std::runtime_error
{
public:
queue_closed()
: std::runtime_error("queue closed!")
{}
~queue_closed() {}
};
template <typename T, uint32_t Capacity,
typename Mutex=std::mutex,
typename CV=std::condition_variable>
class ArrayBlockingQueue
{
public:
ArrayBlockingQueue() = default;
void put(T val)
{
check_closed();
std::unique_lock<Mutex> lock(mutex);
while (count == Capacity) {
not_full.wait(lock);
check_closed();
}
array[inc(head)] = val;
++count;
not_empty.notify_one();
}
T take()
{
check_closed();
std::unique_lock<Mutex> lock(mutex);
while (count == 0) {
not_empty.wait(lock);
check_closed();
}
T val = array[inc(tail)];
--count;
not_full.notify_one();
return val;
}
void close()
{
std::unique_lock<Mutex> lock(mutex);
closed = true;
not_full.notify_all();
not_empty.notify_all();
}
// not copyable
ArrayBlockingQueue(ArrayBlockingQueue&) = delete;
ArrayBlockingQueue& operator=(ArrayBlockingQueue&) = delete;
private:
uint32_t inc(uint32_t& i)
{
uint32_t prev = i;
if (i == Capacity-1) {
i = 0;
} else {
++i;
}
return prev;
}
void check_closed()
{
if (closed)
throw queue_closed();
}
T array[Capacity];
uint32_t head;
uint32_t tail;
uint32_t count;
Mutex mutex;
CV not_empty;
CV not_full;
atomic<bool> closed;
};
template <typename T,
typename Mutex=std::timed_mutex,
typename CV=std::condition_variable_any>
class Deque
{
public:
using lock_t = std::unique_lock<Mutex>;
Deque() = default;
void put(T val)
{
lock_t lock(mutex);
check_closed();
deque.push_back(val);
ready.notify_one();
}
template <typename ...Args>
void emplace(Args... args)
{
lock_t lock(mutex);
check_closed();
deque.emplace_back(args...);
ready.notify_one();
}
T take()
{
lock_t lock(mutex);
check_closed();
while (deque.empty()) {
ready.wait(lock);
check_closed();
}
T val = std::move(deque.front());
deque.pop_front();
return val;
}
template <typename Clock, typename Duration>
std::pair<bool, T> poll_until(const time_point<Clock, Duration>& end_time)
{
std::unique_lock<Mutex> lock(mutex, end_time);
if (lock) {
check_closed();
while (deque.empty()) {
if (ready.wait_until(lock, end_time) == std::cv_status::timeout) {
return { false, T() };
}
check_closed();
}
T val = std::move(deque.front());
deque.pop_front();
return { true, val };
} else {
return { false, T() };
}
}
void close()
{
std::unique_lock<Mutex> lock(mutex);
closed = true;
ready.notify_all();
}
void reset()
{
std::unique_lock<Mutex> lock(mutex);
closed = false;
deque.clear();
ready.notify_all();
}
// not copyable
Deque(Deque&) = delete;
Deque& operator=(Deque&) = delete;
private:
void check_closed()
{
if (closed)
throw queue_closed();
}
std::deque<T> deque;
Mutex mutex;
CV ready;
bool closed = false;
};
}
#endif /* QUEUE_H */