map.c 14.8 KB
Newer Older
1
#include "symbol.h"
2
#include <errno.h>
3
#include <inttypes.h>
4
#include <limits.h>
5 6 7
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
8
#include <unistd.h>
9
#include "map.h"
10

11 12 13 14 15
const char *map_type__name[MAP__NR_TYPES] = {
	[MAP__FUNCTION] = "Functions",
	[MAP__VARIABLE] = "Variables",
};

16 17 18 19 20
static inline int is_anon_memory(const char *filename)
{
	return strcmp(filename, "//anon") == 0;
}

21 22
void map__init(struct map *self, enum map_type type,
	       u64 start, u64 end, u64 pgoff, struct dso *dso)
23
{
24
	self->type     = type;
25 26 27 28 29 30 31
	self->start    = start;
	self->end      = end;
	self->pgoff    = pgoff;
	self->dso      = dso;
	self->map_ip   = map__map_ip;
	self->unmap_ip = map__unmap_ip;
	RB_CLEAR_NODE(&self->rb_node);
32
	self->groups   = NULL;
33
	self->referenced = false;
34 35
}

36 37
struct map *map__new(struct list_head *dsos__list, u64 start, u64 len,
		     u64 pgoff, u32 pid, char *filename,
38
		     enum map_type type)
39 40 41 42 43
{
	struct map *self = malloc(sizeof(*self));

	if (self != NULL) {
		char newfilename[PATH_MAX];
44
		struct dso *dso;
45 46 47 48 49
		int anon;

		anon = is_anon_memory(filename);

		if (anon) {
50
			snprintf(newfilename, sizeof(newfilename), "/tmp/perf-%d.map", pid);
51 52 53
			filename = newfilename;
		}

54
		dso = __dsos__findnew(dsos__list, filename);
55
		if (dso == NULL)
56 57
			goto out_delete;

58
		map__init(self, type, start, start + len, pgoff, dso);
59

60 61
		if (anon) {
set_identity:
62
			self->map_ip = self->unmap_ip = identity__map_ip;
63 64 65 66
		} else if (strcmp(filename, "[vdso]") == 0) {
			dso__set_loaded(dso, self->type);
			goto set_identity;
		}
67 68 69 70 71 72 73
	}
	return self;
out_delete:
	free(self);
	return NULL;
}

74 75 76 77 78
void map__delete(struct map *self)
{
	free(self);
}

79
void map__fixup_start(struct map *self)
80
{
81
	struct rb_root *symbols = &self->dso->symbols[self->type];
82
	struct rb_node *nd = rb_first(symbols);
83 84 85 86 87 88
	if (nd != NULL) {
		struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
		self->start = sym->start;
	}
}

89
void map__fixup_end(struct map *self)
90
{
91
	struct rb_root *symbols = &self->dso->symbols[self->type];
92
	struct rb_node *nd = rb_last(symbols);
93 94 95 96 97 98
	if (nd != NULL) {
		struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
		self->end = sym->end;
	}
}

99 100
#define DSO__DELETED "(deleted)"

101
int map__load(struct map *self, symbol_filter_t filter)
102
{
103
	const char *name = self->dso->long_name;
104
	int nr;
105

106 107 108
	if (dso__loaded(self->dso, self->type))
		return 0;

109
	nr = dso__load(self->dso, self, filter);
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
	if (nr < 0) {
		if (self->dso->has_build_id) {
			char sbuild_id[BUILD_ID_SIZE * 2 + 1];

			build_id__sprintf(self->dso->build_id,
					  sizeof(self->dso->build_id),
					  sbuild_id);
			pr_warning("%s with build id %s not found",
				   name, sbuild_id);
		} else
			pr_warning("Failed to open %s", name);

		pr_warning(", continuing without symbols\n");
		return -1;
	} else if (nr == 0) {
		const size_t len = strlen(name);
		const size_t real_len = len - sizeof(DSO__DELETED);

		if (len > sizeof(DSO__DELETED) &&
		    strcmp(name + real_len + 1, DSO__DELETED) == 0) {
			pr_warning("%.*s was updated, restart the long "
				   "running apps that use it!\n",
				   (int)real_len, name);
		} else {
			pr_warning("no symbols found in %s, maybe install "
				   "a debug package?\n", name);
136
		}
137 138

		return -1;
139
	}
140 141 142 143 144 145
	/*
	 * Only applies to the kernel, as its symtabs aren't relative like the
	 * module ones.
	 */
	if (self->dso->kernel)
		map__reloc_vmlinux(self);
146

147 148 149
	return 0;
}

