builtin-kmem.c 17.9 KB
Newer Older
L
Li Zefan 已提交
1 2 3
#include "builtin.h"
#include "perf.h"

4
#include "util/evlist.h"
5
#include "util/evsel.h"
L
Li Zefan 已提交
6 7 8 9 10
#include "util/util.h"
#include "util/cache.h"
#include "util/symbol.h"
#include "util/thread.h"
#include "util/header.h"
11
#include "util/session.h"
12
#include "util/tool.h"
L
Li Zefan 已提交
13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29

#include "util/parse-options.h"
#include "util/trace-event.h"

#include "util/debug.h"

#include <linux/rbtree.h>

struct alloc_stat;
typedef int (*sort_fn_t)(struct alloc_stat *, struct alloc_stat *);

static int			alloc_flag;
static int			caller_flag;

static int			alloc_lines = -1;
static int			caller_lines = -1;

30 31
static bool			raw_ip;

32 33 34
static int			*cpunode_map;
static int			max_cpu_num;

L
Li Zefan 已提交
35
struct alloc_stat {
36 37
	u64	call_site;
	u64	ptr;
L
Li Zefan 已提交
38 39 40
	u64	bytes_req;
	u64	bytes_alloc;
	u32	hit;
41 42 43
	u32	pingpong;

	short	alloc_cpu;
L
Li Zefan 已提交
44 45 46 47 48 49 50 51 52 53

	struct rb_node node;
};

static struct rb_root root_alloc_stat;
static struct rb_root root_alloc_sorted;
static struct rb_root root_caller_stat;
static struct rb_root root_caller_sorted;

static unsigned long total_requested, total_allocated;
54
static unsigned long nr_allocs, nr_cross_allocs;
L
Li Zefan 已提交
55

56 57
#define PATH_SYS_NODE	"/sys/devices/system/node"

58
static int init_cpunode_map(void)
59 60
{
	FILE *fp;
61
	int i, err = -1;
62 63 64 65

	fp = fopen("/sys/devices/system/cpu/kernel_max", "r");
	if (!fp) {
		max_cpu_num = 4096;
66 67 68 69 70 71
		return 0;
	}

	if (fscanf(fp, "%d", &max_cpu_num) < 1) {
		pr_err("Failed to read 'kernel_max' from sysfs");
		goto out_close;
72 73 74 75 76
	}

	max_cpu_num++;

	cpunode_map = calloc(max_cpu_num, sizeof(int));
77 78 79 80 81
	if (!cpunode_map) {
		pr_err("%s: calloc failed\n", __func__);
		goto out_close;
	}

82 83
	for (i = 0; i < max_cpu_num; i++)
		cpunode_map[i] = -1;
84 85 86

	err = 0;
out_close:
87
	fclose(fp);
88
	return err;
89 90
}

91
static int setup_cpunode_map(void)
92 93 94 95 96 97
{
	struct dirent *dent1, *dent2;
	DIR *dir1, *dir2;
	unsigned int cpu, mem;
	char buf[PATH_MAX];

98 99
	if (init_cpunode_map())
		return -1;
100 101 102

	dir1 = opendir(PATH_SYS_NODE);
	if (!dir1)
103
		return -1;
104

105 106 107
	while ((dent1 = readdir(dir1)) != NULL) {
		if (dent1->d_type != DT_DIR ||
		    sscanf(dent1->d_name, "node%u", &mem) < 1)
108 109 110 111 112 113
			continue;

		snprintf(buf, PATH_MAX, "%s/%s", PATH_SYS_NODE, dent1->d_name);
		dir2 = opendir(buf);
		if (!dir2)
			continue;
114 115 116
		while ((dent2 = readdir(dir2)) != NULL) {
			if (dent2->d_type != DT_LNK ||
			    sscanf(dent2->d_name, "cpu%u", &cpu) < 1)
117 118 119
				continue;
			cpunode_map[cpu] = mem;
		}
120
		closedir(dir2);
121
	}
122
	closedir(dir1);
123
	return 0;
124 125
}

126 127
static int insert_alloc_stat(unsigned long call_site, unsigned long ptr,
			     int bytes_req, int bytes_alloc, int cpu)
