[linux-2.6-block.git] / tools / perf / util / map.c

#include "symbol.h"
#include <errno.h>
#include <inttypes.h>
#include <limits.h>
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <unistd.h>
#include "map.h"

const char *map_type__name[MAP__NR_TYPES] = {
	[MAP__FUNCTION] = "Functions",
	[MAP__VARIABLE] = "Variables",
};

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

static inline int is_no_dso_memory(const char *filename)
{
	return !strcmp(filename, "[stack]") ||
	       !strcmp(filename, "[vdso]")  ||
	       !strcmp(filename, "[heap]");
}

void map__init(struct map *self, enum map_type type,
	       u64 start, u64 end, u64 pgoff, struct dso *dso)
{
	self->type     = type;
	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);
	self->groups   = NULL;
	self->referenced = false;
}

struct map *map__new(struct list_head *dsos__list, u64 start, u64 len,
		     u64 pgoff, u32 pid, char *filename,
		     enum map_type type)
{
	struct map *self = malloc(sizeof(*self));

	if (self != NULL) {
		char newfilename[PATH_MAX];
		struct dso *dso;
		int anon, no_dso;

		anon = is_anon_memory(filename);
		no_dso = is_no_dso_memory(filename);

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

		dso = __dsos__findnew(dsos__list, filename);
		if (dso == NULL)
			goto out_delete;

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

		if (anon || no_dso) {
			self->map_ip = self->unmap_ip = identity__map_ip;

			/*
			 * Set memory without DSO as loaded. All map__find_*
			 * functions still return NULL, and we avoid the
			 * unnecessary map__load warning.
			 */
			if (no_dso)
				dso__set_loaded(dso, self->type);
		}
	}
	return self;
out_delete:
	free(self);
	return NULL;
}

void map__delete(struct map *self)
{
	free(self);
}

void map__fixup_start(struct map *self)
{
	struct rb_root *symbols = &self->dso->symbols[self->type];
	struct rb_node *nd = rb_first(symbols);
	if (nd != NULL) {
		struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
		self->start = sym->start;
	}
}

void map__fixup_end(struct map *self)
{
	struct rb_root *symbols = &self->dso->symbols[self->type];
	struct rb_node *nd = rb_last(symbols);
	if (nd != NULL) {
		struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
		self->end = sym->end;
	}
}

#define DSO__DELETED "(deleted)"

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

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

	nr = dso__load(self->dso, self, filter);
	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 (is prelink enabled?). "
				"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);
		}

		return -1;
	}
	/*
	 * Only applies to the kernel, as its symtabs aren't relative like the
	 * module ones.
	 */
	if (self->dso->kernel)
		map__reloc_vmlinux(self);

	return 0;
}

struct symbol *map__find_symbol(struct map *self, u64 addr,
				symbol_filter_t filter)
{
	if (map__load(self, filter) < 0)
		return NULL;

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

struct symbol *map__find_symbol_by_name(struct map *self, const char *name,
					symbol_filter_t filter)
{
	if (map__load(self, filter) < 0)
		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);
}

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)
{
	return fprintf(fp, " %" PRIx64 "-%" PRIx64 " %" PRIx64 " %s\n",
		       self->start, self->end, self->pgoff, self->dso->name);
}

/*
 * 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;
}

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

void map_groups__init(struct map_groups *mg)
{
	int i;
	for (i = 0; i < MAP__NR_TYPES; ++i) {
		mg->maps[i] = RB_ROOT;
		INIT_LIST_HEAD(&mg->removed_maps[i]);
	}
	mg->machine = NULL;
}

static void maps__delete(struct rb_root *maps)
{
	struct rb_node *next = rb_first(maps);

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

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

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

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

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

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

void map_groups__flush(struct map_groups *mg)
{
	int type;

	for (type = 0; type < MAP__NR_TYPES; type++) {
		struct rb_root *root = &mg->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, &mg->removed_maps[pos->type]);
		}
	}
}

struct symbol *map_groups__find_symbol(struct map_groups *mg,
				       enum map_type type, u64 addr,
				       struct map **mapp,
				       symbol_filter_t filter)
{
	struct map *map = map_groups__find(mg, type, addr);

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

	return NULL;
}

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

	for (nd = rb_first(&mg->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;
	}

	return NULL;
}

size_t __map_groups__fprintf_maps(struct map_groups *mg,
				  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(&mg->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 *mg, int verbose, FILE *fp)
{
	size_t printed = 0, i;
	for (i = 0; i < MAP__NR_TYPES; ++i)
		printed += __map_groups__fprintf_maps(mg, i, verbose, fp);
	return printed;
}

static size_t __map_groups__fprintf_removed_maps(struct map_groups *mg,
						 enum map_type type,
						 int verbose, FILE *fp)
{
	struct map *pos;
	size_t printed = 0;

	list_for_each_entry(pos, &mg->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 *mg,
					       int verbose, FILE *fp)
{
	size_t printed = 0, i;
	for (i = 0; i < MAP__NR_TYPES; ++i)
		printed += __map_groups__fprintf_removed_maps(mg, i, verbose, fp);
	return printed;
}

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

int map_groups__fixup_overlappings(struct map_groups *mg, struct map *map,
				   int verbose, FILE *fp)
{
	struct rb_root *root = &mg->maps[map->type];
	struct rb_node *next = rb_first(root);
	int err = 0;

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

			if (before == NULL) {
				err = -ENOMEM;
				goto move_map;
			}

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

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

			if (after == NULL) {
				err = -ENOMEM;
				goto move_map;
			}

			after->start = map->end + 1;
			map_groups__insert(mg, after);
			if (verbose >= 2)
				map__fprintf(after, fp);
		}
move_map:
		/*
		 * If we have references, just move them to a separate list.
		 */
		if (pos->referenced)
			list_add_tail(&pos->node, &mg->removed_maps[map->type]);
		else
			map__delete(pos);

		if (err)
			return err;
	}

	return 0;
}

