xref: /openbmc/linux/tools/perf/util/symbol.c (revision f9834f18)
1 // SPDX-License-Identifier: GPL-2.0
2 #include <dirent.h>
3 #include <errno.h>
4 #include <stdlib.h>
5 #include <stdio.h>
6 #include <string.h>
7 #include <linux/capability.h>
8 #include <linux/kernel.h>
9 #include <linux/mman.h>
10 #include <linux/string.h>
11 #include <linux/time64.h>
12 #include <sys/types.h>
13 #include <sys/stat.h>
14 #include <sys/param.h>
15 #include <fcntl.h>
16 #include <unistd.h>
17 #include <inttypes.h>
18 #include "annotate.h"
19 #include "build-id.h"
20 #include "cap.h"
21 #include "dso.h"
22 #include "util.h" // lsdir()
23 #include "debug.h"
24 #include "event.h"
25 #include "machine.h"
26 #include "map.h"
27 #include "symbol.h"
28 #include "map_symbol.h"
29 #include "mem-events.h"
30 #include "symsrc.h"
31 #include "strlist.h"
32 #include "intlist.h"
33 #include "namespaces.h"
34 #include "header.h"
35 #include "path.h"
36 #include <linux/ctype.h>
37 #include <linux/zalloc.h>
38 
39 #include <elf.h>
40 #include <limits.h>
41 #include <symbol/kallsyms.h>
42 #include <sys/utsname.h>
43 
44 static int dso__load_kernel_sym(struct dso *dso, struct map *map);
45 static int dso__load_guest_kernel_sym(struct dso *dso, struct map *map);
46 static bool symbol__is_idle(const char *name);
47 
48 int vmlinux_path__nr_entries;
49 char **vmlinux_path;
50 
51 struct symbol_conf symbol_conf = {
52 	.nanosecs		= false,
53 	.use_modules		= true,
54 	.try_vmlinux_path	= true,
55 	.demangle		= true,
56 	.demangle_kernel	= false,
57 	.cumulate_callchain	= true,
58 	.time_quantum		= 100 * NSEC_PER_MSEC, /* 100ms */
59 	.show_hist_headers	= true,
60 	.symfs			= "",
61 	.event_group		= true,
62 	.inline_name		= true,
63 	.res_sample		= 0,
64 };
65 
66 static enum dso_binary_type binary_type_symtab[] = {
67 	DSO_BINARY_TYPE__KALLSYMS,
68 	DSO_BINARY_TYPE__GUEST_KALLSYMS,
69 	DSO_BINARY_TYPE__JAVA_JIT,
70 	DSO_BINARY_TYPE__DEBUGLINK,
71 	DSO_BINARY_TYPE__BUILD_ID_CACHE,
72 	DSO_BINARY_TYPE__BUILD_ID_CACHE_DEBUGINFO,
73 	DSO_BINARY_TYPE__FEDORA_DEBUGINFO,
74 	DSO_BINARY_TYPE__UBUNTU_DEBUGINFO,
75 	DSO_BINARY_TYPE__BUILDID_DEBUGINFO,
76 	DSO_BINARY_TYPE__SYSTEM_PATH_DSO,
77 	DSO_BINARY_TYPE__GUEST_KMODULE,
78 	DSO_BINARY_TYPE__GUEST_KMODULE_COMP,
79 	DSO_BINARY_TYPE__SYSTEM_PATH_KMODULE,
80 	DSO_BINARY_TYPE__SYSTEM_PATH_KMODULE_COMP,
81 	DSO_BINARY_TYPE__OPENEMBEDDED_DEBUGINFO,
82 	DSO_BINARY_TYPE__NOT_FOUND,
83 };
84 
85 #define DSO_BINARY_TYPE__SYMTAB_CNT ARRAY_SIZE(binary_type_symtab)
86 
87 static bool symbol_type__filter(char symbol_type)
88 {
89 	symbol_type = toupper(symbol_type);
90 	return symbol_type == 'T' || symbol_type == 'W' || symbol_type == 'D' || symbol_type == 'B';
91 }
92 
93 static int prefix_underscores_count(const char *str)
94 {
95 	const char *tail = str;
96 
97 	while (*tail == '_')
98 		tail++;
99 
100 	return tail - str;
101 }
102 
103 void __weak arch__symbols__fixup_end(struct symbol *p, struct symbol *c)
104 {
105 	p->end = c->start;
106 }
107 
108 const char * __weak arch__normalize_symbol_name(const char *name)
109 {
110 	return name;
111 }
112 
113 int __weak arch__compare_symbol_names(const char *namea, const char *nameb)
114 {
115 	return strcmp(namea, nameb);
116 }
117 
118 int __weak arch__compare_symbol_names_n(const char *namea, const char *nameb,
119 					unsigned int n)
120 {
121 	return strncmp(namea, nameb, n);
122 }
123 
124 int __weak arch__choose_best_symbol(struct symbol *syma,
125 				    struct symbol *symb __maybe_unused)
126 {
127 	/* Avoid "SyS" kernel syscall aliases */
128 	if (strlen(syma->name) >= 3 && !strncmp(syma->name, "SyS", 3))
129 		return SYMBOL_B;
130 	if (strlen(syma->name) >= 10 && !strncmp(syma->name, "compat_SyS", 10))
131 		return SYMBOL_B;
132 
133 	return SYMBOL_A;
134 }
135 
136 static int choose_best_symbol(struct symbol *syma, struct symbol *symb)
137 {
138 	s64 a;
139 	s64 b;
140 	size_t na, nb;
141 
142 	/* Prefer a symbol with non zero length */
143 	a = syma->end - syma->start;
144 	b = symb->end - symb->start;
145 	if ((b == 0) && (a > 0))
146 		return SYMBOL_A;
147 	else if ((a == 0) && (b > 0))
148 		return SYMBOL_B;
149 
150 	/* Prefer a non weak symbol over a weak one */
151 	a = syma->binding == STB_WEAK;
152 	b = symb->binding == STB_WEAK;
153 	if (b && !a)
154 		return SYMBOL_A;
155 	if (a && !b)
156 		return SYMBOL_B;
157 
158 	/* Prefer a global symbol over a non global one */
159 	a = syma->binding == STB_GLOBAL;
160 	b = symb->binding == STB_GLOBAL;
161 	if (a && !b)
162 		return SYMBOL_A;
163 	if (b && !a)
164 		return SYMBOL_B;
165 
166 	/* Prefer a symbol with less underscores */
167 	a = prefix_underscores_count(syma->name);
168 	b = prefix_underscores_count(symb->name);
169 	if (b > a)
170 		return SYMBOL_A;
171 	else if (a > b)
172 		return SYMBOL_B;
173 
174 	/* Choose the symbol with the longest name */
175 	na = strlen(syma->name);
176 	nb = strlen(symb->name);
177 	if (na > nb)
178 		return SYMBOL_A;
179 	else if (na < nb)
180 		return SYMBOL_B;
181 
182 	return arch__choose_best_symbol(syma, symb);
183 }
184 
185 void symbols__fixup_duplicate(struct rb_root_cached *symbols)
186 {
187 	struct rb_node *nd;
188 	struct symbol *curr, *next;
189 
190 	if (symbol_conf.allow_aliases)
191 		return;
192 
193 	nd = rb_first_cached(symbols);
194 
195 	while (nd) {
196 		curr = rb_entry(nd, struct symbol, rb_node);
197 again:
198 		nd = rb_next(&curr->rb_node);
199 		next = rb_entry(nd, struct symbol, rb_node);
200 
201 		if (!nd)
202 			break;
203 
204 		if (curr->start != next->start)
205 			continue;
206 
207 		if (choose_best_symbol(curr, next) == SYMBOL_A) {
208 			rb_erase_cached(&next->rb_node, symbols);
209 			symbol__delete(next);
210 			goto again;
211 		} else {
212 			nd = rb_next(&curr->rb_node);
213 			rb_erase_cached(&curr->rb_node, symbols);
214 			symbol__delete(curr);
215 		}
216 	}
217 }
218 
219 void symbols__fixup_end(struct rb_root_cached *symbols)
220 {
221 	struct rb_node *nd, *prevnd = rb_first_cached(symbols);
222 	struct symbol *curr, *prev;
223 
224 	if (prevnd == NULL)
225 		return;
226 
227 	curr = rb_entry(prevnd, struct symbol, rb_node);
228 
229 	for (nd = rb_next(prevnd); nd; nd = rb_next(nd)) {
230 		prev = curr;
231 		curr = rb_entry(nd, struct symbol, rb_node);
232 
233 		if (prev->end == prev->start && prev->end != curr->start)
234 			arch__symbols__fixup_end(prev, curr);
235 	}
236 
237 	/* Last entry */
238 	if (curr->end == curr->start)
239 		curr->end = roundup(curr->start, 4096) + 4096;
240 }
241 
242 void maps__fixup_end(struct maps *maps)
243 {
244 	struct map *prev = NULL, *curr;
245 
246 	down_write(&maps->lock);
247 
248 	maps__for_each_entry(maps, curr) {
249 		if (prev != NULL && !prev->end)
250 			prev->end = curr->start;
251 
252 		prev = curr;
253 	}
254 
255 	/*
256 	 * We still haven't the actual symbols, so guess the
257 	 * last map final address.
258 	 */
259 	if (curr && !curr->end)
260 		curr->end = ~0ULL;
261 
262 	up_write(&maps->lock);
263 }
264 
265 struct symbol *symbol__new(u64 start, u64 len, u8 binding, u8 type, const char *name)
266 {
267 	size_t namelen = strlen(name) + 1;
268 	struct symbol *sym = calloc(1, (symbol_conf.priv_size +
269 					sizeof(*sym) + namelen));
270 	if (sym == NULL)
271 		return NULL;
272 
273 	if (symbol_conf.priv_size) {
274 		if (symbol_conf.init_annotation) {
275 			struct annotation *notes = (void *)sym;
276 			pthread_mutex_init(&notes->lock, NULL);
277 		}
278 		sym = ((void *)sym) + symbol_conf.priv_size;
279 	}
280 
281 	sym->start   = start;
282 	sym->end     = len ? start + len : start;
283 	sym->type    = type;
284 	sym->binding = binding;
285 	sym->namelen = namelen - 1;
286 
287 	pr_debug4("%s: %s %#" PRIx64 "-%#" PRIx64 "\n",
288 		  __func__, name, start, sym->end);
289 	memcpy(sym->name, name, namelen);
290 
291 	return sym;
292 }
293 
294 void symbol__delete(struct symbol *sym)
295 {
296 	free(((void *)sym) - symbol_conf.priv_size);
297 }
298 
299 void symbols__delete(struct rb_root_cached *symbols)
300 {
301 	struct symbol *pos;
302 	struct rb_node *next = rb_first_cached(symbols);
303 
304 	while (next) {
305 		pos = rb_entry(next, struct symbol, rb_node);
306 		next = rb_next(&pos->rb_node);
307 		rb_erase_cached(&pos->rb_node, symbols);
308 		symbol__delete(pos);
309 	}
310 }
311 
312 void __symbols__insert(struct rb_root_cached *symbols,
313 		       struct symbol *sym, bool kernel)
314 {
315 	struct rb_node **p = &symbols->rb_root.rb_node;
316 	struct rb_node *parent = NULL;
317 	const u64 ip = sym->start;
318 	struct symbol *s;
319 	bool leftmost = true;
320 
321 	if (kernel) {
322 		const char *name = sym->name;
323 		/*
324 		 * ppc64 uses function descriptors and appends a '.' to the
325 		 * start of every instruction address. Remove it.
326 		 */
327 		if (name[0] == '.')
328 			name++;
329 		sym->idle = symbol__is_idle(name);
330 	}
331 
332 	while (*p != NULL) {
333 		parent = *p;
334 		s = rb_entry(parent, struct symbol, rb_node);
335 		if (ip < s->start)
336 			p = &(*p)->rb_left;
337 		else {
338 			p = &(*p)->rb_right;
339 			leftmost = false;
340 		}
341 	}
342 	rb_link_node(&sym->rb_node, parent, p);
343 	rb_insert_color_cached(&sym->rb_node, symbols, leftmost);
344 }
345 
346 void symbols__insert(struct rb_root_cached *symbols, struct symbol *sym)
347 {
348 	__symbols__insert(symbols, sym, false);
349 }
350 
351 static struct symbol *symbols__find(struct rb_root_cached *symbols, u64 ip)
352 {
353 	struct rb_node *n;
354 
355 	if (symbols == NULL)
356 		return NULL;
357 
358 	n = symbols->rb_root.rb_node;
359 
360 	while (n) {
361 		struct symbol *s = rb_entry(n, struct symbol, rb_node);
362 
363 		if (ip < s->start)
364 			n = n->rb_left;
365 		else if (ip > s->end || (ip == s->end && ip != s->start))
366 			n = n->rb_right;
367 		else
368 			return s;
369 	}
370 
371 	return NULL;
372 }
373 
374 static struct symbol *symbols__first(struct rb_root_cached *symbols)
375 {
376 	struct rb_node *n = rb_first_cached(symbols);
377 
378 	if (n)
379 		return rb_entry(n, struct symbol, rb_node);
380 
381 	return NULL;
382 }
383 
384 static struct symbol *symbols__last(struct rb_root_cached *symbols)
385 {
386 	struct rb_node *n = rb_last(&symbols->rb_root);
387 
388 	if (n)
389 		return rb_entry(n, struct symbol, rb_node);
390 
391 	return NULL;
392 }
393 
394 static struct symbol *symbols__next(struct symbol *sym)
395 {
396 	struct rb_node *n = rb_next(&sym->rb_node);
397 
398 	if (n)
399 		return rb_entry(n, struct symbol, rb_node);
400 
401 	return NULL;
402 }
403 
404 static void symbols__insert_by_name(struct rb_root_cached *symbols, struct symbol *sym)
405 {
406 	struct rb_node **p = &symbols->rb_root.rb_node;
407 	struct rb_node *parent = NULL;
408 	struct symbol_name_rb_node *symn, *s;
409 	bool leftmost = true;
410 
411 	symn = container_of(sym, struct symbol_name_rb_node, sym);
412 
413 	while (*p != NULL) {
414 		parent = *p;
415 		s = rb_entry(parent, struct symbol_name_rb_node, rb_node);
416 		if (strcmp(sym->name, s->sym.name) < 0)
417 			p = &(*p)->rb_left;
418 		else {
419 			p = &(*p)->rb_right;
420 			leftmost = false;
421 		}
422 	}
423 	rb_link_node(&symn->rb_node, parent, p);
424 	rb_insert_color_cached(&symn->rb_node, symbols, leftmost);
425 }
426 
427 static void symbols__sort_by_name(struct rb_root_cached *symbols,
428 				  struct rb_root_cached *source)
429 {
430 	struct rb_node *nd;
431 
432 	for (nd = rb_first_cached(source); nd; nd = rb_next(nd)) {
433 		struct symbol *pos = rb_entry(nd, struct symbol, rb_node);
434 		symbols__insert_by_name(symbols, pos);
435 	}
436 }
437 
438 int symbol__match_symbol_name(const char *name, const char *str,
439 			      enum symbol_tag_include includes)
440 {
441 	const char *versioning;
442 
443 	if (includes == SYMBOL_TAG_INCLUDE__DEFAULT_ONLY &&
444 	    (versioning = strstr(name, "@@"))) {
445 		int len = strlen(str);
446 
447 		if (len < versioning - name)
448 			len = versioning - name;
449 
450 		return arch__compare_symbol_names_n(name, str, len);
451 	} else
452 		return arch__compare_symbol_names(name, str);
453 }
454 
455 static struct symbol *symbols__find_by_name(struct rb_root_cached *symbols,
456 					    const char *name,
457 					    enum symbol_tag_include includes)
458 {
459 	struct rb_node *n;
460 	struct symbol_name_rb_node *s = NULL;
461 
462 	if (symbols == NULL)
463 		return NULL;
464 
465 	n = symbols->rb_root.rb_node;
466 
467 	while (n) {
468 		int cmp;
469 
470 		s = rb_entry(n, struct symbol_name_rb_node, rb_node);
471 		cmp = symbol__match_symbol_name(s->sym.name, name, includes);
472 
473 		if (cmp > 0)
474 			n = n->rb_left;
475 		else if (cmp < 0)
476 			n = n->rb_right;
477 		else
478 			break;
479 	}
480 
481 	if (n == NULL)
482 		return NULL;
483 
484 	if (includes != SYMBOL_TAG_INCLUDE__DEFAULT_ONLY)
485 		/* return first symbol that has same name (if any) */
486 		for (n = rb_prev(n); n; n = rb_prev(n)) {
487 			struct symbol_name_rb_node *tmp;
488 
489 			tmp = rb_entry(n, struct symbol_name_rb_node, rb_node);
490 			if (arch__compare_symbol_names(tmp->sym.name, s->sym.name))
491 				break;
492 
493 			s = tmp;
494 		}
495 
496 	return &s->sym;
497 }
498 
499 void dso__reset_find_symbol_cache(struct dso *dso)
500 {
501 	dso->last_find_result.addr   = 0;
502 	dso->last_find_result.symbol = NULL;
503 }
504 
505 void dso__insert_symbol(struct dso *dso, struct symbol *sym)
506 {
507 	__symbols__insert(&dso->symbols, sym, dso->kernel);
508 
509 	/* update the symbol cache if necessary */
510 	if (dso->last_find_result.addr >= sym->start &&
511 	    (dso->last_find_result.addr < sym->end ||
512 	    sym->start == sym->end)) {
513 		dso->last_find_result.symbol = sym;
514 	}
515 }
516 
517 struct symbol *dso__find_symbol(struct dso *dso, u64 addr)
518 {
519 	if (dso->last_find_result.addr != addr || dso->last_find_result.symbol == NULL) {
520 		dso->last_find_result.addr   = addr;
521 		dso->last_find_result.symbol = symbols__find(&dso->symbols, addr);
522 	}
523 
524 	return dso->last_find_result.symbol;
525 }
526 
527 struct symbol *dso__first_symbol(struct dso *dso)
528 {
529 	return symbols__first(&dso->symbols);
530 }
531 
532 struct symbol *dso__last_symbol(struct dso *dso)
533 {
534 	return symbols__last(&dso->symbols);
535 }
536 
537 struct symbol *dso__next_symbol(struct symbol *sym)
538 {
539 	return symbols__next(sym);
540 }
541 
542 struct symbol *symbol__next_by_name(struct symbol *sym)
543 {
544 	struct symbol_name_rb_node *s = container_of(sym, struct symbol_name_rb_node, sym);
545 	struct rb_node *n = rb_next(&s->rb_node);
546 
547 	return n ? &rb_entry(n, struct symbol_name_rb_node, rb_node)->sym : NULL;
548 }
549 
550  /*
551   * Returns first symbol that matched with @name.
552   */
553 struct symbol *dso__find_symbol_by_name(struct dso *dso, const char *name)
554 {
555 	struct symbol *s = symbols__find_by_name(&dso->symbol_names, name,
556 						 SYMBOL_TAG_INCLUDE__NONE);
557 	if (!s)
558 		s = symbols__find_by_name(&dso->symbol_names, name,
559 					  SYMBOL_TAG_INCLUDE__DEFAULT_ONLY);
560 	return s;
561 }
562 
563 void dso__sort_by_name(struct dso *dso)
564 {
565 	dso__set_sorted_by_name(dso);
566 	return symbols__sort_by_name(&dso->symbol_names, &dso->symbols);
567 }
568 
569 int modules__parse(const char *filename, void *arg,
570 		   int (*process_module)(void *arg, const char *name,
571 					 u64 start, u64 size))
572 {
573 	char *line = NULL;
574 	size_t n;
575 	FILE *file;
576 	int err = 0;
577 
578 	file = fopen(filename, "r");
579 	if (file == NULL)
580 		return -1;
581 
582 	while (1) {
583 		char name[PATH_MAX];
584 		u64 start, size;
585 		char *sep, *endptr;
586 		ssize_t line_len;
587 
588 		line_len = getline(&line, &n, file);
589 		if (line_len < 0) {
590 			if (feof(file))
591 				break;
592 			err = -1;
593 			goto out;
594 		}
595 
596 		if (!line) {
597 			err = -1;
598 			goto out;
599 		}
600 
601 		line[--line_len] = '\0'; /* \n */
602 
603 		sep = strrchr(line, 'x');
604 		if (sep == NULL)
605 			continue;
606 
607 		hex2u64(sep + 1, &start);
608 
609 		sep = strchr(line, ' ');
610 		if (sep == NULL)
611 			continue;
612 
613 		*sep = '\0';
614 
615 		scnprintf(name, sizeof(name), "[%s]", line);
616 
617 		size = strtoul(sep + 1, &endptr, 0);
618 		if (*endptr != ' ' && *endptr != '\t')
619 			continue;
620 
621 		err = process_module(arg, name, start, size);
622 		if (err)
623 			break;
624 	}
625 out:
626 	free(line);
627 	fclose(file);
628 	return err;
629 }
630 
631 /*
632  * These are symbols in the kernel image, so make sure that
633  * sym is from a kernel DSO.
634  */
635 static bool symbol__is_idle(const char *name)
636 {
637 	const char * const idle_symbols[] = {
638 		"acpi_idle_do_entry",
639 		"acpi_processor_ffh_cstate_enter",
640 		"arch_cpu_idle",
641 		"cpu_idle",
642 		"cpu_startup_entry",
643 		"idle_cpu",
644 		"intel_idle",
645 		"default_idle",
646 		"native_safe_halt",
647 		"enter_idle",
648 		"exit_idle",
649 		"mwait_idle",
650 		"mwait_idle_with_hints",
651 		"poll_idle",
652 		"ppc64_runlatch_off",
653 		"pseries_dedicated_idle_sleep",
654 		NULL
655 	};
656 	int i;
657 	static struct strlist *idle_symbols_list;
658 
659 	if (idle_symbols_list)
660 		return strlist__has_entry(idle_symbols_list, name);
661 
662 	idle_symbols_list = strlist__new(NULL, NULL);
663 
664 	for (i = 0; idle_symbols[i]; i++)
665 		strlist__add(idle_symbols_list, idle_symbols[i]);
666 
667 	return strlist__has_entry(idle_symbols_list, name);
668 }
669 
670 static int map__process_kallsym_symbol(void *arg, const char *name,
671 				       char type, u64 start)
672 {
673 	struct symbol *sym;
674 	struct dso *dso = arg;
675 	struct rb_root_cached *root = &dso->symbols;
676 
677 	if (!symbol_type__filter(type))
678 		return 0;
679 
680 	/*
681 	 * module symbols are not sorted so we add all
682 	 * symbols, setting length to 0, and rely on
683 	 * symbols__fixup_end() to fix it up.
684 	 */
685 	sym = symbol__new(start, 0, kallsyms2elf_binding(type), kallsyms2elf_type(type), name);
686 	if (sym == NULL)
687 		return -ENOMEM;
688 	/*
689 	 * We will pass the symbols to the filter later, in
690 	 * map__split_kallsyms, when we have split the maps per module
691 	 */
692 	__symbols__insert(root, sym, !strchr(name, '['));
693 
694 	return 0;
695 }
696 
697 /*
698  * Loads the function entries in /proc/kallsyms into kernel_map->dso,
699  * so that we can in the next step set the symbol ->end address and then
700  * call kernel_maps__split_kallsyms.
701  */
702 static int dso__load_all_kallsyms(struct dso *dso, const char *filename)
703 {
704 	return kallsyms__parse(filename, dso, map__process_kallsym_symbol);
705 }
706 
707 static int maps__split_kallsyms_for_kcore(struct maps *kmaps, struct dso *dso)
708 {
709 	struct map *curr_map;
710 	struct symbol *pos;
711 	int count = 0;
712 	struct rb_root_cached old_root = dso->symbols;
713 	struct rb_root_cached *root = &dso->symbols;
714 	struct rb_node *next = rb_first_cached(root);
715 
716 	if (!kmaps)
717 		return -1;
718 
719 	*root = RB_ROOT_CACHED;
720 
721 	while (next) {
722 		char *module;
723 
724 		pos = rb_entry(next, struct symbol, rb_node);
725 		next = rb_next(&pos->rb_node);
726 
727 		rb_erase_cached(&pos->rb_node, &old_root);
728 		RB_CLEAR_NODE(&pos->rb_node);
729 		module = strchr(pos->name, '\t');
730 		if (module)
731 			*module = '\0';
732 
733 		curr_map = maps__find(kmaps, pos->start);
734 
735 		if (!curr_map) {
736 			symbol__delete(pos);
737 			continue;
738 		}
739 
740 		pos->start -= curr_map->start - curr_map->pgoff;
741 		if (pos->end > curr_map->end)
742 			pos->end = curr_map->end;
743 		if (pos->end)
744 			pos->end -= curr_map->start - curr_map->pgoff;
745 		symbols__insert(&curr_map->dso->symbols, pos);
746 		++count;
747 	}
748 
749 	/* Symbols have been adjusted */
750 	dso->adjust_symbols = 1;
751 
752 	return count;
753 }
754 
755 /*
756  * Split the symbols into maps, making sure there are no overlaps, i.e. the
757  * kernel range is broken in several maps, named [kernel].N, as we don't have
758  * the original ELF section names vmlinux have.
759  */
760 static int maps__split_kallsyms(struct maps *kmaps, struct dso *dso, u64 delta,
761 				struct map *initial_map)
762 {
763 	struct machine *machine;
764 	struct map *curr_map = initial_map;
765 	struct symbol *pos;
766 	int count = 0, moved = 0;
767 	struct rb_root_cached *root = &dso->symbols;
768 	struct rb_node *next = rb_first_cached(root);
769 	int kernel_range = 0;
770 	bool x86_64;
771 
772 	if (!kmaps)
773 		return -1;
774 
775 	machine = kmaps->machine;
776 
777 	x86_64 = machine__is(machine, "x86_64");
778 
779 	while (next) {
780 		char *module;
781 
782 		pos = rb_entry(next, struct symbol, rb_node);
783 		next = rb_next(&pos->rb_node);
784 
785 		module = strchr(pos->name, '\t');
786 		if (module) {
787 			if (!symbol_conf.use_modules)
788 				goto discard_symbol;
789 
790 			*module++ = '\0';
791 
792 			if (strcmp(curr_map->dso->short_name, module)) {
793 				if (curr_map != initial_map &&
794 				    dso->kernel == DSO_TYPE_GUEST_KERNEL &&
795 				    machine__is_default_guest(machine)) {
796 					/*
797 					 * We assume all symbols of a module are
798 					 * continuous in * kallsyms, so curr_map
799 					 * points to a module and all its
800 					 * symbols are in its kmap. Mark it as
801 					 * loaded.
802 					 */
803 					dso__set_loaded(curr_map->dso);
804 				}
805 
806 				curr_map = maps__find_by_name(kmaps, module);
807 				if (curr_map == NULL) {
808 					pr_debug("%s/proc/{kallsyms,modules} "
809 					         "inconsistency while looking "
810 						 "for \"%s\" module!\n",
811 						 machine->root_dir, module);
812 					curr_map = initial_map;
813 					goto discard_symbol;
814 				}
815 
816 				if (curr_map->dso->loaded &&
817 				    !machine__is_default_guest(machine))
818 					goto discard_symbol;
819 			}
820 			/*
821 			 * So that we look just like we get from .ko files,
822 			 * i.e. not prelinked, relative to initial_map->start.
823 			 */
824 			pos->start = curr_map->map_ip(curr_map, pos->start);
825 			pos->end   = curr_map->map_ip(curr_map, pos->end);
826 		} else if (x86_64 && is_entry_trampoline(pos->name)) {
827 			/*
828 			 * These symbols are not needed anymore since the
829 			 * trampoline maps refer to the text section and it's
830 			 * symbols instead. Avoid having to deal with
831 			 * relocations, and the assumption that the first symbol
832 			 * is the start of kernel text, by simply removing the
833 			 * symbols at this point.
834 			 */
835 			goto discard_symbol;
836 		} else if (curr_map != initial_map) {
837 			char dso_name[PATH_MAX];
838 			struct dso *ndso;
839 
840 			if (delta) {
841 				/* Kernel was relocated at boot time */
842 				pos->start -= delta;
843 				pos->end -= delta;
844 			}
845 
846 			if (count == 0) {
847 				curr_map = initial_map;
848 				goto add_symbol;
849 			}
850 
851 			if (dso->kernel == DSO_TYPE_GUEST_KERNEL)
852 				snprintf(dso_name, sizeof(dso_name),
853 					"[guest.kernel].%d",
854 					kernel_range++);
855 			else
856 				snprintf(dso_name, sizeof(dso_name),
857 					"[kernel].%d",
858 					kernel_range++);
859 
860 			ndso = dso__new(dso_name);
861 			if (ndso == NULL)
862 				return -1;
863 
864 			ndso->kernel = dso->kernel;
865 
866 			curr_map = map__new2(pos->start, ndso);
867 			if (curr_map == NULL) {
868 				dso__put(ndso);
869 				return -1;
870 			}
871 
872 			curr_map->map_ip = curr_map->unmap_ip = identity__map_ip;
873 			maps__insert(kmaps, curr_map);
874 			++kernel_range;
875 		} else if (delta) {
876 			/* Kernel was relocated at boot time */
877 			pos->start -= delta;
878 			pos->end -= delta;
879 		}
880 add_symbol:
881 		if (curr_map != initial_map) {
882 			rb_erase_cached(&pos->rb_node, root);
883 			symbols__insert(&curr_map->dso->symbols, pos);
884 			++moved;
885 		} else
886 			++count;
887 
888 		continue;
889 discard_symbol:
890 		rb_erase_cached(&pos->rb_node, root);
891 		symbol__delete(pos);
892 	}
893 
894 	if (curr_map != initial_map &&
895 	    dso->kernel == DSO_TYPE_GUEST_KERNEL &&
896 	    machine__is_default_guest(kmaps->machine)) {
897 		dso__set_loaded(curr_map->dso);
898 	}
899 
900 	return count + moved;
901 }
902 
903 bool symbol__restricted_filename(const char *filename,
904 				 const char *restricted_filename)
905 {
906 	bool restricted = false;
907 
908 	if (symbol_conf.kptr_restrict) {
909 		char *r = realpath(filename, NULL);
910 
911 		if (r != NULL) {
912 			restricted = strcmp(r, restricted_filename) == 0;
913 			free(r);
914 			return restricted;
915 		}
916 	}
917 
918 	return restricted;
919 }
920 
921 struct module_info {
922 	struct rb_node rb_node;
923 	char *name;
924 	u64 start;
925 };
926 
927 static void add_module(struct module_info *mi, struct rb_root *modules)
928 {
929 	struct rb_node **p = &modules->rb_node;
930 	struct rb_node *parent = NULL;
931 	struct module_info *m;
932 
933 	while (*p != NULL) {
934 		parent = *p;
935 		m = rb_entry(parent, struct module_info, rb_node);
936 		if (strcmp(mi->name, m->name) < 0)
937 			p = &(*p)->rb_left;
938 		else
939 			p = &(*p)->rb_right;
940 	}
941 	rb_link_node(&mi->rb_node, parent, p);
942 	rb_insert_color(&mi->rb_node, modules);
943 }
944 
945 static void delete_modules(struct rb_root *modules)
946 {
947 	struct module_info *mi;
948 	struct rb_node *next = rb_first(modules);
949 
950 	while (next) {
951 		mi = rb_entry(next, struct module_info, rb_node);
952 		next = rb_next(&mi->rb_node);
953 		rb_erase(&mi->rb_node, modules);
954 		zfree(&mi->name);
955 		free(mi);
956 	}
957 }
958 
959 static struct module_info *find_module(const char *name,
960 				       struct rb_root *modules)
961 {
962 	struct rb_node *n = modules->rb_node;
963 
964 	while (n) {
965 		struct module_info *m;
966 		int cmp;
967 
968 		m = rb_entry(n, struct module_info, rb_node);
969 		cmp = strcmp(name, m->name);
970 		if (cmp < 0)
971 			n = n->rb_left;
972 		else if (cmp > 0)
973 			n = n->rb_right;
974 		else
975 			return m;
976 	}
977 
978 	return NULL;
979 }
980 
981 static int __read_proc_modules(void *arg, const char *name, u64 start,
982 			       u64 size __maybe_unused)
983 {
984 	struct rb_root *modules = arg;
985 	struct module_info *mi;
986 
987 	mi = zalloc(sizeof(struct module_info));
988 	if (!mi)
989 		return -ENOMEM;
990 
991 	mi->name = strdup(name);
992 	mi->start = start;
993 
994 	if (!mi->name) {
995 		free(mi);
996 		return -ENOMEM;
997 	}
998 
999 	add_module(mi, modules);
1000 
1001 	return 0;
1002 }
1003 
1004 static int read_proc_modules(const char *filename, struct rb_root *modules)
1005 {
1006 	if (symbol__restricted_filename(filename, "/proc/modules"))
1007 		return -1;
1008 
1009 	if (modules__parse(filename, modules, __read_proc_modules)) {
1010 		delete_modules(modules);
1011 		return -1;
1012 	}
1013 
1014 	return 0;
1015 }
1016 
1017 int compare_proc_modules(const char *from, const char *to)
1018 {
1019 	struct rb_root from_modules = RB_ROOT;
1020 	struct rb_root to_modules = RB_ROOT;
1021 	struct rb_node *from_node, *to_node;
1022 	struct module_info *from_m, *to_m;
1023 	int ret = -1;
1024 
1025 	if (read_proc_modules(from, &from_modules))
1026 		return -1;
1027 
1028 	if (read_proc_modules(to, &to_modules))
1029 		goto out_delete_from;
1030 
1031 	from_node = rb_first(&from_modules);
1032 	to_node = rb_first(&to_modules);
1033 	while (from_node) {
1034 		if (!to_node)
1035 			break;
1036 
1037 		from_m = rb_entry(from_node, struct module_info, rb_node);
1038 		to_m = rb_entry(to_node, struct module_info, rb_node);
1039 
1040 		if (from_m->start != to_m->start ||
1041 		    strcmp(from_m->name, to_m->name))
1042 			break;
1043 
1044 		from_node = rb_next(from_node);
1045 		to_node = rb_next(to_node);
1046 	}
1047 
1048 	if (!from_node && !to_node)
1049 		ret = 0;
1050 
1051 	delete_modules(&to_modules);
1052 out_delete_from:
1053 	delete_modules(&from_modules);
1054 
1055 	return ret;
1056 }
1057 
1058 static int do_validate_kcore_modules(const char *filename, struct maps *kmaps)
1059 {
1060 	struct rb_root modules = RB_ROOT;
1061 	struct map *old_map;
1062 	int err;
1063 
1064 	err = read_proc_modules(filename, &modules);
1065 	if (err)
1066 		return err;
1067 
1068 	maps__for_each_entry(kmaps, old_map) {
1069 		struct module_info *mi;
1070 
1071 		if (!__map__is_kmodule(old_map)) {
1072 			continue;
1073 		}
1074 
1075 		/* Module must be in memory at the same address */
1076 		mi = find_module(old_map->dso->short_name, &modules);
1077 		if (!mi || mi->start != old_map->start) {
1078 			err = -EINVAL;
1079 			goto out;
1080 		}
1081 	}
1082 out:
1083 	delete_modules(&modules);
1084 	return err;
1085 }
1086 
1087 /*
1088  * If kallsyms is referenced by name then we look for filename in the same
1089  * directory.
1090  */
1091 static bool filename_from_kallsyms_filename(char *filename,
1092 					    const char *base_name,
1093 					    const char *kallsyms_filename)
1094 {
1095 	char *name;
1096 
1097 	strcpy(filename, kallsyms_filename);
1098 	name = strrchr(filename, '/');
1099 	if (!name)
1100 		return false;
1101 
1102 	name += 1;
1103 
1104 	if (!strcmp(name, "kallsyms")) {
1105 		strcpy(name, base_name);
1106 		return true;
1107 	}
1108 
1109 	return false;
1110 }
1111 
1112 static int validate_kcore_modules(const char *kallsyms_filename,
1113 				  struct map *map)
1114 {
1115 	struct maps *kmaps = map__kmaps(map);
1116 	char modules_filename[PATH_MAX];
1117 
1118 	if (!kmaps)
1119 		return -EINVAL;
1120 
1121 	if (!filename_from_kallsyms_filename(modules_filename, "modules",
1122 					     kallsyms_filename))
1123 		return -EINVAL;
1124 
1125 	if (do_validate_kcore_modules(modules_filename, kmaps))
1126 		return -EINVAL;
1127 
1128 	return 0;
1129 }
1130 
1131 static int validate_kcore_addresses(const char *kallsyms_filename,
1132 				    struct map *map)
1133 {
1134 	struct kmap *kmap = map__kmap(map);
1135 
1136 	if (!kmap)
1137 		return -EINVAL;
1138 
1139 	if (kmap->ref_reloc_sym && kmap->ref_reloc_sym->name) {
1140 		u64 start;
1141 
1142 		if (kallsyms__get_function_start(kallsyms_filename,
1143 						 kmap->ref_reloc_sym->name, &start))
1144 			return -ENOENT;
1145 		if (start != kmap->ref_reloc_sym->addr)
1146 			return -EINVAL;
1147 	}
1148 
1149 	return validate_kcore_modules(kallsyms_filename, map);
1150 }
1151 
1152 struct kcore_mapfn_data {
1153 	struct dso *dso;
1154 	struct list_head maps;
1155 };
1156 
1157 static int kcore_mapfn(u64 start, u64 len, u64 pgoff, void *data)
1158 {
1159 	struct kcore_mapfn_data *md = data;
1160 	struct map *map;
1161 
1162 	map = map__new2(start, md->dso);
1163 	if (map == NULL)
1164 		return -ENOMEM;
1165 
1166 	map->end = map->start + len;
1167 	map->pgoff = pgoff;
1168 
1169 	list_add(&map->node, &md->maps);
1170 
1171 	return 0;
1172 }
1173 
1174 /*
1175  * Merges map into maps by splitting the new map within the existing map
1176  * regions.
1177  */
1178 int maps__merge_in(struct maps *kmaps, struct map *new_map)
1179 {
1180 	struct map *old_map;
1181 	LIST_HEAD(merged);
1182 
1183 	maps__for_each_entry(kmaps, old_map) {
1184 		/* no overload with this one */
1185 		if (new_map->end < old_map->start ||
1186 		    new_map->start >= old_map->end)
1187 			continue;
1188 
1189 		if (new_map->start < old_map->start) {
1190 			/*
1191 			 * |new......
1192 			 *       |old....
1193 			 */
1194 			if (new_map->end < old_map->end) {
1195 				/*
1196 				 * |new......|     -> |new..|
1197 				 *       |old....| ->       |old....|
1198 				 */
1199 				new_map->end = old_map->start;
1200 			} else {
1201 				/*
1202 				 * |new.............| -> |new..|       |new..|
1203 				 *       |old....|    ->       |old....|
1204 				 */
1205 				struct map *m = map__clone(new_map);
1206 
1207 				if (!m)
1208 					return -ENOMEM;
1209 
1210 				m->end = old_map->start;
1211 				list_add_tail(&m->node, &merged);
1212 				new_map->start = old_map->end;
1213 			}
1214 		} else {
1215 			/*
1216 			 *      |new......
1217 			 * |old....
1218 			 */
1219 			if (new_map->end < old_map->end) {
1220 				/*
1221 				 *      |new..|   -> x
1222 				 * |old.........| -> |old.........|
1223 				 */
1224 				map__put(new_map);
1225 				new_map = NULL;
1226 				break;
1227 			} else {
1228 				/*
1229 				 *      |new......| ->         |new...|
1230 				 * |old....|        -> |old....|
1231 				 */
1232 				new_map->start = old_map->end;
1233 			}
1234 		}
1235 	}
1236 
1237 	while (!list_empty(&merged)) {
1238 		old_map = list_entry(merged.next, struct map, node);
1239 		list_del_init(&old_map->node);
1240 		maps__insert(kmaps, old_map);
1241 		map__put(old_map);
1242 	}
1243 
1244 	if (new_map) {
1245 		maps__insert(kmaps, new_map);
1246 		map__put(new_map);
1247 	}
1248 	return 0;
1249 }
1250 
1251 static int dso__load_kcore(struct dso *dso, struct map *map,
1252 			   const char *kallsyms_filename)
1253 {
1254 	struct maps *kmaps = map__kmaps(map);
1255 	struct kcore_mapfn_data md;
1256 	struct map *old_map, *new_map, *replacement_map = NULL, *next;
1257 	struct machine *machine;
1258 	bool is_64_bit;
1259 	int err, fd;
1260 	char kcore_filename[PATH_MAX];
1261 	u64 stext;
1262 
1263 	if (!kmaps)
1264 		return -EINVAL;
1265 
1266 	machine = kmaps->machine;
1267 
1268 	/* This function requires that the map is the kernel map */
1269 	if (!__map__is_kernel(map))
1270 		return -EINVAL;
1271 
1272 	if (!filename_from_kallsyms_filename(kcore_filename, "kcore",
1273 					     kallsyms_filename))
1274 		return -EINVAL;
1275 
1276 	/* Modules and kernel must be present at their original addresses */
1277 	if (validate_kcore_addresses(kallsyms_filename, map))
1278 		return -EINVAL;
1279 
1280 	md.dso = dso;
1281 	INIT_LIST_HEAD(&md.maps);
1282 
1283 	fd = open(kcore_filename, O_RDONLY);
1284 	if (fd < 0) {
1285 		pr_debug("Failed to open %s. Note /proc/kcore requires CAP_SYS_RAWIO capability to access.\n",
1286 			 kcore_filename);
1287 		return -EINVAL;
1288 	}
1289 
1290 	/* Read new maps into temporary lists */
1291 	err = file__read_maps(fd, map->prot & PROT_EXEC, kcore_mapfn, &md,
1292 			      &is_64_bit);
1293 	if (err)
1294 		goto out_err;
1295 	dso->is_64_bit = is_64_bit;
1296 
1297 	if (list_empty(&md.maps)) {
1298 		err = -EINVAL;
1299 		goto out_err;
1300 	}
1301 
1302 	/* Remove old maps */
1303 	maps__for_each_entry_safe(kmaps, old_map, next) {
1304 		/*
1305 		 * We need to preserve eBPF maps even if they are
1306 		 * covered by kcore, because we need to access
1307 		 * eBPF dso for source data.
1308 		 */
1309 		if (old_map != map && !__map__is_bpf_prog(old_map))
1310 			maps__remove(kmaps, old_map);
1311 	}
1312 	machine->trampolines_mapped = false;
1313 
1314 	/* Find the kernel map using the '_stext' symbol */
1315 	if (!kallsyms__get_function_start(kallsyms_filename, "_stext", &stext)) {
1316 		list_for_each_entry(new_map, &md.maps, node) {
1317 			if (stext >= new_map->start && stext < new_map->end) {
1318 				replacement_map = new_map;
1319 				break;
1320 			}
1321 		}
1322 	}
1323 
1324 	if (!replacement_map)
1325 		replacement_map = list_entry(md.maps.next, struct map, node);
1326 
1327 	/* Add new maps */
1328 	while (!list_empty(&md.maps)) {
1329 		new_map = list_entry(md.maps.next, struct map, node);
1330 		list_del_init(&new_map->node);
1331 		if (new_map == replacement_map) {
1332 			map->start	= new_map->start;
1333 			map->end	= new_map->end;
1334 			map->pgoff	= new_map->pgoff;
1335 			map->map_ip	= new_map->map_ip;
1336 			map->unmap_ip	= new_map->unmap_ip;
1337 			/* Ensure maps are correctly ordered */
1338 			map__get(map);
1339 			maps__remove(kmaps, map);
1340 			maps__insert(kmaps, map);
1341 			map__put(map);
1342 			map__put(new_map);
1343 		} else {
1344 			/*
1345 			 * Merge kcore map into existing maps,
1346 			 * and ensure that current maps (eBPF)
1347 			 * stay intact.
1348 			 */
1349 			if (maps__merge_in(kmaps, new_map))
1350 				goto out_err;
1351 		}
1352 	}
1353 
1354 	if (machine__is(machine, "x86_64")) {
1355 		u64 addr;
1356 
1357 		/*
1358 		 * If one of the corresponding symbols is there, assume the
1359 		 * entry trampoline maps are too.
1360 		 */
1361 		if (!kallsyms__get_function_start(kallsyms_filename,
1362 						  ENTRY_TRAMPOLINE_NAME,
1363 						  &addr))
1364 			machine->trampolines_mapped = true;
1365 	}
1366 
1367 	/*
1368 	 * Set the data type and long name so that kcore can be read via
1369 	 * dso__data_read_addr().
1370 	 */
1371 	if (dso->kernel == DSO_TYPE_GUEST_KERNEL)
1372 		dso->binary_type = DSO_BINARY_TYPE__GUEST_KCORE;
1373 	else
1374 		dso->binary_type = DSO_BINARY_TYPE__KCORE;
1375 	dso__set_long_name(dso, strdup(kcore_filename), true);
1376 
1377 	close(fd);
1378 
1379 	if (map->prot & PROT_EXEC)
1380 		pr_debug("Using %s for kernel object code\n", kcore_filename);
1381 	else
1382 		pr_debug("Using %s for kernel data\n", kcore_filename);
1383 
1384 	return 0;
1385 
1386 out_err:
1387 	while (!list_empty(&md.maps)) {
1388 		map = list_entry(md.maps.next, struct map, node);
1389 		list_del_init(&map->node);
1390 		map__put(map);
1391 	}
1392 	close(fd);
1393 	return -EINVAL;
1394 }
1395 
1396 /*
1397  * If the kernel is relocated at boot time, kallsyms won't match.  Compute the
1398  * delta based on the relocation reference symbol.
1399  */
1400 static int kallsyms__delta(struct kmap *kmap, const char *filename, u64 *delta)
1401 {
1402 	u64 addr;
1403 
1404 	if (!kmap->ref_reloc_sym || !kmap->ref_reloc_sym->name)
1405 		return 0;
1406 
1407 	if (kallsyms__get_function_start(filename, kmap->ref_reloc_sym->name, &addr))
1408 		return -1;
1409 
1410 	*delta = addr - kmap->ref_reloc_sym->addr;
1411 	return 0;
1412 }
1413 
1414 int __dso__load_kallsyms(struct dso *dso, const char *filename,
1415 			 struct map *map, bool no_kcore)
1416 {
1417 	struct kmap *kmap = map__kmap(map);
1418 	u64 delta = 0;
1419 
1420 	if (symbol__restricted_filename(filename, "/proc/kallsyms"))
1421 		return -1;
1422 
1423 	if (!kmap || !kmap->kmaps)
1424 		return -1;
1425 
1426 	if (dso__load_all_kallsyms(dso, filename) < 0)
1427 		return -1;
1428 
1429 	if (kallsyms__delta(kmap, filename, &delta))
1430 		return -1;
1431 
1432 	symbols__fixup_end(&dso->symbols);
1433 	symbols__fixup_duplicate(&dso->symbols);
1434 
1435 	if (dso->kernel == DSO_TYPE_GUEST_KERNEL)
1436 		dso->symtab_type = DSO_BINARY_TYPE__GUEST_KALLSYMS;
1437 	else
1438 		dso->symtab_type = DSO_BINARY_TYPE__KALLSYMS;
1439 
1440 	if (!no_kcore && !dso__load_kcore(dso, map, filename))
1441 		return maps__split_kallsyms_for_kcore(kmap->kmaps, dso);
1442 	else
1443 		return maps__split_kallsyms(kmap->kmaps, dso, delta, map);
1444 }
1445 
1446 int dso__load_kallsyms(struct dso *dso, const char *filename,
1447 		       struct map *map)
1448 {
1449 	return __dso__load_kallsyms(dso, filename, map, false);
1450 }
1451 
1452 static int dso__load_perf_map(const char *map_path, struct dso *dso)
1453 {
1454 	char *line = NULL;
1455 	size_t n;
1456 	FILE *file;
1457 	int nr_syms = 0;
1458 
1459 	file = fopen(map_path, "r");
1460 	if (file == NULL)
1461 		goto out_failure;
1462 
1463 	while (!feof(file)) {
1464 		u64 start, size;
1465 		struct symbol *sym;
1466 		int line_len, len;
1467 
1468 		line_len = getline(&line, &n, file);
1469 		if (line_len < 0)
1470 			break;
1471 
1472 		if (!line)
1473 			goto out_failure;
1474 
1475 		line[--line_len] = '\0'; /* \n */
1476 
1477 		len = hex2u64(line, &start);
1478 
1479 		len++;
1480 		if (len + 2 >= line_len)
1481 			continue;
1482 
1483 		len += hex2u64(line + len, &size);
1484 
1485 		len++;
1486 		if (len + 2 >= line_len)
1487 			continue;
1488 
1489 		sym = symbol__new(start, size, STB_GLOBAL, STT_FUNC, line + len);
1490 
1491 		if (sym == NULL)
1492 			goto out_delete_line;
1493 
1494 		symbols__insert(&dso->symbols, sym);
1495 		nr_syms++;
1496 	}
1497 
1498 	free(line);
1499 	fclose(file);
1500 
1501 	return nr_syms;
1502 
1503 out_delete_line:
1504 	free(line);
1505 out_failure:
1506 	return -1;
1507 }
1508 
1509 static bool dso__is_compatible_symtab_type(struct dso *dso, bool kmod,
1510 					   enum dso_binary_type type)
1511 {
1512 	switch (type) {
1513 	case DSO_BINARY_TYPE__JAVA_JIT:
1514 	case DSO_BINARY_TYPE__DEBUGLINK:
1515 	case DSO_BINARY_TYPE__SYSTEM_PATH_DSO:
1516 	case DSO_BINARY_TYPE__FEDORA_DEBUGINFO:
1517 	case DSO_BINARY_TYPE__UBUNTU_DEBUGINFO:
1518 	case DSO_BINARY_TYPE__BUILDID_DEBUGINFO:
1519 	case DSO_BINARY_TYPE__OPENEMBEDDED_DEBUGINFO:
1520 		return !kmod && dso->kernel == DSO_TYPE_USER;
1521 
1522 	case DSO_BINARY_TYPE__KALLSYMS:
1523 	case DSO_BINARY_TYPE__VMLINUX:
1524 	case DSO_BINARY_TYPE__KCORE:
1525 		return dso->kernel == DSO_TYPE_KERNEL;
1526 
1527 	case DSO_BINARY_TYPE__GUEST_KALLSYMS:
1528 	case DSO_BINARY_TYPE__GUEST_VMLINUX:
1529 	case DSO_BINARY_TYPE__GUEST_KCORE:
1530 		return dso->kernel == DSO_TYPE_GUEST_KERNEL;
1531 
1532 	case DSO_BINARY_TYPE__GUEST_KMODULE:
1533 	case DSO_BINARY_TYPE__GUEST_KMODULE_COMP:
1534 	case DSO_BINARY_TYPE__SYSTEM_PATH_KMODULE:
1535 	case DSO_BINARY_TYPE__SYSTEM_PATH_KMODULE_COMP:
1536 		/*
1537 		 * kernel modules know their symtab type - it's set when
1538 		 * creating a module dso in machine__addnew_module_map().
1539 		 */
1540 		return kmod && dso->symtab_type == type;
1541 
1542 	case DSO_BINARY_TYPE__BUILD_ID_CACHE:
1543 	case DSO_BINARY_TYPE__BUILD_ID_CACHE_DEBUGINFO:
1544 		return true;
1545 
1546 	case DSO_BINARY_TYPE__BPF_PROG_INFO:
1547 	case DSO_BINARY_TYPE__NOT_FOUND:
1548 	default:
1549 		return false;
1550 	}
1551 }
1552 
1553 /* Checks for the existence of the perf-<pid>.map file in two different
1554  * locations.  First, if the process is a separate mount namespace, check in
1555  * that namespace using the pid of the innermost pid namespace.  If's not in a
1556  * namespace, or the file can't be found there, try in the mount namespace of
1557  * the tracing process using our view of its pid.
1558  */
1559 static int dso__find_perf_map(char *filebuf, size_t bufsz,
1560 			      struct nsinfo **nsip)
1561 {
1562 	struct nscookie nsc;
1563 	struct nsinfo *nsi;
1564 	struct nsinfo *nnsi;
1565 	int rc = -1;
1566 
1567 	nsi = *nsip;
1568 
1569 	if (nsi->need_setns) {
1570 		snprintf(filebuf, bufsz, "/tmp/perf-%d.map", nsi->nstgid);
1571 		nsinfo__mountns_enter(nsi, &nsc);
1572 		rc = access(filebuf, R_OK);
1573 		nsinfo__mountns_exit(&nsc);
1574 		if (rc == 0)
1575 			return rc;
1576 	}
1577 
1578 	nnsi = nsinfo__copy(nsi);
1579 	if (nnsi) {
1580 		nsinfo__put(nsi);
1581 
1582 		nnsi->need_setns = false;
1583 		snprintf(filebuf, bufsz, "/tmp/perf-%d.map", nnsi->tgid);
1584 		*nsip = nnsi;
1585 		rc = 0;
1586 	}
1587 
1588 	return rc;
1589 }
1590 
1591 int dso__load(struct dso *dso, struct map *map)
1592 {
1593 	char *name;
1594 	int ret = -1;
1595 	u_int i;
1596 	struct machine *machine = NULL;
1597 	char *root_dir = (char *) "";
1598 	int ss_pos = 0;
1599 	struct symsrc ss_[2];
1600 	struct symsrc *syms_ss = NULL, *runtime_ss = NULL;
1601 	bool kmod;
1602 	bool perfmap;
1603 	unsigned char build_id[BUILD_ID_SIZE];
1604 	struct nscookie nsc;
1605 	char newmapname[PATH_MAX];
1606 	const char *map_path = dso->long_name;
1607 
1608 	perfmap = strncmp(dso->name, "/tmp/perf-", 10) == 0;
1609 	if (perfmap) {
1610 		if (dso->nsinfo && (dso__find_perf_map(newmapname,
1611 		    sizeof(newmapname), &dso->nsinfo) == 0)) {
1612 			map_path = newmapname;
1613 		}
1614 	}
1615 
1616 	nsinfo__mountns_enter(dso->nsinfo, &nsc);
1617 	pthread_mutex_lock(&dso->lock);
1618 
1619 	/* check again under the dso->lock */
1620 	if (dso__loaded(dso)) {
1621 		ret = 1;
1622 		goto out;
1623 	}
1624 
1625 	if (dso->kernel) {
1626 		if (dso->kernel == DSO_TYPE_KERNEL)
1627 			ret = dso__load_kernel_sym(dso, map);
1628 		else if (dso->kernel == DSO_TYPE_GUEST_KERNEL)
1629 			ret = dso__load_guest_kernel_sym(dso, map);
1630 
1631 		machine = map__kmaps(map)->machine;
1632 		if (machine__is(machine, "x86_64"))
1633 			machine__map_x86_64_entry_trampolines(machine, dso);
1634 		goto out;
1635 	}
1636 
1637 	dso->adjust_symbols = 0;
1638 
1639 	if (perfmap) {
1640 		ret = dso__load_perf_map(map_path, dso);
1641 		dso->symtab_type = ret > 0 ? DSO_BINARY_TYPE__JAVA_JIT :
1642 					     DSO_BINARY_TYPE__NOT_FOUND;
1643 		goto out;
1644 	}
1645 
1646 	if (machine)
1647 		root_dir = machine->root_dir;
1648 
1649 	name = malloc(PATH_MAX);
1650 	if (!name)
1651 		goto out;
1652 
1653 	kmod = dso->symtab_type == DSO_BINARY_TYPE__SYSTEM_PATH_KMODULE ||
1654 		dso->symtab_type == DSO_BINARY_TYPE__SYSTEM_PATH_KMODULE_COMP ||
1655 		dso->symtab_type == DSO_BINARY_TYPE__GUEST_KMODULE ||
1656 		dso->symtab_type == DSO_BINARY_TYPE__GUEST_KMODULE_COMP;
1657 
1658 
1659 	/*
1660 	 * Read the build id if possible. This is required for
1661 	 * DSO_BINARY_TYPE__BUILDID_DEBUGINFO to work
1662 	 */
1663 	if (!dso->has_build_id &&
1664 	    is_regular_file(dso->long_name)) {
1665 	    __symbol__join_symfs(name, PATH_MAX, dso->long_name);
1666 	    if (filename__read_build_id(name, build_id, BUILD_ID_SIZE) > 0)
1667 		dso__set_build_id(dso, build_id);
1668 	}
1669 
1670 	/*
1671 	 * Iterate over candidate debug images.
1672 	 * Keep track of "interesting" ones (those which have a symtab, dynsym,
1673 	 * and/or opd section) for processing.
1674 	 */
1675 	for (i = 0; i < DSO_BINARY_TYPE__SYMTAB_CNT; i++) {
1676 		struct symsrc *ss = &ss_[ss_pos];
1677 		bool next_slot = false;
1678 		bool is_reg;
1679 		bool nsexit;
1680 		int sirc = -1;
1681 
1682 		enum dso_binary_type symtab_type = binary_type_symtab[i];
1683 
1684 		nsexit = (symtab_type == DSO_BINARY_TYPE__BUILD_ID_CACHE ||
1685 		    symtab_type == DSO_BINARY_TYPE__BUILD_ID_CACHE_DEBUGINFO);
1686 
1687 		if (!dso__is_compatible_symtab_type(dso, kmod, symtab_type))
1688 			continue;
1689 
1690 		if (dso__read_binary_type_filename(dso, symtab_type,
1691 						   root_dir, name, PATH_MAX))
1692 			continue;
1693 
1694 		if (nsexit)
1695 			nsinfo__mountns_exit(&nsc);
1696 
1697 		is_reg = is_regular_file(name);
1698 		if (is_reg)
1699 			sirc = symsrc__init(ss, dso, name, symtab_type);
1700 
1701 		if (nsexit)
1702 			nsinfo__mountns_enter(dso->nsinfo, &nsc);
1703 
1704 		if (!is_reg || sirc < 0)
1705 			continue;
1706 
1707 		if (!syms_ss && symsrc__has_symtab(ss)) {
1708 			syms_ss = ss;
1709 			next_slot = true;
1710 			if (!dso->symsrc_filename)
1711 				dso->symsrc_filename = strdup(name);
1712 		}
1713 
1714 		if (!runtime_ss && symsrc__possibly_runtime(ss)) {
1715 			runtime_ss = ss;
1716 			next_slot = true;
1717 		}
1718 
1719 		if (next_slot) {
1720 			ss_pos++;
1721 
1722 			if (syms_ss && runtime_ss)
1723 				break;
1724 		} else {
1725 			symsrc__destroy(ss);
1726 		}
1727 
1728 	}
1729 
1730 	if (!runtime_ss && !syms_ss)
1731 		goto out_free;
1732 
1733 	if (runtime_ss && !syms_ss) {
1734 		syms_ss = runtime_ss;
1735 	}
1736 
1737 	/* We'll have to hope for the best */
1738 	if (!runtime_ss && syms_ss)
1739 		runtime_ss = syms_ss;
1740 
1741 	if (syms_ss)
1742 		ret = dso__load_sym(dso, map, syms_ss, runtime_ss, kmod);
1743 	else
1744 		ret = -1;
1745 
1746 	if (ret > 0) {
1747 		int nr_plt;
1748 
1749 		nr_plt = dso__synthesize_plt_symbols(dso, runtime_ss);
1750 		if (nr_plt > 0)
1751 			ret += nr_plt;
1752 	}
1753 
1754 	for (; ss_pos > 0; ss_pos--)
1755 		symsrc__destroy(&ss_[ss_pos - 1]);
1756 out_free:
1757 	free(name);
1758 	if (ret < 0 && strstr(dso->name, " (deleted)") != NULL)
1759 		ret = 0;
1760 out:
1761 	dso__set_loaded(dso);
1762 	pthread_mutex_unlock(&dso->lock);
1763 	nsinfo__mountns_exit(&nsc);
1764 
1765 	return ret;
1766 }
1767 
1768 static int map__strcmp(const void *a, const void *b)
1769 {
1770 	const struct map *ma = *(const struct map **)a, *mb = *(const struct map **)b;
1771 	return strcmp(ma->dso->short_name, mb->dso->short_name);
1772 }
1773 
1774 static int map__strcmp_name(const void *name, const void *b)
1775 {
1776 	const struct map *map = *(const struct map **)b;
1777 	return strcmp(name, map->dso->short_name);
1778 }
1779 
1780 void __maps__sort_by_name(struct maps *maps)
1781 {
1782 	qsort(maps->maps_by_name, maps->nr_maps, sizeof(struct map *), map__strcmp);
1783 }
1784 
1785 static int map__groups__sort_by_name_from_rbtree(struct maps *maps)
1786 {
1787 	struct map *map;
1788 	struct map **maps_by_name = realloc(maps->maps_by_name, maps->nr_maps * sizeof(map));
1789 	int i = 0;
1790 
1791 	if (maps_by_name == NULL)
1792 		return -1;
1793 
1794 	maps->maps_by_name = maps_by_name;
1795 	maps->nr_maps_allocated = maps->nr_maps;
1796 
1797 	maps__for_each_entry(maps, map)
1798 		maps_by_name[i++] = map;
1799 
1800 	__maps__sort_by_name(maps);
1801 	return 0;
1802 }
1803 
1804 static struct map *__maps__find_by_name(struct maps *maps, const char *name)
1805 {
1806 	struct map **mapp;
1807 
1808 	if (maps->maps_by_name == NULL &&
1809 	    map__groups__sort_by_name_from_rbtree(maps))
1810 		return NULL;
1811 
1812 	mapp = bsearch(name, maps->maps_by_name, maps->nr_maps, sizeof(*mapp), map__strcmp_name);
1813 	if (mapp)
1814 		return *mapp;
1815 	return NULL;
1816 }
1817 
1818 struct map *maps__find_by_name(struct maps *maps, const char *name)
1819 {
1820 	struct map *map;
1821 
1822 	down_read(&maps->lock);
1823 
1824 	if (maps->last_search_by_name && strcmp(maps->last_search_by_name->dso->short_name, name) == 0) {
1825 		map = maps->last_search_by_name;
1826 		goto out_unlock;
1827 	}
1828 	/*
1829 	 * If we have maps->maps_by_name, then the name isn't in the rbtree,
1830 	 * as maps->maps_by_name mirrors the rbtree when lookups by name are
1831 	 * made.
1832 	 */
1833 	map = __maps__find_by_name(maps, name);
1834 	if (map || maps->maps_by_name != NULL)
1835 		goto out_unlock;
1836 
1837 	/* Fallback to traversing the rbtree... */
1838 	maps__for_each_entry(maps, map)
1839 		if (strcmp(map->dso->short_name, name) == 0) {
1840 			maps->last_search_by_name = map;
1841 			goto out_unlock;
1842 		}
1843 
1844 	map = NULL;
1845 
1846 out_unlock:
1847 	up_read(&maps->lock);
1848 	return map;
1849 }
1850 
1851 int dso__load_vmlinux(struct dso *dso, struct map *map,
1852 		      const char *vmlinux, bool vmlinux_allocated)
1853 {
1854 	int err = -1;
1855 	struct symsrc ss;
1856 	char symfs_vmlinux[PATH_MAX];
1857 	enum dso_binary_type symtab_type;
1858 
1859 	if (vmlinux[0] == '/')
1860 		snprintf(symfs_vmlinux, sizeof(symfs_vmlinux), "%s", vmlinux);
1861 	else
1862 		symbol__join_symfs(symfs_vmlinux, vmlinux);
1863 
1864 	if (dso->kernel == DSO_TYPE_GUEST_KERNEL)
1865 		symtab_type = DSO_BINARY_TYPE__GUEST_VMLINUX;
1866 	else
1867 		symtab_type = DSO_BINARY_TYPE__VMLINUX;
1868 
1869 	if (symsrc__init(&ss, dso, symfs_vmlinux, symtab_type))
1870 		return -1;
1871 
1872 	err = dso__load_sym(dso, map, &ss, &ss, 0);
1873 	symsrc__destroy(&ss);
1874 
1875 	if (err > 0) {
1876 		if (dso->kernel == DSO_TYPE_GUEST_KERNEL)
1877 			dso->binary_type = DSO_BINARY_TYPE__GUEST_VMLINUX;
1878 		else
1879 			dso->binary_type = DSO_BINARY_TYPE__VMLINUX;
1880 		dso__set_long_name(dso, vmlinux, vmlinux_allocated);
1881 		dso__set_loaded(dso);
1882 		pr_debug("Using %s for symbols\n", symfs_vmlinux);
1883 	}
1884 
1885 	return err;
1886 }
1887 
1888 int dso__load_vmlinux_path(struct dso *dso, struct map *map)
1889 {
1890 	int i, err = 0;
1891 	char *filename = NULL;
1892 
1893 	pr_debug("Looking at the vmlinux_path (%d entries long)\n",
1894 		 vmlinux_path__nr_entries + 1);
1895 
1896 	for (i = 0; i < vmlinux_path__nr_entries; ++i) {
1897 		err = dso__load_vmlinux(dso, map, vmlinux_path[i], false);
1898 		if (err > 0)
1899 			goto out;
1900 	}
1901 
1902 	if (!symbol_conf.ignore_vmlinux_buildid)
1903 		filename = dso__build_id_filename(dso, NULL, 0, false);
1904 	if (filename != NULL) {
1905 		err = dso__load_vmlinux(dso, map, filename, true);
1906 		if (err > 0)
1907 			goto out;
1908 		free(filename);
1909 	}
1910 out:
1911 	return err;
1912 }
1913 
1914 static bool visible_dir_filter(const char *name, struct dirent *d)
1915 {
1916 	if (d->d_type != DT_DIR)
1917 		return false;
1918 	return lsdir_no_dot_filter(name, d);
1919 }
1920 
1921 static int find_matching_kcore(struct map *map, char *dir, size_t dir_sz)
1922 {
1923 	char kallsyms_filename[PATH_MAX];
1924 	int ret = -1;
1925 	struct strlist *dirs;
1926 	struct str_node *nd;
1927 
1928 	dirs = lsdir(dir, visible_dir_filter);
1929 	if (!dirs)
1930 		return -1;
1931 
1932 	strlist__for_each_entry(nd, dirs) {
1933 		scnprintf(kallsyms_filename, sizeof(kallsyms_filename),
1934 			  "%s/%s/kallsyms", dir, nd->s);
1935 		if (!validate_kcore_addresses(kallsyms_filename, map)) {
1936 			strlcpy(dir, kallsyms_filename, dir_sz);
1937 			ret = 0;
1938 			break;
1939 		}
1940 	}
1941 
1942 	strlist__delete(dirs);
1943 
1944 	return ret;
1945 }
1946 
1947 /*
1948  * Use open(O_RDONLY) to check readability directly instead of access(R_OK)
1949  * since access(R_OK) only checks with real UID/GID but open() use effective
1950  * UID/GID and actual capabilities (e.g. /proc/kcore requires CAP_SYS_RAWIO).
1951  */
1952 static bool filename__readable(const char *file)
1953 {
1954 	int fd = open(file, O_RDONLY);
1955 	if (fd < 0)
1956 		return false;
1957 	close(fd);
1958 	return true;
1959 }
1960 
1961 static char *dso__find_kallsyms(struct dso *dso, struct map *map)
1962 {
1963 	u8 host_build_id[BUILD_ID_SIZE];
1964 	char sbuild_id[SBUILD_ID_SIZE];
1965 	bool is_host = false;
1966 	char path[PATH_MAX];
1967 
1968 	if (!dso->has_build_id) {
1969 		/*
1970 		 * Last resort, if we don't have a build-id and couldn't find
1971 		 * any vmlinux file, try the running kernel kallsyms table.
1972 		 */
1973 		goto proc_kallsyms;
1974 	}
1975 
1976 	if (sysfs__read_build_id("/sys/kernel/notes", host_build_id,
1977 				 sizeof(host_build_id)) == 0)
1978 		is_host = dso__build_id_equal(dso, host_build_id);
1979 
1980 	/* Try a fast path for /proc/kallsyms if possible */
1981 	if (is_host) {
1982 		/*
1983 		 * Do not check the build-id cache, unless we know we cannot use
1984 		 * /proc/kcore or module maps don't match to /proc/kallsyms.
1985 		 * To check readability of /proc/kcore, do not use access(R_OK)
1986 		 * since /proc/kcore requires CAP_SYS_RAWIO to read and access
1987 		 * can't check it.
1988 		 */
1989 		if (filename__readable("/proc/kcore") &&
1990 		    !validate_kcore_addresses("/proc/kallsyms", map))
1991 			goto proc_kallsyms;
1992 	}
1993 
1994 	build_id__sprintf(dso->build_id, sizeof(dso->build_id), sbuild_id);
1995 
1996 	/* Find kallsyms in build-id cache with kcore */
1997 	scnprintf(path, sizeof(path), "%s/%s/%s",
1998 		  buildid_dir, DSO__NAME_KCORE, sbuild_id);
1999 
2000 	if (!find_matching_kcore(map, path, sizeof(path)))
2001 		return strdup(path);
2002 
2003 	/* Use current /proc/kallsyms if possible */
2004 	if (is_host) {
2005 proc_kallsyms:
2006 		return strdup("/proc/kallsyms");
2007 	}
2008 
2009 	/* Finally, find a cache of kallsyms */
2010 	if (!build_id_cache__kallsyms_path(sbuild_id, path, sizeof(path))) {
2011 		pr_err("No kallsyms or vmlinux with build-id %s was found\n",
2012 		       sbuild_id);
2013 		return NULL;
2014 	}
2015 
2016 	return strdup(path);
2017 }
2018 
2019 static int dso__load_kernel_sym(struct dso *dso, struct map *map)
2020 {
2021 	int err;
2022 	const char *kallsyms_filename = NULL;
2023 	char *kallsyms_allocated_filename = NULL;
2024 	/*
2025 	 * Step 1: if the user specified a kallsyms or vmlinux filename, use
2026 	 * it and only it, reporting errors to the user if it cannot be used.
2027 	 *
2028 	 * For instance, try to analyse an ARM perf.data file _without_ a
2029 	 * build-id, or if the user specifies the wrong path to the right
2030 	 * vmlinux file, obviously we can't fallback to another vmlinux (a
2031 	 * x86_86 one, on the machine where analysis is being performed, say),
2032 	 * or worse, /proc/kallsyms.
2033 	 *
2034 	 * If the specified file _has_ a build-id and there is a build-id
2035 	 * section in the perf.data file, we will still do the expected
2036 	 * validation in dso__load_vmlinux and will bail out if they don't
2037 	 * match.
2038 	 */
2039 	if (symbol_conf.kallsyms_name != NULL) {
2040 		kallsyms_filename = symbol_conf.kallsyms_name;
2041 		goto do_kallsyms;
2042 	}
2043 
2044 	if (!symbol_conf.ignore_vmlinux && symbol_conf.vmlinux_name != NULL) {
2045 		return dso__load_vmlinux(dso, map, symbol_conf.vmlinux_name, false);
2046 	}
2047 
2048 	if (!symbol_conf.ignore_vmlinux && vmlinux_path != NULL) {
2049 		err = dso__load_vmlinux_path(dso, map);
2050 		if (err > 0)
2051 			return err;
2052 	}
2053 
2054 	/* do not try local files if a symfs was given */
2055 	if (symbol_conf.symfs[0] != 0)
2056 		return -1;
2057 
2058 	kallsyms_allocated_filename = dso__find_kallsyms(dso, map);
2059 	if (!kallsyms_allocated_filename)
2060 		return -1;
2061 
2062 	kallsyms_filename = kallsyms_allocated_filename;
2063 
2064 do_kallsyms:
2065 	err = dso__load_kallsyms(dso, kallsyms_filename, map);
2066 	if (err > 0)
2067 		pr_debug("Using %s for symbols\n", kallsyms_filename);
2068 	free(kallsyms_allocated_filename);
2069 
2070 	if (err > 0 && !dso__is_kcore(dso)) {
2071 		dso->binary_type = DSO_BINARY_TYPE__KALLSYMS;
2072 		dso__set_long_name(dso, DSO__NAME_KALLSYMS, false);
2073 		map__fixup_start(map);
2074 		map__fixup_end(map);
2075 	}
2076 
2077 	return err;
2078 }
2079 
2080 static int dso__load_guest_kernel_sym(struct dso *dso, struct map *map)
2081 {
2082 	int err;
2083 	const char *kallsyms_filename = NULL;
2084 	struct machine *machine = map__kmaps(map)->machine;
2085 	char path[PATH_MAX];
2086 
2087 	if (machine__is_default_guest(machine)) {
2088 		/*
2089 		 * if the user specified a vmlinux filename, use it and only
2090 		 * it, reporting errors to the user if it cannot be used.
2091 		 * Or use file guest_kallsyms inputted by user on commandline
2092 		 */
2093 		if (symbol_conf.default_guest_vmlinux_name != NULL) {
2094 			err = dso__load_vmlinux(dso, map,
2095 						symbol_conf.default_guest_vmlinux_name,
2096 						false);
2097 			return err;
2098 		}
2099 
2100 		kallsyms_filename = symbol_conf.default_guest_kallsyms;
2101 		if (!kallsyms_filename)
2102 			return -1;
2103 	} else {
2104 		sprintf(path, "%s/proc/kallsyms", machine->root_dir);
2105 		kallsyms_filename = path;
2106 	}
2107 
2108 	err = dso__load_kallsyms(dso, kallsyms_filename, map);
2109 	if (err > 0)
2110 		pr_debug("Using %s for symbols\n", kallsyms_filename);
2111 	if (err > 0 && !dso__is_kcore(dso)) {
2112 		dso->binary_type = DSO_BINARY_TYPE__GUEST_KALLSYMS;
2113 		dso__set_long_name(dso, machine->mmap_name, false);
2114 		map__fixup_start(map);
2115 		map__fixup_end(map);
2116 	}
2117 
2118 	return err;
2119 }
2120 
2121 static void vmlinux_path__exit(void)
2122 {
2123 	while (--vmlinux_path__nr_entries >= 0)
2124 		zfree(&vmlinux_path[vmlinux_path__nr_entries]);
2125 	vmlinux_path__nr_entries = 0;
2126 
2127 	zfree(&vmlinux_path);
2128 }
2129 
2130 static const char * const vmlinux_paths[] = {
2131 	"vmlinux",
2132 	"/boot/vmlinux"
2133 };
2134 
2135 static const char * const vmlinux_paths_upd[] = {
2136 	"/boot/vmlinux-%s",
2137 	"/usr/lib/debug/boot/vmlinux-%s",
2138 	"/lib/modules/%s/build/vmlinux",
2139 	"/usr/lib/debug/lib/modules/%s/vmlinux",
2140 	"/usr/lib/debug/boot/vmlinux-%s.debug"
2141 };
2142 
2143 static int vmlinux_path__add(const char *new_entry)
2144 {
2145 	vmlinux_path[vmlinux_path__nr_entries] = strdup(new_entry);
2146 	if (vmlinux_path[vmlinux_path__nr_entries] == NULL)
2147 		return -1;
2148 	++vmlinux_path__nr_entries;
2149 
2150 	return 0;
2151 }
2152 
2153 static int vmlinux_path__init(struct perf_env *env)
2154 {
2155 	struct utsname uts;
2156 	char bf[PATH_MAX];
2157 	char *kernel_version;
2158 	unsigned int i;
2159 
2160 	vmlinux_path = malloc(sizeof(char *) * (ARRAY_SIZE(vmlinux_paths) +
2161 			      ARRAY_SIZE(vmlinux_paths_upd)));
2162 	if (vmlinux_path == NULL)
2163 		return -1;
2164 
2165 	for (i = 0; i < ARRAY_SIZE(vmlinux_paths); i++)
2166 		if (vmlinux_path__add(vmlinux_paths[i]) < 0)
2167 			goto out_fail;
2168 
2169 	/* only try kernel version if no symfs was given */
2170 	if (symbol_conf.symfs[0] != 0)
2171 		return 0;
2172 
2173 	if (env) {
2174 		kernel_version = env->os_release;
2175 	} else {
2176 		if (uname(&uts) < 0)
2177 			goto out_fail;
2178 
2179 		kernel_version = uts.release;
2180 	}
2181 
2182 	for (i = 0; i < ARRAY_SIZE(vmlinux_paths_upd); i++) {
2183 		snprintf(bf, sizeof(bf), vmlinux_paths_upd[i], kernel_version);
2184 		if (vmlinux_path__add(bf) < 0)
2185 			goto out_fail;
2186 	}
2187 
2188 	return 0;
2189 
2190 out_fail:
2191 	vmlinux_path__exit();
2192 	return -1;
2193 }
2194 
2195 int setup_list(struct strlist **list, const char *list_str,
2196 		      const char *list_name)
2197 {
2198 	if (list_str == NULL)
2199 		return 0;
2200 
2201 	*list = strlist__new(list_str, NULL);
2202 	if (!*list) {
2203 		pr_err("problems parsing %s list\n", list_name);
2204 		return -1;
2205 	}
2206 
2207 	symbol_conf.has_filter = true;
2208 	return 0;
2209 }
2210 
2211 int setup_intlist(struct intlist **list, const char *list_str,
2212 		  const char *list_name)
2213 {
2214 	if (list_str == NULL)
2215 		return 0;
2216 
2217 	*list = intlist__new(list_str);
2218 	if (!*list) {
2219 		pr_err("problems parsing %s list\n", list_name);
2220 		return -1;
2221 	}
2222 	return 0;
2223 }
2224 
2225 static bool symbol__read_kptr_restrict(void)
2226 {
2227 	bool value = false;
2228 	FILE *fp = fopen("/proc/sys/kernel/kptr_restrict", "r");
2229 
2230 	if (fp != NULL) {
2231 		char line[8];
2232 
2233 		if (fgets(line, sizeof(line), fp) != NULL)
2234 			value = perf_cap__capable(CAP_SYSLOG) ?
2235 					(atoi(line) >= 2) :
2236 					(atoi(line) != 0);
2237 
2238 		fclose(fp);
2239 	}
2240 
2241 	/* Per kernel/kallsyms.c:
2242 	 * we also restrict when perf_event_paranoid > 1 w/o CAP_SYSLOG
2243 	 */
2244 	if (perf_event_paranoid() > 1 && !perf_cap__capable(CAP_SYSLOG))
2245 		value = true;
2246 
2247 	return value;
2248 }
2249 
2250 int symbol__annotation_init(void)
2251 {
2252 	if (symbol_conf.init_annotation)
2253 		return 0;
2254 
2255 	if (symbol_conf.initialized) {
2256 		pr_err("Annotation needs to be init before symbol__init()\n");
2257 		return -1;
2258 	}
2259 
2260 	symbol_conf.priv_size += sizeof(struct annotation);
2261 	symbol_conf.init_annotation = true;
2262 	return 0;
2263 }
2264 
2265 int symbol__init(struct perf_env *env)
2266 {
2267 	const char *symfs;
2268 
2269 	if (symbol_conf.initialized)
2270 		return 0;
2271 
2272 	symbol_conf.priv_size = PERF_ALIGN(symbol_conf.priv_size, sizeof(u64));
2273 
2274 	symbol__elf_init();
2275 
2276 	if (symbol_conf.sort_by_name)
2277 		symbol_conf.priv_size += (sizeof(struct symbol_name_rb_node) -
2278 					  sizeof(struct symbol));
2279 
2280 	if (symbol_conf.try_vmlinux_path && vmlinux_path__init(env) < 0)
2281 		return -1;
2282 
2283 	if (symbol_conf.field_sep && *symbol_conf.field_sep == '.') {
2284 		pr_err("'.' is the only non valid --field-separator argument\n");
2285 		return -1;
2286 	}
2287 
2288 	if (setup_list(&symbol_conf.dso_list,
2289 		       symbol_conf.dso_list_str, "dso") < 0)
2290 		return -1;
2291 
2292 	if (setup_list(&symbol_conf.comm_list,
2293 		       symbol_conf.comm_list_str, "comm") < 0)
2294 		goto out_free_dso_list;
2295 
2296 	if (setup_intlist(&symbol_conf.pid_list,
2297 		       symbol_conf.pid_list_str, "pid") < 0)
2298 		goto out_free_comm_list;
2299 
2300 	if (setup_intlist(&symbol_conf.tid_list,
2301 		       symbol_conf.tid_list_str, "tid") < 0)
2302 		goto out_free_pid_list;
2303 
2304 	if (setup_list(&symbol_conf.sym_list,
2305 		       symbol_conf.sym_list_str, "symbol") < 0)
2306 		goto out_free_tid_list;
2307 
2308 	if (setup_list(&symbol_conf.bt_stop_list,
2309 		       symbol_conf.bt_stop_list_str, "symbol") < 0)
2310 		goto out_free_sym_list;
2311 
2312 	/*
2313 	 * A path to symbols of "/" is identical to ""
2314 	 * reset here for simplicity.
2315 	 */
2316 	symfs = realpath(symbol_conf.symfs, NULL);
2317 	if (symfs == NULL)
2318 		symfs = symbol_conf.symfs;
2319 	if (strcmp(symfs, "/") == 0)
2320 		symbol_conf.symfs = "";
2321 	if (symfs != symbol_conf.symfs)
2322 		free((void *)symfs);
2323 
2324 	symbol_conf.kptr_restrict = symbol__read_kptr_restrict();
2325 
2326 	symbol_conf.initialized = true;
2327 	return 0;
2328 
2329 out_free_sym_list:
2330 	strlist__delete(symbol_conf.sym_list);
2331 out_free_tid_list:
2332 	intlist__delete(symbol_conf.tid_list);
2333 out_free_pid_list:
2334 	intlist__delete(symbol_conf.pid_list);
2335 out_free_comm_list:
2336 	strlist__delete(symbol_conf.comm_list);
2337 out_free_dso_list:
2338 	strlist__delete(symbol_conf.dso_list);
2339 	return -1;
2340 }
2341 
2342 void symbol__exit(void)
2343 {
2344 	if (!symbol_conf.initialized)
2345 		return;
2346 	strlist__delete(symbol_conf.bt_stop_list);
2347 	strlist__delete(symbol_conf.sym_list);
2348 	strlist__delete(symbol_conf.dso_list);
2349 	strlist__delete(symbol_conf.comm_list);
2350 	intlist__delete(symbol_conf.tid_list);
2351 	intlist__delete(symbol_conf.pid_list);
2352 	vmlinux_path__exit();
2353 	symbol_conf.sym_list = symbol_conf.dso_list = symbol_conf.comm_list = NULL;
2354 	symbol_conf.bt_stop_list = NULL;
2355 	symbol_conf.initialized = false;
2356 }
2357 
2358 int symbol__config_symfs(const struct option *opt __maybe_unused,
2359 			 const char *dir, int unset __maybe_unused)
2360 {
2361 	char *bf = NULL;
2362 	int ret;
2363 
2364 	symbol_conf.symfs = strdup(dir);
2365 	if (symbol_conf.symfs == NULL)
2366 		return -ENOMEM;
2367 
2368 	/* skip the locally configured cache if a symfs is given, and
2369 	 * config buildid dir to symfs/.debug
2370 	 */
2371 	ret = asprintf(&bf, "%s/%s", dir, ".debug");
2372 	if (ret < 0)
2373 		return -ENOMEM;
2374 
2375 	set_buildid_dir(bf);
2376 
2377 	free(bf);
2378 	return 0;
2379 }
2380 
2381 struct mem_info *mem_info__get(struct mem_info *mi)
2382 {
2383 	if (mi)
2384 		refcount_inc(&mi->refcnt);
2385 	return mi;
2386 }
2387 
2388 void mem_info__put(struct mem_info *mi)
2389 {
2390 	if (mi && refcount_dec_and_test(&mi->refcnt))
2391 		free(mi);
2392 }
2393 
2394 struct mem_info *mem_info__new(void)
2395 {
2396 	struct mem_info *mi = zalloc(sizeof(*mi));
2397 
2398 	if (mi)
2399 		refcount_set(&mi->refcnt, 1);
2400 	return mi;
2401 }
2402