L
Li Zefan 已提交
128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147
{
	struct rb_node **node = &root_alloc_stat.rb_node;
	struct rb_node *parent = NULL;
	struct alloc_stat *data = NULL;

	while (*node) {
		parent = *node;
		data = rb_entry(*node, struct alloc_stat, node);

		if (ptr > data->ptr)
			node = &(*node)->rb_right;
		else if (ptr < data->ptr)
			node = &(*node)->rb_left;
		else
			break;
	}

	if (data && data->ptr == ptr) {
		data->hit++;
		data->bytes_req += bytes_req;
W
Wenji Huang 已提交
148
		data->bytes_alloc += bytes_alloc;
L
Li Zefan 已提交
149 150
	} else {
		data = malloc(sizeof(*data));
151 152 153 154
		if (!data) {
			pr_err("%s: malloc failed\n", __func__);
			return -1;
		}
L
Li Zefan 已提交
155
		data->ptr = ptr;
156
		data->pingpong = 0;
L
Li Zefan 已提交
157 158 159 160 161 162 163
		data->hit = 1;
		data->bytes_req = bytes_req;
		data->bytes_alloc = bytes_alloc;

		rb_link_node(&data->node, parent, node);
		rb_insert_color(&data->node, &root_alloc_stat);
	}
164 165
	data->call_site = call_site;
	data->alloc_cpu = cpu;
166
	return 0;
L
Li Zefan 已提交
167 168
}

169
static int insert_caller_stat(unsigned long call_site,
L
Li Zefan 已提交
170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190
			      int bytes_req, int bytes_alloc)
{
	struct rb_node **node = &root_caller_stat.rb_node;
	struct rb_node *parent = NULL;
	struct alloc_stat *data = NULL;

	while (*node) {
		parent = *node;
		data = rb_entry(*node, struct alloc_stat, node);

		if (call_site > data->call_site)
			node = &(*node)->rb_right;
		else if (call_site < data->call_site)
			node = &(*node)->rb_left;
		else
			break;
	}

	if (data && data->call_site == call_site) {
		data->hit++;
		data->bytes_req += bytes_req;
W
Wenji Huang 已提交
191
		data->bytes_alloc += bytes_alloc;
L
Li Zefan 已提交
192 193
	} else {
		data = malloc(sizeof(*data));
194 195 196 197
		if (!data) {
			pr_err("%s: malloc failed\n", __func__);
			return -1;
		}
L
Li Zefan 已提交
198
		data->call_site = call_site;
199
		data->pingpong = 0;
L
Li Zefan 已提交
200 201 202 203 204 205 206
		data->hit = 1;
		data->bytes_req = bytes_req;
		data->bytes_alloc = bytes_alloc;

		rb_link_node(&data->node, parent, node);
		rb_insert_color(&data->node, &root_caller_stat);
	}
207 208

	return 0;
L
Li Zefan 已提交
209 210
}

211
static int perf_evsel__process_alloc_event(struct perf_evsel *evsel,
212
					   struct perf_sample *sample)
L
Li Zefan 已提交
213
{
214 215 216 217 218 219
	unsigned long ptr = perf_evsel__intval(evsel, sample, "ptr"),
		      call_site = perf_evsel__intval(evsel, sample, "call_site");
	int bytes_req = perf_evsel__intval(evsel, sample, "bytes_req"),
	    bytes_alloc = perf_evsel__intval(evsel, sample, "bytes_alloc");

	if (insert_alloc_stat(call_site, ptr, bytes_req, bytes_alloc, sample->cpu) ||
220 221
	    insert_caller_stat(call_site, bytes_req, bytes_alloc))
		return -1;
L
Li Zefan 已提交
222 223 224

	total_requested += bytes_req;
	total_allocated += bytes_alloc;
225

226 227 228 229 230 231 232 233 234 235 236 237 238
	nr_allocs++;
	return 0;
}

static int perf_evsel__process_alloc_node_event(struct perf_evsel *evsel,
						struct perf_sample *sample)
{
	int ret = perf_evsel__process_alloc_event(evsel, sample);

