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
|
/*
* XMail by Davide Libenzi ( Intranet and Internet mail server )
* Copyright (C) 1999,..,2004 Davide Libenzi
*
* 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
*
* Davide Libenzi <davidel@xmailserver.org>
*
*/
#include "SysInclude.h"
#include "SysDep.h"
#include "SvrDefines.h"
#include "SList.h"
void ListInit(HSLIST &hList)
{
hList = INVALID_SLIST_PTR;
}
void ListAddHead(HSLIST &hList, PLISTLINK pLLink)
{
pLLink->pNext = hList;
hList = pLLink;
}
void ListAddTail(HSLIST &hList, PLISTLINK pLLink)
{
PLISTLINK lpPrev = INVALID_SLIST_PTR, lpCurr = hList;
while (lpCurr != INVALID_SLIST_PTR) {
lpPrev = lpCurr;
lpCurr = lpCurr->pNext;
}
pLLink->pNext = INVALID_SLIST_PTR;
if (lpPrev == INVALID_SLIST_PTR)
hList = pLLink;
else
lpPrev->pNext = pLLink;
}
PLISTLINK ListFirst(HSLIST &hList)
{
return hList;
}
PLISTLINK ListNext(HSLIST &hList, PLISTLINK pLLink)
{
return pLLink->pNext;
}
PLISTLINK ListRemovePtr(HSLIST &hList, PLISTLINK pLLink)
{
PLISTLINK lpPrev = INVALID_SLIST_PTR, lpCurr = hList;
while (lpCurr != INVALID_SLIST_PTR) {
if (lpCurr == pLLink)
break;
lpPrev = lpCurr;
lpCurr = lpCurr->pNext;
}
if (lpCurr == INVALID_SLIST_PTR)
return INVALID_SLIST_PTR;
if (lpPrev == INVALID_SLIST_PTR)
hList = lpCurr->pNext;
else
lpPrev->pNext = lpCurr->pNext;
lpCurr->pNext = INVALID_SLIST_PTR;
return lpCurr;
}
PLISTLINK ListRemove(HSLIST &hList)
{
PLISTLINK lpCurr = hList;
if (lpCurr != INVALID_SLIST_PTR)
hList = lpCurr->pNext, lpCurr->pNext = INVALID_SLIST_PTR;
return lpCurr;
}
void ListPurgeFree(HSLIST &hList)
{
PLISTLINK lpCurr;
while ((lpCurr = ListRemove(hList)) != INVALID_SLIST_PTR)
SysFree(lpCurr);
}
void ListPurge(HSLIST &hList)
{
PLISTLINK lpCurr;
while ((lpCurr = ListRemove(hList)) != INVALID_SLIST_PTR);
}
bool ListIsEmpty(HSLIST &hList)
{
return hList == INVALID_SLIST_PTR;
}
int ListGetCount(HSLIST &hList)
{
int i;
PLISTLINK lpCurr = ListFirst(hList);
for (i = 0; lpCurr != INVALID_SLIST_PTR;
lpCurr = ListNext(hList, lpCurr), i++);
return i;
}
PLISTLINK *ListGetPointers(HSLIST &hList, int &iListCount)
{
iListCount = ListGetCount(hList);
PLISTLINK *pPointers = (PLISTLINK *) SysAlloc((iListCount + 1) * sizeof(PLISTLINK));
if (pPointers != NULL) {
int i;
PLISTLINK lpCurr = ListFirst(hList);
for (i = 0; lpCurr != INVALID_SLIST_PTR; lpCurr = ListNext(hList, lpCurr), i++)
pPointers[i] = lpCurr;
pPointers[i] = INVALID_SLIST_PTR;
}
return pPointers;
}
void ListReleasePointers(PLISTLINK * pPointers)
{
SysFree(pPointers);
}
|
