3 * Copyright (c) 2009, Jouni Malinen <j@w1.fi>
5 * This software may be distributed under the terms of the BSD license.
6 * See README for more details.
13 * struct dl_list - Doubly-linked list
20 #define DL_LIST_HEAD_INIT(l) { &(l), &(l) }
22 static inline void dl_list_init(struct dl_list *list)
28 static inline void dl_list_add(struct dl_list *list, struct dl_list *item)
30 item->next = list->next;
32 list->next->prev = item;
36 static inline void dl_list_add_tail(struct dl_list *list, struct dl_list *item)
38 dl_list_add(list->prev, item);
41 static inline void dl_list_del(struct dl_list *item)
43 item->next->prev = item->prev;
44 item->prev->next = item->next;
49 static inline int dl_list_empty(struct dl_list *list)
51 return list->next == list;
54 static inline unsigned int dl_list_len(struct dl_list *list)
58 for (item = list->next; item != list; item = item->next)
64 #define offsetof(type, member) ((long) &((type *) 0)->member)
67 #define dl_list_entry(item, type, member) \
68 ((type *) ((char *) item - offsetof(type, member)))
70 #define dl_list_first(list, type, member) \
71 (dl_list_empty((list)) ? NULL : \
72 dl_list_entry((list)->next, type, member))
74 #define dl_list_last(list, type, member) \
75 (dl_list_empty((list)) ? NULL : \
76 dl_list_entry((list)->prev, type, member))
78 #define dl_list_for_each(item, list, type, member) \
79 for (item = dl_list_entry((list)->next, type, member); \
80 &item->member != (list); \
81 item = dl_list_entry(item->member.next, type, member))
83 #define dl_list_for_each_safe(item, n, list, type, member) \
84 for (item = dl_list_entry((list)->next, type, member), \
85 n = dl_list_entry(item->member.next, type, member); \
86 &item->member != (list); \
87 item = n, n = dl_list_entry(n->member.next, type, member))
89 #define dl_list_for_each_reverse(item, list, type, member) \
90 for (item = dl_list_entry((list)->prev, type, member); \
91 &item->member != (list); \
92 item = dl_list_entry(item->member.prev, type, member))
94 #define DEFINE_DL_LIST(name) \
95 struct dl_list name = { &(name), &(name) }