Lines Matching refs:l
207 struct cgroup_pidlist *l, *tmp_l; in cgroup1_pidlist_destroy_all() local
210 list_for_each_entry_safe(l, tmp_l, &cgrp->pidlists, links) in cgroup1_pidlist_destroy_all()
211 mod_delayed_work(cgroup_pidlist_destroy_wq, &l->destroy_dwork, 0); in cgroup1_pidlist_destroy_all()
221 struct cgroup_pidlist *l = container_of(dwork, struct cgroup_pidlist, in cgroup_pidlist_destroy_work_fn() local
225 mutex_lock(&l->owner->pidlist_mutex); in cgroup_pidlist_destroy_work_fn()
232 list_del(&l->links); in cgroup_pidlist_destroy_work_fn()
233 kvfree(l->list); in cgroup_pidlist_destroy_work_fn()
234 put_pid_ns(l->key.ns); in cgroup_pidlist_destroy_work_fn()
235 tofree = l; in cgroup_pidlist_destroy_work_fn()
238 mutex_unlock(&l->owner->pidlist_mutex); in cgroup_pidlist_destroy_work_fn()
289 struct cgroup_pidlist *l; in cgroup_pidlist_find() local
295 list_for_each_entry(l, &cgrp->pidlists, links) in cgroup_pidlist_find()
296 if (l->key.type == type && l->key.ns == ns) in cgroup_pidlist_find()
297 return l; in cgroup_pidlist_find()
310 struct cgroup_pidlist *l; in cgroup_pidlist_find_create() local
314 l = cgroup_pidlist_find(cgrp, type); in cgroup_pidlist_find_create()
315 if (l) in cgroup_pidlist_find_create()
316 return l; in cgroup_pidlist_find_create()
319 l = kzalloc(sizeof(struct cgroup_pidlist), GFP_KERNEL); in cgroup_pidlist_find_create()
320 if (!l) in cgroup_pidlist_find_create()
321 return l; in cgroup_pidlist_find_create()
323 INIT_DELAYED_WORK(&l->destroy_dwork, cgroup_pidlist_destroy_work_fn); in cgroup_pidlist_find_create()
324 l->key.type = type; in cgroup_pidlist_find_create()
326 l->key.ns = get_pid_ns(task_active_pid_ns(current)); in cgroup_pidlist_find_create()
327 l->owner = cgrp; in cgroup_pidlist_find_create()
328 list_add(&l->links, &cgrp->pidlists); in cgroup_pidlist_find_create()
329 return l; in cgroup_pidlist_find_create()
343 struct cgroup_pidlist *l; in pidlist_array_load() local
376 l = cgroup_pidlist_find_create(cgrp, type); in pidlist_array_load()
377 if (!l) { in pidlist_array_load()
383 kvfree(l->list); in pidlist_array_load()
384 l->list = array; in pidlist_array_load()
385 l->length = length; in pidlist_array_load()
386 *lp = l; in pidlist_array_load()
407 struct cgroup_pidlist *l; in cgroup_pidlist_start() local
432 l = ctx->procs1.pidlist; in cgroup_pidlist_start()
435 int end = l->length; in cgroup_pidlist_start()
439 if (l->list[mid] == pid) { in cgroup_pidlist_start()
442 } else if (l->list[mid] < pid) in cgroup_pidlist_start()
449 if (index >= l->length) in cgroup_pidlist_start()
452 iter = l->list + index; in cgroup_pidlist_start()
461 struct cgroup_pidlist *l = ctx->procs1.pidlist; in cgroup_pidlist_stop() local
463 if (l) in cgroup_pidlist_stop()
464 mod_delayed_work(cgroup_pidlist_destroy_wq, &l->destroy_dwork, in cgroup_pidlist_stop()
473 struct cgroup_pidlist *l = ctx->procs1.pidlist; in cgroup_pidlist_next() local
475 pid_t *end = l->list + l->length; in cgroup_pidlist_next()