perf tools: Back [vdso] DSO with real data
[GitHub/mt8127/android_kernel_alcatel_ttab.git] / tools / perf / util / map.c
CommitLineData
66e274f3 1#include "symbol.h"
c6e718ff 2#include <errno.h>
9486aa38 3#include <inttypes.h>
4b8cf846 4#include <limits.h>
66e274f3
FW
5#include <stdlib.h>
6#include <string.h>
7#include <stdio.h>
a1645ce1 8#include <unistd.h>
4b8cf846 9#include "map.h"
5cd95c2d 10#include "thread.h"
c80c3c26 11#include "strlist.h"
7dbf4dcf 12#include "vdso.h"
66e274f3 13
3846df2e
ACM
14const char *map_type__name[MAP__NR_TYPES] = {
15 [MAP__FUNCTION] = "Functions",
16 [MAP__VARIABLE] = "Variables",
17};
18
66e274f3
FW
19static inline int is_anon_memory(const char *filename)
20{
21 return strcmp(filename, "//anon") == 0;
22}
23
87ffef79
JO
24static inline int is_no_dso_memory(const char *filename)
25{
26 return !strcmp(filename, "[stack]") ||
87ffef79
JO
27 !strcmp(filename, "[heap]");
28}
29
3610583c
ACM
30void map__init(struct map *self, enum map_type type,
31 u64 start, u64 end, u64 pgoff, struct dso *dso)
afb7b4f0 32{
3610583c 33 self->type = type;
afb7b4f0
ACM
34 self->start = start;
35 self->end = end;
36 self->pgoff = pgoff;
37 self->dso = dso;
38 self->map_ip = map__map_ip;
39 self->unmap_ip = map__unmap_ip;
40 RB_CLEAR_NODE(&self->rb_node);
a1645ce1 41 self->groups = NULL;
0a1eae39 42 self->referenced = false;
31d68e7b 43 self->erange_warned = false;
afb7b4f0
ACM
44}
45
a1645ce1
ZY
46struct map *map__new(struct list_head *dsos__list, u64 start, u64 len,
47 u64 pgoff, u32 pid, char *filename,
361d1346 48 enum map_type type)
66e274f3
FW
49{
50 struct map *self = malloc(sizeof(*self));
51
52 if (self != NULL) {
66e274f3 53 char newfilename[PATH_MAX];
afb7b4f0 54 struct dso *dso;
7dbf4dcf 55 int anon, no_dso, vdso;
66e274f3 56
66e274f3 57 anon = is_anon_memory(filename);
7dbf4dcf 58 vdso = is_vdso_map(filename);
87ffef79 59 no_dso = is_no_dso_memory(filename);
66e274f3
FW
60
61 if (anon) {
b177f63f 62 snprintf(newfilename, sizeof(newfilename), "/tmp/perf-%d.map", pid);
66e274f3
FW
63 filename = newfilename;
64 }
65
7dbf4dcf
JO
66 if (vdso) {
67 pgoff = 0;
68 dso = vdso__dso_findnew(dsos__list);
69 } else
70 dso = __dsos__findnew(dsos__list, filename);
71
afb7b4f0 72 if (dso == NULL)
66e274f3
FW
73 goto out_delete;
74
b177f63f 75 map__init(self, type, start, start + len, pgoff, dso);
afb7b4f0 76
87ffef79 77 if (anon || no_dso) {
ed52ce2e 78 self->map_ip = self->unmap_ip = identity__map_ip;
87ffef79
JO
79
80 /*
81 * Set memory without DSO as loaded. All map__find_*
82 * functions still return NULL, and we avoid the
83 * unnecessary map__load warning.
84 */
85 if (no_dso)
86 dso__set_loaded(dso, self->type);
8d92c02a 87 }
66e274f3
FW
88 }
89 return self;
90out_delete:
91 free(self);
92 return NULL;
93}
94
e5a1845f
NK
95/*
96 * Constructor variant for modules (where we know from /proc/modules where
97 * they are loaded) and for vmlinux, where only after we load all the
98 * symbols we'll know where it starts and ends.
99 */
100struct map *map__new2(u64 start, struct dso *dso, enum map_type type)
101{
102 struct map *map = calloc(1, (sizeof(*map) +
103 (dso->kernel ? sizeof(struct kmap) : 0)));
104 if (map != NULL) {
105 /*
106 * ->end will be filled after we load all the symbols
107 */
108 map__init(map, type, start, 0, 0, dso);
109 }
110
111 return map;
112}
113
c338aee8
ACM
114void map__delete(struct map *self)
115{
116 free(self);
117}
118
6a4694a4 119void map__fixup_start(struct map *self)
c338aee8 120{
6a4694a4 121 struct rb_root *symbols = &self->dso->symbols[self->type];
fcf1203a 122 struct rb_node *nd = rb_first(symbols);
c338aee8
ACM
123 if (nd != NULL) {
124 struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
125 self->start = sym->start;
126 }
127}
128
6a4694a4 129void map__fixup_end(struct map *self)
c338aee8 130{
6a4694a4 131 struct rb_root *symbols = &self->dso->symbols[self->type];
fcf1203a 132 struct rb_node *nd = rb_last(symbols);
c338aee8
ACM
133 if (nd != NULL) {
134 struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
135 self->end = sym->end;
136 }
137}
138
d70a5402
ACM
139#define DSO__DELETED "(deleted)"
140
9de89fe7 141int map__load(struct map *self, symbol_filter_t filter)
66bd8424 142{
79406cd7 143 const char *name = self->dso->long_name;
a128168d 144 int nr;
79406cd7 145
a128168d
MH
146 if (dso__loaded(self->dso, self->type))
147 return 0;
148
9de89fe7 149 nr = dso__load(self->dso, self, filter);
79406cd7
ACM
150 if (nr < 0) {
151 if (self->dso->has_build_id) {
152 char sbuild_id[BUILD_ID_SIZE * 2 + 1];
153
154 build_id__sprintf(self->dso->build_id,
155 sizeof(self->dso->build_id),
156 sbuild_id);
157 pr_warning("%s with build id %s not found",
158 name, sbuild_id);
159 } else
160 pr_warning("Failed to open %s", name);
161
162 pr_warning(", continuing without symbols\n");
163 return -1;
164 } else if (nr == 0) {
393be2e3 165#ifndef NO_LIBELF_SUPPORT
79406cd7
ACM
166 const size_t len = strlen(name);
167 const size_t real_len = len - sizeof(DSO__DELETED);
168
169 if (len > sizeof(DSO__DELETED) &&
170 strcmp(name + real_len + 1, DSO__DELETED) == 0) {
e77b15bd
DA
171 pr_warning("%.*s was updated (is prelink enabled?). "
172 "Restart the long running apps that use it!\n",
79406cd7
ACM
173 (int)real_len, name);
174 } else {
175 pr_warning("no symbols found in %s, maybe install "
176 "a debug package?\n", name);
66bd8424 177 }
393be2e3 178#endif
79406cd7 179 return -1;
66bd8424 180 }
9de89fe7
ACM
181 /*
182 * Only applies to the kernel, as its symtabs aren't relative like the
183 * module ones.
184 */
185 if (self->dso->kernel)
186 map__reloc_vmlinux(self);
66bd8424 187
79406cd7
ACM
188 return 0;
189}
190
9de89fe7
ACM
191struct symbol *map__find_symbol(struct map *self, u64 addr,
192 symbol_filter_t filter)
79406cd7 193{
9de89fe7 194 if (map__load(self, filter) < 0)
79406cd7
ACM
195 return NULL;
196
ea08d8cb 197 return dso__find_symbol(self->dso, self->type, addr);
66bd8424
ACM
198}
199
79406cd7
ACM
200struct symbol *map__find_symbol_by_name(struct map *self, const char *name,
201 symbol_filter_t filter)
202{
9de89fe7 203 if (map__load(self, filter) < 0)
79406cd7
ACM
204 return NULL;
205
206 if (!dso__sorted_by_name(self->dso, self->type))
207 dso__sort_by_name(self->dso, self->type);
208
209 return dso__find_symbol_by_name(self->dso, self->type, name);
210}
211
66e274f3
FW
212struct map *map__clone(struct map *self)
213{
214 struct map *map = malloc(sizeof(*self));
215
216 if (!map)
217 return NULL;
218
219 memcpy(map, self, sizeof(*self));
220
221 return map;
222}
223
224int map__overlap(struct map *l, struct map *r)
225{
226 if (l->start > r->start) {
227 struct map *t = l;
228 l = r;
229 r = t;
230 }
231
232 if (l->end > r->start)
233 return 1;
234
235 return 0;
236}
237
238size_t map__fprintf(struct map *self, FILE *fp)
239{
9486aa38 240 return fprintf(fp, " %" PRIx64 "-%" PRIx64 " %" PRIx64 " %s\n",
66e274f3
FW
241 self->start, self->end, self->pgoff, self->dso->name);
242}
7a2b6209 243
547a92e0
AN
244size_t map__fprintf_dsoname(struct map *map, FILE *fp)
245{
246 const char *dsoname;
247
0bc8d205
AN
248 if (map && map->dso && (map->dso->name || map->dso->long_name)) {
249 if (symbol_conf.show_kernel_path && map->dso->long_name)
250 dsoname = map->dso->long_name;
251 else if (map->dso->name)
252 dsoname = map->dso->name;
253 } else
547a92e0
AN
254 dsoname = "[unknown]";
255
256 return fprintf(fp, "%s", dsoname);
257}
258
7a2b6209
KS
259/*
260 * objdump wants/reports absolute IPs for ET_EXEC, and RIPs for ET_DYN.
261 * map->dso->adjust_symbols==1 for ET_EXEC-like cases.
262 */
263u64 map__rip_2objdump(struct map *map, u64 rip)
264{
265 u64 addr = map->dso->adjust_symbols ?
266 map->unmap_ip(map, rip) : /* RIP -> IP */
267 rip;
268 return addr;
269}
ee11b90b 270
98dfd55d 271void map_groups__init(struct map_groups *mg)
c6e718ff
ACM
272{
273 int i;
274 for (i = 0; i < MAP__NR_TYPES; ++i) {
98dfd55d
ACM
275 mg->maps[i] = RB_ROOT;
276 INIT_LIST_HEAD(&mg->removed_maps[i]);
c6e718ff 277 }
98dfd55d 278 mg->machine = NULL;
c6e718ff
ACM
279}
280
98dfd55d 281static void maps__delete(struct rb_root *maps)
591765fd 282{
98dfd55d 283 struct rb_node *next = rb_first(maps);
591765fd
ACM
284
285 while (next) {
286 struct map *pos = rb_entry(next, struct map, rb_node);
287
288 next = rb_next(&pos->rb_node);
98dfd55d 289 rb_erase(&pos->rb_node, maps);
591765fd
ACM
290 map__delete(pos);
291 }
292}
293
98dfd55d 294static void maps__delete_removed(struct list_head *maps)
591765fd
ACM
295{
296 struct map *pos, *n;
297
98dfd55d 298 list_for_each_entry_safe(pos, n, maps, node) {
591765fd
ACM
299 list_del(&pos->node);
300 map__delete(pos);
301 }
302}
303
98dfd55d 304void map_groups__exit(struct map_groups *mg)
591765fd
ACM
305{
306 int i;
307
308 for (i = 0; i < MAP__NR_TYPES; ++i) {
98dfd55d
ACM
309 maps__delete(&mg->maps[i]);
310 maps__delete_removed(&mg->removed_maps[i]);
591765fd
ACM
311 }
312}
313
98dfd55d 314void map_groups__flush(struct map_groups *mg)
c6e718ff
ACM
315{
316 int type;
317
318 for (type = 0; type < MAP__NR_TYPES; type++) {
98dfd55d 319 struct rb_root *root = &mg->maps[type];
c6e718ff
ACM
320 struct rb_node *next = rb_first(root);
321
322 while (next) {
323 struct map *pos = rb_entry(next, struct map, rb_node);
324 next = rb_next(&pos->rb_node);
325 rb_erase(&pos->rb_node, root);
326 /*
327 * We may have references to this map, for
328 * instance in some hist_entry instances, so
329 * just move them to a separate list.
330 */
98dfd55d 331 list_add_tail(&pos->node, &mg->removed_maps[pos->type]);
c6e718ff
ACM
332 }
333 }
334}
335
98dfd55d 336struct symbol *map_groups__find_symbol(struct map_groups *mg,
4b8cf846 337 enum map_type type, u64 addr,
7e5e1b14 338 struct map **mapp,
4b8cf846
ACM
339 symbol_filter_t filter)
340{
98dfd55d 341 struct map *map = map_groups__find(mg, type, addr);
4b8cf846 342
7e5e1b14
ACM
343 if (map != NULL) {
344 if (mapp != NULL)
345 *mapp = map;
4b8cf846 346 return map__find_symbol(map, map->map_ip(map, addr), filter);
7e5e1b14
ACM
347 }
348
349 return NULL;
350}
351
98dfd55d 352struct symbol *map_groups__find_symbol_by_name(struct map_groups *mg,
7e5e1b14
ACM
353 enum map_type type,
354 const char *name,
355 struct map **mapp,
356 symbol_filter_t filter)
357{
358 struct rb_node *nd;
359
98dfd55d 360 for (nd = rb_first(&mg->maps[type]); nd; nd = rb_next(nd)) {
7e5e1b14
ACM
361 struct map *pos = rb_entry(nd, struct map, rb_node);
362 struct symbol *sym = map__find_symbol_by_name(pos, name, filter);
363
364 if (sym == NULL)
365 continue;
366 if (mapp != NULL)
367 *mapp = pos;
368 return sym;
369 }
4b8cf846
ACM
370
371 return NULL;
372}
373
98dfd55d 374size_t __map_groups__fprintf_maps(struct map_groups *mg,
c6e718ff
ACM
375 enum map_type type, int verbose, FILE *fp)
376{
377 size_t printed = fprintf(fp, "%s:\n", map_type__name[type]);
378 struct rb_node *nd;
379
98dfd55d 380 for (nd = rb_first(&mg->maps[type]); nd; nd = rb_next(nd)) {
c6e718ff
ACM
381 struct map *pos = rb_entry(nd, struct map, rb_node);
382 printed += fprintf(fp, "Map:");
383 printed += map__fprintf(pos, fp);
384 if (verbose > 2) {
385 printed += dso__fprintf(pos->dso, type, fp);
386 printed += fprintf(fp, "--\n");
387 }
388 }
389
390 return printed;
391}
392
98dfd55d 393size_t map_groups__fprintf_maps(struct map_groups *mg, int verbose, FILE *fp)
c6e718ff
ACM
394{
395 size_t printed = 0, i;
396 for (i = 0; i < MAP__NR_TYPES; ++i)
98dfd55d 397 printed += __map_groups__fprintf_maps(mg, i, verbose, fp);
c6e718ff
ACM
398 return printed;
399}
400
98dfd55d 401static size_t __map_groups__fprintf_removed_maps(struct map_groups *mg,
c6e718ff
ACM
402 enum map_type type,
403 int verbose, FILE *fp)
404{
405 struct map *pos;
406 size_t printed = 0;
407
98dfd55d 408 list_for_each_entry(pos, &mg->removed_maps[type], node) {
c6e718ff
ACM
409 printed += fprintf(fp, "Map:");
410 printed += map__fprintf(pos, fp);
411 if (verbose > 1) {
412 printed += dso__fprintf(pos->dso, type, fp);
413 printed += fprintf(fp, "--\n");
414 }
415 }
416 return printed;
417}
418
98dfd55d 419static size_t map_groups__fprintf_removed_maps(struct map_groups *mg,
c6e718ff
ACM
420 int verbose, FILE *fp)
421{
422 size_t printed = 0, i;
423 for (i = 0; i < MAP__NR_TYPES; ++i)
98dfd55d 424 printed += __map_groups__fprintf_removed_maps(mg, i, verbose, fp);
c6e718ff
ACM
425 return printed;
426}
427
98dfd55d 428size_t map_groups__fprintf(struct map_groups *mg, int verbose, FILE *fp)
c6e718ff 429{
98dfd55d 430 size_t printed = map_groups__fprintf_maps(mg, verbose, fp);
c6e718ff 431 printed += fprintf(fp, "Removed maps:\n");
98dfd55d 432 return printed + map_groups__fprintf_removed_maps(mg, verbose, fp);
c6e718ff
ACM
433}
434
98dfd55d 435int map_groups__fixup_overlappings(struct map_groups *mg, struct map *map,
c6e718ff
ACM
436 int verbose, FILE *fp)
437{
98dfd55d 438 struct rb_root *root = &mg->maps[map->type];
c6e718ff 439 struct rb_node *next = rb_first(root);
0a1eae39 440 int err = 0;
c6e718ff
ACM
441
442 while (next) {
443 struct map *pos = rb_entry(next, struct map, rb_node);
444 next = rb_next(&pos->rb_node);
445
446 if (!map__overlap(pos, map))
447 continue;
448
449 if (verbose >= 2) {
450 fputs("overlapping maps:\n", fp);
451 map__fprintf(map, fp);
452 map__fprintf(pos, fp);
453 }
454
455 rb_erase(&pos->rb_node, root);
c6e718ff
ACM
456 /*
457 * Now check if we need to create new maps for areas not
458 * overlapped by the new map:
459 */
460 if (map->start > pos->start) {
461 struct map *before = map__clone(pos);
462
0a1eae39
ACM
463 if (before == NULL) {
464 err = -ENOMEM;
465 goto move_map;
466 }
c6e718ff
ACM
467
468 before->end = map->start - 1;
98dfd55d 469 map_groups__insert(mg, before);
c6e718ff
ACM
470 if (verbose >= 2)
471 map__fprintf(before, fp);
472 }
473
474 if (map->end < pos->end) {
475 struct map *after = map__clone(pos);
476
0a1eae39
ACM
477 if (after == NULL) {
478 err = -ENOMEM;
479 goto move_map;
480 }
c6e718ff
ACM
481
482 after->start = map->end + 1;
98dfd55d 483 map_groups__insert(mg, after);
c6e718ff
ACM
484 if (verbose >= 2)
485 map__fprintf(after, fp);
486 }
0a1eae39
ACM
487move_map:
488 /*
489 * If we have references, just move them to a separate list.
490 */
491 if (pos->referenced)
98dfd55d 492 list_add_tail(&pos->node, &mg->removed_maps[map->type]);
0a1eae39
ACM
493 else
494 map__delete(pos);
495
496 if (err)
497 return err;
c6e718ff
ACM
498 }
499
500 return 0;
501}
502
503/*
504 * XXX This should not really _copy_ te maps, but refcount them.
505 */
98dfd55d 506int map_groups__clone(struct map_groups *mg,
c6e718ff
ACM
507 struct map_groups *parent, enum map_type type)
508{
509 struct rb_node *nd;
510 for (nd = rb_first(&parent->maps[type]); nd; nd = rb_next(nd)) {
511 struct map *map = rb_entry(nd, struct map, rb_node);
512 struct map *new = map__clone(map);
513 if (new == NULL)
514 return -ENOMEM;
98dfd55d 515 map_groups__insert(mg, new);
c6e718ff
ACM
516 }
517 return 0;
518}
519
4b8cf846
ACM
520static u64 map__reloc_map_ip(struct map *map, u64 ip)
521{
522 return ip + (s64)map->pgoff;
523}
524
525static u64 map__reloc_unmap_ip(struct map *map, u64 ip)
526{
527 return ip - (s64)map->pgoff;
528}
529
530void map__reloc_vmlinux(struct map *self)
531{
532 struct kmap *kmap = map__kmap(self);
533 s64 reloc;
534
535 if (!kmap->ref_reloc_sym || !kmap->ref_reloc_sym->unrelocated_addr)
536 return;
537
538 reloc = (kmap->ref_reloc_sym->unrelocated_addr -
539 kmap->ref_reloc_sym->addr);
540
541 if (!reloc)
542 return;
543
544 self->map_ip = map__reloc_map_ip;
545 self->unmap_ip = map__reloc_unmap_ip;
546 self->pgoff = reloc;
547}
548
549void maps__insert(struct rb_root *maps, struct map *map)
550{
551 struct rb_node **p = &maps->rb_node;
552 struct rb_node *parent = NULL;
553 const u64 ip = map->start;
554 struct map *m;
555
556 while (*p != NULL) {
557 parent = *p;
558 m = rb_entry(parent, struct map, rb_node);
559 if (ip < m->start)
560 p = &(*p)->rb_left;
561 else
562 p = &(*p)->rb_right;
563 }
564
565 rb_link_node(&map->rb_node, parent, p);
566 rb_insert_color(&map->rb_node, maps);
567}
568
076c6e45
ACM
569void maps__remove(struct rb_root *self, struct map *map)
570{
571 rb_erase(&map->rb_node, self);
572}
573
4b8cf846
ACM
574struct map *maps__find(struct rb_root *maps, u64 ip)
575{
576 struct rb_node **p = &maps->rb_node;
577 struct rb_node *parent = NULL;
578 struct map *m;
579
580 while (*p != NULL) {
581 parent = *p;
582 m = rb_entry(parent, struct map, rb_node);
583 if (ip < m->start)
584 p = &(*p)->rb_left;
585 else if (ip > m->end)
586 p = &(*p)->rb_right;
587 else
588 return m;
589 }
590
591 return NULL;
592}
a1645ce1 593
d28c6223
ACM
594int machine__init(struct machine *self, const char *root_dir, pid_t pid)
595{
596 map_groups__init(&self->kmaps);
597 RB_CLEAR_NODE(&self->rb_node);
598 INIT_LIST_HEAD(&self->user_dsos);
599 INIT_LIST_HEAD(&self->kernel_dsos);
600
b424eba2
ACM
601 self->threads = RB_ROOT;
602 INIT_LIST_HEAD(&self->dead_threads);
603 self->last_match = NULL;
604
d28c6223
ACM
605 self->kmaps.machine = self;
606 self->pid = pid;
607 self->root_dir = strdup(root_dir);
5cd95c2d
DA
608 if (self->root_dir == NULL)
609 return -ENOMEM;
610
611 if (pid != HOST_KERNEL_ID) {
612 struct thread *thread = machine__findnew_thread(self, pid);
613 char comm[64];
614
615 if (thread == NULL)
616 return -ENOMEM;
617
618 snprintf(comm, sizeof(comm), "[guest/%d]", pid);
619 thread__set_comm(thread, comm);
620 }
621
622 return 0;
d28c6223
ACM
623}
624
d65a458b
ACM
625static void dsos__delete(struct list_head *self)
626{
627 struct dso *pos, *n;
628
629 list_for_each_entry_safe(pos, n, self, node) {
630 list_del(&pos->node);
631 dso__delete(pos);
632 }
633}
634
635void machine__exit(struct machine *self)
636{
d65a458b
ACM
637 map_groups__exit(&self->kmaps);
638 dsos__delete(&self->user_dsos);
639 dsos__delete(&self->kernel_dsos);
640 free(self->root_dir);
641 self->root_dir = NULL;
642}
643
076c6e45
ACM
644void machine__delete(struct machine *self)
645{
646 machine__exit(self);
647 free(self);
648}
649
23346f21
ACM
650struct machine *machines__add(struct rb_root *self, pid_t pid,
651 const char *root_dir)
a1645ce1 652{
23346f21 653 struct rb_node **p = &self->rb_node;
a1645ce1 654 struct rb_node *parent = NULL;
23346f21 655 struct machine *pos, *machine = malloc(sizeof(*machine));
a1645ce1 656
23346f21 657 if (!machine)
a1645ce1
ZY
658 return NULL;
659
d28c6223
ACM
660 if (machine__init(machine, root_dir, pid) != 0) {
661 free(machine);
662 return NULL;
663 }
a1645ce1
ZY
664
665 while (*p != NULL) {
666 parent = *p;
23346f21 667 pos = rb_entry(parent, struct machine, rb_node);
a1645ce1
ZY
668 if (pid < pos->pid)
669 p = &(*p)->rb_left;
670 else
671 p = &(*p)->rb_right;
672 }
673
23346f21
ACM
674 rb_link_node(&machine->rb_node, parent, p);
675 rb_insert_color(&machine->rb_node, self);
a1645ce1 676
23346f21 677 return machine;
a1645ce1
ZY
678}
679
23346f21 680struct machine *machines__find(struct rb_root *self, pid_t pid)
a1645ce1 681{
23346f21 682 struct rb_node **p = &self->rb_node;
a1645ce1 683 struct rb_node *parent = NULL;
23346f21
ACM
684 struct machine *machine;
685 struct machine *default_machine = NULL;
a1645ce1
ZY
686
687 while (*p != NULL) {
688 parent = *p;
23346f21
ACM
689 machine = rb_entry(parent, struct machine, rb_node);
690 if (pid < machine->pid)
a1645ce1 691 p = &(*p)->rb_left;
23346f21 692 else if (pid > machine->pid)
a1645ce1
ZY
693 p = &(*p)->rb_right;
694 else
23346f21
ACM
695 return machine;
696 if (!machine->pid)
697 default_machine = machine;
a1645ce1
ZY
698 }
699
23346f21 700 return default_machine;
a1645ce1
ZY
701}
702
23346f21 703struct machine *machines__findnew(struct rb_root *self, pid_t pid)
a1645ce1
ZY
704{
705 char path[PATH_MAX];
7ed97ad4 706 const char *root_dir = "";
23346f21 707 struct machine *machine = machines__find(self, pid);
a1645ce1 708
7ed97ad4
DA
709 if (machine && (machine->pid == pid))
710 goto out;
711
712 if ((pid != HOST_KERNEL_ID) &&
713 (pid != DEFAULT_GUEST_KERNEL_ID) &&
714 (symbol_conf.guestmount)) {
715 sprintf(path, "%s/%d", symbol_conf.guestmount, pid);
716 if (access(path, R_OK)) {
c80c3c26
DA
717 static struct strlist *seen;
718
719 if (!seen)
720 seen = strlist__new(true, NULL);
721
722 if (!strlist__has_entry(seen, path)) {
723 pr_err("Can't access file %s\n", path);
724 strlist__add(seen, path);
725 }
7ed97ad4
DA
726 machine = NULL;
727 goto out;
a1645ce1 728 }
7ed97ad4 729 root_dir = path;
a1645ce1
ZY
730 }
731
7ed97ad4
DA
732 machine = machines__add(self, pid, root_dir);
733
a1645ce1 734out:
23346f21 735 return machine;
a1645ce1
ZY
736}
737
23346f21 738void machines__process(struct rb_root *self, machine__process_t process, void *data)
a1645ce1
ZY
739{
740 struct rb_node *nd;
741
23346f21
ACM
742 for (nd = rb_first(self); nd; nd = rb_next(nd)) {
743 struct machine *pos = rb_entry(nd, struct machine, rb_node);
a1645ce1
ZY
744 process(pos, data);
745 }
746}
747
48ea8f54 748char *machine__mmap_name(struct machine *self, char *bf, size_t size)
a1645ce1 749{
23346f21 750 if (machine__is_host(self))
48ea8f54 751 snprintf(bf, size, "[%s]", "kernel.kallsyms");
23346f21 752 else if (machine__is_default_guest(self))
48ea8f54 753 snprintf(bf, size, "[%s]", "guest.kernel.kallsyms");
a1645ce1 754 else
48ea8f54 755 snprintf(bf, size, "[%s.%d]", "guest.kernel.kallsyms", self->pid);
a1645ce1 756
48ea8f54 757 return bf;
a1645ce1 758}
adb5d2a4
DA
759
760void machines__set_id_hdr_size(struct rb_root *machines, u16 id_hdr_size)
761{
762 struct rb_node *node;
763 struct machine *machine;
764
765 for (node = rb_first(machines); node; node = rb_next(node)) {
766 machine = rb_entry(node, struct machine, rb_node);
767 machine->id_hdr_size = id_hdr_size;
768 }
769
770 return;
771}