1 /* SPDX-License-Identifier: GPL-2.0 */
3 struct list
*next
, *prev
;
7 list_init(struct list
*list
)
14 list_empty(struct list
*list
)
16 return list
->next
== list
;
20 list_insert(struct list
*link
, struct list
*new_link
)
22 new_link
->prev
= link
->prev
;
23 new_link
->next
= link
;
24 new_link
->prev
->next
= new_link
;
25 new_link
->next
->prev
= new_link
;
29 list_append(struct list
*list
, struct list
*new_link
)
31 list_insert((struct list
*)list
, new_link
);
35 list_prepend(struct list
*list
, struct list
*new_link
)
37 list_insert(list
->next
, new_link
);
41 list_remove(struct list
*link
)
43 link
->prev
->next
= link
->next
;
44 link
->next
->prev
= link
->prev
;
47 #define list_entry(link, type, member) \
48 ((type *)((char *)(link)-(unsigned long)(&((type *)0)->member)))
50 #define list_head(list, type, member) \
51 list_entry((list)->next, type, member)
53 #define list_tail(list, type, member) \
54 list_entry((list)->prev, type, member)
56 #define list_next(elm, member) \
57 list_entry((elm)->member.next, typeof(*elm), member)
59 #define list_for_each_entry(pos, list, member) \
60 for (pos = list_head(list, typeof(*pos), member); \
61 &pos->member != (list); \
62 pos = list_next(pos, member))