1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
|
#ifndef _LINUX_LIST_H
#define _LINUX_LIST_H
#include <urcu/list.h>
#define list_head cds_list_head
#define LIST_HEAD_INIT(l) CDS_LIST_HEAD_INIT(l)
#define LIST_HEAD(l) CDS_LIST_HEAD(l)
#define INIT_LIST_HEAD(l) CDS_INIT_LIST_HEAD(l)
#define list_add(n, h) cds_list_add(n, h)
#define list_add_tail(n, h) cds_list_add_tail(n, h)
#define __list_del_entry(l) cds_list_del(l)
#define __list_del(p, n) __cds_list_del(p, n)
#define list_del(l) cds_list_del(l)
#define list_del_init(l) cds_list_del_init(l)
#define list_replace(o, n) cds_list_replace(o, n)
#define list_replace_init(o, n) cds_list_replace_init(o, n)
#define list_move(l, h) cds_list_move(l, h)
#define list_empty(l) cds_list_empty(l)
#define list_splice(l, h) cds_list_splice(l, h)
#define list_entry(p, t, m) cds_list_entry(p, t, m)
#define list_first_entry(p, t, m) cds_list_first_entry(p, t, m)
#define list_for_each(p, h) cds_list_for_each(p, h)
#define list_for_each_prev(p, h) cds_list_for_each_prev(p, h)
#define list_for_each_safe(p, n, h) cds_list_for_each_safe(p, n, h)
#define list_for_each_prev_safe(p, n, h) cds_list_for_each_prev_safe(p, n, h)
#define list_for_each_entry(p, h, m) cds_list_for_each_entry(p, h, m)
#define list_for_each_entry_reverse(p, h, m) cds_list_for_each_entry_reverse(p, h, m)
#define list_for_each_entry_safe(p, n, h, m) cds_list_for_each_entry_safe(p, n, h, m)
static inline int list_empty_careful(const struct list_head *head)
{
struct list_head *next = head->next;
return (next == head) && (next == head->prev);
}
static inline void list_move_tail(struct list_head *list,
struct list_head *head)
{
list_del(list);
list_add_tail(list, head);
}
static inline void list_splice_init(struct list_head *list,
struct list_head *head)
{
list_splice(list, head);
INIT_LIST_HEAD(list);
}
#define list_last_entry(ptr, type, member) \
list_entry((ptr)->prev, type, member)
#define list_first_entry_or_null(ptr, type, member) \
(!list_empty(ptr) ? list_first_entry(ptr, type, member) : NULL)
#define list_prev_entry(pos, member) \
list_entry((pos)->member.prev, typeof(*(pos)), member)
#define list_for_each_entry_safe_reverse(pos, n, head, member) \
for (pos = list_last_entry(head, typeof(*pos), member), \
n = list_prev_entry(pos, member); \
&pos->member != (head); \
pos = n, n = list_prev_entry(n, member))
/* hlists: */
#include <urcu/hlist.h>
#define hlist_head cds_hlist_head
#define hlist_node cds_hlist_node
#define hlist_add_head(n, h) cds_hlist_add_head(n, h)
#define hlist_del(n) cds_hlist_del(n)
#define hlist_del_init(n) cds_hlist_del_init(n)
static inline int hlist_unhashed(const struct hlist_node *h)
{
return !h->prev;
}
static inline void hlist_del_init(struct hlist_node *n)
{
hlist_del(n);
n->prev = NULL;
n->next = NULL;
}
#define hlist_entry(ptr, type, member) container_of(ptr,type,member)
#define hlist_entry_safe(ptr, type, member) \
({ typeof(ptr) ____ptr = (ptr); \
____ptr ? hlist_entry(____ptr, type, member) : NULL; \
})
#define hlist_for_each_entry(pos, head, member) \
for (pos = hlist_entry_safe((head)->next, typeof(*(pos)), member);\
pos; \
pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
static inline size_t list_count_nodes(struct list_head *head)
{
struct list_head *pos;
size_t count = 0;
list_for_each(pos, head)
count++;
return count;
}
#endif /* _LIST_LIST_H */
|
