Minki/linux
1
0
Fork 1
mirror of https://github.com/torvalds/linux.git synced 2024-11-11 14:42:24 +00:00
Code Issues Packages Projects Releases Wiki Activity

cgroup: use css_set->mg_tasks to track target tasks during migration

Browse Source 
Currently, while migrating tasks from one cgroup to another,
cgroup_attach_task() builds a flex array of all target tasks;
unfortunately, this has a couple issues.

* Flex array has size limit.  On 64bit, struct task_and_cgroup is
  24bytes making the flex element limit around 87k.  It is a high
  number but not impossible to hit.  This means that the current
  cgroup implementation can't migrate a process with more than 87k
  threads.

* Process migration involves memory allocation whose size is dependent
  on the number of threads the process has.  This means that cgroup
  core can't guarantee success or failure of multi-process migrations
  as memory allocation failure can happen in the middle.  This is in
  part because cgroup can't grab threadgroup locks of multiple
  processes at the same time, so when there are multiple processes to
  migrate, it is imposible to tell how many tasks are to be migrated
  beforehand.

  Note that this already affects cgroup_transfer_tasks().  cgroup
  currently cannot guarantee atomic success or failure of the
  operation.  It may fail in the middle and after such failure cgroup
  doesn't have enough information to roll back properly.  It just
  aborts with some tasks migrated and others not.

To resolve the situation, this patch updates the migration path to use
task->cg_list to track target tasks.  The previous patch already added
css_set->mg_tasks and updated iterations in non-migration paths to
include them during task migration.  This patch updates migration path
to actually make use of it.

Instead of putting onto a flex_array, each target task is moved from
its css_set->tasks list to css_set->mg_tasks and the migration path
keeps trace of all the source css_sets and the associated cgroups.
Once all source css_sets are determined, the destination css_set for
each is determined, linked to the matching source css_set and put on a
separate list.

To iterate the target tasks, migration path just needs to iterat
through either the source or target css_sets, depending on whether
migration has been committed or not, and the tasks on their ->mg_tasks
lists.  cgroup_taskset is updated to contain the list_heads for source
and target css_sets and the iteration cursor.  cgroup_taskset_*() are
accordingly updated to walk through css_sets and their ->mg_tasks.

This resolves the above listed issues with moderate additional
complexity.

Signed-off-by: Tejun Heo <tj@kernel.org>
Acked-by: Li Zefan <lizefan@huawei.com>
This commit is contained in:
Tejun Heo 2014-02-25 10:04:01 -05:00
parent c75611282c
commit b3dc094e93
2 changed files with 131 additions and 108 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
include/linux/cgroup.h
View File

@ -346,6 +346,22 @@ struct css_set {
*/ */
struct cgroup_subsys_state *subsys[CGROUP_SUBSYS_COUNT]; struct cgroup_subsys_state *subsys[CGROUP_SUBSYS_COUNT];
/*
* List of csets participating in the on-going migration either as
* source or destination. Protected by cgroup_mutex.
*/
struct list_head mg_node;
/*
* If this cset is acting as the source of migration the following
* two fields are set. mg_src_cgrp is the source cgroup of the
* on-going migration and mg_dst_cset is the destination cset the
* target tasks on this cset should be migrated to. Protected by
* cgroup_mutex.
*/
struct cgroup *mg_src_cgrp;
struct css_set *mg_dst_cset;
/* For RCU-protected deletion */ /* For RCU-protected deletion */
struct rcu_head rcu_head; struct rcu_head rcu_head;
}; };

223
kernel/cgroup.c
View File

