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
|
/*
Miranda IM: the free IM client for Microsoft* Windows*
Copyright 2000-2003 Miranda ICQ/IM project,
all portions of this codebase are copyrighted to the people
listed in contributors.txt.
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"
#include "m_clc.h"
#include "clc.h"
/* the CLC uses 3 different ways to identify elements in its list, this file
contains routines to convert between them.
1) struct ClcContact/struct ClcGroup pair. Only ever used within the duration
of a single operation, but used at some point in nearly everything
2) index integer. The 0-based number of the item from the top. Only visible
items are counted (ie not closed groups). Used for saving selection and drag
highlight
3) hItem handle. Either the hContact or (hGroup|HCONTACT_ISGROUP). Used
exclusively externally
1->2: GetRowsPriorTo()
1->3: ContactToHItem()
3->1: FindItem()
2->1: GetRowByIndex()
*/
int GetRowsPriorTo(struct ClcGroup *group,struct ClcGroup *subgroup,int contactIndex)
{
int count=0;
group->scanIndex=0;
for (;;) {
if(group->scanIndex==group->cl.count) {
group=group->parent;
if(group==NULL) break;
group->scanIndex++;
continue;
}
if(group==subgroup && contactIndex==group->scanIndex) return count;
count++;
if ((group->cl.items[group->scanIndex]->type==CLCIT_CONTACT) && (group->cl.items[group->scanIndex]->flags & CONTACTF_STATUSMSG)) {
count++;
}
if(group->cl.items[group->scanIndex]->type==CLCIT_GROUP) {
if(group->cl.items[group->scanIndex]->group==subgroup && contactIndex==-1)
return count-1;
if(group->cl.items[group->scanIndex]->group->expanded) {
group=group->cl.items[group->scanIndex]->group;
group->scanIndex=0;
continue;
}
}
if(group->cl.items[group->scanIndex]->type==CLCIT_CONTACT)
{
count+=group->cl.items[group->scanIndex]->SubAllocated*group->cl.items[group->scanIndex]->SubExpanded;
}
group->scanIndex++;
}
return -1;
}
pdisplayNameCacheEntry GetCLCFullCacheEntry(struct ClcData *dat,HANDLE hContact)
{
int idx;
displayNameCacheEntry dnce, *pdnce,*pdnce2;
if (hContact==0) return NULL;
dnce.hContact=hContact;
pdnce=li.List_Find(&dat->lCLCContactsCache,&dnce);
if (pdnce==NULL)
{
pdnce=mir_calloc(sizeof(displayNameCacheEntry));
pdnce->hContact=hContact;
li.List_GetIndex(&dat->lCLCContactsCache,pdnce,&idx);
li.List_Insert(&dat->lCLCContactsCache,pdnce,idx);
pdnce2=li.List_Find(&dat->lCLCContactsCache,&dnce);//for check
if (pdnce2->hContact!=pdnce->hContact)
{
return (NULL);
}
if (pdnce2!=pdnce)
{
return (NULL);
}
}
return (pdnce);
}
void ClearClcContactCache(struct ClcData *dat,HANDLE hContact)
{
pdisplayNameCacheEntry cacheEntry;
if (hContact==INVALID_HANDLE_VALUE)
{
int i,tick;
tick=GetTickCount();
for(i=0;i<(dat->lCLCContactsCache.realCount);i++)
{
pdisplayNameCacheEntry pdnce = dat->lCLCContactsCache.items[i];
pdnce->ClcContact = NULL;
}
tick=GetTickCount()-tick;
{ char buf[256];
sprintf (buf,"Clear full cache %d ms\r\n",tick);
OutputDebugStringA(buf);
}
}
if (!IsHContactGroup(hContact)&&!IsHContactInfo(hContact))
{
cacheEntry=GetCLCFullCacheEntry(dat,hContact);
if (cacheEntry!=NULL)
cacheEntry->ClcContact=NULL;
}
}
void SetClcContactCacheItem(struct ClcData *dat,HANDLE hContact,void *contact)
{
pdisplayNameCacheEntry cacheEntry;
if (!IsHContactGroup(hContact)&&!IsHContactInfo(hContact))
{
cacheEntry=GetCLCFullCacheEntry(dat,hContact);
if (cacheEntry!=NULL)
{
cacheEntry->ClcContact=contact;
}
}
}
int FindItem(HWND hwnd,struct ClcData *dat,HANDLE hItem,struct ClcContact **contact,struct ClcGroup **subgroup,int *isVisible)
{
int index=0, i;
int nowVisible=1;
struct ClcGroup *group=&dat->list;
group->scanIndex=0;
if (isVisible==NULL&&hItem!=NULL&&subgroup==NULL&&!IsHContactGroup(hItem)&&!IsHContactInfo(hItem))
{
//try use cache
pdisplayNameCacheEntry cacheEntry;
cacheEntry=GetCLCFullCacheEntry(dat,hItem);
if (cacheEntry!=NULL)
{
if (cacheEntry->ClcContact==NULL)
{
int *isv={0};
void *z={0};
int ret;
ret=FindItem(hwnd,dat,hItem,(struct ClcContact ** )&z,(struct ClcGroup** )&isv,NULL);
if (ret=0) {return (0);}
cacheEntry->ClcContact=(void *)z;
}
if (cacheEntry->ClcContact!=NULL)
{
if (contact!=NULL)
*contact=(struct ClcContact *)cacheEntry->ClcContact;
{
/*
void *p={0}
int *isv={0}
int ret;
ret=FindItem(hwnd,dat,hItem,&p,&isv,NULL);
if (ret=0) {return (0);}
if (p!=cacheEntry->ClcContact)
{
MessageBox(0,"hITEM FAILEDDDDDDDD!!!!!","",0);
//cacheEntry->ClcContact=p;
}
*/
}
return 1;
}
}
}
group=&dat->list;
for (;;) {
if(group->scanIndex==group->cl.count) {
struct ClcGroup *tgroup;
group=group->parent;
if(group==NULL) break;
nowVisible=1;
for(tgroup=group;tgroup;tgroup=tgroup->parent)
if (!group->expanded) {nowVisible=0; break;}
group->scanIndex++;
continue;
}
if(nowVisible) index++;
if ((IsHContactGroup(hItem) && group->cl.items[group->scanIndex]->type==CLCIT_GROUP && ((UINT_PTR)hItem&~HCONTACT_ISGROUP)==group->cl.items[group->scanIndex]->groupId) ||
(IsHContactContact(hItem) && group->cl.items[group->scanIndex]->type==CLCIT_CONTACT && group->cl.items[group->scanIndex]->hContact==hItem) ||
(IsHContactInfo(hItem) && group->cl.items[group->scanIndex]->type==CLCIT_INFO && group->cl.items[group->scanIndex]->hContact==(HANDLE)((UINT_PTR)hItem&~HCONTACT_ISINFO))) {
if(isVisible) {
if (!nowVisible) *isVisible=0;
else {
if ((index+1)*dat->rowHeight<dat->yScroll) *isVisible=0;
else {
RECT clRect;
GetClientRect(hwnd,&clRect);
if(index*dat->rowHeight>=dat->yScroll+clRect.bottom) *isVisible=0;
else *isVisible=1;
} } }
if(contact) *contact=group->cl.items[group->scanIndex];
if(subgroup) *subgroup=group;
return 1;
}
if (group->cl.items[group->scanIndex]->type==CLCIT_CONTACT &&
group->cl.items[group->scanIndex]->SubAllocated>0)
for (i=1; i<=group->cl.items[group->scanIndex]->SubAllocated; i++)
if (IsHContactContact(hItem) && group->cl.items[group->scanIndex]->subcontacts[i-1].hContact==hItem)
{
if(contact) *contact=&group->cl.items[group->scanIndex]->subcontacts[i-1];
if(subgroup) *subgroup=group;
return 1;
}
if(group->cl.items[group->scanIndex]->type==CLCIT_GROUP) {
struct ClcGroup* save = group;
group=group->cl.items[group->scanIndex]->group;
group->scanIndex=0;
nowVisible&=group->expanded;
continue;
}
group->scanIndex++;
}
return 0;
}
#define CacheArrSize 255
struct ClcGroup *CacheIndex[CacheArrSize]={NULL};
boolean CacheIndexClear=TRUE;
void ClearRowByIndexCache()
{
if (!CacheIndexClear)
{
memset(CacheIndex,0,sizeof(CacheIndex));
CacheIndexClear=TRUE;
}
}
int GetRowByIndex(struct ClcData *dat,int testindex,struct ClcContact **contact,struct ClcGroup **subgroup)
{
int index=0,i;
struct ClcGroup *group=&dat->list;
if (testindex<0) return (-1);
// if (FALSE&&(testindex>0)&&testindex<CacheArrSize&&CacheIndex[testindex]!=NULL)
// {
// if(contact) *contact=&(CacheIndex[testindex])->cl.items[group->scanIndex];
// if(subgroup) *subgroup=(CacheIndex[testindex]);
// return (testindex);
// }else
{
group->scanIndex=0;
for (;;) {
if(group->scanIndex==group->cl.count) {
group=group->parent;
if(group==NULL) break;
group->scanIndex++;
continue;
}
if ((index>0) && (index<CacheArrSize))
{
CacheIndex[index]=group;
CacheIndexClear=FALSE;
}
if(testindex==index) {
if(contact) *contact = group->cl.items[group->scanIndex];
if(subgroup) *subgroup = group;
return index;
}
if (group->cl.items[group->scanIndex]->type==CLCIT_CONTACT)
if (group->cl.items[group->scanIndex]->SubAllocated)
if (group->cl.items[group->scanIndex]->SubExpanded)
{
for (i=0;i<group->cl.items[group->scanIndex]->SubAllocated;i++)
{
if ((index>0) && (index<CacheArrSize))
{
CacheIndex[index]=group;
CacheIndexClear=FALSE;
}
index++;
if(testindex==index) {
if(contact) *contact=&group->cl.items[group->scanIndex]->subcontacts[i];
if(subgroup) *subgroup=group;
return index;
}
}
}
index++;
if ((group->cl.items[group->scanIndex]->type==CLCIT_CONTACT) && (group->cl.items[group->scanIndex]->flags & CONTACTF_STATUSMSG)) {
index++;
}
if(group->cl.items[group->scanIndex]->type==CLCIT_GROUP && group->cl.items[group->scanIndex]->group->expanded) {
group=group->cl.items[group->scanIndex]->group;
group->scanIndex=0;
continue;
}
group->scanIndex++;
}
}
return -1;
}
|