/*
 * XXX This should not really _copy_ te maps, but refcount them.
 */
int map_groups__clone(struct map_groups *mg,
		      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(mg, new);
	}
	return 0;
}

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

void maps__remove(struct rb_root *self, struct map *map)
{
	rb_erase(&map->rb_node, self);
}

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

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->threads = RB_ROOT;
	INIT_LIST_HEAD(&self->dead_threads);
	self->last_match = NULL;

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

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

void machine__delete(struct machine *self)
{
	machine__exit(self);
	free(self);
}

struct machine *machines__add(struct rb_root *self, pid_t pid,
			      const char *root_dir)
{
	struct rb_node **p = &self->rb_node;
	struct rb_node *parent = NULL;
	struct machine *pos, *machine = malloc(sizeof(*machine));

	if (!machine)
		return NULL;

	if (machine__init(machine, root_dir, pid) != 0) {
		free(machine);
		return NULL;
	}

	while (*p != NULL) {
		parent = *p;
		pos = rb_entry(parent, struct machine, rb_node);
		if (pid < pos->pid)
			p = &(*p)->rb_left;
		else
			p = &(*p)->rb_right;
	}

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

	return machine;
}

struct machine *machines__find(struct rb_root *self, pid_t pid)
{
	struct rb_node **p = &self->rb_node;
	struct rb_node *parent = NULL;
	struct machine *machine;
	struct machine *default_machine = NULL;

	while (*p != NULL) {
		parent = *p;
		machine = rb_entry(parent, struct machine, rb_node);
		if (pid < machine->pid)
			p = &(*p)->rb_left;
		else if (pid > machine->pid)
			p = &(*p)->rb_right;
		else
			return machine;
		if (!machine->pid)
			default_machine = machine;
	}

	return default_machine;
}

struct machine *machines__findnew(struct rb_root *self, pid_t pid)
{
	char path[PATH_MAX];
	const char *root_dir;
	struct machine *machine = machines__find(self, pid);

	if (!machine || machine->pid != pid) {
		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);
			if (access(path, R_OK)) {
				pr_err("Can't access file %s\n", path);
				goto out;
			}
			root_dir = path;
		}
		machine = machines__add(self, pid, root_dir);
	}

out:
	return machine;
}

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

	for (nd = rb_first(self); nd; nd = rb_next(nd)) {
		struct machine *pos = rb_entry(nd, struct machine, rb_node);
		process(pos, data);
	}
}

char *machine__mmap_name(struct machine *self, char *bf, size_t size)
{
	if (machine__is_host(self))
		snprintf(bf, size, "[%s]", "kernel.kallsyms");
	else if (machine__is_default_guest(self))
		snprintf(bf, size, "[%s]", "guest.kernel.kallsyms");
	else
		snprintf(bf, size, "[%s.%d]", "guest.kernel.kallsyms", self->pid);

	return bf;
}
Commit	Line	Data
66e274f3	1	#include "symbol.h"
c6e718ff	2	#include <errno.h>
9486aa38	3	#include <inttypes.h>
4b8cf846	4	#include <limits.h>
66e274f3 FW	5	#include <stdlib.h>
	6	#include <string.h>
	7	#include <stdio.h>
