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
|
/*
*
* Copyright (c) 2009, Microsoft Corporation.
*
* This program is free software; you can redistribute it and/or modify it
* under the terms and conditions of the GNU General Public License,
* version 2, as published by the Free Software Foundation.
*
* This program is distributed in the hope 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.
*
* Authors:
* Haiyang Zhang <haiyangz@microsoft.com>
* Hank Janssen <hjanssen@microsoft.com>
*
*/
#ifndef _LIST_H_
#define _LIST_H_
#include "osd.h"
/*
*
* Doubly-linked list manipulation routines. Implemented as macros
* but logically these are procedures.
*
*/
typedef DLIST_ENTRY LIST_ENTRY;
typedef DLIST_ENTRY *PLIST_ENTRY;
//typedef struct LIST_ENTRY {
// struct LIST_ENTRY * volatile Flink;
// struct LIST_ENTRY * volatile Blink;
//} LIST_ENTRY, *PLIST_ENTRY;
/*
* VOID
* InitializeListHead(
* PLIST_ENTRY ListHead
* );
*/
#define INITIALIZE_LIST_HEAD InitializeListHead
#define InitializeListHead(ListHead) (\
(ListHead)->Flink = (ListHead)->Blink = (ListHead))
/*
* BOOLEAN
* IsListEmpty(
* PLIST_ENTRY ListHead
* );
*/
#define IS_LIST_EMPTY IsListEmpty
#define IsListEmpty(ListHead) \
((ListHead)->Flink == (ListHead))
/*
* PLIST_ENTRY
* NextListEntry(
* PLIST_ENTRY Entry
* );
*/
#define NEXT_LIST_ENTRY NextListEntry
#define NextListEntry(Entry) \
(Entry)->Flink
/*
* PLIST_ENTRY
* PrevListEntry(
* PLIST_ENTRY Entry
* );
*/
#define PREV_LIST_ENTRY PrevListEntry
#define PrevListEntry(Entry) \
(Entry)->Blink
/*
* PLIST_ENTRY
* TopListEntry(
* PLIST_ENTRY ListHead
* );
*/
#define TOP_LIST_ENTRY TopListEntry
#define TopListEntry(ListHead) \
(ListHead)->Flink
/*
* PLIST_ENTRY
* RemoveHeadList(
* PLIST_ENTRY ListHead
* );
*/
#define REMOVE_HEAD_LIST RemoveHeadList
#define RemoveHeadList(ListHead) \
(ListHead)->Flink;\
{RemoveEntryList((ListHead)->Flink)}
/*
* PLIST_ENTRY
* RemoveTailList(
* PLIST_ENTRY ListHead
* );
*/
#define REMOVE_TAIL_LIST RemoveTailList
#define RemoveTailList(ListHead) \
(ListHead)->Blink;\
{RemoveEntryList((ListHead)->Blink)}
/*
* VOID
* RemoveEntryList(
* PLIST_ENTRY Entry
* );
*/
#define REMOVE_ENTRY_LIST RemoveEntryList
#define RemoveEntryList(Entry) {\
PLIST_ENTRY _EX_Flink = (Entry)->Flink;\
PLIST_ENTRY _EX_Blink = (Entry)->Blink;\
_EX_Blink->Flink = _EX_Flink;\
_EX_Flink->Blink = _EX_Blink;\
}
/*
* VOID
* AttachList(
* PLIST_ENTRY ListHead,
* PLIST_ENTRY ListEntry
* );
*/
#define ATTACH_LIST AttachList
#define AttachList(ListHead,ListEntry) {\
PLIST_ENTRY _EX_ListHead = (ListHead);\
PLIST_ENTRY _EX_Blink = (ListHead)->Blink;\
(ListEntry)->Blink->Flink = _EX_ListHead;\
_EX_Blink->Flink = (ListEntry);\
_EX_ListHead->Blink = (ListEntry)->Blink;\
(ListEntry)->Blink = _EX_Blink;\
}
/*
* VOID
* InsertTailList(
* PLIST_ENTRY ListHead,
* PLIST_ENTRY Entry
* );
*/
#define INSERT_TAIL_LIST InsertTailList
#define InsertTailList(ListHead,Entry) {\
PLIST_ENTRY _EX_ListHead = (ListHead);\
PLIST_ENTRY _EX_Blink = (ListHead)->Blink;\
(Entry)->Flink = _EX_ListHead;\
(Entry)->Blink = _EX_Blink;\
_EX_Blink->Flink = (Entry);\
_EX_ListHead->Blink = (Entry);\
}
/*
* VOID
* InsertHeadList(
* PLIST_ENTRY ListHead,
* PLIST_ENTRY Entry
* );
*/
#define INSERT_HEAD_LIST InsertHeadList
#define InsertHeadList(ListHead,Entry) {\
PLIST_ENTRY _EX_ListHead = (ListHead);\
PLIST_ENTRY _EX_Flink = (ListHead)->Flink;\
(Entry)->Flink = _EX_Flink;\
(Entry)->Blink = _EX_ListHead;\
_EX_Flink->Blink = (Entry);\
_EX_ListHead->Flink = (Entry);\
}
/*
* VOID
* IterateListEntries(
* PLIST_ENTRY anchor,
* PLIST_ENTRY index,
* PLIST_ENTRY listp
* );
*/
#define ITERATE_LIST_ENTRIES IterateListEntries
#define IterateListEntries(anchor, index, listp) \
(anchor) = (LIST_ENTRY *)(listp); \
for((index) = (anchor)->Flink; (index) != (anchor); (index) = (index)->Flink)
/*
* PSINGLE_LIST_ENTRY
* PopEntryList(
* PSINGLE_LIST_ENTRY ListHead
* );
*/
#define POP_ENTRY_LIST PopEntryList
#define PopEntryList(ListHead) \
(ListHead)->Next;\
{\
PSINGLE_LIST_ENTRY FirstEntry;\
FirstEntry = (ListHead)->Next;\
if (FirstEntry != NULL) { \
(ListHead)->Next = FirstEntry->Next;\
} \
}
/*
* VOID
* PushEntryList(
* PSINGLE_LIST_ENTRY ListHead,
* PSINGLE_LIST_ENTRY Entry
* );
*/
#define PUSH_ENTRY_LIST PushEntryList
#define PushEntryList(ListHead,Entry) \
(Entry)->Next = (ListHead)->Next; \
(ListHead)->Next = (Entry)
#ifndef CONTAINING_RECORD
#define CONTAINING_RECORD(address, type, field) ((type *)( \
(PCHAR)(address) - \
(PCHAR)(&((type *)0)->field)))
#endif /* CONTAINING_RECORD */
#endif /* _LIST_H_ */
/* EOF */
|