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
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
|
/*
Copyright ©2006 Ricardo Pescuma Domenecci
Modified ©2008-2010 DeathAxe, Yasnovidyashii, Merlin, K. Romanov, Kreol
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., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
#include "commonheaders.h"
/**
* This static helper function is used to sort the queue items by time
* beginning with the next upcoming item to call the Callback for.
*
* @param i1 - the first queue item
* @param i2 - the second queue item
*
* @return The function returns the time slack between the two items.
**/
static int QueueSortItems(const CQueueItem *i1, const CQueueItem *i2)
{
int rc = i1->check_time - i2->check_time;
if (!rc)
{
rc = i1->hContact != i2->hContact;
}
return rc;
}
/**
*
*
**/
CContactQueue::CContactQueue(int initialSize)
: _queue(initialSize, QueueSortItems)
{
_hEvent = CreateEvent(NULL, TRUE, FALSE, NULL);
_status = RUNNING;
mir_forkthread((pThreadFunc)CContactQueue::ThreadProc, this);
}
/**
*
*
**/
CContactQueue::~CContactQueue()
{
if (_status == RUNNING)
{
_status = STOPPING;
}
SetEvent(_hEvent);
for (int count = 0; _status != STOPPED && ++count < 50;)
{
Sleep(10);
}
for (int i = 0; i < _queue.getCount(); i++)
{
mir_free(_queue[i]);
}
CloseHandle(_hEvent);
}
/**
* This function removes all queue items.
*
* @param none
*
* @return nothing
**/
void CContactQueue::RemoveAll()
{
mir_cslock lck(_cs);
for (int i = _queue.getCount() - 1; i >= 0; --i)
mir_free(_queue[i]);
_queue.destroy();
}
/**
* This function removes all queue items for the hContact.
*
* @param hContact - the contact whose queue items to delete
*
* @return nothing
**/
void CContactQueue::RemoveAll(MCONTACT hContact)
{
mir_cslock lck(_cs);
for (int i = _queue.getCount() - 1; i >= 0; --i)
{
CQueueItem *qi = _queue[i];
if (qi->hContact == hContact)
{
_queue.remove(i);
mir_free(qi);
}
}
}
/**
* This function removes all queue items for the hContact considering the correct parameter.
*
* @param hContact - the contact whose queue items to delete
* @param param - a caller defined parameter passed to the callback function
*
* @return nothing
**/
void CContactQueue::RemoveAllConsiderParam(MCONTACT hContact, PVOID param)
{
mir_cslock lck(_cs);
for (int i = _queue.getCount() - 1; i >= 0; --i)
{
CQueueItem *qi = _queue[i];
if (qi->hContact == hContact && qi->param == param)
{
_queue.remove(i);
mir_free(qi);
}
}
}
/**
* This method adds the desired new item.
*
* @param waitTime - the time to wait until the callback is desired to run
* @param hContact - the contact to perform the action for
* @param param - a caller defined parameter passed to the callback function
*
* @retval TRUE - The item is added to the queue successfully.
* @retval FALSE - The item is not added to the queue.
**/
BOOL CContactQueue::Add(int waitTime, MCONTACT hContact, PVOID param)
{
BOOL rc;
mir_cslock lck(_cs);
rc = InternalAdd(waitTime, hContact, param);
return rc;
}
/**
* This method adds the desired new item only, if the queue does not yet contain
* an item for the contact.
*
* @param waitTime - the time to wait until the callback is desired to run
* @param hContact - the contact to perform the action for
* @param param - a caller defined parameter passed to the callback function
*
* @retval TRUE - The item is added to the queue successfully.
* @retval FALSE - The item is not added to the queue.
**/
BOOL CContactQueue::AddIfDontHave(int waitTime, MCONTACT hContact, PVOID param)
{
int i;
BOOL rc;
mir_cslock lck(_cs);
for (i = _queue.getCount() - 1; i >= 0; --i)
{
if (_queue[i]->hContact == hContact)
{
break;
}
}
rc = (i == -1) ? InternalAdd(waitTime, hContact, param) : 0;
return rc;
}
/**
* This method removes all existing queue items for the contact and adds a new queue item
* for the given contact. This method might be used to move an existing entry,
* whose check_time has changed.
*
* @param waitTime - the time to wait until the callback is desired to run
* @param hContact - the contact to perform the action for
* @param param - a caller defined parameter passed to the callback function
*
* @retval TRUE - The item is added to the queue successfully.
* @retval FALSE - The item is not added to the queue.
**/
BOOL CContactQueue::AddUnique(int waitTime, MCONTACT hContact, PVOID param)
{
BOOL rc;
mir_cslock lck(_cs);
RemoveAll(hContact);
rc = InternalAdd(waitTime, hContact, param);
return rc;
}
/**
* This method removes all existing queue items for the contact with the same parameter as @e param
* and adds a new queue item for the given contact. This method might be used to move an existing
* entry, whose check_time has changed.
*
* @param waitTime - the time to wait until the callback is desired to run
* @param hContact - the contact to perform the action for
* @param param - a caller defined parameter passed to the callback function
*
* @retval TRUE - The item is added to the queue successfully.
* @retval FALSE - The item is not added to the queue.
**/
BOOL CContactQueue::AddUniqueConsiderParam(int waitTime, MCONTACT hContact, PVOID param)
{
BOOL rc;
mir_cslock lck(_cs);
RemoveAllConsiderParam(hContact, param);
rc = InternalAdd(waitTime, hContact, param);
return rc;
}
/**
* This member function really adds an item into the time sorted queue list.
*
* @param waitTime - the time to wait until the callback is desired to run
* @param hContact - the contact to perform the action for
* @param param - a caller defined parameter passed to the callback function
*
* @retval TRUE - The item is added to the queue successfully.
* @retval FALSE - The item is not added to the queue.
**/
BOOL CContactQueue::InternalAdd(int waitTime, MCONTACT hContact, PVOID param)
{
BOOL rc;
CQueueItem *qi = (CQueueItem *) mir_alloc(sizeof(CQueueItem));
qi->hContact = hContact;
qi->check_time = GetTickCount() + waitTime;
qi->param = param;
rc = _queue.insert(qi);
if (!rc)
{
mir_free(qi);
}
SetEvent(_hEvent);
return rc;
}
/**
* This is the real thread callback function. As long as _status
* is set to RUNNING it looks for items in the queue to perform
* the _pfnCallback function on them. If the queue is empty or the
* next upcoming item is located in the future, the thread is suspended
* in the meanwhile.
*
* @param none
*
* @return nothing
**/
void CContactQueue::Thread()
{
while (_status == RUNNING)
{
ResetEvent(_hEvent);
mir_cslock lck(_cs);
if (_queue.getCount() <= 0)
{
// can be used by a derivant
OnEmpty();
Suspend(INFINITE);
}
else
{
// Take a look at first queue item
CQueueItem *qi = _queue[0];
int dt = qi->check_time - GetTickCount();
if (dt > 0)
{
Suspend(dt);
}
else
{
// Will request this queue item
_queue.remove(0);
Callback(qi->hContact, qi->param);
mir_free(qi);
}
}
}
_status = STOPPED;
}
/**
* This method suspends the worker thread for the given ammount of time.
*
* @param time - milliseconds to suspend the thread for
*
* @return nothing
**/
void CContactQueue::Suspend(int time) const
{
if (_status == RUNNING)
{
WaitForSingleObject(_hEvent, time);
}
}
/**
* This method resumes the worker thread and immitiatly goes on with the next entry.
*
* @param none
*
* @return nothing
**/
void CContactQueue::ContinueWithNext()
{
if (_status == RUNNING)
{
int i, c, dt;
mir_cslock lck(_cs);
c = _queue.getCount();
if (c > 0)
{
dt = _queue[0]->check_time - GetTickCount() - 3000;
if (dt > 0)
{
for (i = 0; i < c; i++)
{
_queue[i]->check_time -= dt;
}
}
}
SetEvent(_hEvent);
}
}
|