5 struct list_item *prev, *next;
13 #define container_of(ptr, type, member) ({ \
14 const typeof( ((type *)0)->member ) *__mptr = (ptr); \
15 (type *)( (char *)__mptr - offsetof(type,member) );})
19 #define offsetof(TYPE, MEMBER) ((size_t) &((TYPE *)0)->MEMBER)
22 #define list_for_each(list, pos) \
23 for (pos = (list)->head.next; pos != ((list)->head); pos = pos->next)
25 #define list_entry(ptr, type, member) \
26 container_of(ptr, type, member)
28 #define list_for_each_entry(list, pos, member) \
29 for (pos = list_entry((list)->head.next, typeof(*pos), member); \
30 &pos->member != &(list)->head; \
31 pos = list_entry(pos->member.next, typeof(*pos), member))
33 #define list_for_each_entry_safe(list, pos, n, member) \
34 for (pos = list_entry((list)->head.next, typeof(*pos), member), \
35 n = list_entry(pos->member.next, typeof(*pos), member); \
36 &pos->member != &(list)->head; \
37 pos = n, n = list_entry(n->member.next, typeof(*n), member))
40 void list_init(struct list *list);
42 void list_add(struct list *list, struct list_item *item);
44 void list_remove(struct list_item *item);