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
|
/*
Copyright (C) 2006-2009 Ricardo Pescuma Domenecci
This is free software; you can redistribute it and/or
modify it under the terms of the GNU Library General Public
License as published by the Free Software Foundation; either
version 2 of the License, or (at your option) any later version.
This 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
Library General Public License for more details.
You should have received a copy of the GNU Library General Public
License along with this file; see the file license.txt. If
not, write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
Boston, MA 02111-1307, USA.
*/
#include "ContactAsyncQueue.h"
#include <process.h>
// Itens with higher time at end
static int QueueSortItems(const QueueItem *oldItem, const QueueItem *newItem)
{
if (oldItem->check_time == newItem->check_time)
return -1;
return oldItem->check_time - newItem->check_time;
}
// Itens with higher time at end
static void ContactAsyncQueueThread(void *obj)
{
((ContactAsyncQueue *)obj)->Thread();
}
ContactAsyncQueue::ContactAsyncQueue(pfContactAsyncQueueCallback fContactAsyncQueueCallback, int initialSize)
: queue(30, QueueSortItems)
{
hEvent = CreateEvent(NULL, TRUE, FALSE, NULL);
finished = 0;
callback = fContactAsyncQueueCallback;
InitializeCriticalSection(&cs);
_beginthread(ContactAsyncQueueThread, 0, this);
//mir_forkthread(ContactAsyncQueueThread, this);
}
ContactAsyncQueue::~ContactAsyncQueue()
{
Finish();
int count = 0;
while(finished != 2 && ++count < 50)
Sleep(30);
for (int i = 0; i < queue.getCount(); i++)
if (queue[i] != NULL)
mir_free(queue[i]);
DeleteCriticalSection(&cs);
}
void ContactAsyncQueue::Finish()
{
if (finished == 0)
finished = 1;
SetEvent(hEvent);
}
void ContactAsyncQueue::Lock()
{
EnterCriticalSection(&cs);
}
void ContactAsyncQueue::Release()
{
LeaveCriticalSection(&cs);
}
void ContactAsyncQueue::RemoveAll(HANDLE hContact)
{
Lock();
for (int i = queue.getCount() - 1; i >= 0; --i)
{
QueueItem *item = queue[i];
if (item->hContact == hContact)
{
queue.remove(i);
mir_free(item);
}
}
Release();
}
void ContactAsyncQueue::RemoveAllConsiderParam(HANDLE hContact, void *param)
{
Lock();
for (int i = queue.getCount() - 1; i >= 0; --i)
{
QueueItem *item = queue[i];
if (item->hContact == hContact && item->param == param)
{
queue.remove(i);
mir_free(item);
}
}
Release();
}
void ContactAsyncQueue::Add(int waitTime, HANDLE hContact, void *param)
{
Lock();
InternalAdd(waitTime, hContact, param);
Release();
}
void ContactAsyncQueue::AddIfDontHave(int waitTime, HANDLE hContact, void *param)
{
Lock();
int i;
for (i = queue.getCount() - 1; i >= 0; --i)
if (queue[i]->hContact == hContact)
break;
if (i < 0)
InternalAdd(waitTime, hContact, param);
Release();
}
void ContactAsyncQueue::AddAndRemovePrevious(int waitTime, HANDLE hContact, void *param)
{
Lock();
RemoveAll(hContact);
InternalAdd(waitTime, hContact, param);
Release();
}
void ContactAsyncQueue::AddAndRemovePreviousConsiderParam(int waitTime, HANDLE hContact, void *param)
{
Lock();
RemoveAllConsiderParam(hContact, param);
InternalAdd(waitTime, hContact, param);
Release();
}
void ContactAsyncQueue::InternalAdd(int waitTime, HANDLE hContact, void *param)
{
QueueItem *item = (QueueItem *) mir_alloc(sizeof(QueueItem));
item->hContact = hContact;
item->check_time = GetTickCount() + waitTime;
item->param = param;
queue.insert(item);
SetEvent(hEvent);
}
void ContactAsyncQueue::Thread()
{
while (!finished)
{
ResetEvent(hEvent);
if (finished)
break;
Lock();
if (queue.getCount() <= 0)
{
// No items, so supend thread
Release();
wait(/*INFINITE*/ 2 * 60 * 1000);
}
else
{
// Take a look at first item
QueueItem *qi = queue[0];
int dt = qi->check_time - GetTickCount();
if (dt > 0)
{
// Not time to request yet, wait...
Release();
wait(dt);
}
else
{
// Will request this item
queue.remove(0);
Release();
callback(qi->hContact, qi->param);
mir_free(qi);
}
}
}
finished = 2;
}
void ContactAsyncQueue::wait(int time)
{
if (!finished)
WaitForSingleObject(hEvent, time);
}
|
