-
Notifications
You must be signed in to change notification settings - Fork 17
Expand file tree
/
Copy pathquicklist.h
More file actions
360 lines (310 loc) · 8.74 KB
/
quicklist.h
File metadata and controls
360 lines (310 loc) · 8.74 KB
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
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
/*
* Copyright (C) 2013 University of Chicago.
* See COPYRIGHT notice in top-level directory.
*
*/
/*
* (C) 2001 Clemson University and The University of Chicago
*
* See COPYING in top-level directory.
*/
/* Derived from linked qlist code taken from linux 2.4.3 (list.h) */
/*
* Simple doubly linked qlist implementation.
*
* Some of the internal functions ("__xxx") are useful when
* manipulating whole qlists rather than single entries, as
* sometimes we already know the next/prev entries and we can
* generate better code by using them directly rather than
* using the generic single-entry routines.
*/
#ifndef QUICKLIST_H
#define QUICKLIST_H
#ifdef __cplusplus
extern "C" {
#endif
#include <stdlib.h>
#include <assert.h>
#include <stdbool.h>
struct qlist_head {
struct qlist_head *next, *prev;
};
#define QLIST_HEAD_INIT(name) { &(name), &(name) }
#define QLIST_HEAD(name) \
struct qlist_head name = QLIST_HEAD_INIT(name)
#define INIT_QLIST_HEAD(ptr) do { \
(ptr)->next = (ptr); (ptr)->prev = (ptr); \
} while (0)
/*
* Insert a new entry between two known consecutive entries.
*
* This is only for internal qlist manipulation where we know
* the prev/next entries already!
*/
static __inline__ void __qlist_add(struct qlist_head * newi,
struct qlist_head * prev,
struct qlist_head * next)
{
next->prev = newi;
newi->next = next;
newi->prev = prev;
prev->next = newi;
}
/**
* qlist_add - add a new entry
* @new: new entry to be added
* @head: qlist head to add it after
*
* Insert a new entry after the specified head.
* This is good for implementing stacks.
*/
static __inline__ void qlist_add(struct qlist_head *newi, struct qlist_head *head)
{
__qlist_add(newi, head, head->next);
}
/**
* qlist_add_tail - add a new entry
* @new: new entry to be added
* @head: qlist head to add it before
*
* Insert a new entry before the specified head.
* This is useful for implementing queues.
*/
static __inline__ void qlist_add_tail(struct qlist_head *newi, struct qlist_head *head)
{
__qlist_add(newi, head->prev, head);
}
/*
* Delete a qlist entry by making the prev/next entries
* point to each other.
*
* This is only for internal qlist manipulation where we know
* the prev/next entries already!
*/
static __inline__ void __qlist_del(struct qlist_head * prev,
struct qlist_head * next)
{
next->prev = prev;
prev->next = next;
}
/**
* qlist_del - deletes entry from qlist.
* @entry: the element to delete from the qlist.
* Note: qlist_empty on entry does not return true after this, the entry is in an undefined state.
*/
static __inline__ void qlist_del(struct qlist_head *entry)
{
__qlist_del(entry->prev, entry->next);
}
/**
* qlist_del_init - deletes entry from qlist and reinitialize it.
* @entry: the element to delete from the qlist.
*/
static __inline__ void qlist_del_init(struct qlist_head *entry)
{
__qlist_del(entry->prev, entry->next);
INIT_QLIST_HEAD(entry);
}
/**
* qlist_empty - tests whether a qlist is empty
* @head: the qlist to test.
*/
static __inline__ int qlist_empty(struct qlist_head *head)
{
return head->next == head;
}
/**
* qlist_pop - pop the first item off the list and return it
* @head: qlist to modify
*/
static __inline__ struct qlist_head* qlist_pop(struct qlist_head *head)
{
struct qlist_head *item = NULL;
if (!qlist_empty(head))
{
item = head->next;
qlist_del(item);
}
return item;
}
/**
* qlist_pop_back - pop the last item off the list and return it
* @head: qlist to modify
*/
static __inline__ struct qlist_head* qlist_pop_back(struct qlist_head *head)
{
struct qlist_head *item = NULL;
if (!qlist_empty(head))
{
item = head->prev;
qlist_del(item);
}
return item;
}
/**
* qlist_splice - join two qlists
* @qlist: the new qlist to add.
* @head: the place to add it in the first qlist.
*/
static __inline__ void qlist_splice(struct qlist_head *qlist, struct qlist_head *head)
{
struct qlist_head *first = qlist->next;
if (first != qlist) {
struct qlist_head *last = qlist->prev;
struct qlist_head *at = head->next;
first->prev = head;
head->next = first;
last->next = at;
at->prev = last;
}
}
/**
* qlist_entry - get the struct for this entry
* @ptr: the &struct qlist_head pointer.
* @type: the type of the struct this is embedded in.
* @member: the name of the qlist_struct within the struct.
*/
#define qlist_entry(ptr, type, member) \
((type *)((char *)(ptr)-(unsigned long)((&((type *)0)->member))))
/**
* QLIST_OFFSET - get offset to the member that holds qlist_header
* @type: the type of the struct this is embedded in.
* @member: the name of the qlist_struct within the struct.
*/
#define QLIST_OFFSET(type, member) \
(unsigned long)((&((type *)0)->member))
/**
* qlist_for_each - iterate over a qlist
* @pos: the &struct qlist_head to use as a loop counter.
* @head: the head for your qlist.
*/
#define qlist_for_each(pos, head) \
for (pos = (head)->next; pos != (head); pos = pos->next)
/**
* list_for_each_safe - iterate over a list safe against
* removal of list entry
* @pos: the &struct list_head to use as a loop counter.
* @n: another &struct list_head to use as temporary storage
* @head: the head for your list.
*/
#define qlist_for_each_safe(pos, scratch, head) \
for (pos = (head)->next, scratch = pos->next; pos != (head);\
pos = scratch, scratch = pos->next)
/**
* qlist_for_each_entry - iterate over list of given type
* @pos: the type * to use as a loop counter.
* @head: the head for your list.
* @member: the name of the list_struct within the struct.
*/
#define qlist_for_each_entry(pos, head, member) \
for (pos = qlist_entry((head)->next, typeof(*pos), member); \
&pos->member != (head); \
pos = qlist_entry(pos->member.next, typeof(*pos), member)) \
/**
* qlist_for_each_entry_safe - iterate over list of given type safe against removal of list entry
* @pos: the type * to use as a loop counter.
* @n: another type * to use as temporary storage
* @head: the head for your list.
* @member: the name of the list_struct within the struct.
*/
#define qlist_for_each_entry_safe(pos, n, head, member) \
for (pos = qlist_entry((head)->next, typeof(*pos), member), \
n = qlist_entry(pos->member.next, typeof(*pos), member); \
&pos->member != (head); \
pos = n, n = qlist_entry(n->member.next, typeof(*n), member))
static inline int qlist_exists(struct qlist_head *list, struct qlist_head *qlink)
{
struct qlist_head *pos;
if(qlist_empty(list)) return 0;
qlist_for_each(pos, list)
{
if(pos == qlink)
{
return 1;
}
}
return 0;
}
static inline int qlist_count(struct qlist_head const *list)
{
struct qlist_head *pos;
int count = 0;
pos = list->next;
while(pos != list)
{
++count;
pos = pos->next;
}
return count;
}
static inline void qlist_add_at_index(struct qlist_head *newi, struct qlist_head *list, int index)
{
if (index < 0)
{
while(index++)
{
list = list->prev;
}
}
else
{
while(index--)
{
list = list->next;
}
}
__qlist_add(newi, list, list->next);
}
static inline struct qlist_head * qlist_find(
struct qlist_head *list,
int (*compare)(struct qlist_head *, void *),
void *ptr)
{
struct qlist_head *pos;
qlist_for_each(pos, list)
{
if(compare(pos, ptr))
{
return pos;
}
}
return NULL;
}
/**
* are_qlist_equal - determine if two qlists have the same elements
*/
static inline bool are_qlist_equal(struct qlist_head const * left, struct qlist_head const * right, unsigned int offset_ql, bool (cmp) (void *, void *)) {
int const num_elems = qlist_count(left);
if (num_elems != qlist_count(right)) {
return false;
}
// Checking element by element
int i = 0;
struct qlist_head * elem_left = left->next;
struct qlist_head * elem_right = right->next;
while (elem_left != left) {
char * entry_left = (char *)(elem_left) - offset_ql;
char * entry_right = (char *)(elem_right) - offset_ql;
if (!cmp(entry_left, entry_right)) {
return false;
}
elem_left = elem_left->next;
elem_right = elem_right->next;
i++;
}
assert(i == num_elems);
assert(elem_right == right);
return true;
}
/*
* Local variables:
* c-indent-level: 4
* c-basic-offset: 4
* End:
*
* vim: ts=8 sts=4 sw=4 expandtab
*/
#ifdef __cplusplus
}
#endif
#endif /* QUICKLIST_H */