Lines Matching defs:hlist_node
593 struct hlist_node *first;
596 struct hlist_node {
597 struct hlist_node *next, **pprev;
603 static inline void INIT_HLIST_NODE(struct hlist_node *h)
609 static inline int hlist_unhashed(const struct hlist_node *h)
619 static inline void __hlist_del(struct hlist_node *n)
621 struct hlist_node *next = n->next;
622 struct hlist_node **pprev = n->pprev;
628 static inline void hlist_del(struct hlist_node *n)
654 static inline void hlist_del_rcu(struct hlist_node *n)
660 static inline void hlist_del_init(struct hlist_node *n)
675 static inline void hlist_replace_rcu(struct hlist_node *old,
676 struct hlist_node *new)
678 struct hlist_node *next = old->next;
689 static inline void hlist_add_head(struct hlist_node *n, struct hlist_head *h)
691 struct hlist_node *first = h->first;
719 static inline void hlist_add_head_rcu(struct hlist_node *n,
722 struct hlist_node *first = h->first;
732 static inline void hlist_add_before(struct hlist_node *n,
733 struct hlist_node *next)
741 static inline void hlist_add_after(struct hlist_node *n,
742 struct hlist_node *next)
770 static inline void hlist_add_before_rcu(struct hlist_node *n,
771 struct hlist_node *next)
798 static inline void hlist_add_after_rcu(struct hlist_node *prev,
799 struct hlist_node *n)
822 * @pos: the &struct hlist_node to use as a loop cursor.
824 * @member: the name of the hlist_node within the struct.
835 * @pos: the &struct hlist_node to use as a loop cursor.
836 * @member: the name of the hlist_node within the struct.
847 * @pos: the &struct hlist_node to use as a loop cursor.
848 * @member: the name of the hlist_node within the struct.
858 * @pos: the &struct hlist_node to use as a loop cursor.
859 * @n: another &struct hlist_node to use as temporary storage
861 * @member: the name of the hlist_node within the struct.
872 * @pos: the &struct hlist_node to use as a loop cursor.
874 * @member: the name of the hlist_node within the struct.
