thread_map.c 8.3 KB
Newer Older
1
#include <dirent.h>
2 3
#include <limits.h>
#include <stdbool.h>
4 5
#include <stdlib.h>
#include <stdio.h>
6 7 8
#include <sys/types.h>
#include <sys/stat.h>
#include <unistd.h>
9 10
#include "strlist.h"
#include <string.h>
11
#include <api/fs/fs.h>
12
#include "asm/bug.h"
13
#include "thread_map.h"
14
#include "util.h"
15
#include "debug.h"
16 17 18 19 20 21 22 23 24 25

/* Skip "." and ".." directories */
static int filter(const struct dirent *dir)
{
	if (dir->d_name[0] == '.')
		return 0;
	else
		return 1;
}

26 27 28 29 30 31 32
static void thread_map__reset(struct thread_map *map, int start, int nr)
{
	size_t size = (nr - start) * sizeof(map->map[0]);

	memset(&map->map[start], 0, size);
}

33 34
static struct thread_map *thread_map__realloc(struct thread_map *map, int nr)
{
35
	size_t size = sizeof(*map) + sizeof(map->map[0]) * nr;
36 37 38 39 40 41 42 43
	int start = map ? map->nr : 0;

	map = realloc(map, size);
	/*
	 * We only realloc to add more items, let's reset new items.
	 */
	if (map)
		thread_map__reset(map, start, nr);
44

45
	return map;
46 47 48 49
}

#define thread_map__alloc(__nr) thread_map__realloc(NULL, __nr)

50 51 52 53 54 55 56 57 58 59 60
struct thread_map *thread_map__new_by_pid(pid_t pid)
{
	struct thread_map *threads;
	char name[256];
	int items;
	struct dirent **namelist = NULL;
	int i;

	sprintf(name, "/proc/%d/task", pid);
	items = scandir(name, &namelist, filter, NULL);
	if (items <= 0)
61
		return NULL;
62

63
	threads = thread_map__alloc(items);
64 65
	if (threads != NULL) {
		for (i = 0; i < items; i++)
66
			thread_map__set_pid(threads, i, atoi(namelist[i]->d_name));
67
		threads->nr = items;
68
		atomic_set(&threads->refcnt, 1);
69 70 71
	}

	for (i=0; i<items; i++)
72
		zfree(&namelist[i]);
73 74 75 76 77 78 79
	free(namelist);

	return threads;
}

struct thread_map *thread_map__new_by_tid(pid_t tid)
{
80
	struct thread_map *threads = thread_map__alloc(1);
81 82

	if (threads != NULL) {
83 84
		thread_map__set_pid(threads, 0, tid);
		threads->nr = 1;
85
		atomic_set(&threads->refcnt, 1);
86 87 88 89 90
	}

	return threads;
}

91 92 93 94 95 96
struct thread_map *thread_map__new_by_uid(uid_t uid)
{
	DIR *proc;
	int max_threads = 32, items, i;
	char path[256];
	struct dirent dirent, *next, **namelist = NULL;
97 98
	struct thread_map *threads = thread_map__alloc(max_threads);

99 100 101 102 103 104 105 106
	if (threads == NULL)
		goto out;

	proc = opendir("/proc");
	if (proc == NULL)
		goto out_free_threads;

	threads->nr = 0;
107
	atomic_set(&threads->refcnt, 1);
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 135 136 137 138