	if (!ret) {
		int node1 = cpunode_map[sample->cpu],
		    node2 = perf_evsel__intval(evsel, sample, "node");

239 240 241
		if (node1 != node2)
			nr_cross_allocs++;
	}
242 243

	return ret;
L
Li Zefan 已提交
244 245
}

246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273
static int ptr_cmp(struct alloc_stat *, struct alloc_stat *);
static int callsite_cmp(struct alloc_stat *, struct alloc_stat *);

static struct alloc_stat *search_alloc_stat(unsigned long ptr,
					    unsigned long call_site,
					    struct rb_root *root,
					    sort_fn_t sort_fn)
{
	struct rb_node *node = root->rb_node;
	struct alloc_stat key = { .ptr = ptr, .call_site = call_site };

	while (node) {
		struct alloc_stat *data;
		int cmp;

		data = rb_entry(node, struct alloc_stat, node);

		cmp = sort_fn(&key, data);
		if (cmp < 0)
			node = node->rb_left;
		else if (cmp > 0)
			node = node->rb_right;
		else
			return data;
	}
	return NULL;
}

274 275
static int perf_evsel__process_free_event(struct perf_evsel *evsel,
					  struct perf_sample *sample)
L
Li Zefan 已提交
276
{
277
	unsigned long ptr = perf_evsel__intval(evsel, sample, "ptr");
278 279 280 281
	struct alloc_stat *s_alloc, *s_caller;

	s_alloc = search_alloc_stat(ptr, 0, &root_alloc_stat, ptr_cmp);
	if (!s_alloc)
282
		return 0;
283

284
	if ((short)sample->cpu != s_alloc->alloc_cpu) {
285 286 287 288
		s_alloc->pingpong++;

		s_caller = search_alloc_stat(0, s_alloc->call_site,
					     &root_caller_stat, callsite_cmp);
289 290
		if (!s_caller)
			return -1;
291 292 293
		s_caller->pingpong++;
	}
	s_alloc->alloc_cpu = -1;
294 295

	return 0;
L
Li Zefan 已提交
296 297
}

298 299
typedef int (*tracepoint_handler)(struct perf_evsel *evsel,
				  struct perf_sample *sample);
L
Li Zefan 已提交
300

301
static int process_sample_event(struct perf_tool *tool __maybe_unused,
302
				union perf_event *event,
303
				struct perf_sample *sample,
304
				struct perf_evsel *evsel,
305
				struct machine *machine)
L
Li Zefan 已提交
306
{
307
	struct thread *thread = machine__findnew_thread(machine, event->ip.pid);
L
Li Zefan 已提交
308 309 310 311 312 313 314 315 316

	if (thread == NULL) {
		pr_debug("problem processing %d event, skipping it.\n",
			 event->header.type);
		return -1;
	}

	dump_printf(" ... thread: %s:%d\n", thread->comm, thread->pid);

317 318 319 320 321 322
	if (evsel->handler.func != NULL) {
		tracepoint_handler f = evsel->handler.func;
		return f(evsel, sample);
	}

	return 0;
L
Li Zefan 已提交
323 324
}

325 326 327 328
static struct perf_tool perf_kmem = {
	.sample		 = process_sample_event,
	.comm		 = perf_event__process_comm,
	.ordered_samples = true,
L
Li Zefan 已提交
329 330 331 332 333 334 335 336 337 338
};

static double fragmentation(unsigned long n_req, unsigned long n_alloc)
{
	if (n_alloc == 0)
		return 0.0;
	else
		return 100.0 - (100.0 * n_req / n_alloc);
}

339 340
static void __print_result(struct rb_root *root, struct perf_session *session,
			   int n_lines, int is_caller)
