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