17 #include <linux/string.h>
19 const char *map_type__name[MAP__NR_TYPES] = {
20 [MAP__FUNCTION] = "Functions",
21 [MAP__VARIABLE] = "Variables",
24 static inline int is_anon_memory(const char *filename)
26 return !strcmp(filename, "//anon") ||
27 !strcmp(filename, "/dev/zero (deleted)") ||
28 !strcmp(filename, "/anon_hugepage (deleted)");
31 static inline int is_no_dso_memory(const char *filename)
33 return !strncmp(filename, "[stack", 6) ||
34 !strncmp(filename, "/SYSV",5) ||
35 !strcmp(filename, "[heap]");
38 static inline int is_android_lib(const char *filename)
40 return !strncmp(filename, "/data/app-lib", 13) ||
41 !strncmp(filename, "/system/lib", 11);
44 static inline bool replace_android_lib(const char *filename, char *newfilename)
48 size_t app_abi_length, new_length;
49 size_t lib_length = 0;
51 libname = strrchr(filename, '/');
53 lib_length = strlen(libname);
55 app_abi = getenv("APP_ABI");
59 app_abi_length = strlen(app_abi);
61 if (!strncmp(filename, "/data/app-lib", 13)) {
67 new_length = 7 + app_abi_length + lib_length;
69 apk_path = getenv("APK_PATH");
71 new_length += strlen(apk_path) + 1;
72 if (new_length > PATH_MAX)
74 snprintf(newfilename, new_length,
75 "%s/libs/%s/%s", apk_path, app_abi, libname);
77 if (new_length > PATH_MAX)
79 snprintf(newfilename, new_length,
80 "libs/%s/%s", app_abi, libname);
85 if (!strncmp(filename, "/system/lib/", 11)) {
91 ndk = getenv("NDK_ROOT");
92 app = getenv("APP_PLATFORM");
97 ndk_length = strlen(ndk);
98 app_length = strlen(app);
100 if (!(ndk_length && app_length && app_abi_length))
103 arch = !strncmp(app_abi, "arm", 3) ? "arm" :
104 !strncmp(app_abi, "mips", 4) ? "mips" :
105 !strncmp(app_abi, "x86", 3) ? "x86" : NULL;
110 new_length = 27 + ndk_length +
111 app_length + lib_length
114 if (new_length > PATH_MAX)
116 snprintf(newfilename, new_length,
117 "%s/platforms/%s/arch-%s/usr/lib/%s",
118 ndk, app, arch, libname);
125 void map__init(struct map *map, enum map_type type,
126 u64 start, u64 end, u64 pgoff, struct dso *dso)
134 map->map_ip = map__map_ip;
135 map->unmap_ip = map__unmap_ip;
136 RB_CLEAR_NODE(&map->rb_node);
138 map->referenced = false;
139 map->erange_warned = false;
142 struct map *map__new(struct machine *machine, u64 start, u64 len,
143 u64 pgoff, u32 pid, u32 d_maj, u32 d_min, u64 ino,
144 u64 ino_gen, u32 prot, u32 flags, char *filename,
145 enum map_type type, struct thread *thread)
147 struct map *map = malloc(sizeof(*map));
150 char newfilename[PATH_MAX];
152 int anon, no_dso, vdso, android;
154 android = is_android_lib(filename);
155 anon = is_anon_memory(filename);
156 vdso = is_vdso_map(filename);
157 no_dso = is_no_dso_memory(filename);
162 map->ino_generation = ino_gen;
166 if ((anon || no_dso) && type == MAP__FUNCTION) {
167 snprintf(newfilename, sizeof(newfilename), "/tmp/perf-%d.map", pid);
168 filename = newfilename;
172 if (replace_android_lib(filename, newfilename))
173 filename = newfilename;
178 dso = vdso__dso_findnew(machine, thread);
180 dso = __dsos__findnew(&machine->user_dsos, filename);
185 map__init(map, type, start, start + len, pgoff, dso);
187 if (anon || no_dso) {
188 map->map_ip = map->unmap_ip = identity__map_ip;
191 * Set memory without DSO as loaded. All map__find_*
192 * functions still return NULL, and we avoid the
193 * unnecessary map__load warning.
195 if (type != MAP__FUNCTION)
196 dso__set_loaded(dso, map->type);
206 * Constructor variant for modules (where we know from /proc/modules where
207 * they are loaded) and for vmlinux, where only after we load all the
208 * symbols we'll know where it starts and ends.
210 struct map *map__new2(u64 start, struct dso *dso, enum map_type type)
212 struct map *map = calloc(1, (sizeof(*map) +
213 (dso->kernel ? sizeof(struct kmap) : 0)));
216 * ->end will be filled after we load all the symbols
218 map__init(map, type, start, 0, 0, dso);
224 void map__delete(struct map *map)
229 void map__fixup_start(struct map *map)
231 struct rb_root *symbols = &map->dso->symbols[map->type];
232 struct rb_node *nd = rb_first(symbols);
234 struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
235 map->start = sym->start;
239 void map__fixup_end(struct map *map)
241 struct rb_root *symbols = &map->dso->symbols[map->type];
242 struct rb_node *nd = rb_last(symbols);
244 struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
249 #define DSO__DELETED "(deleted)"
251 int map__load(struct map *map, symbol_filter_t filter)
253 const char *name = map->dso->long_name;
256 if (dso__loaded(map->dso, map->type))
259 nr = dso__load(map->dso, map, filter);
261 if (map->dso->has_build_id) {
262 char sbuild_id[BUILD_ID_SIZE * 2 + 1];
264 build_id__sprintf(map->dso->build_id,
265 sizeof(map->dso->build_id),
267 pr_warning("%s with build id %s not found",
270 pr_warning("Failed to open %s", name);
272 pr_warning(", continuing without symbols\n");
274 } else if (nr == 0) {
275 #ifdef HAVE_LIBELF_SUPPORT
276 const size_t len = strlen(name);
277 const size_t real_len = len - sizeof(DSO__DELETED);
279 if (len > sizeof(DSO__DELETED) &&
280 strcmp(name + real_len + 1, DSO__DELETED) == 0) {
281 pr_warning("%.*s was updated (is prelink enabled?). "
282 "Restart the long running apps that use it!\n",
283 (int)real_len, name);
285 pr_warning("no symbols found in %s, maybe install "
286 "a debug package?\n", name);
295 int __weak arch__compare_symbol_names(const char *namea, const char *nameb)
297 return strcmp(namea, nameb);
300 struct symbol *map__find_symbol(struct map *map, u64 addr,
301 symbol_filter_t filter)
303 if (map__load(map, filter) < 0)
306 return dso__find_symbol(map->dso, map->type, addr);
309 struct symbol *map__find_symbol_by_name(struct map *map, const char *name,
310 symbol_filter_t filter)
312 if (map__load(map, filter) < 0)
315 if (!dso__sorted_by_name(map->dso, map->type))
316 dso__sort_by_name(map->dso, map->type);
318 return dso__find_symbol_by_name(map->dso, map->type, name);
321 struct map *map__clone(struct map *map)
323 return memdup(map, sizeof(*map));
326 int map__overlap(struct map *l, struct map *r)
328 if (l->start > r->start) {
334 if (l->end > r->start)
340 size_t map__fprintf(struct map *map, FILE *fp)
342 return fprintf(fp, " %" PRIx64 "-%" PRIx64 " %" PRIx64 " %s\n",
343 map->start, map->end, map->pgoff, map->dso->name);
346 size_t map__fprintf_dsoname(struct map *map, FILE *fp)
348 const char *dsoname = "[unknown]";
350 if (map && map->dso && (map->dso->name || map->dso->long_name)) {
351 if (symbol_conf.show_kernel_path && map->dso->long_name)
352 dsoname = map->dso->long_name;
353 else if (map->dso->name)
354 dsoname = map->dso->name;
357 return fprintf(fp, "%s", dsoname);
360 int map__fprintf_srcline(struct map *map, u64 addr, const char *prefix,
366 if (map && map->dso) {
367 srcline = get_srcline(map->dso,
368 map__rip_2objdump(map, addr), NULL, true);
369 if (srcline != SRCLINE_UNKNOWN)
370 ret = fprintf(fp, "%s%s", prefix, srcline);
371 free_srcline(srcline);
377 * map__rip_2objdump - convert symbol start address to objdump address.
379 * @rip: symbol start address
381 * objdump wants/reports absolute IPs for ET_EXEC, and RIPs for ET_DYN.
382 * map->dso->adjust_symbols==1 for ET_EXEC-like cases except ET_REL which is
383 * relative to section start.
385 * Return: Address suitable for passing to "objdump --start-address="
387 u64 map__rip_2objdump(struct map *map, u64 rip)
389 if (!map->dso->adjust_symbols)
393 return rip - map->pgoff;
395 return map->unmap_ip(map, rip) - map->reloc;
399 * map__objdump_2mem - convert objdump address to a memory address.
401 * @ip: objdump address
403 * Closely related to map__rip_2objdump(), this function takes an address from
404 * objdump and converts it to a memory address. Note this assumes that @map
405 * contains the address. To be sure the result is valid, check it forwards
406 * e.g. map__rip_2objdump(map->map_ip(map, map__objdump_2mem(map, ip))) == ip
408 * Return: Memory address.
410 u64 map__objdump_2mem(struct map *map, u64 ip)
412 if (!map->dso->adjust_symbols)
413 return map->unmap_ip(map, ip);
416 return map->unmap_ip(map, ip + map->pgoff);
418 return ip + map->reloc;
421 void map_groups__init(struct map_groups *mg, struct machine *machine)
424 for (i = 0; i < MAP__NR_TYPES; ++i) {
425 mg->maps[i] = RB_ROOT;
426 INIT_LIST_HEAD(&mg->removed_maps[i]);
428 mg->machine = machine;
429 atomic_set(&mg->refcnt, 1);
432 static void maps__delete(struct rb_root *maps)
434 struct rb_node *next = rb_first(maps);
437 struct map *pos = rb_entry(next, struct map, rb_node);
439 next = rb_next(&pos->rb_node);
440 rb_erase(&pos->rb_node, maps);
445 static void maps__delete_removed(struct list_head *maps)
449 list_for_each_entry_safe(pos, n, maps, node) {
450 list_del(&pos->node);
455 void map_groups__exit(struct map_groups *mg)
459 for (i = 0; i < MAP__NR_TYPES; ++i) {
460 maps__delete(&mg->maps[i]);
461 maps__delete_removed(&mg->removed_maps[i]);
465 bool map_groups__empty(struct map_groups *mg)
469 for (i = 0; i < MAP__NR_TYPES; ++i) {
470 if (maps__first(&mg->maps[i]))
472 if (!list_empty(&mg->removed_maps[i]))
479 struct map_groups *map_groups__new(struct machine *machine)
481 struct map_groups *mg = malloc(sizeof(*mg));
484 map_groups__init(mg, machine);
489 void map_groups__delete(struct map_groups *mg)
491 map_groups__exit(mg);
495 void map_groups__put(struct map_groups *mg)
497 if (mg && atomic_dec_and_test(&mg->refcnt))
498 map_groups__delete(mg);
501 void map_groups__flush(struct map_groups *mg)
505 for (type = 0; type < MAP__NR_TYPES; type++) {
506 struct rb_root *root = &mg->maps[type];
507 struct rb_node *next = rb_first(root);
510 struct map *pos = rb_entry(next, struct map, rb_node);
511 next = rb_next(&pos->rb_node);
512 rb_erase(&pos->rb_node, root);
514 * We may have references to this map, for
515 * instance in some hist_entry instances, so
516 * just move them to a separate list.
518 list_add_tail(&pos->node, &mg->removed_maps[pos->type]);
523 struct symbol *map_groups__find_symbol(struct map_groups *mg,
524 enum map_type type, u64 addr,
526 symbol_filter_t filter)
528 struct map *map = map_groups__find(mg, type, addr);
530 /* Ensure map is loaded before using map->map_ip */
531 if (map != NULL && map__load(map, filter) >= 0) {
534 return map__find_symbol(map, map->map_ip(map, addr), filter);
540 struct symbol *map_groups__find_symbol_by_name(struct map_groups *mg,
544 symbol_filter_t filter)
548 for (nd = rb_first(&mg->maps[type]); nd; nd = rb_next(nd)) {
549 struct map *pos = rb_entry(nd, struct map, rb_node);
550 struct symbol *sym = map__find_symbol_by_name(pos, name, filter);
562 int map_groups__find_ams(struct addr_map_symbol *ams, symbol_filter_t filter)
564 if (ams->addr < ams->map->start || ams->addr >= ams->map->end) {
565 if (ams->map->groups == NULL)
567 ams->map = map_groups__find(ams->map->groups, ams->map->type,
569 if (ams->map == NULL)
573 ams->al_addr = ams->map->map_ip(ams->map, ams->addr);
574 ams->sym = map__find_symbol(ams->map, ams->al_addr, filter);
576 return ams->sym ? 0 : -1;
579 size_t __map_groups__fprintf_maps(struct map_groups *mg, enum map_type type,
582 size_t printed = fprintf(fp, "%s:\n", map_type__name[type]);
585 for (nd = rb_first(&mg->maps[type]); nd; nd = rb_next(nd)) {
586 struct map *pos = rb_entry(nd, struct map, rb_node);
587 printed += fprintf(fp, "Map:");
588 printed += map__fprintf(pos, fp);
590 printed += dso__fprintf(pos->dso, type, fp);
591 printed += fprintf(fp, "--\n");
598 static size_t map_groups__fprintf_maps(struct map_groups *mg, FILE *fp)
600 size_t printed = 0, i;
601 for (i = 0; i < MAP__NR_TYPES; ++i)
602 printed += __map_groups__fprintf_maps(mg, i, fp);
606 static size_t __map_groups__fprintf_removed_maps(struct map_groups *mg,
607 enum map_type type, FILE *fp)
612 list_for_each_entry(pos, &mg->removed_maps[type], node) {
613 printed += fprintf(fp, "Map:");
614 printed += map__fprintf(pos, fp);
616 printed += dso__fprintf(pos->dso, type, fp);
617 printed += fprintf(fp, "--\n");
623 static size_t map_groups__fprintf_removed_maps(struct map_groups *mg,
626 size_t printed = 0, i;
627 for (i = 0; i < MAP__NR_TYPES; ++i)
628 printed += __map_groups__fprintf_removed_maps(mg, i, fp);
632 size_t map_groups__fprintf(struct map_groups *mg, FILE *fp)
634 size_t printed = map_groups__fprintf_maps(mg, fp);
635 printed += fprintf(fp, "Removed maps:\n");
636 return printed + map_groups__fprintf_removed_maps(mg, fp);
639 int map_groups__fixup_overlappings(struct map_groups *mg, struct map *map,
642 struct rb_root *root = &mg->maps[map->type];
643 struct rb_node *next = rb_first(root);
647 struct map *pos = rb_entry(next, struct map, rb_node);
648 next = rb_next(&pos->rb_node);
650 if (!map__overlap(pos, map))
654 fputs("overlapping maps:\n", fp);
655 map__fprintf(map, fp);
656 map__fprintf(pos, fp);
659 rb_erase(&pos->rb_node, root);
661 * Now check if we need to create new maps for areas not
662 * overlapped by the new map:
664 if (map->start > pos->start) {
665 struct map *before = map__clone(pos);
667 if (before == NULL) {
672 before->end = map->start;
673 map_groups__insert(mg, before);
675 map__fprintf(before, fp);
678 if (map->end < pos->end) {
679 struct map *after = map__clone(pos);
686 after->start = map->end;
687 map_groups__insert(mg, after);
689 map__fprintf(after, fp);
693 * If we have references, just move them to a separate list.
696 list_add_tail(&pos->node, &mg->removed_maps[map->type]);
708 * XXX This should not really _copy_ te maps, but refcount them.
710 int map_groups__clone(struct map_groups *mg,
711 struct map_groups *parent, enum map_type type)
714 for (nd = rb_first(&parent->maps[type]); nd; nd = rb_next(nd)) {
715 struct map *map = rb_entry(nd, struct map, rb_node);
716 struct map *new = map__clone(map);
719 map_groups__insert(mg, new);
724 void maps__insert(struct rb_root *maps, struct map *map)
726 struct rb_node **p = &maps->rb_node;
727 struct rb_node *parent = NULL;
728 const u64 ip = map->start;
733 m = rb_entry(parent, struct map, rb_node);
740 rb_link_node(&map->rb_node, parent, p);
741 rb_insert_color(&map->rb_node, maps);
744 void maps__remove(struct rb_root *maps, struct map *map)
746 rb_erase(&map->rb_node, maps);
749 struct map *maps__find(struct rb_root *maps, u64 ip)
751 struct rb_node **p = &maps->rb_node;
752 struct rb_node *parent = NULL;
757 m = rb_entry(parent, struct map, rb_node);
760 else if (ip >= m->end)
769 struct map *maps__first(struct rb_root *maps)
771 struct rb_node *first = rb_first(maps);
774 return rb_entry(first, struct map, rb_node);
778 struct map *maps__next(struct map *map)
780 struct rb_node *next = rb_next(&map->rb_node);
783 return rb_entry(next, struct map, rb_node);
787 struct kmap *map__kmap(struct map *map)
789 if (!map->dso || !map->dso->kernel) {
790 pr_err("Internal error: map__kmap with a non-kernel map\n");
793 return (struct kmap *)(map + 1);
796 struct map_groups *map__kmaps(struct map *map)
798 struct kmap *kmap = map__kmap(map);
800 if (!kmap || !kmap->kmaps) {
801 pr_err("Internal error: map__kmaps with a non-kernel map\n");