150 151
struct symbol *map__find_symbol(struct map *self, u64 addr,
				symbol_filter_t filter)
152
{
153
	if (map__load(self, filter) < 0)
154 155
		return NULL;

156
	return dso__find_symbol(self->dso, self->type, addr);
157 158
}

159 160 161
struct symbol *map__find_symbol_by_name(struct map *self, const char *name,
					symbol_filter_t filter)
{
162
	if (map__load(self, filter) < 0)
163 164 165 166 167 168 169 170
		return NULL;

	if (!dso__sorted_by_name(self->dso, self->type))
		dso__sort_by_name(self->dso, self->type);

	return dso__find_symbol_by_name(self->dso, self->type, name);
}

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
struct map *map__clone(struct map *self)
{
	struct map *map = malloc(sizeof(*self));

	if (!map)
		return NULL;

	memcpy(map, self, sizeof(*self));

	return map;
}

int map__overlap(struct map *l, struct map *r)
{
	if (l->start > r->start) {
		struct map *t = l;
		l = r;
		r = t;
	}

	if (l->end > r->start)
		return 1;

	return 0;
}

size_t map__fprintf(struct map *self, FILE *fp)
{
199
	return fprintf(fp, " %" PRIx64 "-%" PRIx64 " %" PRIx64 " %s\n",
200 201
		       self->start, self->end, self->pgoff, self->dso->name);
}
202 203 204 205 206 207 208 209 210 211 212 213

/*
 * objdump wants/reports absolute IPs for ET_EXEC, and RIPs for ET_DYN.
 * map->dso->adjust_symbols==1 for ET_EXEC-like cases.
 */
u64 map__rip_2objdump(struct map *map, u64 rip)
{
	u64 addr = map->dso->adjust_symbols ?
			map->unmap_ip(map, rip) :	/* RIP -> IP */
			rip;
	return addr;
}
214 215 216 217 218 219 220 221

u64 map__objdump_2ip(struct map *map, u64 addr)
{
	u64 ip = map->dso->adjust_symbols ?
			addr :
			map->unmap_ip(map, addr);	/* RIP -> IP */
	return ip;
}
222

223 224 225 226 227 228 229
void map_groups__init(struct map_groups *self)
{
	int i;
	for (i = 0; i < MAP__NR_TYPES; ++i) {
		self->maps[i] = RB_ROOT;
		INIT_LIST_HEAD(&self->removed_maps[i]);
	}
230
	self->machine = NULL;
231 232
}

233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265
static void maps__delete(struct rb_root *self)
{
	struct rb_node *next = rb_first(self);

	while (next) {
		struct map *pos = rb_entry(next, struct map, rb_node);

		next = rb_next(&pos->rb_node);
		rb_erase(&pos->rb_node, self);
		map__delete(pos);
	}
}

static void maps__delete_removed(struct list_head *self)
{
	struct map *pos, *n;

	list_for_each_entry_safe(pos, n, self, node) {
		list_del(&pos->node);
		map__delete(pos);
	}
}

void map_groups__exit(struct map_groups *self)
{
	int i;

	for (i = 0; i < MAP__NR_TYPES; ++i) {
		maps__delete(&self->maps[i]);
		maps__delete_removed(&self->removed_maps[i]);
	}
}

266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287
void map_groups__flush(struct map_groups *self)
{
	int type;

	for (type = 0; type < MAP__NR_TYPES; type++) {
		struct rb_root *root = &self->maps[type];
		struct rb_node *next = rb_first(root);

		while (next) {
			struct map *pos = rb_entry(next, struct map, rb_node);
			next = rb_next(&pos->rb_node);
			rb_erase(&pos->rb_node, root);
			/*
			 * We may have references to this map, for
			 * instance in some hist_entry instances, so
			 * just move them to a separate list.
			 */
			list_add_tail(&pos->node, &self->removed_maps[pos->type]);
		}
	}
}

288 289
struct symbol *map_groups__find_symbol(struct map_groups *self,
				       enum map_type type, u64 addr,
290
				       struct map **mapp,
291 292 293 294
				       symbol_filter_t filter)
{
	struct map *map = map_groups__find(self, type, addr);

295 296 297
	if (map != NULL) {
		if (mapp != NULL)
			*mapp = map;
298
		return map__find_symbol(map, map->map_ip(map, addr), filter);
299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321
	}

	return NULL;
}

