rculist.h and list.h style cleanup
[urcu.git] / urcu / rculist.h
CommitLineData
a00718e7
MD
1/*
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.
5 *
6 * Copyright (C) 2009 Pierre-Marc Fournier
7 * Conversion to RCU list.
8 * Copyright (C) 2010 Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
9 *
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.
14 *
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.
19 *
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
23 */
7a50dcf7 24
63ff4873
MD
25#ifndef _URCU_RCULIST_H
26#define _URCU_RCULIST_H
27
28#include <urcu/list.h>
3cd243cb
MD
29#include <urcu/arch.h>
30#include <urcu-pointer.h>
7a50dcf7 31
e6decba5
MD
32/* Add new element at the head of the list. */
33static inline
34void cds_list_add_rcu(struct cds_list_head *newp, struct cds_list_head *head)
7a50dcf7 35{
63ff4873
MD
36 newp->next = head->next;
37 newp->prev = head;
5481ddb3 38 cmm_smp_wmb();
63ff4873
MD
39 head->next->prev = newp;
40 head->next = newp;
7a50dcf7
MD
41}
42
e6decba5
MD
43/*
44 * Replace an old entry atomically with respect to concurrent RCU
45 * traversal. Mutual exclusion against concurrent updates is required
46 * though.
5db941e8 47 */
e6decba5
MD
48static inline
49void cds_list_replace_rcu(struct cds_list_head *old, struct cds_list_head *_new)
5db941e8
MD
50{
51 _new->next = old->next;
52 _new->prev = old->prev;
53 rcu_assign_pointer(_new->prev->next, _new);
54 _new->next->prev = _new;
55}
7a50dcf7 56
63ff4873 57/* Remove element from list. */
e6decba5
MD
58static inline
59void cds_list_del_rcu(struct cds_list_head *elem)
7a50dcf7 60{
63ff4873
MD
61 elem->next->prev = elem->prev;
62 elem->prev->next = elem->next;
7a50dcf7
MD
63}
64
5db941e8
MD
65/*
66 * Iteration through all elements of the list must be done while rcu_read_lock()
67 * is held.
68 */
69
70/* Iterate forward over the elements of the list. */
16aa9ee8 71#define cds_list_for_each_rcu(pos, head) \
e6decba5
MD
72 for (pos = rcu_dereference((head)->next); pos != (head); \
73 pos = rcu_dereference(pos->next))
5db941e8 74
7a50dcf7 75
e6decba5
MD
76/* Iterate through elements of the list. */
77#define cds_list_for_each_entry_rcu(pos, head, member) \
78 for (pos = cds_list_entry(rcu_dereference((head)->next), __typeof__(*pos), member); \
79 &pos->member != (head); \
80 pos = cds_list_entry(rcu_dereference(pos->member.next), __typeof__(*pos), member))
7a50dcf7 81
63ff4873 82#endif /* _URCU_RCULIST_H */
This page took 0.030705 seconds and 4 git commands to generate.