-
Notifications
You must be signed in to change notification settings - Fork 3
Expand file tree
/
Copy pathBlockingQueueEx.h
More file actions
140 lines (109 loc) · 3.64 KB
/
BlockingQueueEx.h
File metadata and controls
140 lines (109 loc) · 3.64 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
// ===========================================================================
// BlockingQueueEx.h
// ===========================================================================
#pragma once
#include "../Logger/Logger.h"
#include <mutex> // for std::mutex
#include <semaphore> // for std::counting_semaphore
#include <cstdlib> // for std::malloc / std::free
#include <new> // for placement new
#include <utility> // for std::move
#include <cstddef> // for std::size_t
namespace ProducerConsumerQueue
{
template<typename T, std::size_t QueueSize = 10>
class BlockingQueue
{
private:
T* m_data;
std::size_t m_size;
std::size_t m_pushIndex;
std::size_t m_popIndex;
std::counting_semaphore<QueueSize> m_emptySlots;
std::counting_semaphore<QueueSize> m_fullSlots;
mutable std::mutex m_mutex;
public:
// default c'tor
BlockingQueue() :
m_size{},
m_pushIndex{},
m_popIndex{},
m_emptySlots{ QueueSize },
m_fullSlots{ 0 },
m_data{ static_cast<T*>(std::malloc(sizeof(T) * QueueSize)) }
{
Logger::log(std::cout, "Using Blocking Queue with Semaphores");
}
// don't need other constructors or assignment operators
BlockingQueue(const BlockingQueue&) = delete;
BlockingQueue(BlockingQueue&&) = delete;
BlockingQueue& operator= (const BlockingQueue&) = delete;
BlockingQueue& operator= (BlockingQueue&&) = delete;
// destructor
~BlockingQueue()
{
while (0 != m_size)
{
m_data[m_popIndex].~T();
++m_popIndex;
m_popIndex = m_popIndex % QueueSize;
--m_size;
}
std::free(m_data);
}
// public interface
void push(const T& item)
{
m_emptySlots.acquire();
{
std::lock_guard<std::mutex> guard{ m_mutex };
new (m_data + m_pushIndex) T{ item };
++m_pushIndex;
m_pushIndex = m_pushIndex % QueueSize;
++m_size;
Logger::log(std::cout, " Size: ", m_size);
}
m_fullSlots.release();
}
void push(T&& item)
{
m_emptySlots.acquire();
{
std::lock_guard<std::mutex> guard{ m_mutex };
new (m_data + m_pushIndex) T{ std::move(item) };
++m_pushIndex;
m_pushIndex = m_pushIndex % QueueSize;
++m_size;
Logger::log(std::cout, " Size: ", m_size);
}
m_fullSlots.release();
}
void pop(T& item)
{
m_fullSlots.acquire();
{
std::lock_guard<std::mutex> guard{ m_mutex };
item = m_data[m_popIndex];
m_data[m_popIndex].~T();
++m_popIndex;
m_popIndex = m_popIndex % QueueSize;
--m_size;
Logger::log(std::cout, " Size: ", m_size);
}
m_emptySlots.release();
}
bool empty() const
{
std::lock_guard<std::mutex> guard{ m_mutex };
return m_size == 0;
}
std::size_t size() const
{
std::lock_guard<std::mutex> guard{ m_mutex };
return m_size;
}
};
}
// ===========================================================================
// End-of-File
// ===========================================================================