struct symbol *map_groups__find_symbol_by_name(struct map_groups *self,
					       enum map_type type,
					       const char *name,
					       struct map **mapp,
					       symbol_filter_t filter)
{
	struct rb_node *nd;

	for (nd = rb_first(&self->maps[type]); nd; nd = rb_next(nd)) {
		struct map *pos = rb_entry(nd, struct map, rb_node);
		struct symbol *sym = map__find_symbol_by_name(pos, name, filter);

		if (sym == NULL)
			continue;
		if (mapp != NULL)
			*mapp = pos;
		return sym;
	}
322 323 324 325

	return NULL;
}

326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 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
size_t __map_groups__fprintf_maps(struct map_groups *self,
				  enum map_type type, int verbose, FILE *fp)
{
	size_t printed = fprintf(fp, "%s:\n", map_type__name[type]);
	struct rb_node *nd;

	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 > 2) {
			printed += dso__fprintf(pos->dso, type, fp);
			printed += fprintf(fp, "--\n");
		}
	}

	return printed;
}

size_t map_groups__fprintf_maps(struct map_groups *self, int verbose, FILE *fp)
{
	size_t printed = 0, i;
	for (i = 0; i < MAP__NR_TYPES; ++i)
		printed += __map_groups__fprintf_maps(self, i, verbose, fp);
	return printed;
}

static size_t __map_groups__fprintf_removed_maps(struct map_groups *self,
						 enum map_type type,
						 int verbose, 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;
}

static size_t map_groups__fprintf_removed_maps(struct map_groups *self,
					       int verbose, FILE *fp)
{
	size_t printed = 0, i;
	for (i = 0; i < MAP__NR_TYPES; ++i)
		printed += __map_groups__fprintf_removed_maps(self, i, verbose, fp);
	return printed;
}

size_t map_groups__fprintf(struct map_groups *self, int verbose, FILE *fp)
{
	size_t printed = map_groups__fprintf_maps(self, verbose, fp);
	printed += fprintf(fp, "Removed maps:\n");
	return printed + map_groups__fprintf_removed_maps(self, verbose, fp);
}

int map_groups__fixup_overlappings(struct map_groups *self, struct map *map,
				   int verbose, FILE *fp)
{
	struct rb_root *root = &self->maps[map->type];
	struct rb_node *next = rb_first(root);
392
	int err = 0;
393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414

	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) {
			fputs("overlapping maps:\n", fp);
			map__fprintf(map, fp);
			map__fprintf(pos, fp);
		}

		rb_erase(&pos->rb_node, root);
		/*
		 * Now check if we need to create new maps for areas not
		 * overlapped by the new map:
		 */
		if (map->start > pos->start) {
			struct map *before = map__clone(pos);

415 416 417 418
			if (before == NULL) {
				err = -ENOMEM;
				goto move_map;
			}
419 420 421 422 423 424 425 426 427 428

			before->end = map->start - 1;
			map_groups__insert(self, before);
			if (verbose >= 2)
				map__fprintf(before, fp);
		}

		if (map->end < pos->end) {
			struct map *after = map__clone(pos);

429 430 431 432
			if (after == NULL) {
				err = -ENOMEM;
				goto move_map;
			}
433 434 435 436 437 438

			after->start = map->end + 1;
			map_groups__insert(self, after);
			if (verbose >= 2)
				map__fprintf(after, fp);
		}
439 440 441 442 443 444 445 446 447 448 449
move_map:
		/*
		 * If we have references, just move them to a separate list.
		 */
		if (pos->referenced)
			list_add_tail(&pos->node, &self->removed_maps[map->type]);
		else
			map__delete(pos);

		if (err)
			return err;
450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471
	}

	return 0;
}

/*
 * XXX This should not really _copy_ te maps, but refcount them.
 */
int map_groups__clone(struct map_groups *self,
		      struct map_groups *parent, enum map_type type)
{
	struct rb_node *nd;
	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;
		map_groups__insert(self, new);
	}
	return 0;
}

472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520
static u64 map__reloc_map_ip(struct map *map, u64 ip)
{
	return ip + (s64)map->pgoff;
}

static u64 map__reloc_unmap_ip(struct map *map, u64 ip)
{
	return ip - (s64)map->pgoff;
}

void map__reloc_vmlinux(struct map *self)
{
	struct kmap *kmap = map__kmap(self);
	s64 reloc;

	if (!kmap->ref_reloc_sym || !kmap->ref_reloc_sym->unrelocated_addr)
		return;

	reloc = (kmap->ref_reloc_sym->unrelocated_addr -
		 kmap->ref_reloc_sym->addr);

	if (!reloc)
		return;

	self->map_ip   = map__reloc_map_ip;
	self->unmap_ip = map__reloc_unmap_ip;
	self->pgoff    = reloc;
}

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);
}

