Loading...
1// SPDX-License-Identifier: GPL-2.0
2#include <inttypes.h>
3#include <limits.h>
4#include <stdio.h>
5#include <stdlib.h>
6#include <string.h>
7#include <linux/string.h>
8#include <linux/zalloc.h>
9#include <uapi/linux/mman.h> /* To get things like MAP_HUGETLB even on older libc headers */
10#include "debug.h"
11#include "dso.h"
12#include "map.h"
13#include "namespaces.h"
14#include "srcline.h"
15#include "symbol.h"
16#include "thread.h"
17#include "vdso.h"
18
19static inline int is_android_lib(const char *filename)
20{
21 return strstarts(filename, "/data/app-lib/") ||
22 strstarts(filename, "/system/lib/");
23}
24
25static inline bool replace_android_lib(const char *filename, char *newfilename)
26{
27 const char *libname;
28 char *app_abi;
29 size_t app_abi_length, new_length;
30 size_t lib_length = 0;
31
32 libname = strrchr(filename, '/');
33 if (libname)
34 lib_length = strlen(libname);
35
36 app_abi = getenv("APP_ABI");
37 if (!app_abi)
38 return false;
39
40 app_abi_length = strlen(app_abi);
41
42 if (strstarts(filename, "/data/app-lib/")) {
43 char *apk_path;
44
45 if (!app_abi_length)
46 return false;
47
48 new_length = 7 + app_abi_length + lib_length;
49
50 apk_path = getenv("APK_PATH");
51 if (apk_path) {
52 new_length += strlen(apk_path) + 1;
53 if (new_length > PATH_MAX)
54 return false;
55 snprintf(newfilename, new_length,
56 "%s/libs/%s/%s", apk_path, app_abi, libname);
57 } else {
58 if (new_length > PATH_MAX)
59 return false;
60 snprintf(newfilename, new_length,
61 "libs/%s/%s", app_abi, libname);
62 }
63 return true;
64 }
65
66 if (strstarts(filename, "/system/lib/")) {
67 char *ndk, *app;
68 const char *arch;
69 int ndk_length, app_length;
70
71 ndk = getenv("NDK_ROOT");
72 app = getenv("APP_PLATFORM");
73
74 if (!(ndk && app))
75 return false;
76
77 ndk_length = strlen(ndk);
78 app_length = strlen(app);
79
80 if (!(ndk_length && app_length && app_abi_length))
81 return false;
82
83 arch = !strncmp(app_abi, "arm", 3) ? "arm" :
84 !strncmp(app_abi, "mips", 4) ? "mips" :
85 !strncmp(app_abi, "x86", 3) ? "x86" : NULL;
86
87 if (!arch)
88 return false;
89
90 new_length = 27 + ndk_length +
91 app_length + lib_length
92 + strlen(arch);
93
94 if (new_length > PATH_MAX)
95 return false;
96 snprintf(newfilename, new_length,
97 "%.*s/platforms/%.*s/arch-%s/usr/lib/%s",
98 ndk_length, ndk, app_length, app, arch, libname);
99
100 return true;
101 }
102 return false;
103}
104
105void map__init(struct map *map, u64 start, u64 end, u64 pgoff, struct dso *dso)
106{
107 map->start = start;
108 map->end = end;
109 map->pgoff = pgoff;
110 map->reloc = 0;
111 map->dso = dso__get(dso);
112 map->map_ip = map__map_ip;
113 map->unmap_ip = map__unmap_ip;
114 RB_CLEAR_NODE(&map->rb_node);
115 map->erange_warned = false;
116 refcount_set(&map->refcnt, 1);
117}
118
119struct map *map__new(struct machine *machine, u64 start, u64 len,
120 u64 pgoff, struct dso_id *id,
121 u32 prot, u32 flags, struct build_id *bid,
122 char *filename, struct thread *thread)
123{
124 struct map *map = malloc(sizeof(*map));
125 struct nsinfo *nsi = NULL;
126 struct nsinfo *nnsi;
127
128 if (map != NULL) {
129 char newfilename[PATH_MAX];
130 struct dso *dso, *header_bid_dso;
131 int anon, no_dso, vdso, android;
132
133 android = is_android_lib(filename);
134 anon = is_anon_memory(filename) || flags & MAP_HUGETLB;
135 vdso = is_vdso_map(filename);
136 no_dso = is_no_dso_memory(filename);
137 map->prot = prot;
138 map->flags = flags;
139 nsi = nsinfo__get(thread->nsinfo);
140
141 if ((anon || no_dso) && nsi && (prot & PROT_EXEC)) {
142 snprintf(newfilename, sizeof(newfilename),
143 "/tmp/perf-%d.map", nsinfo__pid(nsi));
144 filename = newfilename;
145 }
146
147 if (android) {
148 if (replace_android_lib(filename, newfilename))
149 filename = newfilename;
150 }
151
152 if (vdso) {
153 /* The vdso maps are always on the host and not the
154 * container. Ensure that we don't use setns to look
155 * them up.
156 */
157 nnsi = nsinfo__copy(nsi);
158 if (nnsi) {
159 nsinfo__put(nsi);
160 nsinfo__clear_need_setns(nnsi);
161 nsi = nnsi;
162 }
163 pgoff = 0;
164 dso = machine__findnew_vdso(machine, thread);
165 } else
166 dso = machine__findnew_dso_id(machine, filename, id);
167
168 if (dso == NULL)
169 goto out_delete;
170
171 map__init(map, start, start + len, pgoff, dso);
172
173 if (anon || no_dso) {
174 map->map_ip = map->unmap_ip = identity__map_ip;
175
176 /*
177 * Set memory without DSO as loaded. All map__find_*
178 * functions still return NULL, and we avoid the
179 * unnecessary map__load warning.
180 */
181 if (!(prot & PROT_EXEC))
182 dso__set_loaded(dso);
183 }
184 mutex_lock(&dso->lock);
185 nsinfo__put(dso->nsinfo);
186 dso->nsinfo = nsi;
187 mutex_unlock(&dso->lock);
188
189 if (build_id__is_defined(bid)) {
190 dso__set_build_id(dso, bid);
191 } else {
192 /*
193 * If the mmap event had no build ID, search for an existing dso from the
194 * build ID header by name. Otherwise only the dso loaded at the time of
195 * reading the header will have the build ID set and all future mmaps will
196 * have it missing.
197 */
198 down_read(&machine->dsos.lock);
199 header_bid_dso = __dsos__find(&machine->dsos, filename, false);
200 up_read(&machine->dsos.lock);
201 if (header_bid_dso && header_bid_dso->header_build_id) {
202 dso__set_build_id(dso, &header_bid_dso->bid);
203 dso->header_build_id = 1;
204 }
205 }
206 dso__put(dso);
207 }
208 return map;
209out_delete:
210 nsinfo__put(nsi);
211 free(map);
212 return NULL;
213}
214
215/*
216 * Constructor variant for modules (where we know from /proc/modules where
217 * they are loaded) and for vmlinux, where only after we load all the
218 * symbols we'll know where it starts and ends.
219 */
220struct map *map__new2(u64 start, struct dso *dso)
221{
222 struct map *map = calloc(1, (sizeof(*map) +
223 (dso->kernel ? sizeof(struct kmap) : 0)));
224 if (map != NULL) {
225 /*
226 * ->end will be filled after we load all the symbols
227 */
228 map__init(map, start, 0, 0, dso);
229 }
230
231 return map;
232}
233
234bool __map__is_kernel(const struct map *map)
235{
236 if (!map->dso->kernel)
237 return false;
238 return machine__kernel_map(map__kmaps((struct map *)map)->machine) == map;
239}
240
241bool __map__is_extra_kernel_map(const struct map *map)
242{
243 struct kmap *kmap = __map__kmap((struct map *)map);
244
245 return kmap && kmap->name[0];
246}
247
248bool __map__is_bpf_prog(const struct map *map)
249{
250 const char *name;
251
252 if (map->dso->binary_type == DSO_BINARY_TYPE__BPF_PROG_INFO)
253 return true;
254
255 /*
256 * If PERF_RECORD_BPF_EVENT is not included, the dso will not have
257 * type of DSO_BINARY_TYPE__BPF_PROG_INFO. In such cases, we can
258 * guess the type based on name.
259 */
260 name = map->dso->short_name;
261 return name && (strstr(name, "bpf_prog_") == name);
262}
263
264bool __map__is_bpf_image(const struct map *map)
265{
266 const char *name;
267
268 if (map->dso->binary_type == DSO_BINARY_TYPE__BPF_IMAGE)
269 return true;
270
271 /*
272 * If PERF_RECORD_KSYMBOL is not included, the dso will not have
273 * type of DSO_BINARY_TYPE__BPF_IMAGE. In such cases, we can
274 * guess the type based on name.
275 */
276 name = map->dso->short_name;
277 return name && is_bpf_image(name);
278}
279
280bool __map__is_ool(const struct map *map)
281{
282 return map->dso && map->dso->binary_type == DSO_BINARY_TYPE__OOL;
283}
284
285bool map__has_symbols(const struct map *map)
286{
287 return dso__has_symbols(map->dso);
288}
289
290static void map__exit(struct map *map)
291{
292 BUG_ON(refcount_read(&map->refcnt) != 0);
293 dso__zput(map->dso);
294}
295
296void map__delete(struct map *map)
297{
298 map__exit(map);
299 free(map);
300}
301
302void map__put(struct map *map)
303{
304 if (map && refcount_dec_and_test(&map->refcnt))
305 map__delete(map);
306}
307
308void map__fixup_start(struct map *map)
309{
310 struct rb_root_cached *symbols = &map->dso->symbols;
311 struct rb_node *nd = rb_first_cached(symbols);
312 if (nd != NULL) {
313 struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
314 map->start = sym->start;
315 }
316}
317
318void map__fixup_end(struct map *map)
319{
320 struct rb_root_cached *symbols = &map->dso->symbols;
321 struct rb_node *nd = rb_last(&symbols->rb_root);
322 if (nd != NULL) {
323 struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
324 map->end = sym->end;
325 }
326}
327
328#define DSO__DELETED "(deleted)"
329
330int map__load(struct map *map)
331{
332 const char *name = map->dso->long_name;
333 int nr;
334
335 if (dso__loaded(map->dso))
336 return 0;
337
338 nr = dso__load(map->dso, map);
339 if (nr < 0) {
340 if (map->dso->has_build_id) {
341 char sbuild_id[SBUILD_ID_SIZE];
342
343 build_id__sprintf(&map->dso->bid, sbuild_id);
344 pr_debug("%s with build id %s not found", name, sbuild_id);
345 } else
346 pr_debug("Failed to open %s", name);
347
348 pr_debug(", continuing without symbols\n");
349 return -1;
350 } else if (nr == 0) {
351#ifdef HAVE_LIBELF_SUPPORT
352 const size_t len = strlen(name);
353 const size_t real_len = len - sizeof(DSO__DELETED);
354
355 if (len > sizeof(DSO__DELETED) &&
356 strcmp(name + real_len + 1, DSO__DELETED) == 0) {
357 pr_debug("%.*s was updated (is prelink enabled?). "
358 "Restart the long running apps that use it!\n",
359 (int)real_len, name);
360 } else {
361 pr_debug("no symbols found in %s, maybe install a debug package?\n", name);
362 }
363#endif
364 return -1;
365 }
366
367 return 0;
368}
369
370struct symbol *map__find_symbol(struct map *map, u64 addr)
371{
372 if (map__load(map) < 0)
373 return NULL;
374
375 return dso__find_symbol(map->dso, addr);
376}
377
378struct symbol *map__find_symbol_by_name(struct map *map, const char *name)
379{
380 if (map__load(map) < 0)
381 return NULL;
382
383 if (!dso__sorted_by_name(map->dso))
384 dso__sort_by_name(map->dso);
385
386 return dso__find_symbol_by_name(map->dso, name);
387}
388
389struct map *map__clone(struct map *from)
390{
391 size_t size = sizeof(struct map);
392 struct map *map;
393
394 if (from->dso && from->dso->kernel)
395 size += sizeof(struct kmap);
396
397 map = memdup(from, size);
398 if (map != NULL) {
399 refcount_set(&map->refcnt, 1);
400 RB_CLEAR_NODE(&map->rb_node);
401 dso__get(map->dso);
402 }
403
404 return map;
405}
406
407size_t map__fprintf(struct map *map, FILE *fp)
408{
409 return fprintf(fp, " %" PRIx64 "-%" PRIx64 " %" PRIx64 " %s\n",
410 map->start, map->end, map->pgoff, map->dso->name);
411}
412
413size_t map__fprintf_dsoname(struct map *map, FILE *fp)
414{
415 char buf[symbol_conf.pad_output_len_dso + 1];
416 const char *dsoname = "[unknown]";
417
418 if (map && map->dso) {
419 if (symbol_conf.show_kernel_path && map->dso->long_name)
420 dsoname = map->dso->long_name;
421 else
422 dsoname = map->dso->name;
423 }
424
425 if (symbol_conf.pad_output_len_dso) {
426 scnprintf_pad(buf, symbol_conf.pad_output_len_dso, "%s", dsoname);
427 dsoname = buf;
428 }
429
430 return fprintf(fp, "%s", dsoname);
431}
432
433char *map__srcline(struct map *map, u64 addr, struct symbol *sym)
434{
435 if (map == NULL)
436 return SRCLINE_UNKNOWN;
437 return get_srcline(map->dso, map__rip_2objdump(map, addr), sym, true, true, addr);
438}
439
440int map__fprintf_srcline(struct map *map, u64 addr, const char *prefix,
441 FILE *fp)
442{
443 int ret = 0;
444
445 if (map && map->dso) {
446 char *srcline = map__srcline(map, addr, NULL);
447 if (strncmp(srcline, SRCLINE_UNKNOWN, strlen(SRCLINE_UNKNOWN)) != 0)
448 ret = fprintf(fp, "%s%s", prefix, srcline);
449 free_srcline(srcline);
450 }
451 return ret;
452}
453
454void srccode_state_free(struct srccode_state *state)
455{
456 zfree(&state->srcfile);
457 state->line = 0;
458}
459
460/**
461 * map__rip_2objdump - convert symbol start address to objdump address.
462 * @map: memory map
463 * @rip: symbol start address
464 *
465 * objdump wants/reports absolute IPs for ET_EXEC, and RIPs for ET_DYN.
466 * map->dso->adjust_symbols==1 for ET_EXEC-like cases except ET_REL which is
467 * relative to section start.
468 *
469 * Return: Address suitable for passing to "objdump --start-address="
470 */
471u64 map__rip_2objdump(struct map *map, u64 rip)
472{
473 struct kmap *kmap = __map__kmap(map);
474
475 /*
476 * vmlinux does not have program headers for PTI entry trampolines and
477 * kcore may not either. However the trampoline object code is on the
478 * main kernel map, so just use that instead.
479 */
480 if (kmap && is_entry_trampoline(kmap->name) && kmap->kmaps && kmap->kmaps->machine) {
481 struct map *kernel_map = machine__kernel_map(kmap->kmaps->machine);
482
483 if (kernel_map)
484 map = kernel_map;
485 }
486
487 if (!map->dso->adjust_symbols)
488 return rip;
489
490 if (map->dso->rel)
491 return rip - map->pgoff;
492
493 /*
494 * kernel modules also have DSO_TYPE_USER in dso->kernel,
495 * but all kernel modules are ET_REL, so won't get here.
496 */
497 if (map->dso->kernel == DSO_SPACE__USER)
498 return rip + map->dso->text_offset;
499
500 return map->unmap_ip(map, rip) - map->reloc;
501}
502
503/**
504 * map__objdump_2mem - convert objdump address to a memory address.
505 * @map: memory map
506 * @ip: objdump address
507 *
508 * Closely related to map__rip_2objdump(), this function takes an address from
509 * objdump and converts it to a memory address. Note this assumes that @map
510 * contains the address. To be sure the result is valid, check it forwards
511 * e.g. map__rip_2objdump(map->map_ip(map, map__objdump_2mem(map, ip))) == ip
512 *
513 * Return: Memory address.
514 */
515u64 map__objdump_2mem(struct map *map, u64 ip)
516{
517 if (!map->dso->adjust_symbols)
518 return map->unmap_ip(map, ip);
519
520 if (map->dso->rel)
521 return map->unmap_ip(map, ip + map->pgoff);
522
523 /*
524 * kernel modules also have DSO_TYPE_USER in dso->kernel,
525 * but all kernel modules are ET_REL, so won't get here.
526 */
527 if (map->dso->kernel == DSO_SPACE__USER)
528 return map->unmap_ip(map, ip - map->dso->text_offset);
529
530 return ip + map->reloc;
531}
532
533bool map__contains_symbol(const struct map *map, const struct symbol *sym)
534{
535 u64 ip = map->unmap_ip(map, sym->start);
536
537 return ip >= map->start && ip < map->end;
538}
539
540static struct map *__map__next(struct map *map)
541{
542 struct rb_node *next = rb_next(&map->rb_node);
543
544 if (next)
545 return rb_entry(next, struct map, rb_node);
546 return NULL;
547}
548
549struct map *map__next(struct map *map)
550{
551 return map ? __map__next(map) : NULL;
552}
553
554struct kmap *__map__kmap(struct map *map)
555{
556 if (!map->dso || !map->dso->kernel)
557 return NULL;
558 return (struct kmap *)(map + 1);
559}
560
561struct kmap *map__kmap(struct map *map)
562{
563 struct kmap *kmap = __map__kmap(map);
564
565 if (!kmap)
566 pr_err("Internal error: map__kmap with a non-kernel map\n");
567 return kmap;
568}
569
570struct maps *map__kmaps(struct map *map)
571{
572 struct kmap *kmap = map__kmap(map);
573
574 if (!kmap || !kmap->kmaps) {
575 pr_err("Internal error: map__kmaps with a non-kernel map\n");
576 return NULL;
577 }
578 return kmap->kmaps;
579}
580
581u64 map__map_ip(const struct map *map, u64 ip)
582{
583 return ip - map->start + map->pgoff;
584}
585
586u64 map__unmap_ip(const struct map *map, u64 ip)
587{
588 return ip + map->start - map->pgoff;
589}
590
591u64 identity__map_ip(const struct map *map __maybe_unused, u64 ip)
592{
593 return ip;
594}
1#include "symbol.h"
2#include <errno.h>
3#include <inttypes.h>
4#include <limits.h>
5#include <stdlib.h>
6#include <string.h>
7#include <stdio.h>
8#include <unistd.h>
9#include "map.h"
10#include "thread.h"
11#include "strlist.h"
12#include "vdso.h"
13#include "build-id.h"
14#include "util.h"
15#include <linux/string.h>
16
17const char *map_type__name[MAP__NR_TYPES] = {
18 [MAP__FUNCTION] = "Functions",
19 [MAP__VARIABLE] = "Variables",
20};
21
22static inline int is_anon_memory(const char *filename)
23{
24 return !strcmp(filename, "//anon") ||
25 !strcmp(filename, "/dev/zero (deleted)") ||
26 !strcmp(filename, "/anon_hugepage (deleted)");
27}
28
29static inline int is_no_dso_memory(const char *filename)
30{
31 return !strncmp(filename, "[stack", 6) ||
32 !strcmp(filename, "[heap]");
33}
34
35void map__init(struct map *map, enum map_type type,
36 u64 start, u64 end, u64 pgoff, struct dso *dso)
37{
38 map->type = type;
39 map->start = start;
40 map->end = end;
41 map->pgoff = pgoff;
42 map->reloc = 0;
43 map->dso = dso;
44 map->map_ip = map__map_ip;
45 map->unmap_ip = map__unmap_ip;
46 RB_CLEAR_NODE(&map->rb_node);
47 map->groups = NULL;
48 map->referenced = false;
49 map->erange_warned = false;
50}
51
52struct map *map__new(struct list_head *dsos__list, u64 start, u64 len,
53 u64 pgoff, u32 pid, u32 d_maj, u32 d_min, u64 ino,
54 u64 ino_gen, char *filename,
55 enum map_type type)
56{
57 struct map *map = malloc(sizeof(*map));
58
59 if (map != NULL) {
60 char newfilename[PATH_MAX];
61 struct dso *dso;
62 int anon, no_dso, vdso;
63
64 anon = is_anon_memory(filename);
65 vdso = is_vdso_map(filename);
66 no_dso = is_no_dso_memory(filename);
67
68 map->maj = d_maj;
69 map->min = d_min;
70 map->ino = ino;
71 map->ino_generation = ino_gen;
72
73 if ((anon || no_dso) && type == MAP__FUNCTION) {
74 snprintf(newfilename, sizeof(newfilename), "/tmp/perf-%d.map", pid);
75 filename = newfilename;
76 }
77
78 if (vdso) {
79 pgoff = 0;
80 dso = vdso__dso_findnew(dsos__list);
81 } else
82 dso = __dsos__findnew(dsos__list, filename);
83
84 if (dso == NULL)
85 goto out_delete;
86
87 map__init(map, type, start, start + len, pgoff, dso);
88
89 if (anon || no_dso) {
90 map->map_ip = map->unmap_ip = identity__map_ip;
91
92 /*
93 * Set memory without DSO as loaded. All map__find_*
94 * functions still return NULL, and we avoid the
95 * unnecessary map__load warning.
96 */
97 if (type != MAP__FUNCTION)
98 dso__set_loaded(dso, map->type);
99 }
100 }
101 return map;
102out_delete:
103 free(map);
104 return NULL;
105}
106
107/*
108 * Constructor variant for modules (where we know from /proc/modules where
109 * they are loaded) and for vmlinux, where only after we load all the
110 * symbols we'll know where it starts and ends.
111 */
112struct map *map__new2(u64 start, struct dso *dso, enum map_type type)
113{
114 struct map *map = calloc(1, (sizeof(*map) +
115 (dso->kernel ? sizeof(struct kmap) : 0)));
116 if (map != NULL) {
117 /*
118 * ->end will be filled after we load all the symbols
119 */
120 map__init(map, type, start, 0, 0, dso);
121 }
122
123 return map;
124}
125
126void map__delete(struct map *map)
127{
128 free(map);
129}
130
131void map__fixup_start(struct map *map)
132{
133 struct rb_root *symbols = &map->dso->symbols[map->type];
134 struct rb_node *nd = rb_first(symbols);
135 if (nd != NULL) {
136 struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
137 map->start = sym->start;
138 }
139}
140
141void map__fixup_end(struct map *map)
142{
143 struct rb_root *symbols = &map->dso->symbols[map->type];
144 struct rb_node *nd = rb_last(symbols);
145 if (nd != NULL) {
146 struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
147 map->end = sym->end;
148 }
149}
150
151#define DSO__DELETED "(deleted)"
152
153int map__load(struct map *map, symbol_filter_t filter)
154{
155 const char *name = map->dso->long_name;
156 int nr;
157
158 if (dso__loaded(map->dso, map->type))
159 return 0;
160
161 nr = dso__load(map->dso, map, filter);
162 if (nr < 0) {
163 if (map->dso->has_build_id) {
164 char sbuild_id[BUILD_ID_SIZE * 2 + 1];
165
166 build_id__sprintf(map->dso->build_id,
167 sizeof(map->dso->build_id),
168 sbuild_id);
169 pr_warning("%s with build id %s not found",
170 name, sbuild_id);
171 } else
172 pr_warning("Failed to open %s", name);
173
174 pr_warning(", continuing without symbols\n");
175 return -1;
176 } else if (nr == 0) {
177#ifdef HAVE_LIBELF_SUPPORT
178 const size_t len = strlen(name);
179 const size_t real_len = len - sizeof(DSO__DELETED);
180
181 if (len > sizeof(DSO__DELETED) &&
182 strcmp(name + real_len + 1, DSO__DELETED) == 0) {
183 pr_warning("%.*s was updated (is prelink enabled?). "
184 "Restart the long running apps that use it!\n",
185 (int)real_len, name);
186 } else {
187 pr_warning("no symbols found in %s, maybe install "
188 "a debug package?\n", name);
189 }
190#endif
191 return -1;
192 }
193
194 return 0;
195}
196
197struct symbol *map__find_symbol(struct map *map, u64 addr,
198 symbol_filter_t filter)
199{
200 if (map__load(map, filter) < 0)
201 return NULL;
202
203 return dso__find_symbol(map->dso, map->type, addr);
204}
205
206struct symbol *map__find_symbol_by_name(struct map *map, const char *name,
207 symbol_filter_t filter)
208{
209 if (map__load(map, filter) < 0)
210 return NULL;
211
212 if (!dso__sorted_by_name(map->dso, map->type))
213 dso__sort_by_name(map->dso, map->type);
214
215 return dso__find_symbol_by_name(map->dso, map->type, name);
216}
217
218struct map *map__clone(struct map *map)
219{
220 return memdup(map, sizeof(*map));
221}
222
223int map__overlap(struct map *l, struct map *r)
224{
225 if (l->start > r->start) {
226 struct map *t = l;
227 l = r;
228 r = t;
229 }
230
231 if (l->end > r->start)
232 return 1;
233
234 return 0;
235}
236
237size_t map__fprintf(struct map *map, FILE *fp)
238{
239 return fprintf(fp, " %" PRIx64 "-%" PRIx64 " %" PRIx64 " %s\n",
240 map->start, map->end, map->pgoff, map->dso->name);
241}
242
243size_t map__fprintf_dsoname(struct map *map, FILE *fp)
244{
245 const char *dsoname = "[unknown]";
246
247 if (map && map->dso && (map->dso->name || map->dso->long_name)) {
248 if (symbol_conf.show_kernel_path && map->dso->long_name)
249 dsoname = map->dso->long_name;
250 else if (map->dso->name)
251 dsoname = map->dso->name;
252 }
253
254 return fprintf(fp, "%s", dsoname);
255}
256
257int map__fprintf_srcline(struct map *map, u64 addr, const char *prefix,
258 FILE *fp)
259{
260 char *srcline;
261 int ret = 0;
262
263 if (map && map->dso) {
264 srcline = get_srcline(map->dso,
265 map__rip_2objdump(map, addr));
266 if (srcline != SRCLINE_UNKNOWN)
267 ret = fprintf(fp, "%s%s", prefix, srcline);
268 free_srcline(srcline);
269 }
270 return ret;
271}
272
273/**
274 * map__rip_2objdump - convert symbol start address to objdump address.
275 * @map: memory map
276 * @rip: symbol start address
277 *
278 * objdump wants/reports absolute IPs for ET_EXEC, and RIPs for ET_DYN.
279 * map->dso->adjust_symbols==1 for ET_EXEC-like cases except ET_REL which is
280 * relative to section start.
281 *
282 * Return: Address suitable for passing to "objdump --start-address="
283 */
284u64 map__rip_2objdump(struct map *map, u64 rip)
285{
286 if (!map->dso->adjust_symbols)
287 return rip;
288
289 if (map->dso->rel)
290 return rip - map->pgoff;
291
292 return map->unmap_ip(map, rip) - map->reloc;
293}
294
295/**
296 * map__objdump_2mem - convert objdump address to a memory address.
297 * @map: memory map
298 * @ip: objdump address
299 *
300 * Closely related to map__rip_2objdump(), this function takes an address from
301 * objdump and converts it to a memory address. Note this assumes that @map
302 * contains the address. To be sure the result is valid, check it forwards
303 * e.g. map__rip_2objdump(map->map_ip(map, map__objdump_2mem(map, ip))) == ip
304 *
305 * Return: Memory address.
306 */
307u64 map__objdump_2mem(struct map *map, u64 ip)
308{
309 if (!map->dso->adjust_symbols)
310 return map->unmap_ip(map, ip);
311
312 if (map->dso->rel)
313 return map->unmap_ip(map, ip + map->pgoff);
314
315 return ip + map->reloc;
316}
317
318void map_groups__init(struct map_groups *mg)
319{
320 int i;
321 for (i = 0; i < MAP__NR_TYPES; ++i) {
322 mg->maps[i] = RB_ROOT;
323 INIT_LIST_HEAD(&mg->removed_maps[i]);
324 }
325 mg->machine = NULL;
326}
327
328static void maps__delete(struct rb_root *maps)
329{
330 struct rb_node *next = rb_first(maps);
331
332 while (next) {
333 struct map *pos = rb_entry(next, struct map, rb_node);
334
335 next = rb_next(&pos->rb_node);
336 rb_erase(&pos->rb_node, maps);
337 map__delete(pos);
338 }
339}
340
341static void maps__delete_removed(struct list_head *maps)
342{
343 struct map *pos, *n;
344
345 list_for_each_entry_safe(pos, n, maps, node) {
346 list_del(&pos->node);
347 map__delete(pos);
348 }
349}
350
351void map_groups__exit(struct map_groups *mg)
352{
353 int i;
354
355 for (i = 0; i < MAP__NR_TYPES; ++i) {
356 maps__delete(&mg->maps[i]);
357 maps__delete_removed(&mg->removed_maps[i]);
358 }
359}
360
361void map_groups__flush(struct map_groups *mg)
362{
363 int type;
364
365 for (type = 0; type < MAP__NR_TYPES; type++) {
366 struct rb_root *root = &mg->maps[type];
367 struct rb_node *next = rb_first(root);
368
369 while (next) {
370 struct map *pos = rb_entry(next, struct map, rb_node);
371 next = rb_next(&pos->rb_node);
372 rb_erase(&pos->rb_node, root);
373 /*
374 * We may have references to this map, for
375 * instance in some hist_entry instances, so
376 * just move them to a separate list.
377 */
378 list_add_tail(&pos->node, &mg->removed_maps[pos->type]);
379 }
380 }
381}
382
383struct symbol *map_groups__find_symbol(struct map_groups *mg,
384 enum map_type type, u64 addr,
385 struct map **mapp,
386 symbol_filter_t filter)
387{
388 struct map *map = map_groups__find(mg, type, addr);
389
390 /* Ensure map is loaded before using map->map_ip */
391 if (map != NULL && map__load(map, filter) >= 0) {
392 if (mapp != NULL)
393 *mapp = map;
394 return map__find_symbol(map, map->map_ip(map, addr), filter);
395 }
396
397 return NULL;
398}
399
400struct symbol *map_groups__find_symbol_by_name(struct map_groups *mg,
401 enum map_type type,
402 const char *name,
403 struct map **mapp,
404 symbol_filter_t filter)
405{
406 struct rb_node *nd;
407
408 for (nd = rb_first(&mg->maps[type]); nd; nd = rb_next(nd)) {
409 struct map *pos = rb_entry(nd, struct map, rb_node);
410 struct symbol *sym = map__find_symbol_by_name(pos, name, filter);
411
412 if (sym == NULL)
413 continue;
414 if (mapp != NULL)
415 *mapp = pos;
416 return sym;
417 }
418
419 return NULL;
420}
421
422int map_groups__find_ams(struct addr_map_symbol *ams, symbol_filter_t filter)
423{
424 if (ams->addr < ams->map->start || ams->addr > ams->map->end) {
425 if (ams->map->groups == NULL)
426 return -1;
427 ams->map = map_groups__find(ams->map->groups, ams->map->type,
428 ams->addr);
429 if (ams->map == NULL)
430 return -1;
431 }
432
433 ams->al_addr = ams->map->map_ip(ams->map, ams->addr);
434 ams->sym = map__find_symbol(ams->map, ams->al_addr, filter);
435
436 return ams->sym ? 0 : -1;
437}
438
439size_t __map_groups__fprintf_maps(struct map_groups *mg,
440 enum map_type type, int verbose, FILE *fp)
441{
442 size_t printed = fprintf(fp, "%s:\n", map_type__name[type]);
443 struct rb_node *nd;
444
445 for (nd = rb_first(&mg->maps[type]); nd; nd = rb_next(nd)) {
446 struct map *pos = rb_entry(nd, struct map, rb_node);
447 printed += fprintf(fp, "Map:");
448 printed += map__fprintf(pos, fp);
449 if (verbose > 2) {
450 printed += dso__fprintf(pos->dso, type, fp);
451 printed += fprintf(fp, "--\n");
452 }
453 }
454
455 return printed;
456}
457
458size_t map_groups__fprintf_maps(struct map_groups *mg, int verbose, FILE *fp)
459{
460 size_t printed = 0, i;
461 for (i = 0; i < MAP__NR_TYPES; ++i)
462 printed += __map_groups__fprintf_maps(mg, i, verbose, fp);
463 return printed;
464}
465
466static size_t __map_groups__fprintf_removed_maps(struct map_groups *mg,
467 enum map_type type,
468 int verbose, FILE *fp)
469{
470 struct map *pos;
471 size_t printed = 0;
472
473 list_for_each_entry(pos, &mg->removed_maps[type], node) {
474 printed += fprintf(fp, "Map:");
475 printed += map__fprintf(pos, fp);
476 if (verbose > 1) {
477 printed += dso__fprintf(pos->dso, type, fp);
478 printed += fprintf(fp, "--\n");
479 }
480 }
481 return printed;
482}
483
484static size_t map_groups__fprintf_removed_maps(struct map_groups *mg,
485 int verbose, FILE *fp)
486{
487 size_t printed = 0, i;
488 for (i = 0; i < MAP__NR_TYPES; ++i)
489 printed += __map_groups__fprintf_removed_maps(mg, i, verbose, fp);
490 return printed;
491}
492
493size_t map_groups__fprintf(struct map_groups *mg, int verbose, FILE *fp)
494{
495 size_t printed = map_groups__fprintf_maps(mg, verbose, fp);
496 printed += fprintf(fp, "Removed maps:\n");
497 return printed + map_groups__fprintf_removed_maps(mg, verbose, fp);
498}
499
500int map_groups__fixup_overlappings(struct map_groups *mg, struct map *map,
501 int verbose, FILE *fp)
502{
503 struct rb_root *root = &mg->maps[map->type];
504 struct rb_node *next = rb_first(root);
505 int err = 0;
506
507 while (next) {
508 struct map *pos = rb_entry(next, struct map, rb_node);
509 next = rb_next(&pos->rb_node);
510
511 if (!map__overlap(pos, map))
512 continue;
513
514 if (verbose >= 2) {
515 fputs("overlapping maps:\n", fp);
516 map__fprintf(map, fp);
517 map__fprintf(pos, fp);
518 }
519
520 rb_erase(&pos->rb_node, root);
521 /*
522 * Now check if we need to create new maps for areas not
523 * overlapped by the new map:
524 */
525 if (map->start > pos->start) {
526 struct map *before = map__clone(pos);
527
528 if (before == NULL) {
529 err = -ENOMEM;
530 goto move_map;
531 }
532
533 before->end = map->start - 1;
534 map_groups__insert(mg, before);
535 if (verbose >= 2)
536 map__fprintf(before, fp);
537 }
538
539 if (map->end < pos->end) {
540 struct map *after = map__clone(pos);
541
542 if (after == NULL) {
543 err = -ENOMEM;
544 goto move_map;
545 }
546
547 after->start = map->end + 1;
548 map_groups__insert(mg, after);
549 if (verbose >= 2)
550 map__fprintf(after, fp);
551 }
552move_map:
553 /*
554 * If we have references, just move them to a separate list.
555 */
556 if (pos->referenced)
557 list_add_tail(&pos->node, &mg->removed_maps[map->type]);
558 else
559 map__delete(pos);
560
561 if (err)
562 return err;
563 }
564
565 return 0;
566}
567
568/*
569 * XXX This should not really _copy_ te maps, but refcount them.
570 */
571int map_groups__clone(struct map_groups *mg,
572 struct map_groups *parent, enum map_type type)
573{
574 struct rb_node *nd;
575 for (nd = rb_first(&parent->maps[type]); nd; nd = rb_next(nd)) {
576 struct map *map = rb_entry(nd, struct map, rb_node);
577 struct map *new = map__clone(map);
578 if (new == NULL)
579 return -ENOMEM;
580 map_groups__insert(mg, new);
581 }
582 return 0;
583}
584
585void maps__insert(struct rb_root *maps, struct map *map)
586{
587 struct rb_node **p = &maps->rb_node;
588 struct rb_node *parent = NULL;
589 const u64 ip = map->start;
590 struct map *m;
591
592 while (*p != NULL) {
593 parent = *p;
594 m = rb_entry(parent, struct map, rb_node);
595 if (ip < m->start)
596 p = &(*p)->rb_left;
597 else
598 p = &(*p)->rb_right;
599 }
600
601 rb_link_node(&map->rb_node, parent, p);
602 rb_insert_color(&map->rb_node, maps);
603}
604
605void maps__remove(struct rb_root *maps, struct map *map)
606{
607 rb_erase(&map->rb_node, maps);
608}
609
610struct map *maps__find(struct rb_root *maps, u64 ip)
611{
612 struct rb_node **p = &maps->rb_node;
613 struct rb_node *parent = NULL;
614 struct map *m;
615
616 while (*p != NULL) {
617 parent = *p;
618 m = rb_entry(parent, struct map, rb_node);
619 if (ip < m->start)
620 p = &(*p)->rb_left;
621 else if (ip > m->end)
622 p = &(*p)->rb_right;
623 else
624 return m;
625 }
626
627 return NULL;
628}
629
630struct map *maps__first(struct rb_root *maps)
631{
632 struct rb_node *first = rb_first(maps);
633
634 if (first)
635 return rb_entry(first, struct map, rb_node);
636 return NULL;
637}
638
639struct map *maps__next(struct map *map)
640{
641 struct rb_node *next = rb_next(&map->rb_node);
642
643 if (next)
644 return rb_entry(next, struct map, rb_node);
645 return NULL;
646}