builtin-kmem.c 16.5 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

#include "util/parse-options.h"
#include "util/trace-event.h"
16
#include "util/data.h"
17
#include "util/cpumap.h"
L
Li Zefan 已提交
18 19 20 21

#include "util/debug.h"

#include <linux/rbtree.h>
22
#include <linux/string.h>
L
Li Zefan 已提交
23 24 25 26 27 28 29 30 31 32

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;

33 34
static bool			raw_ip;

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
static int insert_alloc_stat(unsigned long call_site, unsigned long ptr,
			     int bytes_req, int bytes_alloc, int cpu)
L
Li Zefan 已提交
58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77
{
	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 已提交
78
		data->bytes_alloc += bytes_alloc;
L
Li Zefan 已提交
79 80
	} else {
		data = malloc(sizeof(*data));
81 82 83 84
		if (!data) {
			pr_err("%s: malloc failed\n", __func__);
			return -1;
		}
L
Li Zefan 已提交
85
		data->ptr = ptr;
86
		data->pingpong = 0;
L
Li Zefan 已提交
87 88 89 90 91 92 93
		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);
	}
94 95
	data->call_site = call_site;
	data->alloc_cpu = cpu;
96
	return 0;
L
Li Zefan 已提交
97 98
}

99
static int insert_caller_stat(unsigned long call_site,
L
Li Zefan 已提交
100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120
			      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 已提交
121
		data->bytes_alloc += bytes_alloc;
L
Li Zefan 已提交
122 123
	} else {
		data = malloc(sizeof(*data));
124 125 126 127
		if (!data) {
			pr_err("%s: malloc failed\n", __func__);
			return -1;
		}
L
Li Zefan 已提交
128
		data->call_site = call_site;
129
		data->pingpong = 0;
L
Li Zefan 已提交
130 131 132 133 134 135 136
		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);
	}
137 138

	return 0;
L
Li Zefan 已提交
139 140
}

141
static int perf_evsel__process_alloc_event(struct perf_evsel *evsel,
142
					   struct perf_sample *sample)
L
Li Zefan 已提交
143
{
144 145 146 147 148 149
	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) ||
150 151
	    insert_caller_stat(call_site, bytes_req, bytes_alloc))
		return -1;
L
Li Zefan 已提交
152 153 154

	total_requested += bytes_req;
	total_allocated += bytes_alloc;
155

156 157 158 159 160 161 162 163 164 165
	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) {
166
		int node1 = cpu__get_node(sample->cpu),
167 168
		    node2 = perf_evsel__intval(evsel, sample, "node");

169 170 171
		if (node1 != node2)
			nr_cross_allocs++;
	}
172 173

	return ret;
L
Li Zefan 已提交
174 175
}

176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203
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;
}

204 205
static int perf_evsel__process_free_event(struct perf_evsel *evsel,
					  struct perf_sample *sample)
L
Li Zefan 已提交
206
{
207
	unsigned long ptr = perf_evsel__intval(evsel, sample, "ptr");
208 209 210 211
	struct alloc_stat *s_alloc, *s_caller;

	s_alloc = search_alloc_stat(ptr, 0, &root_alloc_stat, ptr_cmp);
	if (!s_alloc)
212
		return 0;
213

214
	if ((short)sample->cpu != s_alloc->alloc_cpu) {
215 216 217 218
		s_alloc->pingpong++;

		s_caller = search_alloc_stat(0, s_alloc->call_site,
					     &root_caller_stat, callsite_cmp);
219 220
		if (!s_caller)
			return -1;
221 222 223
		s_caller->pingpong++;
	}
	s_alloc->alloc_cpu = -1;
224 225

	return 0;
L
Li Zefan 已提交
226 227
}

228 229
typedef int (*tracepoint_handler)(struct perf_evsel *evsel,
				  struct perf_sample *sample);
L
Li Zefan 已提交
230

