48 		struct bpf_prog_list *pl, *tmp;  in cgroup_bpf_release()  local
50 		list_for_each_entry_safe(pl, tmp, progs, node) {  in cgroup_bpf_release()
51 			list_del(&pl->node);  in cgroup_bpf_release()
52 			bpf_prog_put(pl->prog);  in cgroup_bpf_release()
54 				bpf_cgroup_storage_unlink(pl->storage[stype]);  in cgroup_bpf_release()
55 				bpf_cgroup_storage_free(pl->storage[stype]);  in cgroup_bpf_release()
57 			kfree(pl);  in cgroup_bpf_release()
93 	struct bpf_prog_list *pl;  in prog_list_length()  local
96 	list_for_each_entry(pl, head, node) {  in prog_list_length()
97 		if (!pl->prog)  in prog_list_length()
144 	struct bpf_prog_list *pl;  in compute_effective_progs()  local
166 		list_for_each_entry(pl, &p->bpf.progs[type], node) {  in compute_effective_progs()
167 			if (!pl->prog)  in compute_effective_progs()
170 			progs->items[cnt].prog = pl->prog;  in compute_effective_progs()
173 					pl->storage[stype];  in compute_effective_progs()
306 	struct bpf_prog_list *pl;  in __cgroup_bpf_attach()  local
338 		list_for_each_entry(pl, progs, node) {  in __cgroup_bpf_attach()
339 			if (pl->prog == prog) {  in __cgroup_bpf_attach()
347 		pl = kmalloc(sizeof(*pl), GFP_KERNEL);  in __cgroup_bpf_attach()
348 		if (!pl) {  in __cgroup_bpf_attach()
355 		pl->prog = prog;  in __cgroup_bpf_attach()
357 			pl->storage[stype] = storage[stype];  in __cgroup_bpf_attach()
358 		list_add_tail(&pl->node, progs);  in __cgroup_bpf_attach()
361 			pl = kmalloc(sizeof(*pl), GFP_KERNEL);  in __cgroup_bpf_attach()
362 			if (!pl) {  in __cgroup_bpf_attach()
368 			list_add_tail(&pl->node, progs);  in __cgroup_bpf_attach()
370 			pl = list_first_entry(progs, typeof(*pl), node);  in __cgroup_bpf_attach()
371 			old_prog = pl->prog;  in __cgroup_bpf_attach()
373 				old_storage[stype] = pl->storage[stype];  in __cgroup_bpf_attach()
378 		pl->prog = prog;  in __cgroup_bpf_attach()
380 			pl->storage[stype] = storage[stype];  in __cgroup_bpf_attach()
405 	pl->prog = old_prog;  in __cgroup_bpf_attach()
407 		bpf_cgroup_storage_free(pl->storage[stype]);  in __cgroup_bpf_attach()
408 		pl->storage[stype] = old_storage[stype];  in __cgroup_bpf_attach()
412 		list_del(&pl->node);  in __cgroup_bpf_attach()
413 		kfree(pl);  in __cgroup_bpf_attach()
434 	struct bpf_prog_list *pl;  in __cgroup_bpf_detach()  local
451 		list_for_each_entry(pl, progs, node) {  in __cgroup_bpf_detach()
452 			if (pl->prog != prog)  in __cgroup_bpf_detach()
458 			pl->prog = NULL;  in __cgroup_bpf_detach()
467 		pl = list_first_entry(progs, typeof(*pl), node);  in __cgroup_bpf_detach()
468 		old_prog = pl->prog;  in __cgroup_bpf_detach()
469 		pl->prog = NULL;  in __cgroup_bpf_detach()
477 	list_del(&pl->node);  in __cgroup_bpf_detach()
479 		bpf_cgroup_storage_unlink(pl->storage[stype]);  in __cgroup_bpf_detach()
480 		bpf_cgroup_storage_free(pl->storage[stype]);  in __cgroup_bpf_detach()
482 	kfree(pl);  in __cgroup_bpf_detach()
493 	pl->prog = old_prog;  in __cgroup_bpf_detach()
531 		struct bpf_prog_list *pl;  in __cgroup_bpf_query()  local
535 		list_for_each_entry(pl, progs, node) {  in __cgroup_bpf_query()
536 			id = pl->prog->aux->id;  in __cgroup_bpf_query()