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
|
/* ************************************************************************
* Copyright 2013 Advanced Micro Devices, Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
* ************************************************************************/
#include <stddef.h>
#include <list.h>
#include <assert.h>
static __inline
void listAddAfter(ListNode *prev, ListNode *node)
{
ListNode *next = prev->next;
prev->next = node;
node->prev = prev;
node->next = next;
next->prev = node;
}
void
listAddToTail(ListHead *head, ListNode *node)
{
listAddAfter(head->prev, node);
}
void
listAddToHead(ListHead *head, ListNode *node)
{
listAddAfter(head, node);
}
void
listDel(ListNode *node)
{
#ifdef DEBUG
// check if it's not really the list head
assert(node->next != node->prev);
#endif
node->prev->next = node->next;
node->next->prev = node->prev;
}
ListNode
*listDelFromTail(ListHead *head)
{
ListNode *node = head->prev;
listDel(node);
return node;
}
void
listDoForEach(ListHead *head, ListAction act)
{
ListNode *node;
for (node = listNodeFirst(head); node != head; node = node->next) {
act(node);
}
}
void
listDoForEachSafe(ListHead *head, ListAction act)
{
ListNode *node, *save;
for (node = listNodeFirst(head), save = node->next; node != head;
node = save, save = node->next) {
act(node);
}
}
void
listDoForEachPriv(const ListHead *head, ListPrivAction act, void *actPriv)
{
ListNode *node;
for (node = listNodeFirst(head); node != head; node = node->next) {
act(node, actPriv);
}
}
void
listDoForEachPrivSafe(const ListHead *head, ListPrivAction act, void *actPriv)
{
ListNode *node, *save;
for (node = listNodeFirst(head), save = node->next; node != head;
node = save, save = node->next) {
act(node, actPriv);
}
}
ListNode
*listNodeSearch(const ListHead *head, const void *key, ListCmpFn cmp)
{
ListNode *node;
for (node = listNodeFirst(head); node != head; node = node->next) {
if (!cmp(node, key)) {
break;
}
}
return (node == head) ? NULL : node;
}
size_t
listLength(const ListHead *head)
{
size_t length = 0;
ListNode *node;
for (node= listNodeFirst(head); node != head; node = node->next) {
length++;
}
return length;
}
|