a1645ce1	8	#include <unistd.h>
4b8cf846	9	#include "map.h"
66e274f3	10
3846df2e ACM	11	const char *map_type__name[MAP__NR_TYPES] = {
	12	[MAP__FUNCTION] = "Functions",
	13	[MAP__VARIABLE] = "Variables",
	14	};
	15
66e274f3 FW	16	static inline int is_anon_memory(const char *filename)
	17	{
	18	return strcmp(filename, "//anon") == 0;
	19	}
	20
87ffef79 JO	21	static inline int is_no_dso_memory(const char *filename)
	22	{
	23	return !strcmp(filename, "[stack]") \|\|
	24	!strcmp(filename, "[vdso]") \|\|
	25	!strcmp(filename, "[heap]");
	26	}
	27
3610583c ACM	28	void map__init(struct map *self, enum map_type type,
3610583c ACM	29	u64 start, u64 end, u64 pgoff, struct dso *dso)
afb7b4f0	30	{
3610583c	31	self->type = type;
afb7b4f0 ACM	32	self->start = start;
	33	self->end = end;
	34	self->pgoff = pgoff;
	35	self->dso = dso;
	36	self->map_ip = map__map_ip;
	37	self->unmap_ip = map__unmap_ip;
	38	RB_CLEAR_NODE(&self->rb_node);
a1645ce1	39	self->groups = NULL;
0a1eae39	40	self->referenced = false;
afb7b4f0 ACM	41	}
afb7b4f0 ACM	42
a1645ce1 ZY	43	struct map map__new(struct list_head dsos__list, u64 start, u64 len,
a1645ce1 ZY	44	u64 pgoff, u32 pid, char *filename,
361d1346	45	enum map_type type)
66e274f3 FW	46	{
	47	struct map self = malloc(sizeof(self));
	48
	49	if (self != NULL) {
66e274f3	50	char newfilename[PATH_MAX];
afb7b4f0	51	struct dso *dso;
87ffef79	52	int anon, no_dso;
66e274f3	53
66e274f3	54	anon = is_anon_memory(filename);
87ffef79	55	no_dso = is_no_dso_memory(filename);
66e274f3 FW	56
66e274f3 FW	57	if (anon) {
b177f63f	58	snprintf(newfilename, sizeof(newfilename), "/tmp/perf-%d.map", pid);
66e274f3 FW	59	filename = newfilename;
	60	}
	61
a1645ce1	62	dso = __dsos__findnew(dsos__list, filename);
afb7b4f0	63	if (dso == NULL)
66e274f3 FW	64	goto out_delete;
66e274f3 FW	65
b177f63f	66	map__init(self, type, start, start + len, pgoff, dso);
afb7b4f0	67
87ffef79	68	if (anon \|\| no_dso) {
ed52ce2e	69	self->map_ip = self->unmap_ip = identity__map_ip;
87ffef79 JO	70
	71	/*
	72	* Set memory without DSO as loaded. All map__find_*
	73	* functions still return NULL, and we avoid the
	74	* unnecessary map__load warning.
	75	*/
	76	if (no_dso)
	77	dso__set_loaded(dso, self->type);
8d92c02a	78	}
66e274f3 FW	79	}
	80	return self;
	81	out_delete:
	82	free(self);
	83	return NULL;
	84	}
	85
c338aee8 ACM	86	void map__delete(struct map *self)
	87	{
	88	free(self);
	89	}
	90
6a4694a4	91	void map__fixup_start(struct map *self)
c338aee8	92	{
6a4694a4	93	struct rb_root *symbols = &self->dso->symbols[self->type];
fcf1203a	94	struct rb_node *nd = rb_first(symbols);
c338aee8 ACM	95	if (nd != NULL) {
	96	struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
	97	self->start = sym->start;
	98	}
	99	}
	100
6a4694a4	101	void map__fixup_end(struct map *self)
c338aee8	102	{
6a4694a4	103	struct rb_root *symbols = &self->dso->symbols[self->type];
fcf1203a	104	struct rb_node *nd = rb_last(symbols);
c338aee8 ACM	105	if (nd != NULL) {
	106	struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
	107	self->end = sym->end;
	108	}
	109	}
	110
