cgroup: teach css_task_iter about effective csses
Currently, css_task_iter iterates tasks associated with a css by visiting each css_set associated with the owning cgroup and walking tasks of each of them. This works fine for !unified hierarchies as each cgroup has its own css for each associated subsystem on the hierarchy; however, on the planned unified hierarchy, a cgroup may not have csses associated and its tasks would be considered associated with the matching css of the nearest ancestor which has the subsystem enabled. This means that on the default unified hierarchy, just walking all tasks associated with a cgroup isn't enough to walk all tasks which are associated with the specified css. If any of its children doesn't have the matching css enabled, task iteration should also include all tasks from the subtree. We already added cgroup->e_csets[] to list all css_sets effectively associated with a given css and walk css_sets on that list instead to achieve such iteration. This patch updates css_task_iter iteration such that it walks css_sets on cgroup->e_csets[] instead of cgroup->cset_links if iteration is requested on an non-dummy css. Thanks to the previous iteration update, this change can be achieved with the addition of css_task_iter->ss and minimal updates to css_advance_task_iter() and css_task_iter_start(). Signed-off-by: Tejun Heo <tj@kernel.org> Acked-by: Li Zefan <lizefan@huawei.com>
This commit is contained in:
parent
0f0a2b4fa6
commit
3ebb2b6ef3
|
@ -842,6 +842,8 @@ css_next_descendant_post(struct cgroup_subsys_state *pos,
|
|||
|
||||
/* A css_task_iter should be treated as an opaque object */
|
||||
struct css_task_iter {
|
||||
struct cgroup_subsys *ss;
|
||||
|
||||
struct list_head *cset_pos;
|
||||
struct list_head *cset_head;
|
||||
|
||||
|
|
|
@ -2868,8 +2868,14 @@ static void css_advance_task_iter(struct css_task_iter *it)
|
|||
it->cset_pos = NULL;
|
||||
return;
|
||||
}
|
||||
|
||||
if (it->ss) {
|
||||
cset = container_of(l, struct css_set,
|
||||
e_cset_node[it->ss->id]);
|
||||
} else {
|
||||
link = list_entry(l, struct cgrp_cset_link, cset_link);
|
||||
cset = link->cset;
|
||||
}
|
||||
} while (list_empty(&cset->tasks) && list_empty(&cset->mg_tasks));
|
||||
|
||||
it->cset_pos = l;
|
||||
|
@ -2906,7 +2912,13 @@ void css_task_iter_start(struct cgroup_subsys_state *css,
|
|||
|
||||
down_read(&css_set_rwsem);
|
||||
|
||||
it->ss = css->ss;
|
||||
|
||||
if (it->ss)
|
||||
it->cset_pos = &css->cgroup->e_csets[css->ss->id];
|
||||
else
|
||||
it->cset_pos = &css->cgroup->cset_links;
|
||||
|
||||
it->cset_head = it->cset_pos;
|
||||
|
||||
css_advance_task_iter(it);
|
||||
|
|
Loading…
Reference in New Issue