44 	struct basic_head *head = rcu_dereference_bh(tp->root);  in basic_classify()  local
47 	list_for_each_entry_rcu(f, &head->flist, link) {  in basic_classify()
62 	struct basic_head *head = rtnl_dereference(tp->root);  in basic_get()  local
65 	if (head == NULL)  in basic_get()
68 	list_for_each_entry(f, &head->flist, link) {  in basic_get()
80 	struct basic_head *head;  in basic_init()  local
82 	head = kzalloc(sizeof(*head), GFP_KERNEL);  in basic_init()
83 	if (head == NULL)  in basic_init()
85 	INIT_LIST_HEAD(&head->flist);  in basic_init()
86 	rcu_assign_pointer(tp->root, head);  in basic_init()
90 static void basic_delete_filter(struct rcu_head *head)  in basic_delete_filter()  argument
92 	struct basic_filter *f = container_of(head, struct basic_filter, rcu);  in basic_delete_filter()
101 	struct basic_head *head = rtnl_dereference(tp->root);  in basic_destroy()  local
104 	if (!force && !list_empty(&head->flist))  in basic_destroy()
107 	list_for_each_entry_safe(f, n, &head->flist, link) {  in basic_destroy()
113 	kfree_rcu(head, rcu);  in basic_destroy()
170 	struct basic_head *head = rtnl_dereference(tp->root);  in basic_change()  local
201 			if (++head->hgenerator == 0x7FFFFFFF)  in basic_change()
202 				head->hgenerator = 1;  in basic_change()
203 		} while (--i > 0 && basic_get(tp, head->hgenerator));  in basic_change()
210 		fnew->handle = head->hgenerator;  in basic_change()
224 		list_add_rcu(&fnew->link, &head->flist);  in basic_change()
235 	struct basic_head *head = rtnl_dereference(tp->root);  in basic_walk()  local
238 	list_for_each_entry(f, &head->flist, link) {  in basic_walk()