page_owner_sort.c 3.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153
  1. // SPDX-License-Identifier: GPL-2.0
  2. /*
  3. * User-space helper to sort the output of /sys/kernel/debug/page_owner
  4. *
  5. * Example use:
  6. * cat /sys/kernel/debug/page_owner > page_owner_full.txt
  7. * ./page_owner_sort page_owner_full.txt sorted_page_owner.txt
  8. *
  9. * See Documentation/vm/page_owner.rst
  10. */
  11. #include <stdio.h>
  12. #include <stdlib.h>
  13. #include <sys/types.h>
  14. #include <sys/stat.h>
  15. #include <fcntl.h>
  16. #include <unistd.h>
  17. #include <string.h>
  18. struct block_list {
  19. char *txt;
  20. int len;
  21. int num;
  22. };
  23. static struct block_list *list;
  24. static int list_size;
  25. static int max_size;
  26. struct block_list *block_head;
  27. int read_block(char *buf, int buf_size, FILE *fin)
  28. {
  29. char *curr = buf, *const buf_end = buf + buf_size;
  30. while (buf_end - curr > 1 && fgets(curr, buf_end - curr, fin)) {
  31. if (*curr == '\n') /* empty line */
  32. return curr - buf;
  33. if (!strncmp(curr, "PFN", 3))
  34. continue;
  35. curr += strlen(curr);
  36. }
  37. return -1; /* EOF or no space left in buf. */
  38. }
  39. static int compare_txt(const void *p1, const void *p2)
  40. {
  41. const struct block_list *l1 = p1, *l2 = p2;
  42. return strcmp(l1->txt, l2->txt);
  43. }
  44. static int compare_num(const void *p1, const void *p2)
  45. {
  46. const struct block_list *l1 = p1, *l2 = p2;
  47. return l2->num - l1->num;
  48. }
  49. static void add_list(char *buf, int len)
  50. {
  51. if (list_size != 0 &&
  52. len == list[list_size-1].len &&
  53. memcmp(buf, list[list_size-1].txt, len) == 0) {
  54. list[list_size-1].num++;
  55. return;
  56. }
  57. if (list_size == max_size) {
  58. printf("max_size too small??\n");
  59. exit(1);
  60. }
  61. list[list_size].txt = malloc(len+1);
  62. list[list_size].len = len;
  63. list[list_size].num = 1;
  64. memcpy(list[list_size].txt, buf, len);
  65. list[list_size].txt[len] = 0;
  66. list_size++;
  67. if (list_size % 1000 == 0) {
  68. printf("loaded %d\r", list_size);
  69. fflush(stdout);
  70. }
  71. }
  72. #define BUF_SIZE (128 * 1024)
  73. int main(int argc, char **argv)
  74. {
  75. FILE *fin, *fout;
  76. char *buf;
  77. int ret, i, count;
  78. struct block_list *list2;
  79. struct stat st;
  80. if (argc < 3) {
  81. printf("Usage: ./program <input> <output>\n");
  82. perror("open: ");
  83. exit(1);
  84. }
  85. fin = fopen(argv[1], "r");
  86. fout = fopen(argv[2], "w");
  87. if (!fin || !fout) {
  88. printf("Usage: ./program <input> <output>\n");
  89. perror("open: ");
  90. exit(1);
  91. }
  92. fstat(fileno(fin), &st);
  93. max_size = st.st_size / 100; /* hack ... */
  94. list = malloc(max_size * sizeof(*list));
  95. buf = malloc(BUF_SIZE);
  96. if (!list || !buf) {
  97. printf("Out of memory\n");
  98. exit(1);
  99. }
  100. for ( ; ; ) {
  101. ret = read_block(buf, BUF_SIZE, fin);
  102. if (ret < 0)
  103. break;
  104. add_list(buf, ret);
  105. }
  106. printf("loaded %d\n", list_size);
  107. printf("sorting ....\n");
  108. qsort(list, list_size, sizeof(list[0]), compare_txt);
  109. list2 = malloc(sizeof(*list) * list_size);
  110. printf("culling\n");
  111. for (i = count = 0; i < list_size; i++) {
  112. if (count == 0 ||
  113. strcmp(list2[count-1].txt, list[i].txt) != 0) {
  114. list2[count++] = list[i];
  115. } else {
  116. list2[count-1].num += list[i].num;
  117. }
  118. }
  119. qsort(list2, count, sizeof(list[0]), compare_num);
  120. for (i = 0; i < count; i++)
  121. fprintf(fout, "%d times:\n%s\n", list2[i].num, list2[i].txt);
  122. return 0;
  123. }