d70a5402 ACM	111	#define DSO__DELETED "(deleted)"
d70a5402 ACM	112
9de89fe7	113	int map__load(struct map *self, symbol_filter_t filter)
66bd8424	114	{
79406cd7	115	const char *name = self->dso->long_name;
a128168d	116	int nr;
79406cd7	117
a128168d MH	118	if (dso__loaded(self->dso, self->type))
	119	return 0;
	120
9de89fe7	121	nr = dso__load(self->dso, self, filter);
79406cd7 ACM	122	if (nr < 0) {
	123	if (self->dso->has_build_id) {
	124	char sbuild_id[BUILD_ID_SIZE * 2 + 1];
	125
	126	build_id__sprintf(self->dso->build_id,
	127	sizeof(self->dso->build_id),
	128	sbuild_id);
	129	pr_warning("%s with build id %s not found",
	130	name, sbuild_id);
	131	} else
	132	pr_warning("Failed to open %s", name);
	133
	134	pr_warning(", continuing without symbols\n");
	135	return -1;
	136	} else if (nr == 0) {
	137	const size_t len = strlen(name);
	138	const size_t real_len = len - sizeof(DSO__DELETED);
	139
	140	if (len > sizeof(DSO__DELETED) &&
	141	strcmp(name + real_len + 1, DSO__DELETED) == 0) {
e77b15bd DA	142	pr_warning("%.*s was updated (is prelink enabled?). "
e77b15bd DA	143	"Restart the long running apps that use it!\n",
79406cd7 ACM	144	(int)real_len, name);
	145	} else {
	146	pr_warning("no symbols found in %s, maybe install "
	147	"a debug package?\n", name);
66bd8424	148	}
79406cd7 ACM	149
79406cd7 ACM	150	return -1;
66bd8424	151	}
9de89fe7 ACM	152	/*
	153	* Only applies to the kernel, as its symtabs aren't relative like the
	154	* module ones.
	155	*/
	156	if (self->dso->kernel)
	157	map__reloc_vmlinux(self);
66bd8424	158
79406cd7 ACM	159	return 0;
	160	}
	161
9de89fe7 ACM	162	struct symbol map__find_symbol(struct map self, u64 addr,
9de89fe7 ACM	163	symbol_filter_t filter)
79406cd7	164	{
9de89fe7	165	if (map__load(self, filter) < 0)
79406cd7 ACM	166	return NULL;
79406cd7 ACM	167
ea08d8cb	168	return dso__find_symbol(self->dso, self->type, addr);
66bd8424 ACM	169	}
66bd8424 ACM	170
79406cd7 ACM	171	struct symbol map__find_symbol_by_name(struct map self, const char *name,
	172	symbol_filter_t filter)
	173	{
9de89fe7	174	if (map__load(self, filter) < 0)
79406cd7 ACM	175	return NULL;
	176
	177	if (!dso__sorted_by_name(self->dso, self->type))
	178	dso__sort_by_name(self->dso, self->type);
	179
	180	return dso__find_symbol_by_name(self->dso, self->type, name);
	181	}
	182
66e274f3 FW	183	struct map map__clone(struct map self)
	184	{
	185	struct map map = malloc(sizeof(self));
	186
	187	if (!map)
	188	return NULL;
	189
	190	memcpy(map, self, sizeof(*self));
	191
	192	return map;
	193	}
	194
	195	int map__overlap(struct map l, struct map r)
	196	{
	197	if (l->start > r->start) {
	198	struct map *t = l;
	199	l = r;
	200	r = t;
	201	}
	202
	203	if (l->end > r->start)
	204	return 1;
	205
	206	return 0;
	207	}
	208
	209	size_t map__fprintf(struct map self, FILE fp)
	210	{
9486aa38	211	return fprintf(fp, " %" PRIx64 "-%" PRIx64 " %" PRIx64 " %s\n",
66e274f3 FW	212	self->start, self->end, self->pgoff, self->dso->name);
66e274f3 FW	213	}
7a2b6209 KS	214
	215	/*
	216	* objdump wants/reports absolute IPs for ET_EXEC, and RIPs for ET_DYN.
	217	* map->dso->adjust_symbols==1 for ET_EXEC-like cases.
	218	*/
	219	u64 map__rip_2objdump(struct map *map, u64 rip)
	220	{
	221	u64 addr = map->dso->adjust_symbols ?
	222	map->unmap_ip(map, rip) : /* RIP -> IP */
	223	rip;
	224	return addr;
	225	}
ee11b90b KS	226
	227	u64 map__objdump_2ip(struct map *map, u64 addr)
	228	{
	229	u64 ip = map->dso->adjust_symbols ?
	230	addr :
	231	map->unmap_ip(map, addr); /* RIP -> IP */
	232	return ip;
	233	}
