]>
git.proxmox.com Git - mirror_iproute2.git/blob - include/list.h
1 /* SPDX-License-Identifier: GPL-2.0 */
4 /* List and hash list stuff from kernel */
8 #define container_of(ptr, type, member) ({ \
9 const typeof( ((type *)0)->member ) *__mptr = (ptr); \
10 (type *)( (char *)__mptr - offsetof(type,member) );})
13 struct list_head
*next
, *prev
;
16 static inline void INIT_LIST_HEAD(struct list_head
*list
)
22 static inline void __list_add(struct list_head
*new,
23 struct list_head
*prev
,
24 struct list_head
*next
)
32 static inline void list_add(struct list_head
*new, struct list_head
*head
)
34 __list_add(new, head
, head
->next
);
37 static inline void list_add_tail(struct list_head
*new, struct list_head
*head
)
39 __list_add(new, head
->prev
, head
);
42 static inline void __list_del(struct list_head
*prev
, struct list_head
*next
)
48 static inline void list_del(struct list_head
*entry
)
50 __list_del(entry
->prev
, entry
->next
);
53 #define list_entry(ptr, type, member) \
54 container_of(ptr, type, member)
56 #define list_first_entry(ptr, type, member) \
57 list_entry((ptr)->next, type, member)
59 #define list_last_entry(ptr, type, member) \
60 list_entry((ptr)->prev, type, member)
62 #define list_next_entry(pos, member) \
63 list_entry((pos)->member.next, typeof(*(pos)), member)
65 #define list_prev_entry(pos, member) \
66 list_entry((pos)->member.prev, typeof(*(pos)), member)
68 #define list_for_each_entry(pos, head, member) \
69 for (pos = list_first_entry(head, typeof(*pos), member); \
70 &pos->member != (head); \
71 pos = list_next_entry(pos, member))
73 #define list_for_each_entry_safe(pos, n, head, member) \
74 for (pos = list_first_entry(head, typeof(*pos), member), \
75 n = list_next_entry(pos, member); \
76 &pos->member != (head); \
77 pos = n, n = list_next_entry(n, member))
79 #define list_for_each_entry_reverse(pos, head, member) \
80 for (pos = list_last_entry(head, typeof(*pos), member); \
81 &pos->member != (head); \
82 pos = list_prev_entry(pos, member))
85 struct hlist_node
*first
;
89 struct hlist_node
*next
, **pprev
;
92 static inline void hlist_del(struct hlist_node
*n
)
94 struct hlist_node
*next
= n
->next
;
95 struct hlist_node
**pprev
= n
->pprev
;
101 static inline void hlist_add_head(struct hlist_node
*n
, struct hlist_head
*h
)
103 struct hlist_node
*first
= h
->first
;
106 first
->pprev
= &n
->next
;
108 n
->pprev
= &h
->first
;
111 static inline int list_empty(const struct list_head
*head
)
113 return head
->next
== head
;
116 #define hlist_for_each(pos, head) \
117 for (pos = (head)->first; pos ; pos = pos->next)
120 #define hlist_for_each_safe(pos, n, head) \
121 for (pos = (head)->first; pos && ({ n = pos->next; 1; }); \
124 #define hlist_entry_safe(ptr, type, member) \
125 ({ typeof(ptr) ____ptr = (ptr); \
126 ____ptr ? hlist_entry(____ptr, type, member) : NULL; \
129 #define hlist_for_each_entry(pos, head, member) \
130 for (pos = hlist_entry_safe((head)->first, typeof(*(pos)), member);\
132 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
134 #endif /* __LIST_H__ */