231
static int process_sample_event(struct perf_tool *tool __maybe_unused,
232
				union perf_event *event,
233
				struct perf_sample *sample,
234
				struct perf_evsel *evsel,
235
				struct machine *machine)
L
Li Zefan 已提交
236
{
237 238
	struct thread *thread = machine__findnew_thread(machine, sample->pid,
							sample->pid);
L
Li Zefan 已提交
239 240 241 242 243 244 245

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

246
	dump_printf(" ... thread: %s:%d\n", thread__comm_str(thread), thread->tid);
L
Li Zefan 已提交
247

248 249
	if (evsel->handler != NULL) {
		tracepoint_handler f = evsel->handler;
250 251 252 253
		return f(evsel, sample);
	}

	return 0;
L
Li Zefan 已提交
254 255
}

256 257 258 259
static struct perf_tool perf_kmem = {
	.sample		 = process_sample_event,
	.comm		 = perf_event__process_comm,
	.ordered_samples = true,
L
Li Zefan 已提交
260 261 262 263 264 265 266 267 268 269
};

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);
}

270 271
static void __print_result(struct rb_root *root, struct perf_session *session,
			   int n_lines, int is_caller)
L
Li Zefan 已提交
272 273
{
	struct rb_node *next;
274
	struct machine *machine = &session->machines.host;
L
Li Zefan 已提交
275

276 277
	printf("%.102s\n", graph_dotted_line);
	printf(" %-34s |",  is_caller ? "Callsite": "Alloc Ptr");
278
	printf(" Total_alloc/Per | Total_req/Per   | Hit      | Ping-pong | Frag\n");
279
	printf("%.102s\n", graph_dotted_line);
L
Li Zefan 已提交
280 281 282 283

	next = rb_first(root);

	while (next && n_lines--) {
284 285 286
		struct alloc_stat *data = rb_entry(next, struct alloc_stat,
						   node);
		struct symbol *sym = NULL;
287
		struct map *map;
288
		char buf[BUFSIZ];
289 290 291 292
		u64 addr;

		if (is_caller) {
			addr = data->call_site;
293
			if (!raw_ip)
294
				sym = machine__find_kernel_function(machine, addr, &map, NULL);
295 296 297 298
		} else
			addr = data->ptr;

		if (sym != NULL)
299
			snprintf(buf, sizeof(buf), "%s+%" PRIx64 "", sym->name,
300
				 addr - map->unmap_ip(map, sym->start));
301
		else
302
			snprintf(buf, sizeof(buf), "%#" PRIx64 "", addr);
303
		printf(" %-34s |", buf);
L
Li Zefan 已提交
304

305
		printf(" %9llu/%-5lu | %9llu/%-5lu | %8lu | %8lu | %6.3f%%\n",
306
		       (unsigned long long)data->bytes_alloc,
L
Li Zefan 已提交
307 308 309 310
		       (unsigned long)data->bytes_alloc / data->hit,
		       (unsigned long long)data->bytes_req,
		       (unsigned long)data->bytes_req / data->hit,
		       (unsigned long)data->hit,
311
		       (unsigned long)data->pingpong,
L
Li Zefan 已提交
312 313 314 315 316 317
		       fragmentation(data->bytes_req, data->bytes_alloc));

		next = rb_next(next);
	}

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

320
	printf("%.102s\n", graph_dotted_line);
L
Li Zefan 已提交
321 322 323 324 325 326 327 328 329 330 331
}

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));
332
	printf("Cross CPU allocations: %lu/%lu\n", nr_cross_allocs, nr_allocs);
L
Li Zefan 已提交
333 334
}

335
static void print_result(struct perf_session *session)
L
Li Zefan 已提交
336 337
{
	if (caller_flag)
338
		__print_result(&root_caller_sorted, session, caller_lines, 1);
L
Li Zefan 已提交
339
	if (alloc_flag)
340
		__print_result(&root_alloc_sorted, session, alloc_lines, 0);
L
Li Zefan 已提交
341 342 343
	print_summary();
}

