thread.c 6.3 KB
Newer Older
1 2 3 4 5 6
#include "../perf.h"
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include "thread.h"
#include "util.h"
7
#include "debug.h"
8

9 10 11
static struct rb_root threads;
static struct thread *last_match;

12 13 14 15 16 17 18 19 20 21 22
void thread__init(struct thread *self, pid_t pid)
{
	int i;
	self->pid = pid;
	self->comm = NULL;
	for (i = 0; i < MAP__NR_TYPES; ++i) {
		self->maps[i] = RB_ROOT;
		INIT_LIST_HEAD(&self->removed_maps[i]);
	}
}

23
static struct thread *thread__new(pid_t pid)
24
{
25
	struct thread *self = zalloc(sizeof(*self));
26 27

	if (self != NULL) {
28
		thread__init(self, pid);
29 30 31
		self->comm = malloc(32);
		if (self->comm)
			snprintf(self->comm, 32, ":%d", self->pid);
32 33 34 35 36 37 38 39 40 41 42 43 44
	}

	return self;
}

int thread__set_comm(struct thread *self, const char *comm)
{
	if (self->comm)
		free(self->comm);
	self->comm = strdup(comm);
	return self->comm ? 0 : -ENOMEM;
}

45 46 47 48 49 50 51 52 53 54 55
int thread__comm_len(struct thread *self)
{
	if (!self->comm_len) {
		if (!self->comm)
			return 0;
		self->comm_len = strlen(self->comm);
	}

	return self->comm_len;
}

56 57 58 59 60 61
static const char *map_type__name[MAP__NR_TYPES] = {
	[MAP__FUNCTION] = "Functions",
};

static size_t __thread__fprintf_maps(struct thread *self,
				     enum map_type type, FILE *fp)
62
{
63
	size_t printed = fprintf(fp, "%s:\n", map_type__name[type]);
64
	struct rb_node *nd;
65

66 67 68 69 70 71 72 73
	for (nd = rb_first(&self->maps[type]); nd; nd = rb_next(nd)) {
		struct map *pos = rb_entry(nd, struct map, rb_node);
		printed += fprintf(fp, "Map:");
		printed += map__fprintf(pos, fp);
		if (verbose > 1) {
			printed += dso__fprintf(pos->dso, type, fp);
			printed += fprintf(fp, "--\n");
		}
74
	}
75

76 77 78 79 80 81 82 83 84 85
	return printed;
}

size_t thread__fprintf_maps(struct thread *self, FILE *fp)
{
	size_t printed = 0, i;
	for (i = 0; i < MAP__NR_TYPES; ++i)
		printed += __thread__fprintf_maps(self, i, fp);
	return printed;
}
86

87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102
static size_t __thread__fprintf_removed_maps(struct thread *self,
					     enum map_type type, FILE *fp)
{
	struct map *pos;
	size_t printed = 0;

	list_for_each_entry(pos, &self->removed_maps[type], node) {
		printed += fprintf(fp, "Map:");
		printed += map__fprintf(pos, fp);
		if (verbose > 1) {
			printed += dso__fprintf(pos->dso, type, fp);
			printed += fprintf(fp, "--\n");
		}
	}
	return printed;
}
103

104 105 106 107 108 109 110 111 112 113 114 115 116 117
static size_t thread__fprintf_removed_maps(struct thread *self, FILE *fp)
{
	size_t printed = 0, i;
	for (i = 0; i < MAP__NR_TYPES; ++i)
		printed += __thread__fprintf_removed_maps(self, i, fp);
	return printed;
}

static size_t thread__fprintf(struct thread *self, FILE *fp)
{
	size_t printed = fprintf(fp, "Thread %d %s\n", self->pid, self->comm);
	printed += thread__fprintf_removed_maps(self, fp);
	printed += fprintf(fp, "Removed maps:\n");
	return printed + thread__fprintf_removed_maps(self, fp);
118 119
}

120
struct thread *threads__findnew(pid_t pid)
121
{
122
	struct rb_node **p = &threads.rb_node;
123 124 125 126 127 128 129 130
	struct rb_node *parent = NULL;
	struct thread *th;

	/*
	 * Font-end cache - PID lookups come in blocks,
	 * so most of the time we dont have to look up
	 * the full rbtree:
	 */
131 132
	if (last_match && last_match->pid == pid)
		return last_match;
133 134 135 136 137 138

	while (*p != NULL) {
		parent = *p;
		th = rb_entry(parent, struct thread, rb_node);

		if (th->pid == pid) {
139
			last_match = th;
140 141 142 143 144 145 146 147 148
			return th;
		}

		if (pid < th->pid)
			p = &(*p)->rb_left;
		else
			p = &(*p)->rb_right;
	}

149
	th = thread__new(pid);
150 151
	if (th != NULL) {
		rb_link_node(&th->rb_node, parent, p);
152 153
		rb_insert_color(&th->rb_node, &threads);
		last_match = th;
154 155 156 157 158
	}

	return th;
}

