2 * User-space helper to sort the output of /sys/kernel/debug/page_owner
5 * cat /sys/kernel/debug/page_owner > page_owner_full.txt
6 * grep -v ^PFN page_owner_full.txt > page_owner.txt
7 * ./sort page_owner.txt sorted_page_owner.txt
12 #include <sys/types.h>
25 static struct block_list *list;
29 struct block_list *block_head;
31 int read_block(char *buf, int buf_size, FILE *fin)
33 char *curr = buf, *const buf_end = buf + buf_size;
35 while (buf_end - curr > 1 && fgets(curr, buf_end - curr, fin)) {
36 if (*curr == '\n') /* empty line */
41 return -1; /* EOF or no space left in buf. */
44 static int compare_txt(const void *p1, const void *p2)
46 const struct block_list *l1 = p1, *l2 = p2;
48 return strcmp(l1->txt, l2->txt);
51 static int compare_num(const void *p1, const void *p2)
53 const struct block_list *l1 = p1, *l2 = p2;
55 return l2->num - l1->num;
58 static void add_list(char *buf, int len)
61 len == list[list_size-1].len &&
62 memcmp(buf, list[list_size-1].txt, len) == 0) {
63 list[list_size-1].num++;
66 if (list_size == max_size) {
67 printf("max_size too small??\n");
70 list[list_size].txt = malloc(len+1);
71 list[list_size].len = len;
72 list[list_size].num = 1;
73 memcpy(list[list_size].txt, buf, len);
74 list[list_size].txt[len] = 0;
76 if (list_size % 1000 == 0) {
77 printf("loaded %d\r", list_size);
84 int main(int argc, char **argv)
89 struct block_list *list2;
93 printf("Usage: ./program <input> <output>\n");
98 fin = fopen(argv[1], "r");
99 fout = fopen(argv[2], "w");
101 printf("Usage: ./program <input> <output>\n");
106 fstat(fileno(fin), &st);
107 max_size = st.st_size / 100; /* hack ... */
109 list = malloc(max_size * sizeof(*list));
112 ret = read_block(buf, BUF_SIZE, fin);
119 printf("loaded %d\n", list_size);
121 printf("sorting ....\n");
123 qsort(list, list_size, sizeof(list[0]), compare_txt);
125 list2 = malloc(sizeof(*list) * list_size);
129 for (i = count = 0; i < list_size; i++) {
131 strcmp(list2[count-1].txt, list[i].txt) != 0) {
132 list2[count++] = list[i];
134 list2[count-1].num += list[i].num;
138 qsort(list2, count, sizeof(list[0]), compare_num);
140 for (i = 0; i < count; i++)
141 fprintf(fout, "%d times:\n%s\n", list2[i].num, list2[i].txt);