Repository navigation
Expand file tree
/
Copy pathP2PeerMsgQue.cpp
More file actions
261 lines (231 loc) · 6.03 KB
/
Copy pathP2PeerMsgQue.cpp
File metadata and controls
261 lines (231 loc) · 6.03 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
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
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
// Copyright © 2002-2009, 2026 Ivyware Pty Ltd, Khrustal & Mann
// MELBOURNE, VICTORIA, AUSTRALIA, 3000
//
// 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
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// 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.
//
// Description: P2PeerMsgQue implementation
// NOTES: Optimised for queues of P2PeerMsg's
//
#include "stdafx.h"
#include "Kernel32_Ext.h"
#include "P2PeerMsgQue.h"
///////////////////////////////////////////////////////////////////////
// Constructors and destructor
//
// Constructor and destructor
//
//
// Parameters: HANDLE hNotnEvent
// Event issued whenever P2PeerMsg is appended to
// queue.
//
P2PeerMsgQue::P2PeerMsgQue ( HANDLE hNotnEvent )
{
// Firstly
RenderQueSafe();
// Persist
m_hNotnEvent = hNotnEvent;
}
P2PeerMsgQue::~P2PeerMsgQue ( )
{
// Garbage collection
Flush();
DeleteCriticalSection ( &m_oCSectionQue );
}
void
P2PeerMsgQue::RenderQueSafe ( )
{
// Attributes
m_hNotnEvent = 0;
m_hThreadPump = 0;
// Resources
InitializeCriticalSection ( &m_oCSectionQue );
}
///////////////////////////////////////////////////////////////////////
// Operations
//
// Appends passed P2PeerMsg to P2PeerMsgQue
// NOTES: Client should use the referenced version if control over
// message life cycle is to be retained.
// : Queue assumes control over life cycle of passed P2PeerMsg
//
//
// Parameters: P2PeerMsg *pMsg
// Message to be appended
//
// Returns: P2PeerMsg*
// 0.. Message appended to queue
//
P2PeerMsg*
P2PeerMsgQue::Append ( P2PeerMsg *pMsg )
{
// Isolation
P2PsafeCS oSafeCS = m_oCSectionQue;
// Observe priority
ASSERT(::AfxIsValidAddress(pMsg,sizeof(P2PeerMsg)));
//ASSERT(pMsg->Type());//DELETE-ME
if ( m_oCListP2PeerMsg.GetCount() > 1 )
{
POSITION pos = m_oCListP2PeerMsg.GetTailPosition();
while ( pos )
{
if ( m_oCListP2PeerMsg.GetAt(pos)->Priority()
> pMsg->Priority() )
{
m_oCListP2PeerMsg.GetPrev (pos);
continue;
}
m_oCListP2PeerMsg.InsertAfter ( pos, pMsg );
pMsg = 0;
break;
};
if ( pMsg )
m_oCListP2PeerMsg.AddHead ( pMsg );
pMsg = 0;
}
else
m_oCListP2PeerMsg.AddTail ( pMsg );
// Perform notification
if ( m_hNotnEvent )
SetEvent ( m_hNotnEvent );
// Finally
return (P2PeerMsg *)0;
}
//
// Description: Pre-pends passed P2PeerMsg to queue.
// NOTES: Client should use the referenced version
// if control over message life cycle is to
// be retained.
//
//
// Parameters: P2PeerMsg *pMsg
// Message to be pre-appended
// NOTES: Queue assumes control over object life
// cycle
//
// Returns: P2PeerMsg*
// Message queued flag
//
P2PeerMsg*
P2PeerMsgQue::Preppend ( P2PeerMsg *pMsg )
{
// Isolation
P2PsafeCS oSafeCS = m_oCSectionQue;
// Add to head by default
if ( pMsg )
m_oCListP2PeerMsg.AddHead ( pMsg );
// Perform notification
if ( m_hNotnEvent )
SetEvent ( m_hNotnEvent );
// Finally
return (P2PeerMsg *)0;
}
//
// Description: Appends passed P2PeerMsg to queue.
// NOTES: Client should use the pointer version
// of control over message if life cycle is
// to be conceeded.
//
//
// Parameters: P2PeerMsg& rMsg
// Message to be appended
// NOTES: Queue makes a copy
//
//
// Returns: int
// Queued message count
//
INT_PTR
P2PeerMsgQue::Append ( P2PeerMsg& oMsg )
{
// Delegation with copy
Append ( new P2PeerMsg(oMsg) );
return GetCount();
}
//
// Description: Removes next highest priority message from
// queue.
// NOTES: Client assumes responsibility for life
// cycle of retrieved P2PeerMsg
//
//
// Returns: P2PeerMsg*
// Retrieved message
// 0.. No entries on the queue
//
P2PeerMsg*
P2PeerMsgQue::Remove ( )
{
// Isolation
P2PsafeCS oSafeCS = m_oCSectionQue;
// To be sure, to be sure
if ( m_oCListP2PeerMsg.GetCount() <= 0 )
return 0;
// Then simply
return m_oCListP2PeerMsg.RemoveHead ();
}
///////////////////////////////////////////////////////////////////////
// Utilities
//
// Description: Flushes queue contents
//
void
P2PeerMsgQue::Flush ( )
{
// Isolation
P2PsafeCS oSafeCS = m_oCSectionQue;
// Simply delete all entries
while ( m_oCListP2PeerMsg.GetCount() > 0 )
delete m_oCListP2PeerMsg.RemoveHead();
}
///////////////////////////////////////////////////////////////////////
// Property management
//
// Queued entries count
//
// Returns: int
// Number of queued entries
INT_PTR
P2PeerMsgQue::GetCount ( )
{
// Delegate
return m_oCListP2PeerMsg.GetCount();
}
//
// Summarizes queued entries status
//
// Returns: bool
// Queued entries summary
// true... Entries exist
// false.. Empty
bool
P2PeerMsgQue::IsEmpty ( )
{
// Delegate
return m_oCListP2PeerMsg.IsEmpty() ? true : false;
}
//
// Description: Exposes P2PeerMsgQue notification event
// NOTES: This event is raised every time an entry
// is added to the queue
//
//
// Returns: HANDLE
// Allocated P2PeerMsgQue event
//
HANDLE
P2PeerMsgQue::GetEvent ( )
{
// Simply
return m_hNotnEvent;
}