14 #include <linux/string.h>
16 const char *map_type__name[MAP__NR_TYPES] = {
17 [MAP__FUNCTION] = "Functions",
18 [MAP__VARIABLE] = "Variables",
21 static inline int is_anon_memory(const char *filename)
23 return !strcmp(filename, "//anon") ||
24 !strcmp(filename, "/dev/zero (deleted)") ||
25 !strcmp(filename, "/anon_hugepage (deleted)");
28 static inline int is_no_dso_memory(const char *filename)
30 return !strncmp(filename, "[stack", 6) ||
31 !strcmp(filename, "[heap]");
34 void map__init(struct map *map, enum map_type type,
35 u64 start, u64 end, u64 pgoff, struct dso *dso)
42 map->map_ip = map__map_ip;
43 map->unmap_ip = map__unmap_ip;
44 RB_CLEAR_NODE(&map->rb_node);
46 map->referenced = false;
47 map->erange_warned = false;
50 struct map *map__new(struct list_head *dsos__list, u64 start, u64 len,
51 u64 pgoff, u32 pid, char *filename,
54 struct map *map = malloc(sizeof(*map));
57 char newfilename[PATH_MAX];
59 int anon, no_dso, vdso;
61 anon = is_anon_memory(filename);
62 vdso = is_vdso_map(filename);
63 no_dso = is_no_dso_memory(filename);
66 snprintf(newfilename, sizeof(newfilename), "/tmp/perf-%d.map", pid);
67 filename = newfilename;
72 dso = vdso__dso_findnew(dsos__list);
74 dso = __dsos__findnew(dsos__list, filename);
79 map__init(map, type, start, start + len, pgoff, dso);
82 map->map_ip = map->unmap_ip = identity__map_ip;
85 * Set memory without DSO as loaded. All map__find_*
86 * functions still return NULL, and we avoid the
87 * unnecessary map__load warning.
90 dso__set_loaded(dso, map->type);
100 * Constructor variant for modules (where we know from /proc/modules where
101 * they are loaded) and for vmlinux, where only after we load all the
102 * symbols we'll know where it starts and ends.
104 struct map *map__new2(u64 start, struct dso *dso, enum map_type type)
106 struct map *map = calloc(1, (sizeof(*map) +
107 (dso->kernel ? sizeof(struct kmap) : 0)));
110 * ->end will be filled after we load all the symbols
112 map__init(map, type, start, 0, 0, dso);
118 void map__delete(struct map *map)
123 void map__fixup_start(struct map *map)
125 struct rb_root *symbols = &map->dso->symbols[map->type];
126 struct rb_node *nd = rb_first(symbols);
128 struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
129 map->start = sym->start;
133 void map__fixup_end(struct map *map)
135 struct rb_root *symbols = &map->dso->symbols[map->type];
136 struct rb_node *nd = rb_last(symbols);
138 struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
143 #define DSO__DELETED "(deleted)"
145 int map__load(struct map *map, symbol_filter_t filter)
147 const char *name = map->dso->long_name;
150 if (dso__loaded(map->dso, map->type))
153 nr = dso__load(map->dso, map, filter);
155 if (map->dso->has_build_id) {
156 char sbuild_id[BUILD_ID_SIZE * 2 + 1];
158 build_id__sprintf(map->dso->build_id,
159 sizeof(map->dso->build_id),
161 pr_warning("%s with build id %s not found",
164 pr_warning("Failed to open %s", name);
166 pr_warning(", continuing without symbols\n");
168 } else if (nr == 0) {
169 #ifdef LIBELF_SUPPORT
170 const size_t len = strlen(name);
171 const size_t real_len = len - sizeof(DSO__DELETED);
173 if (len > sizeof(DSO__DELETED) &&
174 strcmp(name + real_len + 1, DSO__DELETED) == 0) {
175 pr_warning("%.*s was updated (is prelink enabled?). "
176 "Restart the long running apps that use it!\n",
177 (int)real_len, name);
179 pr_warning("no symbols found in %s, maybe install "
180 "a debug package?\n", name);
189 struct symbol *map__find_symbol(struct map *map, u64 addr,
190 symbol_filter_t filter)
192 if (map__load(map, filter) < 0)
195 return dso__find_symbol(map->dso, map->type, addr);
198 struct symbol *map__find_symbol_by_name(struct map *map, const char *name,
199 symbol_filter_t filter)
201 if (map__load(map, filter) < 0)
204 if (!dso__sorted_by_name(map->dso, map->type))
205 dso__sort_by_name(map->dso, map->type);
207 return dso__find_symbol_by_name(map->dso, map->type, name);
210 struct map *map__clone(struct map *map)
212 return memdup(map, sizeof(*map));
215 int map__overlap(struct map *l, struct map *r)
217 if (l->start > r->start) {
223 if (l->end > r->start)
229 size_t map__fprintf(struct map *map, FILE *fp)
231 return fprintf(fp, " %" PRIx64 "-%" PRIx64 " %" PRIx64 " %s\n",
232 map->start, map->end, map->pgoff, map->dso->name);
235 size_t map__fprintf_dsoname(struct map *map, FILE *fp)
237 const char *dsoname = "[unknown]";
239 if (map && map->dso && (map->dso->name || map->dso->long_name)) {
240 if (symbol_conf.show_kernel_path && map->dso->long_name)
241 dsoname = map->dso->long_name;
242 else if (map->dso->name)
243 dsoname = map->dso->name;
246 return fprintf(fp, "%s", dsoname);
250 * objdump wants/reports absolute IPs for ET_EXEC, and RIPs for ET_DYN.
251 * map->dso->adjust_symbols==1 for ET_EXEC-like cases except ET_REL which is
252 * relative to section start.
254 u64 map__rip_2objdump(struct map *map, u64 rip)
256 if (!map->dso->adjust_symbols)
260 return rip - map->pgoff;
262 return map->unmap_ip(map, rip);
265 void map_groups__init(struct map_groups *mg)
268 for (i = 0; i < MAP__NR_TYPES; ++i) {
269 mg->maps[i] = RB_ROOT;
270 INIT_LIST_HEAD(&mg->removed_maps[i]);
275 static void maps__delete(struct rb_root *maps)
277 struct rb_node *next = rb_first(maps);
280 struct map *pos = rb_entry(next, struct map, rb_node);
282 next = rb_next(&pos->rb_node);
283 rb_erase(&pos->rb_node, maps);
288 static void maps__delete_removed(struct list_head *maps)
292 list_for_each_entry_safe(pos, n, maps, node) {
293 list_del(&pos->node);
298 void map_groups__exit(struct map_groups *mg)
302 for (i = 0; i < MAP__NR_TYPES; ++i) {
303 maps__delete(&mg->maps[i]);
304 maps__delete_removed(&mg->removed_maps[i]);
308 void map_groups__flush(struct map_groups *mg)
312 for (type = 0; type < MAP__NR_TYPES; type++) {
313 struct rb_root *root = &mg->maps[type];
314 struct rb_node *next = rb_first(root);
317 struct map *pos = rb_entry(next, struct map, rb_node);
318 next = rb_next(&pos->rb_node);
319 rb_erase(&pos->rb_node, root);
321 * We may have references to this map, for
322 * instance in some hist_entry instances, so
323 * just move them to a separate list.
325 list_add_tail(&pos->node, &mg->removed_maps[pos->type]);
330 struct symbol *map_groups__find_symbol(struct map_groups *mg,
331 enum map_type type, u64 addr,
333 symbol_filter_t filter)
335 struct map *map = map_groups__find(mg, type, addr);
340 return map__find_symbol(map, map->map_ip(map, addr), filter);
346 struct symbol *map_groups__find_symbol_by_name(struct map_groups *mg,
350 symbol_filter_t filter)
354 for (nd = rb_first(&mg->maps[type]); nd; nd = rb_next(nd)) {
355 struct map *pos = rb_entry(nd, struct map, rb_node);
356 struct symbol *sym = map__find_symbol_by_name(pos, name, filter);
368 size_t __map_groups__fprintf_maps(struct map_groups *mg,
369 enum map_type type, int verbose, FILE *fp)
371 size_t printed = fprintf(fp, "%s:\n", map_type__name[type]);
374 for (nd = rb_first(&mg->maps[type]); nd; nd = rb_next(nd)) {
375 struct map *pos = rb_entry(nd, struct map, rb_node);
376 printed += fprintf(fp, "Map:");
377 printed += map__fprintf(pos, fp);
379 printed += dso__fprintf(pos->dso, type, fp);
380 printed += fprintf(fp, "--\n");
387 size_t map_groups__fprintf_maps(struct map_groups *mg, int verbose, FILE *fp)
389 size_t printed = 0, i;
390 for (i = 0; i < MAP__NR_TYPES; ++i)
391 printed += __map_groups__fprintf_maps(mg, i, verbose, fp);
395 static size_t __map_groups__fprintf_removed_maps(struct map_groups *mg,
397 int verbose, FILE *fp)
402 list_for_each_entry(pos, &mg->removed_maps[type], node) {
403 printed += fprintf(fp, "Map:");
404 printed += map__fprintf(pos, fp);
406 printed += dso__fprintf(pos->dso, type, fp);
407 printed += fprintf(fp, "--\n");
413 static size_t map_groups__fprintf_removed_maps(struct map_groups *mg,
414 int verbose, FILE *fp)
416 size_t printed = 0, i;
417 for (i = 0; i < MAP__NR_TYPES; ++i)
418 printed += __map_groups__fprintf_removed_maps(mg, i, verbose, fp);
422 size_t map_groups__fprintf(struct map_groups *mg, int verbose, FILE *fp)
424 size_t printed = map_groups__fprintf_maps(mg, verbose, fp);
425 printed += fprintf(fp, "Removed maps:\n");
426 return printed + map_groups__fprintf_removed_maps(mg, verbose, fp);
429 int map_groups__fixup_overlappings(struct map_groups *mg, struct map *map,
430 int verbose, FILE *fp)
432 struct rb_root *root = &mg->maps[map->type];
433 struct rb_node *next = rb_first(root);
437 struct map *pos = rb_entry(next, struct map, rb_node);
438 next = rb_next(&pos->rb_node);
440 if (!map__overlap(pos, map))
444 fputs("overlapping maps:\n", fp);
445 map__fprintf(map, fp);
446 map__fprintf(pos, fp);
449 rb_erase(&pos->rb_node, root);
451 * Now check if we need to create new maps for areas not
452 * overlapped by the new map:
454 if (map->start > pos->start) {
455 struct map *before = map__clone(pos);
457 if (before == NULL) {
462 before->end = map->start - 1;
463 map_groups__insert(mg, before);
465 map__fprintf(before, fp);
468 if (map->end < pos->end) {
469 struct map *after = map__clone(pos);
476 after->start = map->end + 1;
477 map_groups__insert(mg, after);
479 map__fprintf(after, fp);
483 * If we have references, just move them to a separate list.
486 list_add_tail(&pos->node, &mg->removed_maps[map->type]);
498 * XXX This should not really _copy_ te maps, but refcount them.
500 int map_groups__clone(struct map_groups *mg,
501 struct map_groups *parent, enum map_type type)
504 for (nd = rb_first(&parent->maps[type]); nd; nd = rb_next(nd)) {
505 struct map *map = rb_entry(nd, struct map, rb_node);
506 struct map *new = map__clone(map);
509 map_groups__insert(mg, new);
514 void maps__insert(struct rb_root *maps, struct map *map)
516 struct rb_node **p = &maps->rb_node;
517 struct rb_node *parent = NULL;
518 const u64 ip = map->start;
523 m = rb_entry(parent, struct map, rb_node);
530 rb_link_node(&map->rb_node, parent, p);
531 rb_insert_color(&map->rb_node, maps);
534 void maps__remove(struct rb_root *maps, struct map *map)
536 rb_erase(&map->rb_node, maps);
539 struct map *maps__find(struct rb_root *maps, u64 ip)
541 struct rb_node **p = &maps->rb_node;
542 struct rb_node *parent = NULL;
547 m = rb_entry(parent, struct map, rb_node);
550 else if (ip > m->end)
559 struct map *maps__first(struct rb_root *maps)
561 struct rb_node *first = rb_first(maps);
564 return rb_entry(first, struct map, rb_node);
568 struct map *maps__next(struct map *map)
570 struct rb_node *next = rb_next(&map->rb_node);
573 return rb_entry(next, struct map, rb_node);