xref: /linux/tools/perf/util/machine.c (revision c1a604dff486399ae0be95e6396e0158df95ad5d)
1 // SPDX-License-Identifier: GPL-2.0
2 #include <dirent.h>
3 #include <errno.h>
4 #include <inttypes.h>
5 #include <regex.h>
6 #include "callchain.h"
7 #include "debug.h"
8 #include "event.h"
9 #include "evsel.h"
10 #include "hist.h"
11 #include "machine.h"
12 #include "map.h"
13 #include "srcline.h"
14 #include "symbol.h"
15 #include "sort.h"
16 #include "strlist.h"
17 #include "target.h"
18 #include "thread.h"
19 #include "util.h"
20 #include "vdso.h"
21 #include <stdbool.h>
22 #include <sys/types.h>
23 #include <sys/stat.h>
24 #include <unistd.h>
25 #include "unwind.h"
26 #include "linux/hash.h"
27 #include "asm/bug.h"
28 #include "bpf-event.h"
29 
30 #include <linux/ctype.h>
31 #include <symbol/kallsyms.h>
32 #include <linux/mman.h>
33 #include <linux/zalloc.h>
34 
35 static void __machine__remove_thread(struct machine *machine, struct thread *th, bool lock);
36 
37 static void dsos__init(struct dsos *dsos)
38 {
39 	INIT_LIST_HEAD(&dsos->head);
40 	dsos->root = RB_ROOT;
41 	init_rwsem(&dsos->lock);
42 }
43 
44 static void machine__threads_init(struct machine *machine)
45 {
46 	int i;
47 
48 	for (i = 0; i < THREADS__TABLE_SIZE; i++) {
49 		struct threads *threads = &machine->threads[i];
50 		threads->entries = RB_ROOT_CACHED;
51 		init_rwsem(&threads->lock);
52 		threads->nr = 0;
53 		INIT_LIST_HEAD(&threads->dead);
54 		threads->last_match = NULL;
55 	}
56 }
57 
58 static int machine__set_mmap_name(struct machine *machine)
59 {
60 	if (machine__is_host(machine))
61 		machine->mmap_name = strdup("[kernel.kallsyms]");
62 	else if (machine__is_default_guest(machine))
63 		machine->mmap_name = strdup("[guest.kernel.kallsyms]");
64 	else if (asprintf(&machine->mmap_name, "[guest.kernel.kallsyms.%d]",
65 			  machine->pid) < 0)
66 		machine->mmap_name = NULL;
67 
68 	return machine->mmap_name ? 0 : -ENOMEM;
69 }
70 
71 int machine__init(struct machine *machine, const char *root_dir, pid_t pid)
72 {
73 	int err = -ENOMEM;
74 
75 	memset(machine, 0, sizeof(*machine));
76 	map_groups__init(&machine->kmaps, machine);
77 	RB_CLEAR_NODE(&machine->rb_node);
78 	dsos__init(&machine->dsos);
79 
80 	machine__threads_init(machine);
81 
82 	machine->vdso_info = NULL;
83 	machine->env = NULL;
84 
85 	machine->pid = pid;
86 
87 	machine->id_hdr_size = 0;
88 	machine->kptr_restrict_warned = false;
89 	machine->comm_exec = false;
90 	machine->kernel_start = 0;
91 	machine->vmlinux_map = NULL;
92 
93 	machine->root_dir = strdup(root_dir);
94 	if (machine->root_dir == NULL)
95 		return -ENOMEM;
96 
97 	if (machine__set_mmap_name(machine))
98 		goto out;
99 
100 	if (pid != HOST_KERNEL_ID) {
101 		struct thread *thread = machine__findnew_thread(machine, -1,
102 								pid);
103 		char comm[64];
104 
105 		if (thread == NULL)
106 			goto out;
107 
108 		snprintf(comm, sizeof(comm), "[guest/%d]", pid);
109 		thread__set_comm(thread, comm, 0);
110 		thread__put(thread);
111 	}
112 
113 	machine->current_tid = NULL;
114 	err = 0;
115 
116 out:
117 	if (err) {
118 		zfree(&machine->root_dir);
119 		zfree(&machine->mmap_name);
120 	}
121 	return 0;
122 }
123 
124 struct machine *machine__new_host(void)
125 {
126 	struct machine *machine = malloc(sizeof(*machine));
127 
128 	if (machine != NULL) {
129 		machine__init(machine, "", HOST_KERNEL_ID);
130 
131 		if (machine__create_kernel_maps(machine) < 0)
132 			goto out_delete;
133 	}
134 
135 	return machine;
136 out_delete:
137 	free(machine);
138 	return NULL;
139 }
140 
141 struct machine *machine__new_kallsyms(void)
142 {
143 	struct machine *machine = machine__new_host();
144 	/*
145 	 * FIXME:
146 	 * 1) We should switch to machine__load_kallsyms(), i.e. not explicitly
147 	 *    ask for not using the kcore parsing code, once this one is fixed
148 	 *    to create a map per module.
149 	 */
150 	if (machine && machine__load_kallsyms(machine, "/proc/kallsyms") <= 0) {
151 		machine__delete(machine);
152 		machine = NULL;
153 	}
154 
155 	return machine;
156 }
157 
158 static void dsos__purge(struct dsos *dsos)
159 {
160 	struct dso *pos, *n;
161 
162 	down_write(&dsos->lock);
163 
164 	list_for_each_entry_safe(pos, n, &dsos->head, node) {
165 		RB_CLEAR_NODE(&pos->rb_node);
166 		pos->root = NULL;
167 		list_del_init(&pos->node);
168 		dso__put(pos);
169 	}
170 
171 	up_write(&dsos->lock);
172 }
173 
174 static void dsos__exit(struct dsos *dsos)
175 {
176 	dsos__purge(dsos);
177 	exit_rwsem(&dsos->lock);
178 }
179 
180 void machine__delete_threads(struct machine *machine)
181 {
182 	struct rb_node *nd;
183 	int i;
184 
185 	for (i = 0; i < THREADS__TABLE_SIZE; i++) {
186 		struct threads *threads = &machine->threads[i];
187 		down_write(&threads->lock);
188 		nd = rb_first_cached(&threads->entries);
189 		while (nd) {
190 			struct thread *t = rb_entry(nd, struct thread, rb_node);
191 
192 			nd = rb_next(nd);
193 			__machine__remove_thread(machine, t, false);
194 		}
195 		up_write(&threads->lock);
196 	}
197 }
198 
199 void machine__exit(struct machine *machine)
200 {
201 	int i;
202 
203 	if (machine == NULL)
204 		return;
205 
206 	machine__destroy_kernel_maps(machine);
207 	map_groups__exit(&machine->kmaps);
208 	dsos__exit(&machine->dsos);
209 	machine__exit_vdso(machine);
210 	zfree(&machine->root_dir);
211 	zfree(&machine->mmap_name);
212 	zfree(&machine->current_tid);
213 
214 	for (i = 0; i < THREADS__TABLE_SIZE; i++) {
215 		struct threads *threads = &machine->threads[i];
216 		struct thread *thread, *n;
217 		/*
218 		 * Forget about the dead, at this point whatever threads were
219 		 * left in the dead lists better have a reference count taken
220 		 * by who is using them, and then, when they drop those references
221 		 * and it finally hits zero, thread__put() will check and see that
222 		 * its not in the dead threads list and will not try to remove it
223 		 * from there, just calling thread__delete() straight away.
224 		 */
225 		list_for_each_entry_safe(thread, n, &threads->dead, node)
226 			list_del_init(&thread->node);
227 
228 		exit_rwsem(&threads->lock);
229 	}
230 }
231 
232 void machine__delete(struct machine *machine)
233 {
234 	if (machine) {
235 		machine__exit(machine);
236 		free(machine);
237 	}
238 }
239 
240 void machines__init(struct machines *machines)
241 {
242 	machine__init(&machines->host, "", HOST_KERNEL_ID);
243 	machines->guests = RB_ROOT_CACHED;
244 }
245 
246 void machines__exit(struct machines *machines)
247 {
248 	machine__exit(&machines->host);
249 	/* XXX exit guest */
250 }
251 
252 struct machine *machines__add(struct machines *machines, pid_t pid,
253 			      const char *root_dir)
254 {
255 	struct rb_node **p = &machines->guests.rb_root.rb_node;
256 	struct rb_node *parent = NULL;
257 	struct machine *pos, *machine = malloc(sizeof(*machine));
258 	bool leftmost = true;
259 
260 	if (machine == NULL)
261 		return NULL;
262 
263 	if (machine__init(machine, root_dir, pid) != 0) {
264 		free(machine);
265 		return NULL;
266 	}
267 
268 	while (*p != NULL) {
269 		parent = *p;
270 		pos = rb_entry(parent, struct machine, rb_node);
271 		if (pid < pos->pid)
272 			p = &(*p)->rb_left;
273 		else {
274 			p = &(*p)->rb_right;
275 			leftmost = false;
276 		}
277 	}
278 
279 	rb_link_node(&machine->rb_node, parent, p);
280 	rb_insert_color_cached(&machine->rb_node, &machines->guests, leftmost);
281 
282 	return machine;
283 }
284 
285 void machines__set_comm_exec(struct machines *machines, bool comm_exec)
286 {
287 	struct rb_node *nd;
288 
289 	machines->host.comm_exec = comm_exec;
290 
291 	for (nd = rb_first_cached(&machines->guests); nd; nd = rb_next(nd)) {
292 		struct machine *machine = rb_entry(nd, struct machine, rb_node);
293 
294 		machine->comm_exec = comm_exec;
295 	}
296 }
297 
298 struct machine *machines__find(struct machines *machines, pid_t pid)
299 {
300 	struct rb_node **p = &machines->guests.rb_root.rb_node;
301 	struct rb_node *parent = NULL;
302 	struct machine *machine;
303 	struct machine *default_machine = NULL;
304 
305 	if (pid == HOST_KERNEL_ID)
306 		return &machines->host;
307 
308 	while (*p != NULL) {
309 		parent = *p;
310 		machine = rb_entry(parent, struct machine, rb_node);
311 		if (pid < machine->pid)
312 			p = &(*p)->rb_left;
313 		else if (pid > machine->pid)
314 			p = &(*p)->rb_right;
315 		else
316 			return machine;
317 		if (!machine->pid)
318 			default_machine = machine;
319 	}
320 
321 	return default_machine;
322 }
323 
324 struct machine *machines__findnew(struct machines *machines, pid_t pid)
325 {
326 	char path[PATH_MAX];
327 	const char *root_dir = "";
328 	struct machine *machine = machines__find(machines, pid);
329 
330 	if (machine && (machine->pid == pid))
331 		goto out;
332 
333 	if ((pid != HOST_KERNEL_ID) &&
334 	    (pid != DEFAULT_GUEST_KERNEL_ID) &&
335 	    (symbol_conf.guestmount)) {
336 		sprintf(path, "%s/%d", symbol_conf.guestmount, pid);
337 		if (access(path, R_OK)) {
338 			static struct strlist *seen;
339 
340 			if (!seen)
341 				seen = strlist__new(NULL, NULL);
342 
343 			if (!strlist__has_entry(seen, path)) {
344 				pr_err("Can't access file %s\n", path);
345 				strlist__add(seen, path);
346 			}
347 			machine = NULL;
348 			goto out;
349 		}
350 		root_dir = path;
351 	}
352 
353 	machine = machines__add(machines, pid, root_dir);
354 out:
355 	return machine;
356 }
357 
358 void machines__process_guests(struct machines *machines,
359 			      machine__process_t process, void *data)
360 {
361 	struct rb_node *nd;
362 
363 	for (nd = rb_first_cached(&machines->guests); nd; nd = rb_next(nd)) {
364 		struct machine *pos = rb_entry(nd, struct machine, rb_node);
365 		process(pos, data);
366 	}
367 }
368 
369 void machines__set_id_hdr_size(struct machines *machines, u16 id_hdr_size)
370 {
371 	struct rb_node *node;
372 	struct machine *machine;
373 
374 	machines->host.id_hdr_size = id_hdr_size;
375 
376 	for (node = rb_first_cached(&machines->guests); node;
377 	     node = rb_next(node)) {
378 		machine = rb_entry(node, struct machine, rb_node);
379 		machine->id_hdr_size = id_hdr_size;
380 	}
381 
382 	return;
383 }
384 
385 static void machine__update_thread_pid(struct machine *machine,
386 				       struct thread *th, pid_t pid)
387 {
388 	struct thread *leader;
389 
390 	if (pid == th->pid_ || pid == -1 || th->pid_ != -1)
391 		return;
392 
393 	th->pid_ = pid;
394 
395 	if (th->pid_ == th->tid)
396 		return;
397 
398 	leader = __machine__findnew_thread(machine, th->pid_, th->pid_);
399 	if (!leader)
400 		goto out_err;
401 
402 	if (!leader->mg)
403 		leader->mg = map_groups__new(machine);
404 
405 	if (!leader->mg)
406 		goto out_err;
407 
408 	if (th->mg == leader->mg)
409 		return;
410 
411 	if (th->mg) {
412 		/*
413 		 * Maps are created from MMAP events which provide the pid and
414 		 * tid.  Consequently there never should be any maps on a thread
415 		 * with an unknown pid.  Just print an error if there are.
416 		 */
417 		if (!map_groups__empty(th->mg))
418 			pr_err("Discarding thread maps for %d:%d\n",
419 			       th->pid_, th->tid);
420 		map_groups__put(th->mg);
421 	}
422 
423 	th->mg = map_groups__get(leader->mg);
424 out_put:
425 	thread__put(leader);
426 	return;
427 out_err:
428 	pr_err("Failed to join map groups for %d:%d\n", th->pid_, th->tid);
429 	goto out_put;
430 }
431 
432 /*
433  * Front-end cache - TID lookups come in blocks,
434  * so most of the time we dont have to look up
435  * the full rbtree:
436  */
437 static struct thread*
438 __threads__get_last_match(struct threads *threads, struct machine *machine,
439 			  int pid, int tid)
440 {
441 	struct thread *th;
442 
443 	th = threads->last_match;
444 	if (th != NULL) {
445 		if (th->tid == tid) {
446 			machine__update_thread_pid(machine, th, pid);
447 			return thread__get(th);
448 		}
449 
450 		threads->last_match = NULL;
451 	}
452 
453 	return NULL;
454 }
455 
456 static struct thread*
457 threads__get_last_match(struct threads *threads, struct machine *machine,
458 			int pid, int tid)
459 {
460 	struct thread *th = NULL;
461 
462 	if (perf_singlethreaded)
463 		th = __threads__get_last_match(threads, machine, pid, tid);
464 
465 	return th;
466 }
467 
468 static void
469 __threads__set_last_match(struct threads *threads, struct thread *th)
470 {
471 	threads->last_match = th;
472 }
473 
474 static void
475 threads__set_last_match(struct threads *threads, struct thread *th)
476 {
477 	if (perf_singlethreaded)
478 		__threads__set_last_match(threads, th);
479 }
480 
481 /*
482  * Caller must eventually drop thread->refcnt returned with a successful
483  * lookup/new thread inserted.
484  */
485 static struct thread *____machine__findnew_thread(struct machine *machine,
486 						  struct threads *threads,
487 						  pid_t pid, pid_t tid,
488 						  bool create)
489 {
490 	struct rb_node **p = &threads->entries.rb_root.rb_node;
491 	struct rb_node *parent = NULL;
492 	struct thread *th;
493 	bool leftmost = true;
494 
495 	th = threads__get_last_match(threads, machine, pid, tid);
496 	if (th)
497 		return th;
498 
499 	while (*p != NULL) {
500 		parent = *p;
501 		th = rb_entry(parent, struct thread, rb_node);
502 
503 		if (th->tid == tid) {
504 			threads__set_last_match(threads, th);
505 			machine__update_thread_pid(machine, th, pid);
506 			return thread__get(th);
507 		}
508 
509 		if (tid < th->tid)
510 			p = &(*p)->rb_left;
511 		else {
512 			p = &(*p)->rb_right;
513 			leftmost = false;
514 		}
515 	}
516 
517 	if (!create)
518 		return NULL;
519 
520 	th = thread__new(pid, tid);
521 	if (th != NULL) {
522 		rb_link_node(&th->rb_node, parent, p);
523 		rb_insert_color_cached(&th->rb_node, &threads->entries, leftmost);
524 
525 		/*
526 		 * We have to initialize map_groups separately
527 		 * after rb tree is updated.
528 		 *
529 		 * The reason is that we call machine__findnew_thread
530 		 * within thread__init_map_groups to find the thread
531 		 * leader and that would screwed the rb tree.
532 		 */
533 		if (thread__init_map_groups(th, machine)) {
534 			rb_erase_cached(&th->rb_node, &threads->entries);
535 			RB_CLEAR_NODE(&th->rb_node);
536 			thread__put(th);
537 			return NULL;
538 		}
539 		/*
540 		 * It is now in the rbtree, get a ref
541 		 */
542 		thread__get(th);
543 		threads__set_last_match(threads, th);
544 		++threads->nr;
545 	}
546 
547 	return th;
548 }
549 
550 struct thread *__machine__findnew_thread(struct machine *machine, pid_t pid, pid_t tid)
551 {
552 	return ____machine__findnew_thread(machine, machine__threads(machine, tid), pid, tid, true);
553 }
554 
555 struct thread *machine__findnew_thread(struct machine *machine, pid_t pid,
556 				       pid_t tid)
557 {
558 	struct threads *threads = machine__threads(machine, tid);
559 	struct thread *th;
560 
561 	down_write(&threads->lock);
562 	th = __machine__findnew_thread(machine, pid, tid);
563 	up_write(&threads->lock);
564 	return th;
565 }
566 
567 struct thread *machine__find_thread(struct machine *machine, pid_t pid,
568 				    pid_t tid)
569 {
570 	struct threads *threads = machine__threads(machine, tid);
571 	struct thread *th;
572 
573 	down_read(&threads->lock);
574 	th =  ____machine__findnew_thread(machine, threads, pid, tid, false);
575 	up_read(&threads->lock);
576 	return th;
577 }
578 
579 struct comm *machine__thread_exec_comm(struct machine *machine,
580 				       struct thread *thread)
581 {
582 	if (machine->comm_exec)
583 		return thread__exec_comm(thread);
584 	else
585 		return thread__comm(thread);
586 }
587 
588 int machine__process_comm_event(struct machine *machine, union perf_event *event,
589 				struct perf_sample *sample)
590 {
591 	struct thread *thread = machine__findnew_thread(machine,
592 							event->comm.pid,
593 							event->comm.tid);
594 	bool exec = event->header.misc & PERF_RECORD_MISC_COMM_EXEC;
595 	int err = 0;
596 
597 	if (exec)
598 		machine->comm_exec = true;
599 
600 	if (dump_trace)
601 		perf_event__fprintf_comm(event, stdout);
602 
603 	if (thread == NULL ||
604 	    __thread__set_comm(thread, event->comm.comm, sample->time, exec)) {
605 		dump_printf("problem processing PERF_RECORD_COMM, skipping event.\n");
606 		err = -1;
607 	}
608 
609 	thread__put(thread);
610 
611 	return err;
612 }
613 
614 int machine__process_namespaces_event(struct machine *machine __maybe_unused,
615 				      union perf_event *event,
616 				      struct perf_sample *sample __maybe_unused)
617 {
618 	struct thread *thread = machine__findnew_thread(machine,
619 							event->namespaces.pid,
620 							event->namespaces.tid);
621 	int err = 0;
622 
623 	WARN_ONCE(event->namespaces.nr_namespaces > NR_NAMESPACES,
624 		  "\nWARNING: kernel seems to support more namespaces than perf"
625 		  " tool.\nTry updating the perf tool..\n\n");
626 
627 	WARN_ONCE(event->namespaces.nr_namespaces < NR_NAMESPACES,
628 		  "\nWARNING: perf tool seems to support more namespaces than"
629 		  " the kernel.\nTry updating the kernel..\n\n");
630 
631 	if (dump_trace)
632 		perf_event__fprintf_namespaces(event, stdout);
633 
634 	if (thread == NULL ||
635 	    thread__set_namespaces(thread, sample->time, &event->namespaces)) {
636 		dump_printf("problem processing PERF_RECORD_NAMESPACES, skipping event.\n");
637 		err = -1;
638 	}
639 
640 	thread__put(thread);
641 
642 	return err;
643 }
644 
645 int machine__process_lost_event(struct machine *machine __maybe_unused,
646 				union perf_event *event, struct perf_sample *sample __maybe_unused)
647 {
648 	dump_printf(": id:%" PRI_lu64 ": lost:%" PRI_lu64 "\n",
649 		    event->lost.id, event->lost.lost);
650 	return 0;
651 }
652 
653 int machine__process_lost_samples_event(struct machine *machine __maybe_unused,
654 					union perf_event *event, struct perf_sample *sample)
655 {
656 	dump_printf(": id:%" PRIu64 ": lost samples :%" PRI_lu64 "\n",
657 		    sample->id, event->lost_samples.lost);
658 	return 0;
659 }
660 
661 static struct dso *machine__findnew_module_dso(struct machine *machine,
662 					       struct kmod_path *m,
663 					       const char *filename)
664 {
665 	struct dso *dso;
666 
667 	down_write(&machine->dsos.lock);
668 
669 	dso = __dsos__find(&machine->dsos, m->name, true);
670 	if (!dso) {
671 		dso = __dsos__addnew(&machine->dsos, m->name);
672 		if (dso == NULL)
673 			goto out_unlock;
674 
675 		dso__set_module_info(dso, m, machine);
676 		dso__set_long_name(dso, strdup(filename), true);
677 	}
678 
679 	dso__get(dso);
680 out_unlock:
681 	up_write(&machine->dsos.lock);
682 	return dso;
683 }
684 
685 int machine__process_aux_event(struct machine *machine __maybe_unused,
686 			       union perf_event *event)
687 {
688 	if (dump_trace)
689 		perf_event__fprintf_aux(event, stdout);
690 	return 0;
691 }
692 
693 int machine__process_itrace_start_event(struct machine *machine __maybe_unused,
694 					union perf_event *event)
695 {
696 	if (dump_trace)
697 		perf_event__fprintf_itrace_start(event, stdout);
698 	return 0;
699 }
700 
701 int machine__process_switch_event(struct machine *machine __maybe_unused,
702 				  union perf_event *event)
703 {
704 	if (dump_trace)
705 		perf_event__fprintf_switch(event, stdout);
706 	return 0;
707 }
708 
709 static int machine__process_ksymbol_register(struct machine *machine,
710 					     union perf_event *event,
711 					     struct perf_sample *sample __maybe_unused)
712 {
713 	struct symbol *sym;
714 	struct map *map;
715 
716 	map = map_groups__find(&machine->kmaps, event->ksymbol.addr);
717 	if (!map) {
718 		map = dso__new_map(event->ksymbol.name);
719 		if (!map)
720 			return -ENOMEM;
721 
722 		map->start = event->ksymbol.addr;
723 		map->end = map->start + event->ksymbol.len;
724 		map_groups__insert(&machine->kmaps, map);
725 	}
726 
727 	sym = symbol__new(map->map_ip(map, map->start),
728 			  event->ksymbol.len,
729 			  0, 0, event->ksymbol.name);
730 	if (!sym)
731 		return -ENOMEM;
732 	dso__insert_symbol(map->dso, sym);
733 	return 0;
734 }
735 
736 static int machine__process_ksymbol_unregister(struct machine *machine,
737 					       union perf_event *event,
738 					       struct perf_sample *sample __maybe_unused)
739 {
740 	struct map *map;
741 
742 	map = map_groups__find(&machine->kmaps, event->ksymbol.addr);
743 	if (map)
744 		map_groups__remove(&machine->kmaps, map);
745 
746 	return 0;
747 }
748 
749 int machine__process_ksymbol(struct machine *machine __maybe_unused,
750 			     union perf_event *event,
751 			     struct perf_sample *sample)
752 {
753 	if (dump_trace)
754 		perf_event__fprintf_ksymbol(event, stdout);
755 
756 	if (event->ksymbol.flags & PERF_RECORD_KSYMBOL_FLAGS_UNREGISTER)
757 		return machine__process_ksymbol_unregister(machine, event,
758 							   sample);
759 	return machine__process_ksymbol_register(machine, event, sample);
760 }
761 
762 static void dso__adjust_kmod_long_name(struct dso *dso, const char *filename)
763 {
764 	const char *dup_filename;
765 
766 	if (!filename || !dso || !dso->long_name)
767 		return;
768 	if (dso->long_name[0] != '[')
769 		return;
770 	if (!strchr(filename, '/'))
771 		return;
772 
773 	dup_filename = strdup(filename);
774 	if (!dup_filename)
775 		return;
776 
777 	dso__set_long_name(dso, dup_filename, true);
778 }
779 
780 struct map *machine__findnew_module_map(struct machine *machine, u64 start,
781 					const char *filename)
782 {
783 	struct map *map = NULL;
784 	struct dso *dso = NULL;
785 	struct kmod_path m;
786 
787 	if (kmod_path__parse_name(&m, filename))
788 		return NULL;
789 
790 	map = map_groups__find_by_name(&machine->kmaps, m.name);
791 	if (map) {
792 		/*
793 		 * If the map's dso is an offline module, give dso__load()
794 		 * a chance to find the file path of that module by fixing
795 		 * long_name.
796 		 */
797 		dso__adjust_kmod_long_name(map->dso, filename);
798 		goto out;
799 	}
800 
801 	dso = machine__findnew_module_dso(machine, &m, filename);
802 	if (dso == NULL)
803 		goto out;
804 
805 	map = map__new2(start, dso);
806 	if (map == NULL)
807 		goto out;
808 
809 	map_groups__insert(&machine->kmaps, map);
810 
811 	/* Put the map here because map_groups__insert alread got it */
812 	map__put(map);
813 out:
814 	/* put the dso here, corresponding to  machine__findnew_module_dso */
815 	dso__put(dso);
816 	zfree(&m.name);
817 	return map;
818 }
819 
820 size_t machines__fprintf_dsos(struct machines *machines, FILE *fp)
821 {
822 	struct rb_node *nd;
823 	size_t ret = __dsos__fprintf(&machines->host.dsos.head, fp);
824 
825 	for (nd = rb_first_cached(&machines->guests); nd; nd = rb_next(nd)) {
826 		struct machine *pos = rb_entry(nd, struct machine, rb_node);
827 		ret += __dsos__fprintf(&pos->dsos.head, fp);
828 	}
829 
830 	return ret;
831 }
832 
833 size_t machine__fprintf_dsos_buildid(struct machine *m, FILE *fp,
834 				     bool (skip)(struct dso *dso, int parm), int parm)
835 {
836 	return __dsos__fprintf_buildid(&m->dsos.head, fp, skip, parm);
837 }
838 
839 size_t machines__fprintf_dsos_buildid(struct machines *machines, FILE *fp,
840 				     bool (skip)(struct dso *dso, int parm), int parm)
841 {
842 	struct rb_node *nd;
843 	size_t ret = machine__fprintf_dsos_buildid(&machines->host, fp, skip, parm);
844 
845 	for (nd = rb_first_cached(&machines->guests); nd; nd = rb_next(nd)) {
846 		struct machine *pos = rb_entry(nd, struct machine, rb_node);
847 		ret += machine__fprintf_dsos_buildid(pos, fp, skip, parm);
848 	}
849 	return ret;
850 }
851 
852 size_t machine__fprintf_vmlinux_path(struct machine *machine, FILE *fp)
853 {
854 	int i;
855 	size_t printed = 0;
856 	struct dso *kdso = machine__kernel_map(machine)->dso;
857 
858 	if (kdso->has_build_id) {
859 		char filename[PATH_MAX];
860 		if (dso__build_id_filename(kdso, filename, sizeof(filename),
861 					   false))
862 			printed += fprintf(fp, "[0] %s\n", filename);
863 	}
864 
865 	for (i = 0; i < vmlinux_path__nr_entries; ++i)
866 		printed += fprintf(fp, "[%d] %s\n",
867 				   i + kdso->has_build_id, vmlinux_path[i]);
868 
869 	return printed;
870 }
871 
872 size_t machine__fprintf(struct machine *machine, FILE *fp)
873 {
874 	struct rb_node *nd;
875 	size_t ret;
876 	int i;
877 
878 	for (i = 0; i < THREADS__TABLE_SIZE; i++) {
879 		struct threads *threads = &machine->threads[i];
880 
881 		down_read(&threads->lock);
882 
883 		ret = fprintf(fp, "Threads: %u\n", threads->nr);
884 
885 		for (nd = rb_first_cached(&threads->entries); nd;
886 		     nd = rb_next(nd)) {
887 			struct thread *pos = rb_entry(nd, struct thread, rb_node);
888 
889 			ret += thread__fprintf(pos, fp);
890 		}
891 
892 		up_read(&threads->lock);
893 	}
894 	return ret;
895 }
896 
897 static struct dso *machine__get_kernel(struct machine *machine)
898 {
899 	const char *vmlinux_name = machine->mmap_name;
900 	struct dso *kernel;
901 
902 	if (machine__is_host(machine)) {
903 		if (symbol_conf.vmlinux_name)
904 			vmlinux_name = symbol_conf.vmlinux_name;
905 
906 		kernel = machine__findnew_kernel(machine, vmlinux_name,
907 						 "[kernel]", DSO_TYPE_KERNEL);
908 	} else {
909 		if (symbol_conf.default_guest_vmlinux_name)
910 			vmlinux_name = symbol_conf.default_guest_vmlinux_name;
911 
912 		kernel = machine__findnew_kernel(machine, vmlinux_name,
913 						 "[guest.kernel]",
914 						 DSO_TYPE_GUEST_KERNEL);
915 	}
916 
917 	if (kernel != NULL && (!kernel->has_build_id))
918 		dso__read_running_kernel_build_id(kernel, machine);
919 
920 	return kernel;
921 }
922 
923 struct process_args {
924 	u64 start;
925 };
926 
927 void machine__get_kallsyms_filename(struct machine *machine, char *buf,
928 				    size_t bufsz)
929 {
930 	if (machine__is_default_guest(machine))
931 		scnprintf(buf, bufsz, "%s", symbol_conf.default_guest_kallsyms);
932 	else
933 		scnprintf(buf, bufsz, "%s/proc/kallsyms", machine->root_dir);
934 }
935 
936 const char *ref_reloc_sym_names[] = {"_text", "_stext", NULL};
937 
938 /* Figure out the start address of kernel map from /proc/kallsyms.
939  * Returns the name of the start symbol in *symbol_name. Pass in NULL as
940  * symbol_name if it's not that important.
941  */
942 static int machine__get_running_kernel_start(struct machine *machine,
943 					     const char **symbol_name,
944 					     u64 *start, u64 *end)
945 {
946 	char filename[PATH_MAX];
947 	int i, err = -1;
948 	const char *name;
949 	u64 addr = 0;
950 
951 	machine__get_kallsyms_filename(machine, filename, PATH_MAX);
952 
953 	if (symbol__restricted_filename(filename, "/proc/kallsyms"))
954 		return 0;
955 
956 	for (i = 0; (name = ref_reloc_sym_names[i]) != NULL; i++) {
957 		err = kallsyms__get_function_start(filename, name, &addr);
958 		if (!err)
959 			break;
960 	}
961 
962 	if (err)
963 		return -1;
964 
965 	if (symbol_name)
966 		*symbol_name = name;
967 
968 	*start = addr;
969 
970 	err = kallsyms__get_function_start(filename, "_etext", &addr);
971 	if (!err)
972 		*end = addr;
973 
974 	return 0;
975 }
976 
977 int machine__create_extra_kernel_map(struct machine *machine,
978 				     struct dso *kernel,
979 				     struct extra_kernel_map *xm)
980 {
981 	struct kmap *kmap;
982 	struct map *map;
983 
984 	map = map__new2(xm->start, kernel);
985 	if (!map)
986 		return -1;
987 
988 	map->end   = xm->end;
989 	map->pgoff = xm->pgoff;
990 
991 	kmap = map__kmap(map);
992 
993 	kmap->kmaps = &machine->kmaps;
994 	strlcpy(kmap->name, xm->name, KMAP_NAME_LEN);
995 
996 	map_groups__insert(&machine->kmaps, map);
997 
998 	pr_debug2("Added extra kernel map %s %" PRIx64 "-%" PRIx64 "\n",
999 		  kmap->name, map->start, map->end);
1000 
1001 	map__put(map);
1002 
1003 	return 0;
1004 }
1005 
1006 static u64 find_entry_trampoline(struct dso *dso)
1007 {
1008 	/* Duplicates are removed so lookup all aliases */
1009 	const char *syms[] = {
1010 		"_entry_trampoline",
1011 		"__entry_trampoline_start",
1012 		"entry_SYSCALL_64_trampoline",
1013 	};
1014 	struct symbol *sym = dso__first_symbol(dso);
1015 	unsigned int i;
1016 
1017 	for (; sym; sym = dso__next_symbol(sym)) {
1018 		if (sym->binding != STB_GLOBAL)
1019 			continue;
1020 		for (i = 0; i < ARRAY_SIZE(syms); i++) {
1021 			if (!strcmp(sym->name, syms[i]))
1022 				return sym->start;
1023 		}
1024 	}
1025 
1026 	return 0;
1027 }
1028 
1029 /*
1030  * These values can be used for kernels that do not have symbols for the entry
1031  * trampolines in kallsyms.
1032  */
1033 #define X86_64_CPU_ENTRY_AREA_PER_CPU	0xfffffe0000000000ULL
1034 #define X86_64_CPU_ENTRY_AREA_SIZE	0x2c000
1035 #define X86_64_ENTRY_TRAMPOLINE		0x6000
1036 
1037 /* Map x86_64 PTI entry trampolines */
1038 int machine__map_x86_64_entry_trampolines(struct machine *machine,
1039 					  struct dso *kernel)
1040 {
1041 	struct map_groups *kmaps = &machine->kmaps;
1042 	struct maps *maps = &kmaps->maps;
1043 	int nr_cpus_avail, cpu;
1044 	bool found = false;
1045 	struct map *map;
1046 	u64 pgoff;
1047 
1048 	/*
1049 	 * In the vmlinux case, pgoff is a virtual address which must now be
1050 	 * mapped to a vmlinux offset.
1051 	 */
1052 	for (map = maps__first(maps); map; map = map__next(map)) {
1053 		struct kmap *kmap = __map__kmap(map);
1054 		struct map *dest_map;
1055 
1056 		if (!kmap || !is_entry_trampoline(kmap->name))
1057 			continue;
1058 
1059 		dest_map = map_groups__find(kmaps, map->pgoff);
1060 		if (dest_map != map)
1061 			map->pgoff = dest_map->map_ip(dest_map, map->pgoff);
1062 		found = true;
1063 	}
1064 	if (found || machine->trampolines_mapped)
1065 		return 0;
1066 
1067 	pgoff = find_entry_trampoline(kernel);
1068 	if (!pgoff)
1069 		return 0;
1070 
1071 	nr_cpus_avail = machine__nr_cpus_avail(machine);
1072 
1073 	/* Add a 1 page map for each CPU's entry trampoline */
1074 	for (cpu = 0; cpu < nr_cpus_avail; cpu++) {
1075 		u64 va = X86_64_CPU_ENTRY_AREA_PER_CPU +
1076 			 cpu * X86_64_CPU_ENTRY_AREA_SIZE +
1077 			 X86_64_ENTRY_TRAMPOLINE;
1078 		struct extra_kernel_map xm = {
1079 			.start = va,
1080 			.end   = va + page_size,
1081 			.pgoff = pgoff,
1082 		};
1083 
1084 		strlcpy(xm.name, ENTRY_TRAMPOLINE_NAME, KMAP_NAME_LEN);
1085 
1086 		if (machine__create_extra_kernel_map(machine, kernel, &xm) < 0)
1087 			return -1;
1088 	}
1089 
1090 	machine->trampolines_mapped = nr_cpus_avail;
1091 
1092 	return 0;
1093 }
1094 
1095 int __weak machine__create_extra_kernel_maps(struct machine *machine __maybe_unused,
1096 					     struct dso *kernel __maybe_unused)
1097 {
1098 	return 0;
1099 }
1100 
1101 static int
1102 __machine__create_kernel_maps(struct machine *machine, struct dso *kernel)
1103 {
1104 	struct kmap *kmap;
1105 	struct map *map;
1106 
1107 	/* In case of renewal the kernel map, destroy previous one */
1108 	machine__destroy_kernel_maps(machine);
1109 
1110 	machine->vmlinux_map = map__new2(0, kernel);
1111 	if (machine->vmlinux_map == NULL)
1112 		return -1;
1113 
1114 	machine->vmlinux_map->map_ip = machine->vmlinux_map->unmap_ip = identity__map_ip;
1115 	map = machine__kernel_map(machine);
1116 	kmap = map__kmap(map);
1117 	if (!kmap)
1118 		return -1;
1119 
1120 	kmap->kmaps = &machine->kmaps;
1121 	map_groups__insert(&machine->kmaps, map);
1122 
1123 	return 0;
1124 }
1125 
1126 void machine__destroy_kernel_maps(struct machine *machine)
1127 {
1128 	struct kmap *kmap;
1129 	struct map *map = machine__kernel_map(machine);
1130 
1131 	if (map == NULL)
1132 		return;
1133 
1134 	kmap = map__kmap(map);
1135 	map_groups__remove(&machine->kmaps, map);
1136 	if (kmap && kmap->ref_reloc_sym) {
1137 		zfree((char **)&kmap->ref_reloc_sym->name);
1138 		zfree(&kmap->ref_reloc_sym);
1139 	}
1140 
1141 	map__zput(machine->vmlinux_map);
1142 }
1143 
1144 int machines__create_guest_kernel_maps(struct machines *machines)
1145 {
1146 	int ret = 0;
1147 	struct dirent **namelist = NULL;
1148 	int i, items = 0;
1149 	char path[PATH_MAX];
1150 	pid_t pid;
1151 	char *endp;
1152 
1153 	if (symbol_conf.default_guest_vmlinux_name ||
1154 	    symbol_conf.default_guest_modules ||
1155 	    symbol_conf.default_guest_kallsyms) {
1156 		machines__create_kernel_maps(machines, DEFAULT_GUEST_KERNEL_ID);
1157 	}
1158 
1159 	if (symbol_conf.guestmount) {
1160 		items = scandir(symbol_conf.guestmount, &namelist, NULL, NULL);
1161 		if (items <= 0)
1162 			return -ENOENT;
1163 		for (i = 0; i < items; i++) {
1164 			if (!isdigit(namelist[i]->d_name[0])) {
1165 				/* Filter out . and .. */
1166 				continue;
1167 			}
1168 			pid = (pid_t)strtol(namelist[i]->d_name, &endp, 10);
1169 			if ((*endp != '\0') ||
1170 			    (endp == namelist[i]->d_name) ||
1171 			    (errno == ERANGE)) {
1172 				pr_debug("invalid directory (%s). Skipping.\n",
1173 					 namelist[i]->d_name);
1174 				continue;
1175 			}
1176 			sprintf(path, "%s/%s/proc/kallsyms",
1177 				symbol_conf.guestmount,
1178 				namelist[i]->d_name);
1179 			ret = access(path, R_OK);
1180 			if (ret) {
1181 				pr_debug("Can't access file %s\n", path);
1182 				goto failure;
1183 			}
1184 			machines__create_kernel_maps(machines, pid);
1185 		}
1186 failure:
1187 		free(namelist);
1188 	}
1189 
1190 	return ret;
1191 }
1192 
1193 void machines__destroy_kernel_maps(struct machines *machines)
1194 {
1195 	struct rb_node *next = rb_first_cached(&machines->guests);
1196 
1197 	machine__destroy_kernel_maps(&machines->host);
1198 
1199 	while (next) {
1200 		struct machine *pos = rb_entry(next, struct machine, rb_node);
1201 
1202 		next = rb_next(&pos->rb_node);
1203 		rb_erase_cached(&pos->rb_node, &machines->guests);
1204 		machine__delete(pos);
1205 	}
1206 }
1207 
1208 int machines__create_kernel_maps(struct machines *machines, pid_t pid)
1209 {
1210 	struct machine *machine = machines__findnew(machines, pid);
1211 
1212 	if (machine == NULL)
1213 		return -1;
1214 
1215 	return machine__create_kernel_maps(machine);
1216 }
1217 
1218 int machine__load_kallsyms(struct machine *machine, const char *filename)
1219 {
1220 	struct map *map = machine__kernel_map(machine);
1221 	int ret = __dso__load_kallsyms(map->dso, filename, map, true);
1222 
1223 	if (ret > 0) {
1224 		dso__set_loaded(map->dso);
1225 		/*
1226 		 * Since /proc/kallsyms will have multiple sessions for the
1227 		 * kernel, with modules between them, fixup the end of all
1228 		 * sections.
1229 		 */
1230 		map_groups__fixup_end(&machine->kmaps);
1231 	}
1232 
1233 	return ret;
1234 }
1235 
1236 int machine__load_vmlinux_path(struct machine *machine)
1237 {
1238 	struct map *map = machine__kernel_map(machine);
1239 	int ret = dso__load_vmlinux_path(map->dso, map);
1240 
1241 	if (ret > 0)
1242 		dso__set_loaded(map->dso);
1243 
1244 	return ret;
1245 }
1246 
1247 static char *get_kernel_version(const char *root_dir)
1248 {
1249 	char version[PATH_MAX];
1250 	FILE *file;
1251 	char *name, *tmp;
1252 	const char *prefix = "Linux version ";
1253 
1254 	sprintf(version, "%s/proc/version", root_dir);
1255 	file = fopen(version, "r");
1256 	if (!file)
1257 		return NULL;
1258 
1259 	tmp = fgets(version, sizeof(version), file);
1260 	fclose(file);
1261 	if (!tmp)
1262 		return NULL;
1263 
1264 	name = strstr(version, prefix);
1265 	if (!name)
1266 		return NULL;
1267 	name += strlen(prefix);
1268 	tmp = strchr(name, ' ');
1269 	if (tmp)
1270 		*tmp = '\0';
1271 
1272 	return strdup(name);
1273 }
1274 
1275 static bool is_kmod_dso(struct dso *dso)
1276 {
1277 	return dso->symtab_type == DSO_BINARY_TYPE__SYSTEM_PATH_KMODULE ||
1278 	       dso->symtab_type == DSO_BINARY_TYPE__GUEST_KMODULE;
1279 }
1280 
1281 static int map_groups__set_module_path(struct map_groups *mg, const char *path,
1282 				       struct kmod_path *m)
1283 {
1284 	char *long_name;
1285 	struct map *map = map_groups__find_by_name(mg, m->name);
1286 
1287 	if (map == NULL)
1288 		return 0;
1289 
1290 	long_name = strdup(path);
1291 	if (long_name == NULL)
1292 		return -ENOMEM;
1293 
1294 	dso__set_long_name(map->dso, long_name, true);
1295 	dso__kernel_module_get_build_id(map->dso, "");
1296 
1297 	/*
1298 	 * Full name could reveal us kmod compression, so
1299 	 * we need to update the symtab_type if needed.
1300 	 */
1301 	if (m->comp && is_kmod_dso(map->dso)) {
1302 		map->dso->symtab_type++;
1303 		map->dso->comp = m->comp;
1304 	}
1305 
1306 	return 0;
1307 }
1308 
1309 static int map_groups__set_modules_path_dir(struct map_groups *mg,
1310 				const char *dir_name, int depth)
1311 {
1312 	struct dirent *dent;
1313 	DIR *dir = opendir(dir_name);
1314 	int ret = 0;
1315 
1316 	if (!dir) {
1317 		pr_debug("%s: cannot open %s dir\n", __func__, dir_name);
1318 		return -1;
1319 	}
1320 
1321 	while ((dent = readdir(dir)) != NULL) {
1322 		char path[PATH_MAX];
1323 		struct stat st;
1324 
1325 		/*sshfs might return bad dent->d_type, so we have to stat*/
1326 		snprintf(path, sizeof(path), "%s/%s", dir_name, dent->d_name);
1327 		if (stat(path, &st))
1328 			continue;
1329 
1330 		if (S_ISDIR(st.st_mode)) {
1331 			if (!strcmp(dent->d_name, ".") ||
1332 			    !strcmp(dent->d_name, ".."))
1333 				continue;
1334 
1335 			/* Do not follow top-level source and build symlinks */
1336 			if (depth == 0) {
1337 				if (!strcmp(dent->d_name, "source") ||
1338 				    !strcmp(dent->d_name, "build"))
1339 					continue;
1340 			}
1341 
1342 			ret = map_groups__set_modules_path_dir(mg, path,
1343 							       depth + 1);
1344 			if (ret < 0)
1345 				goto out;
1346 		} else {
1347 			struct kmod_path m;
1348 
1349 			ret = kmod_path__parse_name(&m, dent->d_name);
1350 			if (ret)
1351 				goto out;
1352 
1353 			if (m.kmod)
1354 				ret = map_groups__set_module_path(mg, path, &m);
1355 
1356 			zfree(&m.name);
1357 
1358 			if (ret)
1359 				goto out;
1360 		}
1361 	}
1362 
1363 out:
1364 	closedir(dir);
1365 	return ret;
1366 }
1367 
1368 static int machine__set_modules_path(struct machine *machine)
1369 {
1370 	char *version;
1371 	char modules_path[PATH_MAX];
1372 
1373 	version = get_kernel_version(machine->root_dir);
1374 	if (!version)
1375 		return -1;
1376 
1377 	snprintf(modules_path, sizeof(modules_path), "%s/lib/modules/%s",
1378 		 machine->root_dir, version);
1379 	free(version);
1380 
1381 	return map_groups__set_modules_path_dir(&machine->kmaps, modules_path, 0);
1382 }
1383 int __weak arch__fix_module_text_start(u64 *start __maybe_unused,
1384 				u64 *size __maybe_unused,
1385 				const char *name __maybe_unused)
1386 {
1387 	return 0;
1388 }
1389 
1390 static int machine__create_module(void *arg, const char *name, u64 start,
1391 				  u64 size)
1392 {
1393 	struct machine *machine = arg;
1394 	struct map *map;
1395 
1396 	if (arch__fix_module_text_start(&start, &size, name) < 0)
1397 		return -1;
1398 
1399 	map = machine__findnew_module_map(machine, start, name);
1400 	if (map == NULL)
1401 		return -1;
1402 	map->end = start + size;
1403 
1404 	dso__kernel_module_get_build_id(map->dso, machine->root_dir);
1405 
1406 	return 0;
1407 }
1408 
1409 static int machine__create_modules(struct machine *machine)
1410 {
1411 	const char *modules;
1412 	char path[PATH_MAX];
1413 
1414 	if (machine__is_default_guest(machine)) {
1415 		modules = symbol_conf.default_guest_modules;
1416 	} else {
1417 		snprintf(path, PATH_MAX, "%s/proc/modules", machine->root_dir);
1418 		modules = path;
1419 	}
1420 
1421 	if (symbol__restricted_filename(modules, "/proc/modules"))
1422 		return -1;
1423 
1424 	if (modules__parse(modules, machine, machine__create_module))
1425 		return -1;
1426 
1427 	if (!machine__set_modules_path(machine))
1428 		return 0;
1429 
1430 	pr_debug("Problems setting modules path maps, continuing anyway...\n");
1431 
1432 	return 0;
1433 }
1434 
1435 static void machine__set_kernel_mmap(struct machine *machine,
1436 				     u64 start, u64 end)
1437 {
1438 	machine->vmlinux_map->start = start;
1439 	machine->vmlinux_map->end   = end;
1440 	/*
1441 	 * Be a bit paranoid here, some perf.data file came with
1442 	 * a zero sized synthesized MMAP event for the kernel.
1443 	 */
1444 	if (start == 0 && end == 0)
1445 		machine->vmlinux_map->end = ~0ULL;
1446 }
1447 
1448 static void machine__update_kernel_mmap(struct machine *machine,
1449 				     u64 start, u64 end)
1450 {
1451 	struct map *map = machine__kernel_map(machine);
1452 
1453 	map__get(map);
1454 	map_groups__remove(&machine->kmaps, map);
1455 
1456 	machine__set_kernel_mmap(machine, start, end);
1457 
1458 	map_groups__insert(&machine->kmaps, map);
1459 	map__put(map);
1460 }
1461 
1462 int machine__create_kernel_maps(struct machine *machine)
1463 {
1464 	struct dso *kernel = machine__get_kernel(machine);
1465 	const char *name = NULL;
1466 	struct map *map;
1467 	u64 start = 0, end = ~0ULL;
1468 	int ret;
1469 
1470 	if (kernel == NULL)
1471 		return -1;
1472 
1473 	ret = __machine__create_kernel_maps(machine, kernel);
1474 	if (ret < 0)
1475 		goto out_put;
1476 
1477 	if (symbol_conf.use_modules && machine__create_modules(machine) < 0) {
1478 		if (machine__is_host(machine))
1479 			pr_debug("Problems creating module maps, "
1480 				 "continuing anyway...\n");
1481 		else
1482 			pr_debug("Problems creating module maps for guest %d, "
1483 				 "continuing anyway...\n", machine->pid);
1484 	}
1485 
1486 	if (!machine__get_running_kernel_start(machine, &name, &start, &end)) {
1487 		if (name &&
1488 		    map__set_kallsyms_ref_reloc_sym(machine->vmlinux_map, name, start)) {
1489 			machine__destroy_kernel_maps(machine);
1490 			ret = -1;
1491 			goto out_put;
1492 		}
1493 
1494 		/*
1495 		 * we have a real start address now, so re-order the kmaps
1496 		 * assume it's the last in the kmaps
1497 		 */
1498 		machine__update_kernel_mmap(machine, start, end);
1499 	}
1500 
1501 	if (machine__create_extra_kernel_maps(machine, kernel))
1502 		pr_debug("Problems creating extra kernel maps, continuing anyway...\n");
1503 
1504 	if (end == ~0ULL) {
1505 		/* update end address of the kernel map using adjacent module address */
1506 		map = map__next(machine__kernel_map(machine));
1507 		if (map)
1508 			machine__set_kernel_mmap(machine, start, map->start);
1509 	}
1510 
1511 out_put:
1512 	dso__put(kernel);
1513 	return ret;
1514 }
1515 
1516 static bool machine__uses_kcore(struct machine *machine)
1517 {
1518 	struct dso *dso;
1519 
1520 	list_for_each_entry(dso, &machine->dsos.head, node) {
1521 		if (dso__is_kcore(dso))
1522 			return true;
1523 	}
1524 
1525 	return false;
1526 }
1527 
1528 static bool perf_event__is_extra_kernel_mmap(struct machine *machine,
1529 					     union perf_event *event)
1530 {
1531 	return machine__is(machine, "x86_64") &&
1532 	       is_entry_trampoline(event->mmap.filename);
1533 }
1534 
1535 static int machine__process_extra_kernel_map(struct machine *machine,
1536 					     union perf_event *event)
1537 {
1538 	struct map *kernel_map = machine__kernel_map(machine);
1539 	struct dso *kernel = kernel_map ? kernel_map->dso : NULL;
1540 	struct extra_kernel_map xm = {
1541 		.start = event->mmap.start,
1542 		.end   = event->mmap.start + event->mmap.len,
1543 		.pgoff = event->mmap.pgoff,
1544 	};
1545 
1546 	if (kernel == NULL)
1547 		return -1;
1548 
1549 	strlcpy(xm.name, event->mmap.filename, KMAP_NAME_LEN);
1550 
1551 	return machine__create_extra_kernel_map(machine, kernel, &xm);
1552 }
1553 
1554 static int machine__process_kernel_mmap_event(struct machine *machine,
1555 					      union perf_event *event)
1556 {
1557 	struct map *map;
1558 	enum dso_kernel_type kernel_type;
1559 	bool is_kernel_mmap;
1560 
1561 	/* If we have maps from kcore then we do not need or want any others */
1562 	if (machine__uses_kcore(machine))
1563 		return 0;
1564 
1565 	if (machine__is_host(machine))
1566 		kernel_type = DSO_TYPE_KERNEL;
1567 	else
1568 		kernel_type = DSO_TYPE_GUEST_KERNEL;
1569 
1570 	is_kernel_mmap = memcmp(event->mmap.filename,
1571 				machine->mmap_name,
1572 				strlen(machine->mmap_name) - 1) == 0;
1573 	if (event->mmap.filename[0] == '/' ||
1574 	    (!is_kernel_mmap && event->mmap.filename[0] == '[')) {
1575 		map = machine__findnew_module_map(machine, event->mmap.start,
1576 						  event->mmap.filename);
1577 		if (map == NULL)
1578 			goto out_problem;
1579 
1580 		map->end = map->start + event->mmap.len;
1581 	} else if (is_kernel_mmap) {
1582 		const char *symbol_name = (event->mmap.filename +
1583 				strlen(machine->mmap_name));
1584 		/*
1585 		 * Should be there already, from the build-id table in
1586 		 * the header.
1587 		 */
1588 		struct dso *kernel = NULL;
1589 		struct dso *dso;
1590 
1591 		down_read(&machine->dsos.lock);
1592 
1593 		list_for_each_entry(dso, &machine->dsos.head, node) {
1594 
1595 			/*
1596 			 * The cpumode passed to is_kernel_module is not the
1597 			 * cpumode of *this* event. If we insist on passing
1598 			 * correct cpumode to is_kernel_module, we should
1599 			 * record the cpumode when we adding this dso to the
1600 			 * linked list.
1601 			 *
1602 			 * However we don't really need passing correct
1603 			 * cpumode.  We know the correct cpumode must be kernel
1604 			 * mode (if not, we should not link it onto kernel_dsos
1605 			 * list).
1606 			 *
1607 			 * Therefore, we pass PERF_RECORD_MISC_CPUMODE_UNKNOWN.
1608 			 * is_kernel_module() treats it as a kernel cpumode.
1609 			 */
1610 
1611 			if (!dso->kernel ||
1612 			    is_kernel_module(dso->long_name,
1613 					     PERF_RECORD_MISC_CPUMODE_UNKNOWN))
1614 				continue;
1615 
1616 
1617 			kernel = dso;
1618 			break;
1619 		}
1620 
1621 		up_read(&machine->dsos.lock);
1622 
1623 		if (kernel == NULL)
1624 			kernel = machine__findnew_dso(machine, machine->mmap_name);
1625 		if (kernel == NULL)
1626 			goto out_problem;
1627 
1628 		kernel->kernel = kernel_type;
1629 		if (__machine__create_kernel_maps(machine, kernel) < 0) {
1630 			dso__put(kernel);
1631 			goto out_problem;
1632 		}
1633 
1634 		if (strstr(kernel->long_name, "vmlinux"))
1635 			dso__set_short_name(kernel, "[kernel.vmlinux]", false);
1636 
1637 		machine__update_kernel_mmap(machine, event->mmap.start,
1638 					 event->mmap.start + event->mmap.len);
1639 
1640 		/*
1641 		 * Avoid using a zero address (kptr_restrict) for the ref reloc
1642 		 * symbol. Effectively having zero here means that at record
1643 		 * time /proc/sys/kernel/kptr_restrict was non zero.
1644 		 */
1645 		if (event->mmap.pgoff != 0) {
1646 			map__set_kallsyms_ref_reloc_sym(machine->vmlinux_map,
1647 							symbol_name,
1648 							event->mmap.pgoff);
1649 		}
1650 
1651 		if (machine__is_default_guest(machine)) {
1652 			/*
1653 			 * preload dso of guest kernel and modules
1654 			 */
1655 			dso__load(kernel, machine__kernel_map(machine));
1656 		}
1657 	} else if (perf_event__is_extra_kernel_mmap(machine, event)) {
1658 		return machine__process_extra_kernel_map(machine, event);
1659 	}
1660 	return 0;
1661 out_problem:
1662 	return -1;
1663 }
1664 
1665 int machine__process_mmap2_event(struct machine *machine,
1666 				 union perf_event *event,
1667 				 struct perf_sample *sample)
1668 {
1669 	struct thread *thread;
1670 	struct map *map;
1671 	int ret = 0;
1672 
1673 	if (dump_trace)
1674 		perf_event__fprintf_mmap2(event, stdout);
1675 
1676 	if (sample->cpumode == PERF_RECORD_MISC_GUEST_KERNEL ||
1677 	    sample->cpumode == PERF_RECORD_MISC_KERNEL) {
1678 		ret = machine__process_kernel_mmap_event(machine, event);
1679 		if (ret < 0)
1680 			goto out_problem;
1681 		return 0;
1682 	}
1683 
1684 	thread = machine__findnew_thread(machine, event->mmap2.pid,
1685 					event->mmap2.tid);
1686 	if (thread == NULL)
1687 		goto out_problem;
1688 
1689 	map = map__new(machine, event->mmap2.start,
1690 			event->mmap2.len, event->mmap2.pgoff,
1691 			event->mmap2.maj,
1692 			event->mmap2.min, event->mmap2.ino,
1693 			event->mmap2.ino_generation,
1694 			event->mmap2.prot,
1695 			event->mmap2.flags,
1696 			event->mmap2.filename, thread);
1697 
1698 	if (map == NULL)
1699 		goto out_problem_map;
1700 
1701 	ret = thread__insert_map(thread, map);
1702 	if (ret)
1703 		goto out_problem_insert;
1704 
1705 	thread__put(thread);
1706 	map__put(map);
1707 	return 0;
1708 
1709 out_problem_insert:
1710 	map__put(map);
1711 out_problem_map:
1712 	thread__put(thread);
1713 out_problem:
1714 	dump_printf("problem processing PERF_RECORD_MMAP2, skipping event.\n");
1715 	return 0;
1716 }
1717 
1718 int machine__process_mmap_event(struct machine *machine, union perf_event *event,
1719 				struct perf_sample *sample)
1720 {
1721 	struct thread *thread;
1722 	struct map *map;
1723 	u32 prot = 0;
1724 	int ret = 0;
1725 
1726 	if (dump_trace)
1727 		perf_event__fprintf_mmap(event, stdout);
1728 
1729 	if (sample->cpumode == PERF_RECORD_MISC_GUEST_KERNEL ||
1730 	    sample->cpumode == PERF_RECORD_MISC_KERNEL) {
1731 		ret = machine__process_kernel_mmap_event(machine, event);
1732 		if (ret < 0)
1733 			goto out_problem;
1734 		return 0;
1735 	}
1736 
1737 	thread = machine__findnew_thread(machine, event->mmap.pid,
1738 					 event->mmap.tid);
1739 	if (thread == NULL)
1740 		goto out_problem;
1741 
1742 	if (!(event->header.misc & PERF_RECORD_MISC_MMAP_DATA))
1743 		prot = PROT_EXEC;
1744 
1745 	map = map__new(machine, event->mmap.start,
1746 			event->mmap.len, event->mmap.pgoff,
1747 			0, 0, 0, 0, prot, 0,
1748 			event->mmap.filename,
1749 			thread);
1750 
1751 	if (map == NULL)
1752 		goto out_problem_map;
1753 
1754 	ret = thread__insert_map(thread, map);
1755 	if (ret)
1756 		goto out_problem_insert;
1757 
1758 	thread__put(thread);
1759 	map__put(map);
1760 	return 0;
1761 
1762 out_problem_insert:
1763 	map__put(map);
1764 out_problem_map:
1765 	thread__put(thread);
1766 out_problem:
1767 	dump_printf("problem processing PERF_RECORD_MMAP, skipping event.\n");
1768 	return 0;
1769 }
1770 
1771 static void __machine__remove_thread(struct machine *machine, struct thread *th, bool lock)
1772 {
1773 	struct threads *threads = machine__threads(machine, th->tid);
1774 
1775 	if (threads->last_match == th)
1776 		threads__set_last_match(threads, NULL);
1777 
1778 	if (lock)
1779 		down_write(&threads->lock);
1780 
1781 	BUG_ON(refcount_read(&th->refcnt) == 0);
1782 
1783 	rb_erase_cached(&th->rb_node, &threads->entries);
1784 	RB_CLEAR_NODE(&th->rb_node);
1785 	--threads->nr;
1786 	/*
1787 	 * Move it first to the dead_threads list, then drop the reference,
1788 	 * if this is the last reference, then the thread__delete destructor
1789 	 * will be called and we will remove it from the dead_threads list.
1790 	 */
1791 	list_add_tail(&th->node, &threads->dead);
1792 
1793 	/*
1794 	 * We need to do the put here because if this is the last refcount,
1795 	 * then we will be touching the threads->dead head when removing the
1796 	 * thread.
1797 	 */
1798 	thread__put(th);
1799 
1800 	if (lock)
1801 		up_write(&threads->lock);
1802 }
1803 
1804 void machine__remove_thread(struct machine *machine, struct thread *th)
1805 {
1806 	return __machine__remove_thread(machine, th, true);
1807 }
1808 
1809 int machine__process_fork_event(struct machine *machine, union perf_event *event,
1810 				struct perf_sample *sample)
1811 {
1812 	struct thread *thread = machine__find_thread(machine,
1813 						     event->fork.pid,
1814 						     event->fork.tid);
1815 	struct thread *parent = machine__findnew_thread(machine,
1816 							event->fork.ppid,
1817 							event->fork.ptid);
1818 	bool do_maps_clone = true;
1819 	int err = 0;
1820 
1821 	if (dump_trace)
1822 		perf_event__fprintf_task(event, stdout);
1823 
1824 	/*
1825 	 * There may be an existing thread that is not actually the parent,
1826 	 * either because we are processing events out of order, or because the
1827 	 * (fork) event that would have removed the thread was lost. Assume the
1828 	 * latter case and continue on as best we can.
1829 	 */
1830 	if (parent->pid_ != (pid_t)event->fork.ppid) {
1831 		dump_printf("removing erroneous parent thread %d/%d\n",
1832 			    parent->pid_, parent->tid);
1833 		machine__remove_thread(machine, parent);
1834 		thread__put(parent);
1835 		parent = machine__findnew_thread(machine, event->fork.ppid,
1836 						 event->fork.ptid);
1837 	}
1838 
1839 	/* if a thread currently exists for the thread id remove it */
1840 	if (thread != NULL) {
1841 		machine__remove_thread(machine, thread);
1842 		thread__put(thread);
1843 	}
1844 
1845 	thread = machine__findnew_thread(machine, event->fork.pid,
1846 					 event->fork.tid);
1847 	/*
1848 	 * When synthesizing FORK events, we are trying to create thread
1849 	 * objects for the already running tasks on the machine.
1850 	 *
1851 	 * Normally, for a kernel FORK event, we want to clone the parent's
1852 	 * maps because that is what the kernel just did.
1853 	 *
1854 	 * But when synthesizing, this should not be done.  If we do, we end up
1855 	 * with overlapping maps as we process the sythesized MMAP2 events that
1856 	 * get delivered shortly thereafter.
1857 	 *
1858 	 * Use the FORK event misc flags in an internal way to signal this
1859 	 * situation, so we can elide the map clone when appropriate.
1860 	 */
1861 	if (event->fork.header.misc & PERF_RECORD_MISC_FORK_EXEC)
1862 		do_maps_clone = false;
1863 
1864 	if (thread == NULL || parent == NULL ||
1865 	    thread__fork(thread, parent, sample->time, do_maps_clone) < 0) {
1866 		dump_printf("problem processing PERF_RECORD_FORK, skipping event.\n");
1867 		err = -1;
1868 	}
1869 	thread__put(thread);
1870 	thread__put(parent);
1871 
1872 	return err;
1873 }
1874 
1875 int machine__process_exit_event(struct machine *machine, union perf_event *event,
1876 				struct perf_sample *sample __maybe_unused)
1877 {
1878 	struct thread *thread = machine__find_thread(machine,
1879 						     event->fork.pid,
1880 						     event->fork.tid);
1881 
1882 	if (dump_trace)
1883 		perf_event__fprintf_task(event, stdout);
1884 
1885 	if (thread != NULL) {
1886 		thread__exited(thread);
1887 		thread__put(thread);
1888 	}
1889 
1890 	return 0;
1891 }
1892 
1893 int machine__process_event(struct machine *machine, union perf_event *event,
1894 			   struct perf_sample *sample)
1895 {
1896 	int ret;
1897 
1898 	switch (event->header.type) {
1899 	case PERF_RECORD_COMM:
1900 		ret = machine__process_comm_event(machine, event, sample); break;
1901 	case PERF_RECORD_MMAP:
1902 		ret = machine__process_mmap_event(machine, event, sample); break;
1903 	case PERF_RECORD_NAMESPACES:
1904 		ret = machine__process_namespaces_event(machine, event, sample); break;
1905 	case PERF_RECORD_MMAP2:
1906 		ret = machine__process_mmap2_event(machine, event, sample); break;
1907 	case PERF_RECORD_FORK:
1908 		ret = machine__process_fork_event(machine, event, sample); break;
1909 	case PERF_RECORD_EXIT:
1910 		ret = machine__process_exit_event(machine, event, sample); break;
1911 	case PERF_RECORD_LOST:
1912 		ret = machine__process_lost_event(machine, event, sample); break;
1913 	case PERF_RECORD_AUX:
1914 		ret = machine__process_aux_event(machine, event); break;
1915 	case PERF_RECORD_ITRACE_START:
1916 		ret = machine__process_itrace_start_event(machine, event); break;
1917 	case PERF_RECORD_LOST_SAMPLES:
1918 		ret = machine__process_lost_samples_event(machine, event, sample); break;
1919 	case PERF_RECORD_SWITCH:
1920 	case PERF_RECORD_SWITCH_CPU_WIDE:
1921 		ret = machine__process_switch_event(machine, event); break;
1922 	case PERF_RECORD_KSYMBOL:
1923 		ret = machine__process_ksymbol(machine, event, sample); break;
1924 	case PERF_RECORD_BPF_EVENT:
1925 		ret = machine__process_bpf(machine, event, sample); break;
1926 	default:
1927 		ret = -1;
1928 		break;
1929 	}
1930 
1931 	return ret;
1932 }
1933 
1934 static bool symbol__match_regex(struct symbol *sym, regex_t *regex)
1935 {
1936 	if (!regexec(regex, sym->name, 0, NULL, 0))
1937 		return 1;
1938 	return 0;
1939 }
1940 
1941 static void ip__resolve_ams(struct thread *thread,
1942 			    struct addr_map_symbol *ams,
1943 			    u64 ip)
1944 {
1945 	struct addr_location al;
1946 
1947 	memset(&al, 0, sizeof(al));
1948 	/*
1949 	 * We cannot use the header.misc hint to determine whether a
1950 	 * branch stack address is user, kernel, guest, hypervisor.
1951 	 * Branches may straddle the kernel/user/hypervisor boundaries.
1952 	 * Thus, we have to try consecutively until we find a match
1953 	 * or else, the symbol is unknown
1954 	 */
1955 	thread__find_cpumode_addr_location(thread, ip, &al);
1956 
1957 	ams->addr = ip;
1958 	ams->al_addr = al.addr;
1959 	ams->sym = al.sym;
1960 	ams->map = al.map;
1961 	ams->phys_addr = 0;
1962 }
1963 
1964 static void ip__resolve_data(struct thread *thread,
1965 			     u8 m, struct addr_map_symbol *ams,
1966 			     u64 addr, u64 phys_addr)
1967 {
1968 	struct addr_location al;
1969 
1970 	memset(&al, 0, sizeof(al));
1971 
1972 	thread__find_symbol(thread, m, addr, &al);
1973 
1974 	ams->addr = addr;
1975 	ams->al_addr = al.addr;
1976 	ams->sym = al.sym;
1977 	ams->map = al.map;
1978 	ams->phys_addr = phys_addr;
1979 }
1980 
1981 struct mem_info *sample__resolve_mem(struct perf_sample *sample,
1982 				     struct addr_location *al)
1983 {
1984 	struct mem_info *mi = mem_info__new();
1985 
1986 	if (!mi)
1987 		return NULL;
1988 
1989 	ip__resolve_ams(al->thread, &mi->iaddr, sample->ip);
1990 	ip__resolve_data(al->thread, al->cpumode, &mi->daddr,
1991 			 sample->addr, sample->phys_addr);
1992 	mi->data_src.val = sample->data_src;
1993 
1994 	return mi;
1995 }
1996 
1997 static char *callchain_srcline(struct map *map, struct symbol *sym, u64 ip)
1998 {
1999 	char *srcline = NULL;
2000 
2001 	if (!map || callchain_param.key == CCKEY_FUNCTION)
2002 		return srcline;
2003 
2004 	srcline = srcline__tree_find(&map->dso->srclines, ip);
2005 	if (!srcline) {
2006 		bool show_sym = false;
2007 		bool show_addr = callchain_param.key == CCKEY_ADDRESS;
2008 
2009 		srcline = get_srcline(map->dso, map__rip_2objdump(map, ip),
2010 				      sym, show_sym, show_addr, ip);
2011 		srcline__tree_insert(&map->dso->srclines, ip, srcline);
2012 	}
2013 
2014 	return srcline;
2015 }
2016 
2017 struct iterations {
2018 	int nr_loop_iter;
2019 	u64 cycles;
2020 };
2021 
2022 static int add_callchain_ip(struct thread *thread,
2023 			    struct callchain_cursor *cursor,
2024 			    struct symbol **parent,
2025 			    struct addr_location *root_al,
2026 			    u8 *cpumode,
2027 			    u64 ip,
2028 			    bool branch,
2029 			    struct branch_flags *flags,
2030 			    struct iterations *iter,
2031 			    u64 branch_from)
2032 {
2033 	struct addr_location al;
2034 	int nr_loop_iter = 0;
2035 	u64 iter_cycles = 0;
2036 	const char *srcline = NULL;
2037 
2038 	al.filtered = 0;
2039 	al.sym = NULL;
2040 	if (!cpumode) {
2041 		thread__find_cpumode_addr_location(thread, ip, &al);
2042 	} else {
2043 		if (ip >= PERF_CONTEXT_MAX) {
2044 			switch (ip) {
2045 			case PERF_CONTEXT_HV:
2046 				*cpumode = PERF_RECORD_MISC_HYPERVISOR;
2047 				break;
2048 			case PERF_CONTEXT_KERNEL:
2049 				*cpumode = PERF_RECORD_MISC_KERNEL;
2050 				break;
2051 			case PERF_CONTEXT_USER:
2052 				*cpumode = PERF_RECORD_MISC_USER;
2053 				break;
2054 			default:
2055 				pr_debug("invalid callchain context: "
2056 					 "%"PRId64"\n", (s64) ip);
2057 				/*
2058 				 * It seems the callchain is corrupted.
2059 				 * Discard all.
2060 				 */
2061 				callchain_cursor_reset(cursor);
2062 				return 1;
2063 			}
2064 			return 0;
2065 		}
2066 		thread__find_symbol(thread, *cpumode, ip, &al);
2067 	}
2068 
2069 	if (al.sym != NULL) {
2070 		if (perf_hpp_list.parent && !*parent &&
2071 		    symbol__match_regex(al.sym, &parent_regex))
2072 			*parent = al.sym;
2073 		else if (have_ignore_callees && root_al &&
2074 		  symbol__match_regex(al.sym, &ignore_callees_regex)) {
2075 			/* Treat this symbol as the root,
2076 			   forgetting its callees. */
2077 			*root_al = al;
2078 			callchain_cursor_reset(cursor);
2079 		}
2080 	}
2081 
2082 	if (symbol_conf.hide_unresolved && al.sym == NULL)
2083 		return 0;
2084 
2085 	if (iter) {
2086 		nr_loop_iter = iter->nr_loop_iter;
2087 		iter_cycles = iter->cycles;
2088 	}
2089 
2090 	srcline = callchain_srcline(al.map, al.sym, al.addr);
2091 	return callchain_cursor_append(cursor, ip, al.map, al.sym,
2092 				       branch, flags, nr_loop_iter,
2093 				       iter_cycles, branch_from, srcline);
2094 }
2095 
2096 struct branch_info *sample__resolve_bstack(struct perf_sample *sample,
2097 					   struct addr_location *al)
2098 {
2099 	unsigned int i;
2100 	const struct branch_stack *bs = sample->branch_stack;
2101 	struct branch_info *bi = calloc(bs->nr, sizeof(struct branch_info));
2102 
2103 	if (!bi)
2104 		return NULL;
2105 
2106 	for (i = 0; i < bs->nr; i++) {
2107 		ip__resolve_ams(al->thread, &bi[i].to, bs->entries[i].to);
2108 		ip__resolve_ams(al->thread, &bi[i].from, bs->entries[i].from);
2109 		bi[i].flags = bs->entries[i].flags;
2110 	}
2111 	return bi;
2112 }
2113 
2114 static void save_iterations(struct iterations *iter,
2115 			    struct branch_entry *be, int nr)
2116 {
2117 	int i;
2118 
2119 	iter->nr_loop_iter++;
2120 	iter->cycles = 0;
2121 
2122 	for (i = 0; i < nr; i++)
2123 		iter->cycles += be[i].flags.cycles;
2124 }
2125 
2126 #define CHASHSZ 127
2127 #define CHASHBITS 7
2128 #define NO_ENTRY 0xff
2129 
2130 #define PERF_MAX_BRANCH_DEPTH 127
2131 
2132 /* Remove loops. */
2133 static int remove_loops(struct branch_entry *l, int nr,
2134 			struct iterations *iter)
2135 {
2136 	int i, j, off;
2137 	unsigned char chash[CHASHSZ];
2138 
2139 	memset(chash, NO_ENTRY, sizeof(chash));
2140 
2141 	BUG_ON(PERF_MAX_BRANCH_DEPTH > 255);
2142 
2143 	for (i = 0; i < nr; i++) {
2144 		int h = hash_64(l[i].from, CHASHBITS) % CHASHSZ;
2145 
2146 		/* no collision handling for now */
2147 		if (chash[h] == NO_ENTRY) {
2148 			chash[h] = i;
2149 		} else if (l[chash[h]].from == l[i].from) {
2150 			bool is_loop = true;
2151 			/* check if it is a real loop */
2152 			off = 0;
2153 			for (j = chash[h]; j < i && i + off < nr; j++, off++)
2154 				if (l[j].from != l[i + off].from) {
2155 					is_loop = false;
2156 					break;
2157 				}
2158 			if (is_loop) {
2159 				j = nr - (i + off);
2160 				if (j > 0) {
2161 					save_iterations(iter + i + off,
2162 						l + i, off);
2163 
2164 					memmove(iter + i, iter + i + off,
2165 						j * sizeof(*iter));
2166 
2167 					memmove(l + i, l + i + off,
2168 						j * sizeof(*l));
2169 				}
2170 
2171 				nr -= off;
2172 			}
2173 		}
2174 	}
2175 	return nr;
2176 }
2177 
2178 /*
2179  * Recolve LBR callstack chain sample
2180  * Return:
2181  * 1 on success get LBR callchain information
2182  * 0 no available LBR callchain information, should try fp
2183  * negative error code on other errors.
2184  */
2185 static int resolve_lbr_callchain_sample(struct thread *thread,
2186 					struct callchain_cursor *cursor,
2187 					struct perf_sample *sample,
2188 					struct symbol **parent,
2189 					struct addr_location *root_al,
2190 					int max_stack)
2191 {
2192 	struct ip_callchain *chain = sample->callchain;
2193 	int chain_nr = min(max_stack, (int)chain->nr), i;
2194 	u8 cpumode = PERF_RECORD_MISC_USER;
2195 	u64 ip, branch_from = 0;
2196 
2197 	for (i = 0; i < chain_nr; i++) {
2198 		if (chain->ips[i] == PERF_CONTEXT_USER)
2199 			break;
2200 	}
2201 
2202 	/* LBR only affects the user callchain */
2203 	if (i != chain_nr) {
2204 		struct branch_stack *lbr_stack = sample->branch_stack;
2205 		int lbr_nr = lbr_stack->nr, j, k;
2206 		bool branch;
2207 		struct branch_flags *flags;
2208 		/*
2209 		 * LBR callstack can only get user call chain.
2210 		 * The mix_chain_nr is kernel call chain
2211 		 * number plus LBR user call chain number.
2212 		 * i is kernel call chain number,
2213 		 * 1 is PERF_CONTEXT_USER,
2214 		 * lbr_nr + 1 is the user call chain number.
2215 		 * For details, please refer to the comments
2216 		 * in callchain__printf
2217 		 */
2218 		int mix_chain_nr = i + 1 + lbr_nr + 1;
2219 
2220 		for (j = 0; j < mix_chain_nr; j++) {
2221 			int err;
2222 			branch = false;
2223 			flags = NULL;
2224 
2225 			if (callchain_param.order == ORDER_CALLEE) {
2226 				if (j < i + 1)
2227 					ip = chain->ips[j];
2228 				else if (j > i + 1) {
2229 					k = j - i - 2;
2230 					ip = lbr_stack->entries[k].from;
2231 					branch = true;
2232 					flags = &lbr_stack->entries[k].flags;
2233 				} else {
2234 					ip = lbr_stack->entries[0].to;
2235 					branch = true;
2236 					flags = &lbr_stack->entries[0].flags;
2237 					branch_from =
2238 						lbr_stack->entries[0].from;
2239 				}
2240 			} else {
2241 				if (j < lbr_nr) {
2242 					k = lbr_nr - j - 1;
2243 					ip = lbr_stack->entries[k].from;
2244 					branch = true;
2245 					flags = &lbr_stack->entries[k].flags;
2246 				}
2247 				else if (j > lbr_nr)
2248 					ip = chain->ips[i + 1 - (j - lbr_nr)];
2249 				else {
2250 					ip = lbr_stack->entries[0].to;
2251 					branch = true;
2252 					flags = &lbr_stack->entries[0].flags;
2253 					branch_from =
2254 						lbr_stack->entries[0].from;
2255 				}
2256 			}
2257 
2258 			err = add_callchain_ip(thread, cursor, parent,
2259 					       root_al, &cpumode, ip,
2260 					       branch, flags, NULL,
2261 					       branch_from);
2262 			if (err)
2263 				return (err < 0) ? err : 0;
2264 		}
2265 		return 1;
2266 	}
2267 
2268 	return 0;
2269 }
2270 
2271 static int find_prev_cpumode(struct ip_callchain *chain, struct thread *thread,
2272 			     struct callchain_cursor *cursor,
2273 			     struct symbol **parent,
2274 			     struct addr_location *root_al,
2275 			     u8 *cpumode, int ent)
2276 {
2277 	int err = 0;
2278 
2279 	while (--ent >= 0) {
2280 		u64 ip = chain->ips[ent];
2281 
2282 		if (ip >= PERF_CONTEXT_MAX) {
2283 			err = add_callchain_ip(thread, cursor, parent,
2284 					       root_al, cpumode, ip,
2285 					       false, NULL, NULL, 0);
2286 			break;
2287 		}
2288 	}
2289 	return err;
2290 }
2291 
2292 static int thread__resolve_callchain_sample(struct thread *thread,
2293 					    struct callchain_cursor *cursor,
2294 					    struct evsel *evsel,
2295 					    struct perf_sample *sample,
2296 					    struct symbol **parent,
2297 					    struct addr_location *root_al,
2298 					    int max_stack)
2299 {
2300 	struct branch_stack *branch = sample->branch_stack;
2301 	struct ip_callchain *chain = sample->callchain;
2302 	int chain_nr = 0;
2303 	u8 cpumode = PERF_RECORD_MISC_USER;
2304 	int i, j, err, nr_entries;
2305 	int skip_idx = -1;
2306 	int first_call = 0;
2307 
2308 	if (chain)
2309 		chain_nr = chain->nr;
2310 
2311 	if (perf_evsel__has_branch_callstack(evsel)) {
2312 		err = resolve_lbr_callchain_sample(thread, cursor, sample, parent,
2313 						   root_al, max_stack);
2314 		if (err)
2315 			return (err < 0) ? err : 0;
2316 	}
2317 
2318 	/*
2319 	 * Based on DWARF debug information, some architectures skip
2320 	 * a callchain entry saved by the kernel.
2321 	 */
2322 	skip_idx = arch_skip_callchain_idx(thread, chain);
2323 
2324 	/*
2325 	 * Add branches to call stack for easier browsing. This gives
2326 	 * more context for a sample than just the callers.
2327 	 *
2328 	 * This uses individual histograms of paths compared to the
2329 	 * aggregated histograms the normal LBR mode uses.
2330 	 *
2331 	 * Limitations for now:
2332 	 * - No extra filters
2333 	 * - No annotations (should annotate somehow)
2334 	 */
2335 
2336 	if (branch && callchain_param.branch_callstack) {
2337 		int nr = min(max_stack, (int)branch->nr);
2338 		struct branch_entry be[nr];
2339 		struct iterations iter[nr];
2340 
2341 		if (branch->nr > PERF_MAX_BRANCH_DEPTH) {
2342 			pr_warning("corrupted branch chain. skipping...\n");
2343 			goto check_calls;
2344 		}
2345 
2346 		for (i = 0; i < nr; i++) {
2347 			if (callchain_param.order == ORDER_CALLEE) {
2348 				be[i] = branch->entries[i];
2349 
2350 				if (chain == NULL)
2351 					continue;
2352 
2353 				/*
2354 				 * Check for overlap into the callchain.
2355 				 * The return address is one off compared to
2356 				 * the branch entry. To adjust for this
2357 				 * assume the calling instruction is not longer
2358 				 * than 8 bytes.
2359 				 */
2360 				if (i == skip_idx ||
2361 				    chain->ips[first_call] >= PERF_CONTEXT_MAX)
2362 					first_call++;
2363 				else if (be[i].from < chain->ips[first_call] &&
2364 				    be[i].from >= chain->ips[first_call] - 8)
2365 					first_call++;
2366 			} else
2367 				be[i] = branch->entries[branch->nr - i - 1];
2368 		}
2369 
2370 		memset(iter, 0, sizeof(struct iterations) * nr);
2371 		nr = remove_loops(be, nr, iter);
2372 
2373 		for (i = 0; i < nr; i++) {
2374 			err = add_callchain_ip(thread, cursor, parent,
2375 					       root_al,
2376 					       NULL, be[i].to,
2377 					       true, &be[i].flags,
2378 					       NULL, be[i].from);
2379 
2380 			if (!err)
2381 				err = add_callchain_ip(thread, cursor, parent, root_al,
2382 						       NULL, be[i].from,
2383 						       true, &be[i].flags,
2384 						       &iter[i], 0);
2385 			if (err == -EINVAL)
2386 				break;
2387 			if (err)
2388 				return err;
2389 		}
2390 
2391 		if (chain_nr == 0)
2392 			return 0;
2393 
2394 		chain_nr -= nr;
2395 	}
2396 
2397 check_calls:
2398 	if (callchain_param.order != ORDER_CALLEE) {
2399 		err = find_prev_cpumode(chain, thread, cursor, parent, root_al,
2400 					&cpumode, chain->nr - first_call);
2401 		if (err)
2402 			return (err < 0) ? err : 0;
2403 	}
2404 	for (i = first_call, nr_entries = 0;
2405 	     i < chain_nr && nr_entries < max_stack; i++) {
2406 		u64 ip;
2407 
2408 		if (callchain_param.order == ORDER_CALLEE)
2409 			j = i;
2410 		else
2411 			j = chain->nr - i - 1;
2412 
2413 #ifdef HAVE_SKIP_CALLCHAIN_IDX
2414 		if (j == skip_idx)
2415 			continue;
2416 #endif
2417 		ip = chain->ips[j];
2418 		if (ip < PERF_CONTEXT_MAX)
2419                        ++nr_entries;
2420 		else if (callchain_param.order != ORDER_CALLEE) {
2421 			err = find_prev_cpumode(chain, thread, cursor, parent,
2422 						root_al, &cpumode, j);
2423 			if (err)
2424 				return (err < 0) ? err : 0;
2425 			continue;
2426 		}
2427 
2428 		err = add_callchain_ip(thread, cursor, parent,
2429 				       root_al, &cpumode, ip,
2430 				       false, NULL, NULL, 0);
2431 
2432 		if (err)
2433 			return (err < 0) ? err : 0;
2434 	}
2435 
2436 	return 0;
2437 }
2438 
2439 static int append_inlines(struct callchain_cursor *cursor,
2440 			  struct map *map, struct symbol *sym, u64 ip)
2441 {
2442 	struct inline_node *inline_node;
2443 	struct inline_list *ilist;
2444 	u64 addr;
2445 	int ret = 1;
2446 
2447 	if (!symbol_conf.inline_name || !map || !sym)
2448 		return ret;
2449 
2450 	addr = map__map_ip(map, ip);
2451 	addr = map__rip_2objdump(map, addr);
2452 
2453 	inline_node = inlines__tree_find(&map->dso->inlined_nodes, addr);
2454 	if (!inline_node) {
2455 		inline_node = dso__parse_addr_inlines(map->dso, addr, sym);
2456 		if (!inline_node)
2457 			return ret;
2458 		inlines__tree_insert(&map->dso->inlined_nodes, inline_node);
2459 	}
2460 
2461 	list_for_each_entry(ilist, &inline_node->val, list) {
2462 		ret = callchain_cursor_append(cursor, ip, map,
2463 					      ilist->symbol, false,
2464 					      NULL, 0, 0, 0, ilist->srcline);
2465 
2466 		if (ret != 0)
2467 			return ret;
2468 	}
2469 
2470 	return ret;
2471 }
2472 
2473 static int unwind_entry(struct unwind_entry *entry, void *arg)
2474 {
2475 	struct callchain_cursor *cursor = arg;
2476 	const char *srcline = NULL;
2477 	u64 addr = entry->ip;
2478 
2479 	if (symbol_conf.hide_unresolved && entry->sym == NULL)
2480 		return 0;
2481 
2482 	if (append_inlines(cursor, entry->map, entry->sym, entry->ip) == 0)
2483 		return 0;
2484 
2485 	/*
2486 	 * Convert entry->ip from a virtual address to an offset in
2487 	 * its corresponding binary.
2488 	 */
2489 	if (entry->map)
2490 		addr = map__map_ip(entry->map, entry->ip);
2491 
2492 	srcline = callchain_srcline(entry->map, entry->sym, addr);
2493 	return callchain_cursor_append(cursor, entry->ip,
2494 				       entry->map, entry->sym,
2495 				       false, NULL, 0, 0, 0, srcline);
2496 }
2497 
2498 static int thread__resolve_callchain_unwind(struct thread *thread,
2499 					    struct callchain_cursor *cursor,
2500 					    struct evsel *evsel,
2501 					    struct perf_sample *sample,
2502 					    int max_stack)
2503 {
2504 	/* Can we do dwarf post unwind? */
2505 	if (!((evsel->core.attr.sample_type & PERF_SAMPLE_REGS_USER) &&
2506 	      (evsel->core.attr.sample_type & PERF_SAMPLE_STACK_USER)))
2507 		return 0;
2508 
2509 	/* Bail out if nothing was captured. */
2510 	if ((!sample->user_regs.regs) ||
2511 	    (!sample->user_stack.size))
2512 		return 0;
2513 
2514 	return unwind__get_entries(unwind_entry, cursor,
2515 				   thread, sample, max_stack);
2516 }
2517 
2518 int thread__resolve_callchain(struct thread *thread,
2519 			      struct callchain_cursor *cursor,
2520 			      struct evsel *evsel,
2521 			      struct perf_sample *sample,
2522 			      struct symbol **parent,
2523 			      struct addr_location *root_al,
2524 			      int max_stack)
2525 {
2526 	int ret = 0;
2527 
2528 	callchain_cursor_reset(cursor);
2529 
2530 	if (callchain_param.order == ORDER_CALLEE) {
2531 		ret = thread__resolve_callchain_sample(thread, cursor,
2532 						       evsel, sample,
2533 						       parent, root_al,
2534 						       max_stack);
2535 		if (ret)
2536 			return ret;
2537 		ret = thread__resolve_callchain_unwind(thread, cursor,
2538 						       evsel, sample,
2539 						       max_stack);
2540 	} else {
2541 		ret = thread__resolve_callchain_unwind(thread, cursor,
2542 						       evsel, sample,
2543 						       max_stack);
2544 		if (ret)
2545 			return ret;
2546 		ret = thread__resolve_callchain_sample(thread, cursor,
2547 						       evsel, sample,
2548 						       parent, root_al,
2549 						       max_stack);
2550 	}
2551 
2552 	return ret;
2553 }
2554 
2555 int machine__for_each_thread(struct machine *machine,
2556 			     int (*fn)(struct thread *thread, void *p),
2557 			     void *priv)
2558 {
2559 	struct threads *threads;
2560 	struct rb_node *nd;
2561 	struct thread *thread;
2562 	int rc = 0;
2563 	int i;
2564 
2565 	for (i = 0; i < THREADS__TABLE_SIZE; i++) {
2566 		threads = &machine->threads[i];
2567 		for (nd = rb_first_cached(&threads->entries); nd;
2568 		     nd = rb_next(nd)) {
2569 			thread = rb_entry(nd, struct thread, rb_node);
2570 			rc = fn(thread, priv);
2571 			if (rc != 0)
2572 				return rc;
2573 		}
2574 
2575 		list_for_each_entry(thread, &threads->dead, node) {
2576 			rc = fn(thread, priv);
2577 			if (rc != 0)
2578 				return rc;
2579 		}
2580 	}
2581 	return rc;
2582 }
2583 
2584 int machines__for_each_thread(struct machines *machines,
2585 			      int (*fn)(struct thread *thread, void *p),
2586 			      void *priv)
2587 {
2588 	struct rb_node *nd;
2589 	int rc = 0;
2590 
2591 	rc = machine__for_each_thread(&machines->host, fn, priv);
2592 	if (rc != 0)
2593 		return rc;
2594 
2595 	for (nd = rb_first_cached(&machines->guests); nd; nd = rb_next(nd)) {
2596 		struct machine *machine = rb_entry(nd, struct machine, rb_node);
2597 
2598 		rc = machine__for_each_thread(machine, fn, priv);
2599 		if (rc != 0)
2600 			return rc;
2601 	}
2602 	return rc;
2603 }
2604 
2605 int __machine__synthesize_threads(struct machine *machine, struct perf_tool *tool,
2606 				  struct target *target, struct perf_thread_map *threads,
2607 				  perf_event__handler_t process, bool data_mmap,
2608 				  unsigned int nr_threads_synthesize)
2609 {
2610 	if (target__has_task(target))
2611 		return perf_event__synthesize_thread_map(tool, threads, process, machine, data_mmap);
2612 	else if (target__has_cpu(target))
2613 		return perf_event__synthesize_threads(tool, process,
2614 						      machine, data_mmap,
2615 						      nr_threads_synthesize);
2616 	/* command specified */
2617 	return 0;
2618 }
2619 
2620 pid_t machine__get_current_tid(struct machine *machine, int cpu)
2621 {
2622 	int nr_cpus = min(machine->env->nr_cpus_online, MAX_NR_CPUS);
2623 
2624 	if (cpu < 0 || cpu >= nr_cpus || !machine->current_tid)
2625 		return -1;
2626 
2627 	return machine->current_tid[cpu];
2628 }
2629 
2630 int machine__set_current_tid(struct machine *machine, int cpu, pid_t pid,
2631 			     pid_t tid)
2632 {
2633 	struct thread *thread;
2634 	int nr_cpus = min(machine->env->nr_cpus_online, MAX_NR_CPUS);
2635 
2636 	if (cpu < 0)
2637 		return -EINVAL;
2638 
2639 	if (!machine->current_tid) {
2640 		int i;
2641 
2642 		machine->current_tid = calloc(nr_cpus, sizeof(pid_t));
2643 		if (!machine->current_tid)
2644 			return -ENOMEM;
2645 		for (i = 0; i < nr_cpus; i++)
2646 			machine->current_tid[i] = -1;
2647 	}
2648 
2649 	if (cpu >= nr_cpus) {
2650 		pr_err("Requested CPU %d too large. ", cpu);
2651 		pr_err("Consider raising MAX_NR_CPUS\n");
2652 		return -EINVAL;
2653 	}
2654 
2655 	machine->current_tid[cpu] = tid;
2656 
2657 	thread = machine__findnew_thread(machine, pid, tid);
2658 	if (!thread)
2659 		return -ENOMEM;
2660 
2661 	thread->cpu = cpu;
2662 	thread__put(thread);
2663 
2664 	return 0;
2665 }
2666 
2667 /*
2668  * Compares the raw arch string. N.B. see instead perf_env__arch() if a
2669  * normalized arch is needed.
2670  */
2671 bool machine__is(struct machine *machine, const char *arch)
2672 {
2673 	return machine && !strcmp(perf_env__raw_arch(machine->env), arch);
2674 }
2675 
2676 int machine__nr_cpus_avail(struct machine *machine)
2677 {
2678 	return machine ? perf_env__nr_cpus_avail(machine->env) : 0;
2679 }
2680 
2681 int machine__get_kernel_start(struct machine *machine)
2682 {
2683 	struct map *map = machine__kernel_map(machine);
2684 	int err = 0;
2685 
2686 	/*
2687 	 * The only addresses above 2^63 are kernel addresses of a 64-bit
2688 	 * kernel.  Note that addresses are unsigned so that on a 32-bit system
2689 	 * all addresses including kernel addresses are less than 2^32.  In
2690 	 * that case (32-bit system), if the kernel mapping is unknown, all
2691 	 * addresses will be assumed to be in user space - see
2692 	 * machine__kernel_ip().
2693 	 */
2694 	machine->kernel_start = 1ULL << 63;
2695 	if (map) {
2696 		err = map__load(map);
2697 		/*
2698 		 * On x86_64, PTI entry trampolines are less than the
2699 		 * start of kernel text, but still above 2^63. So leave
2700 		 * kernel_start = 1ULL << 63 for x86_64.
2701 		 */
2702 		if (!err && !machine__is(machine, "x86_64"))
2703 			machine->kernel_start = map->start;
2704 	}
2705 	return err;
2706 }
2707 
2708 u8 machine__addr_cpumode(struct machine *machine, u8 cpumode, u64 addr)
2709 {
2710 	u8 addr_cpumode = cpumode;
2711 	bool kernel_ip;
2712 
2713 	if (!machine->single_address_space)
2714 		goto out;
2715 
2716 	kernel_ip = machine__kernel_ip(machine, addr);
2717 	switch (cpumode) {
2718 	case PERF_RECORD_MISC_KERNEL:
2719 	case PERF_RECORD_MISC_USER:
2720 		addr_cpumode = kernel_ip ? PERF_RECORD_MISC_KERNEL :
2721 					   PERF_RECORD_MISC_USER;
2722 		break;
2723 	case PERF_RECORD_MISC_GUEST_KERNEL:
2724 	case PERF_RECORD_MISC_GUEST_USER:
2725 		addr_cpumode = kernel_ip ? PERF_RECORD_MISC_GUEST_KERNEL :
2726 					   PERF_RECORD_MISC_GUEST_USER;
2727 		break;
2728 	default:
2729 		break;
2730 	}
2731 out:
2732 	return addr_cpumode;
2733 }
2734 
2735 struct dso *machine__findnew_dso(struct machine *machine, const char *filename)
2736 {
2737 	return dsos__findnew(&machine->dsos, filename);
2738 }
2739 
2740 char *machine__resolve_kernel_addr(void *vmachine, unsigned long long *addrp, char **modp)
2741 {
2742 	struct machine *machine = vmachine;
2743 	struct map *map;
2744 	struct symbol *sym = machine__find_kernel_symbol(machine, *addrp, &map);
2745 
2746 	if (sym == NULL)
2747 		return NULL;
2748 
2749 	*modp = __map__is_kmodule(map) ? (char *)map->dso->short_name : NULL;
2750 	*addrp = map->unmap_ip(map, sym->start);
2751 	return sym->name;
2752 }
2753