xref: /openbmc/linux/tools/perf/util/map.c (revision ba61bb17)
1 // SPDX-License-Identifier: GPL-2.0
2 #include "symbol.h"
3 #include <errno.h>
4 #include <inttypes.h>
5 #include <limits.h>
6 #include <stdlib.h>
7 #include <string.h>
8 #include <stdio.h>
9 #include <unistd.h>
10 #include <uapi/linux/mman.h> /* To get things like MAP_HUGETLB even on older libc headers */
11 #include "map.h"
12 #include "thread.h"
13 #include "vdso.h"
14 #include "build-id.h"
15 #include "util.h"
16 #include "debug.h"
17 #include "machine.h"
18 #include <linux/string.h>
19 #include "srcline.h"
20 #include "namespaces.h"
21 #include "unwind.h"
22 
23 static void __maps__insert(struct maps *maps, struct map *map);
24 
25 static inline int is_anon_memory(const char *filename, u32 flags)
26 {
27 	return flags & MAP_HUGETLB ||
28 	       !strcmp(filename, "//anon") ||
29 	       !strncmp(filename, "/dev/zero", sizeof("/dev/zero") - 1) ||
30 	       !strncmp(filename, "/anon_hugepage", sizeof("/anon_hugepage") - 1);
31 }
32 
33 static inline int is_no_dso_memory(const char *filename)
34 {
35 	return !strncmp(filename, "[stack", 6) ||
36 	       !strncmp(filename, "/SYSV",5)   ||
37 	       !strcmp(filename, "[heap]");
38 }
39 
40 static inline int is_android_lib(const char *filename)
41 {
42 	return !strncmp(filename, "/data/app-lib", 13) ||
43 	       !strncmp(filename, "/system/lib", 11);
44 }
45 
46 static inline bool replace_android_lib(const char *filename, char *newfilename)
47 {
48 	const char *libname;
49 	char *app_abi;
50 	size_t app_abi_length, new_length;
51 	size_t lib_length = 0;
52 
53 	libname  = strrchr(filename, '/');
54 	if (libname)
55 		lib_length = strlen(libname);
56 
57 	app_abi = getenv("APP_ABI");
58 	if (!app_abi)
59 		return false;
60 
61 	app_abi_length = strlen(app_abi);
62 
63 	if (!strncmp(filename, "/data/app-lib", 13)) {
64 		char *apk_path;
65 
66 		if (!app_abi_length)
67 			return false;
68 
69 		new_length = 7 + app_abi_length + lib_length;
70 
71 		apk_path = getenv("APK_PATH");
72 		if (apk_path) {
73 			new_length += strlen(apk_path) + 1;
74 			if (new_length > PATH_MAX)
75 				return false;
76 			snprintf(newfilename, new_length,
77 				 "%s/libs/%s/%s", apk_path, app_abi, libname);
78 		} else {
79 			if (new_length > PATH_MAX)
80 				return false;
81 			snprintf(newfilename, new_length,
82 				 "libs/%s/%s", app_abi, libname);
83 		}
84 		return true;
85 	}
86 
87 	if (!strncmp(filename, "/system/lib/", 11)) {
88 		char *ndk, *app;
89 		const char *arch;
90 		size_t ndk_length;
91 		size_t app_length;
92 
93 		ndk = getenv("NDK_ROOT");
94 		app = getenv("APP_PLATFORM");
95 
96 		if (!(ndk && app))
97 			return false;
98 
99 		ndk_length = strlen(ndk);
100 		app_length = strlen(app);
101 
102 		if (!(ndk_length && app_length && app_abi_length))
103 			return false;
104 
105 		arch = !strncmp(app_abi, "arm", 3) ? "arm" :
106 		       !strncmp(app_abi, "mips", 4) ? "mips" :
107 		       !strncmp(app_abi, "x86", 3) ? "x86" : NULL;
108 
109 		if (!arch)
110 			return false;
111 
112 		new_length = 27 + ndk_length +
113 			     app_length + lib_length
114 			   + strlen(arch);
115 
116 		if (new_length > PATH_MAX)
117 			return false;
118 		snprintf(newfilename, new_length,
119 			"%s/platforms/%s/arch-%s/usr/lib/%s",
120 			ndk, app, arch, libname);
121 
122 		return true;
123 	}
124 	return false;
125 }
126 
127 void map__init(struct map *map, u64 start, u64 end, u64 pgoff, struct dso *dso)
128 {
129 	map->start    = start;
130 	map->end      = end;
131 	map->pgoff    = pgoff;
132 	map->reloc    = 0;
133 	map->dso      = dso__get(dso);
134 	map->map_ip   = map__map_ip;
135 	map->unmap_ip = map__unmap_ip;
136 	RB_CLEAR_NODE(&map->rb_node);
137 	map->groups   = NULL;
138 	map->erange_warned = false;
139 	refcount_set(&map->refcnt, 1);
140 }
141 
142 struct map *map__new(struct machine *machine, u64 start, u64 len,
143 		     u64 pgoff, u32 d_maj, u32 d_min, u64 ino,
144 		     u64 ino_gen, u32 prot, u32 flags, char *filename,
145 		     struct thread *thread)
146 {
147 	struct map *map = malloc(sizeof(*map));
148 	struct nsinfo *nsi = NULL;
149 	struct nsinfo *nnsi;
150 
151 	if (map != NULL) {
152 		char newfilename[PATH_MAX];
153 		struct dso *dso;
154 		int anon, no_dso, vdso, android;
155 
156 		android = is_android_lib(filename);
157 		anon = is_anon_memory(filename, flags);
158 		vdso = is_vdso_map(filename);
159 		no_dso = is_no_dso_memory(filename);
160 
161 		map->maj = d_maj;
162 		map->min = d_min;
163 		map->ino = ino;
164 		map->ino_generation = ino_gen;
165 		map->prot = prot;
166 		map->flags = flags;
167 		nsi = nsinfo__get(thread->nsinfo);
168 
169 		if ((anon || no_dso) && nsi && (prot & PROT_EXEC)) {
170 			snprintf(newfilename, sizeof(newfilename),
171 				 "/tmp/perf-%d.map", nsi->pid);
172 			filename = newfilename;
173 		}
174 
175 		if (android) {
176 			if (replace_android_lib(filename, newfilename))
177 				filename = newfilename;
178 		}
179 
180 		if (vdso) {
181 			/* The vdso maps are always on the host and not the
182 			 * container.  Ensure that we don't use setns to look
183 			 * them up.
184 			 */
185 			nnsi = nsinfo__copy(nsi);
186 			if (nnsi) {
187 				nsinfo__put(nsi);
188 				nnsi->need_setns = false;
189 				nsi = nnsi;
190 			}
191 			pgoff = 0;
192 			dso = machine__findnew_vdso(machine, thread);
193 		} else
194 			dso = machine__findnew_dso(machine, filename);
195 
196 		if (dso == NULL)
197 			goto out_delete;
198 
199 		map__init(map, start, start + len, pgoff, dso);
200 
201 		if (anon || no_dso) {
202 			map->map_ip = map->unmap_ip = identity__map_ip;
203 
204 			/*
205 			 * Set memory without DSO as loaded. All map__find_*
206 			 * functions still return NULL, and we avoid the
207 			 * unnecessary map__load warning.
208 			 */
209 			if (!(prot & PROT_EXEC))
210 				dso__set_loaded(dso);
211 		}
212 		dso->nsinfo = nsi;
213 		dso__put(dso);
214 	}
215 	return map;
216 out_delete:
217 	nsinfo__put(nsi);
218 	free(map);
219 	return NULL;
220 }
221 
222 /*
223  * Constructor variant for modules (where we know from /proc/modules where
224  * they are loaded) and for vmlinux, where only after we load all the
225  * symbols we'll know where it starts and ends.
226  */
227 struct map *map__new2(u64 start, struct dso *dso)
228 {
229 	struct map *map = calloc(1, (sizeof(*map) +
230 				     (dso->kernel ? sizeof(struct kmap) : 0)));
231 	if (map != NULL) {
232 		/*
233 		 * ->end will be filled after we load all the symbols
234 		 */
235 		map__init(map, start, 0, 0, dso);
236 	}
237 
238 	return map;
239 }
240 
241 /*
242  * Use this and __map__is_kmodule() for map instances that are in
243  * machine->kmaps, and thus have map->groups->machine all properly set, to
244  * disambiguate between the kernel and modules.
245  *
246  * When the need arises, introduce map__is_{kernel,kmodule)() that
247  * checks (map->groups != NULL && map->groups->machine != NULL &&
248  * map->dso->kernel) before calling __map__is_{kernel,kmodule}())
249  */
250 bool __map__is_kernel(const struct map *map)
251 {
252 	return machine__kernel_map(map->groups->machine) == map;
253 }
254 
255 bool __map__is_extra_kernel_map(const struct map *map)
256 {
257 	struct kmap *kmap = __map__kmap((struct map *)map);
258 
259 	return kmap && kmap->name[0];
260 }
261 
262 bool map__has_symbols(const struct map *map)
263 {
264 	return dso__has_symbols(map->dso);
265 }
266 
267 static void map__exit(struct map *map)
268 {
269 	BUG_ON(!RB_EMPTY_NODE(&map->rb_node));
270 	dso__zput(map->dso);
271 }
272 
273 void map__delete(struct map *map)
274 {
275 	map__exit(map);
276 	free(map);
277 }
278 
279 void map__put(struct map *map)
280 {
281 	if (map && refcount_dec_and_test(&map->refcnt))
282 		map__delete(map);
283 }
284 
285 void map__fixup_start(struct map *map)
286 {
287 	struct rb_root *symbols = &map->dso->symbols;
288 	struct rb_node *nd = rb_first(symbols);
289 	if (nd != NULL) {
290 		struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
291 		map->start = sym->start;
292 	}
293 }
294 
295 void map__fixup_end(struct map *map)
296 {
297 	struct rb_root *symbols = &map->dso->symbols;
298 	struct rb_node *nd = rb_last(symbols);
299 	if (nd != NULL) {
300 		struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
301 		map->end = sym->end;
302 	}
303 }
304 
305 #define DSO__DELETED "(deleted)"
306 
307 int map__load(struct map *map)
308 {
309 	const char *name = map->dso->long_name;
310 	int nr;
311 
312 	if (dso__loaded(map->dso))
313 		return 0;
314 
315 	nr = dso__load(map->dso, map);
316 	if (nr < 0) {
317 		if (map->dso->has_build_id) {
318 			char sbuild_id[SBUILD_ID_SIZE];
319 
320 			build_id__sprintf(map->dso->build_id,
321 					  sizeof(map->dso->build_id),
322 					  sbuild_id);
323 			pr_warning("%s with build id %s not found",
324 				   name, sbuild_id);
325 		} else
326 			pr_warning("Failed to open %s", name);
327 
328 		pr_warning(", continuing without symbols\n");
329 		return -1;
330 	} else if (nr == 0) {
331 #ifdef HAVE_LIBELF_SUPPORT
332 		const size_t len = strlen(name);
333 		const size_t real_len = len - sizeof(DSO__DELETED);
334 
335 		if (len > sizeof(DSO__DELETED) &&
336 		    strcmp(name + real_len + 1, DSO__DELETED) == 0) {
337 			pr_warning("%.*s was updated (is prelink enabled?). "
338 				"Restart the long running apps that use it!\n",
339 				   (int)real_len, name);
340 		} else {
341 			pr_warning("no symbols found in %s, maybe install "
342 				   "a debug package?\n", name);
343 		}
344 #endif
345 		return -1;
346 	}
347 
348 	return 0;
349 }
350 
351 struct symbol *map__find_symbol(struct map *map, u64 addr)
352 {
353 	if (map__load(map) < 0)
354 		return NULL;
355 
356 	return dso__find_symbol(map->dso, addr);
357 }
358 
359 struct symbol *map__find_symbol_by_name(struct map *map, const char *name)
360 {
361 	if (map__load(map) < 0)
362 		return NULL;
363 
364 	if (!dso__sorted_by_name(map->dso))
365 		dso__sort_by_name(map->dso);
366 
367 	return dso__find_symbol_by_name(map->dso, name);
368 }
369 
370 struct map *map__clone(struct map *from)
371 {
372 	struct map *map = memdup(from, sizeof(*map));
373 
374 	if (map != NULL) {
375 		refcount_set(&map->refcnt, 1);
376 		RB_CLEAR_NODE(&map->rb_node);
377 		dso__get(map->dso);
378 		map->groups = NULL;
379 	}
380 
381 	return map;
382 }
383 
384 int map__overlap(struct map *l, struct map *r)
385 {
386 	if (l->start > r->start) {
387 		struct map *t = l;
388 		l = r;
389 		r = t;
390 	}
391 
392 	if (l->end > r->start)
393 		return 1;
394 
395 	return 0;
396 }
397 
398 size_t map__fprintf(struct map *map, FILE *fp)
399 {
400 	return fprintf(fp, " %" PRIx64 "-%" PRIx64 " %" PRIx64 " %s\n",
401 		       map->start, map->end, map->pgoff, map->dso->name);
402 }
403 
404 size_t map__fprintf_dsoname(struct map *map, FILE *fp)
405 {
406 	const char *dsoname = "[unknown]";
407 
408 	if (map && map->dso) {
409 		if (symbol_conf.show_kernel_path && map->dso->long_name)
410 			dsoname = map->dso->long_name;
411 		else
412 			dsoname = map->dso->name;
413 	}
414 
415 	return fprintf(fp, "%s", dsoname);
416 }
417 
418 char *map__srcline(struct map *map, u64 addr, struct symbol *sym)
419 {
420 	if (map == NULL)
421 		return SRCLINE_UNKNOWN;
422 	return get_srcline(map->dso, map__rip_2objdump(map, addr), sym, true, true, addr);
423 }
424 
425 int map__fprintf_srcline(struct map *map, u64 addr, const char *prefix,
426 			 FILE *fp)
427 {
428 	int ret = 0;
429 
430 	if (map && map->dso) {
431 		char *srcline = map__srcline(map, addr, NULL);
432 		if (srcline != SRCLINE_UNKNOWN)
433 			ret = fprintf(fp, "%s%s", prefix, srcline);
434 		free_srcline(srcline);
435 	}
436 	return ret;
437 }
438 
439 /**
440  * map__rip_2objdump - convert symbol start address to objdump address.
441  * @map: memory map
442  * @rip: symbol start address
443  *
444  * objdump wants/reports absolute IPs for ET_EXEC, and RIPs for ET_DYN.
445  * map->dso->adjust_symbols==1 for ET_EXEC-like cases except ET_REL which is
446  * relative to section start.
447  *
448  * Return: Address suitable for passing to "objdump --start-address="
449  */
450 u64 map__rip_2objdump(struct map *map, u64 rip)
451 {
452 	struct kmap *kmap = __map__kmap(map);
453 
454 	/*
455 	 * vmlinux does not have program headers for PTI entry trampolines and
456 	 * kcore may not either. However the trampoline object code is on the
457 	 * main kernel map, so just use that instead.
458 	 */
459 	if (kmap && is_entry_trampoline(kmap->name) && kmap->kmaps && kmap->kmaps->machine) {
460 		struct map *kernel_map = machine__kernel_map(kmap->kmaps->machine);
461 
462 		if (kernel_map)
463 			map = kernel_map;
464 	}
465 
466 	if (!map->dso->adjust_symbols)
467 		return rip;
468 
469 	if (map->dso->rel)
470 		return rip - map->pgoff;
471 
472 	/*
473 	 * kernel modules also have DSO_TYPE_USER in dso->kernel,
474 	 * but all kernel modules are ET_REL, so won't get here.
475 	 */
476 	if (map->dso->kernel == DSO_TYPE_USER)
477 		return rip + map->dso->text_offset;
478 
479 	return map->unmap_ip(map, rip) - map->reloc;
480 }
481 
482 /**
483  * map__objdump_2mem - convert objdump address to a memory address.
484  * @map: memory map
485  * @ip: objdump address
486  *
487  * Closely related to map__rip_2objdump(), this function takes an address from
488  * objdump and converts it to a memory address.  Note this assumes that @map
489  * contains the address.  To be sure the result is valid, check it forwards
490  * e.g. map__rip_2objdump(map->map_ip(map, map__objdump_2mem(map, ip))) == ip
491  *
492  * Return: Memory address.
493  */
494 u64 map__objdump_2mem(struct map *map, u64 ip)
495 {
496 	if (!map->dso->adjust_symbols)
497 		return map->unmap_ip(map, ip);
498 
499 	if (map->dso->rel)
500 		return map->unmap_ip(map, ip + map->pgoff);
501 
502 	/*
503 	 * kernel modules also have DSO_TYPE_USER in dso->kernel,
504 	 * but all kernel modules are ET_REL, so won't get here.
505 	 */
506 	if (map->dso->kernel == DSO_TYPE_USER)
507 		return map->unmap_ip(map, ip - map->dso->text_offset);
508 
509 	return ip + map->reloc;
510 }
511 
512 static void maps__init(struct maps *maps)
513 {
514 	maps->entries = RB_ROOT;
515 	init_rwsem(&maps->lock);
516 }
517 
518 void map_groups__init(struct map_groups *mg, struct machine *machine)
519 {
520 	maps__init(&mg->maps);
521 	mg->machine = machine;
522 	refcount_set(&mg->refcnt, 1);
523 }
524 
525 static void __maps__purge(struct maps *maps)
526 {
527 	struct rb_root *root = &maps->entries;
528 	struct rb_node *next = rb_first(root);
529 
530 	while (next) {
531 		struct map *pos = rb_entry(next, struct map, rb_node);
532 
533 		next = rb_next(&pos->rb_node);
534 		rb_erase_init(&pos->rb_node, root);
535 		map__put(pos);
536 	}
537 }
538 
539 static void maps__exit(struct maps *maps)
540 {
541 	down_write(&maps->lock);
542 	__maps__purge(maps);
543 	up_write(&maps->lock);
544 }
545 
546 void map_groups__exit(struct map_groups *mg)
547 {
548 	maps__exit(&mg->maps);
549 }
550 
551 bool map_groups__empty(struct map_groups *mg)
552 {
553 	return !maps__first(&mg->maps);
554 }
555 
556 struct map_groups *map_groups__new(struct machine *machine)
557 {
558 	struct map_groups *mg = malloc(sizeof(*mg));
559 
560 	if (mg != NULL)
561 		map_groups__init(mg, machine);
562 
563 	return mg;
564 }
565 
566 void map_groups__delete(struct map_groups *mg)
567 {
568 	map_groups__exit(mg);
569 	free(mg);
570 }
571 
572 void map_groups__put(struct map_groups *mg)
573 {
574 	if (mg && refcount_dec_and_test(&mg->refcnt))
575 		map_groups__delete(mg);
576 }
577 
578 struct symbol *map_groups__find_symbol(struct map_groups *mg,
579 				       u64 addr, struct map **mapp)
580 {
581 	struct map *map = map_groups__find(mg, addr);
582 
583 	/* Ensure map is loaded before using map->map_ip */
584 	if (map != NULL && map__load(map) >= 0) {
585 		if (mapp != NULL)
586 			*mapp = map;
587 		return map__find_symbol(map, map->map_ip(map, addr));
588 	}
589 
590 	return NULL;
591 }
592 
593 struct symbol *maps__find_symbol_by_name(struct maps *maps, const char *name,
594 					 struct map **mapp)
595 {
596 	struct symbol *sym;
597 	struct rb_node *nd;
598 
599 	down_read(&maps->lock);
600 
601 	for (nd = rb_first(&maps->entries); nd; nd = rb_next(nd)) {
602 		struct map *pos = rb_entry(nd, struct map, rb_node);
603 
604 		sym = map__find_symbol_by_name(pos, name);
605 
606 		if (sym == NULL)
607 			continue;
608 		if (mapp != NULL)
609 			*mapp = pos;
610 		goto out;
611 	}
612 
613 	sym = NULL;
614 out:
615 	up_read(&maps->lock);
616 	return sym;
617 }
618 
619 struct symbol *map_groups__find_symbol_by_name(struct map_groups *mg,
620 					       const char *name,
621 					       struct map **mapp)
622 {
623 	return maps__find_symbol_by_name(&mg->maps, name, mapp);
624 }
625 
626 int map_groups__find_ams(struct addr_map_symbol *ams)
627 {
628 	if (ams->addr < ams->map->start || ams->addr >= ams->map->end) {
629 		if (ams->map->groups == NULL)
630 			return -1;
631 		ams->map = map_groups__find(ams->map->groups, ams->addr);
632 		if (ams->map == NULL)
633 			return -1;
634 	}
635 
636 	ams->al_addr = ams->map->map_ip(ams->map, ams->addr);
637 	ams->sym = map__find_symbol(ams->map, ams->al_addr);
638 
639 	return ams->sym ? 0 : -1;
640 }
641 
642 static size_t maps__fprintf(struct maps *maps, FILE *fp)
643 {
644 	size_t printed = 0;
645 	struct rb_node *nd;
646 
647 	down_read(&maps->lock);
648 
649 	for (nd = rb_first(&maps->entries); nd; nd = rb_next(nd)) {
650 		struct map *pos = rb_entry(nd, struct map, rb_node);
651 		printed += fprintf(fp, "Map:");
652 		printed += map__fprintf(pos, fp);
653 		if (verbose > 2) {
654 			printed += dso__fprintf(pos->dso, fp);
655 			printed += fprintf(fp, "--\n");
656 		}
657 	}
658 
659 	up_read(&maps->lock);
660 
661 	return printed;
662 }
663 
664 size_t map_groups__fprintf(struct map_groups *mg, FILE *fp)
665 {
666 	return maps__fprintf(&mg->maps, fp);
667 }
668 
669 static void __map_groups__insert(struct map_groups *mg, struct map *map)
670 {
671 	__maps__insert(&mg->maps, map);
672 	map->groups = mg;
673 }
674 
675 static int maps__fixup_overlappings(struct maps *maps, struct map *map, FILE *fp)
676 {
677 	struct rb_root *root;
678 	struct rb_node *next;
679 	int err = 0;
680 
681 	down_write(&maps->lock);
682 
683 	root = &maps->entries;
684 	next = rb_first(root);
685 
686 	while (next) {
687 		struct map *pos = rb_entry(next, struct map, rb_node);
688 		next = rb_next(&pos->rb_node);
689 
690 		if (!map__overlap(pos, map))
691 			continue;
692 
693 		if (verbose >= 2) {
694 
695 			if (use_browser) {
696 				pr_warning("overlapping maps in %s "
697 					   "(disable tui for more info)\n",
698 					   map->dso->name);
699 			} else {
700 				fputs("overlapping maps:\n", fp);
701 				map__fprintf(map, fp);
702 				map__fprintf(pos, fp);
703 			}
704 		}
705 
706 		rb_erase_init(&pos->rb_node, root);
707 		/*
708 		 * Now check if we need to create new maps for areas not
709 		 * overlapped by the new map:
710 		 */
711 		if (map->start > pos->start) {
712 			struct map *before = map__clone(pos);
713 
714 			if (before == NULL) {
715 				err = -ENOMEM;
716 				goto put_map;
717 			}
718 
719 			before->end = map->start;
720 			__map_groups__insert(pos->groups, before);
721 			if (verbose >= 2 && !use_browser)
722 				map__fprintf(before, fp);
723 			map__put(before);
724 		}
725 
726 		if (map->end < pos->end) {
727 			struct map *after = map__clone(pos);
728 
729 			if (after == NULL) {
730 				err = -ENOMEM;
731 				goto put_map;
732 			}
733 
734 			after->start = map->end;
735 			__map_groups__insert(pos->groups, after);
736 			if (verbose >= 2 && !use_browser)
737 				map__fprintf(after, fp);
738 			map__put(after);
739 		}
740 put_map:
741 		map__put(pos);
742 
743 		if (err)
744 			goto out;
745 	}
746 
747 	err = 0;
748 out:
749 	up_write(&maps->lock);
750 	return err;
751 }
752 
753 int map_groups__fixup_overlappings(struct map_groups *mg, struct map *map,
754 				   FILE *fp)
755 {
756 	return maps__fixup_overlappings(&mg->maps, map, fp);
757 }
758 
759 /*
760  * XXX This should not really _copy_ te maps, but refcount them.
761  */
762 int map_groups__clone(struct thread *thread, struct map_groups *parent)
763 {
764 	struct map_groups *mg = thread->mg;
765 	int err = -ENOMEM;
766 	struct map *map;
767 	struct maps *maps = &parent->maps;
768 
769 	down_read(&maps->lock);
770 
771 	for (map = maps__first(maps); map; map = map__next(map)) {
772 		struct map *new = map__clone(map);
773 		if (new == NULL)
774 			goto out_unlock;
775 
776 		err = unwind__prepare_access(thread, new, NULL);
777 		if (err)
778 			goto out_unlock;
779 
780 		map_groups__insert(mg, new);
781 		map__put(new);
782 	}
783 
784 	err = 0;
785 out_unlock:
786 	up_read(&maps->lock);
787 	return err;
788 }
789 
790 static void __maps__insert(struct maps *maps, struct map *map)
791 {
792 	struct rb_node **p = &maps->entries.rb_node;
793 	struct rb_node *parent = NULL;
794 	const u64 ip = map->start;
795 	struct map *m;
796 
797 	while (*p != NULL) {
798 		parent = *p;
799 		m = rb_entry(parent, struct map, rb_node);
800 		if (ip < m->start)
801 			p = &(*p)->rb_left;
802 		else
803 			p = &(*p)->rb_right;
804 	}
805 
806 	rb_link_node(&map->rb_node, parent, p);
807 	rb_insert_color(&map->rb_node, &maps->entries);
808 	map__get(map);
809 }
810 
811 void maps__insert(struct maps *maps, struct map *map)
812 {
813 	down_write(&maps->lock);
814 	__maps__insert(maps, map);
815 	up_write(&maps->lock);
816 }
817 
818 static void __maps__remove(struct maps *maps, struct map *map)
819 {
820 	rb_erase_init(&map->rb_node, &maps->entries);
821 	map__put(map);
822 }
823 
824 void maps__remove(struct maps *maps, struct map *map)
825 {
826 	down_write(&maps->lock);
827 	__maps__remove(maps, map);
828 	up_write(&maps->lock);
829 }
830 
831 struct map *maps__find(struct maps *maps, u64 ip)
832 {
833 	struct rb_node **p, *parent = NULL;
834 	struct map *m;
835 
836 	down_read(&maps->lock);
837 
838 	p = &maps->entries.rb_node;
839 	while (*p != NULL) {
840 		parent = *p;
841 		m = rb_entry(parent, struct map, rb_node);
842 		if (ip < m->start)
843 			p = &(*p)->rb_left;
844 		else if (ip >= m->end)
845 			p = &(*p)->rb_right;
846 		else
847 			goto out;
848 	}
849 
850 	m = NULL;
851 out:
852 	up_read(&maps->lock);
853 	return m;
854 }
855 
856 struct map *maps__first(struct maps *maps)
857 {
858 	struct rb_node *first = rb_first(&maps->entries);
859 
860 	if (first)
861 		return rb_entry(first, struct map, rb_node);
862 	return NULL;
863 }
864 
865 struct map *map__next(struct map *map)
866 {
867 	struct rb_node *next = rb_next(&map->rb_node);
868 
869 	if (next)
870 		return rb_entry(next, struct map, rb_node);
871 	return NULL;
872 }
873 
874 struct kmap *__map__kmap(struct map *map)
875 {
876 	if (!map->dso || !map->dso->kernel)
877 		return NULL;
878 	return (struct kmap *)(map + 1);
879 }
880 
881 struct kmap *map__kmap(struct map *map)
882 {
883 	struct kmap *kmap = __map__kmap(map);
884 
885 	if (!kmap)
886 		pr_err("Internal error: map__kmap with a non-kernel map\n");
887 	return kmap;
888 }
889 
890 struct map_groups *map__kmaps(struct map *map)
891 {
892 	struct kmap *kmap = map__kmap(map);
893 
894 	if (!kmap || !kmap->kmaps) {
895 		pr_err("Internal error: map__kmaps with a non-kernel map\n");
896 		return NULL;
897 	}
898 	return kmap->kmaps;
899 }
900