cgroup.c 3.1 KB
Newer Older
S
Stephane Eranian 已提交
1 2
#include "util.h"
#include "../perf.h"
3
#include <subcmd/parse-options.h>
S
Stephane Eranian 已提交
4 5 6 7 8 9 10 11 12 13
#include "evsel.h"
#include "cgroup.h"
#include "evlist.h"

int nr_cgroups;

static int
cgroupfs_find_mountpoint(char *buf, size_t maxlen)
{
	FILE *fp;
14
	char mountpoint[PATH_MAX + 1], tokens[PATH_MAX + 1], type[PATH_MAX + 1];
15
	char *token, *saved_ptr = NULL;
S
Stephane Eranian 已提交
16 17 18 19 20 21 22 23 24 25 26
	int found = 0;

	fp = fopen("/proc/mounts", "r");
	if (!fp)
		return -1;

	/*
	 * in order to handle split hierarchy, we need to scan /proc/mounts
	 * and inspect every cgroupfs mount point to find one that has
	 * perf_event subsystem
	 */
27 28
	while (fscanf(fp, "%*s %"STR(PATH_MAX)"s %"STR(PATH_MAX)"s %"
				STR(PATH_MAX)"s %*d %*d\n",
S
Stephane Eranian 已提交
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
				mountpoint, type, tokens) == 3) {

		if (!strcmp(type, "cgroup")) {

			token = strtok_r(tokens, ",", &saved_ptr);

			while (token != NULL) {
				if (!strcmp(token, "perf_event")) {
					found = 1;
					break;
				}
				token = strtok_r(NULL, ",", &saved_ptr);
			}
		}
		if (found)
			break;
	}
	fclose(fp);
	if (!found)
		return -1;

	if (strlen(mountpoint) < maxlen) {
		strcpy(buf, mountpoint);
		return 0;
	}
	return -1;
}

static int open_cgroup(char *name)
{
59 60
	char path[PATH_MAX + 1];
	char mnt[PATH_MAX + 1];
S
Stephane Eranian 已提交
61 62 63
	int fd;


64
	if (cgroupfs_find_mountpoint(mnt, PATH_MAX + 1))
S
Stephane Eranian 已提交
65 66
		return -1;

67
	snprintf(path, PATH_MAX, "%s/%s", mnt, name);
S
Stephane Eranian 已提交
68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83

	fd = open(path, O_RDONLY);
	if (fd == -1)
		fprintf(stderr, "no access to cgroup %s\n", path);

	return fd;
}

static int add_cgroup(struct perf_evlist *evlist, char *str)
{
	struct perf_evsel *counter;
	struct cgroup_sel *cgrp = NULL;
	int n;
	/*
	 * check if cgrp is already defined, if so we reuse it
	 */
84
	evlist__for_each(evlist, counter) {
S
Stephane Eranian 已提交
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
		cgrp = counter->cgrp;
		if (!cgrp)
			continue;
		if (!strcmp(cgrp->name, str))
			break;

		cgrp = NULL;
	}

	if (!cgrp) {
		cgrp = zalloc(sizeof(*cgrp));
		if (!cgrp)
			return -1;

		cgrp->name = str;

		cgrp->fd = open_cgroup(str);
		if (cgrp->fd == -1) {
			free(cgrp);
			return -1;
		}
	}

	/*
	 * find corresponding event
	 * if add cgroup N, then need to find event N
	 */
	n = 0;
113
	evlist__for_each(evlist, counter) {
S
Stephane Eranian 已提交
114 115 116 117
		if (n == nr_cgroups)
			goto found;
		n++;
	}
118
	if (atomic_read(&cgrp->refcnt) == 0)
S
Stephane Eranian 已提交
119 120 121 122
		free(cgrp);

	return -1;
found:
123
	atomic_inc(&cgrp->refcnt);
S
Stephane Eranian 已提交
124 125 126 127 128 129
	counter->cgrp = cgrp;
	return 0;
}

void close_cgroup(struct cgroup_sel *cgrp)
{
130
	if (cgrp && atomic_dec_and_test(&cgrp->refcnt)) {
S
Stephane Eranian 已提交
131
		close(cgrp->fd);
132
		zfree(&cgrp->name);
S
Stephane Eranian 已提交
133 134 135 136
		free(cgrp);
	}
}

137 138
int parse_cgroups(const struct option *opt __maybe_unused, const char *str,
		  int unset __maybe_unused)
S
Stephane Eranian 已提交
139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173
{
	struct perf_evlist *evlist = *(struct perf_evlist **)opt->value;
	const char *p, *e, *eos = str + strlen(str);
	char *s;
	int ret;

	if (list_empty(&evlist->entries)) {
		fprintf(stderr, "must define events before cgroups\n");
		return -1;
	}

	for (;;) {
		p = strchr(str, ',');
		e = p ? p : eos;

		/* allow empty cgroups, i.e., skip */
		if (e - str) {
			/* termination added */
			s = strndup(str, e - str);
			if (!s)
				return -1;
			ret = add_cgroup(evlist, s);
			if (ret) {
				free(s);
				return -1;
			}
		}
		/* nr_cgroups is increased een for empty cgroups */
		nr_cgroups++;
		if (!p)
			break;
		str = p+1;
	}
	return 0;
}