521 522 523 524 525
void maps__remove(struct rb_root *self, struct map *map)
{
	rb_erase(&map->rb_node, self);
}

526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544
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;
}
545

546 547 548 549 550 551 552 553 554 555 556 557 558
int machine__init(struct machine *self, const char *root_dir, pid_t pid)
{
	map_groups__init(&self->kmaps);
	RB_CLEAR_NODE(&self->rb_node);
	INIT_LIST_HEAD(&self->user_dsos);
	INIT_LIST_HEAD(&self->kernel_dsos);

	self->kmaps.machine = self;
	self->pid	    = pid;
	self->root_dir      = strdup(root_dir);
	return self->root_dir == NULL ? -ENOMEM : 0;
}

559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577
static void dsos__delete(struct list_head *self)
{
	struct dso *pos, *n;

	list_for_each_entry_safe(pos, n, self, node) {
		list_del(&pos->node);
		dso__delete(pos);
	}
}

void machine__exit(struct machine *self)
{
	map_groups__exit(&self->kmaps);
	dsos__delete(&self->user_dsos);
	dsos__delete(&self->kernel_dsos);
	free(self->root_dir);
	self->root_dir = NULL;
}

578 579 580 581 582 583
void machine__delete(struct machine *self)
{
	machine__exit(self);
	free(self);
}

584 585
struct machine *machines__add(struct rb_root *self, pid_t pid,
			      const char *root_dir)
586
{
587
	struct rb_node **p = &self->rb_node;
588
	struct rb_node *parent = NULL;
589
	struct machine *pos, *machine = malloc(sizeof(*machine));
590

591
	if (!machine)
592 593
		return NULL;

594 595 596 597
	if (machine__init(machine, root_dir, pid) != 0) {
		free(machine);
		return NULL;
	}
598 599 600

	while (*p != NULL) {
		parent = *p;
601
		pos = rb_entry(parent, struct machine, rb_node);
602 603 604 605 606 607
		if (pid < pos->pid)
			p = &(*p)->rb_left;
		else
			p = &(*p)->rb_right;
	}

608 609
	rb_link_node(&machine->rb_node, parent, p);
	rb_insert_color(&machine->rb_node, self);
610

611
	return machine;
612 613
}

614
struct machine *machines__find(struct rb_root *self, pid_t pid)
615
{
616
	struct rb_node **p = &self->rb_node;
617
	struct rb_node *parent = NULL;
618 619
	struct machine *machine;
	struct machine *default_machine = NULL;
620 621 622

	while (*p != NULL) {
		parent = *p;
623 624
		machine = rb_entry(parent, struct machine, rb_node);
		if (pid < machine->pid)
625
			p = &(*p)->rb_left;
626
		else if (pid > machine->pid)
627 628
			p = &(*p)->rb_right;
		else
629 630 631
			return machine;
		if (!machine->pid)
			default_machine = machine;
632 633
	}

634
	return default_machine;
635 636
}

637
struct machine *machines__findnew(struct rb_root *self, pid_t pid)
638 639 640
{
	char path[PATH_MAX];
	const char *root_dir;
641
	struct machine *machine = machines__find(self, pid);
642

643
	if (!machine || machine->pid != pid) {
644 645 646 647 648 649
		if (pid == HOST_KERNEL_ID || pid == DEFAULT_GUEST_KERNEL_ID)
			root_dir = "";
		else {
			if (!symbol_conf.guestmount)
				goto out;
			sprintf(path, "%s/%d", symbol_conf.guestmount, pid);
650
			if (access(path, R_OK)) {
651 652 653 654 655
				pr_err("Can't access file %s\n", path);
				goto out;
			}
			root_dir = path;
		}
656
		machine = machines__add(self, pid, root_dir);
657 658 659
	}

out:
660
	return machine;
661 662
}

663
void machines__process(struct rb_root *self, machine__process_t process, void *data)
664 665 666
{
	struct rb_node *nd;

667 668
	for (nd = rb_first(self); nd; nd = rb_next(nd)) {
		struct machine *pos = rb_entry(nd, struct machine, rb_node);
669 670 671 672
		process(pos, data);
	}
}

673
char *machine__mmap_name(struct machine *self, char *bf, size_t size)
674
{
675
	if (machine__is_host(self))
676
		snprintf(bf, size, "[%s]", "kernel.kallsyms");
677
	else if (machine__is_default_guest(self))
678
		snprintf(bf, size, "[%s]", "guest.kernel.kallsyms");
679
	else
680
		snprintf(bf, size, "[%s.%d]", "guest.kernel.kallsyms", self->pid);
681

682
	return bf;
683
}