1 // SPDX-License-Identifier: GPL-2.0 2 #include <inttypes.h> 3 #include <signal.h> 4 #include <stdio.h> 5 #include <stdlib.h> 6 #include <string.h> 7 #include <sys/types.h> 8 9 #include <linux/kernel.h> 10 #include <linux/string.h> 11 #include <linux/zalloc.h> 12 13 #include "util/dso.h" 14 #include "util/debug.h" 15 #include "util/callchain.h" 16 #include "util/symbol_conf.h" 17 #include "srcline.h" 18 #include "string2.h" 19 #include "symbol.h" 20 #include "subcmd/run-command.h" 21 22 bool srcline_full_filename; 23 24 static const char *dso__name(struct dso *dso) 25 { 26 const char *dso_name; 27 28 if (dso->symsrc_filename) 29 dso_name = dso->symsrc_filename; 30 else 31 dso_name = dso->long_name; 32 33 if (dso_name[0] == '[') 34 return NULL; 35 36 if (!strncmp(dso_name, "/tmp/perf-", 10)) 37 return NULL; 38 39 return dso_name; 40 } 41 42 static int inline_list__append(struct symbol *symbol, char *srcline, 43 struct inline_node *node) 44 { 45 struct inline_list *ilist; 46 47 ilist = zalloc(sizeof(*ilist)); 48 if (ilist == NULL) 49 return -1; 50 51 ilist->symbol = symbol; 52 ilist->srcline = srcline; 53 54 if (callchain_param.order == ORDER_CALLEE) 55 list_add_tail(&ilist->list, &node->val); 56 else 57 list_add(&ilist->list, &node->val); 58 59 return 0; 60 } 61 62 /* basename version that takes a const input string */ 63 static const char *gnu_basename(const char *path) 64 { 65 const char *base = strrchr(path, '/'); 66 67 return base ? base + 1 : path; 68 } 69 70 static char *srcline_from_fileline(const char *file, unsigned int line) 71 { 72 char *srcline; 73 74 if (!file) 75 return NULL; 76 77 if (!srcline_full_filename) 78 file = gnu_basename(file); 79 80 if (asprintf(&srcline, "%s:%u", file, line) < 0) 81 return NULL; 82 83 return srcline; 84 } 85 86 static struct symbol *new_inline_sym(struct dso *dso, 87 struct symbol *base_sym, 88 const char *funcname) 89 { 90 struct symbol *inline_sym; 91 char *demangled = NULL; 92 93 if (!funcname) 94 funcname = "??"; 95 96 if (dso) { 97 demangled = dso__demangle_sym(dso, 0, funcname); 98 if (demangled) 99 funcname = demangled; 100 } 101 102 if (base_sym && strcmp(funcname, base_sym->name) == 0) { 103 /* reuse the real, existing symbol */ 104 inline_sym = base_sym; 105 /* ensure that we don't alias an inlined symbol, which could 106 * lead to double frees in inline_node__delete 107 */ 108 assert(!base_sym->inlined); 109 } else { 110 /* create a fake symbol for the inline frame */ 111 inline_sym = symbol__new(base_sym ? base_sym->start : 0, 112 base_sym ? (base_sym->end - base_sym->start) : 0, 113 base_sym ? base_sym->binding : 0, 114 base_sym ? base_sym->type : 0, 115 funcname); 116 if (inline_sym) 117 inline_sym->inlined = 1; 118 } 119 120 free(demangled); 121 122 return inline_sym; 123 } 124 125 #define MAX_INLINE_NEST 1024 126 127 #ifdef HAVE_LIBBFD_SUPPORT 128 129 /* 130 * Implement addr2line using libbfd. 131 */ 132 #define PACKAGE "perf" 133 #include <bfd.h> 134 135 struct a2l_data { 136 const char *input; 137 u64 addr; 138 139 bool found; 140 const char *filename; 141 const char *funcname; 142 unsigned line; 143 144 bfd *abfd; 145 asymbol **syms; 146 }; 147 148 static int bfd_error(const char *string) 149 { 150 const char *errmsg; 151 152 errmsg = bfd_errmsg(bfd_get_error()); 153 fflush(stdout); 154 155 if (string) 156 pr_debug("%s: %s\n", string, errmsg); 157 else 158 pr_debug("%s\n", errmsg); 159 160 return -1; 161 } 162 163 static int slurp_symtab(bfd *abfd, struct a2l_data *a2l) 164 { 165 long storage; 166 long symcount; 167 asymbol **syms; 168 bfd_boolean dynamic = FALSE; 169 170 if ((bfd_get_file_flags(abfd) & HAS_SYMS) == 0) 171 return bfd_error(bfd_get_filename(abfd)); 172 173 storage = bfd_get_symtab_upper_bound(abfd); 174 if (storage == 0L) { 175 storage = bfd_get_dynamic_symtab_upper_bound(abfd); 176 dynamic = TRUE; 177 } 178 if (storage < 0L) 179 return bfd_error(bfd_get_filename(abfd)); 180 181 syms = malloc(storage); 182 if (dynamic) 183 symcount = bfd_canonicalize_dynamic_symtab(abfd, syms); 184 else 185 symcount = bfd_canonicalize_symtab(abfd, syms); 186 187 if (symcount < 0) { 188 free(syms); 189 return bfd_error(bfd_get_filename(abfd)); 190 } 191 192 a2l->syms = syms; 193 return 0; 194 } 195 196 static void find_address_in_section(bfd *abfd, asection *section, void *data) 197 { 198 bfd_vma pc, vma; 199 bfd_size_type size; 200 struct a2l_data *a2l = data; 201 flagword flags; 202 203 if (a2l->found) 204 return; 205 206 #ifdef bfd_get_section_flags 207 flags = bfd_get_section_flags(abfd, section); 208 #else 209 flags = bfd_section_flags(section); 210 #endif 211 if ((flags & SEC_ALLOC) == 0) 212 return; 213 214 pc = a2l->addr; 215 #ifdef bfd_get_section_vma 216 vma = bfd_get_section_vma(abfd, section); 217 #else 218 vma = bfd_section_vma(section); 219 #endif 220 #ifdef bfd_get_section_size 221 size = bfd_get_section_size(section); 222 #else 223 size = bfd_section_size(section); 224 #endif 225 226 if (pc < vma || pc >= vma + size) 227 return; 228 229 a2l->found = bfd_find_nearest_line(abfd, section, a2l->syms, pc - vma, 230 &a2l->filename, &a2l->funcname, 231 &a2l->line); 232 233 if (a2l->filename && !strlen(a2l->filename)) 234 a2l->filename = NULL; 235 } 236 237 static struct a2l_data *addr2line_init(const char *path) 238 { 239 bfd *abfd; 240 struct a2l_data *a2l = NULL; 241 242 abfd = bfd_openr(path, NULL); 243 if (abfd == NULL) 244 return NULL; 245 246 if (!bfd_check_format(abfd, bfd_object)) 247 goto out; 248 249 a2l = zalloc(sizeof(*a2l)); 250 if (a2l == NULL) 251 goto out; 252 253 a2l->abfd = abfd; 254 a2l->input = strdup(path); 255 if (a2l->input == NULL) 256 goto out; 257 258 if (slurp_symtab(abfd, a2l)) 259 goto out; 260 261 return a2l; 262 263 out: 264 if (a2l) { 265 zfree((char **)&a2l->input); 266 free(a2l); 267 } 268 bfd_close(abfd); 269 return NULL; 270 } 271 272 static void addr2line_cleanup(struct a2l_data *a2l) 273 { 274 if (a2l->abfd) 275 bfd_close(a2l->abfd); 276 zfree((char **)&a2l->input); 277 zfree(&a2l->syms); 278 free(a2l); 279 } 280 281 static int inline_list__append_dso_a2l(struct dso *dso, 282 struct inline_node *node, 283 struct symbol *sym) 284 { 285 struct a2l_data *a2l = dso->a2l; 286 struct symbol *inline_sym = new_inline_sym(dso, sym, a2l->funcname); 287 char *srcline = NULL; 288 289 if (a2l->filename) 290 srcline = srcline_from_fileline(a2l->filename, a2l->line); 291 292 return inline_list__append(inline_sym, srcline, node); 293 } 294 295 static int addr2line(const char *dso_name, u64 addr, 296 char **file, unsigned int *line, struct dso *dso, 297 bool unwind_inlines, struct inline_node *node, 298 struct symbol *sym) 299 { 300 int ret = 0; 301 struct a2l_data *a2l = dso->a2l; 302 303 if (!a2l) { 304 dso->a2l = addr2line_init(dso_name); 305 a2l = dso->a2l; 306 } 307 308 if (a2l == NULL) { 309 if (!symbol_conf.disable_add2line_warn) 310 pr_warning("addr2line_init failed for %s\n", dso_name); 311 return 0; 312 } 313 314 a2l->addr = addr; 315 a2l->found = false; 316 317 bfd_map_over_sections(a2l->abfd, find_address_in_section, a2l); 318 319 if (!a2l->found) 320 return 0; 321 322 if (unwind_inlines) { 323 int cnt = 0; 324 325 if (node && inline_list__append_dso_a2l(dso, node, sym)) 326 return 0; 327 328 while (bfd_find_inliner_info(a2l->abfd, &a2l->filename, 329 &a2l->funcname, &a2l->line) && 330 cnt++ < MAX_INLINE_NEST) { 331 332 if (a2l->filename && !strlen(a2l->filename)) 333 a2l->filename = NULL; 334 335 if (node != NULL) { 336 if (inline_list__append_dso_a2l(dso, node, sym)) 337 return 0; 338 // found at least one inline frame 339 ret = 1; 340 } 341 } 342 } 343 344 if (file) { 345 *file = a2l->filename ? strdup(a2l->filename) : NULL; 346 ret = *file ? 1 : 0; 347 } 348 349 if (line) 350 *line = a2l->line; 351 352 return ret; 353 } 354 355 void dso__free_a2l(struct dso *dso) 356 { 357 struct a2l_data *a2l = dso->a2l; 358 359 if (!a2l) 360 return; 361 362 addr2line_cleanup(a2l); 363 364 dso->a2l = NULL; 365 } 366 367 #else /* HAVE_LIBBFD_SUPPORT */ 368 369 struct a2l_subprocess { 370 struct child_process addr2line; 371 FILE *to_child; 372 FILE *from_child; 373 }; 374 375 static int filename_split(char *filename, unsigned int *line_nr) 376 { 377 char *sep; 378 379 sep = strchr(filename, '\n'); 380 if (sep) 381 *sep = '\0'; 382 383 if (!strcmp(filename, "??:0")) 384 return 0; 385 386 sep = strchr(filename, ':'); 387 if (sep) { 388 *sep++ = '\0'; 389 *line_nr = strtoul(sep, NULL, 0); 390 return 1; 391 } 392 393 return 0; 394 } 395 396 static void addr2line_subprocess_cleanup(struct a2l_subprocess *a2l) 397 { 398 if (a2l->addr2line.pid != -1) { 399 kill(a2l->addr2line.pid, SIGKILL); 400 finish_command(&a2l->addr2line); /* ignore result, we don't care */ 401 a2l->addr2line.pid = -1; 402 } 403 404 if (a2l->to_child != NULL) { 405 fclose(a2l->to_child); 406 a2l->to_child = NULL; 407 } 408 409 if (a2l->from_child != NULL) { 410 fclose(a2l->from_child); 411 a2l->from_child = NULL; 412 } 413 414 free(a2l); 415 } 416 417 static struct a2l_subprocess *addr2line_subprocess_init(const char *path) 418 { 419 const char *argv[] = { "addr2line", "-e", path, "-i", "-f", NULL }; 420 struct a2l_subprocess *a2l = zalloc(sizeof(*a2l)); 421 int start_command_status = 0; 422 423 if (a2l == NULL) 424 goto out; 425 426 a2l->to_child = NULL; 427 a2l->from_child = NULL; 428 429 a2l->addr2line.pid = -1; 430 a2l->addr2line.in = -1; 431 a2l->addr2line.out = -1; 432 a2l->addr2line.no_stderr = 1; 433 434 a2l->addr2line.argv = argv; 435 start_command_status = start_command(&a2l->addr2line); 436 a2l->addr2line.argv = NULL; /* it's not used after start_command; avoid dangling pointers */ 437 438 if (start_command_status != 0) { 439 pr_warning("could not start addr2line for %s: start_command return code %d\n", 440 path, 441 start_command_status); 442 goto out; 443 } 444 445 a2l->to_child = fdopen(a2l->addr2line.in, "w"); 446 if (a2l->to_child == NULL) { 447 pr_warning("could not open write-stream to addr2line of %s\n", path); 448 goto out; 449 } 450 451 a2l->from_child = fdopen(a2l->addr2line.out, "r"); 452 if (a2l->from_child == NULL) { 453 pr_warning("could not open read-stream from addr2line of %s\n", path); 454 goto out; 455 } 456 457 return a2l; 458 459 out: 460 if (a2l) 461 addr2line_subprocess_cleanup(a2l); 462 463 return NULL; 464 } 465 466 static int read_addr2line_record(struct a2l_subprocess *a2l, 467 char **function, 468 char **filename, 469 unsigned int *line_nr) 470 { 471 /* 472 * Returns: 473 * -1 ==> error 474 * 0 ==> sentinel (or other ill-formed) record read 475 * 1 ==> a genuine record read 476 */ 477 char *line = NULL; 478 size_t line_len = 0; 479 unsigned int dummy_line_nr = 0; 480 int ret = -1; 481 482 if (function != NULL) 483 zfree(function); 484 485 if (filename != NULL) 486 zfree(filename); 487 488 if (line_nr != NULL) 489 *line_nr = 0; 490 491 if (getline(&line, &line_len, a2l->from_child) < 0 || !line_len) 492 goto error; 493 494 if (function != NULL) 495 *function = strdup(strim(line)); 496 497 zfree(&line); 498 line_len = 0; 499 500 if (getline(&line, &line_len, a2l->from_child) < 0 || !line_len) 501 goto error; 502 503 if (filename_split(line, line_nr == NULL ? &dummy_line_nr : line_nr) == 0) { 504 ret = 0; 505 goto error; 506 } 507 508 if (filename != NULL) 509 *filename = strdup(line); 510 511 zfree(&line); 512 line_len = 0; 513 514 return 1; 515 516 error: 517 free(line); 518 if (function != NULL) 519 zfree(function); 520 if (filename != NULL) 521 zfree(filename); 522 return ret; 523 } 524 525 static int inline_list__append_record(struct dso *dso, 526 struct inline_node *node, 527 struct symbol *sym, 528 const char *function, 529 const char *filename, 530 unsigned int line_nr) 531 { 532 struct symbol *inline_sym = new_inline_sym(dso, sym, function); 533 534 return inline_list__append(inline_sym, srcline_from_fileline(filename, line_nr), node); 535 } 536 537 static int addr2line(const char *dso_name, u64 addr, 538 char **file, unsigned int *line_nr, 539 struct dso *dso, 540 bool unwind_inlines, 541 struct inline_node *node, 542 struct symbol *sym __maybe_unused) 543 { 544 struct a2l_subprocess *a2l = dso->a2l; 545 char *record_function = NULL; 546 char *record_filename = NULL; 547 unsigned int record_line_nr = 0; 548 int record_status = -1; 549 int ret = 0; 550 size_t inline_count = 0; 551 552 if (!a2l) { 553 if (!filename__has_section(dso_name, ".debug_line")) 554 goto out; 555 556 dso->a2l = addr2line_subprocess_init(dso_name); 557 a2l = dso->a2l; 558 } 559 560 if (a2l == NULL) { 561 if (!symbol_conf.disable_add2line_warn) 562 pr_warning("%s %s: addr2line_subprocess_init failed\n", __func__, dso_name); 563 goto out; 564 } 565 566 /* 567 * Send our request and then *deliberately* send something that can't be interpreted as 568 * a valid address to ask addr2line about (namely, ","). This causes addr2line to first 569 * write out the answer to our request, in an unbounded/unknown number of records, and 570 * then to write out the lines "??" and "??:0", so that we can detect when it has 571 * finished giving us anything useful. We have to be careful about the first record, 572 * though, because it may be genuinely unknown, in which case we'll get two sets of 573 * "??"/"??:0" lines. 574 */ 575 if (fprintf(a2l->to_child, "%016"PRIx64"\n,\n", addr) < 0 || fflush(a2l->to_child) != 0) { 576 if (!symbol_conf.disable_add2line_warn) 577 pr_warning("%s %s: could not send request\n", __func__, dso_name); 578 goto out; 579 } 580 581 switch (read_addr2line_record(a2l, &record_function, &record_filename, &record_line_nr)) { 582 case -1: 583 if (!symbol_conf.disable_add2line_warn) 584 pr_warning("%s %s: could not read first record\n", __func__, dso_name); 585 goto out; 586 case 0: 587 /* 588 * The first record was invalid, so return failure, but first read another 589 * record, since we asked a junk question and have to clear the answer out. 590 */ 591 switch (read_addr2line_record(a2l, NULL, NULL, NULL)) { 592 case -1: 593 if (!symbol_conf.disable_add2line_warn) 594 pr_warning("%s %s: could not read delimiter record\n", 595 __func__, dso_name); 596 break; 597 case 0: 598 /* As expected. */ 599 break; 600 default: 601 if (!symbol_conf.disable_add2line_warn) 602 pr_warning("%s %s: unexpected record instead of sentinel", 603 __func__, dso_name); 604 break; 605 } 606 goto out; 607 default: 608 break; 609 } 610 611 if (file) { 612 *file = strdup(record_filename); 613 ret = 1; 614 } 615 if (line_nr) 616 *line_nr = record_line_nr; 617 618 if (unwind_inlines) { 619 if (node && inline_list__append_record(dso, node, sym, 620 record_function, 621 record_filename, 622 record_line_nr)) { 623 ret = 0; 624 goto out; 625 } 626 } 627 628 /* We have to read the records even if we don't care about the inline info. */ 629 while ((record_status = read_addr2line_record(a2l, 630 &record_function, 631 &record_filename, 632 &record_line_nr)) == 1) { 633 if (unwind_inlines && node && inline_count++ < MAX_INLINE_NEST) { 634 if (inline_list__append_record(dso, node, sym, 635 record_function, 636 record_filename, 637 record_line_nr)) { 638 ret = 0; 639 goto out; 640 } 641 ret = 1; /* found at least one inline frame */ 642 } 643 } 644 645 out: 646 free(record_function); 647 free(record_filename); 648 return ret; 649 } 650 651 void dso__free_a2l(struct dso *dso) 652 { 653 struct a2l_subprocess *a2l = dso->a2l; 654 655 if (!a2l) 656 return; 657 658 addr2line_subprocess_cleanup(a2l); 659 660 dso->a2l = NULL; 661 } 662 663 #endif /* HAVE_LIBBFD_SUPPORT */ 664 665 static struct inline_node *addr2inlines(const char *dso_name, u64 addr, 666 struct dso *dso, struct symbol *sym) 667 { 668 struct inline_node *node; 669 670 node = zalloc(sizeof(*node)); 671 if (node == NULL) { 672 perror("not enough memory for the inline node"); 673 return NULL; 674 } 675 676 INIT_LIST_HEAD(&node->val); 677 node->addr = addr; 678 679 addr2line(dso_name, addr, NULL, NULL, dso, true, node, sym); 680 return node; 681 } 682 683 /* 684 * Number of addr2line failures (without success) before disabling it for that 685 * dso. 686 */ 687 #define A2L_FAIL_LIMIT 123 688 689 char *__get_srcline(struct dso *dso, u64 addr, struct symbol *sym, 690 bool show_sym, bool show_addr, bool unwind_inlines, 691 u64 ip) 692 { 693 char *file = NULL; 694 unsigned line = 0; 695 char *srcline; 696 const char *dso_name; 697 698 if (!dso->has_srcline) 699 goto out; 700 701 dso_name = dso__name(dso); 702 if (dso_name == NULL) 703 goto out; 704 705 if (!addr2line(dso_name, addr, &file, &line, dso, 706 unwind_inlines, NULL, sym)) 707 goto out; 708 709 srcline = srcline_from_fileline(file, line); 710 free(file); 711 712 if (!srcline) 713 goto out; 714 715 dso->a2l_fails = 0; 716 717 return srcline; 718 719 out: 720 if (dso->a2l_fails && ++dso->a2l_fails > A2L_FAIL_LIMIT) { 721 dso->has_srcline = 0; 722 dso__free_a2l(dso); 723 } 724 725 if (!show_addr) 726 return (show_sym && sym) ? 727 strndup(sym->name, sym->namelen) : SRCLINE_UNKNOWN; 728 729 if (sym) { 730 if (asprintf(&srcline, "%s+%" PRIu64, show_sym ? sym->name : "", 731 ip - sym->start) < 0) 732 return SRCLINE_UNKNOWN; 733 } else if (asprintf(&srcline, "%s[%" PRIx64 "]", dso->short_name, addr) < 0) 734 return SRCLINE_UNKNOWN; 735 return srcline; 736 } 737 738 /* Returns filename and fills in line number in line */ 739 char *get_srcline_split(struct dso *dso, u64 addr, unsigned *line) 740 { 741 char *file = NULL; 742 const char *dso_name; 743 744 if (!dso->has_srcline) 745 goto out; 746 747 dso_name = dso__name(dso); 748 if (dso_name == NULL) 749 goto out; 750 751 if (!addr2line(dso_name, addr, &file, line, dso, true, NULL, NULL)) 752 goto out; 753 754 dso->a2l_fails = 0; 755 return file; 756 757 out: 758 if (dso->a2l_fails && ++dso->a2l_fails > A2L_FAIL_LIMIT) { 759 dso->has_srcline = 0; 760 dso__free_a2l(dso); 761 } 762 763 return NULL; 764 } 765 766 void free_srcline(char *srcline) 767 { 768 if (srcline && strcmp(srcline, SRCLINE_UNKNOWN) != 0) 769 free(srcline); 770 } 771 772 char *get_srcline(struct dso *dso, u64 addr, struct symbol *sym, 773 bool show_sym, bool show_addr, u64 ip) 774 { 775 return __get_srcline(dso, addr, sym, show_sym, show_addr, false, ip); 776 } 777 778 struct srcline_node { 779 u64 addr; 780 char *srcline; 781 struct rb_node rb_node; 782 }; 783 784 void srcline__tree_insert(struct rb_root_cached *tree, u64 addr, char *srcline) 785 { 786 struct rb_node **p = &tree->rb_root.rb_node; 787 struct rb_node *parent = NULL; 788 struct srcline_node *i, *node; 789 bool leftmost = true; 790 791 node = zalloc(sizeof(struct srcline_node)); 792 if (!node) { 793 perror("not enough memory for the srcline node"); 794 return; 795 } 796 797 node->addr = addr; 798 node->srcline = srcline; 799 800 while (*p != NULL) { 801 parent = *p; 802 i = rb_entry(parent, struct srcline_node, rb_node); 803 if (addr < i->addr) 804 p = &(*p)->rb_left; 805 else { 806 p = &(*p)->rb_right; 807 leftmost = false; 808 } 809 } 810 rb_link_node(&node->rb_node, parent, p); 811 rb_insert_color_cached(&node->rb_node, tree, leftmost); 812 } 813 814 char *srcline__tree_find(struct rb_root_cached *tree, u64 addr) 815 { 816 struct rb_node *n = tree->rb_root.rb_node; 817 818 while (n) { 819 struct srcline_node *i = rb_entry(n, struct srcline_node, 820 rb_node); 821 822 if (addr < i->addr) 823 n = n->rb_left; 824 else if (addr > i->addr) 825 n = n->rb_right; 826 else 827 return i->srcline; 828 } 829 830 return NULL; 831 } 832 833 void srcline__tree_delete(struct rb_root_cached *tree) 834 { 835 struct srcline_node *pos; 836 struct rb_node *next = rb_first_cached(tree); 837 838 while (next) { 839 pos = rb_entry(next, struct srcline_node, rb_node); 840 next = rb_next(&pos->rb_node); 841 rb_erase_cached(&pos->rb_node, tree); 842 free_srcline(pos->srcline); 843 zfree(&pos); 844 } 845 } 846 847 struct inline_node *dso__parse_addr_inlines(struct dso *dso, u64 addr, 848 struct symbol *sym) 849 { 850 const char *dso_name; 851 852 dso_name = dso__name(dso); 853 if (dso_name == NULL) 854 return NULL; 855 856 return addr2inlines(dso_name, addr, dso, sym); 857 } 858 859 void inline_node__delete(struct inline_node *node) 860 { 861 struct inline_list *ilist, *tmp; 862 863 list_for_each_entry_safe(ilist, tmp, &node->val, list) { 864 list_del_init(&ilist->list); 865 free_srcline(ilist->srcline); 866 /* only the inlined symbols are owned by the list */ 867 if (ilist->symbol && ilist->symbol->inlined) 868 symbol__delete(ilist->symbol); 869 free(ilist); 870 } 871 872 free(node); 873 } 874 875 void inlines__tree_insert(struct rb_root_cached *tree, 876 struct inline_node *inlines) 877 { 878 struct rb_node **p = &tree->rb_root.rb_node; 879 struct rb_node *parent = NULL; 880 const u64 addr = inlines->addr; 881 struct inline_node *i; 882 bool leftmost = true; 883 884 while (*p != NULL) { 885 parent = *p; 886 i = rb_entry(parent, struct inline_node, rb_node); 887 if (addr < i->addr) 888 p = &(*p)->rb_left; 889 else { 890 p = &(*p)->rb_right; 891 leftmost = false; 892 } 893 } 894 rb_link_node(&inlines->rb_node, parent, p); 895 rb_insert_color_cached(&inlines->rb_node, tree, leftmost); 896 } 897 898 struct inline_node *inlines__tree_find(struct rb_root_cached *tree, u64 addr) 899 { 900 struct rb_node *n = tree->rb_root.rb_node; 901 902 while (n) { 903 struct inline_node *i = rb_entry(n, struct inline_node, 904 rb_node); 905 906 if (addr < i->addr) 907 n = n->rb_left; 908 else if (addr > i->addr) 909 n = n->rb_right; 910 else 911 return i; 912 } 913 914 return NULL; 915 } 916 917 void inlines__tree_delete(struct rb_root_cached *tree) 918 { 919 struct inline_node *pos; 920 struct rb_node *next = rb_first_cached(tree); 921 922 while (next) { 923 pos = rb_entry(next, struct inline_node, rb_node); 924 next = rb_next(&pos->rb_node); 925 rb_erase_cached(&pos->rb_node, tree); 926 inline_node__delete(pos); 927 } 928 } 929