5 #include "util/cache.h"
6 #include "util/symbol.h"
7 #include "util/thread.h"
8 #include "util/header.h"
10 #include "util/parse-options.h"
11 #include "util/trace-event.h"
13 #include "util/debug.h"
14 #include "util/data_map.h"
16 #include <linux/rbtree.h>
19 typedef int (*sort_fn_t
)(struct alloc_stat
*, struct alloc_stat
*);
21 static char const *input_name
= "perf.data";
23 static struct perf_header
*header
;
24 static u64 sample_type
;
26 static int alloc_flag
;
27 static int caller_flag
;
29 static int alloc_lines
= -1;
30 static int caller_lines
= -1;
34 static char default_sort_order
[] = "frag,hit,bytes";
36 static int *cpunode_map
;
37 static int max_cpu_num
;
52 static struct rb_root root_alloc_stat
;
53 static struct rb_root root_alloc_sorted
;
54 static struct rb_root root_caller_stat
;
55 static struct rb_root root_caller_sorted
;
57 static unsigned long total_requested
, total_allocated
;
58 static unsigned long nr_allocs
, nr_cross_allocs
;
60 #define PATH_SYS_NODE "/sys/devices/system/node"
62 static void init_cpunode_map(void)
67 fp
= fopen("/sys/devices/system/cpu/kernel_max", "r");
73 if (fscanf(fp
, "%d", &max_cpu_num
) < 1)
74 die("Failed to read 'kernel_max' from sysfs");
77 cpunode_map
= calloc(max_cpu_num
, sizeof(int));
80 for (i
= 0; i
< max_cpu_num
; i
++)
85 static void setup_cpunode_map(void)
87 struct dirent
*dent1
, *dent2
;
89 unsigned int cpu
, mem
;
94 dir1
= opendir(PATH_SYS_NODE
);
99 dent1
= readdir(dir1
);
103 if (sscanf(dent1
->d_name
, "node%u", &mem
) < 1)
106 snprintf(buf
, PATH_MAX
, "%s/%s", PATH_SYS_NODE
, dent1
->d_name
);
111 dent2
= readdir(dir2
);
114 if (sscanf(dent2
->d_name
, "cpu%u", &cpu
) < 1)
116 cpunode_map
[cpu
] = mem
;
121 static void insert_alloc_stat(unsigned long call_site
, unsigned long ptr
,
122 int bytes_req
, int bytes_alloc
, int cpu
)
124 struct rb_node
**node
= &root_alloc_stat
.rb_node
;
125 struct rb_node
*parent
= NULL
;
126 struct alloc_stat
*data
= NULL
;
130 data
= rb_entry(*node
, struct alloc_stat
, node
);
133 node
= &(*node
)->rb_right
;
134 else if (ptr
< data
->ptr
)
135 node
= &(*node
)->rb_left
;
140 if (data
&& data
->ptr
== ptr
) {
142 data
->bytes_req
+= bytes_req
;
143 data
->bytes_alloc
+= bytes_req
;
145 data
= malloc(sizeof(*data
));
151 data
->bytes_req
= bytes_req
;
152 data
->bytes_alloc
= bytes_alloc
;
154 rb_link_node(&data
->node
, parent
, node
);
155 rb_insert_color(&data
->node
, &root_alloc_stat
);
157 data
->call_site
= call_site
;
158 data
->alloc_cpu
= cpu
;
161 static void insert_caller_stat(unsigned long call_site
,
162 int bytes_req
, int bytes_alloc
)
164 struct rb_node
**node
= &root_caller_stat
.rb_node
;
165 struct rb_node
*parent
= NULL
;
166 struct alloc_stat
*data
= NULL
;
170 data
= rb_entry(*node
, struct alloc_stat
, node
);
172 if (call_site
> data
->call_site
)
173 node
= &(*node
)->rb_right
;
174 else if (call_site
< data
->call_site
)
175 node
= &(*node
)->rb_left
;
180 if (data
&& data
->call_site
== call_site
) {
182 data
->bytes_req
+= bytes_req
;
183 data
->bytes_alloc
+= bytes_req
;
185 data
= malloc(sizeof(*data
));
188 data
->call_site
= call_site
;
191 data
->bytes_req
= bytes_req
;
192 data
->bytes_alloc
= bytes_alloc
;
194 rb_link_node(&data
->node
, parent
, node
);
195 rb_insert_color(&data
->node
, &root_caller_stat
);
199 static void process_alloc_event(void *data
,
202 u64 timestamp __used
,
203 struct thread
*thread __used
,
206 unsigned long call_site
;
212 ptr
= raw_field_value(event
, "ptr", data
);
213 call_site
= raw_field_value(event
, "call_site", data
);
214 bytes_req
= raw_field_value(event
, "bytes_req", data
);
215 bytes_alloc
= raw_field_value(event
, "bytes_alloc", data
);
217 insert_alloc_stat(call_site
, ptr
, bytes_req
, bytes_alloc
, cpu
);
218 insert_caller_stat(call_site
, bytes_req
, bytes_alloc
);
220 total_requested
+= bytes_req
;
221 total_allocated
+= bytes_alloc
;
224 node1
= cpunode_map
[cpu
];
225 node2
= raw_field_value(event
, "node", data
);
232 static int ptr_cmp(struct alloc_stat
*, struct alloc_stat
*);
233 static int callsite_cmp(struct alloc_stat
*, struct alloc_stat
*);
235 static struct alloc_stat
*search_alloc_stat(unsigned long ptr
,
236 unsigned long call_site
,
237 struct rb_root
*root
,
240 struct rb_node
*node
= root
->rb_node
;
241 struct alloc_stat key
= { .ptr
= ptr
, .call_site
= call_site
};
244 struct alloc_stat
*data
;
247 data
= rb_entry(node
, struct alloc_stat
, node
);
249 cmp
= sort_fn(&key
, data
);
251 node
= node
->rb_left
;
253 node
= node
->rb_right
;
260 static void process_free_event(void *data
,
263 u64 timestamp __used
,
264 struct thread
*thread __used
)
267 struct alloc_stat
*s_alloc
, *s_caller
;
269 ptr
= raw_field_value(event
, "ptr", data
);
271 s_alloc
= search_alloc_stat(ptr
, 0, &root_alloc_stat
, ptr_cmp
);
275 if (cpu
!= s_alloc
->alloc_cpu
) {
278 s_caller
= search_alloc_stat(0, s_alloc
->call_site
,
279 &root_caller_stat
, callsite_cmp
);
281 s_caller
->pingpong
++;
283 s_alloc
->alloc_cpu
= -1;
287 process_raw_event(event_t
*raw_event __used
, void *data
,
288 int cpu
, u64 timestamp
, struct thread
*thread
)
293 type
= trace_parse_common_type(data
);
294 event
= trace_find_event(type
);
296 if (!strcmp(event
->name
, "kmalloc") ||
297 !strcmp(event
->name
, "kmem_cache_alloc")) {
298 process_alloc_event(data
, event
, cpu
, timestamp
, thread
, 0);
302 if (!strcmp(event
->name
, "kmalloc_node") ||
303 !strcmp(event
->name
, "kmem_cache_alloc_node")) {
304 process_alloc_event(data
, event
, cpu
, timestamp
, thread
, 1);
308 if (!strcmp(event
->name
, "kfree") ||
309 !strcmp(event
->name
, "kmem_cache_free")) {
310 process_free_event(data
, event
, cpu
, timestamp
, thread
);
315 static int process_sample_event(event_t
*event
)
317 struct sample_data data
;
318 struct thread
*thread
;
320 memset(&data
, 0, sizeof(data
));
325 event__parse_sample(event
, sample_type
, &data
);
327 dump_printf("(IP, %d): %d/%d: %p period: %Ld\n",
330 (void *)(long)data
.ip
,
331 (long long)data
.period
);
333 thread
= threads__findnew(event
->ip
.pid
);
334 if (thread
== NULL
) {
335 pr_debug("problem processing %d event, skipping it.\n",
340 dump_printf(" ... thread: %s:%d\n", thread
->comm
, thread
->pid
);
342 process_raw_event(event
, data
.raw_data
, data
.cpu
,
348 static int sample_type_check(u64 type
)
352 if (!(sample_type
& PERF_SAMPLE_RAW
)) {
354 "No trace sample to read. Did you call perf record "
362 static struct perf_file_handler file_handler
= {
363 .process_sample_event
= process_sample_event
,
364 .process_comm_event
= event__process_comm
,
365 .sample_type_check
= sample_type_check
,
368 static int read_events(void)
370 register_idle_thread();
371 register_perf_file_handler(&file_handler
);
373 return mmap_dispatch_perf_file(&header
, input_name
, 0, 0,
374 &event__cwdlen
, &event__cwd
);
377 static double fragmentation(unsigned long n_req
, unsigned long n_alloc
)
382 return 100.0 - (100.0 * n_req
/ n_alloc
);
385 static void __print_result(struct rb_root
*root
, int n_lines
, int is_caller
)
387 struct rb_node
*next
;
389 printf("%.102s\n", graph_dotted_line
);
390 printf(" %-34s |", is_caller
? "Callsite": "Alloc Ptr");
391 printf(" Total_alloc/Per | Total_req/Per | Hit | Ping-pong | Frag\n");
392 printf("%.102s\n", graph_dotted_line
);
394 next
= rb_first(root
);
396 while (next
&& n_lines
--) {
397 struct alloc_stat
*data
= rb_entry(next
, struct alloc_stat
,
399 struct symbol
*sym
= NULL
;
404 addr
= data
->call_site
;
406 sym
= thread__find_function(kthread
, addr
, NULL
);
411 snprintf(buf
, sizeof(buf
), "%s+%Lx", sym
->name
,
414 snprintf(buf
, sizeof(buf
), "%#Lx", addr
);
415 printf(" %-34s |", buf
);
417 printf(" %9llu/%-5lu | %9llu/%-5lu | %6lu | %8lu | %6.3f%%\n",
418 (unsigned long long)data
->bytes_alloc
,
419 (unsigned long)data
->bytes_alloc
/ data
->hit
,
420 (unsigned long long)data
->bytes_req
,
421 (unsigned long)data
->bytes_req
/ data
->hit
,
422 (unsigned long)data
->hit
,
423 (unsigned long)data
->pingpong
,
424 fragmentation(data
->bytes_req
, data
->bytes_alloc
));
426 next
= rb_next(next
);
430 printf(" ... | ... | ... | ... | ... | ... \n");
432 printf("%.102s\n", graph_dotted_line
);
435 static void print_summary(void)
437 printf("\nSUMMARY\n=======\n");
438 printf("Total bytes requested: %lu\n", total_requested
);
439 printf("Total bytes allocated: %lu\n", total_allocated
);
440 printf("Total bytes wasted on internal fragmentation: %lu\n",
441 total_allocated
- total_requested
);
442 printf("Internal fragmentation: %f%%\n",
443 fragmentation(total_requested
, total_allocated
));
444 printf("Cross CPU allocations: %lu/%lu\n", nr_cross_allocs
, nr_allocs
);
447 static void print_result(void)
450 __print_result(&root_caller_sorted
, caller_lines
, 1);
452 __print_result(&root_alloc_sorted
, alloc_lines
, 0);
456 struct sort_dimension
{
459 struct list_head list
;
462 static LIST_HEAD(caller_sort
);
463 static LIST_HEAD(alloc_sort
);
465 static void sort_insert(struct rb_root
*root
, struct alloc_stat
*data
,
466 struct list_head
*sort_list
)
468 struct rb_node
**new = &(root
->rb_node
);
469 struct rb_node
*parent
= NULL
;
470 struct sort_dimension
*sort
;
473 struct alloc_stat
*this;
476 this = rb_entry(*new, struct alloc_stat
, node
);
479 list_for_each_entry(sort
, sort_list
, list
) {
480 cmp
= sort
->cmp(data
, this);
486 new = &((*new)->rb_left
);
488 new = &((*new)->rb_right
);
491 rb_link_node(&data
->node
, parent
, new);
492 rb_insert_color(&data
->node
, root
);
495 static void __sort_result(struct rb_root
*root
, struct rb_root
*root_sorted
,
496 struct list_head
*sort_list
)
498 struct rb_node
*node
;
499 struct alloc_stat
*data
;
502 node
= rb_first(root
);
506 rb_erase(node
, root
);
507 data
= rb_entry(node
, struct alloc_stat
, node
);
508 sort_insert(root_sorted
, data
, sort_list
);
512 static void sort_result(void)
514 __sort_result(&root_alloc_stat
, &root_alloc_sorted
, &alloc_sort
);
515 __sort_result(&root_caller_stat
, &root_caller_sorted
, &caller_sort
);
518 static int __cmd_kmem(void)
528 static const char * const kmem_usage
[] = {
529 "perf kmem [<options>] {record}",
533 static int ptr_cmp(struct alloc_stat
*l
, struct alloc_stat
*r
)
537 else if (l
->ptr
> r
->ptr
)
542 static struct sort_dimension ptr_sort_dimension
= {
547 static int callsite_cmp(struct alloc_stat
*l
, struct alloc_stat
*r
)
549 if (l
->call_site
< r
->call_site
)
551 else if (l
->call_site
> r
->call_site
)
556 static struct sort_dimension callsite_sort_dimension
= {
561 static int hit_cmp(struct alloc_stat
*l
, struct alloc_stat
*r
)
565 else if (l
->hit
> r
->hit
)
570 static struct sort_dimension hit_sort_dimension
= {
575 static int bytes_cmp(struct alloc_stat
*l
, struct alloc_stat
*r
)
577 if (l
->bytes_alloc
< r
->bytes_alloc
)
579 else if (l
->bytes_alloc
> r
->bytes_alloc
)
584 static struct sort_dimension bytes_sort_dimension
= {
589 static int frag_cmp(struct alloc_stat
*l
, struct alloc_stat
*r
)
593 x
= fragmentation(l
->bytes_req
, l
->bytes_alloc
);
594 y
= fragmentation(r
->bytes_req
, r
->bytes_alloc
);
603 static struct sort_dimension frag_sort_dimension
= {
608 static int pingpong_cmp(struct alloc_stat
*l
, struct alloc_stat
*r
)
610 if (l
->pingpong
< r
->pingpong
)
612 else if (l
->pingpong
> r
->pingpong
)
617 static struct sort_dimension pingpong_sort_dimension
= {
622 static struct sort_dimension
*avail_sorts
[] = {
624 &callsite_sort_dimension
,
626 &bytes_sort_dimension
,
627 &frag_sort_dimension
,
628 &pingpong_sort_dimension
,
631 #define NUM_AVAIL_SORTS \
632 (int)(sizeof(avail_sorts) / sizeof(struct sort_dimension *))
634 static int sort_dimension__add(const char *tok
, struct list_head
*list
)
636 struct sort_dimension
*sort
;
639 for (i
= 0; i
< NUM_AVAIL_SORTS
; i
++) {
640 if (!strcmp(avail_sorts
[i
]->name
, tok
)) {
641 sort
= malloc(sizeof(*sort
));
644 memcpy(sort
, avail_sorts
[i
], sizeof(*sort
));
645 list_add_tail(&sort
->list
, list
);
653 static int setup_sorting(struct list_head
*sort_list
, const char *arg
)
656 char *str
= strdup(arg
);
662 tok
= strsep(&str
, ",");
665 if (sort_dimension__add(tok
, sort_list
) < 0) {
666 error("Unknown --sort key: '%s'", tok
);
675 static int parse_sort_opt(const struct option
*opt __used
,
676 const char *arg
, int unset __used
)
681 if (caller_flag
> alloc_flag
)
682 return setup_sorting(&caller_sort
, arg
);
684 return setup_sorting(&alloc_sort
, arg
);
689 static int parse_stat_opt(const struct option
*opt __used
,
690 const char *arg
, int unset __used
)
695 if (strcmp(arg
, "alloc") == 0)
696 alloc_flag
= (caller_flag
+ 1);
697 else if (strcmp(arg
, "caller") == 0)
698 caller_flag
= (alloc_flag
+ 1);
704 static int parse_line_opt(const struct option
*opt __used
,
705 const char *arg
, int unset __used
)
712 lines
= strtoul(arg
, NULL
, 10);
714 if (caller_flag
> alloc_flag
)
715 caller_lines
= lines
;
722 static const struct option kmem_options
[] = {
723 OPT_STRING('i', "input", &input_name
, "file",
725 OPT_CALLBACK(0, "stat", NULL
, "<alloc>|<caller>",
726 "stat selector, Pass 'alloc' or 'caller'.",
728 OPT_CALLBACK('s', "sort", NULL
, "key[,key2...]",
729 "sort by keys: ptr, call_site, bytes, hit, pingpong, frag",
731 OPT_CALLBACK('l', "line", NULL
, "num",
734 OPT_BOOLEAN(0, "raw-ip", &raw_ip
, "show raw ip instead of symbol"),
738 static const char *record_args
[] = {
745 "-e", "kmem:kmalloc",
746 "-e", "kmem:kmalloc_node",
748 "-e", "kmem:kmem_cache_alloc",
749 "-e", "kmem:kmem_cache_alloc_node",
750 "-e", "kmem:kmem_cache_free",
753 static int __cmd_record(int argc
, const char **argv
)
755 unsigned int rec_argc
, i
, j
;
756 const char **rec_argv
;
758 rec_argc
= ARRAY_SIZE(record_args
) + argc
- 1;
759 rec_argv
= calloc(rec_argc
+ 1, sizeof(char *));
761 for (i
= 0; i
< ARRAY_SIZE(record_args
); i
++)
762 rec_argv
[i
] = strdup(record_args
[i
]);
764 for (j
= 1; j
< (unsigned int)argc
; j
++, i
++)
765 rec_argv
[i
] = argv
[j
];
767 return cmd_record(i
, rec_argv
, NULL
);
770 int cmd_kmem(int argc
, const char **argv
, const char *prefix __used
)
774 argc
= parse_options(argc
, argv
, kmem_options
, kmem_usage
, 0);
776 if (argc
&& !strncmp(argv
[0], "rec", 3))
777 return __cmd_record(argc
, argv
);
779 usage_with_options(kmem_usage
, kmem_options
);
781 if (list_empty(&caller_sort
))
782 setup_sorting(&caller_sort
, default_sort_order
);
783 if (list_empty(&alloc_sort
))
784 setup_sorting(&alloc_sort
, default_sort_order
);