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
11const char *map_type__name[MAP__NR_TYPES] = {
12 [MAP__FUNCTION] = "Functions",
13 [MAP__VARIABLE] = "Variables",
14};
15
16static inline int is_anon_memory(const char *filename)
17{
18 return strcmp(filename, "//anon") == 0;
19}
20
21void map__init(struct map *self, enum map_type type,
22 u64 start, u64 end, u64 pgoff, struct dso *dso)
23{
24 self->type = type;
25 self->start = start;
26 self->end = end;
27 self->pgoff = pgoff;
28 self->dso = dso;
29 self->map_ip = map__map_ip;
30 self->unmap_ip = map__unmap_ip;
31 RB_CLEAR_NODE(&self->rb_node);
32 self->groups = NULL;
33 self->referenced = false;
34}
35
36struct map *map__new(struct list_head *dsos__list, u64 start, u64 len,
37 u64 pgoff, u32 pid, char *filename,
38 enum map_type type)
39{
40 struct map *self = malloc(sizeof(*self));
41
42 if (self != NULL) {
43 char newfilename[PATH_MAX];
44 struct dso *dso;
45 int anon;
46
47 anon = is_anon_memory(filename);
48
49 if (anon) {
50 snprintf(newfilename, sizeof(newfilename), "/tmp/perf-%d.map", pid);
51 filename = newfilename;
52 }
53
54 dso = __dsos__findnew(dsos__list, filename);
55 if (dso == NULL)
56 goto out_delete;
57
58 map__init(self, type, start, start + len, pgoff, dso);
59
60 if (anon) {
61set_identity:
62 self->map_ip = self->unmap_ip = identity__map_ip;
63 } else if (strcmp(filename, "[vdso]") == 0) {
64 dso__set_loaded(dso, self->type);
65 goto set_identity;
66 }
67 }
68 return self;
69out_delete:
70 free(self);
71 return NULL;
72}
73
74void map__delete(struct map *self)
75{
76 free(self);
77}
78
79void map__fixup_start(struct map *self)
80{
81 struct rb_root *symbols = &self->dso->symbols[self->type];
82 struct rb_node *nd = rb_first(symbols);
83 if (nd != NULL) {
84 struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
85 self->start = sym->start;
86 }
87}
88
89void map__fixup_end(struct map *self)
90{
91 struct rb_root *symbols = &self->dso->symbols[self->type];
92 struct rb_node *nd = rb_last(symbols);
93 if (nd != NULL) {
94 struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
95 self->end = sym->end;
96 }
97}
98
99#define DSO__DELETED "(deleted)"
100
101int map__load(struct map *self, symbol_filter_t filter)
102{
103 const char *name = self->dso->long_name;
104 int nr;
105
106 if (dso__loaded(self->dso, self->type))
107 return 0;
108
109 nr = dso__load(self->dso, self, filter);
110 if (nr < 0) {
111 if (self->dso->has_build_id) {
112 char sbuild_id[BUILD_ID_SIZE * 2 + 1];
113
114 build_id__sprintf(self->dso->build_id,
115 sizeof(self->dso->build_id),
116 sbuild_id);
117 pr_warning("%s with build id %s not found",
118 name, sbuild_id);
119 } else
120 pr_warning("Failed to open %s", name);
121
122 pr_warning(", continuing without symbols\n");
123 return -1;
124 } else if (nr == 0) {
125 const size_t len = strlen(name);
126 const size_t real_len = len - sizeof(DSO__DELETED);
127
128 if (len > sizeof(DSO__DELETED) &&
129 strcmp(name + real_len + 1, DSO__DELETED) == 0) {
130 pr_warning("%.*s was updated, restart the long "
131 "running apps that use it!\n",
132 (int)real_len, name);
133 } else {
134 pr_warning("no symbols found in %s, maybe install "
135 "a debug package?\n", name);
136 }
137
138 return -1;
139 }
140 /*
141 * Only applies to the kernel, as its symtabs aren't relative like the
142 * module ones.
143 */
144 if (self->dso->kernel)
145 map__reloc_vmlinux(self);
146
147 return 0;
148}
149
150struct symbol *map__find_symbol(struct map *self, u64 addr,
151 symbol_filter_t filter)
152{
153 if (map__load(self, filter) < 0)
154 return NULL;
155
156 return dso__find_symbol(self->dso, self->type, addr);
157}
158
159struct symbol *map__find_symbol_by_name(struct map *self, const char *name,
160 symbol_filter_t filter)
161{
162 if (map__load(self, filter) < 0)
163 return NULL;
164
165 if (!dso__sorted_by_name(self->dso, self->type))
166 dso__sort_by_name(self->dso, self->type);
167
168 return dso__find_symbol_by_name(self->dso, self->type, name);
169}
170
171struct map *map__clone(struct map *self)
172{
173 struct map *map = malloc(sizeof(*self));
174
175 if (!map)
176 return NULL;
177
178 memcpy(map, self, sizeof(*self));
179
180 return map;
181}
182
183int map__overlap(struct map *l, struct map *r)
184{
185 if (l->start > r->start) {
186 struct map *t = l;
187 l = r;
188 r = t;
189 }
190
191 if (l->end > r->start)
192 return 1;
193
194 return 0;
195}
196
197size_t map__fprintf(struct map *self, FILE *fp)
198{
199 return fprintf(fp, " %" PRIx64 "-%" PRIx64 " %" PRIx64 " %s\n",
200 self->start, self->end, self->pgoff, self->dso->name);
201}
202
203/*
204 * objdump wants/reports absolute IPs for ET_EXEC, and RIPs for ET_DYN.
205 * map->dso->adjust_symbols==1 for ET_EXEC-like cases.
206 */
207u64 map__rip_2objdump(struct map *map, u64 rip)
208{
209 u64 addr = map->dso->adjust_symbols ?
210 map->unmap_ip(map, rip) : /* RIP -> IP */
211 rip;
212 return addr;
213}
214
215u64 map__objdump_2ip(struct map *map, u64 addr)
216{
217 u64 ip = map->dso->adjust_symbols ?
218 addr :
219 map->unmap_ip(map, addr); /* RIP -> IP */
220 return ip;
221}
222
223void map_groups__init(struct map_groups *self)
224{
225 int i;
226 for (i = 0; i < MAP__NR_TYPES; ++i) {
227 self->maps[i] = RB_ROOT;
228 INIT_LIST_HEAD(&self->removed_maps[i]);
229 }
230 self->machine = NULL;
231}
232
233static void maps__delete(struct rb_root *self)
234{
235 struct rb_node *next = rb_first(self);
236
237 while (next) {
238 struct map *pos = rb_entry(next, struct map, rb_node);
239
240 next = rb_next(&pos->rb_node);
241 rb_erase(&pos->rb_node, self);
242 map__delete(pos);
243 }
244}
245
246static void maps__delete_removed(struct list_head *self)
247{
248 struct map *pos, *n;
249
250 list_for_each_entry_safe(pos, n, self, node) {
251 list_del(&pos->node);
252 map__delete(pos);
253 }
254}
255
256void map_groups__exit(struct map_groups *self)
257{
258 int i;
259
260 for (i = 0; i < MAP__NR_TYPES; ++i) {
261 maps__delete(&self->maps[i]);
262 maps__delete_removed(&self->removed_maps[i]);
263 }
264}
265
266void map_groups__flush(struct map_groups *self)
267{
268 int type;
269
270 for (type = 0; type < MAP__NR_TYPES; type++) {
271 struct rb_root *root = &self->maps[type];
272 struct rb_node *next = rb_first(root);
273
274 while (next) {
275 struct map *pos = rb_entry(next, struct map, rb_node);
276 next = rb_next(&pos->rb_node);
277 rb_erase(&pos->rb_node, root);
278 /*
279 * We may have references to this map, for
280 * instance in some hist_entry instances, so
281 * just move them to a separate list.
282 */
283 list_add_tail(&pos->node, &self->removed_maps[pos->type]);
284 }
285 }
286}
287
288struct symbol *map_groups__find_symbol(struct map_groups *self,
289 enum map_type type, u64 addr,
290 struct map **mapp,
291 symbol_filter_t filter)
292{
293 struct map *map = map_groups__find(self, type, addr);
294
295 if (map != NULL) {
296 if (mapp != NULL)
297 *mapp = map;
298 return map__find_symbol(map, map->map_ip(map, addr), filter);
299 }
300
301 return NULL;
302}
303
304struct symbol *map_groups__find_symbol_by_name(struct map_groups *self,
305 enum map_type type,
306 const char *name,
307 struct map **mapp,
308 symbol_filter_t filter)
309{
310 struct rb_node *nd;
311
312 for (nd = rb_first(&self->maps[type]); nd; nd = rb_next(nd)) {
313 struct map *pos = rb_entry(nd, struct map, rb_node);
314 struct symbol *sym = map__find_symbol_by_name(pos, name, filter);
315
316 if (sym == NULL)
317 continue;
318 if (mapp != NULL)
319 *mapp = pos;
320 return sym;
321 }
322
323 return NULL;
324}
325
326size_t __map_groups__fprintf_maps(struct map_groups *self,
327 enum map_type type, int verbose, FILE *fp)
328{
329 size_t printed = fprintf(fp, "%s:\n", map_type__name[type]);
330 struct rb_node *nd;
331
332 for (nd = rb_first(&self->maps[type]); nd; nd = rb_next(nd)) {
333 struct map *pos = rb_entry(nd, struct map, rb_node);
334 printed += fprintf(fp, "Map:");
335 printed += map__fprintf(pos, fp);
336 if (verbose > 2) {
337 printed += dso__fprintf(pos->dso, type, fp);
338 printed += fprintf(fp, "--\n");
339 }
340 }
341
342 return printed;
343}
344
345size_t map_groups__fprintf_maps(struct map_groups *self, int verbose, FILE *fp)
346{
347 size_t printed = 0, i;
348 for (i = 0; i < MAP__NR_TYPES; ++i)
349 printed += __map_groups__fprintf_maps(self, i, verbose, fp);
350 return printed;
351}
352
353static size_t __map_groups__fprintf_removed_maps(struct map_groups *self,
354 enum map_type type,
355 int verbose, FILE *fp)
356{
357 struct map *pos;
358 size_t printed = 0;
359
360 list_for_each_entry(pos, &self->removed_maps[type], node) {
361 printed += fprintf(fp, "Map:");
362 printed += map__fprintf(pos, fp);
363 if (verbose > 1) {
364 printed += dso__fprintf(pos->dso, type, fp);
365 printed += fprintf(fp, "--\n");
366 }
367 }
368 return printed;
369}
370
371static size_t map_groups__fprintf_removed_maps(struct map_groups *self,
372 int verbose, FILE *fp)
373{
374 size_t printed = 0, i;
375 for (i = 0; i < MAP__NR_TYPES; ++i)
376 printed += __map_groups__fprintf_removed_maps(self, i, verbose, fp);
377 return printed;
378}
379
380size_t map_groups__fprintf(struct map_groups *self, int verbose, FILE *fp)
381{
382 size_t printed = map_groups__fprintf_maps(self, verbose, fp);
383 printed += fprintf(fp, "Removed maps:\n");
384 return printed + map_groups__fprintf_removed_maps(self, verbose, fp);
385}
386
387int map_groups__fixup_overlappings(struct map_groups *self, struct map *map,
388 int verbose, FILE *fp)
389{
390 struct rb_root *root = &self->maps[map->type];
391 struct rb_node *next = rb_first(root);
392 int err = 0;
393
394 while (next) {
395 struct map *pos = rb_entry(next, struct map, rb_node);
396 next = rb_next(&pos->rb_node);
397
398 if (!map__overlap(pos, map))
399 continue;
400
401 if (verbose >= 2) {
402 fputs("overlapping maps:\n", fp);
403 map__fprintf(map, fp);
404 map__fprintf(pos, fp);
405 }
406
407 rb_erase(&pos->rb_node, root);
408 /*
409 * Now check if we need to create new maps for areas not
410 * overlapped by the new map:
411 */
412 if (map->start > pos->start) {
413 struct map *before = map__clone(pos);
414
415 if (before == NULL) {
416 err = -ENOMEM;
417 goto move_map;
418 }
419
420 before->end = map->start - 1;
421 map_groups__insert(self, before);
422 if (verbose >= 2)
423 map__fprintf(before, fp);
424 }
425
426 if (map->end < pos->end) {
427 struct map *after = map__clone(pos);
428
429 if (after == NULL) {
430 err = -ENOMEM;
431 goto move_map;
432 }
433
434 after->start = map->end + 1;
435 map_groups__insert(self, after);
436 if (verbose >= 2)
437 map__fprintf(after, fp);
438 }
439move_map:
440 /*
441 * If we have references, just move them to a separate list.
442 */
443 if (pos->referenced)
444 list_add_tail(&pos->node, &self->removed_maps[map->type]);
445 else
446 map__delete(pos);
447
448 if (err)
449 return err;
450 }
451
452 return 0;
453}
454
455/*
456 * XXX This should not really _copy_ te maps, but refcount them.
457 */
458int map_groups__clone(struct map_groups *self,
459 struct map_groups *parent, enum map_type type)
460{
461 struct rb_node *nd;
462 for (nd = rb_first(&parent->maps[type]); nd; nd = rb_next(nd)) {
463 struct map *map = rb_entry(nd, struct map, rb_node);
464 struct map *new = map__clone(map);
465 if (new == NULL)
466 return -ENOMEM;
467 map_groups__insert(self, new);
468 }
469 return 0;
470}
471
472static u64 map__reloc_map_ip(struct map *map, u64 ip)
473{
474 return ip + (s64)map->pgoff;
475}
476
477static u64 map__reloc_unmap_ip(struct map *map, u64 ip)
478{
479 return ip - (s64)map->pgoff;
480}
481
482void map__reloc_vmlinux(struct map *self)
483{
484 struct kmap *kmap = map__kmap(self);
485 s64 reloc;
486
487 if (!kmap->ref_reloc_sym || !kmap->ref_reloc_sym->unrelocated_addr)
488 return;
489
490 reloc = (kmap->ref_reloc_sym->unrelocated_addr -
491 kmap->ref_reloc_sym->addr);
492
493 if (!reloc)
494 return;
495
496 self->map_ip = map__reloc_map_ip;
497 self->unmap_ip = map__reloc_unmap_ip;
498 self->pgoff = reloc;
499}
500
501void maps__insert(struct rb_root *maps, struct map *map)
502{
503 struct rb_node **p = &maps->rb_node;
504 struct rb_node *parent = NULL;
505 const u64 ip = map->start;
506 struct map *m;
507
508 while (*p != NULL) {
509 parent = *p;
510 m = rb_entry(parent, struct map, rb_node);
511 if (ip < m->start)
512 p = &(*p)->rb_left;
513 else
514 p = &(*p)->rb_right;
515 }
516
517 rb_link_node(&map->rb_node, parent, p);
518 rb_insert_color(&map->rb_node, maps);
519}
520
521void maps__remove(struct rb_root *self, struct map *map)
522{
523 rb_erase(&map->rb_node, self);
524}
525
526struct map *maps__find(struct rb_root *maps, u64 ip)
527{
528 struct rb_node **p = &maps->rb_node;
529 struct rb_node *parent = NULL;
530 struct map *m;
531
532 while (*p != NULL) {
533 parent = *p;
534 m = rb_entry(parent, struct map, rb_node);
535 if (ip < m->start)
536 p = &(*p)->rb_left;
537 else if (ip > m->end)
538 p = &(*p)->rb_right;
539 else
540 return m;
541 }
542
543 return NULL;
544}
545
546int machine__init(struct machine *self, const char *root_dir, pid_t pid)
547{
548 map_groups__init(&self->kmaps);
549 RB_CLEAR_NODE(&self->rb_node);
550 INIT_LIST_HEAD(&self->user_dsos);
551 INIT_LIST_HEAD(&self->kernel_dsos);
552
553 self->kmaps.machine = self;
554 self->pid = pid;
555 self->root_dir = strdup(root_dir);
556 return self->root_dir == NULL ? -ENOMEM : 0;
557}
558
559static void dsos__delete(struct list_head *self)
560{
561 struct dso *pos, *n;
562
563 list_for_each_entry_safe(pos, n, self, node) {
564 list_del(&pos->node);
565 dso__delete(pos);
566 }
567}
568
569void machine__exit(struct machine *self)
570{
571 map_groups__exit(&self->kmaps);
572 dsos__delete(&self->user_dsos);
573 dsos__delete(&self->kernel_dsos);
574 free(self->root_dir);
575 self->root_dir = NULL;
576}
577
578void machine__delete(struct machine *self)
579{
580 machine__exit(self);
581 free(self);
582}
583
584struct machine *machines__add(struct rb_root *self, pid_t pid,
585 const char *root_dir)
586{
587 struct rb_node **p = &self->rb_node;
588 struct rb_node *parent = NULL;
589 struct machine *pos, *machine = malloc(sizeof(*machine));
590
591 if (!machine)
592 return NULL;
593
594 if (machine__init(machine, root_dir, pid) != 0) {
595 free(machine);
596 return NULL;
597 }
598
599 while (*p != NULL) {
600 parent = *p;
601 pos = rb_entry(parent, struct machine, rb_node);
602 if (pid < pos->pid)
603 p = &(*p)->rb_left;
604 else
605 p = &(*p)->rb_right;
606 }
607
608 rb_link_node(&machine->rb_node, parent, p);
609 rb_insert_color(&machine->rb_node, self);
610
611 return machine;
612}
613
614struct machine *machines__find(struct rb_root *self, pid_t pid)
615{
616 struct rb_node **p = &self->rb_node;
617 struct rb_node *parent = NULL;
618 struct machine *machine;
619 struct machine *default_machine = NULL;
620
621 while (*p != NULL) {
622 parent = *p;
623 machine = rb_entry(parent, struct machine, rb_node);
624 if (pid < machine->pid)
625 p = &(*p)->rb_left;
626 else if (pid > machine->pid)
627 p = &(*p)->rb_right;
628 else
629 return machine;
630 if (!machine->pid)
631 default_machine = machine;
632 }
633
634 return default_machine;
635}
636
637struct machine *machines__findnew(struct rb_root *self, pid_t pid)
638{
639 char path[PATH_MAX];
640 const char *root_dir;
641 struct machine *machine = machines__find(self, pid);
642
643 if (!machine || machine->pid != pid) {
644 if (pid == HOST_KERNEL_ID || pid == DEFAULT_GUEST_KERNEL_ID)
645 root_dir = "";
646 else {
647 if (!symbol_conf.guestmount)
648 goto out;
649 sprintf(path, "%s/%d", symbol_conf.guestmount, pid);
650 if (access(path, R_OK)) {
651 pr_err("Can't access file %s\n", path);
652 goto out;
653 }
654 root_dir = path;
655 }
656 machine = machines__add(self, pid, root_dir);
657 }
658
659out:
660 return machine;
661}
662
663void machines__process(struct rb_root *self, machine__process_t process, void *data)
664{
665 struct rb_node *nd;
666
667 for (nd = rb_first(self); nd; nd = rb_next(nd)) {
668 struct machine *pos = rb_entry(nd, struct machine, rb_node);
669 process(pos, data);
670 }
671}
672
673char *machine__mmap_name(struct machine *self, char *bf, size_t size)
674{
675 if (machine__is_host(self))
676 snprintf(bf, size, "[%s]", "kernel.kallsyms");
677 else if (machine__is_default_guest(self))
678 snprintf(bf, size, "[%s]", "guest.kernel.kallsyms");
679 else
680 snprintf(bf, size, "[%s.%d]", "guest.kernel.kallsyms", self->pid);
681
682 return bf;
683}