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
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
|
// -*- mode: c++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2; coding: utf-8-unix -*-
// ***** BEGIN LICENSE BLOCK *****
//////////////////////////////////////////////////////////////////////////
// Copyright (c) 2011-2014 RALOVICH, Kristóf //
// //
// 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 3 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. //
// //
//////////////////////////////////////////////////////////////////////////
// ***** END LICENSE BLOCK *****
#pragma once
#include <queue>
#include <boost/function.hpp>
#include <boost/thread.hpp>
#include <boost/scoped_ptr.hpp>
#include <list>
template <typename DataType>
class lqueue2
{
public:
typedef std::list<DataType> DataList;
public:
bool empty() const
{
boost::mutex::scoped_lock lock(m_mtx);
return m_q.empty();
}
void push(DataType const& data)
{
boost::mutex::scoped_lock lock(m_mtx);
m_q.push_back(data);
m_pushEvent.notify_all();
}
void pushArray(DataType const* data, const size_t nItems)
{
boost::mutex::scoped_lock lock(m_mtx);
for(size_t i = 0; i < nItems; i++)
m_q.push_back(data[i]);
m_pushEvent.notify_all();
}
const typename std::queue<DataType>::size_type
size() const
{
boost::unique_lock<boost::mutex> lock(m_mtx);
return m_q.size();
}
const DataList
getListCopy() const
{
boost::unique_lock<boost::mutex> lock(m_mtx);
return m_q; // copy
}
void
clear()
{
boost::unique_lock<boost::mutex> lock(m_mtx);
m_q.clear();
}
protected:
mutable boost::mutex m_mtx;
boost::condition_variable m_pushEvent;
DataList m_q;
};
// implements push consumer
template < class DataType>
class lqueue3 : public lqueue2<DataType>
{
public:
typedef boost::function<bool (DataType&)> Listener;
typedef boost::function<bool (std::vector<DataType>&)> Listener2;
typedef lqueue2<DataType> Super;
struct ListenerProc
{
void operator() (lqueue3* This)
{
This->eventLoop();
}
};
lqueue3(bool eventLoopInBgTh = true)
: stop(false)
{
if(eventLoopInBgTh)
th_listener.reset( new boost::thread(lp, this) );
}
~lqueue3()
{
stop = true;
if(th_listener.get())
th_listener->join();
}
void
kill()
{
stop = true;
}
void
setOnDataArrivedCallback(Listener2 l)
{
mCallback = l;
}
public:
void eventLoop()
{
while(!stop)
{
boost::unique_lock<boost::mutex> lock(Super::m_mtx);
boost::posix_time::time_duration td = boost::posix_time::milliseconds(2000);
if(!Super::m_pushEvent.timed_wait(lock, td)) // will automatically and atomically unlock mutex while it waits
{
//std::cout << "no event before timeout\n";
continue;
}
assert(!Super::m_q.empty());
size_t s = Super::m_q.size();
std::vector<DataType> v(s);
for(size_t i = 0; i < s; i++)
{
v[i] = Super::m_q.front();
Super::m_q.pop_front();
}
if(mCallback)
/*bool rv =*/ mCallback(v);
}
}
protected:
ListenerProc lp;
boost::scoped_ptr<boost::thread> th_listener;
volatile bool stop;
Listener2 mCallback;
};
// implements poll-able pop consumer
template < class DataType>
class lqueue4 : public lqueue2<DataType>
{
public:
typedef lqueue2<DataType> Super;
template < class Cmp >
bool
tryFindPop(DataType& needle, Cmp cmp)
{
boost::mutex::scoped_lock lock(Super::m_mtx);
typename Super::DataList::iterator i;
for(i = Super::m_q.begin(); i != Super::m_q.end(); i++)
{
if(cmp(needle, *i))
break;
}
if(i==Super::m_q.end())
return false;
needle = *i; // copy
Super::m_q.erase(i);
return true;
}
bool
pop(DataType& data, const size_t timeout = 0)
{
boost::mutex::scoped_lock lock(Super::m_mtx);
/// if queue empty, wait untile timeout if there was anything pushed
if(Super::m_q.empty() && timeout > 0)
{
boost::posix_time::time_duration td = boost::posix_time::milliseconds(timeout);
if(!Super::m_pushEvent.timed_wait(lock, td))
return false;
}
assert(!Super::m_q.empty());
data = Super::m_q.front();
Super::m_q.pop_front();
return true;
}
bool
popArray(DataType* dst, const size_t sizeBytes, size_t& bytesRead, const size_t timeout = 0)
{
if(!dst)
return false;
boost::unique_lock<boost::mutex> lock(Super::m_mtx);
/// if queue empty, wait until timeout if there was anything pushed
if(Super::m_q.empty() && timeout > 0)
{
boost::posix_time::time_duration td = boost::posix_time::milliseconds(timeout);
if(!Super::m_pushEvent.timed_wait(lock, td))
{
bytesRead = 0;
return false;
}
}
assert(!Super::m_q.empty());
size_t s = Super::m_q.size();
s = std::min(s, sizeBytes);
for(size_t i = 0; i < s; i++)
{
*(dst+i) = Super::m_q.front();
Super::m_q.pop_front();
}
bytesRead = s;
return true;
}
};
|