4b8cf846	234
98dfd55d	235	void map_groups__init(struct map_groups *mg)
c6e718ff ACM	236	{
	237	int i;
	238	for (i = 0; i < MAP__NR_TYPES; ++i) {
98dfd55d ACM	239	mg->maps[i] = RB_ROOT;
98dfd55d ACM	240	INIT_LIST_HEAD(&mg->removed_maps[i]);
c6e718ff	241	}
98dfd55d	242	mg->machine = NULL;
c6e718ff ACM	243	}
c6e718ff ACM	244
98dfd55d	245	static void maps__delete(struct rb_root *maps)
591765fd	246	{
98dfd55d	247	struct rb_node *next = rb_first(maps);
591765fd ACM	248
	249	while (next) {
	250	struct map *pos = rb_entry(next, struct map, rb_node);
	251
	252	next = rb_next(&pos->rb_node);
98dfd55d	253	rb_erase(&pos->rb_node, maps);
591765fd ACM	254	map__delete(pos);
	255	}
	256	}
	257
98dfd55d	258	static void maps__delete_removed(struct list_head *maps)
591765fd ACM	259	{
	260	struct map pos, n;
	261
98dfd55d	262	list_for_each_entry_safe(pos, n, maps, node) {
591765fd ACM	263	list_del(&pos->node);
	264	map__delete(pos);
	265	}
	266	}
	267
98dfd55d	268	void map_groups__exit(struct map_groups *mg)
591765fd ACM	269	{
	270	int i;
	271
	272	for (i = 0; i < MAP__NR_TYPES; ++i) {
98dfd55d ACM	273	maps__delete(&mg->maps[i]);
98dfd55d ACM	274	maps__delete_removed(&mg->removed_maps[i]);
591765fd ACM	275	}
	276	}
	277
98dfd55d	278	void map_groups__flush(struct map_groups *mg)
c6e718ff ACM	279	{
	280	int type;
	281
	282	for (type = 0; type < MAP__NR_TYPES; type++) {
98dfd55d	283	struct rb_root *root = &mg->maps[type];
c6e718ff ACM	284	struct rb_node *next = rb_first(root);
	285
	286	while (next) {
	287	struct map *pos = rb_entry(next, struct map, rb_node);
	288	next = rb_next(&pos->rb_node);
	289	rb_erase(&pos->rb_node, root);
	290	/*
	291	* We may have references to this map, for
	292	* instance in some hist_entry instances, so
	293	* just move them to a separate list.
	294	*/
98dfd55d	295	list_add_tail(&pos->node, &mg->removed_maps[pos->type]);
c6e718ff ACM	296	}
	297	}
	298	}
	299
98dfd55d	300	struct symbol map_groups__find_symbol(struct map_groups mg,
4b8cf846	301	enum map_type type, u64 addr,
7e5e1b14	302	struct map **mapp,
4b8cf846 ACM	303	symbol_filter_t filter)
4b8cf846 ACM	304	{
98dfd55d	305	struct map *map = map_groups__find(mg, type, addr);
4b8cf846	306
7e5e1b14 ACM	307	if (map != NULL) {
	308	if (mapp != NULL)
	309	*mapp = map;
4b8cf846	310	return map__find_symbol(map, map->map_ip(map, addr), filter);
7e5e1b14 ACM	311	}
	312
	313	return NULL;
	314	}
	315
98dfd55d	316	struct symbol map_groups__find_symbol_by_name(struct map_groups mg,
7e5e1b14 ACM	317	enum map_type type,
	318	const char *name,
	319	struct map **mapp,
	320	symbol_filter_t filter)
	321	{
	322	struct rb_node *nd;
	323
98dfd55d	324	for (nd = rb_first(&mg->maps[type]); nd; nd = rb_next(nd)) {
7e5e1b14 ACM	325	struct map *pos = rb_entry(nd, struct map, rb_node);
	326	struct symbol *sym = map__find_symbol_by_name(pos, name, filter);
	327
	328	if (sym == NULL)
	329	continue;
	330	if (mapp != NULL)
	331	*mapp = pos;
	332	return sym;
	333	}
4b8cf846 ACM	334
	335	return NULL;
	336	}
	337
98dfd55d	338	size_t __map_groups__fprintf_maps(struct map_groups *mg,
c6e718ff ACM	339	enum map_type type, int verbose, FILE *fp)
	340	{
	341	size_t printed = fprintf(fp, "%s:\n", map_type__name[type]);
	342	struct rb_node *nd;
	343
98dfd55d	344	for (nd = rb_first(&mg->maps[type]); nd; nd = rb_next(nd)) {
c6e718ff ACM	345	struct map *pos = rb_entry(nd, struct map, rb_node);
	346	printed += fprintf(fp, "Map:");
	347	printed += map__fprintf(pos, fp);
	348	if (verbose > 2) {
	349	printed += dso__fprintf(pos->dso, type, fp);
	350	printed += fprintf(fp, "--\n");
	351	}
	352	}
	353
	354	return printed;
	355	}
	356
