4 #include "util/evlist.h"
5 #include "util/evsel.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"
15 #include <subcmd/parse-options.h>
16 #include "util/trace-event.h"
17 #include "util/data.h"
18 #include "util/cpumap.h"
20 #include "util/debug.h"
22 #include <linux/rbtree.h>
23 #include <linux/string.h>
30 static long kmem_page_size;
34 } kmem_default = KMEM_SLAB; /* for backward compatibility */
37 typedef int (*sort_fn_t)(void *, void *);
39 static int alloc_flag;
40 static int caller_flag;
42 static int alloc_lines = -1;
43 static int caller_lines = -1;
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;
65 static unsigned long total_requested, total_allocated;
66 static unsigned long nr_allocs, nr_cross_allocs;
68 static int insert_alloc_stat(unsigned long call_site, unsigned long ptr,
69 int bytes_req, int bytes_alloc, int cpu)
71 struct rb_node **node = &root_alloc_stat.rb_node;
72 struct rb_node *parent = NULL;
73 struct alloc_stat *data = NULL;
77 data = rb_entry(*node, struct alloc_stat, node);
80 node = &(*node)->rb_right;
81 else if (ptr < data->ptr)
82 node = &(*node)->rb_left;
87 if (data && data->ptr == ptr) {
89 data->bytes_req += bytes_req;
90 data->bytes_alloc += bytes_alloc;
92 data = malloc(sizeof(*data));
94 pr_err("%s: malloc failed\n", __func__);
100 data->bytes_req = bytes_req;
101 data->bytes_alloc = bytes_alloc;
103 rb_link_node(&data->node, parent, node);
104 rb_insert_color(&data->node, &root_alloc_stat);
106 data->call_site = call_site;
107 data->alloc_cpu = cpu;
111 static int insert_caller_stat(unsigned long call_site,
112 int bytes_req, int bytes_alloc)
114 struct rb_node **node = &root_caller_stat.rb_node;
115 struct rb_node *parent = NULL;
116 struct alloc_stat *data = NULL;
120 data = rb_entry(*node, struct alloc_stat, node);
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;
130 if (data && data->call_site == call_site) {
132 data->bytes_req += bytes_req;
133 data->bytes_alloc += bytes_alloc;
135 data = malloc(sizeof(*data));
137 pr_err("%s: malloc failed\n", __func__);
140 data->call_site = call_site;
143 data->bytes_req = bytes_req;
144 data->bytes_alloc = bytes_alloc;
146 rb_link_node(&data->node, parent, node);
147 rb_insert_color(&data->node, &root_caller_stat);
153 static int perf_evsel__process_alloc_event(struct perf_evsel *evsel,
154 struct perf_sample *sample)
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");
161 if (insert_alloc_stat(call_site, ptr, bytes_req, bytes_alloc, sample->cpu) ||
162 insert_caller_stat(call_site, bytes_req, bytes_alloc))
165 total_requested += bytes_req;
166 total_allocated += bytes_alloc;
172 static int perf_evsel__process_alloc_node_event(struct perf_evsel *evsel,
173 struct perf_sample *sample)
175 int ret = perf_evsel__process_alloc_event(evsel, sample);
178 int node1 = cpu__get_node(sample->cpu),
179 node2 = perf_evsel__intval(evsel, sample, "node");
188 static int ptr_cmp(void *, void *);
189 static int slab_callsite_cmp(void *, void *);
191 static struct alloc_stat *search_alloc_stat(unsigned long ptr,
192 unsigned long call_site,
193 struct rb_root *root,
196 struct rb_node *node = root->rb_node;
197 struct alloc_stat key = { .ptr = ptr, .call_site = call_site };
200 struct alloc_stat *data;
203 data = rb_entry(node, struct alloc_stat, node);
205 cmp = sort_fn(&key, data);
207 node = node->rb_left;
209 node = node->rb_right;
216 static int perf_evsel__process_free_event(struct perf_evsel *evsel,
217 struct perf_sample *sample)
219 unsigned long ptr = perf_evsel__intval(evsel, sample, "ptr");
220 struct alloc_stat *s_alloc, *s_caller;
222 s_alloc = search_alloc_stat(ptr, 0, &root_alloc_stat, ptr_cmp);
226 if ((short)sample->cpu != s_alloc->alloc_cpu) {
229 s_caller = search_alloc_stat(0, s_alloc->call_site,
234 s_caller->pingpong++;
236 s_alloc->alloc_cpu = -1;
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;
251 static bool live_page;
252 static struct perf_session *kmem_session;
254 #define MAX_MIGRATE_TYPES 6
255 #define MAX_PAGE_ORDER 11
257 static int order_stats[MAX_PAGE_ORDER][MAX_MIGRATE_TYPES];
265 unsigned migrate_type;
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;
284 static int nr_alloc_funcs;
285 static struct alloc_func *alloc_func_list;
287 static int funcmp(const void *a, const void *b)
289 const struct alloc_func *fa = a;
290 const struct alloc_func *fb = b;
292 if (fa->start > fb->start)
298 static int callcmp(const void *a, const void *b)
300 const struct alloc_func *fa = a;
301 const struct alloc_func *fb = b;
303 if (fb->start <= fa->start && fa->end < fb->end)
306 if (fa->start > fb->start)
312 static int build_alloc_func_list(void)
315 struct map *kernel_map;
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?";
323 ret = regcomp(&alloc_func_regex, pattern, REG_EXTENDED);
327 regerror(ret, &alloc_func_regex, err, sizeof(err));
328 pr_err("Invalid regex: %s\n%s", pattern, err);
332 kernel_map = machine__kernel_map(machine);
333 if (map__load(kernel_map, NULL) < 0) {
334 pr_err("cannot load kernel map\n");
338 map__for_each_symbol(kernel_map, sym, node) {
339 if (regexec(&alloc_func_regex, sym->name, 0, NULL, 0))
342 func = realloc(alloc_func_list,
343 (nr_alloc_funcs + 1) * sizeof(*func));
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;
352 alloc_func_list = func;
356 qsort(alloc_func_list, nr_alloc_funcs, sizeof(*func), funcmp);
358 regfree(&alloc_func_regex);
363 * Find first non-memory allocation function from callchain.
364 * The allocation functions are in the 'alloc_func_list'.
366 static u64 find_callsite(struct perf_evsel *evsel, struct perf_sample *sample)
368 struct addr_location al;
369 struct machine *machine = &kmem_session->machines.host;
370 struct callchain_cursor_node *node;
372 if (alloc_func_list == NULL) {
373 if (build_alloc_func_list() < 0)
377 al.thread = machine__findnew_thread(machine, sample->pid, sample->tid);
378 sample__resolve_callchain(sample, &callchain_cursor, NULL, evsel, &al, 16);
380 callchain_cursor_commit(&callchain_cursor);
382 struct alloc_func key, *caller;
385 node = callchain_cursor_current(&callchain_cursor);
389 key.start = key.end = node->ip;
390 caller = bsearch(&key, alloc_func_list, nr_alloc_funcs,
391 sizeof(key), callcmp);
395 addr = map__unmap_ip(node->map, node->ip);
401 pr_debug3("skipping alloc function: %s\n", caller->name);
403 callchain_cursor_advance(&callchain_cursor);
407 pr_debug2("unknown callsite: %"PRIx64 "\n", sample->ip);
411 struct sort_dimension {
414 struct list_head list;
417 static LIST_HEAD(page_alloc_sort_input);
418 static LIST_HEAD(page_caller_sort_input);
420 static struct page_stat *
421 __page_stat__findnew_page(struct page_stat *pstat, bool create)
423 struct rb_node **node = &page_live_tree.rb_node;
424 struct rb_node *parent = NULL;
425 struct page_stat *data;
431 data = rb_entry(*node, struct page_stat, node);
433 cmp = data->page - pstat->page;
435 node = &parent->rb_left;
437 node = &parent->rb_right;
445 data = zalloc(sizeof(*data));
447 data->page = pstat->page;
448 data->order = pstat->order;
449 data->gfp_flags = pstat->gfp_flags;
450 data->migrate_type = pstat->migrate_type;
452 rb_link_node(&data->node, parent, node);
453 rb_insert_color(&data->node, &page_live_tree);
459 static struct page_stat *page_stat__find_page(struct page_stat *pstat)
461 return __page_stat__findnew_page(pstat, false);
464 static struct page_stat *page_stat__findnew_page(struct page_stat *pstat)
466 return __page_stat__findnew_page(pstat, true);
469 static struct page_stat *
470 __page_stat__findnew_alloc(struct page_stat *pstat, bool create)
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;
481 data = rb_entry(*node, struct page_stat, node);
483 list_for_each_entry(sort, &page_alloc_sort_input, list) {
484 cmp = sort->cmp(pstat, data);
490 node = &parent->rb_left;
492 node = &parent->rb_right;
500 data = zalloc(sizeof(*data));
502 data->page = pstat->page;
503 data->order = pstat->order;
504 data->gfp_flags = pstat->gfp_flags;
505 data->migrate_type = pstat->migrate_type;
507 rb_link_node(&data->node, parent, node);
508 rb_insert_color(&data->node, &page_alloc_tree);
514 static struct page_stat *page_stat__find_alloc(struct page_stat *pstat)
516 return __page_stat__findnew_alloc(pstat, false);
519 static struct page_stat *page_stat__findnew_alloc(struct page_stat *pstat)
521 return __page_stat__findnew_alloc(pstat, true);
524 static struct page_stat *
525 __page_stat__findnew_caller(struct page_stat *pstat, bool create)
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;
536 data = rb_entry(*node, struct page_stat, node);
538 list_for_each_entry(sort, &page_caller_sort_input, list) {
539 cmp = sort->cmp(pstat, data);
545 node = &parent->rb_left;
547 node = &parent->rb_right;
555 data = zalloc(sizeof(*data));
557 data->callsite = pstat->callsite;
558 data->order = pstat->order;
559 data->gfp_flags = pstat->gfp_flags;
560 data->migrate_type = pstat->migrate_type;
562 rb_link_node(&data->node, parent, node);
563 rb_insert_color(&data->node, &page_caller_tree);
569 static struct page_stat *page_stat__find_caller(struct page_stat *pstat)
571 return __page_stat__findnew_caller(pstat, false);
574 static struct page_stat *page_stat__findnew_caller(struct page_stat *pstat)
576 return __page_stat__findnew_caller(pstat, true);
579 static bool valid_page(u64 pfn_or_page)
581 if (use_pfn && pfn_or_page == -1UL)
583 if (!use_pfn && pfn_or_page == 0)
591 char *human_readable;
594 static struct gfp_flag *gfps;
597 static int gfpcmp(const void *a, const void *b)
599 const struct gfp_flag *fa = a;
600 const struct gfp_flag *fb = b;
602 return fa->flags - fb->flags;
605 /* see include/trace/events/mmflags.h */
606 static const struct {
607 const char *original;
609 } gfp_compact_table[] = {
610 { "GFP_TRANSHUGE", "THP" },
611 { "GFP_TRANSHUGE_LIGHT", "THL" },
612 { "GFP_HIGHUSER_MOVABLE", "HUM" },
613 { "GFP_HIGHUSER", "HU" },
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" },
623 { "__GFP_HIGHMEM", "HM" },
624 { "GFP_DMA32", "D32" },
625 { "__GFP_HIGH", "H" },
626 { "__GFP_ATOMIC", "_A" },
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" },
651 static size_t max_gfp_len;
653 static char *compact_gfp_flags(char *gfp_flags)
655 char *orig_flags = strdup(gfp_flags);
656 char *new_flags = NULL;
657 char *str, *pos = NULL;
660 if (orig_flags == NULL)
663 str = strtok_r(orig_flags, "|", &pos);
669 for (i = 0; i < ARRAY_SIZE(gfp_compact_table); i++) {
670 if (strcmp(gfp_compact_table[i].original, str))
673 cpt = gfp_compact_table[i].compact;
674 new = realloc(new_flags, len + strlen(cpt) + 2);
683 strcpy(new_flags, cpt);
685 strcat(new_flags, "|");
686 strcat(new_flags, cpt);
693 str = strtok_r(NULL, "|", &pos);
696 if (max_gfp_len < len)
703 static char *compact_gfp_string(unsigned long gfp_flags)
705 struct gfp_flag key = {
708 struct gfp_flag *gfp;
710 gfp = bsearch(&key, gfps, nr_gfps, sizeof(*gfps), gfpcmp);
712 return gfp->compact_str;
717 static int parse_gfp_flags(struct perf_evsel *evsel, struct perf_sample *sample,
718 unsigned int gfp_flags)
720 struct pevent_record record = {
722 .data = sample->raw_data,
723 .size = sample->raw_size,
725 struct trace_seq seq;
726 char *str, *pos = NULL;
729 struct gfp_flag key = {
733 if (bsearch(&key, gfps, nr_gfps, sizeof(*gfps), gfpcmp))
737 trace_seq_init(&seq);
738 pevent_event_info(&seq, evsel->tp_format, &record);
740 str = strtok_r(seq.buffer, " ", &pos);
742 if (!strncmp(str, "gfp_flags=", 10)) {
743 struct gfp_flag *new;
745 new = realloc(gfps, (nr_gfps + 1) * sizeof(*gfps));
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)
758 qsort(gfps, nr_gfps, sizeof(*gfps), gfpcmp);
761 str = strtok_r(NULL, " ", &pos);
764 trace_seq_destroy(&seq);
768 static int perf_evsel__process_page_alloc_event(struct perf_evsel *evsel,
769 struct perf_sample *sample)
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,
776 u64 bytes = kmem_page_size << order;
778 struct page_stat *pstat;
779 struct page_stat this = {
781 .gfp_flags = gfp_flags,
782 .migrate_type = migrate_type,
786 page = perf_evsel__intval(evsel, sample, "pfn");
788 page = perf_evsel__intval(evsel, sample, "page");
791 total_page_alloc_bytes += bytes;
793 if (!valid_page(page)) {
795 total_page_fail_bytes += bytes;
800 if (parse_gfp_flags(evsel, sample, gfp_flags) < 0)
803 callsite = find_callsite(evsel, sample);
806 * This is to find the current page (with correct gfp flags and
807 * migrate type) at free event.
810 pstat = page_stat__findnew_page(&this);
815 pstat->alloc_bytes += bytes;
816 pstat->callsite = callsite;
819 pstat = page_stat__findnew_alloc(&this);
824 pstat->alloc_bytes += bytes;
825 pstat->callsite = callsite;
828 this.callsite = callsite;
829 pstat = page_stat__findnew_caller(&this);
834 pstat->alloc_bytes += bytes;
836 order_stats[order][migrate_type]++;
841 static int perf_evsel__process_page_free_event(struct perf_evsel *evsel,
842 struct perf_sample *sample)
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 = {
853 page = perf_evsel__intval(evsel, sample, "pfn");
855 page = perf_evsel__intval(evsel, sample, "page");
858 total_page_free_bytes += bytes;
861 pstat = page_stat__find_page(&this);
863 pr_debug2("missing free at page %"PRIx64" (order: %d)\n",
867 total_page_nomatch_bytes += bytes;
872 this.gfp_flags = pstat->gfp_flags;
873 this.migrate_type = pstat->migrate_type;
874 this.callsite = pstat->callsite;
876 rb_erase(&pstat->node, &page_live_tree);
880 order_stats[this.order][this.migrate_type]--;
882 pstat = page_stat__find_alloc(&this);
887 pstat->free_bytes += bytes;
890 pstat = page_stat__find_caller(&this);
895 pstat->free_bytes += bytes;
899 pstat->alloc_bytes -= bytes;
901 if (pstat->nr_alloc == 0) {
902 rb_erase(&pstat->node, &page_caller_tree);
910 typedef int (*tracepoint_handler)(struct perf_evsel *evsel,
911 struct perf_sample *sample);
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)
920 struct thread *thread = machine__findnew_thread(machine, sample->pid,
923 if (thread == NULL) {
924 pr_debug("problem processing %d event, skipping it.\n",
929 dump_printf(" ... thread: %s:%d\n", thread__comm_str(thread), thread->tid);
931 if (evsel->handler != NULL) {
932 tracepoint_handler f = evsel->handler;
933 err = f(evsel, sample);
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,
949 static double fragmentation(unsigned long n_req, unsigned long n_alloc)
954 return 100.0 - (100.0 * n_req / n_alloc);
957 static void __print_slab_result(struct rb_root *root,
958 struct perf_session *session,
959 int n_lines, int is_caller)
961 struct rb_node *next;
962 struct machine *machine = &session->machines.host;
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);
969 next = rb_first(root);
971 while (next && n_lines--) {
972 struct alloc_stat *data = rb_entry(next, struct alloc_stat,
974 struct symbol *sym = NULL;
980 addr = data->call_site;
982 sym = machine__find_kernel_function(machine, addr, &map, NULL);
987 snprintf(buf, sizeof(buf), "%s+%" PRIx64 "", sym->name,
988 addr - map->unmap_ip(map, sym->start));
990 snprintf(buf, sizeof(buf), "%#" PRIx64 "", addr);
991 printf(" %-34s |", buf);
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));
1002 next = rb_next(next);
1006 printf(" ... | ... | ... | ... | ... | ... \n");
1008 printf("%.105s\n", graph_dotted_line);
1011 static const char * const migrate_type_str[] = {
1020 static void __print_page_alloc_result(struct perf_session *session, int n_lines)
1022 struct rb_node *next = rb_first(&page_alloc_sorted);
1023 struct machine *machine = &session->machines.host;
1025 int gfp_len = max(strlen("GFP flags"), max_gfp_len);
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);
1034 format = " %16llu | %'16llu | %'9d | %5d | %8s | %-*s | %s\n";
1036 format = " %016llx | %'16llu | %'9d | %5d | %8s | %-*s | %s\n";
1038 while (next && n_lines--) {
1039 struct page_stat *data;
1045 data = rb_entry(next, struct page_stat, node);
1046 sym = machine__find_kernel_function(machine, data->callsite,
1048 if (sym && sym->name)
1051 scnprintf(buf, sizeof(buf), "%"PRIx64, data->callsite);
1053 printf(format, (unsigned long long)data->page,
1054 (unsigned long long)data->alloc_bytes / 1024,
1055 data->nr_alloc, data->order,
1056 migrate_type_str[data->migrate_type],
1057 gfp_len, compact_gfp_string(data->gfp_flags), caller);
1059 next = rb_next(next);
1062 if (n_lines == -1) {
1063 printf(" ... | ... | ... | ... | ... | %-*s | ...\n",
1067 printf("%.105s\n", graph_dotted_line);
1070 static void __print_page_caller_result(struct perf_session *session, int n_lines)
1072 struct rb_node *next = rb_first(&page_caller_sorted);
1073 struct machine *machine = &session->machines.host;
1074 int gfp_len = max(strlen("GFP flags"), max_gfp_len);
1076 printf("\n%.105s\n", graph_dotted_line);
1077 printf(" %5s alloc (KB) | Hits | Order | Mig.type | %-*s | Callsite\n",
1078 live_page ? "Live" : "Total", gfp_len, "GFP flags");
1079 printf("%.105s\n", graph_dotted_line);
1081 while (next && n_lines--) {
1082 struct page_stat *data;
1088 data = rb_entry(next, struct page_stat, node);
1089 sym = machine__find_kernel_function(machine, data->callsite,
1091 if (sym && sym->name)
1094 scnprintf(buf, sizeof(buf), "%"PRIx64, data->callsite);
1096 printf(" %'16llu | %'9d | %5d | %8s | %-*s | %s\n",
1097 (unsigned long long)data->alloc_bytes / 1024,
1098 data->nr_alloc, data->order,
1099 migrate_type_str[data->migrate_type],
1100 gfp_len, compact_gfp_string(data->gfp_flags), caller);
1102 next = rb_next(next);
1105 if (n_lines == -1) {
1106 printf(" ... | ... | ... | ... | %-*s | ...\n",
1110 printf("%.105s\n", graph_dotted_line);
1113 static void print_gfp_flags(void)
1118 printf("# GFP flags\n");
1119 printf("# ---------\n");
1120 for (i = 0; i < nr_gfps; i++) {
1121 printf("# %08x: %*s: %s\n", gfps[i].flags,
1122 (int) max_gfp_len, gfps[i].compact_str,
1123 gfps[i].human_readable);
1127 static void print_slab_summary(void)
1129 printf("\nSUMMARY (SLAB allocator)");
1130 printf("\n========================\n");
1131 printf("Total bytes requested: %'lu\n", total_requested);
1132 printf("Total bytes allocated: %'lu\n", total_allocated);
1133 printf("Total bytes wasted on internal fragmentation: %'lu\n",
1134 total_allocated - total_requested);
1135 printf("Internal fragmentation: %f%%\n",
1136 fragmentation(total_requested, total_allocated));
1137 printf("Cross CPU allocations: %'lu/%'lu\n", nr_cross_allocs, nr_allocs);
1140 static void print_page_summary(void)
1143 u64 nr_alloc_freed = nr_page_frees - nr_page_nomatch;
1144 u64 total_alloc_freed_bytes = total_page_free_bytes - total_page_nomatch_bytes;
1146 printf("\nSUMMARY (page allocator)");
1147 printf("\n========================\n");
1148 printf("%-30s: %'16lu [ %'16"PRIu64" KB ]\n", "Total allocation requests",
1149 nr_page_allocs, total_page_alloc_bytes / 1024);
1150 printf("%-30s: %'16lu [ %'16"PRIu64" KB ]\n", "Total free requests",
1151 nr_page_frees, total_page_free_bytes / 1024);
1154 printf("%-30s: %'16"PRIu64" [ %'16"PRIu64" KB ]\n", "Total alloc+freed requests",
1155 nr_alloc_freed, (total_alloc_freed_bytes) / 1024);
1156 printf("%-30s: %'16"PRIu64" [ %'16"PRIu64" KB ]\n", "Total alloc-only requests",
1157 nr_page_allocs - nr_alloc_freed,
1158 (total_page_alloc_bytes - total_alloc_freed_bytes) / 1024);
1159 printf("%-30s: %'16lu [ %'16"PRIu64" KB ]\n", "Total free-only requests",
1160 nr_page_nomatch, total_page_nomatch_bytes / 1024);
1163 printf("%-30s: %'16lu [ %'16"PRIu64" KB ]\n", "Total allocation failures",
1164 nr_page_fails, total_page_fail_bytes / 1024);
1167 printf("%5s %12s %12s %12s %12s %12s\n", "Order", "Unmovable",
1168 "Reclaimable", "Movable", "Reserved", "CMA/Isolated");
1169 printf("%.5s %.12s %.12s %.12s %.12s %.12s\n", graph_dotted_line,
1170 graph_dotted_line, graph_dotted_line, graph_dotted_line,
1171 graph_dotted_line, graph_dotted_line);
1173 for (o = 0; o < MAX_PAGE_ORDER; o++) {
1175 for (m = 0; m < MAX_MIGRATE_TYPES - 1; m++) {
1176 if (order_stats[o][m])
1177 printf(" %'12d", order_stats[o][m]);
1179 printf(" %12c", '.');
1185 static void print_slab_result(struct perf_session *session)
1188 __print_slab_result(&root_caller_sorted, session, caller_lines, 1);
1190 __print_slab_result(&root_alloc_sorted, session, alloc_lines, 0);
1191 print_slab_summary();
1194 static void print_page_result(struct perf_session *session)
1196 if (caller_flag || alloc_flag)
1199 __print_page_caller_result(session, caller_lines);
1201 __print_page_alloc_result(session, alloc_lines);
1202 print_page_summary();
1205 static void print_result(struct perf_session *session)
1208 print_slab_result(session);
1210 print_page_result(session);
1213 static LIST_HEAD(slab_caller_sort);
1214 static LIST_HEAD(slab_alloc_sort);
1215 static LIST_HEAD(page_caller_sort);
1216 static LIST_HEAD(page_alloc_sort);
1218 static void sort_slab_insert(struct rb_root *root, struct alloc_stat *data,
1219 struct list_head *sort_list)
1221 struct rb_node **new = &(root->rb_node);
1222 struct rb_node *parent = NULL;
1223 struct sort_dimension *sort;
1226 struct alloc_stat *this;
1229 this = rb_entry(*new, struct alloc_stat, node);
1232 list_for_each_entry(sort, sort_list, list) {
1233 cmp = sort->cmp(data, this);
1239 new = &((*new)->rb_left);
1241 new = &((*new)->rb_right);
1244 rb_link_node(&data->node, parent, new);
1245 rb_insert_color(&data->node, root);
1248 static void __sort_slab_result(struct rb_root *root, struct rb_root *root_sorted,
1249 struct list_head *sort_list)
1251 struct rb_node *node;
1252 struct alloc_stat *data;
1255 node = rb_first(root);
1259 rb_erase(node, root);
1260 data = rb_entry(node, struct alloc_stat, node);
1261 sort_slab_insert(root_sorted, data, sort_list);
1265 static void sort_page_insert(struct rb_root *root, struct page_stat *data,
1266 struct list_head *sort_list)
1268 struct rb_node **new = &root->rb_node;
1269 struct rb_node *parent = NULL;
1270 struct sort_dimension *sort;
1273 struct page_stat *this;
1276 this = rb_entry(*new, struct page_stat, node);
1279 list_for_each_entry(sort, sort_list, list) {
1280 cmp = sort->cmp(data, this);
1286 new = &parent->rb_left;
1288 new = &parent->rb_right;
1291 rb_link_node(&data->node, parent, new);
1292 rb_insert_color(&data->node, root);
1295 static void __sort_page_result(struct rb_root *root, struct rb_root *root_sorted,
1296 struct list_head *sort_list)
1298 struct rb_node *node;
1299 struct page_stat *data;
1302 node = rb_first(root);
1306 rb_erase(node, root);
1307 data = rb_entry(node, struct page_stat, node);
1308 sort_page_insert(root_sorted, data, sort_list);
1312 static void sort_result(void)
1315 __sort_slab_result(&root_alloc_stat, &root_alloc_sorted,
1317 __sort_slab_result(&root_caller_stat, &root_caller_sorted,
1322 __sort_page_result(&page_live_tree, &page_alloc_sorted,
1325 __sort_page_result(&page_alloc_tree, &page_alloc_sorted,
1328 __sort_page_result(&page_caller_tree, &page_caller_sorted,
1333 static int __cmd_kmem(struct perf_session *session)
1336 struct perf_evsel *evsel;
1337 const struct perf_evsel_str_handler kmem_tracepoints[] = {
1338 /* slab allocator */
1339 { "kmem:kmalloc", perf_evsel__process_alloc_event, },
1340 { "kmem:kmem_cache_alloc", perf_evsel__process_alloc_event, },
1341 { "kmem:kmalloc_node", perf_evsel__process_alloc_node_event, },
1342 { "kmem:kmem_cache_alloc_node", perf_evsel__process_alloc_node_event, },
1343 { "kmem:kfree", perf_evsel__process_free_event, },
1344 { "kmem:kmem_cache_free", perf_evsel__process_free_event, },
1345 /* page allocator */
1346 { "kmem:mm_page_alloc", perf_evsel__process_page_alloc_event, },
1347 { "kmem:mm_page_free", perf_evsel__process_page_free_event, },
1350 if (!perf_session__has_traces(session, "kmem record"))
1353 if (perf_session__set_tracepoints_handlers(session, kmem_tracepoints)) {
1354 pr_err("Initializing perf session tracepoint handlers failed\n");
1358 evlist__for_each_entry(session->evlist, evsel) {
1359 if (!strcmp(perf_evsel__name(evsel), "kmem:mm_page_alloc") &&
1360 perf_evsel__field(evsel, "pfn")) {
1367 err = perf_session__process_events(session);
1369 pr_err("error during process events: %d\n", err);
1373 print_result(session);
1378 /* slab sort keys */
1379 static int ptr_cmp(void *a, void *b)
1381 struct alloc_stat *l = a;
1382 struct alloc_stat *r = b;
1384 if (l->ptr < r->ptr)
1386 else if (l->ptr > r->ptr)
1391 static struct sort_dimension ptr_sort_dimension = {
1396 static int slab_callsite_cmp(void *a, void *b)
1398 struct alloc_stat *l = a;
1399 struct alloc_stat *r = b;
1401 if (l->call_site < r->call_site)
1403 else if (l->call_site > r->call_site)
1408 static struct sort_dimension callsite_sort_dimension = {
1410 .cmp = slab_callsite_cmp,
1413 static int hit_cmp(void *a, void *b)
1415 struct alloc_stat *l = a;
1416 struct alloc_stat *r = b;
1418 if (l->hit < r->hit)
1420 else if (l->hit > r->hit)
1425 static struct sort_dimension hit_sort_dimension = {
1430 static int bytes_cmp(void *a, void *b)
1432 struct alloc_stat *l = a;
1433 struct alloc_stat *r = b;
1435 if (l->bytes_alloc < r->bytes_alloc)
1437 else if (l->bytes_alloc > r->bytes_alloc)
1442 static struct sort_dimension bytes_sort_dimension = {
1447 static int frag_cmp(void *a, void *b)
1450 struct alloc_stat *l = a;
1451 struct alloc_stat *r = b;
1453 x = fragmentation(l->bytes_req, l->bytes_alloc);
1454 y = fragmentation(r->bytes_req, r->bytes_alloc);
1463 static struct sort_dimension frag_sort_dimension = {
1468 static int pingpong_cmp(void *a, void *b)
1470 struct alloc_stat *l = a;
1471 struct alloc_stat *r = b;
1473 if (l->pingpong < r->pingpong)
1475 else if (l->pingpong > r->pingpong)
1480 static struct sort_dimension pingpong_sort_dimension = {
1482 .cmp = pingpong_cmp,
1485 /* page sort keys */
1486 static int page_cmp(void *a, void *b)
1488 struct page_stat *l = a;
1489 struct page_stat *r = b;
1491 if (l->page < r->page)
1493 else if (l->page > r->page)
1498 static struct sort_dimension page_sort_dimension = {
1503 static int page_callsite_cmp(void *a, void *b)
1505 struct page_stat *l = a;
1506 struct page_stat *r = b;
1508 if (l->callsite < r->callsite)
1510 else if (l->callsite > r->callsite)
1515 static struct sort_dimension page_callsite_sort_dimension = {
1517 .cmp = page_callsite_cmp,
1520 static int page_hit_cmp(void *a, void *b)
1522 struct page_stat *l = a;
1523 struct page_stat *r = b;
1525 if (l->nr_alloc < r->nr_alloc)
1527 else if (l->nr_alloc > r->nr_alloc)
1532 static struct sort_dimension page_hit_sort_dimension = {
1534 .cmp = page_hit_cmp,
1537 static int page_bytes_cmp(void *a, void *b)
1539 struct page_stat *l = a;
1540 struct page_stat *r = b;
1542 if (l->alloc_bytes < r->alloc_bytes)
1544 else if (l->alloc_bytes > r->alloc_bytes)
1549 static struct sort_dimension page_bytes_sort_dimension = {
1551 .cmp = page_bytes_cmp,
1554 static int page_order_cmp(void *a, void *b)
1556 struct page_stat *l = a;
1557 struct page_stat *r = b;
1559 if (l->order < r->order)
1561 else if (l->order > r->order)
1566 static struct sort_dimension page_order_sort_dimension = {
1568 .cmp = page_order_cmp,
1571 static int migrate_type_cmp(void *a, void *b)
1573 struct page_stat *l = a;
1574 struct page_stat *r = b;
1576 /* for internal use to find free'd page */
1577 if (l->migrate_type == -1U)
1580 if (l->migrate_type < r->migrate_type)
1582 else if (l->migrate_type > r->migrate_type)
1587 static struct sort_dimension migrate_type_sort_dimension = {
1589 .cmp = migrate_type_cmp,
1592 static int gfp_flags_cmp(void *a, void *b)
1594 struct page_stat *l = a;
1595 struct page_stat *r = b;
1597 /* for internal use to find free'd page */
1598 if (l->gfp_flags == -1U)
1601 if (l->gfp_flags < r->gfp_flags)
1603 else if (l->gfp_flags > r->gfp_flags)
1608 static struct sort_dimension gfp_flags_sort_dimension = {
1610 .cmp = gfp_flags_cmp,
1613 static struct sort_dimension *slab_sorts[] = {
1614 &ptr_sort_dimension,
1615 &callsite_sort_dimension,
1616 &hit_sort_dimension,
1617 &bytes_sort_dimension,
1618 &frag_sort_dimension,
1619 &pingpong_sort_dimension,
1622 static struct sort_dimension *page_sorts[] = {
1623 &page_sort_dimension,
1624 &page_callsite_sort_dimension,
1625 &page_hit_sort_dimension,
1626 &page_bytes_sort_dimension,
1627 &page_order_sort_dimension,
1628 &migrate_type_sort_dimension,
1629 &gfp_flags_sort_dimension,
1632 static int slab_sort_dimension__add(const char *tok, struct list_head *list)
1634 struct sort_dimension *sort;
1637 for (i = 0; i < (int)ARRAY_SIZE(slab_sorts); i++) {
1638 if (!strcmp(slab_sorts[i]->name, tok)) {
1639 sort = memdup(slab_sorts[i], sizeof(*slab_sorts[i]));
1641 pr_err("%s: memdup failed\n", __func__);
1644 list_add_tail(&sort->list, list);
1652 static int page_sort_dimension__add(const char *tok, struct list_head *list)
1654 struct sort_dimension *sort;
1657 for (i = 0; i < (int)ARRAY_SIZE(page_sorts); i++) {
1658 if (!strcmp(page_sorts[i]->name, tok)) {
1659 sort = memdup(page_sorts[i], sizeof(*page_sorts[i]));
1661 pr_err("%s: memdup failed\n", __func__);
1664 list_add_tail(&sort->list, list);
1672 static int setup_slab_sorting(struct list_head *sort_list, const char *arg)
1675 char *str = strdup(arg);
1679 pr_err("%s: strdup failed\n", __func__);
1684 tok = strsep(&pos, ",");
1687 if (slab_sort_dimension__add(tok, sort_list) < 0) {
1688 error("Unknown slab --sort key: '%s'", tok);
1698 static int setup_page_sorting(struct list_head *sort_list, const char *arg)
1701 char *str = strdup(arg);
1705 pr_err("%s: strdup failed\n", __func__);
1710 tok = strsep(&pos, ",");
1713 if (page_sort_dimension__add(tok, sort_list) < 0) {
1714 error("Unknown page --sort key: '%s'", tok);
1724 static int parse_sort_opt(const struct option *opt __maybe_unused,
1725 const char *arg, int unset __maybe_unused)
1730 if (kmem_page > kmem_slab ||
1731 (kmem_page == 0 && kmem_slab == 0 && kmem_default == KMEM_PAGE)) {
1732 if (caller_flag > alloc_flag)
1733 return setup_page_sorting(&page_caller_sort, arg);
1735 return setup_page_sorting(&page_alloc_sort, arg);
1737 if (caller_flag > alloc_flag)
1738 return setup_slab_sorting(&slab_caller_sort, arg);
1740 return setup_slab_sorting(&slab_alloc_sort, arg);
1746 static int parse_caller_opt(const struct option *opt __maybe_unused,
1747 const char *arg __maybe_unused,
1748 int unset __maybe_unused)
1750 caller_flag = (alloc_flag + 1);
1754 static int parse_alloc_opt(const struct option *opt __maybe_unused,
1755 const char *arg __maybe_unused,
1756 int unset __maybe_unused)
1758 alloc_flag = (caller_flag + 1);
1762 static int parse_slab_opt(const struct option *opt __maybe_unused,
1763 const char *arg __maybe_unused,
1764 int unset __maybe_unused)
1766 kmem_slab = (kmem_page + 1);
1770 static int parse_page_opt(const struct option *opt __maybe_unused,
1771 const char *arg __maybe_unused,
1772 int unset __maybe_unused)
1774 kmem_page = (kmem_slab + 1);
1778 static int parse_line_opt(const struct option *opt __maybe_unused,
1779 const char *arg, int unset __maybe_unused)
1786 lines = strtoul(arg, NULL, 10);
1788 if (caller_flag > alloc_flag)
1789 caller_lines = lines;
1791 alloc_lines = lines;
1796 static int __cmd_record(int argc, const char **argv)
1798 const char * const record_args[] = {
1799 "record", "-a", "-R", "-c", "1",
1801 const char * const slab_events[] = {
1802 "-e", "kmem:kmalloc",
1803 "-e", "kmem:kmalloc_node",
1805 "-e", "kmem:kmem_cache_alloc",
1806 "-e", "kmem:kmem_cache_alloc_node",
1807 "-e", "kmem:kmem_cache_free",
1809 const char * const page_events[] = {
1810 "-e", "kmem:mm_page_alloc",
1811 "-e", "kmem:mm_page_free",
1813 unsigned int rec_argc, i, j;
1814 const char **rec_argv;
1816 rec_argc = ARRAY_SIZE(record_args) + argc - 1;
1818 rec_argc += ARRAY_SIZE(slab_events);
1820 rec_argc += ARRAY_SIZE(page_events) + 1; /* for -g */
1822 rec_argv = calloc(rec_argc + 1, sizeof(char *));
1824 if (rec_argv == NULL)
1827 for (i = 0; i < ARRAY_SIZE(record_args); i++)
1828 rec_argv[i] = strdup(record_args[i]);
1831 for (j = 0; j < ARRAY_SIZE(slab_events); j++, i++)
1832 rec_argv[i] = strdup(slab_events[j]);
1835 rec_argv[i++] = strdup("-g");
1837 for (j = 0; j < ARRAY_SIZE(page_events); j++, i++)
1838 rec_argv[i] = strdup(page_events[j]);
1841 for (j = 1; j < (unsigned int)argc; j++, i++)
1842 rec_argv[i] = argv[j];
1844 return cmd_record(i, rec_argv, NULL);
1847 static int kmem_config(const char *var, const char *value, void *cb __maybe_unused)
1849 if (!strcmp(var, "kmem.default")) {
1850 if (!strcmp(value, "slab"))
1851 kmem_default = KMEM_SLAB;
1852 else if (!strcmp(value, "page"))
1853 kmem_default = KMEM_PAGE;
1855 pr_err("invalid default value ('slab' or 'page' required): %s\n",
1863 int cmd_kmem(int argc, const char **argv, const char *prefix __maybe_unused)
1865 const char * const default_slab_sort = "frag,hit,bytes";
1866 const char * const default_page_sort = "bytes,hit";
1867 struct perf_data_file file = {
1868 .mode = PERF_DATA_MODE_READ,
1870 const struct option kmem_options[] = {
1871 OPT_STRING('i', "input", &input_name, "file", "input file name"),
1872 OPT_INCR('v', "verbose", &verbose,
1873 "be more verbose (show symbol address, etc)"),
1874 OPT_CALLBACK_NOOPT(0, "caller", NULL, NULL,
1875 "show per-callsite statistics", parse_caller_opt),
1876 OPT_CALLBACK_NOOPT(0, "alloc", NULL, NULL,
1877 "show per-allocation statistics", parse_alloc_opt),
1878 OPT_CALLBACK('s', "sort", NULL, "key[,key2...]",
1879 "sort by keys: ptr, callsite, bytes, hit, pingpong, frag, "
1880 "page, order, migtype, gfp", parse_sort_opt),
1881 OPT_CALLBACK('l', "line", NULL, "num", "show n lines", parse_line_opt),
1882 OPT_BOOLEAN(0, "raw-ip", &raw_ip, "show raw ip instead of symbol"),
1883 OPT_BOOLEAN('f', "force", &file.force, "don't complain, do it"),
1884 OPT_CALLBACK_NOOPT(0, "slab", NULL, NULL, "Analyze slab allocator",
1886 OPT_CALLBACK_NOOPT(0, "page", NULL, NULL, "Analyze page allocator",
1888 OPT_BOOLEAN(0, "live", &live_page, "Show live page stat"),
1891 const char *const kmem_subcommands[] = { "record", "stat", NULL };
1892 const char *kmem_usage[] = {
1896 struct perf_session *session;
1898 const char errmsg[] = "No %s allocation events found. Have you run 'perf kmem record --%s'?\n";
1900 perf_config(kmem_config, NULL);
1901 argc = parse_options_subcommand(argc, argv, kmem_options,
1902 kmem_subcommands, kmem_usage, 0);
1905 usage_with_options(kmem_usage, kmem_options);
1907 if (kmem_slab == 0 && kmem_page == 0) {
1908 if (kmem_default == KMEM_SLAB)
1914 if (!strncmp(argv[0], "rec", 3)) {
1916 return __cmd_record(argc, argv);
1919 file.path = input_name;
1921 kmem_session = session = perf_session__new(&file, false, &perf_kmem);
1922 if (session == NULL)
1926 if (!perf_evlist__find_tracepoint_by_name(session->evlist,
1928 pr_err(errmsg, "slab", "slab");
1934 struct perf_evsel *evsel;
1936 evsel = perf_evlist__find_tracepoint_by_name(session->evlist,
1937 "kmem:mm_page_alloc");
1938 if (evsel == NULL) {
1939 pr_err(errmsg, "page", "page");
1943 kmem_page_size = pevent_get_page_size(evsel->tp_format->pevent);
1944 symbol_conf.use_callchain = true;
1947 symbol__init(&session->header.env);
1949 if (!strcmp(argv[0], "stat")) {
1950 setlocale(LC_ALL, "");
1952 if (cpu__setup_cpunode_map())
1955 if (list_empty(&slab_caller_sort))
1956 setup_slab_sorting(&slab_caller_sort, default_slab_sort);
1957 if (list_empty(&slab_alloc_sort))
1958 setup_slab_sorting(&slab_alloc_sort, default_slab_sort);
1959 if (list_empty(&page_caller_sort))
1960 setup_page_sorting(&page_caller_sort, default_page_sort);
1961 if (list_empty(&page_alloc_sort))
1962 setup_page_sorting(&page_alloc_sort, default_page_sort);
1965 setup_page_sorting(&page_alloc_sort_input,
1966 "page,order,migtype,gfp");
1967 setup_page_sorting(&page_caller_sort_input,
1968 "callsite,order,migtype,gfp");
1970 ret = __cmd_kmem(session);
1972 usage_with_options(kmem_usage, kmem_options);
1975 perf_session__delete(session);