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
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
|
// SPDX-FileCopyrightText: 2002 Free Software Foundation, Inc.
// SPDX-FileCopyrightText: 2009 Pierre-Marc Fournier
// SPDX-FileCopyrightText: 2010 Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
//
// SPDX-License-Identifier: LGPL-2.1-or-later
/*
* (originally part of the GNU C Library)
* Contributed by Ulrich Drepper <drepper@redhat.com>, 2002.
*/
#ifndef _CDS_LIST_H
#define _CDS_LIST_H 1
#include <urcu/compiler.h>
/*
* The definitions of this file are adopted from those which can be
* found in the Linux kernel headers to enable people familiar with the
* latter find their way in these sources as well.
*/
/* Basic type for the double-link list. */
struct cds_list_head {
struct cds_list_head *next, *prev;
};
/* Define a variable with the head and tail of the list. */
#define CDS_LIST_HEAD(name) \
struct cds_list_head name = { &(name), &(name) }
/* Initialize a new list head. */
#define CDS_INIT_LIST_HEAD(ptr) \
(ptr)->next = (ptr)->prev = (ptr)
#define CDS_LIST_HEAD_INIT(name) { .next = &(name), .prev = &(name) }
/* Add new element at the head of the list. */
static inline
void cds_list_add(struct cds_list_head *newp, struct cds_list_head *head)
{
head->next->prev = newp;
newp->next = head->next;
newp->prev = head;
head->next = newp;
}
/* Add new element at the tail of the list. */
static inline
void cds_list_add_tail(struct cds_list_head *newp, struct cds_list_head *head)
{
head->prev->next = newp;
newp->next = head;
newp->prev = head->prev;
head->prev = newp;
}
/* Remove element from list. */
static inline
void __cds_list_del(struct cds_list_head *prev, struct cds_list_head *next)
{
next->prev = prev;
prev->next = next;
}
/* Remove element from list. */
static inline
void cds_list_del(struct cds_list_head *elem)
{
__cds_list_del(elem->prev, elem->next);
}
/* Remove element from list, initializing the element's list pointers. */
static inline
void cds_list_del_init(struct cds_list_head *elem)
{
cds_list_del(elem);
CDS_INIT_LIST_HEAD(elem);
}
/* Delete from list, add to another list as head. */
static inline
void cds_list_move(struct cds_list_head *elem, struct cds_list_head *head)
{
__cds_list_del(elem->prev, elem->next);
cds_list_add(elem, head);
}
/* Replace an old entry. */
static inline
void cds_list_replace(const struct cds_list_head *old, struct cds_list_head *_new)
{
_new->next = old->next;
_new->prev = old->prev;
_new->prev->next = _new;
_new->next->prev = _new;
}
/* Join two lists. */
static inline
void cds_list_splice(struct cds_list_head *add, struct cds_list_head *head)
{
/* Do nothing if the list which gets added is empty. */
if (add != add->next) {
add->next->prev = head;
add->prev->next = head->next;
head->next->prev = add->prev;
head->next = add->next;
}
}
/* Get typed element from list at a given position. */
#define cds_list_entry(ptr, type, member) caa_container_of(ptr, type, member)
/* Get first entry from a list. */
#define cds_list_first_entry(ptr, type, member) \
cds_list_entry((ptr)->next, type, member)
/* Iterate forward over the elements of the list. */
#define cds_list_for_each(pos, head) \
for (pos = (head)->next; (pos) != (head); pos = (pos)->next)
/*
* Iterate forward over the elements list. The list elements can be
* removed from the list while doing this.
*/
#define cds_list_for_each_safe(pos, p, head) \
for (pos = (head)->next, p = (pos)->next; \
(pos) != (head); \
pos = (p), p = (pos)->next)
/* Iterate backward over the elements of the list. */
#define cds_list_for_each_prev(pos, head) \
for (pos = (head)->prev; (pos) != (head); pos = (pos)->prev)
/*
* Iterate backwards over the elements list. The list elements can be
* removed from the list while doing this.
*/
#define cds_list_for_each_prev_safe(pos, p, head) \
for (pos = (head)->prev, p = (pos)->prev; \
(pos) != (head); \
pos = (p), p = (pos)->prev)
#define cds_list_for_each_entry(pos, head, member) \
for (pos = cds_list_entry((head)->next, __typeof__(*(pos)), member); \
&(pos)->member != (head); \
pos = cds_list_entry((pos)->member.next, __typeof__(*(pos)), member))
#define cds_list_for_each_entry_reverse(pos, head, member) \
for (pos = cds_list_entry((head)->prev, __typeof__(*(pos)), member); \
&(pos)->member != (head); \
pos = cds_list_entry((pos)->member.prev, __typeof__(*(pos)), member))
#define cds_list_for_each_entry_safe(pos, p, head, member) \
for (pos = cds_list_entry((head)->next, __typeof__(*(pos)), member), \
p = cds_list_entry((pos)->member.next, __typeof__(*(pos)), member); \
&(pos)->member != (head); \
pos = (p), p = cds_list_entry((pos)->member.next, __typeof__(*(pos)), member))
/*
* Same as cds_list_for_each_entry_safe, but starts from "pos" which should
* point to an entry within the list.
*/
#define cds_list_for_each_entry_safe_from(pos, p, head, member) \
for (p = cds_list_entry((pos)->member.next, __typeof__(*(pos)), member); \
&(pos)->member != (head); \
pos = (p), p = cds_list_entry((pos)->member.next, __typeof__(*(pos)), member))
static inline
int cds_list_empty(const struct cds_list_head *head)
{
return head == head->next;
}
static inline
void cds_list_replace_init(struct cds_list_head *old,
struct cds_list_head *_new)
{
struct cds_list_head *head = old->next;
cds_list_del(old);
cds_list_add_tail(_new, head);
CDS_INIT_LIST_HEAD(old);
}
#endif /* _CDS_LIST_H */
|