L
Li Zefan 已提交
341 342
{
	struct rb_node *next;
343
	struct machine *machine;
L
Li Zefan 已提交
344

345 346
	printf("%.102s\n", graph_dotted_line);
	printf(" %-34s |",  is_caller ? "Callsite": "Alloc Ptr");
347
	printf(" Total_alloc/Per | Total_req/Per   | Hit      | Ping-pong | Frag\n");
348
	printf("%.102s\n", graph_dotted_line);
L
Li Zefan 已提交
349 350 351

	next = rb_first(root);

352 353
	machine = perf_session__find_host_machine(session);
	if (!machine) {
354 355 356
		pr_err("__print_result: couldn't find kernel information\n");
		return;
	}
L
Li Zefan 已提交
357
	while (next && n_lines--) {
358 359 360
		struct alloc_stat *data = rb_entry(next, struct alloc_stat,
						   node);
		struct symbol *sym = NULL;
361
		struct map *map;
362
		char buf[BUFSIZ];
363 364 365 366
		u64 addr;

		if (is_caller) {
			addr = data->call_site;
367
			if (!raw_ip)
368
				sym = machine__find_kernel_function(machine, addr, &map, NULL);
369 370 371 372
		} else
			addr = data->ptr;

		if (sym != NULL)
373
			snprintf(buf, sizeof(buf), "%s+%" PRIx64 "", sym->name,
374
				 addr - map->unmap_ip(map, sym->start));
375
		else
376
			snprintf(buf, sizeof(buf), "%#" PRIx64 "", addr);
377
		printf(" %-34s |", buf);
L
Li Zefan 已提交
378

379
		printf(" %9llu/%-5lu | %9llu/%-5lu | %8lu | %8lu | %6.3f%%\n",
380
		       (unsigned long long)data->bytes_alloc,
L
Li Zefan 已提交
381 382 383 384
		       (unsigned long)data->bytes_alloc / data->hit,
		       (unsigned long long)data->bytes_req,
		       (unsigned long)data->bytes_req / data->hit,
		       (unsigned long)data->hit,
385
		       (unsigned long)data->pingpong,
L
Li Zefan 已提交
386 387 388 389 390 391
		       fragmentation(data->bytes_req, data->bytes_alloc));

		next = rb_next(next);
	}

	if (n_lines == -1)
392
		printf(" ...                                | ...             | ...             | ...    | ...      | ...   \n");
L
Li Zefan 已提交
393

394
	printf("%.102s\n", graph_dotted_line);
L
Li Zefan 已提交
395 396 397 398 399 400 401 402 403 404 405
}

static void print_summary(void)
{
	printf("\nSUMMARY\n=======\n");
	printf("Total bytes requested: %lu\n", total_requested);
	printf("Total bytes allocated: %lu\n", total_allocated);
	printf("Total bytes wasted on internal fragmentation: %lu\n",
	       total_allocated - total_requested);
	printf("Internal fragmentation: %f%%\n",
	       fragmentation(total_requested, total_allocated));
406
	printf("Cross CPU allocations: %lu/%lu\n", nr_cross_allocs, nr_allocs);
L
Li Zefan 已提交
407 408
}

409
static void print_result(struct perf_session *session)
L
Li Zefan 已提交
410 411
{
	if (caller_flag)
412
		__print_result(&root_caller_sorted, session, caller_lines, 1);
L
Li Zefan 已提交
413
	if (alloc_flag)
414
		__print_result(&root_alloc_sorted, session, alloc_lines, 0);
L
Li Zefan 已提交
415 416 417
	print_summary();
}

418 419 420 421 422 423 424 425 426
struct sort_dimension {
	const char		name[20];
	sort_fn_t		cmp;
	struct list_head	list;
};

static LIST_HEAD(caller_sort);
static LIST_HEAD(alloc_sort);

L
Li Zefan 已提交
427
static void sort_insert(struct rb_root *root, struct alloc_stat *data,
428
			struct list_head *sort_list)
L
Li Zefan 已提交
429 430 431
{
	struct rb_node **new = &(root->rb_node);
	struct rb_node *parent = NULL;
432
	struct sort_dimension *sort;
L
Li Zefan 已提交
433 434 435

	while (*new) {
		struct alloc_stat *this;
436
		int cmp = 0;
L
Li Zefan 已提交
437 438 439 440

		this = rb_entry(*new, struct alloc_stat, node);
		parent = *new;

441 442 443 444 445
		list_for_each_entry(sort, sort_list, list) {
			cmp = sort->cmp(data, this);
			if (cmp)
				break;
		}
L
Li Zefan 已提交
446 447 448 449 450 451 452 453 454 455 456 457

		if (cmp > 0)
			new = &((*new)->rb_left);
		else
			new = &((*new)->rb_right);
	}

	rb_link_node(&data->node, parent, new);
	rb_insert_color(&data->node, root);
}

