1 /* Taken from depthcharge: src/base/list.h */
2 /* SPDX-License-Identifier: GPL-2.0-or-later */
11 struct list_node
*next
;
12 struct list_node
*prev
;
15 // Remove list_node node from the doubly linked list it's a part of.
16 void list_remove(struct list_node
*node
);
17 // Insert list_node node after list_node after in a doubly linked list.
18 void list_insert_after(struct list_node
*node
, struct list_node
*after
);
19 // Insert list_node node before list_node before in a doubly linked list.
20 void list_insert_before(struct list_node
*node
, struct list_node
*before
);
22 #define list_for_each(ptr, head, member) \
23 for ((ptr) = container_of((head).next, typeof(*(ptr)), member); \
25 (ptr) = container_of((ptr)->member.next, \
26 typeof(*(ptr)), member))
28 #endif /* __LIST_H__ */