6 #define list_head cds_list_head
7 #define LIST_HEAD_INIT(l) CDS_LIST_HEAD_INIT(l)
8 #define LIST_HEAD(l) CDS_LIST_HEAD(l)
9 #define INIT_LIST_HEAD(l) CDS_INIT_LIST_HEAD(l)
10 #define list_add(n, h) cds_list_add(n, h)
11 #define list_add_tail(n, h) cds_list_add_tail(n, h)
12 #define __list_del_entry(l) cds_list_del(l)
13 #define __list_del(p, n) __cds_list_del(p, n)
14 #define list_del(l) cds_list_del(l)
15 #define list_del_init(l) cds_list_del_init(l)
16 #define list_replace(o, n) cds_list_replace(o, n)
17 #define list_replace_init(o, n) cds_list_replace_init(o, n)
18 #define list_move(l, h) cds_list_move(l, h)
19 #define list_empty(l) cds_list_empty(l)
20 #define list_splice(l, h) cds_list_splice(l, h)
21 #define list_entry(p, t, m) cds_list_entry(p, t, m)
22 #define list_first_entry(p, t, m) cds_list_first_entry(p, t, m)
23 #define list_for_each(p, h) cds_list_for_each(p, h)
24 #define list_for_each_prev(p, h) cds_list_for_each_prev(p, h)
25 #define list_for_each_safe(p, n, h) cds_list_for_each_safe(p, n, h)
26 #define list_for_each_prev_safe(p, n, h) cds_list_for_each_prev_safe(p, n, h)
27 #define list_for_each_entry(p, h, m) cds_list_for_each_entry(p, h, m)
28 #define list_for_each_entry_reverse(p, h, m) cds_list_for_each_entry_reverse(p, h, m)
29 #define list_for_each_entry_safe(p, n, h, m) cds_list_for_each_entry_safe(p, n, h, m)
31 static inline int list_empty_careful(const struct list_head *head)
33 struct list_head *next = head->next;
34 return (next == head) && (next == head->prev);
37 static inline void list_move_tail(struct list_head *list,
38 struct list_head *head)
41 list_add_tail(list, head);
44 static inline void list_splice_init(struct list_head *list,
45 struct list_head *head)
47 list_splice(list, head);
51 #define list_last_entry(ptr, type, member) \
52 list_entry((ptr)->prev, type, member)
54 #define list_first_entry_or_null(ptr, type, member) \
55 (!list_empty(ptr) ? list_first_entry(ptr, type, member) : NULL)
57 #define list_prev_entry(pos, member) \
58 list_entry((pos)->member.prev, typeof(*(pos)), member)
60 #define list_for_each_entry_safe_reverse(pos, n, head, member) \
61 for (pos = list_last_entry(head, typeof(*pos), member), \
62 n = list_prev_entry(pos, member); \
63 &pos->member != (head); \
64 pos = n, n = list_prev_entry(n, member))
68 #include <urcu/hlist.h>
70 #define hlist_head cds_hlist_head
71 #define hlist_node cds_hlist_node
73 #define hlist_add_head(n, h) cds_hlist_add_head(n, h)
74 #define hlist_del(n) cds_hlist_del(n)
76 #define hlist_entry(ptr, type, member) container_of(ptr,type,member)
78 #define hlist_entry_safe(ptr, type, member) \
79 ({ typeof(ptr) ____ptr = (ptr); \
80 ____ptr ? hlist_entry(____ptr, type, member) : NULL; \
83 #define hlist_for_each_entry(pos, head, member) \
84 for (pos = hlist_entry_safe((head)->next, typeof(*(pos)), member);\
86 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
88 #endif /* _LIST_LIST_H */