1 // SPDX-License-Identifier: GPL-2.0
10 #include <uapi/linux/mman.h> /* To get things like MAP_HUGETLB even on older libc headers */
17 #include <linux/string.h>
18 #include <linux/zalloc.h>
20 #include "namespaces.h"
24 static void __maps__insert(struct maps *maps, struct map *map);
25 static void __maps__insert_name(struct maps *maps, struct map *map);
27 static inline int is_anon_memory(const char *filename, u32 flags)
29 return flags & MAP_HUGETLB ||
30 !strcmp(filename, "//anon") ||
31 !strncmp(filename, "/dev/zero", sizeof("/dev/zero") - 1) ||
32 !strncmp(filename, "/anon_hugepage", sizeof("/anon_hugepage") - 1);
35 static inline int is_no_dso_memory(const char *filename)
37 return !strncmp(filename, "[stack", 6) ||
38 !strncmp(filename, "/SYSV",5) ||
39 !strcmp(filename, "[heap]");
42 static inline int is_android_lib(const char *filename)
44 return !strncmp(filename, "/data/app-lib", 13) ||
45 !strncmp(filename, "/system/lib", 11);
48 static inline bool replace_android_lib(const char *filename, char *newfilename)
52 size_t app_abi_length, new_length;
53 size_t lib_length = 0;
55 libname = strrchr(filename, '/');
57 lib_length = strlen(libname);
59 app_abi = getenv("APP_ABI");
63 app_abi_length = strlen(app_abi);
65 if (!strncmp(filename, "/data/app-lib", 13)) {
71 new_length = 7 + app_abi_length + lib_length;
73 apk_path = getenv("APK_PATH");
75 new_length += strlen(apk_path) + 1;
76 if (new_length > PATH_MAX)
78 snprintf(newfilename, new_length,
79 "%s/libs/%s/%s", apk_path, app_abi, libname);
81 if (new_length > PATH_MAX)
83 snprintf(newfilename, new_length,
84 "libs/%s/%s", app_abi, libname);
89 if (!strncmp(filename, "/system/lib/", 11)) {
95 ndk = getenv("NDK_ROOT");
96 app = getenv("APP_PLATFORM");
101 ndk_length = strlen(ndk);
102 app_length = strlen(app);
104 if (!(ndk_length && app_length && app_abi_length))
107 arch = !strncmp(app_abi, "arm", 3) ? "arm" :
108 !strncmp(app_abi, "mips", 4) ? "mips" :
109 !strncmp(app_abi, "x86", 3) ? "x86" : NULL;
114 new_length = 27 + ndk_length +
115 app_length + lib_length
118 if (new_length > PATH_MAX)
120 snprintf(newfilename, new_length,
121 "%s/platforms/%s/arch-%s/usr/lib/%s",
122 ndk, app, arch, libname);
129 void map__init(struct map *map, u64 start, u64 end, u64 pgoff, struct dso *dso)
135 map->dso = dso__get(dso);
136 map->map_ip = map__map_ip;
137 map->unmap_ip = map__unmap_ip;
138 RB_CLEAR_NODE(&map->rb_node);
140 map->erange_warned = false;
141 refcount_set(&map->refcnt, 1);
144 struct map *map__new(struct machine *machine, u64 start, u64 len,
145 u64 pgoff, u32 d_maj, u32 d_min, u64 ino,
146 u64 ino_gen, u32 prot, u32 flags, char *filename,
147 struct thread *thread)
149 struct map *map = malloc(sizeof(*map));
150 struct nsinfo *nsi = NULL;
154 char newfilename[PATH_MAX];
156 int anon, no_dso, vdso, android;
158 android = is_android_lib(filename);
159 anon = is_anon_memory(filename, flags);
160 vdso = is_vdso_map(filename);
161 no_dso = is_no_dso_memory(filename);
166 map->ino_generation = ino_gen;
169 nsi = nsinfo__get(thread->nsinfo);
171 if ((anon || no_dso) && nsi && (prot & PROT_EXEC)) {
172 snprintf(newfilename, sizeof(newfilename),
173 "/tmp/perf-%d.map", nsi->pid);
174 filename = newfilename;
178 if (replace_android_lib(filename, newfilename))
179 filename = newfilename;
183 /* The vdso maps are always on the host and not the
184 * container. Ensure that we don't use setns to look
187 nnsi = nsinfo__copy(nsi);
190 nnsi->need_setns = false;
194 dso = machine__findnew_vdso(machine, thread);
196 dso = machine__findnew_dso(machine, filename);
201 map__init(map, start, start + len, pgoff, dso);
203 if (anon || no_dso) {
204 map->map_ip = map->unmap_ip = identity__map_ip;
207 * Set memory without DSO as loaded. All map__find_*
208 * functions still return NULL, and we avoid the
209 * unnecessary map__load warning.
211 if (!(prot & PROT_EXEC))
212 dso__set_loaded(dso);
225 * Constructor variant for modules (where we know from /proc/modules where
226 * they are loaded) and for vmlinux, where only after we load all the
227 * symbols we'll know where it starts and ends.
229 struct map *map__new2(u64 start, struct dso *dso)
231 struct map *map = calloc(1, (sizeof(*map) +
232 (dso->kernel ? sizeof(struct kmap) : 0)));
235 * ->end will be filled after we load all the symbols
237 map__init(map, start, 0, 0, dso);
244 * Use this and __map__is_kmodule() for map instances that are in
245 * machine->kmaps, and thus have map->groups->machine all properly set, to
246 * disambiguate between the kernel and modules.
248 * When the need arises, introduce map__is_{kernel,kmodule)() that
249 * checks (map->groups != NULL && map->groups->machine != NULL &&
250 * map->dso->kernel) before calling __map__is_{kernel,kmodule}())
252 bool __map__is_kernel(const struct map *map)
254 return machine__kernel_map(map->groups->machine) == map;
257 bool __map__is_extra_kernel_map(const struct map *map)
259 struct kmap *kmap = __map__kmap((struct map *)map);
261 return kmap && kmap->name[0];
264 bool __map__is_bpf_prog(const struct map *map)
268 if (map->dso->binary_type == DSO_BINARY_TYPE__BPF_PROG_INFO)
272 * If PERF_RECORD_BPF_EVENT is not included, the dso will not have
273 * type of DSO_BINARY_TYPE__BPF_PROG_INFO. In such cases, we can
274 * guess the type based on name.
276 name = map->dso->short_name;
277 return name && (strstr(name, "bpf_prog_") == name);
280 bool map__has_symbols(const struct map *map)
282 return dso__has_symbols(map->dso);
285 static void map__exit(struct map *map)
287 BUG_ON(!RB_EMPTY_NODE(&map->rb_node));
291 void map__delete(struct map *map)
297 void map__put(struct map *map)
299 if (map && refcount_dec_and_test(&map->refcnt))
303 void map__fixup_start(struct map *map)
305 struct rb_root_cached *symbols = &map->dso->symbols;
306 struct rb_node *nd = rb_first_cached(symbols);
308 struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
309 map->start = sym->start;
313 void map__fixup_end(struct map *map)
315 struct rb_root_cached *symbols = &map->dso->symbols;
316 struct rb_node *nd = rb_last(&symbols->rb_root);
318 struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
323 #define DSO__DELETED "(deleted)"
325 int map__load(struct map *map)
327 const char *name = map->dso->long_name;
330 if (dso__loaded(map->dso))
333 nr = dso__load(map->dso, map);
335 if (map->dso->has_build_id) {
336 char sbuild_id[SBUILD_ID_SIZE];
338 build_id__sprintf(map->dso->build_id,
339 sizeof(map->dso->build_id),
341 pr_debug("%s with build id %s not found", name, sbuild_id);
343 pr_debug("Failed to open %s", name);
345 pr_debug(", continuing without symbols\n");
347 } else if (nr == 0) {
348 #ifdef HAVE_LIBELF_SUPPORT
349 const size_t len = strlen(name);
350 const size_t real_len = len - sizeof(DSO__DELETED);
352 if (len > sizeof(DSO__DELETED) &&
353 strcmp(name + real_len + 1, DSO__DELETED) == 0) {
354 pr_debug("%.*s was updated (is prelink enabled?). "
355 "Restart the long running apps that use it!\n",
356 (int)real_len, name);
358 pr_debug("no symbols found in %s, maybe install a debug package?\n", name);
367 struct symbol *map__find_symbol(struct map *map, u64 addr)
369 if (map__load(map) < 0)
372 return dso__find_symbol(map->dso, addr);
375 struct symbol *map__find_symbol_by_name(struct map *map, const char *name)
377 if (map__load(map) < 0)
380 if (!dso__sorted_by_name(map->dso))
381 dso__sort_by_name(map->dso);
383 return dso__find_symbol_by_name(map->dso, name);
386 struct map *map__clone(struct map *from)
388 struct map *map = memdup(from, sizeof(*map));
391 refcount_set(&map->refcnt, 1);
392 RB_CLEAR_NODE(&map->rb_node);
400 size_t map__fprintf(struct map *map, FILE *fp)
402 return fprintf(fp, " %" PRIx64 "-%" PRIx64 " %" PRIx64 " %s\n",
403 map->start, map->end, map->pgoff, map->dso->name);
406 size_t map__fprintf_dsoname(struct map *map, FILE *fp)
408 char buf[symbol_conf.pad_output_len_dso + 1];
409 const char *dsoname = "[unknown]";
411 if (map && map->dso) {
412 if (symbol_conf.show_kernel_path && map->dso->long_name)
413 dsoname = map->dso->long_name;
415 dsoname = map->dso->name;
418 if (symbol_conf.pad_output_len_dso) {
419 scnprintf_pad(buf, symbol_conf.pad_output_len_dso, "%s", dsoname);
423 return fprintf(fp, "%s", dsoname);
426 char *map__srcline(struct map *map, u64 addr, struct symbol *sym)
429 return SRCLINE_UNKNOWN;
430 return get_srcline(map->dso, map__rip_2objdump(map, addr), sym, true, true, addr);
433 int map__fprintf_srcline(struct map *map, u64 addr, const char *prefix,
438 if (map && map->dso) {
439 char *srcline = map__srcline(map, addr, NULL);
440 if (srcline != SRCLINE_UNKNOWN)
441 ret = fprintf(fp, "%s%s", prefix, srcline);
442 free_srcline(srcline);
447 int map__fprintf_srccode(struct map *map, u64 addr,
449 struct srccode_state *state)
457 if (!map || !map->dso)
459 srcfile = get_srcline_split(map->dso,
460 map__rip_2objdump(map, addr),
465 /* Avoid redundant printing */
468 !strcmp(state->srcfile, srcfile) &&
469 state->line == line) {
474 srccode = find_sourceline(srcfile, line, &len);
478 ret = fprintf(fp, "|%-8d %.*s", line, len, srccode);
481 state->srcfile = srcfile;
492 void srccode_state_free(struct srccode_state *state)
494 zfree(&state->srcfile);
499 * map__rip_2objdump - convert symbol start address to objdump address.
501 * @rip: symbol start address
503 * objdump wants/reports absolute IPs for ET_EXEC, and RIPs for ET_DYN.
504 * map->dso->adjust_symbols==1 for ET_EXEC-like cases except ET_REL which is
505 * relative to section start.
507 * Return: Address suitable for passing to "objdump --start-address="
509 u64 map__rip_2objdump(struct map *map, u64 rip)
511 struct kmap *kmap = __map__kmap(map);
514 * vmlinux does not have program headers for PTI entry trampolines and
515 * kcore may not either. However the trampoline object code is on the
516 * main kernel map, so just use that instead.
518 if (kmap && is_entry_trampoline(kmap->name) && kmap->kmaps && kmap->kmaps->machine) {
519 struct map *kernel_map = machine__kernel_map(kmap->kmaps->machine);
525 if (!map->dso->adjust_symbols)
529 return rip - map->pgoff;
532 * kernel modules also have DSO_TYPE_USER in dso->kernel,
533 * but all kernel modules are ET_REL, so won't get here.
535 if (map->dso->kernel == DSO_TYPE_USER)
536 return rip + map->dso->text_offset;
538 return map->unmap_ip(map, rip) - map->reloc;
542 * map__objdump_2mem - convert objdump address to a memory address.
544 * @ip: objdump address
546 * Closely related to map__rip_2objdump(), this function takes an address from
547 * objdump and converts it to a memory address. Note this assumes that @map
548 * contains the address. To be sure the result is valid, check it forwards
549 * e.g. map__rip_2objdump(map->map_ip(map, map__objdump_2mem(map, ip))) == ip
551 * Return: Memory address.
553 u64 map__objdump_2mem(struct map *map, u64 ip)
555 if (!map->dso->adjust_symbols)
556 return map->unmap_ip(map, ip);
559 return map->unmap_ip(map, ip + map->pgoff);
562 * kernel modules also have DSO_TYPE_USER in dso->kernel,
563 * but all kernel modules are ET_REL, so won't get here.
565 if (map->dso->kernel == DSO_TYPE_USER)
566 return map->unmap_ip(map, ip - map->dso->text_offset);
568 return ip + map->reloc;
571 static void maps__init(struct maps *maps)
573 maps->entries = RB_ROOT;
574 maps->names = RB_ROOT;
575 init_rwsem(&maps->lock);
578 void map_groups__init(struct map_groups *mg, struct machine *machine)
580 maps__init(&mg->maps);
581 mg->machine = machine;
582 refcount_set(&mg->refcnt, 1);
585 void map_groups__insert(struct map_groups *mg, struct map *map)
587 maps__insert(&mg->maps, map);
591 static void __maps__purge(struct maps *maps)
593 struct rb_root *root = &maps->entries;
594 struct rb_node *next = rb_first(root);
597 struct map *pos = rb_entry(next, struct map, rb_node);
599 next = rb_next(&pos->rb_node);
600 rb_erase_init(&pos->rb_node, root);
605 static void __maps__purge_names(struct maps *maps)
607 struct rb_root *root = &maps->names;
608 struct rb_node *next = rb_first(root);
611 struct map *pos = rb_entry(next, struct map, rb_node_name);
613 next = rb_next(&pos->rb_node_name);
614 rb_erase_init(&pos->rb_node_name, root);
619 static void maps__exit(struct maps *maps)
621 down_write(&maps->lock);
623 __maps__purge_names(maps);
624 up_write(&maps->lock);
627 void map_groups__exit(struct map_groups *mg)
629 maps__exit(&mg->maps);
632 bool map_groups__empty(struct map_groups *mg)
634 return !maps__first(&mg->maps);
637 struct map_groups *map_groups__new(struct machine *machine)
639 struct map_groups *mg = malloc(sizeof(*mg));
642 map_groups__init(mg, machine);
647 void map_groups__delete(struct map_groups *mg)
649 map_groups__exit(mg);
653 void map_groups__put(struct map_groups *mg)
655 if (mg && refcount_dec_and_test(&mg->refcnt))
656 map_groups__delete(mg);
659 struct symbol *map_groups__find_symbol(struct map_groups *mg,
660 u64 addr, struct map **mapp)
662 struct map *map = map_groups__find(mg, addr);
664 /* Ensure map is loaded before using map->map_ip */
665 if (map != NULL && map__load(map) >= 0) {
668 return map__find_symbol(map, map->map_ip(map, addr));
674 static bool map__contains_symbol(struct map *map, struct symbol *sym)
676 u64 ip = map->unmap_ip(map, sym->start);
678 return ip >= map->start && ip < map->end;
681 struct symbol *maps__find_symbol_by_name(struct maps *maps, const char *name,
687 down_read(&maps->lock);
689 for (nd = rb_first(&maps->entries); nd; nd = rb_next(nd)) {
690 struct map *pos = rb_entry(nd, struct map, rb_node);
692 sym = map__find_symbol_by_name(pos, name);
696 if (!map__contains_symbol(pos, sym)) {
707 up_read(&maps->lock);
711 struct symbol *map_groups__find_symbol_by_name(struct map_groups *mg,
715 return maps__find_symbol_by_name(&mg->maps, name, mapp);
718 int map_groups__find_ams(struct addr_map_symbol *ams)
720 if (ams->addr < ams->map->start || ams->addr >= ams->map->end) {
721 if (ams->map->groups == NULL)
723 ams->map = map_groups__find(ams->map->groups, ams->addr);
724 if (ams->map == NULL)
728 ams->al_addr = ams->map->map_ip(ams->map, ams->addr);
729 ams->sym = map__find_symbol(ams->map, ams->al_addr);
731 return ams->sym ? 0 : -1;
734 static size_t maps__fprintf(struct maps *maps, FILE *fp)
739 down_read(&maps->lock);
741 for (nd = rb_first(&maps->entries); nd; nd = rb_next(nd)) {
742 struct map *pos = rb_entry(nd, struct map, rb_node);
743 printed += fprintf(fp, "Map:");
744 printed += map__fprintf(pos, fp);
746 printed += dso__fprintf(pos->dso, fp);
747 printed += fprintf(fp, "--\n");
751 up_read(&maps->lock);
756 size_t map_groups__fprintf(struct map_groups *mg, FILE *fp)
758 return maps__fprintf(&mg->maps, fp);
761 static void __map_groups__insert(struct map_groups *mg, struct map *map)
763 __maps__insert(&mg->maps, map);
764 __maps__insert_name(&mg->maps, map);
768 static int maps__fixup_overlappings(struct maps *maps, struct map *map, FILE *fp)
770 struct rb_root *root;
771 struct rb_node *next, *first;
774 down_write(&maps->lock);
776 root = &maps->entries;
779 * Find first map where end > map->start.
780 * Same as find_vma() in kernel.
782 next = root->rb_node;
785 struct map *pos = rb_entry(next, struct map, rb_node);
787 if (pos->end > map->start) {
789 if (pos->start <= map->start)
791 next = next->rb_left;
793 next = next->rb_right;
798 struct map *pos = rb_entry(next, struct map, rb_node);
799 next = rb_next(&pos->rb_node);
802 * Stop if current map starts after map->end.
803 * Maps are ordered by start: next will not overlap for sure.
805 if (pos->start >= map->end)
811 pr_debug("overlapping maps in %s (disable tui for more info)\n",
814 fputs("overlapping maps:\n", fp);
815 map__fprintf(map, fp);
816 map__fprintf(pos, fp);
820 rb_erase_init(&pos->rb_node, root);
822 * Now check if we need to create new maps for areas not
823 * overlapped by the new map:
825 if (map->start > pos->start) {
826 struct map *before = map__clone(pos);
828 if (before == NULL) {
833 before->end = map->start;
834 __map_groups__insert(pos->groups, before);
835 if (verbose >= 2 && !use_browser)
836 map__fprintf(before, fp);
840 if (map->end < pos->end) {
841 struct map *after = map__clone(pos);
848 after->start = map->end;
849 __map_groups__insert(pos->groups, after);
850 if (verbose >= 2 && !use_browser)
851 map__fprintf(after, fp);
863 up_write(&maps->lock);
867 int map_groups__fixup_overlappings(struct map_groups *mg, struct map *map,
870 return maps__fixup_overlappings(&mg->maps, map, fp);
874 * XXX This should not really _copy_ te maps, but refcount them.
876 int map_groups__clone(struct thread *thread, struct map_groups *parent)
878 struct map_groups *mg = thread->mg;
881 struct maps *maps = &parent->maps;
883 down_read(&maps->lock);
885 for (map = maps__first(maps); map; map = map__next(map)) {
886 struct map *new = map__clone(map);
890 err = unwind__prepare_access(thread, new, NULL);
894 map_groups__insert(mg, new);
900 up_read(&maps->lock);
904 static void __maps__insert(struct maps *maps, struct map *map)
906 struct rb_node **p = &maps->entries.rb_node;
907 struct rb_node *parent = NULL;
908 const u64 ip = map->start;
913 m = rb_entry(parent, struct map, rb_node);
920 rb_link_node(&map->rb_node, parent, p);
921 rb_insert_color(&map->rb_node, &maps->entries);
925 static void __maps__insert_name(struct maps *maps, struct map *map)
927 struct rb_node **p = &maps->names.rb_node;
928 struct rb_node *parent = NULL;
934 m = rb_entry(parent, struct map, rb_node_name);
935 rc = strcmp(m->dso->short_name, map->dso->short_name);
941 rb_link_node(&map->rb_node_name, parent, p);
942 rb_insert_color(&map->rb_node_name, &maps->names);
946 void maps__insert(struct maps *maps, struct map *map)
948 down_write(&maps->lock);
949 __maps__insert(maps, map);
950 __maps__insert_name(maps, map);
951 up_write(&maps->lock);
954 static void __maps__remove(struct maps *maps, struct map *map)
956 rb_erase_init(&map->rb_node, &maps->entries);
959 rb_erase_init(&map->rb_node_name, &maps->names);
963 void maps__remove(struct maps *maps, struct map *map)
965 down_write(&maps->lock);
966 __maps__remove(maps, map);
967 up_write(&maps->lock);
970 struct map *maps__find(struct maps *maps, u64 ip)
975 down_read(&maps->lock);
977 p = maps->entries.rb_node;
979 m = rb_entry(p, struct map, rb_node);
982 else if (ip >= m->end)
990 up_read(&maps->lock);
994 struct map *maps__first(struct maps *maps)
996 struct rb_node *first = rb_first(&maps->entries);
999 return rb_entry(first, struct map, rb_node);
1003 struct map *map__next(struct map *map)
1005 struct rb_node *next = rb_next(&map->rb_node);
1008 return rb_entry(next, struct map, rb_node);
1012 struct kmap *__map__kmap(struct map *map)
1014 if (!map->dso || !map->dso->kernel)
1016 return (struct kmap *)(map + 1);
1019 struct kmap *map__kmap(struct map *map)
1021 struct kmap *kmap = __map__kmap(map);
1024 pr_err("Internal error: map__kmap with a non-kernel map\n");
1028 struct map_groups *map__kmaps(struct map *map)
1030 struct kmap *kmap = map__kmap(map);
1032 if (!kmap || !kmap->kmaps) {
1033 pr_err("Internal error: map__kmaps with a non-kernel map\n");