@ -52,7 +52,6 @@
#include <linux/pid_namespace.h> #include <linux/pid_namespace.h>
#include <linux/idr.h> #include <linux/idr.h>
#include <linux/vmalloc.h> /* TODO: replace with more sophisticated array */ #include <linux/vmalloc.h> /* TODO: replace with more sophisticated array */
#include <linux/flex_array.h> /* used in cgroup_attach_task */
#include <linux/kthread.h> #include <linux/kthread.h>
#include <linux/delay.h> #include <linux/delay.h>
@ -645,6 +644,7 @@ static struct css_set *find_css_set(struct css_set *old_cset,
INIT_LIST_HEAD(&cset->cgrp_links); INIT_LIST_HEAD(&cset->cgrp_links);
INIT_LIST_HEAD(&cset->tasks); INIT_LIST_HEAD(&cset->tasks);
INIT_LIST_HEAD(&cset->mg_tasks); INIT_LIST_HEAD(&cset->mg_tasks);
INIT_LIST_HEAD(&cset->mg_node);
INIT_HLIST_NODE(&cset->hlist); INIT_HLIST_NODE(&cset->hlist);
/* Copy the set of subsystem state objects generated in /* Copy the set of subsystem state objects generated in
@ -1639,20 +1639,26 @@ char *task_cgroup_path(struct task_struct *task, char *buf, size_t buflen)
} }
EXPORT_SYMBOL_GPL(task_cgroup_path); EXPORT_SYMBOL_GPL(task_cgroup_path);
/* /* used to track tasks and other necessary states during migration */
* Control Group taskset
*/
struct task_and_cgroup {
struct task_struct *task;
struct cgroup *cgrp;
struct css_set *cset;
};
struct cgroup_taskset { struct cgroup_taskset {
struct task_and_cgroup single; /* the src and dst cset list running through cset->mg_node */
struct flex_array *tc_array; struct list_head src_csets;
int tc_array_len; struct list_head dst_csets;
int idx;
/*
* Fields for cgroup_taskset_*() iteration.
*
* Before migration is committed, the target migration tasks are on
* ->mg_tasks of the csets on ->src_csets. After, on ->mg_tasks of
* the csets on ->dst_csets. ->csets point to either ->src_csets
* or ->dst_csets depending on whether migration is committed.
*
* ->cur_csets and ->cur_task point to the current task position
* during iteration.
*/
struct list_head *csets;
struct css_set *cur_cset;
struct task_struct *cur_task;
}; };
/** /**
@ -1663,12 +1669,10 @@ struct cgroup_taskset {
*/ */
struct task_struct *cgroup_taskset_first(struct cgroup_taskset *tset) struct task_struct *cgroup_taskset_first(struct cgroup_taskset *tset)
{ {
if (tset->tc_array) { tset->cur_cset = list_first_entry(tset->csets, struct css_set, mg_node);
tset->idx = 0; tset->cur_task = NULL;
return cgroup_taskset_next(tset);
} else { return cgroup_taskset_next(tset);
return tset->single.task;
}
} }
/** /**
@ -1680,13 +1684,27 @@ struct task_struct *cgroup_taskset_first(struct cgroup_taskset *tset)
*/ */
struct task_struct *cgroup_taskset_next(struct cgroup_taskset *tset) struct task_struct *cgroup_taskset_next(struct cgroup_taskset *tset)
{ {
struct task_and_cgroup *tc; struct css_set *cset = tset->cur_cset;
struct task_struct *task = tset->cur_task;
if (!tset->tc_array || tset->idx >= tset->tc_array_len) while (&cset->mg_node != tset->csets) {
return NULL; if (!task)
task = list_first_entry(&cset->mg_tasks,
struct task_struct, cg_list);
else
task = list_next_entry(task, cg_list);
tc = flex_array_get(tset->tc_array, tset->idx++); if (&task->cg_list != &cset->mg_tasks) {
return tc->task; tset->cur_cset = cset;
tset->cur_task = task;
return task;
}
cset = list_next_entry(cset, mg_node);
task = NULL;
}
return NULL;
} }
/** /**
@ -1714,11 +1732,13 @@ static void cgroup_task_migrate(struct cgroup *old_cgrp,
WARN_ON_ONCE(tsk->flags & PF_EXITING); WARN_ON_ONCE(tsk->flags & PF_EXITING);
old_cset = task_css_set(tsk); old_cset = task_css_set(tsk);
get_css_set(new_cset);
task_lock(tsk); task_lock(tsk);
rcu_assign_pointer(tsk->cgroups, new_cset); rcu_assign_pointer(tsk->cgroups, new_cset);
task_unlock(tsk); task_unlock(tsk);
list_move(&tsk->cg_list, &new_cset->tasks); list_move(&tsk->cg_list, &new_cset->mg_tasks);
/* /*
* We just gained a reference on old_cset by taking it from the * We just gained a reference on old_cset by taking it from the
@ -1741,80 +1761,58 @@ static void cgroup_task_migrate(struct cgroup *old_cgrp,
static int cgroup_attach_task(struct cgroup *cgrp, struct task_struct *leader, static int cgroup_attach_task(struct cgroup *cgrp, struct task_struct *leader,
bool threadgroup) bool threadgroup)
{ {
int ret, i, group_size; struct cgroup_taskset tset = {
struct cgroupfs_root *root = cgrp->root; .src_csets = LIST_HEAD_INIT(tset.src_csets),
.dst_csets = LIST_HEAD_INIT(tset.dst_csets),
.csets = &tset.src_csets,
};
struct cgroup_subsys_state *css, *failed_css = NULL; struct cgroup_subsys_state *css, *failed_css = NULL;
/* threadgroup list cursor and array */ struct css_set *cset, *tmp_cset;
struct task_struct *task; struct task_struct *task, *tmp_task;
struct task_and_cgroup *tc; int i, ret;
struct flex_array *group;
struct cgroup_taskset tset = { };
/*
* step 0: in order to do expensive, possibly blocking operations for
* every thread, we cannot iterate the thread group list, since it needs
* rcu or tasklist locked. instead, build an array of all threads in the
* group - group_rwsem prevents new threads from appearing, and if
* threads exit, this will just be an over-estimate.
*/
if (threadgroup)
group_size = get_nr_threads(leader);
else
group_size = 1;
/* flex_array supports very large thread-groups better than kmalloc. */
group = flex_array_alloc(sizeof(*tc), group_size, GFP_KERNEL);
if (!group)
return -ENOMEM;
/* pre-allocate to guarantee space while iterating in rcu read-side. */
ret = flex_array_prealloc(group, 0, group_size, GFP_KERNEL);
if (ret)
goto out_free_group_list;
i = 0;
/* /*
* Prevent freeing of tasks while we take a snapshot. Tasks that are * Prevent freeing of tasks while we take a snapshot. Tasks that are
* already PF_EXITING could be freed from underneath us unless we * already PF_EXITING could be freed from underneath us unless we
* take an rcu_read_lock. * take an rcu_read_lock.
*/ */
down_read(&css_set_rwsem); down_write(&css_set_rwsem);
rcu_read_lock(); rcu_read_lock();
task = leader; task = leader;
do { do {
struct task_and_cgroup ent; struct cgroup *src_cgrp;
/* @task either already exited or can't exit until the end */ /* @task either already exited or can't exit until the end */
if (task->flags & PF_EXITING) if (task->flags & PF_EXITING)
goto next; goto next;
/* as per above, nr_threads may decrease, but not increase. */ cset = task_css_set(task);
BUG_ON(i >= group_size); src_cgrp = task_cgroup_from_root(task, cgrp->root);
ent.task = task;
ent.cgrp = task_cgroup_from_root(task, root);
/* nothing to do if this task is already in the cgroup */ /* nothing to do if this task is already in the cgroup */
if (ent.cgrp == cgrp) if (src_cgrp == cgrp)
goto next; goto next;
/*
* saying GFP_ATOMIC has no effect here because we did prealloc if (!cset->mg_src_cgrp) {
* earlier, but it's good form to communicate our expectations. WARN_ON(!list_empty(&cset->mg_tasks));
*/ WARN_ON(!list_empty(&cset->mg_node));
ret = flex_array_put(group, i, &ent, GFP_ATOMIC);
BUG_ON(ret != 0); cset->mg_src_cgrp = src_cgrp;
i++; list_add(&cset->mg_node, &tset.src_csets);
get_css_set(cset);
}
list_move(&task->cg_list, &cset->mg_tasks);
next: next:
if (!threadgroup) if (!threadgroup)
break; break;
} while_each_thread(leader, task); } while_each_thread(leader, task);
rcu_read_unlock(); rcu_read_unlock();
up_read(&css_set_rwsem); up_write(&css_set_rwsem);
/* remember the number of threads in the array for later. */
group_size = i;
tset.tc_array = group;
tset.tc_array_len = group_size;
/* methods shouldn't be called if no task is actually migrating */ /* methods shouldn't be called if no task is actually migrating */
ret = 0; if (list_empty(&tset.src_csets))
if (!group_size) return 0;
goto out_free_group_list;
/* /*
* step 1: check that we can legitimately attach to the cgroup. * step 1: check that we can legitimately attach to the cgroup.
@ -1833,16 +1831,21 @@ static int cgroup_attach_task(struct cgroup *cgrp, struct task_struct *leader,
* step 2: make sure css_sets exist for all threads to be migrated. * step 2: make sure css_sets exist for all threads to be migrated.
* we use find_css_set, which allocates a new one if necessary. * we use find_css_set, which allocates a new one if necessary.
*/ */
for (i = 0; i < group_size; i++) { list_for_each_entry(cset, &tset.src_csets, mg_node) {
struct css_set *old_cset; struct css_set *dst_cset;
tc = flex_array_get(group, i); dst_cset = find_css_set(cset, cgrp);
old_cset = task_css_set(tc->task); if (!dst_cset) {
tc->cset = find_css_set(old_cset, cgrp);
if (!tc->cset) {
ret = -ENOMEM; ret = -ENOMEM;
goto out_put_css_set_refs; goto out_release_tset;
} }
if (list_empty(&dst_cset->mg_node))
list_add(&dst_cset->mg_node, &tset.dst_csets);
else
put_css_set(dst_cset, false);
cset->mg_dst_cset = dst_cset;
} }
/* /*
@ -1851,12 +1854,17 @@ static int cgroup_attach_task(struct cgroup *cgrp, struct task_struct *leader,
* failure cases after here, so this is the commit point. * failure cases after here, so this is the commit point.
*/ */
down_write(&css_set_rwsem); down_write(&css_set_rwsem);
for (i = 0; i < group_size; i++) { list_for_each_entry(cset, &tset.src_csets, mg_node) {
tc = flex_array_get(group, i); list_for_each_entry_safe(task, tmp_task, &cset->mg_tasks, cg_list)
cgroup_task_migrate(tc->cgrp, tc->task, tc->cset); cgroup_task_migrate(cset->mg_src_cgrp, task,
cset->mg_dst_cset);
} }
up_write(&css_set_rwsem); up_write(&css_set_rwsem);
/* nothing is sensitive to fork() after this point. */
/* migration is committed, all target tasks are now on dst_csets */
tset.csets = &tset.dst_csets;
/* nothing is sensitive to fork() after this point */
/* /*
* step 4: do subsystem attach callbacks. * step 4: do subsystem attach callbacks.
@ -1865,30 +1873,27 @@ static int cgroup_attach_task(struct cgroup *cgrp, struct task_struct *leader,
if (css->ss->attach) if (css->ss->attach)
css->ss->attach(css, &tset); css->ss->attach(css, &tset);
/*
* step 5: success! and cleanup
*/
ret = 0; ret = 0;
out_put_css_set_refs: goto out_release_tset;
if (ret) {
for (i = 0; i < group_size; i++) {
tc = flex_array_get(group, i);
if (!tc->cset)
break;
put_css_set(tc->cset, false);
}
}
out_cancel_attach: out_cancel_attach:
if (ret) { for_each_css(css, i, cgrp) {
for_each_css(css, i, cgrp) { if (css == failed_css)
if (css == failed_css) break;
break; if (css->ss->cancel_attach)
if (css->ss->cancel_attach) css->ss->cancel_attach(css, &tset);
css->ss->cancel_attach(css, &tset);
}
} }
out_free_group_list: out_release_tset:
flex_array_free(group); down_write(&css_set_rwsem);
list_splice_init(&tset.dst_csets, &tset.src_csets);
list_for_each_entry_safe(cset, tmp_cset, &tset.src_csets, mg_node) {
list_splice_init(&cset->mg_tasks, &cset->tasks);
cset->mg_dst_cset = NULL;
cset->mg_src_cgrp = NULL;
list_del_init(&cset->mg_node);
put_css_set_locked(cset, false);
}
up_write(&css_set_rwsem);
return ret; return ret;
} }
@ -3895,6 +3900,8 @@ int __init cgroup_init_early(void)
atomic_set(&init_css_set.refcount, 1); atomic_set(&init_css_set.refcount, 1);
INIT_LIST_HEAD(&init_css_set.cgrp_links); INIT_LIST_HEAD(&init_css_set.cgrp_links);
INIT_LIST_HEAD(&init_css_set.tasks); INIT_LIST_HEAD(&init_css_set.tasks);
INIT_LIST_HEAD(&init_css_set.mg_tasks);
INIT_LIST_HEAD(&init_css_set.mg_node);
INIT_HLIST_NODE(&init_css_set.hlist); INIT_HLIST_NODE(&init_css_set.hlist);
css_set_count = 1; css_set_count = 1;
init_cgroup_root(&cgroup_dummy_root); init_cgroup_root(&cgroup_dummy_root);