static void __sort_result(struct rb_root *root, struct rb_root *root_sorted,
458
			  struct list_head *sort_list)
L
Li Zefan 已提交
459 460 461 462 463 464 465 466 467 468 469
{
	struct rb_node *node;
	struct alloc_stat *data;

	for (;;) {
		node = rb_first(root);
		if (!node)
			break;

		rb_erase(node, root);
		data = rb_entry(node, struct alloc_stat, node);
470
		sort_insert(root_sorted, data, sort_list);
L
Li Zefan 已提交
471 472 473 474 475
	}
}

static void sort_result(void)
{
476 477
	__sort_result(&root_alloc_stat, &root_alloc_sorted, &alloc_sort);
	__sort_result(&root_caller_stat, &root_caller_sorted, &caller_sort);
L
Li Zefan 已提交
478 479
}

480
static int __cmd_kmem(const char *input_name)
L
Li Zefan 已提交
481
{
482
	int err = -EINVAL;
483
	struct perf_session *session;
484 485 486 487 488 489 490 491
	const struct perf_evsel_str_handler kmem_tracepoints[] = {
		{ "kmem:kmalloc",		perf_evsel__process_alloc_event, },
    		{ "kmem:kmem_cache_alloc",	perf_evsel__process_alloc_event, },
		{ "kmem:kmalloc_node",		perf_evsel__process_alloc_node_event, },
    		{ "kmem:kmem_cache_alloc_node", perf_evsel__process_alloc_node_event, },
		{ "kmem:kfree",			perf_evsel__process_free_event, },
    		{ "kmem:kmem_cache_free",	perf_evsel__process_free_event, },
	};
492

493
	session = perf_session__new(input_name, O_RDONLY, 0, false, &perf_kmem);
494 495 496
	if (session == NULL)
		return -ENOMEM;

497 498 499
	if (perf_session__create_kernel_maps(session) < 0)
		goto out_delete;

500 501 502
	if (!perf_session__has_traces(session, "kmem record"))
		goto out_delete;

503 504 505 506 507
	if (perf_session__set_tracepoints_handlers(session, kmem_tracepoints)) {
		pr_err("Initializing perf session tracepoint handlers failed\n");
		return -1;
	}

L
Li Zefan 已提交
508
	setup_pager();
509
	err = perf_session__process_events(session, &perf_kmem);
510 511
	if (err != 0)
		goto out_delete;
L
Li Zefan 已提交
512
	sort_result();
513 514 515 516
	print_result(session);
out_delete:
	perf_session__delete(session);
	return err;
L
Li Zefan 已提交
517 518 519 520 521 522 523 524 525 526 527
}

static int ptr_cmp(struct alloc_stat *l, struct alloc_stat *r)
{
	if (l->ptr < r->ptr)
		return -1;
	else if (l->ptr > r->ptr)
		return 1;
	return 0;
}

528 529 530 531 532
static struct sort_dimension ptr_sort_dimension = {
	.name	= "ptr",
	.cmp	= ptr_cmp,
};

L
Li Zefan 已提交
533 534 535 536 537 538 539 540 541
static int callsite_cmp(struct alloc_stat *l, struct alloc_stat *r)
{
	if (l->call_site < r->call_site)
		return -1;
	else if (l->call_site > r->call_site)
		return 1;
	return 0;
}

542 543 544 545 546
static struct sort_dimension callsite_sort_dimension = {
	.name	= "callsite",
	.cmp	= callsite_cmp,
};

547 548 549 550 551 552 553 554 555
static int hit_cmp(struct alloc_stat *l, struct alloc_stat *r)
{
	if (l->hit < r->hit)
		return -1;
	else if (l->hit > r->hit)
		return 1;
	return 0;
}

556 557 558 559 560
static struct sort_dimension hit_sort_dimension = {
	.name	= "hit",
	.cmp	= hit_cmp,
};

