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
25 #ifndef _URCU_RCUHLIST_H
26 #define _URCU_RCUHLIST_H
28 #include <urcu/hlist.h>
29 #include <urcu/arch.h>
30 #include <urcu-pointer.h>
32 /* Add new element at the head of the list.
34 static inline void cds_hlist_add_head_rcu(struct cds_hlist_node
*newp
,
35 struct cds_hlist_head
*head
)
37 newp
->next
= head
->next
;
38 newp
->prev
= (struct cds_hlist_node
*)head
;
41 head
->next
->prev
= newp
;
45 /* Remove element from list. */
46 static inline void cds_hlist_del_rcu(struct cds_hlist_node
*elem
)
49 elem
->next
->prev
= elem
->prev
;
50 elem
->prev
->next
= elem
->next
;
54 * Get first element from a RCU hlist. Assumes the hlist is not empty.
55 * This must be done while rcu_read_lock() is held.
57 #define cds_hlist_first_rcu(ptr, type) \
58 rcu_dereference((ptr)->next)
61 * Get first entry from a RCU hlist. Assumes the hlist is not empty.
62 * This must be done while rcu_read_lock() is held.
64 #define cds_hlist_first_entry_rcu(ptr, type, member) \
65 cds_hlist_entry(rcu_dereference((ptr)->next), type, member)
68 * Iterate through nodes of the list.
69 * This must be done while rcu_read_lock() is held.
72 #define cds_hlist_for_each_rcu(pos, head) \
73 for (pos = rcu_dereference((head)->next); \
75 pos = rcu_dereference((pos)->next))
78 * Iterate through elements of the list.
79 * This must be done while rcu_read_lock() is held.
82 #define cds_hlist_for_each_entry_rcu(entry, pos, head, member) \
83 for (pos = rcu_dereference((head)->next), \
84 entry = cds_hlist_entry(pos, __typeof__(*entry), member); \
86 pos = rcu_dereference(pos->next), \
87 entry = cds_hlist_entry(pos, __typeof__(*entry), member))
89 #endif /* _URCU_RCUHLIST_H */
This page took 0.030476 seconds and 4 git commands to generate.