98dfd55d	357	size_t map_groups__fprintf_maps(struct map_groups mg, int verbose, FILE fp)
c6e718ff ACM	358	{
	359	size_t printed = 0, i;
	360	for (i = 0; i < MAP__NR_TYPES; ++i)
98dfd55d	361	printed += __map_groups__fprintf_maps(mg, i, verbose, fp);
c6e718ff ACM	362	return printed;
	363	}
	364
98dfd55d	365	static size_t __map_groups__fprintf_removed_maps(struct map_groups *mg,
c6e718ff ACM	366	enum map_type type,
	367	int verbose, FILE *fp)
	368	{
	369	struct map *pos;
	370	size_t printed = 0;
	371
98dfd55d	372	list_for_each_entry(pos, &mg->removed_maps[type], node) {
c6e718ff ACM	373	printed += fprintf(fp, "Map:");
	374	printed += map__fprintf(pos, fp);
	375	if (verbose > 1) {
	376	printed += dso__fprintf(pos->dso, type, fp);
	377	printed += fprintf(fp, "--\n");
	378	}
	379	}
	380	return printed;
	381	}
	382
98dfd55d	383	static size_t map_groups__fprintf_removed_maps(struct map_groups *mg,
c6e718ff ACM	384	int verbose, FILE *fp)
	385	{
	386	size_t printed = 0, i;
	387	for (i = 0; i < MAP__NR_TYPES; ++i)
98dfd55d	388	printed += __map_groups__fprintf_removed_maps(mg, i, verbose, fp);
c6e718ff ACM	389	return printed;
	390	}
	391
98dfd55d	392	size_t map_groups__fprintf(struct map_groups mg, int verbose, FILE fp)
c6e718ff	393	{
98dfd55d	394	size_t printed = map_groups__fprintf_maps(mg, verbose, fp);
c6e718ff	395	printed += fprintf(fp, "Removed maps:\n");
98dfd55d	396	return printed + map_groups__fprintf_removed_maps(mg, verbose, fp);
c6e718ff ACM	397	}
c6e718ff ACM	398
98dfd55d	399	int map_groups__fixup_overlappings(struct map_groups mg, struct map map,
c6e718ff ACM	400	int verbose, FILE *fp)
c6e718ff ACM	401	{
98dfd55d	402	struct rb_root *root = &mg->maps[map->type];
c6e718ff	403	struct rb_node *next = rb_first(root);
0a1eae39	404	int err = 0;
c6e718ff ACM	405
	406	while (next) {
	407	struct map *pos = rb_entry(next, struct map, rb_node);
	408	next = rb_next(&pos->rb_node);
	409
	410	if (!map__overlap(pos, map))
	411	continue;
	412
	413	if (verbose >= 2) {
	414	fputs("overlapping maps:\n", fp);
	415	map__fprintf(map, fp);
	416	map__fprintf(pos, fp);
	417	}
	418
	419	rb_erase(&pos->rb_node, root);
c6e718ff ACM	420	/*
	421	* Now check if we need to create new maps for areas not
	422	* overlapped by the new map:
	423	*/
	424	if (map->start > pos->start) {
	425	struct map *before = map__clone(pos);
	426
0a1eae39 ACM	427	if (before == NULL) {
	428	err = -ENOMEM;
	429	goto move_map;
	430	}
c6e718ff ACM	431
c6e718ff ACM	432	before->end = map->start - 1;
98dfd55d	433	map_groups__insert(mg, before);
c6e718ff ACM	434	if (verbose >= 2)
	435	map__fprintf(before, fp);
	436	}
	437
	438	if (map->end < pos->end) {
	439	struct map *after = map__clone(pos);
	440
0a1eae39 ACM	441	if (after == NULL) {
	442	err = -ENOMEM;
	443	goto move_map;
	444	}
c6e718ff ACM	445
c6e718ff ACM	446	after->start = map->end + 1;
98dfd55d	447	map_groups__insert(mg, after);
c6e718ff ACM	448	if (verbose >= 2)
	449	map__fprintf(after, fp);
	450	}
0a1eae39 ACM	451	move_map:
	452	/*
	453	* If we have references, just move them to a separate list.
	454	*/
	455	if (pos->referenced)
98dfd55d	456	list_add_tail(&pos->node, &mg->removed_maps[map->type]);
0a1eae39 ACM	457	else
	458	map__delete(pos);
	459
	460	if (err)
	461	return err;
c6e718ff ACM	462	}
	463
	464	return 0;
	465	}
	466
	467	/*
	468	* XXX This should not really _copy_ te maps, but refcount them.
	469	*/
