0001
0002 struct list {
0003 struct list *next, *prev;
0004 };
0005
0006 static inline void
0007 list_init(struct list *list)
0008 {
0009 list->next = list;
0010 list->prev = list;
0011 }
0012
0013 static inline int
0014 list_empty(struct list *list)
0015 {
0016 return list->next == list;
0017 }
0018
0019 static inline void
0020 list_insert(struct list *link, struct list *new_link)
0021 {
0022 new_link->prev = link->prev;
0023 new_link->next = link;
0024 new_link->prev->next = new_link;
0025 new_link->next->prev = new_link;
0026 }
0027
0028 static inline void
0029 list_append(struct list *list, struct list *new_link)
0030 {
0031 list_insert((struct list *)list, new_link);
0032 }
0033
0034 static inline void
0035 list_prepend(struct list *list, struct list *new_link)
0036 {
0037 list_insert(list->next, new_link);
0038 }
0039
0040 static inline void
0041 list_remove(struct list *link)
0042 {
0043 link->prev->next = link->next;
0044 link->next->prev = link->prev;
0045 }
0046
0047 #define list_entry(link, type, member) \
0048 ((type *)((char *)(link)-(unsigned long)(&((type *)0)->member)))
0049
0050 #define list_head(list, type, member) \
0051 list_entry((list)->next, type, member)
0052
0053 #define list_tail(list, type, member) \
0054 list_entry((list)->prev, type, member)
0055
0056 #define list_next(elm, member) \
0057 list_entry((elm)->member.next, typeof(*elm), member)
0058
0059 #define list_for_each_entry(pos, list, member) \
0060 for (pos = list_head(list, typeof(*pos), member); \
0061 &pos->member != (list); \
0062 pos = list_next(pos, member))
0063