hlist_node
struct hlist_node *first;
struct hlist_node *next, **pprev;
hlist_unhashed(const struct hlist_node *h)
hlist_del(struct hlist_node *n)
hlist_del_init(struct hlist_node *n)
hlist_add_head(struct hlist_node *n, struct hlist_head *h)
hlist_add_before(struct hlist_node *n, struct hlist_node *next)
hlist_add_after(struct hlist_node *n, struct hlist_node *next)
hash_hashed(struct hlist_node *node)
hash_del_rcu(struct hlist_node *node)
__hash_node_type_assert(struct hlist_node *node)
struct hlist_node *first;
struct hlist_node *next, **pprev;
hlist_unhashed(const struct hlist_node *h)
hlist_del(struct hlist_node *n)
hlist_del_init(struct hlist_node *n)
hlist_add_head(struct hlist_node *n, struct hlist_head *h)
hlist_add_before(struct hlist_node *n, struct hlist_node *next)
hlist_add_behind(struct hlist_node *n, struct hlist_node *prev)
hlist_del_rcu(struct hlist_node *n)
struct hlist_node *next = n->next;
struct hlist_node **pprev = n->pprev;
hlist_add_head_rcu(struct hlist_node *n, struct hlist_head *h)
struct hlist_node *first = h->first;
hlist_del_init_rcu(struct hlist_node *n)
#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)))
hlist_add_behind_rcu(struct hlist_node *n, struct hlist_node *prev)
struct hlist_node *first;
struct hlist_node *next, **pprev;
hlist_unhashed(const struct hlist_node *h)
hlist_del(struct hlist_node *n)
hlist_del_init(struct hlist_node *n)
hlist_add_head(struct hlist_node *n, struct hlist_head *h)
hlist_add_before(struct hlist_node *n, struct hlist_node *next)
hlist_add_after(struct hlist_node *n, struct hlist_node *next)
struct hlist_node hlist;
struct hlist_node list;
struct hlist_node hlist;
struct hlist_node filter_chain;
struct hlist_node hlist;
struct hlist_node *tmp;
struct hlist_node *tmp;
struct hlist_node *tmp;
struct hlist_node node;
struct hlist_node cache_node;