98dfd55d	470	int map_groups__clone(struct map_groups *mg,
c6e718ff ACM	471	struct map_groups *parent, enum map_type type)
	472	{
	473	struct rb_node *nd;
	474	for (nd = rb_first(&parent->maps[type]); nd; nd = rb_next(nd)) {
	475	struct map *map = rb_entry(nd, struct map, rb_node);
	476	struct map *new = map__clone(map);
	477	if (new == NULL)
	478	return -ENOMEM;
98dfd55d	479	map_groups__insert(mg, new);
c6e718ff ACM	480	}
	481	return 0;
	482	}
	483
4b8cf846 ACM	484	static u64 map__reloc_map_ip(struct map *map, u64 ip)
	485	{
	486	return ip + (s64)map->pgoff;
	487	}
	488
	489	static u64 map__reloc_unmap_ip(struct map *map, u64 ip)
	490	{
	491	return ip - (s64)map->pgoff;
	492	}
	493
	494	void map__reloc_vmlinux(struct map *self)
	495	{
	496	struct kmap *kmap = map__kmap(self);
	497	s64 reloc;
	498
	499	if (!kmap->ref_reloc_sym \|\| !kmap->ref_reloc_sym->unrelocated_addr)
	500	return;
	501
	502	reloc = (kmap->ref_reloc_sym->unrelocated_addr -
	503	kmap->ref_reloc_sym->addr);
	504
	505	if (!reloc)
	506	return;
	507
	508	self->map_ip = map__reloc_map_ip;
	509	self->unmap_ip = map__reloc_unmap_ip;
	510	self->pgoff = reloc;
	511	}
	512
	513	void maps__insert(struct rb_root maps, struct map map)
	514	{
	515	struct rb_node **p = &maps->rb_node;
	516	struct rb_node *parent = NULL;
	517	const u64 ip = map->start;
	518	struct map *m;
	519
	520	while (*p != NULL) {
	521	parent = *p;
	522	m = rb_entry(parent, struct map, rb_node);
	523	if (ip < m->start)
	524	p = &(*p)->rb_left;
	525	else
	526	p = &(*p)->rb_right;
	527	}
	528
	529	rb_link_node(&map->rb_node, parent, p);
	530	rb_insert_color(&map->rb_node, maps);
	531	}
	532
076c6e45 ACM	533	void maps__remove(struct rb_root self, struct map map)
	534	{
	535	rb_erase(&map->rb_node, self);
	536	}
	537
4b8cf846 ACM	538	struct map maps__find(struct rb_root maps, u64 ip)
	539	{
	540	struct rb_node **p = &maps->rb_node;
	541	struct rb_node *parent = NULL;
	542	struct map *m;
	543
	544	while (*p != NULL) {
	545	parent = *p;
	546	m = rb_entry(parent, struct map, rb_node);
	547	if (ip < m->start)
	548	p = &(*p)->rb_left;
	549	else if (ip > m->end)
	550	p = &(*p)->rb_right;
	551	else
	552	return m;
	553	}
	554
	555	return NULL;
	556	}
a1645ce1	557
d28c6223 ACM	558	int machine__init(struct machine self, const char root_dir, pid_t pid)
	559	{
	560	map_groups__init(&self->kmaps);
	561	RB_CLEAR_NODE(&self->rb_node);
	562	INIT_LIST_HEAD(&self->user_dsos);
	563	INIT_LIST_HEAD(&self->kernel_dsos);
	564
b424eba2 ACM	565	self->threads = RB_ROOT;
	566	INIT_LIST_HEAD(&self->dead_threads);
	567	self->last_match = NULL;
	568
d28c6223 ACM	569	self->kmaps.machine = self;
	570	self->pid = pid;
	571	self->root_dir = strdup(root_dir);
	572	return self->root_dir == NULL ? -ENOMEM : 0;
	573	}
	574
d65a458b ACM	575	static void dsos__delete(struct list_head *self)
	576	{
	577	struct dso pos, n;
	578
	579	list_for_each_entry_safe(pos, n, self, node) {
	580	list_del(&pos->node);
	581	dso__delete(pos);
	582	}
	583	}
	584
	585	void machine__exit(struct machine *self)
	586	{
d65a458b ACM	587	map_groups__exit(&self->kmaps);
	588	dsos__delete(&self->user_dsos);
	589	dsos__delete(&self->kernel_dsos);
	590	free(self->root_dir);
	591	self->root_dir = NULL;
	592	}
	593
076c6e45 ACM	594	void machine__delete(struct machine *self)
	595	{
	596	machine__exit(self);
	597	free(self);
	598	}
	599
