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