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// 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}