	while (!readdir_r(proc, &dirent, &next) && next) {
		char *end;
		bool grow = false;
		struct stat st;
		pid_t pid = strtol(dirent.d_name, &end, 10);

		if (*end) /* only interested in proper numerical dirents */
			continue;

		snprintf(path, sizeof(path), "/proc/%s", dirent.d_name);

		if (stat(path, &st) != 0)
			continue;

		if (st.st_uid != uid)
			continue;

		snprintf(path, sizeof(path), "/proc/%d/task", pid);
		items = scandir(path, &namelist, filter, NULL);
		if (items <= 0)
			goto out_free_closedir;

		while (threads->nr + items >= max_threads) {
			max_threads *= 2;
			grow = true;
		}

		if (grow) {
			struct thread_map *tmp;

139
			tmp = thread_map__realloc(threads, max_threads);
140 141 142 143 144 145
			if (tmp == NULL)
				goto out_free_namelist;

			threads = tmp;
		}

146 147 148 149
		for (i = 0; i < items; i++) {
			thread_map__set_pid(threads, threads->nr + i,
					    atoi(namelist[i]->d_name));
		}
150 151

		for (i = 0; i < items; i++)
152
			zfree(&namelist[i]);
153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168
		free(namelist);

		threads->nr += items;
	}

out_closedir:
	closedir(proc);
out:
	return threads;

out_free_threads:
	free(threads);
	return NULL;

out_free_namelist:
	for (i = 0; i < items; i++)
169
		zfree(&namelist[i]);
170 171 172
	free(namelist);

out_free_closedir:
173
	zfree(&threads);
174 175 176 177
	goto out_closedir;
}

struct thread_map *thread_map__new(pid_t pid, pid_t tid, uid_t uid)
178 179 180
{
	if (pid != -1)
		return thread_map__new_by_pid(pid);
181 182 183 184

	if (tid == -1 && uid != UINT_MAX)
		return thread_map__new_by_uid(uid);

185 186 187
	return thread_map__new_by_tid(tid);
}

188 189 190 191 192 193 194 195 196 197
static struct thread_map *thread_map__new_by_pid_str(const char *pid_str)
{
	struct thread_map *threads = NULL, *nt;
	char name[256];
	int items, total_tasks = 0;
	struct dirent **namelist = NULL;
	int i, j = 0;
	pid_t pid, prev_pid = INT_MAX;
	char *end_ptr;
	struct str_node *pos;
198 199
	struct strlist_config slist_config = { .dont_dupstr = true, };
	struct strlist *slist = strlist__new(pid_str, &slist_config);
200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219

	if (!slist)
		return NULL;

	strlist__for_each(pos, slist) {
		pid = strtol(pos->s, &end_ptr, 10);

		if (pid == INT_MIN || pid == INT_MAX ||
		    (*end_ptr != '\0' && *end_ptr != ','))
			goto out_free_threads;

		if (pid == prev_pid)
			continue;

		sprintf(name, "/proc/%d/task", pid);
		items = scandir(name, &namelist, filter, NULL);
		if (items <= 0)
			goto out_free_threads;

		total_tasks += items;
220
		nt = thread_map__realloc(threads, total_tasks);
221
		if (nt == NULL)
222
			goto out_free_namelist;
223 224 225

		threads = nt;

226
		for (i = 0; i < items; i++) {
227
			thread_map__set_pid(threads, j++, atoi(namelist[i]->d_name));
228
			zfree(&namelist[i]);
229 230
		}
		threads->nr = total_tasks;
231 232 233 234 235
		free(namelist);
	}

out:
	strlist__delete(slist);
236 237
	if (threads)
		atomic_set(&threads->refcnt, 1);
238 239
	return threads;

240 241
out_free_namelist:
	for (i = 0; i < items; i++)
242
		zfree(&namelist[i]);
243 244
	free(namelist);

245
out_free_threads:
246
	zfree(&threads);
247 248 249
	goto out;
}

250 251
struct thread_map *thread_map__new_dummy(void)
{
252
	struct thread_map *threads = thread_map__alloc(1);
253 254

	if (threads != NULL) {
255 256
		thread_map__set_pid(threads, 0, -1);
		threads->nr = 1;
257
		atomic_set(&threads->refcnt, 1);
258 259 260 261
	}
	return threads;
}

262 263 264 265 266 267 268
static struct thread_map *thread_map__new_by_tid_str(const char *tid_str)
{
	struct thread_map *threads = NULL, *nt;
	int ntasks = 0;
	pid_t tid, prev_tid = INT_MAX;
	char *end_ptr;
	struct str_node *pos;
269
	struct strlist_config slist_config = { .dont_dupstr = true, };
270 271 272
	struct strlist *slist;

