Lines Matching refs:list
40 #include <linux/list.h>
723 or a list and the lookup is made under lock preventing hash table
774 static inline void __sk_add_node(struct sock *sk, struct hlist_head *list)
776 hlist_add_head(&sk->sk_node, list);
779 static inline void sk_add_node(struct sock *sk, struct hlist_head *list)
782 __sk_add_node(sk, list);
785 static inline void sk_add_node_rcu(struct sock *sk, struct hlist_head *list)
790 hlist_add_tail_rcu(&sk->sk_node, list);
792 hlist_add_head_rcu(&sk->sk_node, list);
795 static inline void sk_add_node_tail_rcu(struct sock *sk, struct hlist_head *list)
798 hlist_add_tail_rcu(&sk->sk_node, list);
801 static inline void __sk_nulls_add_node_rcu(struct sock *sk, struct hlist_nulls_head *list)
803 hlist_nulls_add_head_rcu(&sk->sk_nulls_node, list);
806 static inline void __sk_nulls_add_node_tail_rcu(struct sock *sk, struct hlist_nulls_head *list)
808 hlist_nulls_add_tail_rcu(&sk->sk_nulls_node, list);
811 static inline void sk_nulls_add_node_rcu(struct sock *sk, struct hlist_nulls_head *list)
814 __sk_nulls_add_node_rcu(sk, list);
823 struct hlist_head *list)
825 hlist_add_head(&sk->sk_bind_node, list);
828 #define sk_for_each(__sk, list) \
829 hlist_for_each_entry(__sk, list, sk_node)
830 #define sk_for_each_rcu(__sk, list) \
831 hlist_for_each_entry_rcu(__sk, list, sk_node)
832 #define sk_nulls_for_each(__sk, node, list) \
833 hlist_nulls_for_each_entry(__sk, node, list, sk_nulls_node)
834 #define sk_nulls_for_each_rcu(__sk, node, list) \
835 hlist_nulls_for_each_entry_rcu(__sk, node, list, sk_nulls_node)
841 #define sk_for_each_safe(__sk, tmp, list) \
842 hlist_for_each_entry_safe(__sk, tmp, list, sk_node)
843 #define sk_for_each_bound(__sk, list) \
844 hlist_for_each_entry(__sk, list, sk_bind_node)
847 * sk_for_each_entry_offset_rcu - iterate over a list at a given struct offset
850 * @head: the head for your list.
1826 * * Each access point to socket (an hash table bucket, reference from a list,