queue.h
3.15 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
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
/*
* Copyright 2002-2014 the original author or authors.
*
* Licensed 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
*
* CC/LICENSE
*
* 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 __IMS_QUEUE_H_
#define __IMS_QUEUE_H_
#include <deque>
#include <pthread.h>
#include <ims_log.h>
#include <time.h>
#include <ims_log.h>
namespace ims {
template<class T>
class queue_t {
public:
queue_t(): _waitings(0) {
int32_t ret = pthread_mutex_init(&this->_mutex, NULL);
if (0 != ret) {
WARNING_LOG("pthread_mutex_init error!");
}
ret = pthread_cond_init(&this->_cond, NULL);
if (0 != ret) {
WARNING_LOG("pthread_cond_init error!");
}
}
~queue_t() {
pthread_mutex_destroy(&_mutex);
pthread_cond_destroy(&_cond);
}
/**
* @brief put the element to the end of the queue
*
* @param [in] item : const T&
* @return void
* @retval
* @see
* @note
**/
void put(const T& item) {
pthread_mutex_lock(&_mutex);
_q.push_back(item);
pthread_mutex_unlock(&_mutex);
if (_waitings > 0) {
pthread_cond_signal(&_cond);
}
}
void insert(const T& item) {
pthread_mutex_lock(&_mutex);
_q.push_front(item);
pthread_mutex_unlock(&_mutex);
if (_waitings > 0) {
pthread_cond_signal(&_cond);
}
}
/**
* @brief get an element from the front of the quue
*
* @param [out] ret : T&
* @param [in] timeout : millisecond
* @return bool
* @retval
* @see
* @note
**/
bool get(T& ret, int32_t timeout = 0) {
pthread_mutex_lock(&_mutex);
++_waitings;
if (_q.empty()) {
if (timeout > 0) {
struct timespec abstime;
clock_gettime(CLOCK_REALTIME, &abstime);
abstime.tv_sec += timeout / 1000;
abstime.tv_nsec += (timeout % 1000) * 1000000;
pthread_cond_timedwait(&_cond, &_mutex, &abstime);
}
}
if (_q.empty()) {
--_waitings;
pthread_mutex_unlock(&_mutex);
return false;
}
ret = _q.front();
_q.pop_front();
--_waitings;
pthread_mutex_unlock(&_mutex);
return true;
}
/**
* @brief
*
* @return size_t
* @retval
* @see
* @note
**/
size_t size() const {
return _q.size();
}
void clear() {
_q.clear();
}
private:
pthread_mutex_t _mutex;
pthread_cond_t _cond;
uint32_t _waitings;
std::deque<T> _q;
};
}
#endif //__QUEUE_H_
/* vim: set ts=4 sw=4 sts=4 tw=100 noet: */