L
Li Zefan 已提交
561 562 563 564 565 566 567 568 569
static int bytes_cmp(struct alloc_stat *l, struct alloc_stat *r)
{
	if (l->bytes_alloc < r->bytes_alloc)
		return -1;
	else if (l->bytes_alloc > r->bytes_alloc)
		return 1;
	return 0;
}

570 571 572 573 574
static struct sort_dimension bytes_sort_dimension = {
	.name	= "bytes",
	.cmp	= bytes_cmp,
};

575 576 577 578 579 580 581 582 583 584 585 586 587 588
static int frag_cmp(struct alloc_stat *l, struct alloc_stat *r)
{
	double x, y;

	x = fragmentation(l->bytes_req, l->bytes_alloc);
	y = fragmentation(r->bytes_req, r->bytes_alloc);

	if (x < y)
		return -1;
	else if (x > y)
		return 1;
	return 0;
}

589 590 591 592 593
static struct sort_dimension frag_sort_dimension = {
	.name	= "frag",
	.cmp	= frag_cmp,
};

594 595 596 597 598 599 600 601 602 603 604 605 606 607
static int pingpong_cmp(struct alloc_stat *l, struct alloc_stat *r)
{
	if (l->pingpong < r->pingpong)
		return -1;
	else if (l->pingpong > r->pingpong)
		return 1;
	return 0;
}

static struct sort_dimension pingpong_sort_dimension = {
	.name	= "pingpong",
	.cmp	= pingpong_cmp,
};

608 609 610 611 612 613
static struct sort_dimension *avail_sorts[] = {
	&ptr_sort_dimension,
	&callsite_sort_dimension,
	&hit_sort_dimension,
	&bytes_sort_dimension,
	&frag_sort_dimension,
614
	&pingpong_sort_dimension,
615 616 617 618 619 620 621 622 623 624 625 626 627
};

#define NUM_AVAIL_SORTS	\
	(int)(sizeof(avail_sorts) / sizeof(struct sort_dimension *))

static int sort_dimension__add(const char *tok, struct list_head *list)
{
	struct sort_dimension *sort;
	int i;

	for (i = 0; i < NUM_AVAIL_SORTS; i++) {
		if (!strcmp(avail_sorts[i]->name, tok)) {
			sort = malloc(sizeof(*sort));
628 629 630 631
			if (!sort) {
				pr_err("%s: malloc failed\n", __func__);
				return -1;
			}
632 633 634 635 636 637 638 639 640 641 642 643 644 645
			memcpy(sort, avail_sorts[i], sizeof(*sort));
			list_add_tail(&sort->list, list);
			return 0;
		}
	}

	return -1;
}

static int setup_sorting(struct list_head *sort_list, const char *arg)
{
	char *tok;
	char *str = strdup(arg);

646 647 648 649
	if (!str) {
		pr_err("%s: strdup failed\n", __func__);
		return -1;
	}
650 651 652 653 654 655 656

	while (true) {
		tok = strsep(&str, ",");
		if (!tok)
			break;
		if (sort_dimension__add(tok, sort_list) < 0) {
			error("Unknown --sort key: '%s'", tok);
N
Namhyung Kim 已提交
657
			free(str);
658 659 660 661 662 663 664 665
			return -1;
		}
	}

	free(str);
	return 0;
}

666 667
static int parse_sort_opt(const struct option *opt __maybe_unused,
			  const char *arg, int unset __maybe_unused)
L
Li Zefan 已提交
668 669 670 671 672
{
	if (!arg)
		return -1;

	if (caller_flag > alloc_flag)
673
		return setup_sorting(&caller_sort, arg);
L
Li Zefan 已提交
674
	else
675
		return setup_sorting(&alloc_sort, arg);
L
Li Zefan 已提交
676 677 678 679

	return 0;
}

680 681 682
static int parse_caller_opt(const struct option *opt __maybe_unused,
			    const char *arg __maybe_unused,
			    int unset __maybe_unused)
L
Li Zefan 已提交
683
{
684 685 686
	caller_flag = (alloc_flag + 1);
	return 0;
}
L
Li Zefan 已提交
687

