blob: a76b8b0b5c09f804a4483b89df852381f6f2cb37 (
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
 | /*
* Copyright (C) 2008-2014 TrinityCore <http://www.trinitycore.org/>
*
* This program is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by the
* Free Software Foundation; either version 2 of the License, or (at your
* option) any later version.
*
* This program is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
* more details.
*
* You should have received a copy of the GNU General Public License along
* with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef _PCQ_H
#define _PCQ_H
#include <condition_variable>
#include <mutex>
#include <queue>
#include <atomic>
#include <type_traits>
template <typename T>
class ProducerConsumerQueue
{
private:
    std::mutex _queueLock;
    std::queue<T> _queue;
    std::condition_variable _condition;
    std::atomic<bool> _shutdown;
public:
    ProducerConsumerQueue<T>() : _shutdown(false) { }
    void Push(const T& value)
    {
        std::lock_guard<std::mutex> lock(_queueLock);
        _queue.push(std::move(value));
        _condition.notify_one();
    }
    bool Empty()
    {
        std::lock_guard<std::mutex> lock(_queueLock);
        return _queue.empty();
    }
    bool Pop(T& value)
    {
        std::lock_guard<std::mutex> lock(_queueLock);
        if (_queue.empty() || _shutdown)
            return false;
        value = _queue.front();
        _queue.pop();
        return true;
    }
    void WaitAndPop(T& value)
    {
        std::unique_lock<std::mutex> lock(_queueLock);
        _condition.wait(lock, [this]() { return !_queue.empty() || _shutdown; });
        if (_queue.empty() || _shutdown)
            return;
        value = _queue.front();
        _queue.pop();
    }
    void Cancel()
    {
        _queueLock.lock();
        while (!_queue.empty())
        {
            T& value = _queue.front();
            DeleteQueuedObject(value);
            _queue.pop();
        }
        _shutdown = true;
        _queueLock.unlock();
        _condition.notify_all();
    }
private:
    template<typename E = T>
    typename std::enable_if<std::is_pointer<E>::value>::type DeleteQueuedObject(E& obj) { delete obj; }
    template<typename E = T>
    typename std::enable_if<!std::is_pointer<E>::value>::type DeleteQueuedObject(E const& /*packet*/) { }
};
#endif
 |