21static inline void NL_INIT_LIST_HEAD(
struct nl_list_head *list)
27static inline void __nl_list_add(
struct nl_list_head *obj,
37static inline void nl_list_add_tail(
struct nl_list_head *obj,
40 __nl_list_add(obj, head->prev, head);
43static inline void nl_list_add_head(
struct nl_list_head *obj,
46 __nl_list_add(obj, head, head->next);
51 obj->next->prev = obj->prev;
52 obj->prev->next = obj->next;
55static inline int nl_list_empty(
struct nl_list_head *head)
57 return head->next == head;
60#define nl_container_of(ptr, type, member) ({ \
61 const __typeof__( ((type *)0)->member ) *__mptr = (ptr);\
62 (type *)( (char *)__mptr - (offsetof(type, member)));})
64#define nl_list_entry(ptr, type, member) \
65 nl_container_of(ptr, type, member)
67#define nl_list_at_tail(pos, head, member) \
68 ((pos)->member.next == (head))
70#define nl_list_at_head(pos, head, member) \
71 ((pos)->member.prev == (head))
73#define NL_LIST_HEAD(name) \
74 struct nl_list_head name = { &(name), &(name) }
76#define nl_list_first_entry(head, type, member) \
77 nl_list_entry((head)->next, type, member)
79#define nl_list_for_each_entry(pos, head, member) \
80 for (pos = nl_list_entry((head)->next, __typeof__(*pos), member); \
81 &(pos)->member != (head); \
82 (pos) = nl_list_entry((pos)->member.next, __typeof__(*(pos)), member))
84#define nl_list_for_each_entry_safe(pos, n, head, member) \
85 for (pos = nl_list_entry((head)->next, __typeof__(*pos), member), \
86 n = nl_list_entry(pos->member.next, __typeof__(*pos), member); \
87 &(pos)->member != (head); \
88 pos = n, n = nl_list_entry(n->member.next, __typeof__(*n), member))
90#define nl_init_list_head(head) \
91 do { (head)->next = (head); (head)->prev = (head); } while (0)