/* A cgroup_task_iter should be treated as an opaque object */
struct cgroup_task_iter {
+ struct cgroup *origin_cgrp;
struct list_head *cset_link;
struct list_head *task;
};
void cgroup_task_iter_start(struct cgroup *cgrp, struct cgroup_task_iter *it);
-struct task_struct *cgroup_task_iter_next(struct cgroup *cgrp,
- struct cgroup_task_iter *it);
-void cgroup_task_iter_end(struct cgroup *cgrp, struct cgroup_task_iter *it);
+struct task_struct *cgroup_task_iter_next(struct cgroup_task_iter *it);
+void cgroup_task_iter_end(struct cgroup_task_iter *it);
int cgroup_scan_tasks(struct cgroup_scanner *scan);
int cgroup_attach_task_all(struct task_struct *from, struct task_struct *);
int cgroup_transfer_tasks(struct cgroup *to, struct cgroup *from);
/**
* cgroup_advance_task_iter - advance a task itererator to the next css_set
- * @cgrp: the cgroup to walk tasks of
* @it: the iterator to advance
*
* Advance @it to the next css_set to walk.
*/
-static void cgroup_advance_task_iter(struct cgroup *cgrp,
- struct cgroup_task_iter *it)
+static void cgroup_advance_task_iter(struct cgroup_task_iter *it)
{
struct list_head *l = it->cset_link;
struct cgrp_cset_link *link;
/* Advance to the next non-empty css_set */
do {
l = l->next;
- if (l == &cgrp->cset_links) {
+ if (l == &it->origin_cgrp->cset_links) {
it->cset_link = NULL;
return;
}
cgroup_enable_task_cg_lists();
read_lock(&css_set_lock);
+
+ it->origin_cgrp = cgrp;
it->cset_link = &cgrp->cset_links;
- cgroup_advance_task_iter(cgrp, it);
+
+ cgroup_advance_task_iter(it);
}
/**
* cgroup_task_iter_next - return the next task for the iterator
- * @cgrp: the cgroup to walk tasks of
* @it: the task iterator being iterated
*
* The "next" function for task iteration. @it should have been
* initialized via cgroup_task_iter_start(). Returns NULL when the
* iteration reaches the end.
*/
-struct task_struct *cgroup_task_iter_next(struct cgroup *cgrp,
- struct cgroup_task_iter *it)
+struct task_struct *cgroup_task_iter_next(struct cgroup_task_iter *it)
{
struct task_struct *res;
struct list_head *l = it->task;
* We reached the end of this task list - move on to the
* next cgrp_cset_link.
*/
- cgroup_advance_task_iter(cgrp, it);
+ cgroup_advance_task_iter(it);
} else {
it->task = l;
}
/**
* cgroup_task_iter_end - finish task iteration
- * @cgrp: the cgroup to walk tasks of
* @it: the task iterator to finish
*
* Finish task iteration started by cgroup_task_iter_start().
*/
-void cgroup_task_iter_end(struct cgroup *cgrp, struct cgroup_task_iter *it)
+void cgroup_task_iter_end(struct cgroup_task_iter *it)
__releases(css_set_lock)
{
read_unlock(&css_set_lock);
*/
heap->size = 0;
cgroup_task_iter_start(scan->cgrp, &it);
- while ((p = cgroup_task_iter_next(scan->cgrp, &it))) {
+ while ((p = cgroup_task_iter_next(&it))) {
/*
* Only affect tasks that qualify per the caller's callback,
* if he provided one
* the heap and wasn't inserted
*/
}
- cgroup_task_iter_end(scan->cgrp, &it);
+ cgroup_task_iter_end(&it);
if (heap->size) {
for (i = 0; i < heap->size; i++) {
return -ENOMEM;
/* now, populate the array */
cgroup_task_iter_start(cgrp, &it);
- while ((tsk = cgroup_task_iter_next(cgrp, &it))) {
+ while ((tsk = cgroup_task_iter_next(&it))) {
if (unlikely(n == length))
break;
/* get tgid or pid for procs or tasks file respectively */
if (pid > 0) /* make sure to only use valid results */
array[n++] = pid;
}
- cgroup_task_iter_end(cgrp, &it);
+ cgroup_task_iter_end(&it);
length = n;
/* now sort & (if procs) strip out duplicates */
sort(array, length, sizeof(pid_t), cmppid, NULL);
cgrp = dentry->d_fsdata;
cgroup_task_iter_start(cgrp, &it);
- while ((tsk = cgroup_task_iter_next(cgrp, &it))) {
+ while ((tsk = cgroup_task_iter_next(&it))) {
switch (tsk->state) {
case TASK_RUNNING:
stats->nr_running++;
break;
}
}
- cgroup_task_iter_end(cgrp, &it);
+ cgroup_task_iter_end(&it);
err:
return ret;
/* are all tasks frozen? */
cgroup_task_iter_start(css->cgroup, &it);
- while ((task = cgroup_task_iter_next(css->cgroup, &it))) {
+ while ((task = cgroup_task_iter_next(&it))) {
if (freezing(task)) {
/*
* freezer_should_skip() indicates that the task
freezer->state |= CGROUP_FROZEN;
out_iter_end:
- cgroup_task_iter_end(css->cgroup, &it);
+ cgroup_task_iter_end(&it);
out_unlock:
spin_unlock_irq(&freezer->lock);
}
struct task_struct *task;
cgroup_task_iter_start(cgroup, &it);
- while ((task = cgroup_task_iter_next(cgroup, &it)))
+ while ((task = cgroup_task_iter_next(&it)))
freeze_task(task);
- cgroup_task_iter_end(cgroup, &it);
+ cgroup_task_iter_end(&it);
}
static void unfreeze_cgroup(struct freezer *freezer)
struct task_struct *task;
cgroup_task_iter_start(cgroup, &it);
- while ((task = cgroup_task_iter_next(cgroup, &it)))
+ while ((task = cgroup_task_iter_next(&it)))
__thaw_task(task);
- cgroup_task_iter_end(cgroup, &it);
+ cgroup_task_iter_end(&it);
}
/**
struct task_struct *task;
cgroup_task_iter_start(cgroup, &it);
- while ((task = cgroup_task_iter_next(cgroup, &it))) {
+ while ((task = cgroup_task_iter_next(&it))) {
switch (oom_scan_process_thread(task, totalpages, NULL,
false)) {
case OOM_SCAN_SELECT:
case OOM_SCAN_CONTINUE:
continue;
case OOM_SCAN_ABORT:
- cgroup_task_iter_end(cgroup, &it);
+ cgroup_task_iter_end(&it);
mem_cgroup_iter_break(memcg, iter);
if (chosen)
put_task_struct(chosen);
get_task_struct(chosen);
}
}
- cgroup_task_iter_end(cgroup, &it);
+ cgroup_task_iter_end(&it);
}
if (!chosen)