]>
Commit | Line | Data |
---|---|---|
ba77c9e1 LZ |
1 | #include "builtin.h" |
2 | #include "perf.h" | |
3 | ||
4 | #include "util/util.h" | |
5 | #include "util/cache.h" | |
6 | #include "util/symbol.h" | |
7 | #include "util/thread.h" | |
8 | #include "util/header.h" | |
94c744b6 | 9 | #include "util/session.h" |
ba77c9e1 LZ |
10 | |
11 | #include "util/parse-options.h" | |
12 | #include "util/trace-event.h" | |
13 | ||
14 | #include "util/debug.h" | |
ba77c9e1 LZ |
15 | |
16 | #include <linux/rbtree.h> | |
17 | ||
18 | struct alloc_stat; | |
19 | typedef int (*sort_fn_t)(struct alloc_stat *, struct alloc_stat *); | |
20 | ||
21 | static char const *input_name = "perf.data"; | |
22 | ||
ba77c9e1 LZ |
23 | static int alloc_flag; |
24 | static int caller_flag; | |
25 | ||
ba77c9e1 LZ |
26 | static int alloc_lines = -1; |
27 | static int caller_lines = -1; | |
28 | ||
7707b6b6 LZ |
29 | static bool raw_ip; |
30 | ||
29b3e152 LZ |
31 | static char default_sort_order[] = "frag,hit,bytes"; |
32 | ||
7d0d3945 LZ |
33 | static int *cpunode_map; |
34 | static int max_cpu_num; | |
35 | ||
ba77c9e1 | 36 | struct alloc_stat { |
079d3f65 LZ |
37 | u64 call_site; |
38 | u64 ptr; | |
ba77c9e1 LZ |
39 | u64 bytes_req; |
40 | u64 bytes_alloc; | |
41 | u32 hit; | |
079d3f65 LZ |
42 | u32 pingpong; |
43 | ||
44 | short alloc_cpu; | |
ba77c9e1 LZ |
45 | |
46 | struct rb_node node; | |
47 | }; | |
48 | ||
49 | static struct rb_root root_alloc_stat; | |
50 | static struct rb_root root_alloc_sorted; | |
51 | static struct rb_root root_caller_stat; | |
52 | static struct rb_root root_caller_sorted; | |
53 | ||
54 | static unsigned long total_requested, total_allocated; | |
7d0d3945 | 55 | static unsigned long nr_allocs, nr_cross_allocs; |
ba77c9e1 | 56 | |
7d0d3945 LZ |
57 | #define PATH_SYS_NODE "/sys/devices/system/node" |
58 | ||
59 | static void init_cpunode_map(void) | |
60 | { | |
61 | FILE *fp; | |
62 | int i; | |
63 | ||
64 | fp = fopen("/sys/devices/system/cpu/kernel_max", "r"); | |
65 | if (!fp) { | |
66 | max_cpu_num = 4096; | |
67 | return; | |
68 | } | |
69 | ||
70 | if (fscanf(fp, "%d", &max_cpu_num) < 1) | |
71 | die("Failed to read 'kernel_max' from sysfs"); | |
72 | max_cpu_num++; | |
73 | ||
74 | cpunode_map = calloc(max_cpu_num, sizeof(int)); | |
75 | if (!cpunode_map) | |
76 | die("calloc"); | |
77 | for (i = 0; i < max_cpu_num; i++) | |
78 | cpunode_map[i] = -1; | |
79 | fclose(fp); | |
80 | } | |
81 | ||
82 | static void setup_cpunode_map(void) | |
83 | { | |
84 | struct dirent *dent1, *dent2; | |
85 | DIR *dir1, *dir2; | |
86 | unsigned int cpu, mem; | |
87 | char buf[PATH_MAX]; | |
88 | ||
89 | init_cpunode_map(); | |
90 | ||
91 | dir1 = opendir(PATH_SYS_NODE); | |
92 | if (!dir1) | |
93 | return; | |
94 | ||
95 | while (true) { | |
96 | dent1 = readdir(dir1); | |
97 | if (!dent1) | |
98 | break; | |
99 | ||
100 | if (sscanf(dent1->d_name, "node%u", &mem) < 1) | |
101 | continue; | |
102 | ||
103 | snprintf(buf, PATH_MAX, "%s/%s", PATH_SYS_NODE, dent1->d_name); | |
104 | dir2 = opendir(buf); | |
105 | if (!dir2) | |
106 | continue; | |
107 | while (true) { | |
108 | dent2 = readdir(dir2); | |
109 | if (!dent2) | |
110 | break; | |
111 | if (sscanf(dent2->d_name, "cpu%u", &cpu) < 1) | |
112 | continue; | |
113 | cpunode_map[cpu] = mem; | |
114 | } | |
115 | } | |
116 | } | |
117 | ||
079d3f65 LZ |
118 | static void insert_alloc_stat(unsigned long call_site, unsigned long ptr, |
119 | int bytes_req, int bytes_alloc, int cpu) | |
ba77c9e1 LZ |
120 | { |
121 | struct rb_node **node = &root_alloc_stat.rb_node; | |
122 | struct rb_node *parent = NULL; | |
123 | struct alloc_stat *data = NULL; | |
124 | ||
ba77c9e1 LZ |
125 | while (*node) { |
126 | parent = *node; | |
127 | data = rb_entry(*node, struct alloc_stat, node); | |
128 | ||
129 | if (ptr > data->ptr) | |
130 | node = &(*node)->rb_right; | |
131 | else if (ptr < data->ptr) | |
132 | node = &(*node)->rb_left; | |
133 | else | |
134 | break; | |
135 | } | |
136 | ||
137 | if (data && data->ptr == ptr) { | |
138 | data->hit++; | |
139 | data->bytes_req += bytes_req; | |
140 | data->bytes_alloc += bytes_req; | |
141 | } else { | |
142 | data = malloc(sizeof(*data)); | |
079d3f65 LZ |
143 | if (!data) |
144 | die("malloc"); | |
ba77c9e1 | 145 | data->ptr = ptr; |
079d3f65 | 146 | data->pingpong = 0; |
ba77c9e1 LZ |
147 | data->hit = 1; |
148 | data->bytes_req = bytes_req; | |
149 | data->bytes_alloc = bytes_alloc; | |
150 | ||
151 | rb_link_node(&data->node, parent, node); | |
152 | rb_insert_color(&data->node, &root_alloc_stat); | |
153 | } | |
079d3f65 LZ |
154 | data->call_site = call_site; |
155 | data->alloc_cpu = cpu; | |
ba77c9e1 LZ |
156 | } |
157 | ||
158 | static void insert_caller_stat(unsigned long call_site, | |
159 | int bytes_req, int bytes_alloc) | |
160 | { | |
161 | struct rb_node **node = &root_caller_stat.rb_node; | |
162 | struct rb_node *parent = NULL; | |
163 | struct alloc_stat *data = NULL; | |
164 | ||
ba77c9e1 LZ |
165 | while (*node) { |
166 | parent = *node; | |
167 | data = rb_entry(*node, struct alloc_stat, node); | |
168 | ||
169 | if (call_site > data->call_site) | |
170 | node = &(*node)->rb_right; | |
171 | else if (call_site < data->call_site) | |
172 | node = &(*node)->rb_left; | |
173 | else | |
174 | break; | |
175 | } | |
176 | ||
177 | if (data && data->call_site == call_site) { | |
178 | data->hit++; | |
179 | data->bytes_req += bytes_req; | |
180 | data->bytes_alloc += bytes_req; | |
181 | } else { | |
182 | data = malloc(sizeof(*data)); | |
079d3f65 LZ |
183 | if (!data) |
184 | die("malloc"); | |
ba77c9e1 | 185 | data->call_site = call_site; |
079d3f65 | 186 | data->pingpong = 0; |
ba77c9e1 LZ |
187 | data->hit = 1; |
188 | data->bytes_req = bytes_req; | |
189 | data->bytes_alloc = bytes_alloc; | |
190 | ||
191 | rb_link_node(&data->node, parent, node); | |
192 | rb_insert_color(&data->node, &root_caller_stat); | |
193 | } | |
194 | } | |
195 | ||
f48f669d | 196 | static void process_alloc_event(void *data, |
ba77c9e1 | 197 | struct event *event, |
7d0d3945 | 198 | int cpu, |
ba77c9e1 LZ |
199 | u64 timestamp __used, |
200 | struct thread *thread __used, | |
7d0d3945 | 201 | int node) |
ba77c9e1 LZ |
202 | { |
203 | unsigned long call_site; | |
204 | unsigned long ptr; | |
205 | int bytes_req; | |
206 | int bytes_alloc; | |
7d0d3945 | 207 | int node1, node2; |
ba77c9e1 | 208 | |
f48f669d XG |
209 | ptr = raw_field_value(event, "ptr", data); |
210 | call_site = raw_field_value(event, "call_site", data); | |
211 | bytes_req = raw_field_value(event, "bytes_req", data); | |
212 | bytes_alloc = raw_field_value(event, "bytes_alloc", data); | |
ba77c9e1 | 213 | |
079d3f65 | 214 | insert_alloc_stat(call_site, ptr, bytes_req, bytes_alloc, cpu); |
ba77c9e1 LZ |
215 | insert_caller_stat(call_site, bytes_req, bytes_alloc); |
216 | ||
217 | total_requested += bytes_req; | |
218 | total_allocated += bytes_alloc; | |
7d0d3945 LZ |
219 | |
220 | if (node) { | |
221 | node1 = cpunode_map[cpu]; | |
f48f669d | 222 | node2 = raw_field_value(event, "node", data); |
7d0d3945 LZ |
223 | if (node1 != node2) |
224 | nr_cross_allocs++; | |
225 | } | |
226 | nr_allocs++; | |
ba77c9e1 LZ |
227 | } |
228 | ||
079d3f65 LZ |
229 | static int ptr_cmp(struct alloc_stat *, struct alloc_stat *); |
230 | static int callsite_cmp(struct alloc_stat *, struct alloc_stat *); | |
231 | ||
232 | static struct alloc_stat *search_alloc_stat(unsigned long ptr, | |
233 | unsigned long call_site, | |
234 | struct rb_root *root, | |
235 | sort_fn_t sort_fn) | |
236 | { | |
237 | struct rb_node *node = root->rb_node; | |
238 | struct alloc_stat key = { .ptr = ptr, .call_site = call_site }; | |
239 | ||
240 | while (node) { | |
241 | struct alloc_stat *data; | |
242 | int cmp; | |
243 | ||
244 | data = rb_entry(node, struct alloc_stat, node); | |
245 | ||
246 | cmp = sort_fn(&key, data); | |
247 | if (cmp < 0) | |
248 | node = node->rb_left; | |
249 | else if (cmp > 0) | |
250 | node = node->rb_right; | |
251 | else | |
252 | return data; | |
253 | } | |
254 | return NULL; | |
255 | } | |
256 | ||
f48f669d | 257 | static void process_free_event(void *data, |
079d3f65 LZ |
258 | struct event *event, |
259 | int cpu, | |
ba77c9e1 LZ |
260 | u64 timestamp __used, |
261 | struct thread *thread __used) | |
262 | { | |
079d3f65 LZ |
263 | unsigned long ptr; |
264 | struct alloc_stat *s_alloc, *s_caller; | |
265 | ||
f48f669d | 266 | ptr = raw_field_value(event, "ptr", data); |
079d3f65 LZ |
267 | |
268 | s_alloc = search_alloc_stat(ptr, 0, &root_alloc_stat, ptr_cmp); | |
269 | if (!s_alloc) | |
270 | return; | |
271 | ||
272 | if (cpu != s_alloc->alloc_cpu) { | |
273 | s_alloc->pingpong++; | |
274 | ||
275 | s_caller = search_alloc_stat(0, s_alloc->call_site, | |
276 | &root_caller_stat, callsite_cmp); | |
277 | assert(s_caller); | |
278 | s_caller->pingpong++; | |
279 | } | |
280 | s_alloc->alloc_cpu = -1; | |
ba77c9e1 LZ |
281 | } |
282 | ||
283 | static void | |
f48f669d | 284 | process_raw_event(event_t *raw_event __used, void *data, |
ba77c9e1 LZ |
285 | int cpu, u64 timestamp, struct thread *thread) |
286 | { | |
ba77c9e1 LZ |
287 | struct event *event; |
288 | int type; | |
289 | ||
f48f669d | 290 | type = trace_parse_common_type(data); |
ba77c9e1 LZ |
291 | event = trace_find_event(type); |
292 | ||
293 | if (!strcmp(event->name, "kmalloc") || | |
294 | !strcmp(event->name, "kmem_cache_alloc")) { | |
f48f669d | 295 | process_alloc_event(data, event, cpu, timestamp, thread, 0); |
ba77c9e1 LZ |
296 | return; |
297 | } | |
298 | ||
299 | if (!strcmp(event->name, "kmalloc_node") || | |
300 | !strcmp(event->name, "kmem_cache_alloc_node")) { | |
f48f669d | 301 | process_alloc_event(data, event, cpu, timestamp, thread, 1); |
ba77c9e1 LZ |
302 | return; |
303 | } | |
304 | ||
305 | if (!strcmp(event->name, "kfree") || | |
306 | !strcmp(event->name, "kmem_cache_free")) { | |
f48f669d | 307 | process_free_event(data, event, cpu, timestamp, thread); |
ba77c9e1 LZ |
308 | return; |
309 | } | |
310 | } | |
311 | ||
b3165f41 | 312 | static int process_sample_event(event_t *event, struct perf_session *session) |
ba77c9e1 | 313 | { |
180f95e2 OH |
314 | struct sample_data data; |
315 | struct thread *thread; | |
ba77c9e1 | 316 | |
180f95e2 OH |
317 | memset(&data, 0, sizeof(data)); |
318 | data.time = -1; | |
319 | data.cpu = -1; | |
320 | data.period = 1; | |
ba77c9e1 | 321 | |
c019879b | 322 | event__parse_sample(event, session->sample_type, &data); |
ba77c9e1 | 323 | |
62daacb5 | 324 | dump_printf("(IP, %d): %d/%d: %p period: %Ld\n", |
ba77c9e1 | 325 | event->header.misc, |
180f95e2 OH |
326 | data.pid, data.tid, |
327 | (void *)(long)data.ip, | |
328 | (long long)data.period); | |
ba77c9e1 | 329 | |
b3165f41 | 330 | thread = perf_session__findnew(session, event->ip.pid); |
ba77c9e1 LZ |
331 | if (thread == NULL) { |
332 | pr_debug("problem processing %d event, skipping it.\n", | |
333 | event->header.type); | |
334 | return -1; | |
335 | } | |
336 | ||
337 | dump_printf(" ... thread: %s:%d\n", thread->comm, thread->pid); | |
338 | ||
f48f669d | 339 | process_raw_event(event, data.raw_data, data.cpu, |
d8bd9e0a | 340 | data.time, thread); |
ba77c9e1 LZ |
341 | |
342 | return 0; | |
343 | } | |
344 | ||
301a0b02 | 345 | static struct perf_event_ops event_ops = { |
ba77c9e1 | 346 | .process_sample_event = process_sample_event, |
62daacb5 | 347 | .process_comm_event = event__process_comm, |
27295592 | 348 | .sample_type_check = perf_session__has_traces, |
ba77c9e1 LZ |
349 | }; |
350 | ||
ba77c9e1 LZ |
351 | static double fragmentation(unsigned long n_req, unsigned long n_alloc) |
352 | { | |
353 | if (n_alloc == 0) | |
354 | return 0.0; | |
355 | else | |
356 | return 100.0 - (100.0 * n_req / n_alloc); | |
357 | } | |
358 | ||
4aa65636 ACM |
359 | static void __print_result(struct rb_root *root, struct perf_session *session, |
360 | int n_lines, int is_caller) | |
ba77c9e1 LZ |
361 | { |
362 | struct rb_node *next; | |
363 | ||
079d3f65 LZ |
364 | printf("%.102s\n", graph_dotted_line); |
365 | printf(" %-34s |", is_caller ? "Callsite": "Alloc Ptr"); | |
366 | printf(" Total_alloc/Per | Total_req/Per | Hit | Ping-pong | Frag\n"); | |
367 | printf("%.102s\n", graph_dotted_line); | |
ba77c9e1 LZ |
368 | |
369 | next = rb_first(root); | |
370 | ||
371 | while (next && n_lines--) { | |
1b145ae5 ACM |
372 | struct alloc_stat *data = rb_entry(next, struct alloc_stat, |
373 | node); | |
374 | struct symbol *sym = NULL; | |
079d3f65 | 375 | char buf[BUFSIZ]; |
1b145ae5 ACM |
376 | u64 addr; |
377 | ||
378 | if (is_caller) { | |
379 | addr = data->call_site; | |
7707b6b6 | 380 | if (!raw_ip) |
4aa65636 | 381 | sym = map_groups__find_function(&session->kmaps, session, addr, NULL); |
1b145ae5 ACM |
382 | } else |
383 | addr = data->ptr; | |
384 | ||
385 | if (sym != NULL) | |
079d3f65 | 386 | snprintf(buf, sizeof(buf), "%s+%Lx", sym->name, |
1b145ae5 ACM |
387 | addr - sym->start); |
388 | else | |
079d3f65 LZ |
389 | snprintf(buf, sizeof(buf), "%#Lx", addr); |
390 | printf(" %-34s |", buf); | |
ba77c9e1 | 391 | |
079d3f65 LZ |
392 | printf(" %9llu/%-5lu | %9llu/%-5lu | %6lu | %8lu | %6.3f%%\n", |
393 | (unsigned long long)data->bytes_alloc, | |
ba77c9e1 LZ |
394 | (unsigned long)data->bytes_alloc / data->hit, |
395 | (unsigned long long)data->bytes_req, | |
396 | (unsigned long)data->bytes_req / data->hit, | |
397 | (unsigned long)data->hit, | |
079d3f65 | 398 | (unsigned long)data->pingpong, |
ba77c9e1 LZ |
399 | fragmentation(data->bytes_req, data->bytes_alloc)); |
400 | ||
401 | next = rb_next(next); | |
402 | } | |
403 | ||
404 | if (n_lines == -1) | |
079d3f65 | 405 | printf(" ... | ... | ... | ... | ... | ... \n"); |
ba77c9e1 | 406 | |
079d3f65 | 407 | printf("%.102s\n", graph_dotted_line); |
ba77c9e1 LZ |
408 | } |
409 | ||
410 | static void print_summary(void) | |
411 | { | |
412 | printf("\nSUMMARY\n=======\n"); | |
413 | printf("Total bytes requested: %lu\n", total_requested); | |
414 | printf("Total bytes allocated: %lu\n", total_allocated); | |
415 | printf("Total bytes wasted on internal fragmentation: %lu\n", | |
416 | total_allocated - total_requested); | |
417 | printf("Internal fragmentation: %f%%\n", | |
418 | fragmentation(total_requested, total_allocated)); | |
7d0d3945 | 419 | printf("Cross CPU allocations: %lu/%lu\n", nr_cross_allocs, nr_allocs); |
ba77c9e1 LZ |
420 | } |
421 | ||
4aa65636 | 422 | static void print_result(struct perf_session *session) |
ba77c9e1 LZ |
423 | { |
424 | if (caller_flag) | |
4aa65636 | 425 | __print_result(&root_caller_sorted, session, caller_lines, 1); |
ba77c9e1 | 426 | if (alloc_flag) |
4aa65636 | 427 | __print_result(&root_alloc_sorted, session, alloc_lines, 0); |
ba77c9e1 LZ |
428 | print_summary(); |
429 | } | |
430 | ||
29b3e152 LZ |
431 | struct sort_dimension { |
432 | const char name[20]; | |
433 | sort_fn_t cmp; | |
434 | struct list_head list; | |
435 | }; | |
436 | ||
437 | static LIST_HEAD(caller_sort); | |
438 | static LIST_HEAD(alloc_sort); | |
439 | ||
ba77c9e1 | 440 | static void sort_insert(struct rb_root *root, struct alloc_stat *data, |
29b3e152 | 441 | struct list_head *sort_list) |
ba77c9e1 LZ |
442 | { |
443 | struct rb_node **new = &(root->rb_node); | |
444 | struct rb_node *parent = NULL; | |
29b3e152 | 445 | struct sort_dimension *sort; |
ba77c9e1 LZ |
446 | |
447 | while (*new) { | |
448 | struct alloc_stat *this; | |
29b3e152 | 449 | int cmp = 0; |
ba77c9e1 LZ |
450 | |
451 | this = rb_entry(*new, struct alloc_stat, node); | |
452 | parent = *new; | |
453 | ||
29b3e152 LZ |
454 | list_for_each_entry(sort, sort_list, list) { |
455 | cmp = sort->cmp(data, this); | |
456 | if (cmp) | |
457 | break; | |
458 | } | |
ba77c9e1 LZ |
459 | |
460 | if (cmp > 0) | |
461 | new = &((*new)->rb_left); | |
462 | else | |
463 | new = &((*new)->rb_right); | |
464 | } | |
465 | ||
466 | rb_link_node(&data->node, parent, new); | |
467 | rb_insert_color(&data->node, root); | |
468 | } | |
469 | ||
470 | static void __sort_result(struct rb_root *root, struct rb_root *root_sorted, | |
29b3e152 | 471 | struct list_head *sort_list) |
ba77c9e1 LZ |
472 | { |
473 | struct rb_node *node; | |
474 | struct alloc_stat *data; | |
475 | ||
476 | for (;;) { | |
477 | node = rb_first(root); | |
478 | if (!node) | |
479 | break; | |
480 | ||
481 | rb_erase(node, root); | |
482 | data = rb_entry(node, struct alloc_stat, node); | |
29b3e152 | 483 | sort_insert(root_sorted, data, sort_list); |
ba77c9e1 LZ |
484 | } |
485 | } | |
486 | ||
487 | static void sort_result(void) | |
488 | { | |
29b3e152 LZ |
489 | __sort_result(&root_alloc_stat, &root_alloc_sorted, &alloc_sort); |
490 | __sort_result(&root_caller_stat, &root_caller_sorted, &caller_sort); | |
ba77c9e1 LZ |
491 | } |
492 | ||
493 | static int __cmd_kmem(void) | |
494 | { | |
4aa65636 | 495 | int err; |
75be6cf4 | 496 | struct perf_session *session = perf_session__new(input_name, O_RDONLY, 0); |
4aa65636 ACM |
497 | if (session == NULL) |
498 | return -ENOMEM; | |
499 | ||
ba77c9e1 | 500 | setup_pager(); |
4aa65636 ACM |
501 | err = perf_session__process_events(session, &event_ops); |
502 | if (err != 0) | |
503 | goto out_delete; | |
ba77c9e1 | 504 | sort_result(); |
4aa65636 ACM |
505 | print_result(session); |
506 | out_delete: | |
507 | perf_session__delete(session); | |
508 | return err; | |
ba77c9e1 LZ |
509 | } |
510 | ||
511 | static const char * const kmem_usage[] = { | |
90b86a9f | 512 | "perf kmem [<options>] {record|stat}", |
ba77c9e1 LZ |
513 | NULL |
514 | }; | |
515 | ||
ba77c9e1 LZ |
516 | static int ptr_cmp(struct alloc_stat *l, struct alloc_stat *r) |
517 | { | |
518 | if (l->ptr < r->ptr) | |
519 | return -1; | |
520 | else if (l->ptr > r->ptr) | |
521 | return 1; | |
522 | return 0; | |
523 | } | |
524 | ||
29b3e152 LZ |
525 | static struct sort_dimension ptr_sort_dimension = { |
526 | .name = "ptr", | |
527 | .cmp = ptr_cmp, | |
528 | }; | |
529 | ||
ba77c9e1 LZ |
530 | static int callsite_cmp(struct alloc_stat *l, struct alloc_stat *r) |
531 | { | |
532 | if (l->call_site < r->call_site) | |
533 | return -1; | |
534 | else if (l->call_site > r->call_site) | |
535 | return 1; | |
536 | return 0; | |
537 | } | |
538 | ||
29b3e152 LZ |
539 | static struct sort_dimension callsite_sort_dimension = { |
540 | .name = "callsite", | |
541 | .cmp = callsite_cmp, | |
542 | }; | |
543 | ||
f3ced7cd PE |
544 | static int hit_cmp(struct alloc_stat *l, struct alloc_stat *r) |
545 | { | |
546 | if (l->hit < r->hit) | |
547 | return -1; | |
548 | else if (l->hit > r->hit) | |
549 | return 1; | |
550 | return 0; | |
551 | } | |
552 | ||
29b3e152 LZ |
553 | static struct sort_dimension hit_sort_dimension = { |
554 | .name = "hit", | |
555 | .cmp = hit_cmp, | |
556 | }; | |
557 | ||
ba77c9e1 LZ |
558 | static int bytes_cmp(struct alloc_stat *l, struct alloc_stat *r) |
559 | { | |
560 | if (l->bytes_alloc < r->bytes_alloc) | |
561 | return -1; | |
562 | else if (l->bytes_alloc > r->bytes_alloc) | |
563 | return 1; | |
564 | return 0; | |
565 | } | |
566 | ||
29b3e152 LZ |
567 | static struct sort_dimension bytes_sort_dimension = { |
568 | .name = "bytes", | |
569 | .cmp = bytes_cmp, | |
570 | }; | |
571 | ||
f3ced7cd PE |
572 | static int frag_cmp(struct alloc_stat *l, struct alloc_stat *r) |
573 | { | |
574 | double x, y; | |
575 | ||
576 | x = fragmentation(l->bytes_req, l->bytes_alloc); | |
577 | y = fragmentation(r->bytes_req, r->bytes_alloc); | |
578 | ||
579 | if (x < y) | |
580 | return -1; | |
581 | else if (x > y) | |
582 | return 1; | |
583 | return 0; | |
584 | } | |
585 | ||
29b3e152 LZ |
586 | static struct sort_dimension frag_sort_dimension = { |
587 | .name = "frag", | |
588 | .cmp = frag_cmp, | |
589 | }; | |
590 | ||
079d3f65 LZ |
591 | static int pingpong_cmp(struct alloc_stat *l, struct alloc_stat *r) |
592 | { | |
593 | if (l->pingpong < r->pingpong) | |
594 | return -1; | |
595 | else if (l->pingpong > r->pingpong) | |
596 | return 1; | |
597 | return 0; | |
598 | } | |
599 | ||
600 | static struct sort_dimension pingpong_sort_dimension = { | |
601 | .name = "pingpong", | |
602 | .cmp = pingpong_cmp, | |
603 | }; | |
604 | ||
29b3e152 LZ |
605 | static struct sort_dimension *avail_sorts[] = { |
606 | &ptr_sort_dimension, | |
607 | &callsite_sort_dimension, | |
608 | &hit_sort_dimension, | |
609 | &bytes_sort_dimension, | |
610 | &frag_sort_dimension, | |
079d3f65 | 611 | &pingpong_sort_dimension, |
29b3e152 LZ |
612 | }; |
613 | ||
614 | #define NUM_AVAIL_SORTS \ | |
615 | (int)(sizeof(avail_sorts) / sizeof(struct sort_dimension *)) | |
616 | ||
617 | static int sort_dimension__add(const char *tok, struct list_head *list) | |
618 | { | |
619 | struct sort_dimension *sort; | |
620 | int i; | |
621 | ||
622 | for (i = 0; i < NUM_AVAIL_SORTS; i++) { | |
623 | if (!strcmp(avail_sorts[i]->name, tok)) { | |
624 | sort = malloc(sizeof(*sort)); | |
625 | if (!sort) | |
626 | die("malloc"); | |
627 | memcpy(sort, avail_sorts[i], sizeof(*sort)); | |
628 | list_add_tail(&sort->list, list); | |
629 | return 0; | |
630 | } | |
631 | } | |
632 | ||
633 | return -1; | |
634 | } | |
635 | ||
636 | static int setup_sorting(struct list_head *sort_list, const char *arg) | |
637 | { | |
638 | char *tok; | |
639 | char *str = strdup(arg); | |
640 | ||
641 | if (!str) | |
642 | die("strdup"); | |
643 | ||
644 | while (true) { | |
645 | tok = strsep(&str, ","); | |
646 | if (!tok) | |
647 | break; | |
648 | if (sort_dimension__add(tok, sort_list) < 0) { | |
649 | error("Unknown --sort key: '%s'", tok); | |
650 | return -1; | |
651 | } | |
652 | } | |
653 | ||
654 | free(str); | |
655 | return 0; | |
656 | } | |
657 | ||
ba77c9e1 LZ |
658 | static int parse_sort_opt(const struct option *opt __used, |
659 | const char *arg, int unset __used) | |
660 | { | |
ba77c9e1 LZ |
661 | if (!arg) |
662 | return -1; | |
663 | ||
ba77c9e1 | 664 | if (caller_flag > alloc_flag) |
29b3e152 | 665 | return setup_sorting(&caller_sort, arg); |
ba77c9e1 | 666 | else |
29b3e152 | 667 | return setup_sorting(&alloc_sort, arg); |
ba77c9e1 LZ |
668 | |
669 | return 0; | |
670 | } | |
671 | ||
90b86a9f | 672 | static int parse_caller_opt(const struct option *opt __used, |
79312416 | 673 | const char *arg __used, int unset __used) |
ba77c9e1 | 674 | { |
90b86a9f LZ |
675 | caller_flag = (alloc_flag + 1); |
676 | return 0; | |
677 | } | |
ba77c9e1 | 678 | |
90b86a9f | 679 | static int parse_alloc_opt(const struct option *opt __used, |
79312416 | 680 | const char *arg __used, int unset __used) |
90b86a9f LZ |
681 | { |
682 | alloc_flag = (caller_flag + 1); | |
ba77c9e1 LZ |
683 | return 0; |
684 | } | |
685 | ||
686 | static int parse_line_opt(const struct option *opt __used, | |
687 | const char *arg, int unset __used) | |
688 | { | |
689 | int lines; | |
690 | ||
691 | if (!arg) | |
692 | return -1; | |
693 | ||
694 | lines = strtoul(arg, NULL, 10); | |
695 | ||
696 | if (caller_flag > alloc_flag) | |
697 | caller_lines = lines; | |
698 | else | |
699 | alloc_lines = lines; | |
700 | ||
701 | return 0; | |
702 | } | |
703 | ||
704 | static const struct option kmem_options[] = { | |
705 | OPT_STRING('i', "input", &input_name, "file", | |
706 | "input file name"), | |
90b86a9f LZ |
707 | OPT_CALLBACK_NOOPT(0, "caller", NULL, NULL, |
708 | "show per-callsite statistics", | |
709 | parse_caller_opt), | |
710 | OPT_CALLBACK_NOOPT(0, "alloc", NULL, NULL, | |
711 | "show per-allocation statistics", | |
712 | parse_alloc_opt), | |
29b3e152 | 713 | OPT_CALLBACK('s', "sort", NULL, "key[,key2...]", |
079d3f65 | 714 | "sort by keys: ptr, call_site, bytes, hit, pingpong, frag", |
ba77c9e1 LZ |
715 | parse_sort_opt), |
716 | OPT_CALLBACK('l', "line", NULL, "num", | |
90b86a9f | 717 | "show n lines", |
ba77c9e1 | 718 | parse_line_opt), |
7707b6b6 | 719 | OPT_BOOLEAN(0, "raw-ip", &raw_ip, "show raw ip instead of symbol"), |
ba77c9e1 LZ |
720 | OPT_END() |
721 | }; | |
722 | ||
723 | static const char *record_args[] = { | |
724 | "record", | |
725 | "-a", | |
726 | "-R", | |
727 | "-M", | |
728 | "-f", | |
729 | "-c", "1", | |
730 | "-e", "kmem:kmalloc", | |
731 | "-e", "kmem:kmalloc_node", | |
732 | "-e", "kmem:kfree", | |
733 | "-e", "kmem:kmem_cache_alloc", | |
734 | "-e", "kmem:kmem_cache_alloc_node", | |
735 | "-e", "kmem:kmem_cache_free", | |
736 | }; | |
737 | ||
738 | static int __cmd_record(int argc, const char **argv) | |
739 | { | |
740 | unsigned int rec_argc, i, j; | |
741 | const char **rec_argv; | |
742 | ||
743 | rec_argc = ARRAY_SIZE(record_args) + argc - 1; | |
744 | rec_argv = calloc(rec_argc + 1, sizeof(char *)); | |
745 | ||
746 | for (i = 0; i < ARRAY_SIZE(record_args); i++) | |
747 | rec_argv[i] = strdup(record_args[i]); | |
748 | ||
749 | for (j = 1; j < (unsigned int)argc; j++, i++) | |
750 | rec_argv[i] = argv[j]; | |
751 | ||
752 | return cmd_record(i, rec_argv, NULL); | |
753 | } | |
754 | ||
755 | int cmd_kmem(int argc, const char **argv, const char *prefix __used) | |
756 | { | |
ba77c9e1 LZ |
757 | argc = parse_options(argc, argv, kmem_options, kmem_usage, 0); |
758 | ||
90b86a9f | 759 | if (!argc) |
ba77c9e1 LZ |
760 | usage_with_options(kmem_usage, kmem_options); |
761 | ||
655000e7 ACM |
762 | symbol__init(); |
763 | ||
90b86a9f LZ |
764 | if (!strncmp(argv[0], "rec", 3)) { |
765 | return __cmd_record(argc, argv); | |
766 | } else if (!strcmp(argv[0], "stat")) { | |
767 | setup_cpunode_map(); | |
768 | ||
769 | if (list_empty(&caller_sort)) | |
770 | setup_sorting(&caller_sort, default_sort_order); | |
771 | if (list_empty(&alloc_sort)) | |
772 | setup_sorting(&alloc_sort, default_sort_order); | |
ba77c9e1 | 773 | |
90b86a9f LZ |
774 | return __cmd_kmem(); |
775 | } | |
7d0d3945 | 776 | |
90b86a9f | 777 | return 0; |
ba77c9e1 LZ |
778 | } |
779 |