1 // SPDX-License-Identifier: GPL-2.0
11 #include <uapi/linux/mman.h> /* To get things like MAP_HUGETLB even on older libc headers */
14 #include "map_symbol.h"
20 #include <linux/string.h>
21 #include <linux/zalloc.h>
23 #include "namespaces.h"
28 static void __maps__insert(struct maps *maps, struct map *map);
30 static inline int is_android_lib(const char *filename)
32 return strstarts(filename, "/data/app-lib/") ||
33 strstarts(filename, "/system/lib/");
36 static inline bool replace_android_lib(const char *filename, char *newfilename)
40 size_t app_abi_length, new_length;
41 size_t lib_length = 0;
43 libname = strrchr(filename, '/');
45 lib_length = strlen(libname);
47 app_abi = getenv("APP_ABI");
51 app_abi_length = strlen(app_abi);
53 if (strstarts(filename, "/data/app-lib/")) {
59 new_length = 7 + app_abi_length + lib_length;
61 apk_path = getenv("APK_PATH");
63 new_length += strlen(apk_path) + 1;
64 if (new_length > PATH_MAX)
66 snprintf(newfilename, new_length,
67 "%s/libs/%s/%s", apk_path, app_abi, libname);
69 if (new_length > PATH_MAX)
71 snprintf(newfilename, new_length,
72 "libs/%s/%s", app_abi, libname);
77 if (strstarts(filename, "/system/lib/")) {
80 int ndk_length, app_length;
82 ndk = getenv("NDK_ROOT");
83 app = getenv("APP_PLATFORM");
88 ndk_length = strlen(ndk);
89 app_length = strlen(app);
91 if (!(ndk_length && app_length && app_abi_length))
94 arch = !strncmp(app_abi, "arm", 3) ? "arm" :
95 !strncmp(app_abi, "mips", 4) ? "mips" :
96 !strncmp(app_abi, "x86", 3) ? "x86" : NULL;
101 new_length = 27 + ndk_length +
102 app_length + lib_length
105 if (new_length > PATH_MAX)
107 snprintf(newfilename, new_length,
108 "%.*s/platforms/%.*s/arch-%s/usr/lib/%s",
109 ndk_length, ndk, app_length, app, arch, libname);
116 void map__init(struct map *map, u64 start, u64 end, u64 pgoff, struct dso *dso)
122 map->dso = dso__get(dso);
123 map->map_ip = map__map_ip;
124 map->unmap_ip = map__unmap_ip;
125 RB_CLEAR_NODE(&map->rb_node);
126 map->erange_warned = false;
127 refcount_set(&map->refcnt, 1);
130 struct map *map__new(struct machine *machine, u64 start, u64 len,
131 u64 pgoff, struct dso_id *id,
132 u32 prot, u32 flags, struct build_id *bid,
133 char *filename, struct thread *thread)
135 struct map *map = malloc(sizeof(*map));
136 struct nsinfo *nsi = NULL;
140 char newfilename[PATH_MAX];
142 int anon, no_dso, vdso, android;
144 android = is_android_lib(filename);
145 anon = is_anon_memory(filename) || flags & MAP_HUGETLB;
146 vdso = is_vdso_map(filename);
147 no_dso = is_no_dso_memory(filename);
150 nsi = nsinfo__get(thread->nsinfo);
152 if ((anon || no_dso) && nsi && (prot & PROT_EXEC)) {
153 snprintf(newfilename, sizeof(newfilename),
154 "/tmp/perf-%d.map", nsi->pid);
155 filename = newfilename;
159 if (replace_android_lib(filename, newfilename))
160 filename = newfilename;
164 /* The vdso maps are always on the host and not the
165 * container. Ensure that we don't use setns to look
168 nnsi = nsinfo__copy(nsi);
171 nnsi->need_setns = false;
175 dso = machine__findnew_vdso(machine, thread);
177 dso = machine__findnew_dso_id(machine, filename, id);
182 map__init(map, start, start + len, pgoff, dso);
184 if (anon || no_dso) {
185 map->map_ip = map->unmap_ip = identity__map_ip;
188 * Set memory without DSO as loaded. All map__find_*
189 * functions still return NULL, and we avoid the
190 * unnecessary map__load warning.
192 if (!(prot & PROT_EXEC))
193 dso__set_loaded(dso);
197 if (build_id__is_defined(bid))
198 dso__set_build_id(dso, bid);
210 * Constructor variant for modules (where we know from /proc/modules where
211 * they are loaded) and for vmlinux, where only after we load all the
212 * symbols we'll know where it starts and ends.
214 struct map *map__new2(u64 start, struct dso *dso)
216 struct map *map = calloc(1, (sizeof(*map) +
217 (dso->kernel ? sizeof(struct kmap) : 0)));
220 * ->end will be filled after we load all the symbols
222 map__init(map, start, 0, 0, dso);
228 bool __map__is_kernel(const struct map *map)
230 if (!map->dso->kernel)
232 return machine__kernel_map(map__kmaps((struct map *)map)->machine) == map;
235 bool __map__is_extra_kernel_map(const struct map *map)
237 struct kmap *kmap = __map__kmap((struct map *)map);
239 return kmap && kmap->name[0];
242 bool __map__is_bpf_prog(const struct map *map)
246 if (map->dso->binary_type == DSO_BINARY_TYPE__BPF_PROG_INFO)
250 * If PERF_RECORD_BPF_EVENT is not included, the dso will not have
251 * type of DSO_BINARY_TYPE__BPF_PROG_INFO. In such cases, we can
252 * guess the type based on name.
254 name = map->dso->short_name;
255 return name && (strstr(name, "bpf_prog_") == name);
258 bool __map__is_bpf_image(const struct map *map)
262 if (map->dso->binary_type == DSO_BINARY_TYPE__BPF_IMAGE)
266 * If PERF_RECORD_KSYMBOL is not included, the dso will not have
267 * type of DSO_BINARY_TYPE__BPF_IMAGE. In such cases, we can
268 * guess the type based on name.
270 name = map->dso->short_name;
271 return name && is_bpf_image(name);
274 bool __map__is_ool(const struct map *map)
276 return map->dso && map->dso->binary_type == DSO_BINARY_TYPE__OOL;
279 bool map__has_symbols(const struct map *map)
281 return dso__has_symbols(map->dso);
284 static void map__exit(struct map *map)
286 BUG_ON(refcount_read(&map->refcnt) != 0);
290 void map__delete(struct map *map)
296 void map__put(struct map *map)
298 if (map && refcount_dec_and_test(&map->refcnt))
302 void map__fixup_start(struct map *map)
304 struct rb_root_cached *symbols = &map->dso->symbols;
305 struct rb_node *nd = rb_first_cached(symbols);
307 struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
308 map->start = sym->start;
312 void map__fixup_end(struct map *map)
314 struct rb_root_cached *symbols = &map->dso->symbols;
315 struct rb_node *nd = rb_last(&symbols->rb_root);
317 struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
322 #define DSO__DELETED "(deleted)"
324 int map__load(struct map *map)
326 const char *name = map->dso->long_name;
329 if (dso__loaded(map->dso))
332 nr = dso__load(map->dso, map);
334 if (map->dso->has_build_id) {
335 char sbuild_id[SBUILD_ID_SIZE];
337 build_id__sprintf(&map->dso->bid, sbuild_id);
338 pr_debug("%s with build id %s not found", name, sbuild_id);
340 pr_debug("Failed to open %s", name);
342 pr_debug(", continuing without symbols\n");
344 } else if (nr == 0) {
345 #ifdef HAVE_LIBELF_SUPPORT
346 const size_t len = strlen(name);
347 const size_t real_len = len - sizeof(DSO__DELETED);
349 if (len > sizeof(DSO__DELETED) &&
350 strcmp(name + real_len + 1, DSO__DELETED) == 0) {
351 pr_debug("%.*s was updated (is prelink enabled?). "
352 "Restart the long running apps that use it!\n",
353 (int)real_len, name);
355 pr_debug("no symbols found in %s, maybe install a debug package?\n", name);
364 struct symbol *map__find_symbol(struct map *map, u64 addr)
366 if (map__load(map) < 0)
369 return dso__find_symbol(map->dso, addr);
372 struct symbol *map__find_symbol_by_name(struct map *map, const char *name)
374 if (map__load(map) < 0)
377 if (!dso__sorted_by_name(map->dso))
378 dso__sort_by_name(map->dso);
380 return dso__find_symbol_by_name(map->dso, name);
383 struct map *map__clone(struct map *from)
385 size_t size = sizeof(struct map);
388 if (from->dso && from->dso->kernel)
389 size += sizeof(struct kmap);
391 map = memdup(from, size);
393 refcount_set(&map->refcnt, 1);
394 RB_CLEAR_NODE(&map->rb_node);
401 size_t map__fprintf(struct map *map, FILE *fp)
403 return fprintf(fp, " %" PRIx64 "-%" PRIx64 " %" PRIx64 " %s\n",
404 map->start, map->end, map->pgoff, map->dso->name);
407 size_t map__fprintf_dsoname(struct map *map, FILE *fp)
409 char buf[symbol_conf.pad_output_len_dso + 1];
410 const char *dsoname = "[unknown]";
412 if (map && map->dso) {
413 if (symbol_conf.show_kernel_path && map->dso->long_name)
414 dsoname = map->dso->long_name;
416 dsoname = map->dso->name;
419 if (symbol_conf.pad_output_len_dso) {
420 scnprintf_pad(buf, symbol_conf.pad_output_len_dso, "%s", dsoname);
424 return fprintf(fp, "%s", dsoname);
427 char *map__srcline(struct map *map, u64 addr, struct symbol *sym)
430 return SRCLINE_UNKNOWN;
431 return get_srcline(map->dso, map__rip_2objdump(map, addr), sym, true, true, addr);
434 int map__fprintf_srcline(struct map *map, u64 addr, const char *prefix,
439 if (map && map->dso) {
440 char *srcline = map__srcline(map, addr, NULL);
441 if (strncmp(srcline, SRCLINE_UNKNOWN, strlen(SRCLINE_UNKNOWN)) != 0)
442 ret = fprintf(fp, "%s%s", prefix, srcline);
443 free_srcline(srcline);
448 void srccode_state_free(struct srccode_state *state)
450 zfree(&state->srcfile);
455 * map__rip_2objdump - convert symbol start address to objdump address.
457 * @rip: symbol start address
459 * objdump wants/reports absolute IPs for ET_EXEC, and RIPs for ET_DYN.
460 * map->dso->adjust_symbols==1 for ET_EXEC-like cases except ET_REL which is
461 * relative to section start.
463 * Return: Address suitable for passing to "objdump --start-address="
465 u64 map__rip_2objdump(struct map *map, u64 rip)
467 struct kmap *kmap = __map__kmap(map);
470 * vmlinux does not have program headers for PTI entry trampolines and
471 * kcore may not either. However the trampoline object code is on the
472 * main kernel map, so just use that instead.
474 if (kmap && is_entry_trampoline(kmap->name) && kmap->kmaps && kmap->kmaps->machine) {
475 struct map *kernel_map = machine__kernel_map(kmap->kmaps->machine);
481 if (!map->dso->adjust_symbols)
485 return rip - map->pgoff;
488 * kernel modules also have DSO_TYPE_USER in dso->kernel,
489 * but all kernel modules are ET_REL, so won't get here.
491 if (map->dso->kernel == DSO_SPACE__USER)
492 return rip + map->dso->text_offset;
494 return map->unmap_ip(map, rip) - map->reloc;
498 * map__objdump_2mem - convert objdump address to a memory address.
500 * @ip: objdump address
502 * Closely related to map__rip_2objdump(), this function takes an address from
503 * objdump and converts it to a memory address. Note this assumes that @map
504 * contains the address. To be sure the result is valid, check it forwards
505 * e.g. map__rip_2objdump(map->map_ip(map, map__objdump_2mem(map, ip))) == ip
507 * Return: Memory address.
509 u64 map__objdump_2mem(struct map *map, u64 ip)
511 if (!map->dso->adjust_symbols)
512 return map->unmap_ip(map, ip);
515 return map->unmap_ip(map, ip + map->pgoff);
518 * kernel modules also have DSO_TYPE_USER in dso->kernel,
519 * but all kernel modules are ET_REL, so won't get here.
521 if (map->dso->kernel == DSO_SPACE__USER)
522 return map->unmap_ip(map, ip - map->dso->text_offset);
524 return ip + map->reloc;
527 void maps__init(struct maps *maps, struct machine *machine)
529 maps->entries = RB_ROOT;
530 init_rwsem(&maps->lock);
531 maps->machine = machine;
532 maps->last_search_by_name = NULL;
534 maps->maps_by_name = NULL;
535 refcount_set(&maps->refcnt, 1);
538 static void __maps__free_maps_by_name(struct maps *maps)
541 * Free everything to try to do it from the rbtree in the next search
543 zfree(&maps->maps_by_name);
544 maps->nr_maps_allocated = 0;
547 void maps__insert(struct maps *maps, struct map *map)
549 down_write(&maps->lock);
550 __maps__insert(maps, map);
553 if (map->dso && map->dso->kernel) {
554 struct kmap *kmap = map__kmap(map);
559 pr_err("Internal error: kernel dso with non kernel map\n");
564 * If we already performed some search by name, then we need to add the just
565 * inserted map and resort.
567 if (maps->maps_by_name) {
568 if (maps->nr_maps > maps->nr_maps_allocated) {
569 int nr_allocate = maps->nr_maps * 2;
570 struct map **maps_by_name = realloc(maps->maps_by_name, nr_allocate * sizeof(map));
572 if (maps_by_name == NULL) {
573 __maps__free_maps_by_name(maps);
574 up_write(&maps->lock);
578 maps->maps_by_name = maps_by_name;
579 maps->nr_maps_allocated = nr_allocate;
581 maps->maps_by_name[maps->nr_maps - 1] = map;
582 __maps__sort_by_name(maps);
584 up_write(&maps->lock);
587 static void __maps__remove(struct maps *maps, struct map *map)
589 rb_erase_init(&map->rb_node, &maps->entries);
593 void maps__remove(struct maps *maps, struct map *map)
595 down_write(&maps->lock);
596 if (maps->last_search_by_name == map)
597 maps->last_search_by_name = NULL;
599 __maps__remove(maps, map);
601 if (maps->maps_by_name)
602 __maps__free_maps_by_name(maps);
603 up_write(&maps->lock);
606 static void __maps__purge(struct maps *maps)
608 struct map *pos, *next;
610 maps__for_each_entry_safe(maps, pos, next) {
611 rb_erase_init(&pos->rb_node, &maps->entries);
616 void maps__exit(struct maps *maps)
618 down_write(&maps->lock);
620 up_write(&maps->lock);
623 bool maps__empty(struct maps *maps)
625 return !maps__first(maps);
628 struct maps *maps__new(struct machine *machine)
630 struct maps *maps = zalloc(sizeof(*maps));
633 maps__init(maps, machine);
638 void maps__delete(struct maps *maps)
641 unwind__finish_access(maps);
645 void maps__put(struct maps *maps)
647 if (maps && refcount_dec_and_test(&maps->refcnt))
651 struct symbol *maps__find_symbol(struct maps *maps, u64 addr, struct map **mapp)
653 struct map *map = maps__find(maps, addr);
655 /* Ensure map is loaded before using map->map_ip */
656 if (map != NULL && map__load(map) >= 0) {
659 return map__find_symbol(map, map->map_ip(map, addr));
665 static bool map__contains_symbol(struct map *map, struct symbol *sym)
667 u64 ip = map->unmap_ip(map, sym->start);
669 return ip >= map->start && ip < map->end;
672 struct symbol *maps__find_symbol_by_name(struct maps *maps, const char *name, struct map **mapp)
677 down_read(&maps->lock);
679 maps__for_each_entry(maps, pos) {
680 sym = map__find_symbol_by_name(pos, name);
684 if (!map__contains_symbol(pos, sym)) {
695 up_read(&maps->lock);
699 int maps__find_ams(struct maps *maps, struct addr_map_symbol *ams)
701 if (ams->addr < ams->ms.map->start || ams->addr >= ams->ms.map->end) {
704 ams->ms.map = maps__find(maps, ams->addr);
705 if (ams->ms.map == NULL)
709 ams->al_addr = ams->ms.map->map_ip(ams->ms.map, ams->addr);
710 ams->ms.sym = map__find_symbol(ams->ms.map, ams->al_addr);
712 return ams->ms.sym ? 0 : -1;
715 size_t maps__fprintf(struct maps *maps, FILE *fp)
720 down_read(&maps->lock);
722 maps__for_each_entry(maps, pos) {
723 printed += fprintf(fp, "Map:");
724 printed += map__fprintf(pos, fp);
726 printed += dso__fprintf(pos->dso, fp);
727 printed += fprintf(fp, "--\n");
731 up_read(&maps->lock);
736 int maps__fixup_overlappings(struct maps *maps, struct map *map, FILE *fp)
738 struct rb_root *root;
739 struct rb_node *next, *first;
742 down_write(&maps->lock);
744 root = &maps->entries;
747 * Find first map where end > map->start.
748 * Same as find_vma() in kernel.
750 next = root->rb_node;
753 struct map *pos = rb_entry(next, struct map, rb_node);
755 if (pos->end > map->start) {
757 if (pos->start <= map->start)
759 next = next->rb_left;
761 next = next->rb_right;
766 struct map *pos = rb_entry(next, struct map, rb_node);
767 next = rb_next(&pos->rb_node);
770 * Stop if current map starts after map->end.
771 * Maps are ordered by start: next will not overlap for sure.
773 if (pos->start >= map->end)
779 pr_debug("overlapping maps in %s (disable tui for more info)\n",
782 fputs("overlapping maps:\n", fp);
783 map__fprintf(map, fp);
784 map__fprintf(pos, fp);
788 rb_erase_init(&pos->rb_node, root);
790 * Now check if we need to create new maps for areas not
791 * overlapped by the new map:
793 if (map->start > pos->start) {
794 struct map *before = map__clone(pos);
796 if (before == NULL) {
801 before->end = map->start;
802 __maps__insert(maps, before);
803 if (verbose >= 2 && !use_browser)
804 map__fprintf(before, fp);
808 if (map->end < pos->end) {
809 struct map *after = map__clone(pos);
816 after->start = map->end;
817 after->pgoff += map->end - pos->start;
818 assert(pos->map_ip(pos, map->end) == after->map_ip(after, map->end));
819 __maps__insert(maps, after);
820 if (verbose >= 2 && !use_browser)
821 map__fprintf(after, fp);
833 up_write(&maps->lock);
838 * XXX This should not really _copy_ te maps, but refcount them.
840 int maps__clone(struct thread *thread, struct maps *parent)
842 struct maps *maps = thread->maps;
846 down_read(&parent->lock);
848 maps__for_each_entry(parent, map) {
849 struct map *new = map__clone(map);
856 err = unwind__prepare_access(maps, new, NULL);
860 maps__insert(maps, new);
866 up_read(&parent->lock);
870 static void __maps__insert(struct maps *maps, struct map *map)
872 struct rb_node **p = &maps->entries.rb_node;
873 struct rb_node *parent = NULL;
874 const u64 ip = map->start;
879 m = rb_entry(parent, struct map, rb_node);
886 rb_link_node(&map->rb_node, parent, p);
887 rb_insert_color(&map->rb_node, &maps->entries);
891 struct map *maps__find(struct maps *maps, u64 ip)
896 down_read(&maps->lock);
898 p = maps->entries.rb_node;
900 m = rb_entry(p, struct map, rb_node);
903 else if (ip >= m->end)
911 up_read(&maps->lock);
915 struct map *maps__first(struct maps *maps)
917 struct rb_node *first = rb_first(&maps->entries);
920 return rb_entry(first, struct map, rb_node);
924 static struct map *__map__next(struct map *map)
926 struct rb_node *next = rb_next(&map->rb_node);
929 return rb_entry(next, struct map, rb_node);
933 struct map *map__next(struct map *map)
935 return map ? __map__next(map) : NULL;
938 struct kmap *__map__kmap(struct map *map)
940 if (!map->dso || !map->dso->kernel)
942 return (struct kmap *)(map + 1);
945 struct kmap *map__kmap(struct map *map)
947 struct kmap *kmap = __map__kmap(map);
950 pr_err("Internal error: map__kmap with a non-kernel map\n");
954 struct maps *map__kmaps(struct map *map)
956 struct kmap *kmap = map__kmap(map);
958 if (!kmap || !kmap->kmaps) {
959 pr_err("Internal error: map__kmaps with a non-kernel map\n");