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
|
/*++
Copyright (c) 2004, Intel Corporation. All rights reserved.<BR>
This program and the accompanying materials
are licensed and made available under the terms and conditions of the BSD License
which accompanies this distribution. The full text of the license may be found at
http://opensource.org/licenses/bsd-license.php
THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS,
WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED.
Module Name:
LinkedList.h
Abstract:
This implementation of a linked list provides data structures for the
list itself and for list nodes. It provides operations for initializing
the list, modifying the list, and walking the list.
--*/
//
// Prevent multiple includes in the same source file
//
#ifndef _LINKED_LIST_H_
#define _LINKED_LIST_H_
#ifndef _SHELL_LINKED_LIST_H_
typedef struct _EFI_LIST_ENTRY {
struct _EFI_LIST_ENTRY *ForwardLink;
struct _EFI_LIST_ENTRY *BackLink;
} EFI_LIST_ENTRY;
typedef EFI_LIST_ENTRY EFI_LIST;
typedef EFI_LIST_ENTRY EFI_LIST_NODE;
#define INITIALIZE_LIST_HEAD_VARIABLE(ListHead) {&ListHead, &ListHead}
//
// EFI_FIELD_OFFSET - returns the byte offset to a field within a structure
//
#define EFI_FIELD_OFFSET(TYPE,Field) ((UINTN)(&(((TYPE *) 0)->Field)))
//
// A lock structure
//
typedef struct {
EFI_TPL Tpl;
EFI_TPL OwnerTpl;
UINTN Lock;
} FLOCK;
VOID
InitializeListHead (
EFI_LIST_ENTRY *List
)
/*++
Routine Description:
Initialize the head of the List. The caller must allocate the memory
for the EFI_LIST. This function must be called before the other linked
list macros can be used.
Arguments:
List - Pointer to list head to initialize
Returns:
None.
--*/
;
BOOLEAN
IsListEmpty (
EFI_LIST_ENTRY *List
)
/*++
Routine Description:
Return TRUE is the list contains zero nodes. Otherzise return FALSE.
The list must have been initialized with InitializeListHead () before using
this function.
Arguments:
List - Pointer to list head to test
Returns:
Return TRUE is the list contains zero nodes. Otherzise return FALSE.
--*/
;
VOID
RemoveEntryList (
EFI_LIST_ENTRY *Entry
)
/*++
Routine Description:
Remove Node from the doubly linked list. It is the caller's responsibility
to free any memory used by the entry if needed. The list must have been
initialized with InitializeListHead () before using this function.
Arguments:
Entry - Element to remove from the list.
Returns:
None
--*/
;
VOID
InsertTailList (
EFI_LIST_ENTRY *ListHead,
EFI_LIST_ENTRY *Entry
)
/*++
Routine Description:
Insert a Node into the end of a doubly linked list. The list must have
been initialized with InitializeListHead () before using this function.
Arguments:
ListHead - Head of doubly linked list
Entry - Element to insert at the end of the list.
Returns:
None
--*/
;
VOID
InsertHeadList (
EFI_LIST_ENTRY *ListHead,
EFI_LIST_ENTRY *Entry
)
/*++
Routine Description:
Insert a Node into the start of a doubly linked list. The list must have
been initialized with InitializeListHead () before using this function.
Arguments:
ListHead - Head of doubly linked list
Entry - Element to insert to beginning of list
Returns:
None
--*/
;
VOID
SwapListEntries (
EFI_LIST_ENTRY *Entry1,
EFI_LIST_ENTRY *Entry2
)
/*++
Routine Description:
Swap the location of the two elements of a doubly linked list. Node2
is placed in front of Node1. The list must have been initialized with
InitializeListHead () before using this function.
Arguments:
Entry1 - Element in the doubly linked list in front of Node2.
Entry2 - Element in the doubly linked list behind Node1.
Returns:
None
--*/
;
EFI_LIST_ENTRY *
GetFirstNode (
EFI_LIST_ENTRY *List
)
/*++
Routine Description:
Return the first node pointed to by the list head. The list must
have been initialized with InitializeListHead () before using this
function and must contain data.
Arguments:
List - The head of the doubly linked list.
Returns:
Pointer to the first node, if the list contains nodes. The list will
return a null value--that is, the value of List--when the list is empty.
See the description of IsNull for more information.
--*/
;
EFI_LIST_ENTRY *
GetNextNode (
EFI_LIST_ENTRY *List,
EFI_LIST_ENTRY *Node
)
/*++
Routine Description:
Returns the node following Node in the list. The list must
have been initialized with InitializeListHead () before using this
function and must contain data.
Arguments:
List - The head of the list. MUST NOT be the literal value NULL.
Node - The node in the list. This value MUST NOT be the literal value NULL.
See the description of IsNull for more information.
Returns:
Pointer to the next node, if one exists. Otherwise, returns a null value,
which is actually a pointer to List.
See the description of IsNull for more information.
--*/
;
BOOLEAN
IsNull (
EFI_LIST_ENTRY *List,
EFI_LIST_ENTRY *Node
)
/*++
Routine Description:
Determines whether the given node is null. Note that Node is null
when its value is equal to the value of List. It is an error for
Node to be the literal value NULL [(VOID*)0x0].
Arguments:
List - The head of the list. MUST NOT be the literal value NULL.
Node - The node to test. MUST NOT be the literal value NULL. See
the description above.
Returns:
Returns true if the node is null.
--*/
;
BOOLEAN
IsNodeAtEnd (
EFI_LIST_ENTRY *List,
EFI_LIST_ENTRY *Node
)
/*++
Routine Description:
Determines whether the given node is at the end of the list. Used
to walk the list. The list must have been initialized with
InitializeListHead () before using this function and must contain
data.
Arguments:
List - The head of the list. MUST NOT be the literal value NULL.
Node - The node to test. MUST NOT be the literal value NULL.
See the description of IsNull for more information.
Returns:
Returns true if the list is the tail.
--*/
;
#endif
#endif
|