23346f21 ACM	600	struct machine machines__add(struct rb_root self, pid_t pid,
23346f21 ACM	601	const char *root_dir)
a1645ce1	602	{
23346f21	603	struct rb_node **p = &self->rb_node;
a1645ce1	604	struct rb_node *parent = NULL;
23346f21	605	struct machine pos, machine = malloc(sizeof(*machine));
a1645ce1	606
23346f21	607	if (!machine)
a1645ce1 ZY	608	return NULL;
a1645ce1 ZY	609
d28c6223 ACM	610	if (machine__init(machine, root_dir, pid) != 0) {
	611	free(machine);
	612	return NULL;
	613	}
a1645ce1 ZY	614
	615	while (*p != NULL) {
	616	parent = *p;
23346f21	617	pos = rb_entry(parent, struct machine, rb_node);
a1645ce1 ZY	618	if (pid < pos->pid)
	619	p = &(*p)->rb_left;
	620	else
	621	p = &(*p)->rb_right;
	622	}
	623
23346f21 ACM	624	rb_link_node(&machine->rb_node, parent, p);
23346f21 ACM	625	rb_insert_color(&machine->rb_node, self);
a1645ce1	626
23346f21	627	return machine;
a1645ce1 ZY	628	}
a1645ce1 ZY	629
23346f21	630	struct machine machines__find(struct rb_root self, pid_t pid)
a1645ce1	631	{
23346f21	632	struct rb_node **p = &self->rb_node;
a1645ce1	633	struct rb_node *parent = NULL;
23346f21 ACM	634	struct machine *machine;
23346f21 ACM	635	struct machine *default_machine = NULL;
a1645ce1 ZY	636
	637	while (*p != NULL) {
	638	parent = *p;
23346f21 ACM	639	machine = rb_entry(parent, struct machine, rb_node);
23346f21 ACM	640	if (pid < machine->pid)
a1645ce1	641	p = &(*p)->rb_left;
23346f21	642	else if (pid > machine->pid)
a1645ce1 ZY	643	p = &(*p)->rb_right;
a1645ce1 ZY	644	else
23346f21 ACM	645	return machine;
	646	if (!machine->pid)
	647	default_machine = machine;
a1645ce1 ZY	648	}
a1645ce1 ZY	649
23346f21	650	return default_machine;
a1645ce1 ZY	651	}
a1645ce1 ZY	652
23346f21	653	struct machine machines__findnew(struct rb_root self, pid_t pid)
a1645ce1 ZY	654	{
	655	char path[PATH_MAX];
	656	const char *root_dir;
23346f21	657	struct machine *machine = machines__find(self, pid);
a1645ce1	658
23346f21	659	if (!machine \|\| machine->pid != pid) {
a1645ce1 ZY	660	if (pid == HOST_KERNEL_ID \|\| pid == DEFAULT_GUEST_KERNEL_ID)
	661	root_dir = "";
	662	else {
	663	if (!symbol_conf.guestmount)
	664	goto out;
	665	sprintf(path, "%s/%d", symbol_conf.guestmount, pid);
23346f21	666	if (access(path, R_OK)) {
a1645ce1 ZY	667	pr_err("Can't access file %s\n", path);
	668	goto out;
	669	}
	670	root_dir = path;
	671	}
23346f21	672	machine = machines__add(self, pid, root_dir);
a1645ce1 ZY	673	}
	674
	675	out:
23346f21	676	return machine;
a1645ce1 ZY	677	}
a1645ce1 ZY	678
23346f21	679	void machines__process(struct rb_root self, machine__process_t process, void data)
a1645ce1 ZY	680	{
	681	struct rb_node *nd;
	682
23346f21 ACM	683	for (nd = rb_first(self); nd; nd = rb_next(nd)) {
23346f21 ACM	684	struct machine *pos = rb_entry(nd, struct machine, rb_node);
a1645ce1 ZY	685	process(pos, data);
	686	}
	687	}
	688
48ea8f54	689	char machine__mmap_name(struct machine self, char *bf, size_t size)
a1645ce1	690	{
23346f21	691	if (machine__is_host(self))
48ea8f54	692	snprintf(bf, size, "[%s]", "kernel.kallsyms");
23346f21	693	else if (machine__is_default_guest(self))
48ea8f54	694	snprintf(bf, size, "[%s]", "guest.kernel.kallsyms");
a1645ce1	695	else
48ea8f54	696	snprintf(bf, size, "[%s.%d]", "guest.kernel.kallsyms", self->pid);
a1645ce1	697
48ea8f54	698	return bf;
a1645ce1	699	}