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
|
/*
* Copyright (c) 2007, Technische Universitaet Berlin
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* - Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* - Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* - Neither the name of the Technische Universitaet Berlin nor the names
* of its contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
* TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
* OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE
* USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
/**
* @author Philipp Huppertz <huppertz@tkn.tu-berlin.de>
*/
#include "packetbuffer.h"
#include "pthread.h"
#include <algorithm>
PacketBuffer::PacketBuffer()
{
pthread_mutex_init(&buffer.lock, NULL);
pthread_cond_init(&buffer.notempty, NULL);
pthread_cond_init(&buffer.notfull, NULL);
}
PacketBuffer::~PacketBuffer()
{
pthread_cond_destroy(&buffer.notempty);
pthread_cond_destroy(&buffer.notfull);
pthread_mutex_destroy(&buffer.lock);
}
// clears the buffer
void PacketBuffer::clear() {
pthread_testcancel();
pthread_mutex_lock(&buffer.lock);
// clear
buffer.container.clear();
DEBUG("PacketBuffer::clear : cleared buffer and signal <notfull>")
pthread_cond_signal(&buffer.notfull);
pthread_mutex_unlock(&buffer.lock);
}
// gets a packet from the buffer (NULL = buffer empty)
SFPacket PacketBuffer::dequeue()
{
SFPacket packet;
pthread_testcancel();
pthread_cleanup_push((void(*)(void*)) pthread_mutex_unlock, (void *) &buffer.lock);
pthread_mutex_lock(&buffer.lock);
// wait until buffer is _not_ empty
while(buffer.container.size() == 0)
{
DEBUG("PacketBuffer::dequeue : waiting until buffer is <notempty>")
pthread_cond_wait(&buffer.notempty, &buffer.lock);
}
// dequeue
packet = buffer.container.front();
buffer.container.pop_front();
DEBUG("PacketBuffer::dequeue : get from buffer and signal <notfull>")
pthread_cond_signal(&buffer.notfull);
pthread_cleanup_pop(1);
return packet;
}
// puts a packet into buffer... (SUCCESS = true)
bool PacketBuffer::enqueueFront(SFPacket &pPacket)
{
pthread_testcancel();
pthread_cleanup_push((void(*)(void*)) pthread_mutex_unlock, (void *) &buffer.lock);
pthread_mutex_lock(&buffer.lock);
// wait until buffer is _not_ full
while(buffer.container.size() >= cMaxBufferSize)
{
DEBUG("PacketBuffer::enqueueFront : waiting until buffer is <notfull>")
pthread_cond_wait(&buffer.notfull, &buffer.lock);
}
// enqueue
buffer.container.push_front(pPacket);
DEBUG("PacketBuffer::enqueueFront : put in buffer and signal <notempty>")
// signal that buffer is now not empty
pthread_cond_signal(&buffer.notempty);
pthread_cleanup_pop(1);
return true;
}
// puts a packet into buffer... (SUCCESS = true)
bool PacketBuffer::enqueueBack(SFPacket &pPacket)
{
pthread_testcancel();
pthread_cleanup_push((void(*)(void*)) pthread_mutex_unlock, (void *) &buffer.lock);
pthread_mutex_lock(&buffer.lock);
// wait until buffer is _not_ full
while(buffer.container.size() >= cMaxBufferSize)
{
DEBUG("PacketBuffer::enqueueBack : waiting until buffer is <notfull>")
pthread_cond_wait(&buffer.notfull, &buffer.lock);
}
// enqueue
buffer.container.push_back(pPacket);
DEBUG("PacketBuffer::enqueueBack : put in buffer and signal <notempty>")
// signal that buffer is now not empty
pthread_cond_signal(&buffer.notempty);
pthread_cleanup_pop(1);
return true;
}
/* checks if packet buffer is full */
bool PacketBuffer::isFull() {
bool isFull = true;
pthread_testcancel();
pthread_mutex_lock(&buffer.lock);
if (buffer.container.size() < cMaxBufferSize) {
isFull = false;
}
pthread_mutex_unlock(&buffer.lock);
return isFull;
}
/* checks if packet buffer is empty */
bool PacketBuffer::isEmpty() {
bool isEmpty = true;
pthread_testcancel();
pthread_mutex_lock(&buffer.lock);
if (buffer.container.size() > 0) {
isEmpty = false;
}
pthread_mutex_unlock(&buffer.lock);
return isEmpty;
}
/* checks if pPacket is in queue */
bool PacketBuffer::isInQueue(SFPacket &pPacket)
{
bool result = false;
DEBUG("PacketBuffer::isInQueue : lock")
pthread_testcancel();
pthread_mutex_lock(&buffer.lock);
container_t::const_iterator it = find(buffer.container.begin(), buffer.container.end(), pPacket);
if( it != buffer.container.end() )
{
result = true;
}
pthread_mutex_unlock(&buffer.lock);
DEBUG("PacketBuffer::isInQueue : unlock")
return result;
}
|
