thread_map.c 6.1 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 "thread_map.h"
12
#include "util.h"
13 14 15 16 17 18 19 20 21 22

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

23 24 25 26 27 28 29 30 31
static struct thread_map *thread_map__realloc(struct thread_map *map, int nr)
{
	size_t size = sizeof(*map) + sizeof(pid_t) * nr;

	return realloc(map, size);
}

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

32 33 34 35 36 37 38 39 40 41 42
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)
43
		return NULL;
44

45
	threads = thread_map__alloc(items);
46 47
	if (threads != NULL) {
		for (i = 0; i < items; i++)
48
			thread_map__set_pid(threads, i, atoi(namelist[i]->d_name));
49 50 51 52
		threads->nr = items;
	}

	for (i=0; i<items; i++)
53
		zfree(&namelist[i]);
54 55 56 57 58 59 60
	free(namelist);

	return threads;
}

struct thread_map *thread_map__new_by_tid(pid_t tid)
{
61
	struct thread_map *threads = thread_map__alloc(1);
62 63

	if (threads != NULL) {
64 65
		thread_map__set_pid(threads, 0, tid);
		threads->nr = 1;
66 67 68 69 70
	}

	return threads;
}

71 72 73 74 75 76
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;
77 78
	struct thread_map *threads = thread_map__alloc(max_threads);

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
	if (threads == NULL)
		goto out;

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

	threads->nr = 0;

	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;

			tmp = realloc(threads, (sizeof(*threads) +
						max_threads * sizeof(pid_t)));
			if (tmp == NULL)
				goto out_free_namelist;

			threads = tmp;
		}

126 127 128 129
		for (i = 0; i < items; i++) {
			thread_map__set_pid(threads, threads->nr + i,
					    atoi(namelist[i]->d_name));
		}
130 131

		for (i = 0; i < items; i++)
132
			zfree(&namelist[i]);
133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148
		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++)
149
		zfree(&namelist[i]);
150 151 152
	free(namelist);

out_free_closedir:
153
	zfree(&threads);
154 155 156 157
	goto out_closedir;
}

struct thread_map *thread_map__new(pid_t pid, pid_t tid, uid_t uid)
158 159 160
{
	if (pid != -1)
		return thread_map__new_by_pid(pid);
161 162 163 164

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

165 166 167
	return thread_map__new_by_tid(tid);
}

168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198
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;
	struct strlist *slist = strlist__new(false, pid_str);

	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;
199
		nt = thread_map__realloc(threads, total_tasks);
200
		if (nt == NULL)
201
			goto out_free_namelist;
202 203 204

		threads = nt;

205
		for (i = 0; i < items; i++) {
206
			thread_map__set_pid(threads, j++, atoi(namelist[i]->d_name));
207
			zfree(&namelist[i]);
208 209
		}
		threads->nr = total_tasks;
210 211 212 213 214 215 216
		free(namelist);
	}

out:
	strlist__delete(slist);
	return threads;

217 218
out_free_namelist:
	for (i = 0; i < items; i++)
219
		zfree(&namelist[i]);
220 221
	free(namelist);

222
out_free_threads:
223
	zfree(&threads);
224 225 226
	goto out;
}

227 228
struct thread_map *thread_map__new_dummy(void)
{
229
	struct thread_map *threads = thread_map__alloc(1);
230 231

	if (threads != NULL) {
232 233
		thread_map__set_pid(threads, 0, -1);
		threads->nr = 1;
234 235 236 237
	}
	return threads;
}

238 239 240 241 242 243 244 245 246 247
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;
	struct strlist *slist;

	/* perf-stat expects threads to be generated even if tid not given */
248 249
	if (!tid_str)
		return thread_map__new_dummy();
250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265

	slist = strlist__new(false, tid_str);
	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++;
266
		nt = thread_map__realloc(threads, ntasks);
267 268 269 270 271

		if (nt == NULL)
			goto out_free_threads;

		threads = nt;
272 273
		thread_map__set_pid(threads, ntasks - 1, tid);
		threads->nr = ntasks;
274 275 276 277 278
	}
out:
	return threads;

out_free_threads:
279
	zfree(&threads);
280 281 282 283 284 285 286 287 288 289 290 291 292 293 294
	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);
}

295 296 297 298
void thread_map__delete(struct thread_map *threads)
{
	free(threads);
}
299 300 301 302 303 304 305

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)
306
		printed += fprintf(fp, "%s%d", i ? ", " : "", thread_map__pid(threads, i));
307 308 309

	return printed + fprintf(fp, "\n");
}