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
|
#include "list.h"
void
list_init(struct list *list)
{
LIST_ABORT_ON_ARGS(!list);
list->head.prev = NULL;
list->head.next = &list->tail;
list->tail.prev = &list->head;
list->tail.next = NULL;
}
void
list_clear(struct list *list)
{
LIST_ABORT_ON_ARGS(!list);
while (!list_empty(list))
list_pop_back(list);
}
void
list_free_items(struct list *list, list_item_free_fn free_item, size_t offset)
{
struct list_link *item;
LIST_ABORT_ON_ARGS(!list || !free_item);
while (!list_empty(list)) {
item = list_link_pop(list->head.next);
free_item(((void *) item) - offset);
}
}
size_t
list_len(const struct list *list)
{
const struct list_link *link;
size_t len;
LIST_ABORT_ON_ARGS(!list);
len = 0;
for (LIST_ITER(list, link))
len += 1;
return len;
}
ssize_t
list_index(const struct list *list, const struct list_link *target)
{
struct list_link *link;
ssize_t index;
LIST_ABORT_ON_ARGS(!list || !target);
index = 0;
for (LIST_ITER(list, link)) {
if (link == target)
return index;
index++;
}
return -1;
}
struct list_link *
list_at(struct list *list, size_t n)
{
struct list_link *link;
LIST_ABORT_ON_ARGS(!list);
link = list_iter_fwd(list->head.next, n);
return LIST_INNER(link) ? link : NULL;
}
struct list_link *
list_at_back(struct list *list, size_t n)
{
struct list_link *link;
LIST_ABORT_ON_ARGS(!list);
link = list_iter_bwd(&list->tail, n);
return LIST_INNER(link) ? link : NULL;
}
void
list_insert_sorted(struct list *list, struct list_link *insert,
bool reverse, list_sort_order_fn in_order, size_t offset, void *user)
{
struct list_link *link;
void *link_item, *insert_item;
LIST_ABORT_ON_ARGS(!list || !insert || !in_order);
insert_item = ((void *) insert) - offset;
for (LIST_ITER(list, link)) {
link_item = ((void *) link) - offset;
if (in_order(insert_item, link_item, user) == !reverse) {
list_link_prepend(link, insert);
return;
}
}
list_insert_back(list, insert);
}
void
list_insert_sorted_bwd(struct list *list, struct list_link *insert,
bool reverse, list_sort_order_fn in_order, size_t offset, void *user)
{
struct list_link *link;
void *link_item, *insert_item;
LIST_ABORT_ON_ARGS(!list || !insert || !in_order);
insert_item = ((void *) insert) - offset;
for (LIST_ITER_BWD(list, link)) {
link_item = ((void *) link) - offset;
if (in_order(link_item, insert_item, user) == !reverse) {
list_link_append(link, insert);
return;
}
}
list_insert_front(list, insert);
}
void
list_insertion_sort(struct list *list, bool reverse,
list_sort_order_fn in_order, size_t offset, void *user)
{
struct list_link *link, *cmp, *next;
void *link_item, *cmp_item;
LIST_ABORT_ON_ARGS(!list || !in_order);
link = list->head.next;
while (LIST_INNER(link)) {
next = link->next;
cmp = link->prev;
link_item = ((void *) link) - offset;
while (LIST_INNER(cmp)) {
cmp_item = ((void *) cmp) - offset;
if (in_order(cmp_item, link_item, user) == !reverse)
break;
cmp = cmp->prev;
}
if (cmp != link->prev)
list_link_append(cmp, list_link_pop(link));
link = next;
}
}
struct list_link *
list_pop_front(struct list *list)
{
LIST_ABORT_ON_ARGS(!list);
if (list_empty(list)) return NULL;
return list_link_pop(list->head.next);
}
struct list_link *
list_pop_back(struct list *list)
{
LIST_ABORT_ON_ARGS(!list);
if (list_empty(list)) return NULL;
return list_link_pop(list->tail.prev);
}
struct list_link *
list_link_pop(struct list_link *link)
{
LIST_ABORT_ON_ARGS(!link);
if (link->prev)
link->prev->next = link->next;
if (link->next)
link->next->prev = link->prev;
*link = LIST_LINK_INIT;
return link;
}
struct list_link *
list_iter_fwd(struct list_link *link, size_t n)
{
size_t i;
LIST_ABORT_ON_ARGS(!link);
for (i = 0; i < n; i++) {
if (!link) return NULL;
link = link->next;
}
return link;
}
struct list_link *
list_iter_bwd(struct list_link *link, size_t n)
{
size_t i;
LIST_ABORT_ON_ARGS(!link);
for (i = 0; i < n; i++) {
if (!link) return NULL;
link = link->prev;
}
return link;
}
|
