-
Notifications
You must be signed in to change notification settings - Fork 3
/
queue.h
46 lines (35 loc) · 1.53 KB
/
queue.h
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
#ifndef QUEUE_H
#define QUEUE_H
#define QUEUE_HEAD(name, type) \
struct name { \
type *first; \
type **last; \
}
#define QUEUE_ENTRY(type) \
struct { \
type *next; \
}
#define QUEUE_INIT(head) \
do { \
(head)->first = NULL; \
(head)->last = &(head)->first; \
} while (0)
#define QUEUE_HEAD_INITIALIZER(head) { NULL, &(head).first }
#define QUEUE_NEXT(elem, entry) ((elem)->entry.next)
#define QUEUE_EMPTY(head) ((head)->first == NULL)
#define QUEUE_LAST(head, type, entry) \
QUEUE_EMPTY(head) ? NULL : CONTAINER_OF((head)->last, type, entry.next)
#define QUEUE_APPEND(head, elem, entry) \
do { \
QUEUE_NEXT(elem, entry) = NULL; \
*(head)->last = (elem); \
(head)->last = &QUEUE_NEXT(elem, entry); \
} while (0)
#define QUEUE_REMOVE_FIRST(head, entry) \
do { \
if (((head)->first = QUEUE_NEXT((head)->first, entry)) == NULL) \
(head)->last = &(head)->first; \
} while (0)
#define QUEUE_FOR_EACH(head, elem, entry) \
for ((elem) = (head)->first; (elem); (elem) = QUEUE_NEXT(elem, entry))
#endif