	/* perf-stat expects threads to be generated even if tid not given */
273 274
	if (!tid_str)
		return thread_map__new_dummy();
275

276
	slist = strlist__new(tid_str, &slist_config);
277 278 279 280 281 282 283 284 285 286 287 288 289 290
	if (!slist)
		return NULL;

	strlist__for_each(pos, slist) {
		tid = strtol(pos->s, &end_ptr, 10);

		if (tid == INT_MIN || tid == INT_MAX ||
		    (*end_ptr != '\0' && *end_ptr != ','))
			goto out_free_threads;

		if (tid == prev_tid)
			continue;

		ntasks++;
291
		nt = thread_map__realloc(threads, ntasks);
292 293 294 295 296

		if (nt == NULL)
			goto out_free_threads;

		threads = nt;
297 298
		thread_map__set_pid(threads, ntasks - 1, tid);
		threads->nr = ntasks;
299 300
	}
out:
301 302
	if (threads)
		atomic_set(&threads->refcnt, 1);
303 304 305
	return threads;

out_free_threads:
306
	zfree(&threads);
307 308 309 310 311 312 313 314 315 316 317 318 319 320 321
	goto out;
}

struct thread_map *thread_map__new_str(const char *pid, const char *tid,
				       uid_t uid)
{
	if (pid)
		return thread_map__new_by_pid_str(pid);

	if (!tid && uid != UINT_MAX)
		return thread_map__new_by_uid(uid);

	return thread_map__new_by_tid_str(tid);
}

322
static void thread_map__delete(struct thread_map *threads)
323
{
324
	if (threads) {
325 326
		int i;

327 328
		WARN_ONCE(atomic_read(&threads->refcnt) != 0,
			  "thread map refcnt unbalanced\n");
329 330
		for (i = 0; i < threads->nr; i++)
			free(thread_map__comm(threads, i));
331 332 333 334 335 336 337 338 339 340 341 342 343 344 345
		free(threads);
	}
}

struct thread_map *thread_map__get(struct thread_map *map)
{
	if (map)
		atomic_inc(&map->refcnt);
	return map;
}

void thread_map__put(struct thread_map *map)
{
	if (map && atomic_dec_and_test(&map->refcnt))
		thread_map__delete(map);
346
}
347 348 349 350 351 352 353

size_t thread_map__fprintf(struct thread_map *threads, FILE *fp)
{
	int i;
	size_t printed = fprintf(fp, "%d thread%s: ",
				 threads->nr, threads->nr > 1 ? "s" : "");
	for (i = 0; i < threads->nr; ++i)
354
		printed += fprintf(fp, "%s%d", i ? ", " : "", thread_map__pid(threads, i));
355 356 357

	return printed + fprintf(fp, "\n");
}
358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410

static int get_comm(char **comm, pid_t pid)
{
	char *path;
	size_t size;
	int err;

	if (asprintf(&path, "%s/%d/comm", procfs__mountpoint(), pid) == -1)
		return -ENOMEM;

	err = filename__read_str(path, comm, &size);
	if (!err) {
		/*
		 * We're reading 16 bytes, while filename__read_str
		 * allocates data per BUFSIZ bytes, so we can safely
		 * mark the end of the string.
		 */
		(*comm)[size] = 0;
		rtrim(*comm);
	}

	free(path);
	return err;
}

static void comm_init(struct thread_map *map, int i)
{
	pid_t pid = thread_map__pid(map, i);
	char *comm = NULL;

	/* dummy pid comm initialization */
	if (pid == -1) {
		map->map[i].comm = strdup("dummy");
		return;
	}

	/*
	 * The comm name is like extra bonus ;-),
	 * so just warn if we fail for any reason.
	 */
	if (get_comm(&comm, pid))
		pr_warning("Couldn't resolve comm name for pid %d\n", pid);

	map->map[i].comm = comm;
}

void thread_map__read_comms(struct thread_map *threads)
{
	int i;

	for (i = 0; i < threads->nr; ++i)
		comm_init(threads, i);
}