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
|
/*
* Copyright (C) 2010-2014 Hendrik Leppkes
* http://www.1f0.de
*
* 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, write to the Free Software Foundation, Inc.,
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
#include "stdafx.h"
#include "PacketQueue.h"
// Queue a new packet at the end of the list
void CPacketQueue::Queue(Packet *pPacket)
{
CAutoLock cAutoLock(this);
if (pPacket)
m_dataSize += pPacket->GetDataSize();
m_queue.push_back(pPacket);
#ifdef DEBUG
if (m_queue.size() > MAX_PACKETS_IN_QUEUE && !m_bWarnedFull) {
DbgLog((LOG_TRACE, 20, L"CPacketQueue::Queue() - Queue is Full (%d elements)", m_queue.size()));
m_bWarnedFull = true;
} else if (m_queue.size() > 10*MAX_PACKETS_IN_QUEUE && !m_bWarnedExtreme) {
DbgLog((LOG_TRACE, 20, L"CPacketQueue::Queue() - Queue is Extremely Full (%d elements)", m_queue.size()));
m_bWarnedExtreme = true;
} else if (m_queue.size() < MAX_PACKETS_IN_QUEUE/2) {
m_bWarnedFull = m_bWarnedExtreme = false;
}
#endif
}
// Get a packet from the beginning of the list
Packet *CPacketQueue::Get()
{
CAutoLock cAutoLock(this);
if (m_queue.size() == 0) {
return nullptr;
}
Packet *pPacket = m_queue.front();
m_queue.pop_front();
if (pPacket)
m_dataSize -= pPacket->GetDataSize();
return pPacket;
}
// Get the size of the queue
size_t CPacketQueue::Size()
{
CAutoLock cAutoLock(this);
return m_queue.size();
}
// Get the size of the queue
size_t CPacketQueue::DataSize()
{
CAutoLock cAutoLock(this);
return m_dataSize;
}
// Clear the List (all elements are free'ed)
void CPacketQueue::Clear()
{
CAutoLock cAutoLock(this);
DbgLog((LOG_TRACE, 10, L"CPacketQueue::Clear() - clearing queue with %d entries", m_queue.size()));
std::deque<Packet *>::iterator it;
for (it = m_queue.begin(); it != m_queue.end(); ++it) {
delete *it;
}
m_queue.clear();
m_dataSize = 0;
}
|
