15 #include <linux/string.h>
17 const char *map_type__name[MAP__NR_TYPES] = {
18 [MAP__FUNCTION] = "Functions",
19 [MAP__VARIABLE] = "Variables",
22 static inline int is_anon_memory(const char *filename)
24 return !strcmp(filename, "//anon") ||
25 !strcmp(filename, "/dev/zero (deleted)") ||
26 !strcmp(filename, "/anon_hugepage (deleted)");
29 static inline int is_no_dso_memory(const char *filename)
31 return !strncmp(filename, "[stack", 6) ||
32 !strcmp(filename, "[heap]");
35 void map__init(struct map *map, enum map_type type,
36 u64 start, u64 end, u64 pgoff, struct dso *dso)
44 map->map_ip = map__map_ip;
45 map->unmap_ip = map__unmap_ip;
46 RB_CLEAR_NODE(&map->rb_node);
48 map->referenced = false;
49 map->erange_warned = false;
52 struct map *map__new(struct list_head *dsos__list, u64 start, u64 len,
53 u64 pgoff, u32 pid, u32 d_maj, u32 d_min, u64 ino,
54 u64 ino_gen, char *filename,
57 struct map *map = malloc(sizeof(*map));
60 char newfilename[PATH_MAX];
62 int anon, no_dso, vdso;
64 anon = is_anon_memory(filename);
65 vdso = is_vdso_map(filename);
66 no_dso = is_no_dso_memory(filename);
71 map->ino_generation = ino_gen;
73 if ((anon || no_dso) && type == MAP__FUNCTION) {
74 snprintf(newfilename, sizeof(newfilename), "/tmp/perf-%d.map", pid);
75 filename = newfilename;
80 dso = vdso__dso_findnew(dsos__list);
82 dso = __dsos__findnew(dsos__list, filename);
87 map__init(map, type, start, start + len, pgoff, dso);
90 map->map_ip = map->unmap_ip = identity__map_ip;
93 * Set memory without DSO as loaded. All map__find_*
94 * functions still return NULL, and we avoid the
95 * unnecessary map__load warning.
97 if (type != MAP__FUNCTION)
98 dso__set_loaded(dso, map->type);
108 * Constructor variant for modules (where we know from /proc/modules where
109 * they are loaded) and for vmlinux, where only after we load all the
110 * symbols we'll know where it starts and ends.
112 struct map *map__new2(u64 start, struct dso *dso, enum map_type type)
114 struct map *map = calloc(1, (sizeof(*map) +
115 (dso->kernel ? sizeof(struct kmap) : 0)));
118 * ->end will be filled after we load all the symbols
120 map__init(map, type, start, 0, 0, dso);
126 void map__delete(struct map *map)
131 void map__fixup_start(struct map *map)
133 struct rb_root *symbols = &map->dso->symbols[map->type];
134 struct rb_node *nd = rb_first(symbols);
136 struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
137 map->start = sym->start;
141 void map__fixup_end(struct map *map)
143 struct rb_root *symbols = &map->dso->symbols[map->type];
144 struct rb_node *nd = rb_last(symbols);
146 struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
151 #define DSO__DELETED "(deleted)"
153 int map__load(struct map *map, symbol_filter_t filter)
155 const char *name = map->dso->long_name;
158 if (dso__loaded(map->dso, map->type))
161 nr = dso__load(map->dso, map, filter);
163 if (map->dso->has_build_id) {
164 char sbuild_id[BUILD_ID_SIZE * 2 + 1];
166 build_id__sprintf(map->dso->build_id,
167 sizeof(map->dso->build_id),
169 pr_warning("%s with build id %s not found",
172 pr_warning("Failed to open %s", name);
174 pr_warning(", continuing without symbols\n");
176 } else if (nr == 0) {
177 #ifdef HAVE_LIBELF_SUPPORT
178 const size_t len = strlen(name);
179 const size_t real_len = len - sizeof(DSO__DELETED);
181 if (len > sizeof(DSO__DELETED) &&
182 strcmp(name + real_len + 1, DSO__DELETED) == 0) {
183 pr_warning("%.*s was updated (is prelink enabled?). "
184 "Restart the long running apps that use it!\n",
185 (int)real_len, name);
187 pr_warning("no symbols found in %s, maybe install "
188 "a debug package?\n", name);
197 struct symbol *map__find_symbol(struct map *map, u64 addr,
198 symbol_filter_t filter)
200 if (map__load(map, filter) < 0)
203 return dso__find_symbol(map->dso, map->type, addr);
206 struct symbol *map__find_symbol_by_name(struct map *map, const char *name,
207 symbol_filter_t filter)
209 if (map__load(map, filter) < 0)
212 if (!dso__sorted_by_name(map->dso, map->type))
213 dso__sort_by_name(map->dso, map->type);
215 return dso__find_symbol_by_name(map->dso, map->type, name);
218 struct map *map__clone(struct map *map)
220 return memdup(map, sizeof(*map));
223 int map__overlap(struct map *l, struct map *r)
225 if (l->start > r->start) {
231 if (l->end > r->start)
237 size_t map__fprintf(struct map *map, FILE *fp)
239 return fprintf(fp, " %" PRIx64 "-%" PRIx64 " %" PRIx64 " %s\n",
240 map->start, map->end, map->pgoff, map->dso->name);
243 size_t map__fprintf_dsoname(struct map *map, FILE *fp)
245 const char *dsoname = "[unknown]";
247 if (map && map->dso && (map->dso->name || map->dso->long_name)) {
248 if (symbol_conf.show_kernel_path && map->dso->long_name)
249 dsoname = map->dso->long_name;
250 else if (map->dso->name)
251 dsoname = map->dso->name;
254 return fprintf(fp, "%s", dsoname);
257 int map__fprintf_srcline(struct map *map, u64 addr, const char *prefix,
263 if (map && map->dso) {
264 srcline = get_srcline(map->dso,
265 map__rip_2objdump(map, addr));
266 if (srcline != SRCLINE_UNKNOWN)
267 ret = fprintf(fp, "%s%s", prefix, srcline);
268 free_srcline(srcline);
274 * map__rip_2objdump - convert symbol start address to objdump address.
276 * @rip: symbol start address
278 * objdump wants/reports absolute IPs for ET_EXEC, and RIPs for ET_DYN.
279 * map->dso->adjust_symbols==1 for ET_EXEC-like cases except ET_REL which is
280 * relative to section start.
282 * Return: Address suitable for passing to "objdump --start-address="
284 u64 map__rip_2objdump(struct map *map, u64 rip)
286 if (!map->dso->adjust_symbols)
290 return rip - map->pgoff;
292 return map->unmap_ip(map, rip) - map->reloc;
296 * map__objdump_2mem - convert objdump address to a memory address.
298 * @ip: objdump address
300 * Closely related to map__rip_2objdump(), this function takes an address from
301 * objdump and converts it to a memory address. Note this assumes that @map
302 * contains the address. To be sure the result is valid, check it forwards
303 * e.g. map__rip_2objdump(map->map_ip(map, map__objdump_2mem(map, ip))) == ip
305 * Return: Memory address.
307 u64 map__objdump_2mem(struct map *map, u64 ip)
309 if (!map->dso->adjust_symbols)
310 return map->unmap_ip(map, ip);
313 return map->unmap_ip(map, ip + map->pgoff);
315 return ip + map->reloc;
318 void map_groups__init(struct map_groups *mg)
321 for (i = 0; i < MAP__NR_TYPES; ++i) {
322 mg->maps[i] = RB_ROOT;
323 INIT_LIST_HEAD(&mg->removed_maps[i]);
328 static void maps__delete(struct rb_root *maps)
330 struct rb_node *next = rb_first(maps);
333 struct map *pos = rb_entry(next, struct map, rb_node);
335 next = rb_next(&pos->rb_node);
336 rb_erase(&pos->rb_node, maps);
341 static void maps__delete_removed(struct list_head *maps)
345 list_for_each_entry_safe(pos, n, maps, node) {
346 list_del(&pos->node);
351 void map_groups__exit(struct map_groups *mg)
355 for (i = 0; i < MAP__NR_TYPES; ++i) {
356 maps__delete(&mg->maps[i]);
357 maps__delete_removed(&mg->removed_maps[i]);
361 void map_groups__flush(struct map_groups *mg)
365 for (type = 0; type < MAP__NR_TYPES; type++) {
366 struct rb_root *root = &mg->maps[type];
367 struct rb_node *next = rb_first(root);
370 struct map *pos = rb_entry(next, struct map, rb_node);
371 next = rb_next(&pos->rb_node);
372 rb_erase(&pos->rb_node, root);
374 * We may have references to this map, for
375 * instance in some hist_entry instances, so
376 * just move them to a separate list.
378 list_add_tail(&pos->node, &mg->removed_maps[pos->type]);
383 struct symbol *map_groups__find_symbol(struct map_groups *mg,
384 enum map_type type, u64 addr,
386 symbol_filter_t filter)
388 struct map *map = map_groups__find(mg, type, addr);
390 /* Ensure map is loaded before using map->map_ip */
391 if (map != NULL && map__load(map, filter) >= 0) {
394 return map__find_symbol(map, map->map_ip(map, addr), filter);
400 struct symbol *map_groups__find_symbol_by_name(struct map_groups *mg,
404 symbol_filter_t filter)
408 for (nd = rb_first(&mg->maps[type]); nd; nd = rb_next(nd)) {
409 struct map *pos = rb_entry(nd, struct map, rb_node);
410 struct symbol *sym = map__find_symbol_by_name(pos, name, filter);
422 int map_groups__find_ams(struct addr_map_symbol *ams, symbol_filter_t filter)
424 if (ams->addr < ams->map->start || ams->addr > ams->map->end) {
425 if (ams->map->groups == NULL)
427 ams->map = map_groups__find(ams->map->groups, ams->map->type,
429 if (ams->map == NULL)
433 ams->al_addr = ams->map->map_ip(ams->map, ams->addr);
434 ams->sym = map__find_symbol(ams->map, ams->al_addr, filter);
436 return ams->sym ? 0 : -1;
439 size_t __map_groups__fprintf_maps(struct map_groups *mg,
440 enum map_type type, int verbose, FILE *fp)
442 size_t printed = fprintf(fp, "%s:\n", map_type__name[type]);
445 for (nd = rb_first(&mg->maps[type]); nd; nd = rb_next(nd)) {
446 struct map *pos = rb_entry(nd, struct map, rb_node);
447 printed += fprintf(fp, "Map:");
448 printed += map__fprintf(pos, fp);
450 printed += dso__fprintf(pos->dso, type, fp);
451 printed += fprintf(fp, "--\n");
458 size_t map_groups__fprintf_maps(struct map_groups *mg, int verbose, FILE *fp)
460 size_t printed = 0, i;
461 for (i = 0; i < MAP__NR_TYPES; ++i)
462 printed += __map_groups__fprintf_maps(mg, i, verbose, fp);
466 static size_t __map_groups__fprintf_removed_maps(struct map_groups *mg,
468 int verbose, FILE *fp)
473 list_for_each_entry(pos, &mg->removed_maps[type], node) {
474 printed += fprintf(fp, "Map:");
475 printed += map__fprintf(pos, fp);
477 printed += dso__fprintf(pos->dso, type, fp);
478 printed += fprintf(fp, "--\n");
484 static size_t map_groups__fprintf_removed_maps(struct map_groups *mg,
485 int verbose, FILE *fp)
487 size_t printed = 0, i;
488 for (i = 0; i < MAP__NR_TYPES; ++i)
489 printed += __map_groups__fprintf_removed_maps(mg, i, verbose, fp);
493 size_t map_groups__fprintf(struct map_groups *mg, int verbose, FILE *fp)
495 size_t printed = map_groups__fprintf_maps(mg, verbose, fp);
496 printed += fprintf(fp, "Removed maps:\n");
497 return printed + map_groups__fprintf_removed_maps(mg, verbose, fp);
500 int map_groups__fixup_overlappings(struct map_groups *mg, struct map *map,
501 int verbose, FILE *fp)
503 struct rb_root *root = &mg->maps[map->type];
504 struct rb_node *next = rb_first(root);
508 struct map *pos = rb_entry(next, struct map, rb_node);
509 next = rb_next(&pos->rb_node);
511 if (!map__overlap(pos, map))
515 fputs("overlapping maps:\n", fp);
516 map__fprintf(map, fp);
517 map__fprintf(pos, fp);
520 rb_erase(&pos->rb_node, root);
522 * Now check if we need to create new maps for areas not
523 * overlapped by the new map:
525 if (map->start > pos->start) {
526 struct map *before = map__clone(pos);
528 if (before == NULL) {
533 before->end = map->start - 1;
534 map_groups__insert(mg, before);
536 map__fprintf(before, fp);
539 if (map->end < pos->end) {
540 struct map *after = map__clone(pos);
547 after->start = map->end + 1;
548 map_groups__insert(mg, after);
550 map__fprintf(after, fp);
554 * If we have references, just move them to a separate list.
557 list_add_tail(&pos->node, &mg->removed_maps[map->type]);
569 * XXX This should not really _copy_ te maps, but refcount them.
571 int map_groups__clone(struct map_groups *mg,
572 struct map_groups *parent, enum map_type type)
575 for (nd = rb_first(&parent->maps[type]); nd; nd = rb_next(nd)) {
576 struct map *map = rb_entry(nd, struct map, rb_node);
577 struct map *new = map__clone(map);
580 map_groups__insert(mg, new);
585 void maps__insert(struct rb_root *maps, struct map *map)
587 struct rb_node **p = &maps->rb_node;
588 struct rb_node *parent = NULL;
589 const u64 ip = map->start;
594 m = rb_entry(parent, struct map, rb_node);
601 rb_link_node(&map->rb_node, parent, p);
602 rb_insert_color(&map->rb_node, maps);
605 void maps__remove(struct rb_root *maps, struct map *map)
607 rb_erase(&map->rb_node, maps);
610 struct map *maps__find(struct rb_root *maps, u64 ip)
612 struct rb_node **p = &maps->rb_node;
613 struct rb_node *parent = NULL;
618 m = rb_entry(parent, struct map, rb_node);
621 else if (ip > m->end)
630 struct map *maps__first(struct rb_root *maps)
632 struct rb_node *first = rb_first(maps);
635 return rb_entry(first, struct map, rb_node);
639 struct map *maps__next(struct map *map)
641 struct rb_node *next = rb_next(&map->rb_node);
644 return rb_entry(next, struct map, rb_node);