Loading...
1// SPDX-License-Identifier: GPL-2.0
2#include "symbol.h"
3#include <errno.h>
4#include <inttypes.h>
5#include <limits.h>
6#include <stdlib.h>
7#include <string.h>
8#include <stdio.h>
9#include <unistd.h>
10#include <uapi/linux/mman.h> /* To get things like MAP_HUGETLB even on older libc headers */
11#include "map.h"
12#include "thread.h"
13#include "vdso.h"
14#include "build-id.h"
15#include "util.h"
16#include "debug.h"
17#include "machine.h"
18#include <linux/string.h>
19#include "srcline.h"
20#include "namespaces.h"
21#include "unwind.h"
22
23static void __maps__insert(struct maps *maps, struct map *map);
24
25const char *map_type__name[MAP__NR_TYPES] = {
26 [MAP__FUNCTION] = "Functions",
27 [MAP__VARIABLE] = "Variables",
28};
29
30static inline int is_anon_memory(const char *filename, u32 flags)
31{
32 return flags & MAP_HUGETLB ||
33 !strcmp(filename, "//anon") ||
34 !strncmp(filename, "/dev/zero", sizeof("/dev/zero") - 1) ||
35 !strncmp(filename, "/anon_hugepage", sizeof("/anon_hugepage") - 1);
36}
37
38static inline int is_no_dso_memory(const char *filename)
39{
40 return !strncmp(filename, "[stack", 6) ||
41 !strncmp(filename, "/SYSV",5) ||
42 !strcmp(filename, "[heap]");
43}
44
45static inline int is_android_lib(const char *filename)
46{
47 return !strncmp(filename, "/data/app-lib", 13) ||
48 !strncmp(filename, "/system/lib", 11);
49}
50
51static inline bool replace_android_lib(const char *filename, char *newfilename)
52{
53 const char *libname;
54 char *app_abi;
55 size_t app_abi_length, new_length;
56 size_t lib_length = 0;
57
58 libname = strrchr(filename, '/');
59 if (libname)
60 lib_length = strlen(libname);
61
62 app_abi = getenv("APP_ABI");
63 if (!app_abi)
64 return false;
65
66 app_abi_length = strlen(app_abi);
67
68 if (!strncmp(filename, "/data/app-lib", 13)) {
69 char *apk_path;
70
71 if (!app_abi_length)
72 return false;
73
74 new_length = 7 + app_abi_length + lib_length;
75
76 apk_path = getenv("APK_PATH");
77 if (apk_path) {
78 new_length += strlen(apk_path) + 1;
79 if (new_length > PATH_MAX)
80 return false;
81 snprintf(newfilename, new_length,
82 "%s/libs/%s/%s", apk_path, app_abi, libname);
83 } else {
84 if (new_length > PATH_MAX)
85 return false;
86 snprintf(newfilename, new_length,
87 "libs/%s/%s", app_abi, libname);
88 }
89 return true;
90 }
91
92 if (!strncmp(filename, "/system/lib/", 11)) {
93 char *ndk, *app;
94 const char *arch;
95 size_t ndk_length;
96 size_t app_length;
97
98 ndk = getenv("NDK_ROOT");
99 app = getenv("APP_PLATFORM");
100
101 if (!(ndk && app))
102 return false;
103
104 ndk_length = strlen(ndk);
105 app_length = strlen(app);
106
107 if (!(ndk_length && app_length && app_abi_length))
108 return false;
109
110 arch = !strncmp(app_abi, "arm", 3) ? "arm" :
111 !strncmp(app_abi, "mips", 4) ? "mips" :
112 !strncmp(app_abi, "x86", 3) ? "x86" : NULL;
113
114 if (!arch)
115 return false;
116
117 new_length = 27 + ndk_length +
118 app_length + lib_length
119 + strlen(arch);
120
121 if (new_length > PATH_MAX)
122 return false;
123 snprintf(newfilename, new_length,
124 "%s/platforms/%s/arch-%s/usr/lib/%s",
125 ndk, app, arch, libname);
126
127 return true;
128 }
129 return false;
130}
131
132void map__init(struct map *map, enum map_type type,
133 u64 start, u64 end, u64 pgoff, struct dso *dso)
134{
135 map->type = type;
136 map->start = start;
137 map->end = end;
138 map->pgoff = pgoff;
139 map->reloc = 0;
140 map->dso = dso__get(dso);
141 map->map_ip = map__map_ip;
142 map->unmap_ip = map__unmap_ip;
143 RB_CLEAR_NODE(&map->rb_node);
144 map->groups = NULL;
145 map->erange_warned = false;
146 refcount_set(&map->refcnt, 1);
147}
148
149struct map *map__new(struct machine *machine, u64 start, u64 len,
150 u64 pgoff, u32 d_maj, u32 d_min, u64 ino,
151 u64 ino_gen, u32 prot, u32 flags, char *filename,
152 enum map_type type, struct thread *thread)
153{
154 struct map *map = malloc(sizeof(*map));
155 struct nsinfo *nsi = NULL;
156 struct nsinfo *nnsi;
157
158 if (map != NULL) {
159 char newfilename[PATH_MAX];
160 struct dso *dso;
161 int anon, no_dso, vdso, android;
162
163 android = is_android_lib(filename);
164 anon = is_anon_memory(filename, flags);
165 vdso = is_vdso_map(filename);
166 no_dso = is_no_dso_memory(filename);
167
168 map->maj = d_maj;
169 map->min = d_min;
170 map->ino = ino;
171 map->ino_generation = ino_gen;
172 map->prot = prot;
173 map->flags = flags;
174 nsi = nsinfo__get(thread->nsinfo);
175
176 if ((anon || no_dso) && nsi && type == MAP__FUNCTION) {
177 snprintf(newfilename, sizeof(newfilename),
178 "/tmp/perf-%d.map", nsi->pid);
179 filename = newfilename;
180 }
181
182 if (android) {
183 if (replace_android_lib(filename, newfilename))
184 filename = newfilename;
185 }
186
187 if (vdso) {
188 /* The vdso maps are always on the host and not the
189 * container. Ensure that we don't use setns to look
190 * them up.
191 */
192 nnsi = nsinfo__copy(nsi);
193 if (nnsi) {
194 nsinfo__put(nsi);
195 nnsi->need_setns = false;
196 nsi = nnsi;
197 }
198 pgoff = 0;
199 dso = machine__findnew_vdso(machine, thread);
200 } else
201 dso = machine__findnew_dso(machine, filename);
202
203 if (dso == NULL)
204 goto out_delete;
205
206 map__init(map, type, start, start + len, pgoff, dso);
207
208 if (anon || no_dso) {
209 map->map_ip = map->unmap_ip = identity__map_ip;
210
211 /*
212 * Set memory without DSO as loaded. All map__find_*
213 * functions still return NULL, and we avoid the
214 * unnecessary map__load warning.
215 */
216 if (type != MAP__FUNCTION)
217 dso__set_loaded(dso, map->type);
218 }
219 dso->nsinfo = nsi;
220 dso__put(dso);
221 }
222 return map;
223out_delete:
224 nsinfo__put(nsi);
225 free(map);
226 return NULL;
227}
228
229/*
230 * Constructor variant for modules (where we know from /proc/modules where
231 * they are loaded) and for vmlinux, where only after we load all the
232 * symbols we'll know where it starts and ends.
233 */
234struct map *map__new2(u64 start, struct dso *dso, enum map_type type)
235{
236 struct map *map = calloc(1, (sizeof(*map) +
237 (dso->kernel ? sizeof(struct kmap) : 0)));
238 if (map != NULL) {
239 /*
240 * ->end will be filled after we load all the symbols
241 */
242 map__init(map, type, start, 0, 0, dso);
243 }
244
245 return map;
246}
247
248/*
249 * Use this and __map__is_kmodule() for map instances that are in
250 * machine->kmaps, and thus have map->groups->machine all properly set, to
251 * disambiguate between the kernel and modules.
252 *
253 * When the need arises, introduce map__is_{kernel,kmodule)() that
254 * checks (map->groups != NULL && map->groups->machine != NULL &&
255 * map->dso->kernel) before calling __map__is_{kernel,kmodule}())
256 */
257bool __map__is_kernel(const struct map *map)
258{
259 return __machine__kernel_map(map->groups->machine, map->type) == map;
260}
261
262static void map__exit(struct map *map)
263{
264 BUG_ON(!RB_EMPTY_NODE(&map->rb_node));
265 dso__zput(map->dso);
266}
267
268void map__delete(struct map *map)
269{
270 map__exit(map);
271 free(map);
272}
273
274void map__put(struct map *map)
275{
276 if (map && refcount_dec_and_test(&map->refcnt))
277 map__delete(map);
278}
279
280void map__fixup_start(struct map *map)
281{
282 struct rb_root *symbols = &map->dso->symbols[map->type];
283 struct rb_node *nd = rb_first(symbols);
284 if (nd != NULL) {
285 struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
286 map->start = sym->start;
287 }
288}
289
290void map__fixup_end(struct map *map)
291{
292 struct rb_root *symbols = &map->dso->symbols[map->type];
293 struct rb_node *nd = rb_last(symbols);
294 if (nd != NULL) {
295 struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
296 map->end = sym->end;
297 }
298}
299
300#define DSO__DELETED "(deleted)"
301
302int map__load(struct map *map)
303{
304 const char *name = map->dso->long_name;
305 int nr;
306
307 if (dso__loaded(map->dso, map->type))
308 return 0;
309
310 nr = dso__load(map->dso, map);
311 if (nr < 0) {
312 if (map->dso->has_build_id) {
313 char sbuild_id[SBUILD_ID_SIZE];
314
315 build_id__sprintf(map->dso->build_id,
316 sizeof(map->dso->build_id),
317 sbuild_id);
318 pr_warning("%s with build id %s not found",
319 name, sbuild_id);
320 } else
321 pr_warning("Failed to open %s", name);
322
323 pr_warning(", continuing without symbols\n");
324 return -1;
325 } else if (nr == 0) {
326#ifdef HAVE_LIBELF_SUPPORT
327 const size_t len = strlen(name);
328 const size_t real_len = len - sizeof(DSO__DELETED);
329
330 if (len > sizeof(DSO__DELETED) &&
331 strcmp(name + real_len + 1, DSO__DELETED) == 0) {
332 pr_warning("%.*s was updated (is prelink enabled?). "
333 "Restart the long running apps that use it!\n",
334 (int)real_len, name);
335 } else {
336 pr_warning("no symbols found in %s, maybe install "
337 "a debug package?\n", name);
338 }
339#endif
340 return -1;
341 }
342
343 return 0;
344}
345
346struct symbol *map__find_symbol(struct map *map, u64 addr)
347{
348 if (map__load(map) < 0)
349 return NULL;
350
351 return dso__find_symbol(map->dso, map->type, addr);
352}
353
354struct symbol *map__find_symbol_by_name(struct map *map, const char *name)
355{
356 if (map__load(map) < 0)
357 return NULL;
358
359 if (!dso__sorted_by_name(map->dso, map->type))
360 dso__sort_by_name(map->dso, map->type);
361
362 return dso__find_symbol_by_name(map->dso, map->type, name);
363}
364
365struct map *map__clone(struct map *from)
366{
367 struct map *map = memdup(from, sizeof(*map));
368
369 if (map != NULL) {
370 refcount_set(&map->refcnt, 1);
371 RB_CLEAR_NODE(&map->rb_node);
372 dso__get(map->dso);
373 map->groups = NULL;
374 }
375
376 return map;
377}
378
379int map__overlap(struct map *l, struct map *r)
380{
381 if (l->start > r->start) {
382 struct map *t = l;
383 l = r;
384 r = t;
385 }
386
387 if (l->end > r->start)
388 return 1;
389
390 return 0;
391}
392
393size_t map__fprintf(struct map *map, FILE *fp)
394{
395 return fprintf(fp, " %" PRIx64 "-%" PRIx64 " %" PRIx64 " %s\n",
396 map->start, map->end, map->pgoff, map->dso->name);
397}
398
399size_t map__fprintf_dsoname(struct map *map, FILE *fp)
400{
401 const char *dsoname = "[unknown]";
402
403 if (map && map->dso) {
404 if (symbol_conf.show_kernel_path && map->dso->long_name)
405 dsoname = map->dso->long_name;
406 else
407 dsoname = map->dso->name;
408 }
409
410 return fprintf(fp, "%s", dsoname);
411}
412
413int map__fprintf_srcline(struct map *map, u64 addr, const char *prefix,
414 FILE *fp)
415{
416 char *srcline;
417 int ret = 0;
418
419 if (map && map->dso) {
420 srcline = get_srcline(map->dso,
421 map__rip_2objdump(map, addr), NULL,
422 true, true, addr);
423 if (srcline != SRCLINE_UNKNOWN)
424 ret = fprintf(fp, "%s%s", prefix, srcline);
425 free_srcline(srcline);
426 }
427 return ret;
428}
429
430/**
431 * map__rip_2objdump - convert symbol start address to objdump address.
432 * @map: memory map
433 * @rip: symbol start address
434 *
435 * objdump wants/reports absolute IPs for ET_EXEC, and RIPs for ET_DYN.
436 * map->dso->adjust_symbols==1 for ET_EXEC-like cases except ET_REL which is
437 * relative to section start.
438 *
439 * Return: Address suitable for passing to "objdump --start-address="
440 */
441u64 map__rip_2objdump(struct map *map, u64 rip)
442{
443 if (!map->dso->adjust_symbols)
444 return rip;
445
446 if (map->dso->rel)
447 return rip - map->pgoff;
448
449 /*
450 * kernel modules also have DSO_TYPE_USER in dso->kernel,
451 * but all kernel modules are ET_REL, so won't get here.
452 */
453 if (map->dso->kernel == DSO_TYPE_USER)
454 return rip + map->dso->text_offset;
455
456 return map->unmap_ip(map, rip) - map->reloc;
457}
458
459/**
460 * map__objdump_2mem - convert objdump address to a memory address.
461 * @map: memory map
462 * @ip: objdump address
463 *
464 * Closely related to map__rip_2objdump(), this function takes an address from
465 * objdump and converts it to a memory address. Note this assumes that @map
466 * contains the address. To be sure the result is valid, check it forwards
467 * e.g. map__rip_2objdump(map->map_ip(map, map__objdump_2mem(map, ip))) == ip
468 *
469 * Return: Memory address.
470 */
471u64 map__objdump_2mem(struct map *map, u64 ip)
472{
473 if (!map->dso->adjust_symbols)
474 return map->unmap_ip(map, ip);
475
476 if (map->dso->rel)
477 return map->unmap_ip(map, ip + map->pgoff);
478
479 /*
480 * kernel modules also have DSO_TYPE_USER in dso->kernel,
481 * but all kernel modules are ET_REL, so won't get here.
482 */
483 if (map->dso->kernel == DSO_TYPE_USER)
484 return map->unmap_ip(map, ip - map->dso->text_offset);
485
486 return ip + map->reloc;
487}
488
489static void maps__init(struct maps *maps)
490{
491 maps->entries = RB_ROOT;
492 init_rwsem(&maps->lock);
493}
494
495void map_groups__init(struct map_groups *mg, struct machine *machine)
496{
497 int i;
498 for (i = 0; i < MAP__NR_TYPES; ++i) {
499 maps__init(&mg->maps[i]);
500 }
501 mg->machine = machine;
502 refcount_set(&mg->refcnt, 1);
503}
504
505static void __maps__purge(struct maps *maps)
506{
507 struct rb_root *root = &maps->entries;
508 struct rb_node *next = rb_first(root);
509
510 while (next) {
511 struct map *pos = rb_entry(next, struct map, rb_node);
512
513 next = rb_next(&pos->rb_node);
514 rb_erase_init(&pos->rb_node, root);
515 map__put(pos);
516 }
517}
518
519static void maps__exit(struct maps *maps)
520{
521 down_write(&maps->lock);
522 __maps__purge(maps);
523 up_write(&maps->lock);
524}
525
526void map_groups__exit(struct map_groups *mg)
527{
528 int i;
529
530 for (i = 0; i < MAP__NR_TYPES; ++i)
531 maps__exit(&mg->maps[i]);
532}
533
534bool map_groups__empty(struct map_groups *mg)
535{
536 int i;
537
538 for (i = 0; i < MAP__NR_TYPES; ++i) {
539 if (maps__first(&mg->maps[i]))
540 return false;
541 }
542
543 return true;
544}
545
546struct map_groups *map_groups__new(struct machine *machine)
547{
548 struct map_groups *mg = malloc(sizeof(*mg));
549
550 if (mg != NULL)
551 map_groups__init(mg, machine);
552
553 return mg;
554}
555
556void map_groups__delete(struct map_groups *mg)
557{
558 map_groups__exit(mg);
559 free(mg);
560}
561
562void map_groups__put(struct map_groups *mg)
563{
564 if (mg && refcount_dec_and_test(&mg->refcnt))
565 map_groups__delete(mg);
566}
567
568struct symbol *map_groups__find_symbol(struct map_groups *mg,
569 enum map_type type, u64 addr,
570 struct map **mapp)
571{
572 struct map *map = map_groups__find(mg, type, addr);
573
574 /* Ensure map is loaded before using map->map_ip */
575 if (map != NULL && map__load(map) >= 0) {
576 if (mapp != NULL)
577 *mapp = map;
578 return map__find_symbol(map, map->map_ip(map, addr));
579 }
580
581 return NULL;
582}
583
584struct symbol *maps__find_symbol_by_name(struct maps *maps, const char *name,
585 struct map **mapp)
586{
587 struct symbol *sym;
588 struct rb_node *nd;
589
590 down_read(&maps->lock);
591
592 for (nd = rb_first(&maps->entries); nd; nd = rb_next(nd)) {
593 struct map *pos = rb_entry(nd, struct map, rb_node);
594
595 sym = map__find_symbol_by_name(pos, name);
596
597 if (sym == NULL)
598 continue;
599 if (mapp != NULL)
600 *mapp = pos;
601 goto out;
602 }
603
604 sym = NULL;
605out:
606 up_read(&maps->lock);
607 return sym;
608}
609
610struct symbol *map_groups__find_symbol_by_name(struct map_groups *mg,
611 enum map_type type,
612 const char *name,
613 struct map **mapp)
614{
615 struct symbol *sym = maps__find_symbol_by_name(&mg->maps[type], name, mapp);
616
617 return sym;
618}
619
620int map_groups__find_ams(struct addr_map_symbol *ams)
621{
622 if (ams->addr < ams->map->start || ams->addr >= ams->map->end) {
623 if (ams->map->groups == NULL)
624 return -1;
625 ams->map = map_groups__find(ams->map->groups, ams->map->type,
626 ams->addr);
627 if (ams->map == NULL)
628 return -1;
629 }
630
631 ams->al_addr = ams->map->map_ip(ams->map, ams->addr);
632 ams->sym = map__find_symbol(ams->map, ams->al_addr);
633
634 return ams->sym ? 0 : -1;
635}
636
637static size_t maps__fprintf(struct maps *maps, FILE *fp)
638{
639 size_t printed = 0;
640 struct rb_node *nd;
641
642 down_read(&maps->lock);
643
644 for (nd = rb_first(&maps->entries); nd; nd = rb_next(nd)) {
645 struct map *pos = rb_entry(nd, struct map, rb_node);
646 printed += fprintf(fp, "Map:");
647 printed += map__fprintf(pos, fp);
648 if (verbose > 2) {
649 printed += dso__fprintf(pos->dso, pos->type, fp);
650 printed += fprintf(fp, "--\n");
651 }
652 }
653
654 up_read(&maps->lock);
655
656 return printed;
657}
658
659size_t __map_groups__fprintf_maps(struct map_groups *mg, enum map_type type,
660 FILE *fp)
661{
662 size_t printed = fprintf(fp, "%s:\n", map_type__name[type]);
663 return printed += maps__fprintf(&mg->maps[type], fp);
664}
665
666size_t map_groups__fprintf(struct map_groups *mg, FILE *fp)
667{
668 size_t printed = 0, i;
669 for (i = 0; i < MAP__NR_TYPES; ++i)
670 printed += __map_groups__fprintf_maps(mg, i, fp);
671 return printed;
672}
673
674static void __map_groups__insert(struct map_groups *mg, struct map *map)
675{
676 __maps__insert(&mg->maps[map->type], map);
677 map->groups = mg;
678}
679
680static int maps__fixup_overlappings(struct maps *maps, struct map *map, FILE *fp)
681{
682 struct rb_root *root;
683 struct rb_node *next;
684 int err = 0;
685
686 down_write(&maps->lock);
687
688 root = &maps->entries;
689 next = rb_first(root);
690
691 while (next) {
692 struct map *pos = rb_entry(next, struct map, rb_node);
693 next = rb_next(&pos->rb_node);
694
695 if (!map__overlap(pos, map))
696 continue;
697
698 if (verbose >= 2) {
699
700 if (use_browser) {
701 pr_warning("overlapping maps in %s "
702 "(disable tui for more info)\n",
703 map->dso->name);
704 } else {
705 fputs("overlapping maps:\n", fp);
706 map__fprintf(map, fp);
707 map__fprintf(pos, fp);
708 }
709 }
710
711 rb_erase_init(&pos->rb_node, root);
712 /*
713 * Now check if we need to create new maps for areas not
714 * overlapped by the new map:
715 */
716 if (map->start > pos->start) {
717 struct map *before = map__clone(pos);
718
719 if (before == NULL) {
720 err = -ENOMEM;
721 goto put_map;
722 }
723
724 before->end = map->start;
725 __map_groups__insert(pos->groups, before);
726 if (verbose >= 2 && !use_browser)
727 map__fprintf(before, fp);
728 map__put(before);
729 }
730
731 if (map->end < pos->end) {
732 struct map *after = map__clone(pos);
733
734 if (after == NULL) {
735 err = -ENOMEM;
736 goto put_map;
737 }
738
739 after->start = map->end;
740 __map_groups__insert(pos->groups, after);
741 if (verbose >= 2 && !use_browser)
742 map__fprintf(after, fp);
743 map__put(after);
744 }
745put_map:
746 map__put(pos);
747
748 if (err)
749 goto out;
750 }
751
752 err = 0;
753out:
754 up_write(&maps->lock);
755 return err;
756}
757
758int map_groups__fixup_overlappings(struct map_groups *mg, struct map *map,
759 FILE *fp)
760{
761 return maps__fixup_overlappings(&mg->maps[map->type], map, fp);
762}
763
764/*
765 * XXX This should not really _copy_ te maps, but refcount them.
766 */
767int map_groups__clone(struct thread *thread,
768 struct map_groups *parent, enum map_type type)
769{
770 struct map_groups *mg = thread->mg;
771 int err = -ENOMEM;
772 struct map *map;
773 struct maps *maps = &parent->maps[type];
774
775 down_read(&maps->lock);
776
777 for (map = maps__first(maps); map; map = map__next(map)) {
778 struct map *new = map__clone(map);
779 if (new == NULL)
780 goto out_unlock;
781
782 err = unwind__prepare_access(thread, new, NULL);
783 if (err)
784 goto out_unlock;
785
786 map_groups__insert(mg, new);
787 map__put(new);
788 }
789
790 err = 0;
791out_unlock:
792 up_read(&maps->lock);
793 return err;
794}
795
796static void __maps__insert(struct maps *maps, struct map *map)
797{
798 struct rb_node **p = &maps->entries.rb_node;
799 struct rb_node *parent = NULL;
800 const u64 ip = map->start;
801 struct map *m;
802
803 while (*p != NULL) {
804 parent = *p;
805 m = rb_entry(parent, struct map, rb_node);
806 if (ip < m->start)
807 p = &(*p)->rb_left;
808 else
809 p = &(*p)->rb_right;
810 }
811
812 rb_link_node(&map->rb_node, parent, p);
813 rb_insert_color(&map->rb_node, &maps->entries);
814 map__get(map);
815}
816
817void maps__insert(struct maps *maps, struct map *map)
818{
819 down_write(&maps->lock);
820 __maps__insert(maps, map);
821 up_write(&maps->lock);
822}
823
824static void __maps__remove(struct maps *maps, struct map *map)
825{
826 rb_erase_init(&map->rb_node, &maps->entries);
827 map__put(map);
828}
829
830void maps__remove(struct maps *maps, struct map *map)
831{
832 down_write(&maps->lock);
833 __maps__remove(maps, map);
834 up_write(&maps->lock);
835}
836
837struct map *maps__find(struct maps *maps, u64 ip)
838{
839 struct rb_node **p, *parent = NULL;
840 struct map *m;
841
842 down_read(&maps->lock);
843
844 p = &maps->entries.rb_node;
845 while (*p != NULL) {
846 parent = *p;
847 m = rb_entry(parent, struct map, rb_node);
848 if (ip < m->start)
849 p = &(*p)->rb_left;
850 else if (ip >= m->end)
851 p = &(*p)->rb_right;
852 else
853 goto out;
854 }
855
856 m = NULL;
857out:
858 up_read(&maps->lock);
859 return m;
860}
861
862struct map *maps__first(struct maps *maps)
863{
864 struct rb_node *first = rb_first(&maps->entries);
865
866 if (first)
867 return rb_entry(first, struct map, rb_node);
868 return NULL;
869}
870
871struct map *map__next(struct map *map)
872{
873 struct rb_node *next = rb_next(&map->rb_node);
874
875 if (next)
876 return rb_entry(next, struct map, rb_node);
877 return NULL;
878}
879
880struct kmap *map__kmap(struct map *map)
881{
882 if (!map->dso || !map->dso->kernel) {
883 pr_err("Internal error: map__kmap with a non-kernel map\n");
884 return NULL;
885 }
886 return (struct kmap *)(map + 1);
887}
888
889struct map_groups *map__kmaps(struct map *map)
890{
891 struct kmap *kmap = map__kmap(map);
892
893 if (!kmap || !kmap->kmaps) {
894 pr_err("Internal error: map__kmaps with a non-kernel map\n");
895 return NULL;
896 }
897 return kmap->kmaps;
898}
1#include "symbol.h"
2#include <errno.h>
3#include <inttypes.h>
4#include <limits.h>
5#include <stdlib.h>
6#include <string.h>
7#include <stdio.h>
8#include <unistd.h>
9#include "map.h"
10#include "thread.h"
11#include "strlist.h"
12#include "vdso.h"
13#include "build-id.h"
14#include "util.h"
15#include <linux/string.h>
16
17const char *map_type__name[MAP__NR_TYPES] = {
18 [MAP__FUNCTION] = "Functions",
19 [MAP__VARIABLE] = "Variables",
20};
21
22static inline int is_anon_memory(const char *filename)
23{
24 return !strcmp(filename, "//anon") ||
25 !strcmp(filename, "/dev/zero (deleted)") ||
26 !strcmp(filename, "/anon_hugepage (deleted)");
27}
28
29static inline int is_no_dso_memory(const char *filename)
30{
31 return !strncmp(filename, "[stack", 6) ||
32 !strcmp(filename, "[heap]");
33}
34
35void map__init(struct map *map, enum map_type type,
36 u64 start, u64 end, u64 pgoff, struct dso *dso)
37{
38 map->type = type;
39 map->start = start;
40 map->end = end;
41 map->pgoff = pgoff;
42 map->reloc = 0;
43 map->dso = dso;
44 map->map_ip = map__map_ip;
45 map->unmap_ip = map__unmap_ip;
46 RB_CLEAR_NODE(&map->rb_node);
47 map->groups = NULL;
48 map->referenced = false;
49 map->erange_warned = false;
50}
51
52struct 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,
55 enum map_type type)
56{
57 struct map *map = malloc(sizeof(*map));
58
59 if (map != NULL) {
60 char newfilename[PATH_MAX];
61 struct dso *dso;
62 int anon, no_dso, vdso;
63
64 anon = is_anon_memory(filename);
65 vdso = is_vdso_map(filename);
66 no_dso = is_no_dso_memory(filename);
67
68 map->maj = d_maj;
69 map->min = d_min;
70 map->ino = ino;
71 map->ino_generation = ino_gen;
72
73 if ((anon || no_dso) && type == MAP__FUNCTION) {
74 snprintf(newfilename, sizeof(newfilename), "/tmp/perf-%d.map", pid);
75 filename = newfilename;
76 }
77
78 if (vdso) {
79 pgoff = 0;
80 dso = vdso__dso_findnew(dsos__list);
81 } else
82 dso = __dsos__findnew(dsos__list, filename);
83
84 if (dso == NULL)
85 goto out_delete;
86
87 map__init(map, type, start, start + len, pgoff, dso);
88
89 if (anon || no_dso) {
90 map->map_ip = map->unmap_ip = identity__map_ip;
91
92 /*
93 * Set memory without DSO as loaded. All map__find_*
94 * functions still return NULL, and we avoid the
95 * unnecessary map__load warning.
96 */
97 if (type != MAP__FUNCTION)
98 dso__set_loaded(dso, map->type);
99 }
100 }
101 return map;
102out_delete:
103 free(map);
104 return NULL;
105}
106
107/*
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.
111 */
112struct map *map__new2(u64 start, struct dso *dso, enum map_type type)
113{
114 struct map *map = calloc(1, (sizeof(*map) +
115 (dso->kernel ? sizeof(struct kmap) : 0)));
116 if (map != NULL) {
117 /*
118 * ->end will be filled after we load all the symbols
119 */
120 map__init(map, type, start, 0, 0, dso);
121 }
122
123 return map;
124}
125
126void map__delete(struct map *map)
127{
128 free(map);
129}
130
131void map__fixup_start(struct map *map)
132{
133 struct rb_root *symbols = &map->dso->symbols[map->type];
134 struct rb_node *nd = rb_first(symbols);
135 if (nd != NULL) {
136 struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
137 map->start = sym->start;
138 }
139}
140
141void map__fixup_end(struct map *map)
142{
143 struct rb_root *symbols = &map->dso->symbols[map->type];
144 struct rb_node *nd = rb_last(symbols);
145 if (nd != NULL) {
146 struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
147 map->end = sym->end;
148 }
149}
150
151#define DSO__DELETED "(deleted)"
152
153int map__load(struct map *map, symbol_filter_t filter)
154{
155 const char *name = map->dso->long_name;
156 int nr;
157
158 if (dso__loaded(map->dso, map->type))
159 return 0;
160
161 nr = dso__load(map->dso, map, filter);
162 if (nr < 0) {
163 if (map->dso->has_build_id) {
164 char sbuild_id[BUILD_ID_SIZE * 2 + 1];
165
166 build_id__sprintf(map->dso->build_id,
167 sizeof(map->dso->build_id),
168 sbuild_id);
169 pr_warning("%s with build id %s not found",
170 name, sbuild_id);
171 } else
172 pr_warning("Failed to open %s", name);
173
174 pr_warning(", continuing without symbols\n");
175 return -1;
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);
180
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);
186 } else {
187 pr_warning("no symbols found in %s, maybe install "
188 "a debug package?\n", name);
189 }
190#endif
191 return -1;
192 }
193
194 return 0;
195}
196
197struct symbol *map__find_symbol(struct map *map, u64 addr,
198 symbol_filter_t filter)
199{
200 if (map__load(map, filter) < 0)
201 return NULL;
202
203 return dso__find_symbol(map->dso, map->type, addr);
204}
205
206struct symbol *map__find_symbol_by_name(struct map *map, const char *name,
207 symbol_filter_t filter)
208{
209 if (map__load(map, filter) < 0)
210 return NULL;
211
212 if (!dso__sorted_by_name(map->dso, map->type))
213 dso__sort_by_name(map->dso, map->type);
214
215 return dso__find_symbol_by_name(map->dso, map->type, name);
216}
217
218struct map *map__clone(struct map *map)
219{
220 return memdup(map, sizeof(*map));
221}
222
223int map__overlap(struct map *l, struct map *r)
224{
225 if (l->start > r->start) {
226 struct map *t = l;
227 l = r;
228 r = t;
229 }
230
231 if (l->end > r->start)
232 return 1;
233
234 return 0;
235}
236
237size_t map__fprintf(struct map *map, FILE *fp)
238{
239 return fprintf(fp, " %" PRIx64 "-%" PRIx64 " %" PRIx64 " %s\n",
240 map->start, map->end, map->pgoff, map->dso->name);
241}
242
243size_t map__fprintf_dsoname(struct map *map, FILE *fp)
244{
245 const char *dsoname = "[unknown]";
246
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;
252 }
253
254 return fprintf(fp, "%s", dsoname);
255}
256
257int map__fprintf_srcline(struct map *map, u64 addr, const char *prefix,
258 FILE *fp)
259{
260 char *srcline;
261 int ret = 0;
262
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);
269 }
270 return ret;
271}
272
273/**
274 * map__rip_2objdump - convert symbol start address to objdump address.
275 * @map: memory map
276 * @rip: symbol start address
277 *
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.
281 *
282 * Return: Address suitable for passing to "objdump --start-address="
283 */
284u64 map__rip_2objdump(struct map *map, u64 rip)
285{
286 if (!map->dso->adjust_symbols)
287 return rip;
288
289 if (map->dso->rel)
290 return rip - map->pgoff;
291
292 return map->unmap_ip(map, rip) - map->reloc;
293}
294
295/**
296 * map__objdump_2mem - convert objdump address to a memory address.
297 * @map: memory map
298 * @ip: objdump address
299 *
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
304 *
305 * Return: Memory address.
306 */
307u64 map__objdump_2mem(struct map *map, u64 ip)
308{
309 if (!map->dso->adjust_symbols)
310 return map->unmap_ip(map, ip);
311
312 if (map->dso->rel)
313 return map->unmap_ip(map, ip + map->pgoff);
314
315 return ip + map->reloc;
316}
317
318void map_groups__init(struct map_groups *mg)
319{
320 int i;
321 for (i = 0; i < MAP__NR_TYPES; ++i) {
322 mg->maps[i] = RB_ROOT;
323 INIT_LIST_HEAD(&mg->removed_maps[i]);
324 }
325 mg->machine = NULL;
326}
327
328static void maps__delete(struct rb_root *maps)
329{
330 struct rb_node *next = rb_first(maps);
331
332 while (next) {
333 struct map *pos = rb_entry(next, struct map, rb_node);
334
335 next = rb_next(&pos->rb_node);
336 rb_erase(&pos->rb_node, maps);
337 map__delete(pos);
338 }
339}
340
341static void maps__delete_removed(struct list_head *maps)
342{
343 struct map *pos, *n;
344
345 list_for_each_entry_safe(pos, n, maps, node) {
346 list_del(&pos->node);
347 map__delete(pos);
348 }
349}
350
351void map_groups__exit(struct map_groups *mg)
352{
353 int i;
354
355 for (i = 0; i < MAP__NR_TYPES; ++i) {
356 maps__delete(&mg->maps[i]);
357 maps__delete_removed(&mg->removed_maps[i]);
358 }
359}
360
361void map_groups__flush(struct map_groups *mg)
362{
363 int type;
364
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);
368
369 while (next) {
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);
373 /*
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.
377 */
378 list_add_tail(&pos->node, &mg->removed_maps[pos->type]);
379 }
380 }
381}
382
383struct symbol *map_groups__find_symbol(struct map_groups *mg,
384 enum map_type type, u64 addr,
385 struct map **mapp,
386 symbol_filter_t filter)
387{
388 struct map *map = map_groups__find(mg, type, addr);
389
390 /* Ensure map is loaded before using map->map_ip */
391 if (map != NULL && map__load(map, filter) >= 0) {
392 if (mapp != NULL)
393 *mapp = map;
394 return map__find_symbol(map, map->map_ip(map, addr), filter);
395 }
396
397 return NULL;
398}
399
400struct symbol *map_groups__find_symbol_by_name(struct map_groups *mg,
401 enum map_type type,
402 const char *name,
403 struct map **mapp,
404 symbol_filter_t filter)
405{
406 struct rb_node *nd;
407
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);
411
412 if (sym == NULL)
413 continue;
414 if (mapp != NULL)
415 *mapp = pos;
416 return sym;
417 }
418
419 return NULL;
420}
421
422int map_groups__find_ams(struct addr_map_symbol *ams, symbol_filter_t filter)
423{
424 if (ams->addr < ams->map->start || ams->addr > ams->map->end) {
425 if (ams->map->groups == NULL)
426 return -1;
427 ams->map = map_groups__find(ams->map->groups, ams->map->type,
428 ams->addr);
429 if (ams->map == NULL)
430 return -1;
431 }
432
433 ams->al_addr = ams->map->map_ip(ams->map, ams->addr);
434 ams->sym = map__find_symbol(ams->map, ams->al_addr, filter);
435
436 return ams->sym ? 0 : -1;
437}
438
439size_t __map_groups__fprintf_maps(struct map_groups *mg,
440 enum map_type type, int verbose, FILE *fp)
441{
442 size_t printed = fprintf(fp, "%s:\n", map_type__name[type]);
443 struct rb_node *nd;
444
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);
449 if (verbose > 2) {
450 printed += dso__fprintf(pos->dso, type, fp);
451 printed += fprintf(fp, "--\n");
452 }
453 }
454
455 return printed;
456}
457
458size_t map_groups__fprintf_maps(struct map_groups *mg, int verbose, FILE *fp)
459{
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);
463 return printed;
464}
465
466static size_t __map_groups__fprintf_removed_maps(struct map_groups *mg,
467 enum map_type type,
468 int verbose, FILE *fp)
469{
470 struct map *pos;
471 size_t printed = 0;
472
473 list_for_each_entry(pos, &mg->removed_maps[type], node) {
474 printed += fprintf(fp, "Map:");
475 printed += map__fprintf(pos, fp);
476 if (verbose > 1) {
477 printed += dso__fprintf(pos->dso, type, fp);
478 printed += fprintf(fp, "--\n");
479 }
480 }
481 return printed;
482}
483
484static size_t map_groups__fprintf_removed_maps(struct map_groups *mg,
485 int verbose, FILE *fp)
486{
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);
490 return printed;
491}
492
493size_t map_groups__fprintf(struct map_groups *mg, int verbose, FILE *fp)
494{
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);
498}
499
500int map_groups__fixup_overlappings(struct map_groups *mg, struct map *map,
501 int verbose, FILE *fp)
502{
503 struct rb_root *root = &mg->maps[map->type];
504 struct rb_node *next = rb_first(root);
505 int err = 0;
506
507 while (next) {
508 struct map *pos = rb_entry(next, struct map, rb_node);
509 next = rb_next(&pos->rb_node);
510
511 if (!map__overlap(pos, map))
512 continue;
513
514 if (verbose >= 2) {
515 fputs("overlapping maps:\n", fp);
516 map__fprintf(map, fp);
517 map__fprintf(pos, fp);
518 }
519
520 rb_erase(&pos->rb_node, root);
521 /*
522 * Now check if we need to create new maps for areas not
523 * overlapped by the new map:
524 */
525 if (map->start > pos->start) {
526 struct map *before = map__clone(pos);
527
528 if (before == NULL) {
529 err = -ENOMEM;
530 goto move_map;
531 }
532
533 before->end = map->start - 1;
534 map_groups__insert(mg, before);
535 if (verbose >= 2)
536 map__fprintf(before, fp);
537 }
538
539 if (map->end < pos->end) {
540 struct map *after = map__clone(pos);
541
542 if (after == NULL) {
543 err = -ENOMEM;
544 goto move_map;
545 }
546
547 after->start = map->end + 1;
548 map_groups__insert(mg, after);
549 if (verbose >= 2)
550 map__fprintf(after, fp);
551 }
552move_map:
553 /*
554 * If we have references, just move them to a separate list.
555 */
556 if (pos->referenced)
557 list_add_tail(&pos->node, &mg->removed_maps[map->type]);
558 else
559 map__delete(pos);
560
561 if (err)
562 return err;
563 }
564
565 return 0;
566}
567
568/*
569 * XXX This should not really _copy_ te maps, but refcount them.
570 */
571int map_groups__clone(struct map_groups *mg,
572 struct map_groups *parent, enum map_type type)
573{
574 struct rb_node *nd;
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);
578 if (new == NULL)
579 return -ENOMEM;
580 map_groups__insert(mg, new);
581 }
582 return 0;
583}
584
585void maps__insert(struct rb_root *maps, struct map *map)
586{
587 struct rb_node **p = &maps->rb_node;
588 struct rb_node *parent = NULL;
589 const u64 ip = map->start;
590 struct map *m;
591
592 while (*p != NULL) {
593 parent = *p;
594 m = rb_entry(parent, struct map, rb_node);
595 if (ip < m->start)
596 p = &(*p)->rb_left;
597 else
598 p = &(*p)->rb_right;
599 }
600
601 rb_link_node(&map->rb_node, parent, p);
602 rb_insert_color(&map->rb_node, maps);
603}
604
605void maps__remove(struct rb_root *maps, struct map *map)
606{
607 rb_erase(&map->rb_node, maps);
608}
609
610struct map *maps__find(struct rb_root *maps, u64 ip)
611{
612 struct rb_node **p = &maps->rb_node;
613 struct rb_node *parent = NULL;
614 struct map *m;
615
616 while (*p != NULL) {
617 parent = *p;
618 m = rb_entry(parent, struct map, rb_node);
619 if (ip < m->start)
620 p = &(*p)->rb_left;
621 else if (ip > m->end)
622 p = &(*p)->rb_right;
623 else
624 return m;
625 }
626
627 return NULL;
628}
629
630struct map *maps__first(struct rb_root *maps)
631{
632 struct rb_node *first = rb_first(maps);
633
634 if (first)
635 return rb_entry(first, struct map, rb_node);
636 return NULL;
637}
638
639struct map *maps__next(struct map *map)
640{
641 struct rb_node *next = rb_next(&map->rb_node);
642
643 if (next)
644 return rb_entry(next, struct map, rb_node);
645 return NULL;
646}