1 /* SPDX-License-Identifier: BSD-3-Clause
15 struct list_head *prev;
16 struct list_head *next;
19 #define COMPAT_LIST_HEAD(n) \
20 struct list_head n = { \
25 #define INIT_LIST_HEAD(p) \
27 struct list_head *__p298 = (p); \
28 __p298->next = __p298; \
29 __p298->prev = __p298->next; \
31 #define list_entry(node, type, member) \
32 (type *)((void *)node - offsetof(type, member))
33 #define list_empty(p) \
35 const struct list_head *__p298 = (p); \
36 ((__p298->next == __p298) && (__p298->prev == __p298)); \
38 #define list_add(p, l) \
40 struct list_head *__p298 = (p); \
41 struct list_head *__l298 = (l); \
42 __p298->next = __l298->next; \
43 __p298->prev = __l298; \
44 __l298->next->prev = __p298; \
45 __l298->next = __p298; \
47 #define list_add_tail(p, l) \
49 struct list_head *__p298 = (p); \
50 struct list_head *__l298 = (l); \
51 __p298->prev = __l298->prev; \
52 __p298->next = __l298; \
53 __l298->prev->next = __p298; \
54 __l298->prev = __p298; \
56 #define list_for_each(i, l) \
57 for (i = (l)->next; i != (l); i = i->next)
58 #define list_for_each_safe(i, j, l) \
59 for (i = (l)->next, j = i->next; i != (l); \
61 #define list_for_each_entry(i, l, name) \
62 for (i = list_entry((l)->next, typeof(*i), name); &i->name != (l); \
63 i = list_entry(i->name.next, typeof(*i), name))
64 #define list_for_each_entry_safe(i, j, l, name) \
65 for (i = list_entry((l)->next, typeof(*i), name), \
66 j = list_entry(i->name.next, typeof(*j), name); \
68 i = j, j = list_entry(j->name.next, typeof(*j), name))
71 (i)->next->prev = (i)->prev; \
72 (i)->prev->next = (i)->next; \
75 #endif /* __DPAA_LIST_H */