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