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