344 345 346 347 348 349 350 351 352
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 已提交
353
static void sort_insert(struct rb_root *root, struct alloc_stat *data,
354
			struct list_head *sort_list)
L
Li Zefan 已提交
355 356 357
{
	struct rb_node **new = &(root->rb_node);
	struct rb_node *parent = NULL;
358
	struct sort_dimension *sort;
L
Li Zefan 已提交
359 360 361

	while (*new) {
		struct alloc_stat *this;
362
		int cmp = 0;
L
Li Zefan 已提交
363 364 365 366

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

367 368 369 370 371
		list_for_each_entry(sort, sort_list, list) {
			cmp = sort->cmp(data, this);
			if (cmp)
				break;
		}
L
Li Zefan 已提交
372 373 374 375 376 377 378 379 380 381 382 383

		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,
384
			  struct list_head *sort_list)
L
Li Zefan 已提交
385 386 387 388 389 390 391 392 393 394 395
{
	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);
396
		sort_insert(root_sorted, data, sort_list);
L
Li Zefan 已提交
397 398 399 400 401
	}
}

static void sort_result(void)
{
402 403
	__sort_result(&root_alloc_stat, &root_alloc_sorted, &alloc_sort);
	__sort_result(&root_caller_stat, &root_caller_sorted, &caller_sort);
L
Li Zefan 已提交
404 405
}

406
static int __cmd_kmem(void)
L
Li Zefan 已提交
407
{
408
	int err = -EINVAL;
409
	struct perf_session *session;
410 411 412 413 414 415 416 417
	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, },
	};
418 419 420 421
	struct perf_data_file file = {
		.path = input_name,
		.mode = PERF_DATA_MODE_READ,
	};
422

423
	session = perf_session__new(&file, false, &perf_kmem);
424 425 426
	if (session == NULL)
		return -ENOMEM;

427 428 429
	if (perf_session__create_kernel_maps(session) < 0)
		goto out_delete;

430 431 432
	if (!perf_session__has_traces(session, "kmem record"))
		goto out_delete;

433 434 435 436 437
	if (perf_session__set_tracepoints_handlers(session, kmem_tracepoints)) {
		pr_err("Initializing perf session tracepoint handlers failed\n");
		return -1;
	}

L
Li Zefan 已提交
438
	setup_pager();
439
	err = perf_session__process_events(session, &perf_kmem);
440 441
	if (err != 0)
		goto out_delete;
L
Li Zefan 已提交
442
	sort_result();
443 444 445 446
	print_result(session);
out_delete:
	perf_session__delete(session);
	return err;
L
Li Zefan 已提交
447 448 449 450 451 452 453 454 455 456 457
}

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;
}

458 459 460 461 462
static struct sort_dimension ptr_sort_dimension = {
	.name	= "ptr",
	.cmp	= ptr_cmp,
};

L
Li Zefan 已提交
463 464 465 466 467 468 469 470 471
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;
}

472 473 474 475 476
static struct sort_dimension callsite_sort_dimension = {
	.name	= "callsite",
	.cmp	= callsite_cmp,
};

477 478 479 480 481 482 483 484 485
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;
}

486 487 488 489 490
static struct sort_dimension hit_sort_dimension = {
	.name	= "hit",
	.cmp	= hit_cmp,
};

L
Li Zefan 已提交
491 492 493 494 495 496 497 498 499
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;
}

500 501 502 503 504
static struct sort_dimension bytes_sort_dimension = {
	.name	= "bytes",
	.cmp	= bytes_cmp,
};

505 506 507 508 509 510 511 512 513 514 515 516 517 518
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;
}

519 520 521 522 523
static struct sort_dimension frag_sort_dimension = {
	.name	= "frag",
	.cmp	= frag_cmp,
};

524 525 526 527 528 529 530 531 532 533 534 535 536 537
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,
};

