• Home
  • Raw
  • Download

Lines Matching refs:l

199 	struct cgroup_pidlist *l, *tmp_l;  in cgroup1_pidlist_destroy_all()  local
202 list_for_each_entry_safe(l, tmp_l, &cgrp->pidlists, links) in cgroup1_pidlist_destroy_all()
203 mod_delayed_work(cgroup_pidlist_destroy_wq, &l->destroy_dwork, 0); in cgroup1_pidlist_destroy_all()
213 struct cgroup_pidlist *l = container_of(dwork, struct cgroup_pidlist, in cgroup_pidlist_destroy_work_fn() local
217 mutex_lock(&l->owner->pidlist_mutex); in cgroup_pidlist_destroy_work_fn()
224 list_del(&l->links); in cgroup_pidlist_destroy_work_fn()
225 kvfree(l->list); in cgroup_pidlist_destroy_work_fn()
226 put_pid_ns(l->key.ns); in cgroup_pidlist_destroy_work_fn()
227 tofree = l; in cgroup_pidlist_destroy_work_fn()
230 mutex_unlock(&l->owner->pidlist_mutex); in cgroup_pidlist_destroy_work_fn()
281 struct cgroup_pidlist *l; in cgroup_pidlist_find() local
287 list_for_each_entry(l, &cgrp->pidlists, links) in cgroup_pidlist_find()
288 if (l->key.type == type && l->key.ns == ns) in cgroup_pidlist_find()
289 return l; in cgroup_pidlist_find()
302 struct cgroup_pidlist *l; in cgroup_pidlist_find_create() local
306 l = cgroup_pidlist_find(cgrp, type); in cgroup_pidlist_find_create()
307 if (l) in cgroup_pidlist_find_create()
308 return l; in cgroup_pidlist_find_create()
311 l = kzalloc(sizeof(struct cgroup_pidlist), GFP_KERNEL); in cgroup_pidlist_find_create()
312 if (!l) in cgroup_pidlist_find_create()
313 return l; in cgroup_pidlist_find_create()
315 INIT_DELAYED_WORK(&l->destroy_dwork, cgroup_pidlist_destroy_work_fn); in cgroup_pidlist_find_create()
316 l->key.type = type; in cgroup_pidlist_find_create()
318 l->key.ns = get_pid_ns(task_active_pid_ns(current)); in cgroup_pidlist_find_create()
319 l->owner = cgrp; in cgroup_pidlist_find_create()
320 list_add(&l->links, &cgrp->pidlists); in cgroup_pidlist_find_create()
321 return l; in cgroup_pidlist_find_create()
335 struct cgroup_pidlist *l; in pidlist_array_load() local
368 l = cgroup_pidlist_find_create(cgrp, type); in pidlist_array_load()
369 if (!l) { in pidlist_array_load()
375 kvfree(l->list); in pidlist_array_load()
376 l->list = array; in pidlist_array_load()
377 l->length = length; in pidlist_array_load()
378 *lp = l; in pidlist_array_load()
399 struct cgroup_pidlist *l; in cgroup_pidlist_start() local
424 l = ctx->procs1.pidlist; in cgroup_pidlist_start()
427 int end = l->length; in cgroup_pidlist_start()
431 if (l->list[mid] == pid) { in cgroup_pidlist_start()
434 } else if (l->list[mid] <= pid) in cgroup_pidlist_start()
441 if (index >= l->length) in cgroup_pidlist_start()
444 iter = l->list + index; in cgroup_pidlist_start()
453 struct cgroup_pidlist *l = ctx->procs1.pidlist; in cgroup_pidlist_stop() local
455 if (l) in cgroup_pidlist_stop()
456 mod_delayed_work(cgroup_pidlist_destroy_wq, &l->destroy_dwork, in cgroup_pidlist_stop()
465 struct cgroup_pidlist *l = ctx->procs1.pidlist; in cgroup_pidlist_next() local
467 pid_t *end = l->list + l->length; in cgroup_pidlist_next()