File: cg_map.c

package info (click to toggle)
iproute2 5.10.0-4
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 6,880 kB
  • sloc: ansic: 107,211; sh: 1,338; cpp: 932; makefile: 654; yacc: 421; lex: 145
file content (134 lines) | stat: -rw-r--r-- 2,368 bytes parent folder | download | duplicates (4)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
/*
 * cg_map.c	cgroup v2 cache
 *
 *		This program is free software; you can redistribute it and/or
 *		modify it under the terms of the GNU General Public License
 *		as published by the Free Software Foundation; either version
 *		2 of the License, or (at your option) any later version.
 *
 * Authors:	Dmitry Yakunin <zeil@yandex-team.ru>
 */

#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <stdbool.h>
#include <linux/types.h>
#include <linux/limits.h>
#include <ftw.h>

#include "cg_map.h"
#include "list.h"
#include "utils.h"

struct cg_cache {
	struct hlist_node id_hash;
	__u64	id;
	char	path[];
};

#define IDMAP_SIZE	1024
static struct hlist_head id_head[IDMAP_SIZE];

static struct cg_cache *cg_get_by_id(__u64 id)
{
	unsigned int h = id & (IDMAP_SIZE - 1);
	struct hlist_node *n;

	hlist_for_each(n, &id_head[h]) {
		struct cg_cache *cg;

		cg = container_of(n, struct cg_cache, id_hash);
		if (cg->id == id)
			return cg;
	}

	return NULL;
}

static struct cg_cache *cg_entry_create(__u64 id, const char *path)
{
	unsigned int h = id & (IDMAP_SIZE - 1);
	struct cg_cache *cg;

	cg = malloc(sizeof(*cg) + strlen(path) + 1);
	if (!cg) {
		fprintf(stderr,
			"Failed to allocate memory for cgroup2 cache entry");
		return NULL;
	}
	cg->id = id;
	strcpy(cg->path, path);

	hlist_add_head(&cg->id_hash, &id_head[h]);

	return cg;
}

static int mntlen;

static int nftw_fn(const char *fpath, const struct stat *sb,
		   int typeflag, struct FTW *ftw)
{
	const char *path;
	__u64 id;

	if (typeflag != FTW_D)
		return 0;

	id = get_cgroup2_id(fpath);
	if (!id)
		return -1;

	path = fpath + mntlen;
	if (*path == '\0')
		/* root cgroup */
		path = "/";
	if (!cg_entry_create(id, path))
		return -1;

	return 0;
}

static void cg_init_map(void)
{
	char *mnt;

	mnt = find_cgroup2_mount(false);
	if (!mnt)
		return;

	mntlen = strlen(mnt);
	(void) nftw(mnt, nftw_fn, 1024, FTW_MOUNT);

	free(mnt);
}

const char *cg_id_to_path(__u64 id)
{
	static int initialized;
	static char buf[64];

	const struct cg_cache *cg;
	char *path;

	if (!initialized) {
		cg_init_map();
		initialized = 1;
	}

	cg = cg_get_by_id(id);
	if (cg)
		return cg->path;

	path = get_cgroup2_path(id, false);
	if (path) {
		cg = cg_entry_create(id, path);
		free(path);
		if (cg)
			return cg->path;
	}

	snprintf(buf, sizeof(buf), "unreachable:%llx", id);
	return buf;
}