688 689 690
static int parse_alloc_opt(const struct option *opt __maybe_unused,
			   const char *arg __maybe_unused,
			   int unset __maybe_unused)
691 692
{
	alloc_flag = (caller_flag + 1);
L
Li Zefan 已提交
693 694 695
	return 0;
}

696 697
static int parse_line_opt(const struct option *opt __maybe_unused,
			  const char *arg, int unset __maybe_unused)
L
Li Zefan 已提交
698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713
{
	int lines;

	if (!arg)
		return -1;

	lines = strtoul(arg, NULL, 10);

	if (caller_flag > alloc_flag)
		caller_lines = lines;
	else
		alloc_lines = lines;

	return 0;
}

714 715 716 717
static int __cmd_record(int argc, const char **argv)
{
	const char * const record_args[] = {
	"record", "-a", "-R", "-f", "-c", "1",
L
Li Zefan 已提交
718 719 720 721 722 723
	"-e", "kmem:kmalloc",
	"-e", "kmem:kmalloc_node",
	"-e", "kmem:kfree",
	"-e", "kmem:kmem_cache_alloc",
	"-e", "kmem:kmem_cache_alloc_node",
	"-e", "kmem:kmem_cache_free",
724
	};
L
Li Zefan 已提交
725 726 727 728 729 730
	unsigned int rec_argc, i, j;
	const char **rec_argv;

	rec_argc = ARRAY_SIZE(record_args) + argc - 1;
	rec_argv = calloc(rec_argc + 1, sizeof(char *));

731 732 733
	if (rec_argv == NULL)
		return -ENOMEM;

L
Li Zefan 已提交
734 735 736 737 738 739 740 741 742
	for (i = 0; i < ARRAY_SIZE(record_args); i++)
		rec_argv[i] = strdup(record_args[i]);

	for (j = 1; j < (unsigned int)argc; j++, i++)
		rec_argv[i] = argv[j];

	return cmd_record(i, rec_argv, NULL);
}

743
int cmd_kmem(int argc, const char **argv, const char *prefix __maybe_unused)
L
Li Zefan 已提交
744
{
745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763
	const char * const default_sort_order = "frag,hit,bytes";
	const char *input_name = NULL;
	const struct option kmem_options[] = {
	OPT_STRING('i', "input", &input_name, "file", "input file name"),
	OPT_CALLBACK_NOOPT(0, "caller", NULL, NULL,
			   "show per-callsite statistics", parse_caller_opt),
	OPT_CALLBACK_NOOPT(0, "alloc", NULL, NULL,
			   "show per-allocation statistics", parse_alloc_opt),
	OPT_CALLBACK('s', "sort", NULL, "key[,key2...]",
		     "sort by keys: ptr, call_site, bytes, hit, pingpong, frag",
		     parse_sort_opt),
	OPT_CALLBACK('l', "line", NULL, "num", "show n lines", parse_line_opt),
	OPT_BOOLEAN(0, "raw-ip", &raw_ip, "show raw ip instead of symbol"),
	OPT_END()
	};
	const char * const kmem_usage[] = {
		"perf kmem [<options>] {record|stat}",
		NULL
	};
L
Li Zefan 已提交
764 765
	argc = parse_options(argc, argv, kmem_options, kmem_usage, 0);

766
	if (!argc)
L
Li Zefan 已提交
767 768
		usage_with_options(kmem_usage, kmem_options);

769 770
	symbol__init();

771 772 773
	if (!strncmp(argv[0], "rec", 3)) {
		return __cmd_record(argc, argv);
	} else if (!strcmp(argv[0], "stat")) {
774 775
		if (setup_cpunode_map())
			return -1;
776 777 778 779 780

		if (list_empty(&caller_sort))
			setup_sorting(&caller_sort, default_sort_order);
		if (list_empty(&alloc_sort))
			setup_sorting(&alloc_sort, default_sort_order);
L
Li Zefan 已提交
781

782
		return __cmd_kmem(input_name);
783 784
	} else
		usage_with_options(kmem_usage, kmem_options);
785

786
	return 0;
L
Li Zefan 已提交
787 788
}