538 539 540 541 542 543
static struct sort_dimension *avail_sorts[] = {
	&ptr_sort_dimension,
	&callsite_sort_dimension,
	&hit_sort_dimension,
	&bytes_sort_dimension,
	&frag_sort_dimension,
544
	&pingpong_sort_dimension,
545 546
};

547
#define NUM_AVAIL_SORTS	((int)ARRAY_SIZE(avail_sorts))
548 549 550 551 552 553 554 555

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)) {
556
			sort = memdup(avail_sorts[i], sizeof(*avail_sorts[i]));
557
			if (!sort) {
558
				pr_err("%s: memdup failed\n", __func__);
559 560
				return -1;
			}
561 562 563 564 565 566 567 568 569 570 571 572 573
			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);

574 575 576 577
	if (!str) {
		pr_err("%s: strdup failed\n", __func__);
		return -1;
	}
578 579 580 581 582 583 584

	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 已提交
585
			free(str);
586 587 588 589 590 591 592 593
			return -1;
		}
	}

	free(str);
	return 0;
}

594 595
static int parse_sort_opt(const struct option *opt __maybe_unused,
			  const char *arg, int unset __maybe_unused)
L
Li Zefan 已提交
596 597 598 599 600
{
	if (!arg)
		return -1;

	if (caller_flag > alloc_flag)
601
		return setup_sorting(&caller_sort, arg);
L
Li Zefan 已提交
602
	else
603
		return setup_sorting(&alloc_sort, arg);
L
Li Zefan 已提交
604 605 606 607

	return 0;
}

608 609 610
static int parse_caller_opt(const struct option *opt __maybe_unused,
			    const char *arg __maybe_unused,
			    int unset __maybe_unused)
L
Li Zefan 已提交
611
{
612 613 614
	caller_flag = (alloc_flag + 1);
	return 0;
}
L
Li Zefan 已提交
615

616 617 618
static int parse_alloc_opt(const struct option *opt __maybe_unused,
			   const char *arg __maybe_unused,
			   int unset __maybe_unused)
619 620
{
	alloc_flag = (caller_flag + 1);
L
Li Zefan 已提交
621 622 623
	return 0;
}

624 625
static int parse_line_opt(const struct option *opt __maybe_unused,
			  const char *arg, int unset __maybe_unused)
L
Li Zefan 已提交
626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641
{
	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;
}

642 643 644
static int __cmd_record(int argc, const char **argv)
{
	const char * const record_args[] = {
645
	"record", "-a", "-R", "-c", "1",
L
Li Zefan 已提交
646 647 648 649 650 651
	"-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",
652
	};
L
Li Zefan 已提交
653 654 655 656 657 658
	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 *));

659 660 661
	if (rec_argv == NULL)
		return -ENOMEM;

L
Li Zefan 已提交
662 663 664 665 666 667 668 669 670
	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);
}

671
int cmd_kmem(int argc, const char **argv, const char *prefix __maybe_unused)
L
Li Zefan 已提交
672
{
673 674 675 676 677 678 679 680 681 682 683 684 685 686
	const char * const default_sort_order = "frag,hit,bytes";
	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()
	};
687 688 689
	const char *const kmem_subcommands[] = { "record", "stat", NULL };
	const char *kmem_usage[] = {
		NULL,
690 691
		NULL
	};
692 693
	argc = parse_options_subcommand(argc, argv, kmem_options,
					kmem_subcommands, kmem_usage, 0);
L
Li Zefan 已提交
694

695
	if (!argc)
L
Li Zefan 已提交
696 697
		usage_with_options(kmem_usage, kmem_options);

698 699
	symbol__init();

700 701 702
	if (!strncmp(argv[0], "rec", 3)) {
		return __cmd_record(argc, argv);
	} else if (!strcmp(argv[0], "stat")) {
703
		if (cpu__setup_cpunode_map())
704
			return -1;
705 706 707 708 709

		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 已提交
710

711
		return __cmd_kmem();
712 713
	} else
		usage_with_options(kmem_usage, kmem_options);
714

715
	return 0;
L
Li Zefan 已提交
716 717
}