mir/criu
2
0
Fork 0
mirror of https://github.com/checkpoint-restore/criu synced 2025-08-30 22:05:36 +00:00
Code Issues Releases Wiki Activity

Attempt to restore cgroups

Browse Source 
During the dump phase, /proc/cgroups is parsed to find co-mounted cgroups.
Then, for each task /proc/self/cgroup is parsed for the cgroups that it is a
member of, and that cgroup is traversed to find any child cgroups which may
also need restoring. Any cgroups not currently mounted will be temporarily
mounted and traversed. All of this information is persisted along with the
original cg_sets, which indicate which cgroups a task is a member of.

On restore, an initial phase creates all the cgroups which were saved. Tasks
are then restored into these cgroups via cg_sets as usual.

Signed-off-by: Tycho Andersen <tycho.andersen@canonical.com>
Signed-off-by: Pavel Emelyanov <xemul@parallels.com>
This commit is contained in:
Tycho Andersen
2014-07-10 17:00:28 +04:00
committed by Pavel Emelyanov
parent e1b56c8fac
commit 51876eea5d
13 changed files with 816 additions and 23 deletions
Download Patch File Download Diff File Expand all files Collapse all files

75
proc_parse.c
View File

@@ -1547,7 +1547,7 @@ int parse_task_cgroup(int pid, struct list_head *retl, unsigned int *n)
}
list_for_each_entry(cc, retl, l)
if (strcmp(cc->name, name) >= 0)
if (strcmp(cc->name, name) >= 0 && strcmp(cc->path, path) >= 0)
break;
list_add_tail(&ncc->l, &cc->l);
@@ -1573,3 +1573,76 @@ void put_ctls(struct list_head *l)
xfree(c);
}
}
/* Parse and create all the real controllers. This does not include things with
* the "name=" prefix, e.g. systemd.
*/
int parse_cgroups(struct list_head *cgroups, unsigned int *n_cgroups)
{
FILE *f;
char buf[1024], name[1024];
int heirarchy, ret = 0;
struct cg_controller *cur = NULL;
f = fopen("/proc/cgroups", "r");
if (!f) {
pr_perror("failed opening /proc/cgroups");
return -1;
}
/* throw away the header */
if (!fgets(buf, 1024, f)) {
ret = -1;
goto out;
}
while (fgets(buf, 1024, f)) {
char *n;
char found = 0;
sscanf(buf, "%s %d", name, &heirarchy);
list_for_each_entry(cur, cgroups, l) {
if (cur->heirarchy == heirarchy) {
void *m;
found = 1;
cur->n_controllers++;
m = xrealloc(cur->controllers, sizeof(char *) * cur->n_controllers);
if (!m) {
ret = -1;
goto out;
}
cur->controllers = m;
if (!cur->controllers) {
ret = -1;
goto out;
}
n = xstrdup(name);
if (!n) {
ret = -1;
goto out;
}
cur->controllers[cur->n_controllers-1] = n;
break;
}
}
if (!found) {
struct cg_controller *nc = new_controller(name, heirarchy);
if (!nc) {
ret = -1;
goto out;
}
list_add_tail(&nc->l, &cur->l);
(*n_cgroups)++;
}
}
out:
fclose(f);
return ret;
}