1 #include "symbol.h" 2 #include <errno.h> 3 #include <inttypes.h> 4 #include <limits.h> 5 #include <stdlib.h> 6 #include <string.h> 7 #include <stdio.h> 8 #include <unistd.h> 9 #include "map.h" 10 #include "thread.h" 11 #include "strlist.h" 12 #include "vdso.h" 13 #include "build-id.h" 14 #include "util.h" 15 #include "debug.h" 16 #include "machine.h" 17 #include <linux/string.h> 18 19 const char *map_type__name[MAP__NR_TYPES] = { 20 [MAP__FUNCTION] = "Functions", 21 [MAP__VARIABLE] = "Variables", 22 }; 23 24 static inline int is_anon_memory(const char *filename) 25 { 26 return !strcmp(filename, "//anon") || 27 !strcmp(filename, "/dev/zero (deleted)") || 28 !strcmp(filename, "/anon_hugepage (deleted)"); 29 } 30 31 static inline int is_no_dso_memory(const char *filename) 32 { 33 return !strncmp(filename, "[stack", 6) || 34 !strncmp(filename, "/SYSV",5) || 35 !strcmp(filename, "[heap]"); 36 } 37 38 static inline int is_android_lib(const char *filename) 39 { 40 return !strncmp(filename, "/data/app-lib", 13) || 41 !strncmp(filename, "/system/lib", 11); 42 } 43 44 static inline bool replace_android_lib(const char *filename, char *newfilename) 45 { 46 const char *libname; 47 char *app_abi; 48 size_t app_abi_length, new_length; 49 size_t lib_length = 0; 50 51 libname = strrchr(filename, '/'); 52 if (libname) 53 lib_length = strlen(libname); 54 55 app_abi = getenv("APP_ABI"); 56 if (!app_abi) 57 return false; 58 59 app_abi_length = strlen(app_abi); 60 61 if (!strncmp(filename, "/data/app-lib", 13)) { 62 char *apk_path; 63 64 if (!app_abi_length) 65 return false; 66 67 new_length = 7 + app_abi_length + lib_length; 68 69 apk_path = getenv("APK_PATH"); 70 if (apk_path) { 71 new_length += strlen(apk_path) + 1; 72 if (new_length > PATH_MAX) 73 return false; 74 snprintf(newfilename, new_length, 75 "%s/libs/%s/%s", apk_path, app_abi, libname); 76 } else { 77 if (new_length > PATH_MAX) 78 return false; 79 snprintf(newfilename, new_length, 80 "libs/%s/%s", app_abi, libname); 81 } 82 return true; 83 } 84 85 if (!strncmp(filename, "/system/lib/", 11)) { 86 char *ndk, *app; 87 const char *arch; 88 size_t ndk_length; 89 size_t app_length; 90 91 ndk = getenv("NDK_ROOT"); 92 app = getenv("APP_PLATFORM"); 93 94 if (!(ndk && app)) 95 return false; 96 97 ndk_length = strlen(ndk); 98 app_length = strlen(app); 99 100 if (!(ndk_length && app_length && app_abi_length)) 101 return false; 102 103 arch = !strncmp(app_abi, "arm", 3) ? "arm" : 104 !strncmp(app_abi, "mips", 4) ? "mips" : 105 !strncmp(app_abi, "x86", 3) ? "x86" : NULL; 106 107 if (!arch) 108 return false; 109 110 new_length = 27 + ndk_length + 111 app_length + lib_length 112 + strlen(arch); 113 114 if (new_length > PATH_MAX) 115 return false; 116 snprintf(newfilename, new_length, 117 "%s/platforms/%s/arch-%s/usr/lib/%s", 118 ndk, app, arch, libname); 119 120 return true; 121 } 122 return false; 123 } 124 125 void map__init(struct map *map, enum map_type type, 126 u64 start, u64 end, u64 pgoff, struct dso *dso) 127 { 128 map->type = type; 129 map->start = start; 130 map->end = end; 131 map->pgoff = pgoff; 132 map->reloc = 0; 133 map->dso = 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->referenced = false; 139 map->erange_warned = false; 140 } 141 142 struct map *map__new(struct machine *machine, u64 start, u64 len, 143 u64 pgoff, u32 pid, u32 d_maj, u32 d_min, u64 ino, 144 u64 ino_gen, u32 prot, u32 flags, char *filename, 145 enum map_type type, struct thread *thread) 146 { 147 struct map *map = malloc(sizeof(*map)); 148 149 if (map != NULL) { 150 char newfilename[PATH_MAX]; 151 struct dso *dso; 152 int anon, no_dso, vdso, android; 153 154 android = is_android_lib(filename); 155 anon = is_anon_memory(filename); 156 vdso = is_vdso_map(filename); 157 no_dso = is_no_dso_memory(filename); 158 159 map->maj = d_maj; 160 map->min = d_min; 161 map->ino = ino; 162 map->ino_generation = ino_gen; 163 map->prot = prot; 164 map->flags = flags; 165 166 if ((anon || no_dso) && type == MAP__FUNCTION) { 167 snprintf(newfilename, sizeof(newfilename), "/tmp/perf-%d.map", pid); 168 filename = newfilename; 169 } 170 171 if (android) { 172 if (replace_android_lib(filename, newfilename)) 173 filename = newfilename; 174 } 175 176 if (vdso) { 177 pgoff = 0; 178 dso = vdso__dso_findnew(machine, thread); 179 } else 180 dso = __dsos__findnew(&machine->user_dsos, filename); 181 182 if (dso == NULL) 183 goto out_delete; 184 185 map__init(map, type, start, start + len, pgoff, dso); 186 187 if (anon || no_dso) { 188 map->map_ip = map->unmap_ip = identity__map_ip; 189 190 /* 191 * Set memory without DSO as loaded. All map__find_* 192 * functions still return NULL, and we avoid the 193 * unnecessary map__load warning. 194 */ 195 if (type != MAP__FUNCTION) 196 dso__set_loaded(dso, map->type); 197 } 198 } 199 return map; 200 out_delete: 201 free(map); 202 return NULL; 203 } 204 205 /* 206 * Constructor variant for modules (where we know from /proc/modules where 207 * they are loaded) and for vmlinux, where only after we load all the 208 * symbols we'll know where it starts and ends. 209 */ 210 struct map *map__new2(u64 start, struct dso *dso, enum map_type type) 211 { 212 struct map *map = calloc(1, (sizeof(*map) + 213 (dso->kernel ? sizeof(struct kmap) : 0))); 214 if (map != NULL) { 215 /* 216 * ->end will be filled after we load all the symbols 217 */ 218 map__init(map, type, start, 0, 0, dso); 219 } 220 221 return map; 222 } 223 224 void map__delete(struct map *map) 225 { 226 free(map); 227 } 228 229 void map__fixup_start(struct map *map) 230 { 231 struct rb_root *symbols = &map->dso->symbols[map->type]; 232 struct rb_node *nd = rb_first(symbols); 233 if (nd != NULL) { 234 struct symbol *sym = rb_entry(nd, struct symbol, rb_node); 235 map->start = sym->start; 236 } 237 } 238 239 void map__fixup_end(struct map *map) 240 { 241 struct rb_root *symbols = &map->dso->symbols[map->type]; 242 struct rb_node *nd = rb_last(symbols); 243 if (nd != NULL) { 244 struct symbol *sym = rb_entry(nd, struct symbol, rb_node); 245 map->end = sym->end; 246 } 247 } 248 249 #define DSO__DELETED "(deleted)" 250 251 int map__load(struct map *map, symbol_filter_t filter) 252 { 253 const char *name = map->dso->long_name; 254 int nr; 255 256 if (dso__loaded(map->dso, map->type)) 257 return 0; 258 259 nr = dso__load(map->dso, map, filter); 260 if (nr < 0) { 261 if (map->dso->has_build_id) { 262 char sbuild_id[BUILD_ID_SIZE * 2 + 1]; 263 264 build_id__sprintf(map->dso->build_id, 265 sizeof(map->dso->build_id), 266 sbuild_id); 267 pr_warning("%s with build id %s not found", 268 name, sbuild_id); 269 } else 270 pr_warning("Failed to open %s", name); 271 272 pr_warning(", continuing without symbols\n"); 273 return -1; 274 } else if (nr == 0) { 275 #ifdef HAVE_LIBELF_SUPPORT 276 const size_t len = strlen(name); 277 const size_t real_len = len - sizeof(DSO__DELETED); 278 279 if (len > sizeof(DSO__DELETED) && 280 strcmp(name + real_len + 1, DSO__DELETED) == 0) { 281 pr_warning("%.*s was updated (is prelink enabled?). " 282 "Restart the long running apps that use it!\n", 283 (int)real_len, name); 284 } else { 285 pr_warning("no symbols found in %s, maybe install " 286 "a debug package?\n", name); 287 } 288 #endif 289 return -1; 290 } 291 292 return 0; 293 } 294 295 int __weak arch__compare_symbol_names(const char *namea, const char *nameb) 296 { 297 return strcmp(namea, nameb); 298 } 299 300 struct symbol *map__find_symbol(struct map *map, u64 addr, 301 symbol_filter_t filter) 302 { 303 if (map__load(map, filter) < 0) 304 return NULL; 305 306 return dso__find_symbol(map->dso, map->type, addr); 307 } 308 309 struct symbol *map__find_symbol_by_name(struct map *map, const char *name, 310 symbol_filter_t filter) 311 { 312 if (map__load(map, filter) < 0) 313 return NULL; 314 315 if (!dso__sorted_by_name(map->dso, map->type)) 316 dso__sort_by_name(map->dso, map->type); 317 318 return dso__find_symbol_by_name(map->dso, map->type, name); 319 } 320 321 struct map *map__clone(struct map *map) 322 { 323 return memdup(map, sizeof(*map)); 324 } 325 326 int map__overlap(struct map *l, struct map *r) 327 { 328 if (l->start > r->start) { 329 struct map *t = l; 330 l = r; 331 r = t; 332 } 333 334 if (l->end > r->start) 335 return 1; 336 337 return 0; 338 } 339 340 size_t map__fprintf(struct map *map, FILE *fp) 341 { 342 return fprintf(fp, " %" PRIx64 "-%" PRIx64 " %" PRIx64 " %s\n", 343 map->start, map->end, map->pgoff, map->dso->name); 344 } 345 346 size_t map__fprintf_dsoname(struct map *map, FILE *fp) 347 { 348 const char *dsoname = "[unknown]"; 349 350 if (map && map->dso && (map->dso->name || map->dso->long_name)) { 351 if (symbol_conf.show_kernel_path && map->dso->long_name) 352 dsoname = map->dso->long_name; 353 else if (map->dso->name) 354 dsoname = map->dso->name; 355 } 356 357 return fprintf(fp, "%s", dsoname); 358 } 359 360 int map__fprintf_srcline(struct map *map, u64 addr, const char *prefix, 361 FILE *fp) 362 { 363 char *srcline; 364 int ret = 0; 365 366 if (map && map->dso) { 367 srcline = get_srcline(map->dso, 368 map__rip_2objdump(map, addr), NULL, true); 369 if (srcline != SRCLINE_UNKNOWN) 370 ret = fprintf(fp, "%s%s", prefix, srcline); 371 free_srcline(srcline); 372 } 373 return ret; 374 } 375 376 /** 377 * map__rip_2objdump - convert symbol start address to objdump address. 378 * @map: memory map 379 * @rip: symbol start address 380 * 381 * objdump wants/reports absolute IPs for ET_EXEC, and RIPs for ET_DYN. 382 * map->dso->adjust_symbols==1 for ET_EXEC-like cases except ET_REL which is 383 * relative to section start. 384 * 385 * Return: Address suitable for passing to "objdump --start-address=" 386 */ 387 u64 map__rip_2objdump(struct map *map, u64 rip) 388 { 389 if (!map->dso->adjust_symbols) 390 return rip; 391 392 if (map->dso->rel) 393 return rip - map->pgoff; 394 395 return map->unmap_ip(map, rip) - map->reloc; 396 } 397 398 /** 399 * map__objdump_2mem - convert objdump address to a memory address. 400 * @map: memory map 401 * @ip: objdump address 402 * 403 * Closely related to map__rip_2objdump(), this function takes an address from 404 * objdump and converts it to a memory address. Note this assumes that @map 405 * contains the address. To be sure the result is valid, check it forwards 406 * e.g. map__rip_2objdump(map->map_ip(map, map__objdump_2mem(map, ip))) == ip 407 * 408 * Return: Memory address. 409 */ 410 u64 map__objdump_2mem(struct map *map, u64 ip) 411 { 412 if (!map->dso->adjust_symbols) 413 return map->unmap_ip(map, ip); 414 415 if (map->dso->rel) 416 return map->unmap_ip(map, ip + map->pgoff); 417 418 return ip + map->reloc; 419 } 420 421 void map_groups__init(struct map_groups *mg, struct machine *machine) 422 { 423 int i; 424 for (i = 0; i < MAP__NR_TYPES; ++i) { 425 mg->maps[i] = RB_ROOT; 426 INIT_LIST_HEAD(&mg->removed_maps[i]); 427 } 428 mg->machine = machine; 429 atomic_set(&mg->refcnt, 1); 430 } 431 432 static void maps__delete(struct rb_root *maps) 433 { 434 struct rb_node *next = rb_first(maps); 435 436 while (next) { 437 struct map *pos = rb_entry(next, struct map, rb_node); 438 439 next = rb_next(&pos->rb_node); 440 rb_erase(&pos->rb_node, maps); 441 map__delete(pos); 442 } 443 } 444 445 static void maps__delete_removed(struct list_head *maps) 446 { 447 struct map *pos, *n; 448 449 list_for_each_entry_safe(pos, n, maps, node) { 450 list_del(&pos->node); 451 map__delete(pos); 452 } 453 } 454 455 void map_groups__exit(struct map_groups *mg) 456 { 457 int i; 458 459 for (i = 0; i < MAP__NR_TYPES; ++i) { 460 maps__delete(&mg->maps[i]); 461 maps__delete_removed(&mg->removed_maps[i]); 462 } 463 } 464 465 bool map_groups__empty(struct map_groups *mg) 466 { 467 int i; 468 469 for (i = 0; i < MAP__NR_TYPES; ++i) { 470 if (maps__first(&mg->maps[i])) 471 return false; 472 if (!list_empty(&mg->removed_maps[i])) 473 return false; 474 } 475 476 return true; 477 } 478 479 struct map_groups *map_groups__new(struct machine *machine) 480 { 481 struct map_groups *mg = malloc(sizeof(*mg)); 482 483 if (mg != NULL) 484 map_groups__init(mg, machine); 485 486 return mg; 487 } 488 489 void map_groups__delete(struct map_groups *mg) 490 { 491 map_groups__exit(mg); 492 free(mg); 493 } 494 495 void map_groups__put(struct map_groups *mg) 496 { 497 if (mg && atomic_dec_and_test(&mg->refcnt)) 498 map_groups__delete(mg); 499 } 500 501 struct symbol *map_groups__find_symbol(struct map_groups *mg, 502 enum map_type type, u64 addr, 503 struct map **mapp, 504 symbol_filter_t filter) 505 { 506 struct map *map = map_groups__find(mg, type, addr); 507 508 /* Ensure map is loaded before using map->map_ip */ 509 if (map != NULL && map__load(map, filter) >= 0) { 510 if (mapp != NULL) 511 *mapp = map; 512 return map__find_symbol(map, map->map_ip(map, addr), filter); 513 } 514 515 return NULL; 516 } 517 518 struct symbol *map_groups__find_symbol_by_name(struct map_groups *mg, 519 enum map_type type, 520 const char *name, 521 struct map **mapp, 522 symbol_filter_t filter) 523 { 524 struct rb_node *nd; 525 526 for (nd = rb_first(&mg->maps[type]); nd; nd = rb_next(nd)) { 527 struct map *pos = rb_entry(nd, struct map, rb_node); 528 struct symbol *sym = map__find_symbol_by_name(pos, name, filter); 529 530 if (sym == NULL) 531 continue; 532 if (mapp != NULL) 533 *mapp = pos; 534 return sym; 535 } 536 537 return NULL; 538 } 539 540 int map_groups__find_ams(struct addr_map_symbol *ams, symbol_filter_t filter) 541 { 542 if (ams->addr < ams->map->start || ams->addr >= ams->map->end) { 543 if (ams->map->groups == NULL) 544 return -1; 545 ams->map = map_groups__find(ams->map->groups, ams->map->type, 546 ams->addr); 547 if (ams->map == NULL) 548 return -1; 549 } 550 551 ams->al_addr = ams->map->map_ip(ams->map, ams->addr); 552 ams->sym = map__find_symbol(ams->map, ams->al_addr, filter); 553 554 return ams->sym ? 0 : -1; 555 } 556 557 size_t __map_groups__fprintf_maps(struct map_groups *mg, enum map_type type, 558 FILE *fp) 559 { 560 size_t printed = fprintf(fp, "%s:\n", map_type__name[type]); 561 struct rb_node *nd; 562 563 for (nd = rb_first(&mg->maps[type]); nd; nd = rb_next(nd)) { 564 struct map *pos = rb_entry(nd, struct map, rb_node); 565 printed += fprintf(fp, "Map:"); 566 printed += map__fprintf(pos, fp); 567 if (verbose > 2) { 568 printed += dso__fprintf(pos->dso, type, fp); 569 printed += fprintf(fp, "--\n"); 570 } 571 } 572 573 return printed; 574 } 575 576 static size_t map_groups__fprintf_maps(struct map_groups *mg, FILE *fp) 577 { 578 size_t printed = 0, i; 579 for (i = 0; i < MAP__NR_TYPES; ++i) 580 printed += __map_groups__fprintf_maps(mg, i, fp); 581 return printed; 582 } 583 584 static size_t __map_groups__fprintf_removed_maps(struct map_groups *mg, 585 enum map_type type, FILE *fp) 586 { 587 struct map *pos; 588 size_t printed = 0; 589 590 list_for_each_entry(pos, &mg->removed_maps[type], node) { 591 printed += fprintf(fp, "Map:"); 592 printed += map__fprintf(pos, fp); 593 if (verbose > 1) { 594 printed += dso__fprintf(pos->dso, type, fp); 595 printed += fprintf(fp, "--\n"); 596 } 597 } 598 return printed; 599 } 600 601 static size_t map_groups__fprintf_removed_maps(struct map_groups *mg, 602 FILE *fp) 603 { 604 size_t printed = 0, i; 605 for (i = 0; i < MAP__NR_TYPES; ++i) 606 printed += __map_groups__fprintf_removed_maps(mg, i, fp); 607 return printed; 608 } 609 610 size_t map_groups__fprintf(struct map_groups *mg, FILE *fp) 611 { 612 size_t printed = map_groups__fprintf_maps(mg, fp); 613 printed += fprintf(fp, "Removed maps:\n"); 614 return printed + map_groups__fprintf_removed_maps(mg, fp); 615 } 616 617 int map_groups__fixup_overlappings(struct map_groups *mg, struct map *map, 618 FILE *fp) 619 { 620 struct rb_root *root = &mg->maps[map->type]; 621 struct rb_node *next = rb_first(root); 622 int err = 0; 623 624 while (next) { 625 struct map *pos = rb_entry(next, struct map, rb_node); 626 next = rb_next(&pos->rb_node); 627 628 if (!map__overlap(pos, map)) 629 continue; 630 631 if (verbose >= 2) { 632 fputs("overlapping maps:\n", fp); 633 map__fprintf(map, fp); 634 map__fprintf(pos, fp); 635 } 636 637 rb_erase(&pos->rb_node, root); 638 /* 639 * Now check if we need to create new maps for areas not 640 * overlapped by the new map: 641 */ 642 if (map->start > pos->start) { 643 struct map *before = map__clone(pos); 644 645 if (before == NULL) { 646 err = -ENOMEM; 647 goto move_map; 648 } 649 650 before->end = map->start; 651 map_groups__insert(mg, before); 652 if (verbose >= 2) 653 map__fprintf(before, fp); 654 } 655 656 if (map->end < pos->end) { 657 struct map *after = map__clone(pos); 658 659 if (after == NULL) { 660 err = -ENOMEM; 661 goto move_map; 662 } 663 664 after->start = map->end; 665 map_groups__insert(mg, after); 666 if (verbose >= 2) 667 map__fprintf(after, fp); 668 } 669 move_map: 670 /* 671 * If we have references, just move them to a separate list. 672 */ 673 if (pos->referenced) 674 list_add_tail(&pos->node, &mg->removed_maps[map->type]); 675 else 676 map__delete(pos); 677 678 if (err) 679 return err; 680 } 681 682 return 0; 683 } 684 685 /* 686 * XXX This should not really _copy_ te maps, but refcount them. 687 */ 688 int map_groups__clone(struct map_groups *mg, 689 struct map_groups *parent, enum map_type type) 690 { 691 struct rb_node *nd; 692 for (nd = rb_first(&parent->maps[type]); nd; nd = rb_next(nd)) { 693 struct map *map = rb_entry(nd, struct map, rb_node); 694 struct map *new = map__clone(map); 695 if (new == NULL) 696 return -ENOMEM; 697 map_groups__insert(mg, new); 698 } 699 return 0; 700 } 701 702 void maps__insert(struct rb_root *maps, struct map *map) 703 { 704 struct rb_node **p = &maps->rb_node; 705 struct rb_node *parent = NULL; 706 const u64 ip = map->start; 707 struct map *m; 708 709 while (*p != NULL) { 710 parent = *p; 711 m = rb_entry(parent, struct map, rb_node); 712 if (ip < m->start) 713 p = &(*p)->rb_left; 714 else 715 p = &(*p)->rb_right; 716 } 717 718 rb_link_node(&map->rb_node, parent, p); 719 rb_insert_color(&map->rb_node, maps); 720 } 721 722 void maps__remove(struct rb_root *maps, struct map *map) 723 { 724 rb_erase(&map->rb_node, maps); 725 } 726 727 struct map *maps__find(struct rb_root *maps, u64 ip) 728 { 729 struct rb_node **p = &maps->rb_node; 730 struct rb_node *parent = NULL; 731 struct map *m; 732 733 while (*p != NULL) { 734 parent = *p; 735 m = rb_entry(parent, struct map, rb_node); 736 if (ip < m->start) 737 p = &(*p)->rb_left; 738 else if (ip >= m->end) 739 p = &(*p)->rb_right; 740 else 741 return m; 742 } 743 744 return NULL; 745 } 746 747 struct map *maps__first(struct rb_root *maps) 748 { 749 struct rb_node *first = rb_first(maps); 750 751 if (first) 752 return rb_entry(first, struct map, rb_node); 753 return NULL; 754 } 755 756 struct map *map__next(struct map *map) 757 { 758 struct rb_node *next = rb_next(&map->rb_node); 759 760 if (next) 761 return rb_entry(next, struct map, rb_node); 762 return NULL; 763 } 764 765 struct kmap *map__kmap(struct map *map) 766 { 767 if (!map->dso || !map->dso->kernel) { 768 pr_err("Internal error: map__kmap with a non-kernel map\n"); 769 return NULL; 770 } 771 return (struct kmap *)(map + 1); 772 } 773 774 struct map_groups *map__kmaps(struct map *map) 775 { 776 struct kmap *kmap = map__kmap(map); 777 778 if (!kmap || !kmap->kmaps) { 779 pr_err("Internal error: map__kmaps with a non-kernel map\n"); 780 return NULL; 781 } 782 return kmap->kmaps; 783 } 784