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
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
|
/*
Jabber Protocol Plugin for Miranda IM
Copyright ( C ) 2002-04 Santithorn Bunchua
Copyright ( C ) 2005-12 George Hazan
Copyright ( C ) 2007 Maxim Mluhov
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.
*/
#ifndef _JABBER_PRIVACY_H_
#define _JABBER_PRIVACY_H_
#define JABBER_PL_RULE_TYPE_MESSAGE 1
#define JABBER_PL_RULE_TYPE_PRESENCE_IN 2
#define JABBER_PL_RULE_TYPE_PRESENCE_OUT 4
#define JABBER_PL_RULE_TYPE_IQ 8
#define JABBER_PL_RULE_TYPE_ALL 0x0F
enum PrivacyListRuleType
{
Jid,
Group,
Subscription,
Else
};
struct CPrivacyListModifyUserParam
{
BOOL m_bAllOk;
volatile LONG m_dwCount;
CPrivacyListModifyUserParam() :
m_bAllOk( TRUE ),
m_dwCount( 0 )
{
}
};
class CPrivacyList;
class CPrivacyListRule
{
protected:
friend class CPrivacyList;
public:
CPrivacyListRule( CJabberProto* ppro, PrivacyListRuleType type = Else, const TCHAR *szValue = _T(""), BOOL bAction = TRUE, DWORD dwOrder = 90, DWORD dwPackets = 0)
{
m_proto = ppro;
m_szValue = mir_tstrdup(szValue);
m_nType = type;
m_bAction = bAction;
m_dwOrder = dwOrder;
m_dwPackets = dwPackets;
m_pNext = NULL;
};
~CPrivacyListRule()
{
if (m_szValue)
mir_free(m_szValue);
if (m_pNext)
delete m_pNext;
};
__inline CPrivacyListRule* GetNext()
{
return m_pNext;
}
CPrivacyListRule* SetNext(CPrivacyListRule *pNext)
{
CPrivacyListRule *pRetVal = m_pNext;
m_pNext = pNext;
return pRetVal;
}
__inline DWORD GetOrder()
{
return m_dwOrder;
}
DWORD SetOrder(DWORD dwOrder)
{
DWORD dwRetVal = m_dwOrder;
m_dwOrder = dwOrder;
return dwRetVal;
}
__inline PrivacyListRuleType GetType()
{
return m_nType;
}
__inline BOOL SetType( PrivacyListRuleType type )
{
m_nType = type;
return TRUE;
}
__inline TCHAR* GetValue()
{
return m_szValue;
}
__inline BOOL SetValue( TCHAR *szValue )
{
replaceStrT( m_szValue, szValue );
return TRUE;
}
__inline DWORD GetPackets()
{
return m_dwPackets;
}
__inline BOOL SetPackets( DWORD dwPackets )
{
m_dwPackets = dwPackets;
return TRUE;
}
__inline BOOL GetAction()
{
return m_bAction;
}
__inline BOOL SetAction( BOOL bAction )
{
m_bAction = bAction;
return TRUE;
}
CJabberProto* m_proto;
protected:
PrivacyListRuleType m_nType;
TCHAR *m_szValue;
BOOL m_bAction;
DWORD m_dwOrder;
DWORD m_dwPackets;
CPrivacyListRule *m_pNext;
};
class CPrivacyList;
class CPrivacyList
{
protected:
CPrivacyListRule *m_pRules;
TCHAR *m_szListName;
CPrivacyList *m_pNext;
BOOL m_bLoaded;
BOOL m_bModified;
BOOL m_bDeleted;
public:
CJabberProto* m_proto;
CPrivacyList(CJabberProto* ppro, TCHAR *szListName)
{
m_proto = ppro;
m_szListName = mir_tstrdup(szListName);
m_pRules = NULL;
m_pNext = NULL;
m_bLoaded = FALSE;
m_bModified = FALSE;
m_bDeleted = FALSE;
};
~CPrivacyList()
{
if (m_szListName)
mir_free(m_szListName);
RemoveAllRules();
if (m_pNext)
delete m_pNext;
};
BOOL RemoveAllRules()
{
if (m_pRules)
delete m_pRules;
m_pRules = NULL;
return TRUE;
}
__inline TCHAR* GetListName()
{
return m_szListName;
}
__inline CPrivacyListRule* GetFirstRule()
{
return m_pRules;
}
__inline CPrivacyList* GetNext()
{
return m_pNext;
}
CPrivacyList* SetNext(CPrivacyList *pNext)
{
CPrivacyList *pRetVal = m_pNext;
m_pNext = pNext;
return pRetVal;
}
BOOL AddRule(PrivacyListRuleType type, const TCHAR *szValue, BOOL bAction, DWORD dwOrder, DWORD dwPackets)
{
CPrivacyListRule *pRule = new CPrivacyListRule( m_proto, type, szValue, bAction, dwOrder, dwPackets );
if ( !pRule )
return FALSE;
pRule->SetNext( m_pRules );
m_pRules = pRule;
return TRUE;
}
BOOL AddRule(CPrivacyListRule *pRule)
{
pRule->SetNext( m_pRules );
m_pRules = pRule;
return TRUE;
}
BOOL RemoveRule(CPrivacyListRule *pRuleToRemove)
{
if ( !m_pRules )
return FALSE;
if ( m_pRules == pRuleToRemove ) {
m_pRules = m_pRules->GetNext();
pRuleToRemove->SetNext( NULL );
delete pRuleToRemove;
return TRUE;
}
CPrivacyListRule *pRule = m_pRules;
while ( pRule->GetNext()) {
if ( pRule->GetNext() == pRuleToRemove ) {
pRule->SetNext( pRule->GetNext()->GetNext());
pRuleToRemove->SetNext( NULL );
delete pRuleToRemove;
return TRUE;
}
pRule = pRule->GetNext();
}
return FALSE;
}
BOOL Reorder()
{
// 0 or 1 rules?
if ( !m_pRules )
return TRUE;
if ( !m_pRules->GetNext()) {
m_pRules->SetOrder( 100 );
return TRUE;
}
// get rules count
DWORD dwCount = 0;
CPrivacyListRule *pRule = m_pRules;
while ( pRule ) {
dwCount++;
pRule = pRule->GetNext();
}
// create pointer array for sort procedure
CPrivacyListRule **pRules = ( CPrivacyListRule ** )mir_alloc( dwCount * sizeof( CPrivacyListRule * ));
if ( !pRules )
return FALSE;
DWORD dwPos = 0;
pRule = m_pRules;
while ( pRule ) {
pRules[dwPos++] = pRule;
pRule = pRule->GetNext();
}
// sort array of pointers, slow, but working :)
DWORD i, j;
CPrivacyListRule *pTmp;
for ( i = 0; i < dwCount; i++ ) {
for ( j = dwCount - 1; j > i; j-- ) {
if ( pRules[j - 1]->GetOrder() > pRules[j]->GetOrder()) {
pTmp = pRules[j - 1];
pRules[j - 1] = pRules[j];
pRules[j] = pTmp;
}
}
}
// reorder linked list
DWORD dwOrder = 100;
CPrivacyListRule **ppPtr = &m_pRules;
for ( i = 0; i < dwCount; i++ ) {
*ppPtr = pRules[ i ];
ppPtr = &pRules[ i ]->m_pNext;
pRules[ i ]->SetOrder( dwOrder );
dwOrder += 10;
}
*ppPtr = NULL;
mir_free( pRules );
return TRUE;
}
__inline void SetLoaded(BOOL bLoaded = TRUE)
{
m_bLoaded = bLoaded;
}
__inline BOOL IsLoaded()
{
return m_bLoaded;
}
__inline void SetModified(BOOL bModified = TRUE)
{
m_bModified = bModified;
}
__inline BOOL IsModified()
{
return m_bModified;
}
__inline void SetDeleted(BOOL bDeleted = TRUE)
{
m_bDeleted = bDeleted;
}
__inline BOOL IsDeleted()
{
return m_bDeleted;
}
};
class CPrivacyListManager
{
protected:
TCHAR *m_szActiveListName;
TCHAR *m_szDefaultListName;
CPrivacyList *m_pLists;
CRITICAL_SECTION m_cs;
BOOL m_bModified;
public:
CJabberProto* m_proto;
CPrivacyListManager( CJabberProto* ppro )
{
m_proto = ppro;
m_szActiveListName = NULL;
m_szDefaultListName = NULL;
m_pLists = NULL;
InitializeCriticalSection(&m_cs);
m_bModified = FALSE;
};
~CPrivacyListManager()
{
if (m_szActiveListName)
mir_free(m_szActiveListName);
if (m_szDefaultListName)
mir_free(m_szDefaultListName);
RemoveAllLists();
DeleteCriticalSection(&m_cs);
};
BOOL Lock()
{
EnterCriticalSection(&m_cs);
return TRUE;
}
BOOL Unlock()
{
LeaveCriticalSection(&m_cs);
return TRUE;
}
void SetActiveListName(const TCHAR *szListName)
{
replaceStrT(m_szActiveListName, szListName);
}
void SetDefaultListName(const TCHAR *szListName)
{
replaceStrT(m_szDefaultListName, szListName);
}
TCHAR* GetDefaultListName()
{
return m_szDefaultListName;
}
TCHAR* GetActiveListName()
{
return m_szActiveListName;
}
BOOL RemoveAllLists()
{
if (m_pLists)
delete m_pLists;
m_pLists = NULL;
return TRUE;
}
CPrivacyList* FindList( const TCHAR *szListName )
{
CPrivacyList *pList = m_pLists;
while ( pList ) {
if ( !_tcscmp(pList->GetListName(), szListName ))
return pList;
pList = pList->GetNext();
}
return NULL;
}
CPrivacyList* GetFirstList()
{
return m_pLists;
}
BOOL AddList( TCHAR *szListName )
{
if (FindList(szListName))
return FALSE;
CPrivacyList *pList = new CPrivacyList( m_proto, szListName );
pList->SetNext( m_pLists );
m_pLists = pList;
return TRUE;
}
BOOL SetModified(BOOL bModified = TRUE)
{
m_bModified = bModified;
return TRUE;
}
BOOL IsModified()
{
if ( m_bModified )
return TRUE;
CPrivacyList *pList = m_pLists;
while ( pList ) {
if ( pList->IsModified())
return TRUE;
pList = pList->GetNext();
}
return FALSE;
}
BOOL IsAllListsLoaded()
{
CPrivacyList *pList = m_pLists;
while ( pList ) {
if ( !pList->IsLoaded())
return FALSE;
pList = pList->GetNext();
}
return TRUE;
}
};
#endif //_JABBER_PRIVACY_H_
|