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_continue(_list, _pos, _member) \
34 for (; &_pos->_member != &(_list)->head; \
35 _pos = list_entry(_pos->_member.next, typeof(*_pos), _member))
37 void list_init(struct list *list);
38 void list_insert_before(struct list_item *next, struct list_item *item);
39 void list_insert_after(struct list_item *prev, struct list_item *item);
40 void list_remove(struct list_item *item);
42 static inline void list_add(struct list *list, struct list_item *item)
44 list_insert_after(&list->head, item);
46 static inline void list_add_tail(struct list *list, struct list_item *item)
48 list_insert_before(&list->head, item);