17 	struct bpf_list_node *n;  in list_push_pop()  local
25 	n = bpf_list_pop_front(head);  in list_push_pop()
27 	if (n) {  in list_push_pop()
28 		bpf_obj_drop(container_of(n, struct foo, node2));  in list_push_pop()
34 	n = bpf_list_pop_back(head);  in list_push_pop()
36 	if (n) {  in list_push_pop()
37 		bpf_obj_drop(container_of(n, struct foo, node2));  in list_push_pop()
50 	n = bpf_list_pop_back(head);  in list_push_pop()
52 	if (!n)  in list_push_pop()
54 	f = container_of(n, struct foo, node2);  in list_push_pop()
65 	n = bpf_list_pop_front(head);  in list_push_pop()
67 	if (!n)  in list_push_pop()
69 	f = container_of(n, struct foo, node2);  in list_push_pop()
77 	n = bpf_list_pop_front(head);  in list_push_pop()
79 	if (n) {  in list_push_pop()
80 		bpf_obj_drop(container_of(n, struct foo, node2));  in list_push_pop()
85 	n = bpf_list_pop_back(head);  in list_push_pop()
87 	if (n) {  in list_push_pop()
88 		bpf_obj_drop(container_of(n, struct foo, node2));  in list_push_pop()
98 	struct bpf_list_node *n;  in list_push_pop_multiple()  local
129 		n = bpf_list_pop_front(head);  in list_push_pop_multiple()
131 		if (!n)  in list_push_pop_multiple()
133 		pf = container_of(n, struct foo, node2);  in list_push_pop_multiple()
148 		n = bpf_list_pop_back(head);  in list_push_pop_multiple()
150 		if (!n)  in list_push_pop_multiple()
152 		pf = container_of(n, struct foo, node2);  in list_push_pop_multiple()
160 	n = bpf_list_pop_back(head);  in list_push_pop_multiple()
162 	if (n) {  in list_push_pop_multiple()
163 		bpf_obj_drop(container_of(n, struct foo, node2));  in list_push_pop_multiple()
168 	n = bpf_list_pop_front(head);  in list_push_pop_multiple()
170 	if (n) {  in list_push_pop_multiple()
171 		bpf_obj_drop(container_of(n, struct foo, node2));  in list_push_pop_multiple()
180 	struct bpf_list_node *n;  in list_in_list()  local
209 	n = bpf_list_pop_front(head);  in list_in_list()
211 	if (!n)  in list_in_list()
213 	f = container_of(n, struct foo, node2);  in list_in_list()
221 		n = bpf_list_pop_front(&f->head);  in list_in_list()
223 		if (!n) {  in list_in_list()
227 		b = container_of(n, struct bar, node);  in list_in_list()
236 	n = bpf_list_pop_front(&f->head);  in list_in_list()
238 	if (n) {  in list_in_list()
240 		bpf_obj_drop(container_of(n, struct bar, node));  in list_in_list()