2 * Copyright (c) 2015 François Tigeot
3 * Copyright (c) 2016-2017 Mellanox Technologies, Ltd.
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
9 * 1. Redistributions of source code must retain the above copyright
10 * notice unmodified, this list of conditions, and the following
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
16 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
17 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
18 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
19 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
20 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
21 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
22 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
23 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
24 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
25 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
30 #ifndef _LINUX_RCULIST_H_
31 #define _LINUX_RCULIST_H_
33 #include <linux/list.h>
34 #include <linux/rcupdate.h>
36 #define hlist_first_rcu(head) (*((struct hlist_node **)(&(head)->first)))
37 #define hlist_next_rcu(node) (*((struct hlist_node **)(&(node)->next)))
38 #define hlist_pprev_rcu(node) (*((struct hlist_node **)((node)->pprev)))
41 hlist_add_behind_rcu(struct hlist_node *n, struct hlist_node *prev)
44 n->pprev = &prev->next;
45 rcu_assign_pointer(hlist_next_rcu(prev), n);
47 n->next->pprev = &n->next;
50 #define hlist_for_each_entry_rcu(pos, head, member) \
51 hlist_for_each_entry(pos, head, member)
54 hlist_del_rcu(struct hlist_node *n)
56 struct hlist_node *next = n->next;
57 struct hlist_node **pprev = n->pprev;
59 WRITE_ONCE(*pprev, next);
65 hlist_add_head_rcu(struct hlist_node *n, struct hlist_head *h)
67 struct hlist_node *first = h->first;
71 rcu_assign_pointer(hlist_first_rcu(h), n);
73 first->pprev = &n->next;
77 hlist_del_init_rcu(struct hlist_node *n)
79 if (!hlist_unhashed(n)) {
85 #endif /* _LINUX_RCULIST_H_ */