32 		struct bpf_prog_list *pl, *tmp;  in cgroup_bpf_put()  local
34 		list_for_each_entry_safe(pl, tmp, progs, node) {  in cgroup_bpf_put()
35 			list_del(&pl->node);  in cgroup_bpf_put()
36 			bpf_prog_put(pl->prog);  in cgroup_bpf_put()
37 			bpf_cgroup_storage_unlink(pl->storage);  in cgroup_bpf_put()
38 			bpf_cgroup_storage_free(pl->storage);  in cgroup_bpf_put()
39 			kfree(pl);  in cgroup_bpf_put()
51 	struct bpf_prog_list *pl;  in prog_list_length()  local
54 	list_for_each_entry(pl, head, node) {  in prog_list_length()
55 		if (!pl->prog)  in prog_list_length()
101 	struct bpf_prog_list *pl;  in compute_effective_progs()  local
123 		list_for_each_entry(pl, &p->bpf.progs[type], node) {  in compute_effective_progs()
124 			if (!pl->prog)  in compute_effective_progs()
127 			progs->items[cnt].prog = pl->prog;  in compute_effective_progs()
128 			progs->items[cnt].cgroup_storage = pl->storage;  in compute_effective_progs()
236 	struct bpf_prog_list *pl;  in __cgroup_bpf_attach()  local
262 		list_for_each_entry(pl, progs, node) {  in __cgroup_bpf_attach()
263 			if (pl->prog == prog) {  in __cgroup_bpf_attach()
270 		pl = kmalloc(sizeof(*pl), GFP_KERNEL);  in __cgroup_bpf_attach()
271 		if (!pl) {  in __cgroup_bpf_attach()
277 		pl->prog = prog;  in __cgroup_bpf_attach()
278 		pl->storage = storage;  in __cgroup_bpf_attach()
279 		list_add_tail(&pl->node, progs);  in __cgroup_bpf_attach()
282 			pl = kmalloc(sizeof(*pl), GFP_KERNEL);  in __cgroup_bpf_attach()
283 			if (!pl) {  in __cgroup_bpf_attach()
288 			list_add_tail(&pl->node, progs);  in __cgroup_bpf_attach()
290 			pl = list_first_entry(progs, typeof(*pl), node);  in __cgroup_bpf_attach()
291 			old_prog = pl->prog;  in __cgroup_bpf_attach()
292 			old_storage = pl->storage;  in __cgroup_bpf_attach()
296 		pl->prog = prog;  in __cgroup_bpf_attach()
297 		pl->storage = storage;  in __cgroup_bpf_attach()
318 	pl->prog = old_prog;  in __cgroup_bpf_attach()
319 	bpf_cgroup_storage_free(pl->storage);  in __cgroup_bpf_attach()
320 	pl->storage = old_storage;  in __cgroup_bpf_attach()
323 		list_del(&pl->node);  in __cgroup_bpf_attach()
324 		kfree(pl);  in __cgroup_bpf_attach()
344 	struct bpf_prog_list *pl;  in __cgroup_bpf_detach()  local
361 		list_for_each_entry(pl, progs, node) {  in __cgroup_bpf_detach()
362 			if (pl->prog != prog)  in __cgroup_bpf_detach()
368 			pl->prog = NULL;  in __cgroup_bpf_detach()
377 		pl = list_first_entry(progs, typeof(*pl), node);  in __cgroup_bpf_detach()
378 		old_prog = pl->prog;  in __cgroup_bpf_detach()
379 		pl->prog = NULL;  in __cgroup_bpf_detach()
387 	list_del(&pl->node);  in __cgroup_bpf_detach()
388 	bpf_cgroup_storage_unlink(pl->storage);  in __cgroup_bpf_detach()
389 	bpf_cgroup_storage_free(pl->storage);  in __cgroup_bpf_detach()
390 	kfree(pl);  in __cgroup_bpf_detach()
401 	pl->prog = old_prog;  in __cgroup_bpf_detach()
436 		struct bpf_prog_list *pl;  in __cgroup_bpf_query()  local
440 		list_for_each_entry(pl, progs, node) {  in __cgroup_bpf_query()
441 			id = pl->prog->aux->id;  in __cgroup_bpf_query()