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 static inline void dl_list_init(struct dl_list *list)
26 static inline void dl_list_add(struct dl_list *list, struct dl_list *item)
28 item->next = list->next;
30 list->next->prev = item;
34 static inline void dl_list_add_tail(struct dl_list *list, struct dl_list *item)
36 dl_list_add(list->prev, item);
39 static inline void dl_list_del(struct dl_list *item)
41 item->next->prev = item->prev;
42 item->prev->next = item->next;
47 static inline int dl_list_empty(struct dl_list *list)
49 return list->next == list;
52 static inline unsigned int dl_list_len(struct dl_list *list)
56 for (item = list->next; item != list; item = item->next)
62 #define offsetof(type, member) ((long) &((type *) 0)->member)
65 #define dl_list_entry(item, type, member) \
66 ((type *) ((char *) item - offsetof(type, member)))
68 #define dl_list_first(list, type, member) \
69 (dl_list_empty((list)) ? NULL : \
70 dl_list_entry((list)->next, type, member))
72 #define dl_list_last(list, type, member) \
73 (dl_list_empty((list)) ? NULL : \
74 dl_list_entry((list)->prev, type, member))
76 #define dl_list_for_each(item, list, type, member) \
77 for (item = dl_list_entry((list)->next, type, member); \
78 &item->member != (list); \
79 item = dl_list_entry(item->member.next, type, member))
81 #define dl_list_for_each_safe(item, n, list, type, member) \
82 for (item = dl_list_entry((list)->next, type, member), \
83 n = dl_list_entry(item->member.next, type, member); \
84 &item->member != (list); \
85 item = n, n = dl_list_entry(n->member.next, type, member))
87 #define dl_list_for_each_reverse(item, list, type, member) \
88 for (item = dl_list_entry((list)->prev, type, member); \
89 &item->member != (list); \
90 item = dl_list_entry(item->member.prev, type, member))
92 #define DEFINE_DL_LIST(name) \
93 struct dl_list name = { &(name), &(name) }