159
struct thread *register_idle_thread(void)
160
{
161
	struct thread *thread = threads__findnew(0);
162

163
	if (!thread || thread__set_comm(thread, "swapper")) {
164 165 166 167 168 169 170
		fprintf(stderr, "problem inserting idle task.\n");
		exit(-1);
	}

	return thread;
}

171
static void thread__remove_overlappings(struct thread *self, struct map *map)
172
{
173 174
	struct rb_root *root = &self->maps[map->type];
	struct rb_node *next = rb_first(root);
175 176 177 178 179 180 181 182 183

	while (next) {
		struct map *pos = rb_entry(next, struct map, rb_node);
		next = rb_next(&pos->rb_node);

		if (!map__overlap(pos, map))
			continue;

		if (verbose >= 2) {
184 185 186
			fputs("overlapping maps:\n", stderr);
			map__fprintf(map, stderr);
			map__fprintf(pos, stderr);
187 188
		}

189
		rb_erase(&pos->rb_node, root);
190 191 192 193 194
		/*
		 * We may have references to this map, for instance in some
		 * hist_entry instances, so just move them to a separate
		 * list.
		 */
195
		list_add_tail(&pos->node, &self->removed_maps[map->type]);
196
	}
197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237
}

void maps__insert(struct rb_root *maps, struct map *map)
{
	struct rb_node **p = &maps->rb_node;
	struct rb_node *parent = NULL;
	const u64 ip = map->start;
	struct map *m;

	while (*p != NULL) {
		parent = *p;
		m = rb_entry(parent, struct map, rb_node);
		if (ip < m->start)
			p = &(*p)->rb_left;
		else
			p = &(*p)->rb_right;
	}

	rb_link_node(&map->rb_node, parent, p);
	rb_insert_color(&map->rb_node, maps);
}

struct map *maps__find(struct rb_root *maps, u64 ip)
{
	struct rb_node **p = &maps->rb_node;
	struct rb_node *parent = NULL;
	struct map *m;

	while (*p != NULL) {
		parent = *p;
		m = rb_entry(parent, struct map, rb_node);
		if (ip < m->start)
			p = &(*p)->rb_left;
		else if (ip > m->end)
			p = &(*p)->rb_right;
		else
			return m;
	}

	return NULL;
}
238

239 240 241
void thread__insert_map(struct thread *self, struct map *map)
{
	thread__remove_overlappings(self, map);
242
	maps__insert(&self->maps[map->type], map);
243 244
}

245 246
static int thread__clone_maps(struct thread *self, struct thread *parent,
			      enum map_type type)
247
{
248
	struct rb_node *nd;
249 250 251 252 253 254 255 256 257 258 259 260 261
	for (nd = rb_first(&parent->maps[type]); nd; nd = rb_next(nd)) {
		struct map *map = rb_entry(nd, struct map, rb_node);
		struct map *new = map__clone(map);
		if (new == NULL)
			return -ENOMEM;
		thread__insert_map(self, new);
	}
	return 0;
}

int thread__fork(struct thread *self, struct thread *parent)
{
	int i;
262 263 264 265 266 267 268

	if (self->comm)
		free(self->comm);
	self->comm = strdup(parent->comm);
	if (!self->comm)
		return -ENOMEM;

269 270
	for (i = 0; i < MAP__NR_TYPES; ++i)
		if (thread__clone_maps(self, parent, i) < 0)
271 272 273 274
			return -ENOMEM;
	return 0;
}

275
size_t threads__fprintf(FILE *fp)
276 277 278 279
{
	size_t ret = 0;
	struct rb_node *nd;

280
	for (nd = rb_first(&threads); nd; nd = rb_next(nd)) {
281 282 283 284 285 286 287
		struct thread *pos = rb_entry(nd, struct thread, rb_node);

		ret += thread__fprintf(pos, fp);
	}

	return ret;
}
288 289 290 291 292 293 294 295 296 297 298 299

struct symbol *thread__find_symbol(struct thread *self,
				   enum map_type type, u64 addr,
				   symbol_filter_t filter)
{
	struct map *map = thread__find_map(self, type, addr);

	if (map != NULL)
		return map__find_symbol(map, map->map_ip(map, addr), filter);

	return NULL;
}