blob: 7b4ca66c5757fb894f7337312c4ed89708e40316 (
plain)
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
|
#pragma once
typedef struct ALFListHeader {
struct ALFListHeader *prev;
struct ALFListHeader *next;
} ALFListHeader;
#define ALF_LIST_CONTAINER(ContainerType, containermember, listp) \
((ContainerType *)((char *)(listp) - offsetof(ContainerType, containermember)))
#define ALF_FOR_LIST(ContainerType, containermember, listp, iteratorvar) \
for (ALFListHeader *alf_list_##iteratorvar##_curr = (listp)->next, \
*alf_list_##iteratorvar##_next = alf_list_##iteratorvar##_curr->next; \
alf_list_##iteratorvar##_curr != (listp); \
alf_list_##iteratorvar##_curr = alf_list_##iteratorvar##_next, \
alf_list_##iteratorvar##_next = alf_list_##iteratorvar##_curr->next) \
for (ContainerType *iteratorvar = (ContainerType *)((char *)alf_list_##iteratorvar##_curr - offsetof(ContainerType, containermember)); \
iteratorvar; iteratorvar = NULL) \
static inline BOOL
ALF_ListIsEmpty(ALFListHeader *list)
{
return list->next == list;
}
static inline void
ALF_ListInsert(ALFListHeader *list, ALFListHeader *newel)
{
newel->prev = list;
newel->next = list->next;
newel->next->prev = newel;
list->next = newel;
}
static inline void
ALF_ListRemove(ALFListHeader *member)
{
member->prev->next = member->next;
member->next->prev = member->prev;
member->next = NULL;
member->prev = NULL;
}
static inline void
ALF_ListInit(ALFListHeader *list)
{
list->next = list->prev = list;
}
|
