Loading...
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 | // SPDX-License-Identifier: GPL-2.0 /* * User-space helper to sort the output of /sys/kernel/debug/page_owner * * Example use: * cat /sys/kernel/debug/page_owner > page_owner_full.txt * ./page_owner_sort page_owner_full.txt sorted_page_owner.txt * Or sort by total memory: * ./page_owner_sort -m page_owner_full.txt sorted_page_owner.txt * * See Documentation/mm/page_owner.rst */ #include <stdio.h> #include <stdlib.h> #include <sys/types.h> #include <sys/stat.h> #include <fcntl.h> #include <unistd.h> #include <string.h> #include <regex.h> #include <errno.h> #include <linux/types.h> #include <getopt.h> #define bool int #define true 1 #define false 0 #define TASK_COMM_LEN 16 struct block_list { char *txt; char *comm; // task command name char *stacktrace; __u64 ts_nsec; int len; int num; int page_num; pid_t pid; pid_t tgid; int allocator; }; enum FILTER_BIT { FILTER_PID = 1<<1, FILTER_TGID = 1<<2, FILTER_COMM = 1<<3 }; enum CULL_BIT { CULL_PID = 1<<1, CULL_TGID = 1<<2, CULL_COMM = 1<<3, CULL_STACKTRACE = 1<<4, CULL_ALLOCATOR = 1<<5 }; enum ALLOCATOR_BIT { ALLOCATOR_CMA = 1<<1, ALLOCATOR_SLAB = 1<<2, ALLOCATOR_VMALLOC = 1<<3, ALLOCATOR_OTHERS = 1<<4 }; enum ARG_TYPE { ARG_TXT, ARG_COMM, ARG_STACKTRACE, ARG_ALLOC_TS, ARG_CULL_TIME, ARG_PAGE_NUM, ARG_PID, ARG_TGID, ARG_UNKNOWN, ARG_ALLOCATOR }; enum SORT_ORDER { SORT_ASC = 1, SORT_DESC = -1, }; enum COMP_FLAG { COMP_NO_FLAG = 0, COMP_ALLOC = 1<<0, COMP_PAGE_NUM = 1<<1, COMP_PID = 1<<2, COMP_STACK = 1<<3, COMP_NUM = 1<<4, COMP_TGID = 1<<5, COMP_COMM = 1<<6 }; struct filter_condition { pid_t *pids; pid_t *tgids; char **comms; int pids_size; int tgids_size; int comms_size; }; struct sort_condition { int (**cmps)(const void *, const void *); int *signs; int size; }; static struct filter_condition fc; static struct sort_condition sc; static regex_t order_pattern; static regex_t pid_pattern; static regex_t tgid_pattern; static regex_t comm_pattern; static regex_t ts_nsec_pattern; static struct block_list *list; static int list_size; static int max_size; static int cull; static int filter; static bool debug_on; static void set_single_cmp(int (*cmp)(const void *, const void *), int sign); int read_block(char *buf, char *ext_buf, int buf_size, FILE *fin) { char *curr = buf, *const buf_end = buf + buf_size; while (buf_end - curr > 1 && fgets(curr, buf_end - curr, fin)) { if (*curr == '\n') { /* empty line */ return curr - buf; } if (!strncmp(curr, "PFN", 3)) { strcpy(ext_buf, curr); continue; } curr += strlen(curr); } return -1; /* EOF or no space left in buf. */ } static int compare_txt(const void *p1, const void *p2) { const struct block_list *l1 = p1, *l2 = p2; return strcmp(l1->txt, l2->txt); } static int compare_stacktrace(const void *p1, const void *p2) { const struct block_list *l1 = p1, *l2 = p2; return strcmp(l1->stacktrace, l2->stacktrace); } static int compare_num(const void *p1, const void *p2) { const struct block_list *l1 = p1, *l2 = p2; return l1->num - l2->num; } static int compare_page_num(const void *p1, const void *p2) { const struct block_list *l1 = p1, *l2 = p2; return l1->page_num - l2->page_num; } static int compare_pid(const void *p1, const void *p2) { const struct block_list *l1 = p1, *l2 = p2; return l1->pid - l2->pid; } static int compare_tgid(const void *p1, const void *p2) { const struct block_list *l1 = p1, *l2 = p2; return l1->tgid - l2->tgid; } static int compare_allocator(const void *p1, const void *p2) { const struct block_list *l1 = p1, *l2 = p2; return l1->allocator - l2->allocator; } static int compare_comm(const void *p1, const void *p2) { const struct block_list *l1 = p1, *l2 = p2; return strcmp(l1->comm, l2->comm); } static int compare_ts(const void *p1, const void *p2) { const struct block_list *l1 = p1, *l2 = p2; return l1->ts_nsec < l2->ts_nsec ? -1 : 1; } static int compare_cull_condition(const void *p1, const void *p2) { if (cull == 0) return compare_txt(p1, p2); if ((cull & CULL_STACKTRACE) && compare_stacktrace(p1, p2)) return compare_stacktrace(p1, p2); if ((cull & CULL_PID) && compare_pid(p1, p2)) return compare_pid(p1, p2); if ((cull & CULL_TGID) && compare_tgid(p1, p2)) return compare_tgid(p1, p2); if ((cull & CULL_COMM) && compare_comm(p1, p2)) return compare_comm(p1, p2); if ((cull & CULL_ALLOCATOR) && compare_allocator(p1, p2)) return compare_allocator(p1, p2); return 0; } static int compare_sort_condition(const void *p1, const void *p2) { int cmp = 0; for (int i = 0; i < sc.size; ++i) if (cmp == 0) cmp = sc.signs[i] * sc.cmps[i](p1, p2); return cmp; } static int remove_pattern(regex_t *pattern, char *buf, int len) { regmatch_t pmatch[2]; int err; err = regexec(pattern, buf, 2, pmatch, REG_NOTBOL); if (err != 0 || pmatch[1].rm_so == -1) return len; memcpy(buf + pmatch[1].rm_so, buf + pmatch[1].rm_eo, len - pmatch[1].rm_eo); return len - (pmatch[1].rm_eo - pmatch[1].rm_so); } static int search_pattern(regex_t *pattern, char *pattern_str, char *buf) { int err, val_len; regmatch_t pmatch[2]; err = regexec(pattern, buf, 2, pmatch, REG_NOTBOL); if (err != 0 || pmatch[1].rm_so == -1) { if (debug_on) fprintf(stderr, "no matching pattern in %s\n", buf); return -1; } val_len = pmatch[1].rm_eo - pmatch[1].rm_so; memcpy(pattern_str, buf + pmatch[1].rm_so, val_len); return 0; } static bool check_regcomp(regex_t *pattern, const char *regex) { int err; err = regcomp(pattern, regex, REG_EXTENDED | REG_NEWLINE); if (err != 0 || pattern->re_nsub != 1) { fprintf(stderr, "Invalid pattern %s code %d\n", regex, err); return false; } return true; } static char **explode(char sep, const char *str, int *size) { int count = 0, len = strlen(str); int lastindex = -1, j = 0; for (int i = 0; i < len; i++) if (str[i] == sep) count++; char **ret = calloc(++count, sizeof(char *)); for (int i = 0; i < len; i++) { if (str[i] == sep) { ret[j] = calloc(i - lastindex, sizeof(char)); memcpy(ret[j++], str + lastindex + 1, i - lastindex - 1); lastindex = i; } } if (lastindex <= len - 1) { ret[j] = calloc(len - lastindex, sizeof(char)); memcpy(ret[j++], str + lastindex + 1, strlen(str) - 1 - lastindex); } *size = j; return ret; } static void free_explode(char **arr, int size) { for (int i = 0; i < size; i++) free(arr[i]); free(arr); } # define FIELD_BUFF 25 static int get_page_num(char *buf) { int order_val; char order_str[FIELD_BUFF] = {0}; char *endptr; search_pattern(&order_pattern, order_str, buf); errno = 0; order_val = strtol(order_str, &endptr, 10); if (order_val > 64 || errno != 0 || endptr == order_str || *endptr != '\0') { if (debug_on) fprintf(stderr, "wrong order in follow buf:\n%s\n", buf); return 0; } return 1 << order_val; } static pid_t get_pid(char *buf) { pid_t pid; char pid_str[FIELD_BUFF] = {0}; char *endptr; search_pattern(&pid_pattern, pid_str, buf); errno = 0; pid = strtol(pid_str, &endptr, 10); if (errno != 0 || endptr == pid_str || *endptr != '\0') { if (debug_on) fprintf(stderr, "wrong/invalid pid in follow buf:\n%s\n", buf); return -1; } return pid; } static pid_t get_tgid(char *buf) { pid_t tgid; char tgid_str[FIELD_BUFF] = {0}; char *endptr; search_pattern(&tgid_pattern, tgid_str, buf); errno = 0; tgid = strtol(tgid_str, &endptr, 10); if (errno != 0 || endptr == tgid_str || *endptr != '\0') { if (debug_on) fprintf(stderr, "wrong/invalid tgid in follow buf:\n%s\n", buf); return -1; } return tgid; } static __u64 get_ts_nsec(char *buf) { __u64 ts_nsec; char ts_nsec_str[FIELD_BUFF] = {0}; char *endptr; search_pattern(&ts_nsec_pattern, ts_nsec_str, buf); errno = 0; ts_nsec = strtoull(ts_nsec_str, &endptr, 10); if (errno != 0 || endptr == ts_nsec_str || *endptr != '\0') { if (debug_on) fprintf(stderr, "wrong ts_nsec in follow buf:\n%s\n", buf); return -1; } return ts_nsec; } static char *get_comm(char *buf) { char *comm_str = malloc(TASK_COMM_LEN); memset(comm_str, 0, TASK_COMM_LEN); search_pattern(&comm_pattern, comm_str, buf); errno = 0; if (errno != 0) { if (debug_on) fprintf(stderr, "wrong comm in follow buf:\n%s\n", buf); return NULL; } return comm_str; } static int get_arg_type(const char *arg) { if (!strcmp(arg, "pid") || !strcmp(arg, "p")) return ARG_PID; else if (!strcmp(arg, "tgid") || !strcmp(arg, "tg")) return ARG_TGID; else if (!strcmp(arg, "name") || !strcmp(arg, "n")) return ARG_COMM; else if (!strcmp(arg, "stacktrace") || !strcmp(arg, "st")) return ARG_STACKTRACE; else if (!strcmp(arg, "txt") || !strcmp(arg, "T")) return ARG_TXT; else if (!strcmp(arg, "alloc_ts") || !strcmp(arg, "at")) return ARG_ALLOC_TS; else if (!strcmp(arg, "allocator") || !strcmp(arg, "ator")) return ARG_ALLOCATOR; else { return ARG_UNKNOWN; } } static int get_allocator(const char *buf, const char *migrate_info) { char *tmp, *first_line, *second_line; int allocator = 0; if (strstr(migrate_info, "CMA")) allocator |= ALLOCATOR_CMA; if (strstr(migrate_info, "slab")) allocator |= ALLOCATOR_SLAB; tmp = strstr(buf, "__vmalloc_node_range"); if (tmp) { second_line = tmp; while (*tmp != '\n') tmp--; tmp--; while (*tmp != '\n') tmp--; first_line = ++tmp; tmp = strstr(tmp, "alloc_pages"); if (tmp && first_line <= tmp && tmp < second_line) allocator |= ALLOCATOR_VMALLOC; } if (allocator == 0) allocator = ALLOCATOR_OTHERS; return allocator; } static bool match_num_list(int num, int *list, int list_size) { for (int i = 0; i < list_size; ++i) if (list[i] == num) return true; return false; } static bool match_str_list(const char *str, char **list, int list_size) { for (int i = 0; i < list_size; ++i) if (!strcmp(list[i], str)) return true; return false; } static bool is_need(char *buf) { if ((filter & FILTER_PID) && !match_num_list(get_pid(buf), fc.pids, fc.pids_size)) return false; if ((filter & FILTER_TGID) && !match_num_list(get_tgid(buf), fc.tgids, fc.tgids_size)) return false; char *comm = get_comm(buf); if ((filter & FILTER_COMM) && !match_str_list(comm, fc.comms, fc.comms_size)) { free(comm); return false; } free(comm); return true; } static bool add_list(char *buf, int len, char *ext_buf) { if (list_size == max_size) { fprintf(stderr, "max_size too small??\n"); return false; } if (!is_need(buf)) return true; list[list_size].pid = get_pid(buf); list[list_size].tgid = get_tgid(buf); list[list_size].comm = get_comm(buf); list[list_size].txt = malloc(len+1); if (!list[list_size].txt) { fprintf(stderr, "Out of memory\n"); return false; } memcpy(list[list_size].txt, buf, len); if (sc.cmps[0] != compare_ts) { len = remove_pattern(&ts_nsec_pattern, list[list_size].txt, len); } list[list_size].txt[len] = 0; list[list_size].len = len; list[list_size].num = 1; list[list_size].page_num = get_page_num(buf); list[list_size].stacktrace = strchr(list[list_size].txt, '\n') ?: ""; if (*list[list_size].stacktrace == '\n') list[list_size].stacktrace++; list[list_size].ts_nsec = get_ts_nsec(buf); list[list_size].allocator = get_allocator(buf, ext_buf); list_size++; if (list_size % 1000 == 0) { printf("loaded %d\r", list_size); fflush(stdout); } return true; } static bool parse_cull_args(const char *arg_str) { int size = 0; char **args = explode(',', arg_str, &size); for (int i = 0; i < size; ++i) { int arg_type = get_arg_type(args[i]); if (arg_type == ARG_PID) cull |= CULL_PID; else if (arg_type == ARG_TGID) cull |= CULL_TGID; else if (arg_type == ARG_COMM) cull |= CULL_COMM; else if (arg_type == ARG_STACKTRACE) cull |= CULL_STACKTRACE; else if (arg_type == ARG_ALLOCATOR) cull |= CULL_ALLOCATOR; else { free_explode(args, size); return false; } } free_explode(args, size); if (sc.size == 0) set_single_cmp(compare_num, SORT_DESC); return true; } static void set_single_cmp(int (*cmp)(const void *, const void *), int sign) { if (sc.signs == NULL || sc.size < 1) sc.signs = calloc(1, sizeof(int)); sc.signs[0] = sign; if (sc.cmps == NULL || sc.size < 1) sc.cmps = calloc(1, sizeof(int *)); sc.cmps[0] = cmp; sc.size = 1; } static bool parse_sort_args(const char *arg_str) { int size = 0; if (sc.size != 0) { /* reset sort_condition */ free(sc.signs); free(sc.cmps); size = 0; } char **args = explode(',', arg_str, &size); sc.signs = calloc(size, sizeof(int)); sc.cmps = calloc(size, sizeof(int *)); for (int i = 0; i < size; ++i) { int offset = 0; sc.signs[i] = SORT_ASC; if (args[i][0] == '-' || args[i][0] == '+') { if (args[i][0] == '-') sc.signs[i] = SORT_DESC; offset = 1; } int arg_type = get_arg_type(args[i]+offset); if (arg_type == ARG_PID) sc.cmps[i] = compare_pid; else if (arg_type == ARG_TGID) sc.cmps[i] = compare_tgid; else if (arg_type == ARG_COMM) sc.cmps[i] = compare_comm; else if (arg_type == ARG_STACKTRACE) sc.cmps[i] = compare_stacktrace; else if (arg_type == ARG_ALLOC_TS) sc.cmps[i] = compare_ts; else if (arg_type == ARG_TXT) sc.cmps[i] = compare_txt; else if (arg_type == ARG_ALLOCATOR) sc.cmps[i] = compare_allocator; else { free_explode(args, size); sc.size = 0; return false; } } sc.size = size; free_explode(args, size); return true; } static int *parse_nums_list(char *arg_str, int *list_size) { int size = 0; char **args = explode(',', arg_str, &size); int *list = calloc(size, sizeof(int)); errno = 0; for (int i = 0; i < size; ++i) { char *endptr = NULL; list[i] = strtol(args[i], &endptr, 10); if (errno != 0 || endptr == args[i] || *endptr != '\0') { free(list); return NULL; } } *list_size = size; free_explode(args, size); return list; } static void print_allocator(FILE *out, int allocator) { fprintf(out, "allocated by "); if (allocator & ALLOCATOR_CMA) fprintf(out, "CMA "); if (allocator & ALLOCATOR_SLAB) fprintf(out, "SLAB "); if (allocator & ALLOCATOR_VMALLOC) fprintf(out, "VMALLOC "); if (allocator & ALLOCATOR_OTHERS) fprintf(out, "OTHERS "); } #define BUF_SIZE (128 * 1024) static void usage(void) { printf("Usage: ./page_owner_sort [OPTIONS] <input> <output>\n" "-a\t\t\tSort by memory allocation time.\n" "-m\t\t\tSort by total memory.\n" "-n\t\t\tSort by task command name.\n" "-p\t\t\tSort by pid.\n" "-P\t\t\tSort by tgid.\n" "-s\t\t\tSort by the stacktrace.\n" "-t\t\t\tSort by number of times record is seen (default).\n\n" "--pid <pidlist>\t\tSelect by pid. This selects the information" " of\n\t\t\tblocks whose process ID numbers appear in <pidlist>.\n" "--tgid <tgidlist>\tSelect by tgid. This selects the information" " of\n\t\t\tblocks whose Thread Group ID numbers appear in " "<tgidlist>.\n" "--name <cmdlist>\tSelect by command name. This selects the" " information\n\t\t\tof blocks whose command name appears in" " <cmdlist>.\n" "--cull <rules>\t\tCull by user-defined rules. <rules> is a " "single\n\t\t\targument in the form of a comma-separated list " "with some\n\t\t\tcommon fields predefined (pid, tgid, comm, " "stacktrace, allocator)\n" "--sort <order>\t\tSpecify sort order as: [+|-]key[,[+|-]key[,...]]\n" ); } int main(int argc, char **argv) { FILE *fin, *fout; char *buf, *ext_buf; int i, count, compare_flag; struct stat st; int opt; struct option longopts[] = { { "pid", required_argument, NULL, 1 }, { "tgid", required_argument, NULL, 2 }, { "name", required_argument, NULL, 3 }, { "cull", required_argument, NULL, 4 }, { "sort", required_argument, NULL, 5 }, { 0, 0, 0, 0}, }; compare_flag = COMP_NO_FLAG; while ((opt = getopt_long(argc, argv, "admnpstP", longopts, NULL)) != -1) switch (opt) { case 'a': compare_flag |= COMP_ALLOC; break; case 'd': debug_on = true; break; case 'm': compare_flag |= COMP_PAGE_NUM; break; case 'p': compare_flag |= COMP_PID; break; case 's': compare_flag |= COMP_STACK; break; case 't': compare_flag |= COMP_NUM; break; case 'P': compare_flag |= COMP_TGID; break; case 'n': compare_flag |= COMP_COMM; break; case 1: filter = filter | FILTER_PID; fc.pids = parse_nums_list(optarg, &fc.pids_size); if (fc.pids == NULL) { fprintf(stderr, "wrong/invalid pid in from the command line:%s\n", optarg); exit(1); } break; case 2: filter = filter | FILTER_TGID; fc.tgids = parse_nums_list(optarg, &fc.tgids_size); if (fc.tgids == NULL) { fprintf(stderr, "wrong/invalid tgid in from the command line:%s\n", optarg); exit(1); } break; case 3: filter = filter | FILTER_COMM; fc.comms = explode(',', optarg, &fc.comms_size); break; case 4: if (!parse_cull_args(optarg)) { fprintf(stderr, "wrong argument after --cull option:%s\n", optarg); exit(1); } break; case 5: if (!parse_sort_args(optarg)) { fprintf(stderr, "wrong argument after --sort option:%s\n", optarg); exit(1); } break; default: usage(); exit(1); } if (optind >= (argc - 1)) { usage(); exit(1); } /* Only one compare option is allowed, yet we also want handle the * default case were no option is provided, but we still want to * match the behavior of the -t option (compare by number of times * a record is seen */ switch (compare_flag) { case COMP_ALLOC: set_single_cmp(compare_ts, SORT_ASC); break; case COMP_PAGE_NUM: set_single_cmp(compare_page_num, SORT_DESC); break; case COMP_PID: set_single_cmp(compare_pid, SORT_ASC); break; case COMP_STACK: set_single_cmp(compare_stacktrace, SORT_ASC); break; case COMP_NO_FLAG: case COMP_NUM: set_single_cmp(compare_num, SORT_DESC); break; case COMP_TGID: set_single_cmp(compare_tgid, SORT_ASC); break; case COMP_COMM: set_single_cmp(compare_comm, SORT_ASC); break; default: usage(); exit(1); } fin = fopen(argv[optind], "r"); fout = fopen(argv[optind + 1], "w"); if (!fin || !fout) { usage(); perror("open: "); exit(1); } if (!check_regcomp(&order_pattern, "order\\s*([0-9]*),")) goto out_order; if (!check_regcomp(&pid_pattern, "pid\\s*([0-9]*),")) goto out_pid; if (!check_regcomp(&tgid_pattern, "tgid\\s*([0-9]*) ")) goto out_tgid; if (!check_regcomp(&comm_pattern, "tgid\\s*[0-9]*\\s*\\((.*)\\),\\s*ts")) goto out_comm; if (!check_regcomp(&ts_nsec_pattern, "ts\\s*([0-9]*)\\s*ns")) goto out_ts; fstat(fileno(fin), &st); max_size = st.st_size / 100; /* hack ... */ list = malloc(max_size * sizeof(*list)); buf = malloc(BUF_SIZE); ext_buf = malloc(BUF_SIZE); if (!list || !buf || !ext_buf) { fprintf(stderr, "Out of memory\n"); goto out_free; } for ( ; ; ) { int buf_len = read_block(buf, ext_buf, BUF_SIZE, fin); if (buf_len < 0) break; if (!add_list(buf, buf_len, ext_buf)) goto out_free; } printf("loaded %d\n", list_size); printf("sorting ....\n"); qsort(list, list_size, sizeof(list[0]), compare_cull_condition); printf("culling\n"); for (i = count = 0; i < list_size; i++) { if (count == 0 || compare_cull_condition((void *)(&list[count-1]), (void *)(&list[i])) != 0) { list[count++] = list[i]; } else { list[count-1].num += list[i].num; list[count-1].page_num += list[i].page_num; } } qsort(list, count, sizeof(list[0]), compare_sort_condition); for (i = 0; i < count; i++) { if (cull == 0) { fprintf(fout, "%d times, %d pages, ", list[i].num, list[i].page_num); print_allocator(fout, list[i].allocator); fprintf(fout, ":\n%s\n", list[i].txt); } else { fprintf(fout, "%d times, %d pages", list[i].num, list[i].page_num); if (cull & CULL_PID || filter & FILTER_PID) fprintf(fout, ", PID %d", list[i].pid); if (cull & CULL_TGID || filter & FILTER_TGID) fprintf(fout, ", TGID %d", list[i].tgid); if (cull & CULL_COMM || filter & FILTER_COMM) fprintf(fout, ", task_comm_name: %s", list[i].comm); if (cull & CULL_ALLOCATOR) { fprintf(fout, ", "); print_allocator(fout, list[i].allocator); } if (cull & CULL_STACKTRACE) fprintf(fout, ":\n%s", list[i].stacktrace); fprintf(fout, "\n"); } } out_free: if (ext_buf) free(ext_buf); if (buf) free(buf); if (list) free(list); out_ts: regfree(&ts_nsec_pattern); out_comm: regfree(&comm_pattern); out_tgid: regfree(&tgid_pattern); out_pid: regfree(&pid_pattern); out_order: regfree(&order_pattern); return 0; } |