17 #include <linux/string.h>
19 const char *map_type__name[MAP__NR_TYPES] = {
20 [MAP__FUNCTION] = "Functions",
21 [MAP__VARIABLE] = "Variables",
24 static inline int is_anon_memory(const char *filename)
26 return !strcmp(filename, "//anon") ||
27 !strcmp(filename, "/dev/zero (deleted)") ||
28 !strcmp(filename, "/anon_hugepage (deleted)");
31 static inline int is_no_dso_memory(const char *filename)
33 return !strncmp(filename, "[stack", 6) ||
34 !strncmp(filename, "/SYSV",5) ||
35 !strcmp(filename, "[heap]");
38 static inline int is_android_lib(const char *filename)
40 return !strncmp(filename, "/data/app-lib", 13) ||
41 !strncmp(filename, "/system/lib", 11);
44 static inline bool replace_android_lib(const char *filename, char *newfilename)
48 size_t app_abi_length, new_length;
49 size_t lib_length = 0;
51 libname = strrchr(filename, '/');
53 lib_length = strlen(libname);
55 app_abi = getenv("APP_ABI");
59 app_abi_length = strlen(app_abi);
61 if (!strncmp(filename, "/data/app-lib", 13)) {
67 new_length = 7 + app_abi_length + lib_length;
69 apk_path = getenv("APK_PATH");
71 new_length += strlen(apk_path) + 1;
72 if (new_length > PATH_MAX)
74 snprintf(newfilename, new_length,
75 "%s/libs/%s/%s", apk_path, app_abi, libname);
77 if (new_length > PATH_MAX)
79 snprintf(newfilename, new_length,
80 "libs/%s/%s", app_abi, libname);
85 if (!strncmp(filename, "/system/lib/", 11)) {
91 ndk = getenv("NDK_ROOT");
92 app = getenv("APP_PLATFORM");
97 ndk_length = strlen(ndk);
98 app_length = strlen(app);
100 if (!(ndk_length && app_length && app_abi_length))
103 arch = !strncmp(app_abi, "arm", 3) ? "arm" :
104 !strncmp(app_abi, "mips", 4) ? "mips" :
105 !strncmp(app_abi, "x86", 3) ? "x86" : NULL;
110 new_length = 27 + ndk_length +
111 app_length + lib_length
114 if (new_length > PATH_MAX)
116 snprintf(newfilename, new_length,
117 "%s/platforms/%s/arch-%s/usr/lib/%s",
118 ndk, app, arch, libname);
125 void map__init(struct map *map, enum map_type type,
126 u64 start, u64 end, u64 pgoff, struct dso *dso)
134 map->map_ip = map__map_ip;
135 map->unmap_ip = map__unmap_ip;
136 RB_CLEAR_NODE(&map->rb_node);
138 map->referenced = false;
139 map->erange_warned = false;
142 struct map *map__new(struct machine *machine, u64 start, u64 len,
143 u64 pgoff, u32 pid, u32 d_maj, u32 d_min, u64 ino,
144 u64 ino_gen, u32 prot, u32 flags, char *filename,
145 enum map_type type, struct thread *thread)
147 struct map *map = malloc(sizeof(*map));
150 char newfilename[PATH_MAX];
152 int anon, no_dso, vdso, android;
154 android = is_android_lib(filename);
155 anon = is_anon_memory(filename);
156 vdso = is_vdso_map(filename);
157 no_dso = is_no_dso_memory(filename);
162 map->ino_generation = ino_gen;
166 if ((anon || no_dso) && type == MAP__FUNCTION) {
167 snprintf(newfilename, sizeof(newfilename), "/tmp/perf-%d.map", pid);
168 filename = newfilename;
172 if (replace_android_lib(filename, newfilename))
173 filename = newfilename;
178 dso = vdso__dso_findnew(machine, thread);
180 dso = __dsos__findnew(&machine->user_dsos, filename);
185 map__init(map, type, start, start + len, pgoff, dso);
187 if (anon || no_dso) {
188 map->map_ip = map->unmap_ip = identity__map_ip;
191 * Set memory without DSO as loaded. All map__find_*
192 * functions still return NULL, and we avoid the
193 * unnecessary map__load warning.
195 if (type != MAP__FUNCTION)
196 dso__set_loaded(dso, map->type);
206 * Constructor variant for modules (where we know from /proc/modules where
207 * they are loaded) and for vmlinux, where only after we load all the
208 * symbols we'll know where it starts and ends.
210 struct map *map__new2(u64 start, struct dso *dso, enum map_type type)
212 struct map *map = calloc(1, (sizeof(*map) +
213 (dso->kernel ? sizeof(struct kmap) : 0)));
216 * ->end will be filled after we load all the symbols
218 map__init(map, type, start, 0, 0, dso);
224 void map__delete(struct map *map)
229 void map__fixup_start(struct map *map)
231 struct rb_root *symbols = &map->dso->symbols[map->type];
232 struct rb_node *nd = rb_first(symbols);
234 struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
235 map->start = sym->start;
239 void map__fixup_end(struct map *map)
241 struct rb_root *symbols = &map->dso->symbols[map->type];
242 struct rb_node *nd = rb_last(symbols);
244 struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
249 #define DSO__DELETED "(deleted)"
251 int map__load(struct map *map, symbol_filter_t filter)
253 const char *name = map->dso->long_name;
256 if (dso__loaded(map->dso, map->type))
259 nr = dso__load(map->dso, map, filter);
261 if (map->dso->has_build_id) {
262 char sbuild_id[BUILD_ID_SIZE * 2 + 1];
264 build_id__sprintf(map->dso->build_id,
265 sizeof(map->dso->build_id),
267 pr_warning("%s with build id %s not found",
270 pr_warning("Failed to open %s", name);
272 pr_warning(", continuing without symbols\n");
274 } else if (nr == 0) {
275 #ifdef HAVE_LIBELF_SUPPORT
276 const size_t len = strlen(name);
277 const size_t real_len = len - sizeof(DSO__DELETED);
279 if (len > sizeof(DSO__DELETED) &&
280 strcmp(name + real_len + 1, DSO__DELETED) == 0) {
281 pr_warning("%.*s was updated (is prelink enabled?). "
282 "Restart the long running apps that use it!\n",
283 (int)real_len, name);
285 pr_warning("no symbols found in %s, maybe install "
286 "a debug package?\n", name);
295 struct symbol *map__find_symbol(struct map *map, u64 addr,
296 symbol_filter_t filter)
298 if (map__load(map, filter) < 0)
301 return dso__find_symbol(map->dso, map->type, addr);
304 struct symbol *map__find_symbol_by_name(struct map *map, const char *name,
305 symbol_filter_t filter)
307 if (map__load(map, filter) < 0)
310 if (!dso__sorted_by_name(map->dso, map->type))
311 dso__sort_by_name(map->dso, map->type);
313 return dso__find_symbol_by_name(map->dso, map->type, name);
316 struct map *map__clone(struct map *map)
318 return memdup(map, sizeof(*map));
321 int map__overlap(struct map *l, struct map *r)
323 if (l->start > r->start) {
329 if (l->end > r->start)
335 size_t map__fprintf(struct map *map, FILE *fp)
337 return fprintf(fp, " %" PRIx64 "-%" PRIx64 " %" PRIx64 " %s\n",
338 map->start, map->end, map->pgoff, map->dso->name);
341 size_t map__fprintf_dsoname(struct map *map, FILE *fp)
343 const char *dsoname = "[unknown]";
345 if (map && map->dso && (map->dso->name || map->dso->long_name)) {
346 if (symbol_conf.show_kernel_path && map->dso->long_name)
347 dsoname = map->dso->long_name;
348 else if (map->dso->name)
349 dsoname = map->dso->name;
352 return fprintf(fp, "%s", dsoname);
355 int map__fprintf_srcline(struct map *map, u64 addr, const char *prefix,
361 if (map && map->dso) {
362 srcline = get_srcline(map->dso,
363 map__rip_2objdump(map, addr), NULL, true);
364 if (srcline != SRCLINE_UNKNOWN)
365 ret = fprintf(fp, "%s%s", prefix, srcline);
366 free_srcline(srcline);
372 * map__rip_2objdump - convert symbol start address to objdump address.
374 * @rip: symbol start address
376 * objdump wants/reports absolute IPs for ET_EXEC, and RIPs for ET_DYN.
377 * map->dso->adjust_symbols==1 for ET_EXEC-like cases except ET_REL which is
378 * relative to section start.
380 * Return: Address suitable for passing to "objdump --start-address="
382 u64 map__rip_2objdump(struct map *map, u64 rip)
384 if (!map->dso->adjust_symbols)
388 return rip - map->pgoff;
390 return map->unmap_ip(map, rip) - map->reloc;
394 * map__objdump_2mem - convert objdump address to a memory address.
396 * @ip: objdump address
398 * Closely related to map__rip_2objdump(), this function takes an address from
399 * objdump and converts it to a memory address. Note this assumes that @map
400 * contains the address. To be sure the result is valid, check it forwards
401 * e.g. map__rip_2objdump(map->map_ip(map, map__objdump_2mem(map, ip))) == ip
403 * Return: Memory address.
405 u64 map__objdump_2mem(struct map *map, u64 ip)
407 if (!map->dso->adjust_symbols)
408 return map->unmap_ip(map, ip);
411 return map->unmap_ip(map, ip + map->pgoff);
413 return ip + map->reloc;
416 void map_groups__init(struct map_groups *mg, struct machine *machine)
419 for (i = 0; i < MAP__NR_TYPES; ++i) {
420 mg->maps[i] = RB_ROOT;
421 INIT_LIST_HEAD(&mg->removed_maps[i]);
423 mg->machine = machine;
427 static void maps__delete(struct rb_root *maps)
429 struct rb_node *next = rb_first(maps);
432 struct map *pos = rb_entry(next, struct map, rb_node);
434 next = rb_next(&pos->rb_node);
435 rb_erase(&pos->rb_node, maps);
440 static void maps__delete_removed(struct list_head *maps)
444 list_for_each_entry_safe(pos, n, maps, node) {
445 list_del(&pos->node);
450 void map_groups__exit(struct map_groups *mg)
454 for (i = 0; i < MAP__NR_TYPES; ++i) {
455 maps__delete(&mg->maps[i]);
456 maps__delete_removed(&mg->removed_maps[i]);
460 bool map_groups__empty(struct map_groups *mg)
464 for (i = 0; i < MAP__NR_TYPES; ++i) {
465 if (maps__first(&mg->maps[i]))
467 if (!list_empty(&mg->removed_maps[i]))
474 struct map_groups *map_groups__new(struct machine *machine)
476 struct map_groups *mg = malloc(sizeof(*mg));
479 map_groups__init(mg, machine);
484 void map_groups__delete(struct map_groups *mg)
486 map_groups__exit(mg);
490 void map_groups__put(struct map_groups *mg)
492 if (--mg->refcnt == 0)
493 map_groups__delete(mg);
496 void map_groups__flush(struct map_groups *mg)
500 for (type = 0; type < MAP__NR_TYPES; type++) {
501 struct rb_root *root = &mg->maps[type];
502 struct rb_node *next = rb_first(root);
505 struct map *pos = rb_entry(next, struct map, rb_node);
506 next = rb_next(&pos->rb_node);
507 rb_erase(&pos->rb_node, root);
509 * We may have references to this map, for
510 * instance in some hist_entry instances, so
511 * just move them to a separate list.
513 list_add_tail(&pos->node, &mg->removed_maps[pos->type]);
518 struct symbol *map_groups__find_symbol(struct map_groups *mg,
519 enum map_type type, u64 addr,
521 symbol_filter_t filter)
523 struct map *map = map_groups__find(mg, type, addr);
525 /* Ensure map is loaded before using map->map_ip */
526 if (map != NULL && map__load(map, filter) >= 0) {
529 return map__find_symbol(map, map->map_ip(map, addr), filter);
535 struct symbol *map_groups__find_symbol_by_name(struct map_groups *mg,
539 symbol_filter_t filter)
543 for (nd = rb_first(&mg->maps[type]); nd; nd = rb_next(nd)) {
544 struct map *pos = rb_entry(nd, struct map, rb_node);
545 struct symbol *sym = map__find_symbol_by_name(pos, name, filter);
557 int map_groups__find_ams(struct addr_map_symbol *ams, symbol_filter_t filter)
559 if (ams->addr < ams->map->start || ams->addr >= ams->map->end) {
560 if (ams->map->groups == NULL)
562 ams->map = map_groups__find(ams->map->groups, ams->map->type,
564 if (ams->map == NULL)
568 ams->al_addr = ams->map->map_ip(ams->map, ams->addr);
569 ams->sym = map__find_symbol(ams->map, ams->al_addr, filter);
571 return ams->sym ? 0 : -1;
574 size_t __map_groups__fprintf_maps(struct map_groups *mg, enum map_type type,
577 size_t printed = fprintf(fp, "%s:\n", map_type__name[type]);
580 for (nd = rb_first(&mg->maps[type]); nd; nd = rb_next(nd)) {
581 struct map *pos = rb_entry(nd, struct map, rb_node);
582 printed += fprintf(fp, "Map:");
583 printed += map__fprintf(pos, fp);
585 printed += dso__fprintf(pos->dso, type, fp);
586 printed += fprintf(fp, "--\n");
593 static size_t map_groups__fprintf_maps(struct map_groups *mg, FILE *fp)
595 size_t printed = 0, i;
596 for (i = 0; i < MAP__NR_TYPES; ++i)
597 printed += __map_groups__fprintf_maps(mg, i, fp);
601 static size_t __map_groups__fprintf_removed_maps(struct map_groups *mg,
602 enum map_type type, FILE *fp)
607 list_for_each_entry(pos, &mg->removed_maps[type], node) {
608 printed += fprintf(fp, "Map:");
609 printed += map__fprintf(pos, fp);
611 printed += dso__fprintf(pos->dso, type, fp);
612 printed += fprintf(fp, "--\n");
618 static size_t map_groups__fprintf_removed_maps(struct map_groups *mg,
621 size_t printed = 0, i;
622 for (i = 0; i < MAP__NR_TYPES; ++i)
623 printed += __map_groups__fprintf_removed_maps(mg, i, fp);
627 size_t map_groups__fprintf(struct map_groups *mg, FILE *fp)
629 size_t printed = map_groups__fprintf_maps(mg, fp);
630 printed += fprintf(fp, "Removed maps:\n");
631 return printed + map_groups__fprintf_removed_maps(mg, fp);
634 int map_groups__fixup_overlappings(struct map_groups *mg, struct map *map,
637 struct rb_root *root = &mg->maps[map->type];
638 struct rb_node *next = rb_first(root);
642 struct map *pos = rb_entry(next, struct map, rb_node);
643 next = rb_next(&pos->rb_node);
645 if (!map__overlap(pos, map))
649 fputs("overlapping maps:\n", fp);
650 map__fprintf(map, fp);
651 map__fprintf(pos, fp);
654 rb_erase(&pos->rb_node, root);
656 * Now check if we need to create new maps for areas not
657 * overlapped by the new map:
659 if (map->start > pos->start) {
660 struct map *before = map__clone(pos);
662 if (before == NULL) {
667 before->end = map->start;
668 map_groups__insert(mg, before);
670 map__fprintf(before, fp);
673 if (map->end < pos->end) {
674 struct map *after = map__clone(pos);
681 after->start = map->end;
682 map_groups__insert(mg, after);
684 map__fprintf(after, fp);
688 * If we have references, just move them to a separate list.
691 list_add_tail(&pos->node, &mg->removed_maps[map->type]);
703 * XXX This should not really _copy_ te maps, but refcount them.
705 int map_groups__clone(struct map_groups *mg,
706 struct map_groups *parent, enum map_type type)
709 for (nd = rb_first(&parent->maps[type]); nd; nd = rb_next(nd)) {
710 struct map *map = rb_entry(nd, struct map, rb_node);
711 struct map *new = map__clone(map);
714 map_groups__insert(mg, new);
719 void maps__insert(struct rb_root *maps, struct map *map)
721 struct rb_node **p = &maps->rb_node;
722 struct rb_node *parent = NULL;
723 const u64 ip = map->start;
728 m = rb_entry(parent, struct map, rb_node);
735 rb_link_node(&map->rb_node, parent, p);
736 rb_insert_color(&map->rb_node, maps);
739 void maps__remove(struct rb_root *maps, struct map *map)
741 rb_erase(&map->rb_node, maps);
744 struct map *maps__find(struct rb_root *maps, u64 ip)
746 struct rb_node **p = &maps->rb_node;
747 struct rb_node *parent = NULL;
752 m = rb_entry(parent, struct map, rb_node);
755 else if (ip >= m->end)
764 struct map *maps__first(struct rb_root *maps)
766 struct rb_node *first = rb_first(maps);
769 return rb_entry(first, struct map, rb_node);
773 struct map *maps__next(struct map *map)
775 struct rb_node *next = rb_next(&map->rb_node);
778 return rb_entry(next, struct map, rb_node);
782 struct kmap *map__kmap(struct map *map)
784 if (!map->dso || !map->dso->kernel) {
785 pr_err("Internal error: map__kmap with a non-kernel map\n");
788 return (struct kmap *)(map + 1);
791 struct map_groups *map__kmaps(struct map *map)
793 struct kmap *kmap = map__kmap(map);
795 if (!kmap || !kmap->kmaps) {
796 pr_err("Internal error: map__kmaps with a non-kernel map\n");