]> git.proxmox.com Git - mirror_ubuntu-bionic-kernel.git/blob - tools/perf/builtin-kmem.c
projects / mirror_ubuntu-bionic-kernel.git / blob
? search:
summary | shortlog | log | commit | commitdiff | tree
blame | history | raw | HEAD
Merge tag 'armsoc-dt64' of git://git.kernel.org/pub/scm/linux/kernel/git/arm/arm-soc
[mirror_ubuntu-bionic-kernel.git] / tools / perf / builtin-kmem.c
1 #include "builtin.h"
2 #include "perf.h"
3
4 #include "util/evlist.h"
5 #include "util/evsel.h"
6 #include "util/util.h"
7 #include "util/config.h"
8 #include "util/symbol.h"
9 #include "util/thread.h"
10 #include "util/header.h"
11 #include "util/session.h"
12 #include "util/tool.h"
13 #include "util/callchain.h"
14
15 #include <subcmd/parse-options.h>
16 #include "util/trace-event.h"
17 #include "util/data.h"
18 #include "util/cpumap.h"
19
20 #include "util/debug.h"
21
22 #include <linux/rbtree.h>
23 #include <linux/string.h>
24 #include <locale.h>
25 #include <regex.h>
26
27 static int kmem_slab;
28 static int kmem_page;
29
30 static long kmem_page_size;
31 static enum {
32 KMEM_SLAB,
33 KMEM_PAGE,
34 } kmem_default = KMEM_SLAB; /* for backward compatibility */
35
36 struct alloc_stat;
37 typedef int (*sort_fn_t)(void *, void *);
38
39 static int alloc_flag;
40 static int caller_flag;
41
42 static int alloc_lines = -1;
43 static int caller_lines = -1;
44
45 static bool raw_ip;
46
47 struct alloc_stat {
48 u64 call_site;
49 u64 ptr;
50 u64 bytes_req;
51 u64 bytes_alloc;
52 u32 hit;
53 u32 pingpong;
54
55 short alloc_cpu;
56
57 struct rb_node node;
58 };
59
60 static struct rb_root root_alloc_stat;
61 static struct rb_root root_alloc_sorted;
62 static struct rb_root root_caller_stat;
63 static struct rb_root root_caller_sorted;
64
65 static unsigned long total_requested, total_allocated;
66 static unsigned long nr_allocs, nr_cross_allocs;
67
68 static int insert_alloc_stat(unsigned long call_site, unsigned long ptr,
69 int bytes_req, int bytes_alloc, int cpu)
70 {
71 struct rb_node **node = &root_alloc_stat.rb_node;
72 struct rb_node *parent = NULL;
73 struct alloc_stat *data = NULL;
74
75 while (*node) {
76 parent = *node;
77 data = rb_entry(*node, struct alloc_stat, node);
78
79 if (ptr > data->ptr)
80 node = &(*node)->rb_right;
81 else if (ptr < data->ptr)
82 node = &(*node)->rb_left;
83 else
84 break;
85 }
86
87 if (data && data->ptr == ptr) {
88 data->hit++;
89 data->bytes_req += bytes_req;
90 data->bytes_alloc += bytes_alloc;
91 } else {
92 data = malloc(sizeof(*data));
93 if (!data) {
94 pr_err("%s: malloc failed\n", __func__);
95 return -1;
96 }
97 data->ptr = ptr;
98 data->pingpong = 0;
99 data->hit = 1;
100 data->bytes_req = bytes_req;
101 data->bytes_alloc = bytes_alloc;
102
103 rb_link_node(&data->node, parent, node);
104 rb_insert_color(&data->node, &root_alloc_stat);
105 }
106 data->call_site = call_site;
107 data->alloc_cpu = cpu;
108 return 0;
109 }
110
111 static int insert_caller_stat(unsigned long call_site,
112 int bytes_req, int bytes_alloc)
113 {
114 struct rb_node **node = &root_caller_stat.rb_node;
115 struct rb_node *parent = NULL;
116 struct alloc_stat *data = NULL;
117
118 while (*node) {
119 parent = *node;
120 data = rb_entry(*node, struct alloc_stat, node);
121
122 if (call_site > data->call_site)
123 node = &(*node)->rb_right;
124 else if (call_site < data->call_site)
125 node = &(*node)->rb_left;
126 else
127 break;
128 }
129
130 if (data && data->call_site == call_site) {
131 data->hit++;
132 data->bytes_req += bytes_req;
133 data->bytes_alloc += bytes_alloc;
134 } else {
135 data = malloc(sizeof(*data));
136 if (!data) {
137 pr_err("%s: malloc failed\n", __func__);
138 return -1;
139 }
140 data->call_site = call_site;
141 data->pingpong = 0;
142 data->hit = 1;
143 data->bytes_req = bytes_req;
144 data->bytes_alloc = bytes_alloc;
145
146 rb_link_node(&data->node, parent, node);
147 rb_insert_color(&data->node, &root_caller_stat);
148 }
149
150 return 0;
151 }
152
153 static int perf_evsel__process_alloc_event(struct perf_evsel *evsel,
154 struct perf_sample *sample)
155 {
156 unsigned long ptr = perf_evsel__intval(evsel, sample, "ptr"),
157 call_site = perf_evsel__intval(evsel, sample, "call_site");
158 int bytes_req = perf_evsel__intval(evsel, sample, "bytes_req"),
159 bytes_alloc = perf_evsel__intval(evsel, sample, "bytes_alloc");
160
161 if (insert_alloc_stat(call_site, ptr, bytes_req, bytes_alloc, sample->cpu) ||
162 insert_caller_stat(call_site, bytes_req, bytes_alloc))
163 return -1;
164
165 total_requested += bytes_req;
166 total_allocated += bytes_alloc;
167
168 nr_allocs++;
169 return 0;
170 }
171
172 static int perf_evsel__process_alloc_node_event(struct perf_evsel *evsel,
173 struct perf_sample *sample)
174 {
175 int ret = perf_evsel__process_alloc_event(evsel, sample);
176
177 if (!ret) {
178 int node1 = cpu__get_node(sample->cpu),
179 node2 = perf_evsel__intval(evsel, sample, "node");
180
181 if (node1 != node2)
182 nr_cross_allocs++;
183 }
184
185 return ret;
186 }
187
188 static int ptr_cmp(void *, void *);
189 static int slab_callsite_cmp(void *, void *);
190
191 static struct alloc_stat *search_alloc_stat(unsigned long ptr,
192 unsigned long call_site,
193 struct rb_root *root,
194 sort_fn_t sort_fn)
195 {
196 struct rb_node *node = root->rb_node;
197 struct alloc_stat key = { .ptr = ptr, .call_site = call_site };
198
199 while (node) {
200 struct alloc_stat *data;
201 int cmp;
202
203 data = rb_entry(node, struct alloc_stat, node);
204
205 cmp = sort_fn(&key, data);
206 if (cmp < 0)
207 node = node->rb_left;
208 else if (cmp > 0)
209 node = node->rb_right;
210 else
211 return data;
212 }
213 return NULL;
214 }
215
216 static int perf_evsel__process_free_event(struct perf_evsel *evsel,
217 struct perf_sample *sample)
218 {
219 unsigned long ptr = perf_evsel__intval(evsel, sample, "ptr");
220 struct alloc_stat *s_alloc, *s_caller;
221
222 s_alloc = search_alloc_stat(ptr, 0, &root_alloc_stat, ptr_cmp);
223 if (!s_alloc)
224 return 0;
225
226 if ((short)sample->cpu != s_alloc->alloc_cpu) {
227 s_alloc->pingpong++;
228
229 s_caller = search_alloc_stat(0, s_alloc->call_site,
230 &root_caller_stat,
231 slab_callsite_cmp);
232 if (!s_caller)
233 return -1;
234 s_caller->pingpong++;
235 }
236 s_alloc->alloc_cpu = -1;
237
238 return 0;
239 }
240
241 static u64 total_page_alloc_bytes;
242 static u64 total_page_free_bytes;
243 static u64 total_page_nomatch_bytes;
244 static u64 total_page_fail_bytes;
245 static unsigned long nr_page_allocs;
246 static unsigned long nr_page_frees;
247 static unsigned long nr_page_fails;
248 static unsigned long nr_page_nomatch;
249
250 static bool use_pfn;
251 static bool live_page;
252 static struct perf_session *kmem_session;
253
254 #define MAX_MIGRATE_TYPES 6
255 #define MAX_PAGE_ORDER 11
256
257 static int order_stats[MAX_PAGE_ORDER][MAX_MIGRATE_TYPES];
258
259 struct page_stat {
260 struct rb_node node;
261 u64 page;
262 u64 callsite;
263 int order;
264 unsigned gfp_flags;
265 unsigned migrate_type;
266 u64 alloc_bytes;
267 u64 free_bytes;
268 int nr_alloc;
269 int nr_free;
270 };
271
272 static struct rb_root page_live_tree;
273 static struct rb_root page_alloc_tree;
274 static struct rb_root page_alloc_sorted;
275 static struct rb_root page_caller_tree;
276 static struct rb_root page_caller_sorted;
277
278 struct alloc_func {
279 u64 start;
280 u64 end;
281 char *name;
282 };
283
284 static int nr_alloc_funcs;
285 static struct alloc_func *alloc_func_list;
286
287 static int funcmp(const void *a, const void *b)
288 {
289 const struct alloc_func *fa = a;
290 const struct alloc_func *fb = b;
291
292 if (fa->start > fb->start)
293 return 1;
294 else
295 return -1;
296 }
297
298 static int callcmp(const void *a, const void *b)
299 {
300 const struct alloc_func *fa = a;
301 const struct alloc_func *fb = b;
302
303 if (fb->start <= fa->start && fa->end < fb->end)
304 return 0;
305
306 if (fa->start > fb->start)
307 return 1;
308 else
309 return -1;
310 }
311
312 static int build_alloc_func_list(void)
313 {
314 int ret;
315 struct map *kernel_map;
316 struct symbol *sym;
317 struct rb_node *node;
318 struct alloc_func *func;
319 struct machine *machine = &kmem_session->machines.host;
320 regex_t alloc_func_regex;
321 const char pattern[] = "^_?_?(alloc|get_free|get_zeroed)_pages?";
322
323 ret = regcomp(&alloc_func_regex, pattern, REG_EXTENDED);
324 if (ret) {
325 char err[BUFSIZ];
326
327 regerror(ret, &alloc_func_regex, err, sizeof(err));
328 pr_err("Invalid regex: %s\n%s", pattern, err);
329 return -EINVAL;
330 }
331
332 kernel_map = machine__kernel_map(machine);
333 if (map__load(kernel_map) < 0) {
334 pr_err("cannot load kernel map\n");
335 return -ENOENT;
336 }
337
338 map__for_each_symbol(kernel_map, sym, node) {
339 if (regexec(&alloc_func_regex, sym->name, 0, NULL, 0))
340 continue;
341
342 func = realloc(alloc_func_list,
343 (nr_alloc_funcs + 1) * sizeof(*func));
344 if (func == NULL)
345 return -ENOMEM;
346
347 pr_debug("alloc func: %s\n", sym->name);
348 func[nr_alloc_funcs].start = sym->start;
349 func[nr_alloc_funcs].end = sym->end;
350 func[nr_alloc_funcs].name = sym->name;
351
352 alloc_func_list = func;
353 nr_alloc_funcs++;
354 }
355
356 qsort(alloc_func_list, nr_alloc_funcs, sizeof(*func), funcmp);
357
358 regfree(&alloc_func_regex);
359 return 0;
360 }
361
362 /*
363 * Find first non-memory allocation function from callchain.
364 * The allocation functions are in the 'alloc_func_list'.
365 */
366 static u64 find_callsite(struct perf_evsel *evsel, struct perf_sample *sample)
367 {
368 struct addr_location al;
369 struct machine *machine = &kmem_session->machines.host;
370 struct callchain_cursor_node *node;
371
372 if (alloc_func_list == NULL) {
373 if (build_alloc_func_list() < 0)
374 goto out;
375 }
376
377 al.thread = machine__findnew_thread(machine, sample->pid, sample->tid);
378 sample__resolve_callchain(sample, &callchain_cursor, NULL, evsel, &al, 16);
379
380 callchain_cursor_commit(&callchain_cursor);
381 while (true) {
382 struct alloc_func key, *caller;
383 u64 addr;
384
385 node = callchain_cursor_current(&callchain_cursor);
386 if (node == NULL)
387 break;
388
389 key.start = key.end = node->ip;
390 caller = bsearch(&key, alloc_func_list, nr_alloc_funcs,
391 sizeof(key), callcmp);
392 if (!caller) {
393 /* found */
394 if (node->map)
395 addr = map__unmap_ip(node->map, node->ip);
396 else
397 addr = node->ip;
398
399 return addr;
400 } else
401 pr_debug3("skipping alloc function: %s\n", caller->name);
402
403 callchain_cursor_advance(&callchain_cursor);
404 }
405
406 out:
407 pr_debug2("unknown callsite: %"PRIx64 "\n", sample->ip);
408 return sample->ip;
409 }
410
411 struct sort_dimension {
412 const char name[20];
413 sort_fn_t cmp;
414 struct list_head list;
415 };
416
417 static LIST_HEAD(page_alloc_sort_input);
418 static LIST_HEAD(page_caller_sort_input);
419
420 static struct page_stat *
421 __page_stat__findnew_page(struct page_stat *pstat, bool create)
422 {
423 struct rb_node **node = &page_live_tree.rb_node;
424 struct rb_node *parent = NULL;
425 struct page_stat *data;
426
427 while (*node) {
428 s64 cmp;
429
430 parent = *node;
431 data = rb_entry(*node, struct page_stat, node);
432
433 cmp = data->page - pstat->page;
434 if (cmp < 0)
435 node = &parent->rb_left;
436 else if (cmp > 0)
437 node = &parent->rb_right;
438 else
439 return data;
440 }
441
442 if (!create)
443 return NULL;
444
445 data = zalloc(sizeof(*data));
446 if (data != NULL) {
447 data->page = pstat->page;
448 data->order = pstat->order;
449 data->gfp_flags = pstat->gfp_flags;
450 data->migrate_type = pstat->migrate_type;
451
452 rb_link_node(&data->node, parent, node);
453 rb_insert_color(&data->node, &page_live_tree);
454 }
455
456 return data;
457 }
458
459 static struct page_stat *page_stat__find_page(struct page_stat *pstat)
460 {
461 return __page_stat__findnew_page(pstat, false);
462 }
463
464 static struct page_stat *page_stat__findnew_page(struct page_stat *pstat)
465 {
466 return __page_stat__findnew_page(pstat, true);
467 }
468
469 static struct page_stat *
470 __page_stat__findnew_alloc(struct page_stat *pstat, bool create)
471 {
472 struct rb_node **node = &page_alloc_tree.rb_node;
473 struct rb_node *parent = NULL;
474 struct page_stat *data;
475 struct sort_dimension *sort;
476
477 while (*node) {
478 int cmp = 0;
479
480 parent = *node;
481 data = rb_entry(*node, struct page_stat, node);
482
483 list_for_each_entry(sort, &page_alloc_sort_input, list) {
484 cmp = sort->cmp(pstat, data);
485 if (cmp)
486 break;
487 }
488
489 if (cmp < 0)
490 node = &parent->rb_left;
491 else if (cmp > 0)
492 node = &parent->rb_right;
493 else
494 return data;
495 }
496
497 if (!create)
498 return NULL;
499
500 data = zalloc(sizeof(*data));
501 if (data != NULL) {
502 data->page = pstat->page;
503 data->order = pstat->order;
504 data->gfp_flags = pstat->gfp_flags;
505 data->migrate_type = pstat->migrate_type;
506
507 rb_link_node(&data->node, parent, node);
508 rb_insert_color(&data->node, &page_alloc_tree);
509 }
510
511 return data;
512 }
513
514 static struct page_stat *page_stat__find_alloc(struct page_stat *pstat)
515 {
516 return __page_stat__findnew_alloc(pstat, false);
517 }
518
519 static struct page_stat *page_stat__findnew_alloc(struct page_stat *pstat)
520 {
521 return __page_stat__findnew_alloc(pstat, true);
522 }
523
524 static struct page_stat *
525 __page_stat__findnew_caller(struct page_stat *pstat, bool create)
526 {
527 struct rb_node **node = &page_caller_tree.rb_node;
528 struct rb_node *parent = NULL;
529 struct page_stat *data;
530 struct sort_dimension *sort;
531
532 while (*node) {
533 int cmp = 0;
534
535 parent = *node;
536 data = rb_entry(*node, struct page_stat, node);
537
538 list_for_each_entry(sort, &page_caller_sort_input, list) {
539 cmp = sort->cmp(pstat, data);
540 if (cmp)
541 break;
542 }
543
544 if (cmp < 0)
545 node = &parent->rb_left;
546 else if (cmp > 0)
547 node = &parent->rb_right;
548 else
549 return data;
550 }
551
552 if (!create)
553 return NULL;
554
555 data = zalloc(sizeof(*data));
556 if (data != NULL) {
557 data->callsite = pstat->callsite;
558 data->order = pstat->order;
559 data->gfp_flags = pstat->gfp_flags;
560 data->migrate_type = pstat->migrate_type;
561
562 rb_link_node(&data->node, parent, node);
563 rb_insert_color(&data->node, &page_caller_tree);
564 }
565
566 return data;
567 }
568
569 static struct page_stat *page_stat__find_caller(struct page_stat *pstat)
570 {
571 return __page_stat__findnew_caller(pstat, false);
572 }
573
574 static struct page_stat *page_stat__findnew_caller(struct page_stat *pstat)
575 {
576 return __page_stat__findnew_caller(pstat, true);
577 }
578
579 static bool valid_page(u64 pfn_or_page)
580 {
581 if (use_pfn && pfn_or_page == -1UL)
582 return false;
583 if (!use_pfn && pfn_or_page == 0)
584 return false;
585 return true;
586 }
587
588 struct gfp_flag {
589 unsigned int flags;
590 char *compact_str;
591 char *human_readable;
592 };
593
594 static struct gfp_flag *gfps;
595 static int nr_gfps;
596
597 static int gfpcmp(const void *a, const void *b)
598 {
599 const struct gfp_flag *fa = a;
600 const struct gfp_flag *fb = b;
601
602 return fa->flags - fb->flags;
603 }
604
605 /* see include/trace/events/mmflags.h */
606 static const struct {
607 const char *original;
608 const char *compact;
609 } gfp_compact_table[] = {
610 { "GFP_TRANSHUGE", "THP" },
611 { "GFP_TRANSHUGE_LIGHT", "THL" },
612 { "GFP_HIGHUSER_MOVABLE", "HUM" },
613 { "GFP_HIGHUSER", "HU" },
614 { "GFP_USER", "U" },
615 { "GFP_TEMPORARY", "TMP" },
616 { "GFP_KERNEL_ACCOUNT", "KAC" },
617 { "GFP_KERNEL", "K" },
618 { "GFP_NOFS", "NF" },
619 { "GFP_ATOMIC", "A" },
620 { "GFP_NOIO", "NI" },
621 { "GFP_NOWAIT", "NW" },
622 { "GFP_DMA", "D" },
623 { "__GFP_HIGHMEM", "HM" },
624 { "GFP_DMA32", "D32" },
625 { "__GFP_HIGH", "H" },
626 { "__GFP_ATOMIC", "_A" },
627 { "__GFP_IO", "I" },
628 { "__GFP_FS", "F" },
629 { "__GFP_COLD", "CO" },
630 { "__GFP_NOWARN", "NWR" },
631 { "__GFP_REPEAT", "R" },
632 { "__GFP_NOFAIL", "NF" },
633 { "__GFP_NORETRY", "NR" },
634 { "__GFP_COMP", "C" },
635 { "__GFP_ZERO", "Z" },
636 { "__GFP_NOMEMALLOC", "NMA" },
637 { "__GFP_MEMALLOC", "MA" },
638 { "__GFP_HARDWALL", "HW" },
639 { "__GFP_THISNODE", "TN" },
640 { "__GFP_RECLAIMABLE", "RC" },
641 { "__GFP_MOVABLE", "M" },
642 { "__GFP_ACCOUNT", "AC" },
643 { "__GFP_NOTRACK", "NT" },
644 { "__GFP_WRITE", "WR" },
645 { "__GFP_RECLAIM", "R" },
646 { "__GFP_DIRECT_RECLAIM", "DR" },
647 { "__GFP_KSWAPD_RECLAIM", "KR" },
648 { "__GFP_OTHER_NODE", "ON" },
649 };
650
651 static size_t max_gfp_len;
652
653 static char *compact_gfp_flags(char *gfp_flags)
654 {
655 char *orig_flags = strdup(gfp_flags);
656 char *new_flags = NULL;
657 char *str, *pos = NULL;
658 size_t len = 0;
659
660 if (orig_flags == NULL)
661 return NULL;
662
663 str = strtok_r(orig_flags, "|", &pos);
664 while (str) {
665 size_t i;
666 char *new;
667 const char *cpt;
668
669 for (i = 0; i < ARRAY_SIZE(gfp_compact_table); i++) {
670 if (strcmp(gfp_compact_table[i].original, str))
671 continue;
672
673 cpt = gfp_compact_table[i].compact;
674 new = realloc(new_flags, len + strlen(cpt) + 2);
675 if (new == NULL) {
676 free(new_flags);
677 return NULL;
678 }
679
680 new_flags = new;
681
682 if (!len) {
683 strcpy(new_flags, cpt);
684 } else {
685 strcat(new_flags, "|");
686 strcat(new_flags, cpt);
687 len++;
688 }
689
690 len += strlen(cpt);
691 }
692
693 str = strtok_r(NULL, "|", &pos);
694 }
695
696 if (max_gfp_len < len)
697 max_gfp_len = len;
698
699 free(orig_flags);
700 return new_flags;
701 }
702
703 static char *compact_gfp_string(unsigned long gfp_flags)
704 {
705 struct gfp_flag key = {
706 .flags = gfp_flags,
707 };
708 struct gfp_flag *gfp;
709
710 gfp = bsearch(&key, gfps, nr_gfps, sizeof(*gfps), gfpcmp);
711 if (gfp)
712 return gfp->compact_str;
713
714 return NULL;
715 }
716
717 static int parse_gfp_flags(struct perf_evsel *evsel, struct perf_sample *sample,
718 unsigned int gfp_flags)
719 {
720 struct pevent_record record = {
721 .cpu = sample->cpu,
722 .data = sample->raw_data,
723 .size = sample->raw_size,
724 };
725 struct trace_seq seq;
726 char *str, *pos = NULL;
727
728 if (nr_gfps) {
729 struct gfp_flag key = {
730 .flags = gfp_flags,
731 };
732
733 if (bsearch(&key, gfps, nr_gfps, sizeof(*gfps), gfpcmp))
734 return 0;
735 }
736
737 trace_seq_init(&seq);
738 pevent_event_info(&seq, evsel->tp_format, &record);
739
740 str = strtok_r(seq.buffer, " ", &pos);
741 while (str) {
742 if (!strncmp(str, "gfp_flags=", 10)) {
743 struct gfp_flag *new;
744
745 new = realloc(gfps, (nr_gfps + 1) * sizeof(*gfps));
746 if (new == NULL)
747 return -ENOMEM;
748
749 gfps = new;
750 new += nr_gfps++;
751
752 new->flags = gfp_flags;
753 new->human_readable = strdup(str + 10);
754 new->compact_str = compact_gfp_flags(str + 10);
755 if (!new->human_readable || !new->compact_str)
756 return -ENOMEM;
757
758 qsort(gfps, nr_gfps, sizeof(*gfps), gfpcmp);
759 }
760
761 str = strtok_r(NULL, " ", &pos);
762 }
763
764 trace_seq_destroy(&seq);
765 return 0;
766 }
767
768 static int perf_evsel__process_page_alloc_event(struct perf_evsel *evsel,
769 struct perf_sample *sample)
770 {
771 u64 page;
772 unsigned int order = perf_evsel__intval(evsel, sample, "order");
773 unsigned int gfp_flags = perf_evsel__intval(evsel, sample, "gfp_flags");
774 unsigned int migrate_type = perf_evsel__intval(evsel, sample,
775 "migratetype");
776 u64 bytes = kmem_page_size << order;
777 u64 callsite;
778 struct page_stat *pstat;
779 struct page_stat this = {
780 .order = order,
781 .gfp_flags = gfp_flags,
782 .migrate_type = migrate_type,
783 };
784
785 if (use_pfn)
786 page = perf_evsel__intval(evsel, sample, "pfn");
787 else
788 page = perf_evsel__intval(evsel, sample, "page");
789
790 nr_page_allocs++;
791 total_page_alloc_bytes += bytes;
792
793 if (!valid_page(page)) {
794 nr_page_fails++;
795 total_page_fail_bytes += bytes;
796
797 return 0;
798 }
799
800 if (parse_gfp_flags(evsel, sample, gfp_flags) < 0)
801 return -1;
802
803 callsite = find_callsite(evsel, sample);
804
805 /*
806 * This is to find the current page (with correct gfp flags and
807 * migrate type) at free event.
808 */
809 this.page = page;
810 pstat = page_stat__findnew_page(&this);
811 if (pstat == NULL)
812 return -ENOMEM;
813
814 pstat->nr_alloc++;
815 pstat->alloc_bytes += bytes;
816 pstat->callsite = callsite;
817
818 if (!live_page) {
819 pstat = page_stat__findnew_alloc(&this);
820 if (pstat == NULL)
821 return -ENOMEM;
822
823 pstat->nr_alloc++;
824 pstat->alloc_bytes += bytes;
825 pstat->callsite = callsite;
826 }
827
828 this.callsite = callsite;
829 pstat = page_stat__findnew_caller(&this);
830 if (pstat == NULL)
831 return -ENOMEM;
832
833 pstat->nr_alloc++;
834 pstat->alloc_bytes += bytes;
835
836 order_stats[order][migrate_type]++;
837
838 return 0;
839 }
840
841 static int perf_evsel__process_page_free_event(struct perf_evsel *evsel,
842 struct perf_sample *sample)
843 {
844 u64 page;
845 unsigned int order = perf_evsel__intval(evsel, sample, "order");
846 u64 bytes = kmem_page_size << order;
847 struct page_stat *pstat;
848 struct page_stat this = {
849 .order = order,
850 };
851
852 if (use_pfn)
853 page = perf_evsel__intval(evsel, sample, "pfn");
854 else
855 page = perf_evsel__intval(evsel, sample, "page");
856
857 nr_page_frees++;
858 total_page_free_bytes += bytes;
859
860 this.page = page;
861 pstat = page_stat__find_page(&this);
862 if (pstat == NULL) {
863 pr_debug2("missing free at page %"PRIx64" (order: %d)\n",
864 page, order);
865
866 nr_page_nomatch++;
867 total_page_nomatch_bytes += bytes;
868
869 return 0;
870 }
871
872 this.gfp_flags = pstat->gfp_flags;
873 this.migrate_type = pstat->migrate_type;
874 this.callsite = pstat->callsite;
875
876 rb_erase(&pstat->node, &page_live_tree);
877 free(pstat);
878
879 if (live_page) {
880 order_stats[this.order][this.migrate_type]--;
881 } else {
882 pstat = page_stat__find_alloc(&this);
883 if (pstat == NULL)
884 return -ENOMEM;
885
886 pstat->nr_free++;
887 pstat->free_bytes += bytes;
888 }
889
890 pstat = page_stat__find_caller(&this);
891 if (pstat == NULL)
892 return -ENOENT;
893
894 pstat->nr_free++;
895 pstat->free_bytes += bytes;
896
897 if (live_page) {
898 pstat->nr_alloc--;
899 pstat->alloc_bytes -= bytes;
900
901 if (pstat->nr_alloc == 0) {
902 rb_erase(&pstat->node, &page_caller_tree);
903 free(pstat);
904 }
905 }
906
907 return 0;
908 }
909
910 typedef int (*tracepoint_handler)(struct perf_evsel *evsel,
911 struct perf_sample *sample);
912
913 static int process_sample_event(struct perf_tool *tool __maybe_unused,
914 union perf_event *event,
915 struct perf_sample *sample,
916 struct perf_evsel *evsel,
917 struct machine *machine)
918 {
919 int err = 0;
920 struct thread *thread = machine__findnew_thread(machine, sample->pid,
921 sample->tid);
922
923 if (thread == NULL) {
924 pr_debug("problem processing %d event, skipping it.\n",
925 event->header.type);
926 return -1;
927 }
928
929 dump_printf(" ... thread: %s:%d\n", thread__comm_str(thread), thread->tid);
930
931 if (evsel->handler != NULL) {
932 tracepoint_handler f = evsel->handler;
933 err = f(evsel, sample);
934 }
935
936 thread__put(thread);
937
938 return err;
939 }
940
941 static struct perf_tool perf_kmem = {
942 .sample = process_sample_event,
943 .comm = perf_event__process_comm,
944 .mmap = perf_event__process_mmap,
945 .mmap2 = perf_event__process_mmap2,
946 .ordered_events = true,
947 };
948
949 static double fragmentation(unsigned long n_req, unsigned long n_alloc)
950 {
951 if (n_alloc == 0)
952 return 0.0;
953 else
954 return 100.0 - (100.0 * n_req / n_alloc);
955 }
956
957 static void __print_slab_result(struct rb_root *root,
958 struct perf_session *session,
959 int n_lines, int is_caller)
960 {
961 struct rb_node *next;
962 struct machine *machine = &session->machines.host;
963
964 printf("%.105s\n", graph_dotted_line);
965 printf(" %-34s |", is_caller ? "Callsite": "Alloc Ptr");
966 printf(" Total_alloc/Per | Total_req/Per | Hit | Ping-pong | Frag\n");
967 printf("%.105s\n", graph_dotted_line);
968
969 next = rb_first(root);
970
971 while (next && n_lines--) {
972 struct alloc_stat *data = rb_entry(next, struct alloc_stat,
973 node);
974 struct symbol *sym = NULL;
975 struct map *map;
976 char buf[BUFSIZ];
977 u64 addr;
978
979 if (is_caller) {
980 addr = data->call_site;
981 if (!raw_ip)
982 sym = machine__find_kernel_function(machine, addr, &map);
983 } else
984 addr = data->ptr;
985
986 if (sym != NULL)
987 snprintf(buf, sizeof(buf), "%s+%" PRIx64 "", sym->name,
988 addr - map->unmap_ip(map, sym->start));
989 else
990 snprintf(buf, sizeof(buf), "%#" PRIx64 "", addr);
991 printf(" %-34s |", buf);
992
993 printf(" %9llu/%-5lu | %9llu/%-5lu | %8lu | %9lu | %6.3f%%\n",
994 (unsigned long long)data->bytes_alloc,
995 (unsigned long)data->bytes_alloc / data->hit,
996 (unsigned long long)data->bytes_req,
997 (unsigned long)data->bytes_req / data->hit,
998 (unsigned long)data->hit,
999 (unsigned long)data->pingpong,
1000 fragmentation(data->bytes_req, data->bytes_alloc));
1001
1002 next = rb_next(next);
1003 }
1004
1005 if (n_lines == -1)
1006 printf(" ... | ... | ... | ... | ... | ... \n");
1007
1008 printf("%.105s\n", graph_dotted_line);
1009 }
1010
1011 static const char * const migrate_type_str[] = {
1012 "UNMOVABL",
1013 "RECLAIM",
1014 "MOVABLE",
1015 "RESERVED",
1016 "CMA/ISLT",
1017 "UNKNOWN",
1018 };
1019
1020 static void __print_page_alloc_result(struct perf_session *session, int n_lines)
1021 {
1022 struct rb_node *next = rb_first(&page_alloc_sorted);
1023 struct machine *machine = &session->machines.host;
1024 const char *format;
1025 int gfp_len = max(strlen("GFP flags"), max_gfp_len);
1026
1027 printf("\n%.105s\n", graph_dotted_line);
1028 printf(" %-16s | %5s alloc (KB) | Hits | Order | Mig.type | %-*s | Callsite\n",
1029 use_pfn ? "PFN" : "Page", live_page ? "Live" : "Total",
1030 gfp_len, "GFP flags");
1031 printf("%.105s\n", graph_dotted_line);
1032
1033 if (use_pfn)
1034 format = " %16llu | %'16llu | %'9d | %5d | %8s | %-*s | %s\n";
1035 else
1036 format = " %016llx | %'16llu | %'9d | %5d | %8s | %-*s | %s\n";
1037
1038 while (next && n_lines--) {
1039 struct page_stat *data;
1040 struct symbol *sym;
1041 struct map *map;
1042 char buf[32];
1043 char *caller = buf;
1044
1045 data = rb_entry(next, struct page_stat, node);
1046 sym = machine__find_kernel_function(machine, data->callsite, &map);
1047 if (sym && sym->name)
1048 caller = sym->name;
1049 else
1050 scnprintf(buf, sizeof(buf), "%"PRIx64, data->callsite);
1051
1052 printf(format, (unsigned long long)data->page,
1053 (unsigned long long)data->alloc_bytes / 1024,
1054 data->nr_alloc, data->order,
1055 migrate_type_str[data->migrate_type],
1056 gfp_len, compact_gfp_string(data->gfp_flags), caller);
1057
1058 next = rb_next(next);
1059 }
1060
1061 if (n_lines == -1) {
1062 printf(" ... | ... | ... | ... | ... | %-*s | ...\n",
1063 gfp_len, "...");
1064 }
1065
1066 printf("%.105s\n", graph_dotted_line);
1067 }
1068
1069 static void __print_page_caller_result(struct perf_session *session, int n_lines)
1070 {
1071 struct rb_node *next = rb_first(&page_caller_sorted);
1072 struct machine *machine = &session->machines.host;
1073 int gfp_len = max(strlen("GFP flags"), max_gfp_len);
1074
1075 printf("\n%.105s\n", graph_dotted_line);
1076 printf(" %5s alloc (KB) | Hits | Order | Mig.type | %-*s | Callsite\n",
1077 live_page ? "Live" : "Total", gfp_len, "GFP flags");
1078 printf("%.105s\n", graph_dotted_line);
1079
1080 while (next && n_lines--) {
1081 struct page_stat *data;
1082 struct symbol *sym;
1083 struct map *map;
1084 char buf[32];
1085 char *caller = buf;
1086
1087 data = rb_entry(next, struct page_stat, node);
1088 sym = machine__find_kernel_function(machine, data->callsite, &map);
1089 if (sym && sym->name)
1090 caller = sym->name;
1091 else
1092 scnprintf(buf, sizeof(buf), "%"PRIx64, data->callsite);
1093
1094 printf(" %'16llu | %'9d | %5d | %8s | %-*s | %s\n",
1095 (unsigned long long)data->alloc_bytes / 1024,
1096 data->nr_alloc, data->order,
1097 migrate_type_str[data->migrate_type],
1098 gfp_len, compact_gfp_string(data->gfp_flags), caller);
1099
1100 next = rb_next(next);
1101 }
1102
1103 if (n_lines == -1) {
1104 printf(" ... | ... | ... | ... | %-*s | ...\n",
1105 gfp_len, "...");
1106 }
1107
1108 printf("%.105s\n", graph_dotted_line);
1109 }
1110
1111 static void print_gfp_flags(void)
1112 {
1113 int i;
1114
1115 printf("#\n");
1116 printf("# GFP flags\n");
1117 printf("# ---------\n");
1118 for (i = 0; i < nr_gfps; i++) {
1119 printf("# %08x: %*s: %s\n", gfps[i].flags,
1120 (int) max_gfp_len, gfps[i].compact_str,
1121 gfps[i].human_readable);
1122 }
1123 }
1124
1125 static void print_slab_summary(void)
1126 {
1127 printf("\nSUMMARY (SLAB allocator)");
1128 printf("\n========================\n");
1129 printf("Total bytes requested: %'lu\n", total_requested);
1130 printf("Total bytes allocated: %'lu\n", total_allocated);
1131 printf("Total bytes wasted on internal fragmentation: %'lu\n",
1132 total_allocated - total_requested);
1133 printf("Internal fragmentation: %f%%\n",
1134 fragmentation(total_requested, total_allocated));
1135 printf("Cross CPU allocations: %'lu/%'lu\n", nr_cross_allocs, nr_allocs);
1136 }
1137
1138 static void print_page_summary(void)
1139 {
1140 int o, m;
1141 u64 nr_alloc_freed = nr_page_frees - nr_page_nomatch;
1142 u64 total_alloc_freed_bytes = total_page_free_bytes - total_page_nomatch_bytes;
1143
1144 printf("\nSUMMARY (page allocator)");
1145 printf("\n========================\n");
1146 printf("%-30s: %'16lu [ %'16"PRIu64" KB ]\n", "Total allocation requests",
1147 nr_page_allocs, total_page_alloc_bytes / 1024);
1148 printf("%-30s: %'16lu [ %'16"PRIu64" KB ]\n", "Total free requests",
1149 nr_page_frees, total_page_free_bytes / 1024);
1150 printf("\n");
1151
1152 printf("%-30s: %'16"PRIu64" [ %'16"PRIu64" KB ]\n", "Total alloc+freed requests",
1153 nr_alloc_freed, (total_alloc_freed_bytes) / 1024);
1154 printf("%-30s: %'16"PRIu64" [ %'16"PRIu64" KB ]\n", "Total alloc-only requests",
1155 nr_page_allocs - nr_alloc_freed,
1156 (total_page_alloc_bytes - total_alloc_freed_bytes) / 1024);
1157 printf("%-30s: %'16lu [ %'16"PRIu64" KB ]\n", "Total free-only requests",
1158 nr_page_nomatch, total_page_nomatch_bytes / 1024);
1159 printf("\n");
1160
1161 printf("%-30s: %'16lu [ %'16"PRIu64" KB ]\n", "Total allocation failures",
1162 nr_page_fails, total_page_fail_bytes / 1024);
1163 printf("\n");
1164
1165 printf("%5s %12s %12s %12s %12s %12s\n", "Order", "Unmovable",
1166 "Reclaimable", "Movable", "Reserved", "CMA/Isolated");
1167 printf("%.5s %.12s %.12s %.12s %.12s %.12s\n", graph_dotted_line,
1168 graph_dotted_line, graph_dotted_line, graph_dotted_line,
1169 graph_dotted_line, graph_dotted_line);
1170
1171 for (o = 0; o < MAX_PAGE_ORDER; o++) {
1172 printf("%5d", o);
1173 for (m = 0; m < MAX_MIGRATE_TYPES - 1; m++) {
1174 if (order_stats[o][m])
1175 printf(" %'12d", order_stats[o][m]);
1176 else
1177 printf(" %12c", '.');
1178 }
1179 printf("\n");
1180 }
1181 }
1182
1183 static void print_slab_result(struct perf_session *session)
1184 {
1185 if (caller_flag)
1186 __print_slab_result(&root_caller_sorted, session, caller_lines, 1);
1187 if (alloc_flag)
1188 __print_slab_result(&root_alloc_sorted, session, alloc_lines, 0);
1189 print_slab_summary();
1190 }
1191
1192 static void print_page_result(struct perf_session *session)
1193 {
1194 if (caller_flag || alloc_flag)
1195 print_gfp_flags();
1196 if (caller_flag)
1197 __print_page_caller_result(session, caller_lines);
1198 if (alloc_flag)
1199 __print_page_alloc_result(session, alloc_lines);
1200 print_page_summary();
1201 }
1202
1203 static void print_result(struct perf_session *session)
1204 {
1205 if (kmem_slab)
1206 print_slab_result(session);
1207 if (kmem_page)
1208 print_page_result(session);
1209 }
1210
1211 static LIST_HEAD(slab_caller_sort);
1212 static LIST_HEAD(slab_alloc_sort);
1213 static LIST_HEAD(page_caller_sort);
1214 static LIST_HEAD(page_alloc_sort);
1215
1216 static void sort_slab_insert(struct rb_root *root, struct alloc_stat *data,
1217 struct list_head *sort_list)
1218 {
1219 struct rb_node **new = &(root->rb_node);
1220 struct rb_node *parent = NULL;
1221 struct sort_dimension *sort;
1222
1223 while (*new) {
1224 struct alloc_stat *this;
1225 int cmp = 0;
1226
1227 this = rb_entry(*new, struct alloc_stat, node);
1228 parent = *new;
1229
1230 list_for_each_entry(sort, sort_list, list) {
1231 cmp = sort->cmp(data, this);
1232 if (cmp)
1233 break;
1234 }
1235
1236 if (cmp > 0)
1237 new = &((*new)->rb_left);
1238 else
1239 new = &((*new)->rb_right);
1240 }
1241
1242 rb_link_node(&data->node, parent, new);
1243 rb_insert_color(&data->node, root);
1244 }
1245
1246 static void __sort_slab_result(struct rb_root *root, struct rb_root *root_sorted,
1247 struct list_head *sort_list)
1248 {
1249 struct rb_node *node;
1250 struct alloc_stat *data;
1251
1252 for (;;) {
1253 node = rb_first(root);
1254 if (!node)
1255 break;
1256
1257 rb_erase(node, root);
1258 data = rb_entry(node, struct alloc_stat, node);
1259 sort_slab_insert(root_sorted, data, sort_list);
1260 }
1261 }
1262
1263 static void sort_page_insert(struct rb_root *root, struct page_stat *data,
1264 struct list_head *sort_list)
1265 {
1266 struct rb_node **new = &root->rb_node;
1267 struct rb_node *parent = NULL;
1268 struct sort_dimension *sort;
1269
1270 while (*new) {
1271 struct page_stat *this;
1272 int cmp = 0;
1273
1274 this = rb_entry(*new, struct page_stat, node);
1275 parent = *new;
1276
1277 list_for_each_entry(sort, sort_list, list) {
1278 cmp = sort->cmp(data, this);
1279 if (cmp)
1280 break;
1281 }
1282
1283 if (cmp > 0)
1284 new = &parent->rb_left;
1285 else
1286 new = &parent->rb_right;
1287 }
1288
1289 rb_link_node(&data->node, parent, new);
1290 rb_insert_color(&data->node, root);
1291 }
1292
1293 static void __sort_page_result(struct rb_root *root, struct rb_root *root_sorted,
1294 struct list_head *sort_list)
1295 {
1296 struct rb_node *node;
1297 struct page_stat *data;
1298
1299 for (;;) {
1300 node = rb_first(root);
1301 if (!node)
1302 break;
1303
1304 rb_erase(node, root);
1305 data = rb_entry(node, struct page_stat, node);
1306 sort_page_insert(root_sorted, data, sort_list);
1307 }
1308 }
1309
1310 static void sort_result(void)
1311 {
1312 if (kmem_slab) {
1313 __sort_slab_result(&root_alloc_stat, &root_alloc_sorted,
1314 &slab_alloc_sort);
1315 __sort_slab_result(&root_caller_stat, &root_caller_sorted,
1316 &slab_caller_sort);
1317 }
1318 if (kmem_page) {
1319 if (live_page)
1320 __sort_page_result(&page_live_tree, &page_alloc_sorted,
1321 &page_alloc_sort);
1322 else
1323 __sort_page_result(&page_alloc_tree, &page_alloc_sorted,
1324 &page_alloc_sort);
1325
1326 __sort_page_result(&page_caller_tree, &page_caller_sorted,
1327 &page_caller_sort);
1328 }
1329 }
1330
1331 static int __cmd_kmem(struct perf_session *session)
1332 {
1333 int err = -EINVAL;
1334 struct perf_evsel *evsel;
1335 const struct perf_evsel_str_handler kmem_tracepoints[] = {
1336 /* slab allocator */
1337 { "kmem:kmalloc", perf_evsel__process_alloc_event, },
1338 { "kmem:kmem_cache_alloc", perf_evsel__process_alloc_event, },
1339 { "kmem:kmalloc_node", perf_evsel__process_alloc_node_event, },
1340 { "kmem:kmem_cache_alloc_node", perf_evsel__process_alloc_node_event, },
1341 { "kmem:kfree", perf_evsel__process_free_event, },
1342 { "kmem:kmem_cache_free", perf_evsel__process_free_event, },
1343 /* page allocator */
1344 { "kmem:mm_page_alloc", perf_evsel__process_page_alloc_event, },
1345 { "kmem:mm_page_free", perf_evsel__process_page_free_event, },
1346 };
1347
1348 if (!perf_session__has_traces(session, "kmem record"))
1349 goto out;
1350
1351 if (perf_session__set_tracepoints_handlers(session, kmem_tracepoints)) {
1352 pr_err("Initializing perf session tracepoint handlers failed\n");
1353 goto out;
1354 }
1355
1356 evlist__for_each_entry(session->evlist, evsel) {
1357 if (!strcmp(perf_evsel__name(evsel), "kmem:mm_page_alloc") &&
1358 perf_evsel__field(evsel, "pfn")) {
1359 use_pfn = true;
1360 break;
1361 }
1362 }
1363
1364 setup_pager();
1365 err = perf_session__process_events(session);
1366 if (err != 0) {
1367 pr_err("error during process events: %d\n", err);
1368 goto out;
1369 }
1370 sort_result();
1371 print_result(session);
1372 out:
1373 return err;
1374 }
1375
1376 /* slab sort keys */
1377 static int ptr_cmp(void *a, void *b)
1378 {
1379 struct alloc_stat *l = a;
1380 struct alloc_stat *r = b;
1381
1382 if (l->ptr < r->ptr)
1383 return -1;
1384 else if (l->ptr > r->ptr)
1385 return 1;
1386 return 0;
1387 }
1388
1389 static struct sort_dimension ptr_sort_dimension = {
1390 .name = "ptr",
1391 .cmp = ptr_cmp,
1392 };
1393
1394 static int slab_callsite_cmp(void *a, void *b)
1395 {
1396 struct alloc_stat *l = a;
1397 struct alloc_stat *r = b;
1398
1399 if (l->call_site < r->call_site)
1400 return -1;
1401 else if (l->call_site > r->call_site)
1402 return 1;
1403 return 0;
1404 }
1405
1406 static struct sort_dimension callsite_sort_dimension = {
1407 .name = "callsite",
1408 .cmp = slab_callsite_cmp,
1409 };
1410
1411 static int hit_cmp(void *a, void *b)
1412 {
1413 struct alloc_stat *l = a;
1414 struct alloc_stat *r = b;
1415
1416 if (l->hit < r->hit)
1417 return -1;
1418 else if (l->hit > r->hit)
1419 return 1;
1420 return 0;
1421 }
1422
1423 static struct sort_dimension hit_sort_dimension = {
1424 .name = "hit",
1425 .cmp = hit_cmp,
1426 };
1427
1428 static int bytes_cmp(void *a, void *b)
1429 {
1430 struct alloc_stat *l = a;
1431 struct alloc_stat *r = b;
1432
1433 if (l->bytes_alloc < r->bytes_alloc)
1434 return -1;
1435 else if (l->bytes_alloc > r->bytes_alloc)
1436 return 1;
1437 return 0;
1438 }
1439
1440 static struct sort_dimension bytes_sort_dimension = {
1441 .name = "bytes",
1442 .cmp = bytes_cmp,
1443 };
1444
1445 static int frag_cmp(void *a, void *b)
1446 {
1447 double x, y;
1448 struct alloc_stat *l = a;
1449 struct alloc_stat *r = b;
1450
1451 x = fragmentation(l->bytes_req, l->bytes_alloc);
1452 y = fragmentation(r->bytes_req, r->bytes_alloc);
1453
1454 if (x < y)
1455 return -1;
1456 else if (x > y)
1457 return 1;
1458 return 0;
1459 }
1460
1461 static struct sort_dimension frag_sort_dimension = {
1462 .name = "frag",
1463 .cmp = frag_cmp,
1464 };
1465
1466 static int pingpong_cmp(void *a, void *b)
1467 {
1468 struct alloc_stat *l = a;
1469 struct alloc_stat *r = b;
1470
1471 if (l->pingpong < r->pingpong)
1472 return -1;
1473 else if (l->pingpong > r->pingpong)
1474 return 1;
1475 return 0;
1476 }
1477
1478 static struct sort_dimension pingpong_sort_dimension = {
1479 .name = "pingpong",
1480 .cmp = pingpong_cmp,
1481 };
1482
1483 /* page sort keys */
1484 static int page_cmp(void *a, void *b)
1485 {
1486 struct page_stat *l = a;
1487 struct page_stat *r = b;
1488
1489 if (l->page < r->page)
1490 return -1;
1491 else if (l->page > r->page)
1492 return 1;
1493 return 0;
1494 }
1495
1496 static struct sort_dimension page_sort_dimension = {
1497 .name = "page",
1498 .cmp = page_cmp,
1499 };
1500
1501 static int page_callsite_cmp(void *a, void *b)
1502 {
1503 struct page_stat *l = a;
1504 struct page_stat *r = b;
1505
1506 if (l->callsite < r->callsite)
1507 return -1;
1508 else if (l->callsite > r->callsite)
1509 return 1;
1510 return 0;
1511 }
1512
1513 static struct sort_dimension page_callsite_sort_dimension = {
1514 .name = "callsite",
1515 .cmp = page_callsite_cmp,
1516 };
1517
1518 static int page_hit_cmp(void *a, void *b)
1519 {
1520 struct page_stat *l = a;
1521 struct page_stat *r = b;
1522
1523 if (l->nr_alloc < r->nr_alloc)
1524 return -1;
1525 else if (l->nr_alloc > r->nr_alloc)
1526 return 1;
1527 return 0;
1528 }
1529
1530 static struct sort_dimension page_hit_sort_dimension = {
1531 .name = "hit",
1532 .cmp = page_hit_cmp,
1533 };
1534
1535 static int page_bytes_cmp(void *a, void *b)
1536 {
1537 struct page_stat *l = a;
1538 struct page_stat *r = b;
1539
1540 if (l->alloc_bytes < r->alloc_bytes)
1541 return -1;
1542 else if (l->alloc_bytes > r->alloc_bytes)
1543 return 1;
1544 return 0;
1545 }
1546
1547 static struct sort_dimension page_bytes_sort_dimension = {
1548 .name = "bytes",
1549 .cmp = page_bytes_cmp,
1550 };
1551
1552 static int page_order_cmp(void *a, void *b)
1553 {
1554 struct page_stat *l = a;
1555 struct page_stat *r = b;
1556
1557 if (l->order < r->order)
1558 return -1;
1559 else if (l->order > r->order)
1560 return 1;
1561 return 0;
1562 }
1563
1564 static struct sort_dimension page_order_sort_dimension = {
1565 .name = "order",
1566 .cmp = page_order_cmp,
1567 };
1568
1569 static int migrate_type_cmp(void *a, void *b)
1570 {
1571 struct page_stat *l = a;
1572 struct page_stat *r = b;
1573
1574 /* for internal use to find free'd page */
1575 if (l->migrate_type == -1U)
1576 return 0;
1577
1578 if (l->migrate_type < r->migrate_type)
1579 return -1;
1580 else if (l->migrate_type > r->migrate_type)
1581 return 1;
1582 return 0;
1583 }
1584
1585 static struct sort_dimension migrate_type_sort_dimension = {
1586 .name = "migtype",
1587 .cmp = migrate_type_cmp,
1588 };
1589
1590 static int gfp_flags_cmp(void *a, void *b)
1591 {
1592 struct page_stat *l = a;
1593 struct page_stat *r = b;
1594
1595 /* for internal use to find free'd page */
1596 if (l->gfp_flags == -1U)
1597 return 0;
1598
1599 if (l->gfp_flags < r->gfp_flags)
1600 return -1;
1601 else if (l->gfp_flags > r->gfp_flags)
1602 return 1;
1603 return 0;
1604 }
1605
1606 static struct sort_dimension gfp_flags_sort_dimension = {
1607 .name = "gfp",
1608 .cmp = gfp_flags_cmp,
1609 };
1610
1611 static struct sort_dimension *slab_sorts[] = {
1612 &ptr_sort_dimension,
1613 &callsite_sort_dimension,
1614 &hit_sort_dimension,
1615 &bytes_sort_dimension,
1616 &frag_sort_dimension,
1617 &pingpong_sort_dimension,
1618 };
1619
1620 static struct sort_dimension *page_sorts[] = {
1621 &page_sort_dimension,
1622 &page_callsite_sort_dimension,
1623 &page_hit_sort_dimension,
1624 &page_bytes_sort_dimension,
1625 &page_order_sort_dimension,
1626 &migrate_type_sort_dimension,
1627 &gfp_flags_sort_dimension,
1628 };
1629
1630 static int slab_sort_dimension__add(const char *tok, struct list_head *list)
1631 {
1632 struct sort_dimension *sort;
1633 int i;
1634
1635 for (i = 0; i < (int)ARRAY_SIZE(slab_sorts); i++) {
1636 if (!strcmp(slab_sorts[i]->name, tok)) {
1637 sort = memdup(slab_sorts[i], sizeof(*slab_sorts[i]));
1638 if (!sort) {
1639 pr_err("%s: memdup failed\n", __func__);
1640 return -1;
1641 }
1642 list_add_tail(&sort->list, list);
1643 return 0;
1644 }
1645 }
1646
1647 return -1;
1648 }
1649
1650 static int page_sort_dimension__add(const char *tok, struct list_head *list)
1651 {
1652 struct sort_dimension *sort;
1653 int i;
1654
1655 for (i = 0; i < (int)ARRAY_SIZE(page_sorts); i++) {
1656 if (!strcmp(page_sorts[i]->name, tok)) {
1657 sort = memdup(page_sorts[i], sizeof(*page_sorts[i]));
1658 if (!sort) {
1659 pr_err("%s: memdup failed\n", __func__);
1660 return -1;
1661 }
1662 list_add_tail(&sort->list, list);
1663 return 0;
1664 }
1665 }
1666
1667 return -1;
1668 }
1669
1670 static int setup_slab_sorting(struct list_head *sort_list, const char *arg)
1671 {
1672 char *tok;
1673 char *str = strdup(arg);
1674 char *pos = str;
1675
1676 if (!str) {
1677 pr_err("%s: strdup failed\n", __func__);
1678 return -1;
1679 }
1680
1681 while (true) {
1682 tok = strsep(&pos, ",");
1683 if (!tok)
1684 break;
1685 if (slab_sort_dimension__add(tok, sort_list) < 0) {
1686 error("Unknown slab --sort key: '%s'", tok);
1687 free(str);
1688 return -1;
1689 }
1690 }
1691
1692 free(str);
1693 return 0;
1694 }
1695
1696 static int setup_page_sorting(struct list_head *sort_list, const char *arg)
1697 {
1698 char *tok;
1699 char *str = strdup(arg);
1700 char *pos = str;
1701
1702 if (!str) {
1703 pr_err("%s: strdup failed\n", __func__);
1704 return -1;
1705 }
1706
1707 while (true) {
1708 tok = strsep(&pos, ",");
1709 if (!tok)
1710 break;
1711 if (page_sort_dimension__add(tok, sort_list) < 0) {
1712 error("Unknown page --sort key: '%s'", tok);
1713 free(str);
1714 return -1;
1715 }
1716 }
1717
1718 free(str);
1719 return 0;
1720 }
1721
1722 static int parse_sort_opt(const struct option *opt __maybe_unused,
1723 const char *arg, int unset __maybe_unused)
1724 {
1725 if (!arg)
1726 return -1;
1727
1728 if (kmem_page > kmem_slab ||
1729 (kmem_page == 0 && kmem_slab == 0 && kmem_default == KMEM_PAGE)) {
1730 if (caller_flag > alloc_flag)
1731 return setup_page_sorting(&page_caller_sort, arg);
1732 else
1733 return setup_page_sorting(&page_alloc_sort, arg);
1734 } else {
1735 if (caller_flag > alloc_flag)
1736 return setup_slab_sorting(&slab_caller_sort, arg);
1737 else
1738 return setup_slab_sorting(&slab_alloc_sort, arg);
1739 }
1740
1741 return 0;
1742 }
1743
1744 static int parse_caller_opt(const struct option *opt __maybe_unused,
1745 const char *arg __maybe_unused,
1746 int unset __maybe_unused)
1747 {
1748 caller_flag = (alloc_flag + 1);
1749 return 0;
1750 }
1751
1752 static int parse_alloc_opt(const struct option *opt __maybe_unused,
1753 const char *arg __maybe_unused,
1754 int unset __maybe_unused)
1755 {
1756 alloc_flag = (caller_flag + 1);
1757 return 0;
1758 }
1759
1760 static int parse_slab_opt(const struct option *opt __maybe_unused,
1761 const char *arg __maybe_unused,
1762 int unset __maybe_unused)
1763 {
1764 kmem_slab = (kmem_page + 1);
1765 return 0;
1766 }
1767
1768 static int parse_page_opt(const struct option *opt __maybe_unused,
1769 const char *arg __maybe_unused,
1770 int unset __maybe_unused)
1771 {
1772 kmem_page = (kmem_slab + 1);
1773 return 0;
1774 }
1775
1776 static int parse_line_opt(const struct option *opt __maybe_unused,
1777 const char *arg, int unset __maybe_unused)
1778 {
1779 int lines;
1780
1781 if (!arg)
1782 return -1;
1783
1784 lines = strtoul(arg, NULL, 10);
1785
1786 if (caller_flag > alloc_flag)
1787 caller_lines = lines;
1788 else
1789 alloc_lines = lines;
1790
1791 return 0;
1792 }
1793
1794 static int __cmd_record(int argc, const char **argv)
1795 {
1796 const char * const record_args[] = {
1797 "record", "-a", "-R", "-c", "1",
1798 };
1799 const char * const slab_events[] = {
1800 "-e", "kmem:kmalloc",
1801 "-e", "kmem:kmalloc_node",
1802 "-e", "kmem:kfree",
1803 "-e", "kmem:kmem_cache_alloc",
1804 "-e", "kmem:kmem_cache_alloc_node",
1805 "-e", "kmem:kmem_cache_free",
1806 };
1807 const char * const page_events[] = {
1808 "-e", "kmem:mm_page_alloc",
1809 "-e", "kmem:mm_page_free",
1810 };
1811 unsigned int rec_argc, i, j;
1812 const char **rec_argv;
1813
1814 rec_argc = ARRAY_SIZE(record_args) + argc - 1;
1815 if (kmem_slab)
1816 rec_argc += ARRAY_SIZE(slab_events);
1817 if (kmem_page)
1818 rec_argc += ARRAY_SIZE(page_events) + 1; /* for -g */
1819
1820 rec_argv = calloc(rec_argc + 1, sizeof(char *));
1821
1822 if (rec_argv == NULL)
1823 return -ENOMEM;
1824
1825 for (i = 0; i < ARRAY_SIZE(record_args); i++)
1826 rec_argv[i] = strdup(record_args[i]);
1827
1828 if (kmem_slab) {
1829 for (j = 0; j < ARRAY_SIZE(slab_events); j++, i++)
1830 rec_argv[i] = strdup(slab_events[j]);
1831 }
1832 if (kmem_page) {
1833 rec_argv[i++] = strdup("-g");
1834
1835 for (j = 0; j < ARRAY_SIZE(page_events); j++, i++)
1836 rec_argv[i] = strdup(page_events[j]);
1837 }
1838
1839 for (j = 1; j < (unsigned int)argc; j++, i++)
1840 rec_argv[i] = argv[j];
1841
1842 return cmd_record(i, rec_argv, NULL);
1843 }
1844
1845 static int kmem_config(const char *var, const char *value, void *cb __maybe_unused)
1846 {
1847 if (!strcmp(var, "kmem.default")) {
1848 if (!strcmp(value, "slab"))
1849 kmem_default = KMEM_SLAB;
1850 else if (!strcmp(value, "page"))
1851 kmem_default = KMEM_PAGE;
1852 else
1853 pr_err("invalid default value ('slab' or 'page' required): %s\n",
1854 value);
1855 return 0;
1856 }
1857
1858 return 0;
1859 }
1860
1861 int cmd_kmem(int argc, const char **argv, const char *prefix __maybe_unused)
1862 {
1863 const char * const default_slab_sort = "frag,hit,bytes";
1864 const char * const default_page_sort = "bytes,hit";
1865 struct perf_data_file file = {
1866 .mode = PERF_DATA_MODE_READ,
1867 };
1868 const struct option kmem_options[] = {
1869 OPT_STRING('i', "input", &input_name, "file", "input file name"),
1870 OPT_INCR('v', "verbose", &verbose,
1871 "be more verbose (show symbol address, etc)"),
1872 OPT_CALLBACK_NOOPT(0, "caller", NULL, NULL,
1873 "show per-callsite statistics", parse_caller_opt),
1874 OPT_CALLBACK_NOOPT(0, "alloc", NULL, NULL,
1875 "show per-allocation statistics", parse_alloc_opt),
1876 OPT_CALLBACK('s', "sort", NULL, "key[,key2...]",
1877 "sort by keys: ptr, callsite, bytes, hit, pingpong, frag, "
1878 "page, order, migtype, gfp", parse_sort_opt),
1879 OPT_CALLBACK('l', "line", NULL, "num", "show n lines", parse_line_opt),
1880 OPT_BOOLEAN(0, "raw-ip", &raw_ip, "show raw ip instead of symbol"),
1881 OPT_BOOLEAN('f', "force", &file.force, "don't complain, do it"),
1882 OPT_CALLBACK_NOOPT(0, "slab", NULL, NULL, "Analyze slab allocator",
1883 parse_slab_opt),
1884 OPT_CALLBACK_NOOPT(0, "page", NULL, NULL, "Analyze page allocator",
1885 parse_page_opt),
1886 OPT_BOOLEAN(0, "live", &live_page, "Show live page stat"),
1887 OPT_END()
1888 };
1889 const char *const kmem_subcommands[] = { "record", "stat", NULL };
1890 const char *kmem_usage[] = {
1891 NULL,
1892 NULL
1893 };
1894 struct perf_session *session;
1895 int ret = -1;
1896 const char errmsg[] = "No %s allocation events found. Have you run 'perf kmem record --%s'?\n";
1897
1898 perf_config(kmem_config, NULL);
1899 argc = parse_options_subcommand(argc, argv, kmem_options,
1900 kmem_subcommands, kmem_usage, 0);
1901
1902 if (!argc)
1903 usage_with_options(kmem_usage, kmem_options);
1904
1905 if (kmem_slab == 0 && kmem_page == 0) {
1906 if (kmem_default == KMEM_SLAB)
1907 kmem_slab = 1;
1908 else
1909 kmem_page = 1;
1910 }
1911
1912 if (!strncmp(argv[0], "rec", 3)) {
1913 symbol__init(NULL);
1914 return __cmd_record(argc, argv);
1915 }
1916
1917 file.path = input_name;
1918
1919 kmem_session = session = perf_session__new(&file, false, &perf_kmem);
1920 if (session == NULL)
1921 return -1;
1922
1923 if (kmem_slab) {
1924 if (!perf_evlist__find_tracepoint_by_name(session->evlist,
1925 "kmem:kmalloc")) {
1926 pr_err(errmsg, "slab", "slab");
1927 goto out_delete;
1928 }
1929 }
1930
1931 if (kmem_page) {
1932 struct perf_evsel *evsel;
1933
1934 evsel = perf_evlist__find_tracepoint_by_name(session->evlist,
1935 "kmem:mm_page_alloc");
1936 if (evsel == NULL) {
1937 pr_err(errmsg, "page", "page");
1938 goto out_delete;
1939 }
1940
1941 kmem_page_size = pevent_get_page_size(evsel->tp_format->pevent);
1942 symbol_conf.use_callchain = true;
1943 }
1944
1945 symbol__init(&session->header.env);
1946
1947 if (!strcmp(argv[0], "stat")) {
1948 setlocale(LC_ALL, "");
1949
1950 if (cpu__setup_cpunode_map())
1951 goto out_delete;
1952
1953 if (list_empty(&slab_caller_sort))
1954 setup_slab_sorting(&slab_caller_sort, default_slab_sort);
1955 if (list_empty(&slab_alloc_sort))
1956 setup_slab_sorting(&slab_alloc_sort, default_slab_sort);
1957 if (list_empty(&page_caller_sort))
1958 setup_page_sorting(&page_caller_sort, default_page_sort);
1959 if (list_empty(&page_alloc_sort))
1960 setup_page_sorting(&page_alloc_sort, default_page_sort);
1961
1962 if (kmem_page) {
1963 setup_page_sorting(&page_alloc_sort_input,
1964 "page,order,migtype,gfp");
1965 setup_page_sorting(&page_caller_sort_input,
1966 "callsite,order,migtype,gfp");
1967 }
1968 ret = __cmd_kmem(session);
1969 } else
1970 usage_with_options(kmem_usage, kmem_options);
1971
1972 out_delete:
1973 perf_session__delete(session);
1974
1975 return ret;
1976 }
1977
ubuntu-bionic-kernel mirror