2 struct list *next, *prev;
6 list_init(struct list *list)
13 list_empty(struct list *list)
15 return list->next == list;
19 list_insert(struct list *link, struct list *new_link)
21 new_link->prev = link->prev;
22 new_link->next = link;
23 new_link->prev->next = new_link;
24 new_link->next->prev = new_link;
28 list_append(struct list *list, struct list *new_link)
30 list_insert((struct list *)list, new_link);
34 list_prepend(struct list *list, struct list *new_link)
36 list_insert(list->next, new_link);
40 list_remove(struct list *link)
42 link->prev->next = link->next;
43 link->next->prev = link->prev;
46 #define list_entry(link, type, member) \
47 ((type *)((char *)(link)-(unsigned long)(&((type *)0)->member)))
49 #define list_head(list, type, member) \
50 list_entry((list)->next, type, member)
52 #define list_tail(list, type, member) \
53 list_entry((list)->prev, type, member)
55 #define list_next(elm, member) \
56 list_entry((elm)->member.next, typeof(*elm), member)
58 #define list_for_each_entry(pos, list, member) \
59 for (pos = list_head(list, typeof(*pos), member); \
60 &pos->member != (list); \
61 pos = list_next(pos, member))