86 lines
2.6 KiB
C
86 lines
2.6 KiB
C
|
/*-
|
||
|
|
* Copyright (c) 2015 François Tigeot
|
||
|
|
* Copyright (c) 2016-2017 Mellanox Technologies, Ltd.
|
||
|
|
* All rights reserved.
|
||
|
|
*
|
||
|
|
* Redistribution and use in source and binary forms, with or without
|
||
|
|
* modification, are permitted provided that the following conditions
|
||
|
|
* are met:
|
||
|
|
* 1. Redistributions of source code must retain the above copyright
|
||
|
|
* notice unmodified, this list of conditions, and the following
|
||
|
|
* disclaimer.
|
||
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
||
|
|
* notice, this list of conditions and the following disclaimer in the
|
||
|
|
* documentation and/or other materials provided with the distribution.
|
||
|
|
*
|
||
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
||
|
|
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
||
|
|
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
||
|
|
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
||
|
|
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
||
|
|
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
||
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
||
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
||
|
|
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||
|
|
*
|
||
|
|
* $FreeBSD$
|
||
|
|
*/
|
||
|
|
|
||
|
|
#ifndef _LINUX_RCULIST_H_
|
||
|
|
#define _LINUX_RCULIST_H_
|
||
|
|
|
||
|
|
#include <linux/list.h>
|
||
|
|
#include <linux/rcupdate.h>
|
||
|
|
|
||
|
|
#define hlist_first_rcu(head) (*((struct hlist_node **)(&(head)->first)))
|
||
|
|
#define hlist_next_rcu(node) (*((struct hlist_node **)(&(node)->next)))
|
||
|
|
#define hlist_pprev_rcu(node) (*((struct hlist_node **)((node)->pprev)))
|
||
|
|
|
||
|
|
static inline void
|
||
|
|
hlist_add_behind_rcu(struct hlist_node *n, struct hlist_node *prev)
|
||
|
|
{
|
||
|
|
n->next = prev->next;
|
||
|
|
n->pprev = &prev->next;
|
||
|
|
rcu_assign_pointer(hlist_next_rcu(prev), n);
|
||
|
|
if (n->next)
|
||
|
|
n->next->pprev = &n->next;
|
||
|
|
}
|
||
|
|
|
||
|
|
#define hlist_for_each_entry_rcu(pos, head, member) \
|
||
|
|
hlist_for_each_entry(pos, head, member)
|
||
|
|
|
||
|
|
static inline void
|
||
|
|
hlist_del_rcu(struct hlist_node *n)
|
||
|
|
{
|
||
|
|
struct hlist_node *next = n->next;
|
||
|
|
struct hlist_node **pprev = n->pprev;
|
||
|
|
|
||
|
|
WRITE_ONCE(*pprev, next);
|
||
|
|
if (next)
|
||
|
|
next->pprev = pprev;
|
||
|
|
}
|
||
|
|
|
||
|
|
static inline void
|
||
|
|
hlist_add_head_rcu(struct hlist_node *n, struct hlist_head *h)
|
||
|
|
{
|
||
|
|
struct hlist_node *first = h->first;
|
||
|
|
|
||
|
|
n->next = first;
|
||
|
|
n->pprev = &h->first;
|
||
|
|
rcu_assign_pointer(hlist_first_rcu(h), n);
|
||
|
|
if (first)
|
||
|
|
first->pprev = &n->next;
|
||
|
|
}
|
||
|
|
|
||
|
|
static inline void
|
||
|
|
hlist_del_init_rcu(struct hlist_node *n)
|
||
|
|
{
|
||
|
|
if (!hlist_unhashed(n)) {
|
||
|
|
hlist_del_rcu(n);
|
||
|
|
n->pprev = NULL;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
#endif /* _LINUX_RCULIST_H_ */
|