18 	struct foo *f;  in list_push_pop()  local
20 	f = bpf_obj_new(typeof(*f));  in list_push_pop()
21 	if (!f)  in list_push_pop()
29 		bpf_obj_drop(f);  in list_push_pop()
38 		bpf_obj_drop(f);  in list_push_pop()
44 	f->data = 42;  in list_push_pop()
45 	bpf_list_push_front(head, &f->node2);  in list_push_pop()
54 	f = container_of(n, struct foo, node2);  in list_push_pop()
55 	if (f->data != 42) {  in list_push_pop()
56 		bpf_obj_drop(f);  in list_push_pop()
61 	f->data = 13;  in list_push_pop()
62 	bpf_list_push_front(head, &f->node2);  in list_push_pop()
69 	f = container_of(n, struct foo, node2);  in list_push_pop()
70 	if (f->data != 13) {  in list_push_pop()
71 		bpf_obj_drop(f);  in list_push_pop()
74 	bpf_obj_drop(f);  in list_push_pop()
99 	struct foo *f[200], *pf;  in list_push_pop_multiple()  local
105 	if (ARRAY_SIZE(f) % 2)  in list_push_pop_multiple()
108 	for (i = 0; i < ARRAY_SIZE(f); i += 2) {  in list_push_pop_multiple()
109 		f[i] = bpf_obj_new(typeof(**f));  in list_push_pop_multiple()
110 		if (!f[i])  in list_push_pop_multiple()
112 		f[i]->data = i;  in list_push_pop_multiple()
114 		f[i + 1] = bpf_obj_new(typeof(**f));  in list_push_pop_multiple()
115 		if (!f[i + 1]) {  in list_push_pop_multiple()
116 			bpf_obj_drop(f[i]);  in list_push_pop_multiple()
119 		f[i + 1]->data = i + 1;  in list_push_pop_multiple()
122 		bpf_list_push_front(head, &f[i]->node2);  in list_push_pop_multiple()
123 		bpf_list_push_front(head, &f[i + 1]->node2);  in list_push_pop_multiple()
127 	for (i = 0; i < ARRAY_SIZE(f); i++) {  in list_push_pop_multiple()
134 		if (pf->data != (ARRAY_SIZE(f) - i - 1)) {  in list_push_pop_multiple()
146 	for (i = 0; i < ARRAY_SIZE(f); i++) {  in list_push_pop_multiple()
182 	struct foo *f;  in list_in_list()  local
185 	f = bpf_obj_new(typeof(*f));  in list_in_list()
186 	if (!f)  in list_in_list()
191 			bpf_obj_drop(f);  in list_in_list()
195 		bpf_spin_lock(&f->lock);  in list_in_list()
196 		bpf_list_push_back(&f->head, &b->node);  in list_in_list()
197 		bpf_spin_unlock(&f->lock);  in list_in_list()
201 	f->data = 42;  in list_in_list()
202 	bpf_list_push_front(head, &f->node2);  in list_in_list()
213 	f = container_of(n, struct foo, node2);  in list_in_list()
214 	if (f->data != 42) {  in list_in_list()
215 		bpf_obj_drop(f);  in list_in_list()
220 		bpf_spin_lock(&f->lock);  in list_in_list()
221 		n = bpf_list_pop_front(&f->head);  in list_in_list()
222 		bpf_spin_unlock(&f->lock);  in list_in_list()
224 			bpf_obj_drop(f);  in list_in_list()
229 			bpf_obj_drop(f);  in list_in_list()
235 	bpf_spin_lock(&f->lock);  in list_in_list()
236 	n = bpf_list_pop_front(&f->head);  in list_in_list()
237 	bpf_spin_unlock(&f->lock);  in list_in_list()
239 		bpf_obj_drop(f);  in list_in_list()
243 	bpf_obj_drop(f);  in list_in_list()
287 		return 1;  in map_list_push_pop()
299 		return 1;  in inner_map_list_push_pop()
302 		return 1;  in inner_map_list_push_pop()
319 		return 1;  in map_list_push_pop_multiple()
331 		return 1;  in inner_map_list_push_pop_multiple()
334 		return 1;  in inner_map_list_push_pop_multiple()
356 		return 1;  in map_list_in_list()
368 		return 1;  in inner_map_list_in_list()
371 		return 1;  in inner_map_list_in_list()