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
|
//Copyright Paul Reiche, Fred Ford. 1992-2002
/*
* 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 "displist.h"
#include "libs/log.h"
#ifdef QUEUE_TABLE
#define NULL_HANDLE NULL
#endif
/*
* This file contains code for generic doubly linked lists.
* If QUEUE_TABLE is defined, each lists has its own preallocated
* pool of link structures. The size is specific on InitQueue(),
* and poses a hard limit on the number of elements in the list.
*/
BOOLEAN
InitQueue (QUEUE *pq, COUNT num_elements, OBJ_SIZE size)
{
SetHeadLink (pq, NULL_HANDLE);
SetTailLink (pq, NULL_HANDLE);
SetLinkSize (pq, size);
#ifndef QUEUE_TABLE
return (TRUE);
#else /* QUEUE_TABLE */
SetFreeList (pq, NULL_HANDLE);
#if 0
log_add (log_Debug, "InitQueue(): num_elements = %d (%d)",
num_elements, (BYTE)num_elements);
#endif
if (AllocQueueTab (pq, num_elements) != NULL)
{
do
FreeLink (pq, GetLinkAddr (pq, num_elements));
while (--num_elements);
return (TRUE);
}
return (FALSE);
#endif /* QUEUE_TABLE */
}
BOOLEAN
UninitQueue (QUEUE *pq)
{
#ifdef QUEUE_TABLE
SetHeadLink (pq, NULL_HANDLE);
SetTailLink (pq, NULL_HANDLE);
SetFreeList (pq, NULL_HANDLE);
FreeQueueTab (pq);
return (TRUE);
#else /* !QUEUE_TABLE */
HLINK hLink;
while ((hLink = GetHeadLink (pq)) != NULL_HANDLE)
{
RemoveQueue (pq, hLink);
if (!FreeLink (pq, hLink))
return (FALSE);
}
return (TRUE);
#endif /* QUEUE_TABLE */
}
// Empty the queue. The elements linked to in the queue are unchanged.
void
ReinitQueue (QUEUE *pq)
{
SetHeadLink (pq, NULL_HANDLE);
SetTailLink (pq, NULL_HANDLE);
#ifdef QUEUE_TABLE
{
COUNT num_elements;
SetFreeList (pq, NULL_HANDLE);
num_elements = SizeQueueTab (pq);
if (num_elements)
{
do
FreeLink (pq, GetLinkAddr (pq, num_elements));
while (--num_elements);
}
}
#endif /* QUEUE_TABLE */
}
#ifdef QUEUE_TABLE
HLINK
AllocLink (QUEUE *pq)
{
HLINK hLink;
hLink = GetFreeList (pq);
if (hLink)
{
LINK *LinkPtr;
LinkPtr = LockLink (pq, hLink);
SetFreeList (pq, _GetSuccLink (LinkPtr));
UnlockLink (pq, hLink);
}
else
log_add (log_Debug, "AllocLink(): No more elements");
return (hLink);
}
void
FreeLink (QUEUE *pq, HLINK hLink)
{
LINK *LinkPtr;
LinkPtr = LockLink (pq, hLink);
_SetSuccLink (LinkPtr, GetFreeList (pq));
UnlockLink (pq, hLink);
SetFreeList (pq, hLink);
}
#endif /* QUEUE_TABLE */
void
PutQueue (QUEUE *pq, HLINK hLink)
{
LINK *LinkPtr;
if (GetHeadLink (pq) == 0)
SetHeadLink (pq, hLink);
else
{
HLINK hTail;
LINK *lpTail;
hTail = GetTailLink (pq);
lpTail = LockLink (pq, hTail);
_SetSuccLink (lpTail, hLink);
UnlockLink (pq, hTail);
}
LinkPtr = LockLink (pq, hLink);
_SetPredLink (LinkPtr, GetTailLink (pq));
_SetSuccLink (LinkPtr, NULL_HANDLE);
UnlockLink (pq, hLink);
SetTailLink (pq, hLink);
}
void
InsertQueue (QUEUE *pq, HLINK hLink, HLINK hRefLink)
{
if (hRefLink == 0)
PutQueue (pq, hLink);
else
{
LINK *LinkPtr;
LINK *RefLinkPtr;
LinkPtr = LockLink (pq, hLink);
RefLinkPtr = LockLink (pq, hRefLink);
_SetPredLink (LinkPtr, _GetPredLink (RefLinkPtr));
_SetPredLink (RefLinkPtr, hLink);
_SetSuccLink (LinkPtr, hRefLink);
if (GetHeadLink (pq) == hRefLink)
SetHeadLink (pq, hLink);
else
{
HLINK hPredLink;
LINK *PredLinkPtr;
hPredLink = _GetPredLink (LinkPtr);
PredLinkPtr = LockLink (pq, hPredLink);
_SetSuccLink (PredLinkPtr, hLink);
UnlockLink (pq, hPredLink);
}
UnlockLink (pq, hRefLink);
UnlockLink (pq, hLink);
}
}
void
RemoveQueue (QUEUE *pq, HLINK hLink)
{
LINK *LinkPtr;
LinkPtr = LockLink (pq, hLink);
if (GetHeadLink (pq) == hLink)
{
SetHeadLink (pq, _GetSuccLink (LinkPtr));
}
else
{
HLINK hPredLink;
LINK *PredLinkPtr;
hPredLink = _GetPredLink (LinkPtr);
PredLinkPtr = LockLink (pq, hPredLink);
_SetSuccLink (PredLinkPtr, _GetSuccLink (LinkPtr));
UnlockLink (pq, hPredLink);
}
if (GetTailLink (pq) == hLink)
{
SetTailLink (pq, _GetPredLink (LinkPtr));
}
else
{
HLINK hSuccLink, hPredLink;
LINK *SuccLinkPtr;
hSuccLink = _GetSuccLink (LinkPtr);
SuccLinkPtr = LockLink (pq, hSuccLink);
hPredLink = _GetPredLink (LinkPtr);
_SetPredLink (SuccLinkPtr, hPredLink);
UnlockLink (pq, hSuccLink);
}
UnlockLink (pq, hLink);
}
COUNT
CountLinks (QUEUE *pq)
{
COUNT LinkCount;
HLINK hLink, hNextLink;
LinkCount = 0;
for (hLink = GetHeadLink (pq); hLink; hLink = hNextLink)
{
LINK *LinkPtr;
++LinkCount;
LinkPtr = LockLink (pq, hLink);
hNextLink = _GetSuccLink (LinkPtr);
UnlockLink (pq, hLink);
}
return (LinkCount);
}
void
ForAllLinks (QUEUE *pq, void (*callback)(LINK *, void *), void *arg)
{
HLINK hLink, hNextLink;
for (hLink = GetHeadLink (pq); hLink; hLink = hNextLink)
{
LINK *LinkPtr;
LinkPtr = LockLink (pq, hLink);
hNextLink = _GetSuccLink (LinkPtr);
(*callback) (LinkPtr, arg);
UnlockLink (pq, hLink);
}
}
|
