2 * Copyright (C) 2002 Free Software Foundation, Inc.
3 * (originally part of the GNU C Library)
4 * Contributed by Ulrich Drepper <drepper@redhat.com>, 2002.
6 * Copyright (C) 2009 Pierre-Marc Fournier
7 * Conversion to RCU list.
8 * Copyright (C) 2010 Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
10 * This library is free software; you can redistribute it and/or
11 * modify it under the terms of the GNU Lesser General Public
12 * License as published by the Free Software Foundation; either
13 * version 2.1 of the License, or (at your option) any later version.
15 * This library is distributed in the hope that it will be useful,
16 * but WITHOUT ANY WARRANTY; without even the implied warranty of
17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
18 * Lesser General Public License for more details.
20 * You should have received a copy of the GNU Lesser General Public
21 * License along with this library; if not, write to the Free Software
22 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
28 /* The definitions of this file are adopted from those which can be
29 found in the Linux kernel headers to enable people familiar with
30 the latter find their way in these sources as well. */
33 /* Basic type for the double-link list. */
36 struct cds_list_head
*next
;
37 struct cds_list_head
*prev
;
40 /* Define a variable with the head and tail of the list. */
41 #define CDS_LIST_HEAD(name) \
42 struct cds_list_head name = { &(name), &(name) }
44 /* Initialize a new list head. */
45 #define CDS_INIT_LIST_HEAD(ptr) \
46 (ptr)->next = (ptr)->prev = (ptr)
48 #define CDS_LIST_HEAD_INIT(name) { .prev = &(name), .next = &(name) }
50 /* Add new element at the head of the list. */
52 cds_list_add (struct cds_list_head
*newp
, struct cds_list_head
*head
)
54 head
->next
->prev
= newp
;
55 newp
->next
= head
->next
;
61 /* Add new element at the tail of the list. */
63 cds_list_add_tail (struct cds_list_head
*newp
, struct cds_list_head
*head
)
65 head
->prev
->next
= newp
;
67 newp
->prev
= head
->prev
;
72 /* Remove element from list. */
74 __cds_list_del (struct cds_list_head
*prev
, struct cds_list_head
*next
)
80 /* Remove element from list. */
82 cds_list_del (struct cds_list_head
*elem
)
84 __cds_list_del (elem
->prev
, elem
->next
);
87 /* Remove element from list, initializing the element's list pointers. */
89 cds_list_del_init (struct cds_list_head
*elem
)
92 CDS_INIT_LIST_HEAD(elem
);
95 /* delete from list, add to another list as head */
97 cds_list_move (struct cds_list_head
*elem
, struct cds_list_head
*head
)
99 __cds_list_del (elem
->prev
, elem
->next
);
100 cds_list_add (elem
, head
);
103 /* replace an old entry.
106 cds_list_replace(struct cds_list_head
*old
, struct cds_list_head
*_new
)
108 _new
->next
= old
->next
;
109 _new
->prev
= old
->prev
;
110 _new
->prev
->next
= _new
;
111 _new
->next
->prev
= _new
;
114 /* Join two lists. */
116 cds_list_splice (struct cds_list_head
*add
, struct cds_list_head
*head
)
118 /* Do nothing if the list which gets added is empty. */
119 if (add
!= add
->next
)
121 add
->next
->prev
= head
;
122 add
->prev
->next
= head
->next
;
123 head
->next
->prev
= add
->prev
;
124 head
->next
= add
->next
;
128 /* Returns 1 if list is empty, 0 otherwise */
130 int cds_list_empty(struct cds_list_head
*head
)
132 return head
->next
== head
->prev
;
135 /* Get typed element from list at a given position. */
136 #define cds_list_entry(ptr, type, member) \
137 ((type *) ((char *) (ptr) - (unsigned long) (&((type *) 0)->member)))
140 /* Get first entry from a list. */
141 #define cds_list_first_entry(head, type, member) \
142 cds_list_entry((head)->next, type, member)
145 /* Iterate forward over the elements of the list. */
146 #define cds_list_for_each(pos, head) \
147 for (pos = (head)->next; pos != (head); pos = pos->next)
150 /* Iterate forward over the elements of the list. */
151 #define cds_list_for_each_prev(pos, head) \
152 for (pos = (head)->prev; pos != (head); pos = pos->prev)
155 /* Iterate backwards over the elements list. The list elements can be
156 removed from the list while doing this. */
157 #define cds_list_for_each_prev_safe(pos, p, head) \
158 for (pos = (head)->prev, p = pos->prev; \
160 pos = p, p = pos->prev)
162 #define cds_list_for_each_entry(pos, head, member) \
163 for (pos = cds_list_entry((head)->next, typeof(*pos), member); \
164 &pos->member != (head); \
165 pos = cds_list_entry(pos->member.next, typeof(*pos), member))
167 #define cds_list_for_each_entry_reverse(pos, head, member) \
168 for (pos = cds_list_entry((head)->prev, typeof(*pos), member); \
169 &pos->member != (head); \
170 pos = cds_list_entry(pos->member.prev, typeof(*pos), member))
172 #define cds_list_for_each_entry_safe(pos, p, head, member) \
173 for (pos = cds_list_entry((head)->next, typeof(*pos), member), \
174 p = cds_list_entry(pos->member.next,typeof(*pos), member); \
175 &pos->member != (head); \
176 pos = p, p = cds_list_entry(pos->member.next, typeof(*pos), member))
178 static inline int cds_list_empty(struct cds_list_head
*head
)
180 return head
== head
->next
;
183 static inline void cds_list_replace_init(struct cds_list_head
*old
,
184 struct cds_list_head
*_new
)
186 struct cds_list_head
*head
= old
->next
;
188 cds_list_add_tail(_new
, head
);
189 CDS_INIT_LIST_HEAD(old
);
192 #endif /* _CDS_LIST_H */
This page took 0.057347 seconds and 4 git commands to generate.