blob: 7081b76b68e0fb9ea00088b5af7064de778d6956 (
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
|
/*
*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you may not use this file except in compliance
* with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed on an
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* KIND, either express or implied. See the License for the
* specific language governing permissions and limitations
* under the License.
*
*/
#ifndef _BlockingQueue_
#define _BlockingQueue_
#include <queue>
#include "qpid/sys/Monitor.h"
namespace qpid {
namespace client {
struct QueueClosed {};
template <class T>
class BlockingQueue
{
sys::Monitor lock;
std::queue<T> queue;
bool closed;
public:
BlockingQueue() : closed(false) {}
void reset()
{
sys::Monitor::ScopedLock l(lock);
closed = true;
}
T pop()
{
sys::Monitor::ScopedLock l(lock);
while (!closed && queue.empty()) {
lock.wait();
}
if (closed) {
throw QueueClosed();
} else {
T t = queue.front();
queue.pop();
return t;
}
}
void push(T t)
{
sys::Monitor::ScopedLock l(lock);
bool wasEmpty = queue.empty();
queue.push(t);
if (wasEmpty) {
lock.notifyAll();
}
}
void close()
{
sys::Monitor::ScopedLock l(lock);
closed = true;
lock.notifyAll();
}
};
}}
#endif
|
