builtin-kmem.c 44.4 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"
13
#include "util/callchain.h"
L
Li Zefan 已提交
14 15 16

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

#include "util/debug.h"

#include <linux/rbtree.h>
23
#include <linux/string.h>
24
#include <locale.h>
25
#include <regex.h>
L
Li Zefan 已提交
26

27 28 29 30
static int	kmem_slab;
static int	kmem_page;

static long	kmem_page_size;
31 32 33 34
static enum {
	KMEM_SLAB,
	KMEM_PAGE,
} kmem_default = KMEM_SLAB;  /* for backward compatibility */
35

L
Li Zefan 已提交
36
struct alloc_stat;
37
typedef int (*sort_fn_t)(void *, void *);
L
Li Zefan 已提交
38 39 40 41 42 43 44

static int			alloc_flag;
static int			caller_flag;

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

45 46
static bool			raw_ip;

L
Li Zefan 已提交
47
struct alloc_stat {
48 49
	u64	call_site;
	u64	ptr;
L
Li Zefan 已提交
50 51 52
	u64	bytes_req;
	u64	bytes_alloc;
	u32	hit;
53 54 55
	u32	pingpong;

	short	alloc_cpu;
L
Li Zefan 已提交
56 57 58 59 60 61 62 63 64 65

	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;
66
static unsigned long nr_allocs, nr_cross_allocs;
L
Li Zefan 已提交
67

68 69
static int insert_alloc_stat(unsigned long call_site, unsigned long ptr,
			     int bytes_req, int bytes_alloc, int cpu)
L
Li Zefan 已提交
70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89
{
	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 已提交
90
		data->bytes_alloc += bytes_alloc;
L
Li Zefan 已提交
91 92
	} else {
		data = malloc(sizeof(*data));
93 94 95 96
		if (!data) {
			pr_err("%s: malloc failed\n", __func__);
			return -1;
		}
L
Li Zefan 已提交
97
		data->ptr = ptr;
98
		data->pingpong = 0;
L
Li Zefan 已提交
99 100 101 102 103 104 105
		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);
	}
106 107
	data->call_site = call_site;
	data->alloc_cpu = cpu;
108
	return 0;
L
Li Zefan 已提交
109 110
}

111
static int insert_caller_stat(unsigned long call_site,
L
Li Zefan 已提交
112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132
			      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 已提交
133
		data->bytes_alloc += bytes_alloc;
L
Li Zefan 已提交
134 135
	} else {
		data = malloc(sizeof(*data));
136 137 138 139
		if (!data) {
			pr_err("%s: malloc failed\n", __func__);
			return -1;
		}
L
Li Zefan 已提交
140
		data->call_site = call_site;
141
		data->pingpong = 0;
L
Li Zefan 已提交
142 143 144 145 146 147 148
		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);
	}
149 150

	return 0;
L
Li Zefan 已提交
151 152
}

153
static int perf_evsel__process_alloc_event(struct perf_evsel *evsel,
154
					   struct perf_sample *sample)
L
Li Zefan 已提交
155
{
156 157 158 159 160 161
	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) ||
162 163
	    insert_caller_stat(call_site, bytes_req, bytes_alloc))
		return -1;
L
Li Zefan 已提交
164 165 166

	total_requested += bytes_req;
	total_allocated += bytes_alloc;
167

168 169 170 171 172 173 174 175 176 177
	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) {
178
		int node1 = cpu__get_node(sample->cpu),
179 180
		    node2 = perf_evsel__intval(evsel, sample, "node");

181 182 183
		if (node1 != node2)
			nr_cross_allocs++;
	}
184 185

	return ret;
L
Li Zefan 已提交
186 187
}

188 189
static int ptr_cmp(void *, void *);
static int slab_callsite_cmp(void *, void *);
190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215

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

216 217
static int perf_evsel__process_free_event(struct perf_evsel *evsel,
					  struct perf_sample *sample)
L
Li Zefan 已提交
218
{
219
	unsigned long ptr = perf_evsel__intval(evsel, sample, "ptr");
220 221 222 223
	struct alloc_stat *s_alloc, *s_caller;

	s_alloc = search_alloc_stat(ptr, 0, &root_alloc_stat, ptr_cmp);
	if (!s_alloc)
224
		return 0;
225

226
	if ((short)sample->cpu != s_alloc->alloc_cpu) {
227 228 229
		s_alloc->pingpong++;

		s_caller = search_alloc_stat(0, s_alloc->call_site,
230 231
					     &root_caller_stat,
					     slab_callsite_cmp);
232 233
		if (!s_caller)
			return -1;
234 235 236
		s_caller->pingpong++;
	}
	s_alloc->alloc_cpu = -1;
237 238

	return 0;
L
Li Zefan 已提交
239 240
}

241 242 243 244 245 246 247 248 249 250
static u64 total_page_alloc_bytes;
static u64 total_page_free_bytes;
static u64 total_page_nomatch_bytes;
static u64 total_page_fail_bytes;
static unsigned long nr_page_allocs;
static unsigned long nr_page_frees;
static unsigned long nr_page_fails;
static unsigned long nr_page_nomatch;

static bool use_pfn;
251
static bool live_page;
252
static struct perf_session *kmem_session;
253 254 255 256 257 258 259 260 261

#define MAX_MIGRATE_TYPES  6
#define MAX_PAGE_ORDER     11

static int order_stats[MAX_PAGE_ORDER][MAX_MIGRATE_TYPES];

struct page_stat {
	struct rb_node 	node;
	u64 		page;
262
	u64 		callsite;
263 264 265 266 267 268 269 270 271
	int 		order;
	unsigned 	gfp_flags;
	unsigned 	migrate_type;
	u64		alloc_bytes;
	u64 		free_bytes;
	int 		nr_alloc;
	int 		nr_free;
};

272
static struct rb_root page_live_tree;
273 274
static struct rb_root page_alloc_tree;
static struct rb_root page_alloc_sorted;
275 276
static struct rb_root page_caller_tree;
static struct rb_root page_caller_sorted;
277

278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410
struct alloc_func {
	u64 start;
	u64 end;
	char *name;
};

static int nr_alloc_funcs;
static struct alloc_func *alloc_func_list;

static int funcmp(const void *a, const void *b)
{
	const struct alloc_func *fa = a;
	const struct alloc_func *fb = b;

	if (fa->start > fb->start)
		return 1;
	else
		return -1;
}

static int callcmp(const void *a, const void *b)
{
	const struct alloc_func *fa = a;
	const struct alloc_func *fb = b;

	if (fb->start <= fa->start && fa->end < fb->end)
		return 0;

	if (fa->start > fb->start)
		return 1;
	else
		return -1;
}

static int build_alloc_func_list(void)
{
	int ret;
	struct map *kernel_map;
	struct symbol *sym;
	struct rb_node *node;
	struct alloc_func *func;
	struct machine *machine = &kmem_session->machines.host;
	regex_t alloc_func_regex;
	const char pattern[] = "^_?_?(alloc|get_free|get_zeroed)_pages?";

	ret = regcomp(&alloc_func_regex, pattern, REG_EXTENDED);
	if (ret) {
		char err[BUFSIZ];

		regerror(ret, &alloc_func_regex, err, sizeof(err));
		pr_err("Invalid regex: %s\n%s", pattern, err);
		return -EINVAL;
	}

	kernel_map = machine->vmlinux_maps[MAP__FUNCTION];
	if (map__load(kernel_map, NULL) < 0) {
		pr_err("cannot load kernel map\n");
		return -ENOENT;
	}

	map__for_each_symbol(kernel_map, sym, node) {
		if (regexec(&alloc_func_regex, sym->name, 0, NULL, 0))
			continue;

		func = realloc(alloc_func_list,
			       (nr_alloc_funcs + 1) * sizeof(*func));
		if (func == NULL)
			return -ENOMEM;

		pr_debug("alloc func: %s\n", sym->name);
		func[nr_alloc_funcs].start = sym->start;
		func[nr_alloc_funcs].end   = sym->end;
		func[nr_alloc_funcs].name  = sym->name;

		alloc_func_list = func;
		nr_alloc_funcs++;
	}

	qsort(alloc_func_list, nr_alloc_funcs, sizeof(*func), funcmp);

	regfree(&alloc_func_regex);
	return 0;
}

/*
 * Find first non-memory allocation function from callchain.
 * The allocation functions are in the 'alloc_func_list'.
 */
static u64 find_callsite(struct perf_evsel *evsel, struct perf_sample *sample)
{
	struct addr_location al;
	struct machine *machine = &kmem_session->machines.host;
	struct callchain_cursor_node *node;

	if (alloc_func_list == NULL) {
		if (build_alloc_func_list() < 0)
			goto out;
	}

	al.thread = machine__findnew_thread(machine, sample->pid, sample->tid);
	sample__resolve_callchain(sample, NULL, evsel, &al, 16);

	callchain_cursor_commit(&callchain_cursor);
	while (true) {
		struct alloc_func key, *caller;
		u64 addr;

		node = callchain_cursor_current(&callchain_cursor);
		if (node == NULL)
			break;

		key.start = key.end = node->ip;
		caller = bsearch(&key, alloc_func_list, nr_alloc_funcs,
				 sizeof(key), callcmp);
		if (!caller) {
			/* found */
			if (node->map)
				addr = map__unmap_ip(node->map, node->ip);
			else
				addr = node->ip;

			return addr;
		} else
			pr_debug3("skipping alloc function: %s\n", caller->name);

		callchain_cursor_advance(&callchain_cursor);
	}

out:
	pr_debug2("unknown callsite: %"PRIx64 "\n", sample->ip);
	return sample->ip;
}

411 412 413 414 415 416 417 418 419
struct sort_dimension {
	const char		name[20];
	sort_fn_t		cmp;
	struct list_head	list;
};

static LIST_HEAD(page_alloc_sort_input);
static LIST_HEAD(page_caller_sort_input);

420
static struct page_stat *
421
__page_stat__findnew_page(struct page_stat *pstat, bool create)
422
{
423
	struct rb_node **node = &page_live_tree.rb_node;
424 425 426 427 428 429 430 431 432
	struct rb_node *parent = NULL;
	struct page_stat *data;

	while (*node) {
		s64 cmp;

		parent = *node;
		data = rb_entry(*node, struct page_stat, node);

433
		cmp = data->page - pstat->page;
434 435 436 437 438 439 440 441 442 443 444 445 446
		if (cmp < 0)
			node = &parent->rb_left;
		else if (cmp > 0)
			node = &parent->rb_right;
		else
			return data;
	}

	if (!create)
		return NULL;

	data = zalloc(sizeof(*data));
	if (data != NULL) {
447 448 449 450
		data->page = pstat->page;
		data->order = pstat->order;
		data->gfp_flags = pstat->gfp_flags;
		data->migrate_type = pstat->migrate_type;
451 452

		rb_link_node(&data->node, parent, node);
453
		rb_insert_color(&data->node, &page_live_tree);
454 455 456 457 458
	}

	return data;
}

459
static struct page_stat *page_stat__find_page(struct page_stat *pstat)
460
{
461
	return __page_stat__findnew_page(pstat, false);
462 463
}

464
static struct page_stat *page_stat__findnew_page(struct page_stat *pstat)
465
{
466
	return __page_stat__findnew_page(pstat, true);
467 468 469 470
}

static struct page_stat *
__page_stat__findnew_alloc(struct page_stat *pstat, bool create)
471 472 473 474
{
	struct rb_node **node = &page_alloc_tree.rb_node;
	struct rb_node *parent = NULL;
	struct page_stat *data;
475
	struct sort_dimension *sort;
476 477

	while (*node) {
478
		int cmp = 0;
479 480 481 482

		parent = *node;
		data = rb_entry(*node, struct page_stat, node);

483 484 485 486 487 488
		list_for_each_entry(sort, &page_alloc_sort_input, list) {
			cmp = sort->cmp(pstat, data);
			if (cmp)
				break;
		}

489 490 491 492 493 494 495 496 497 498 499 500 501
		if (cmp < 0)
			node = &parent->rb_left;
		else if (cmp > 0)
			node = &parent->rb_right;
		else
			return data;
	}

	if (!create)
		return NULL;

	data = zalloc(sizeof(*data));
	if (data != NULL) {
502 503 504 505
		data->page = pstat->page;
		data->order = pstat->order;
		data->gfp_flags = pstat->gfp_flags;
		data->migrate_type = pstat->migrate_type;
506 507 508 509 510 511 512 513

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

	return data;
}

514 515 516 517 518 519 520 521 522 523 524
static struct page_stat *page_stat__find_alloc(struct page_stat *pstat)
{
	return __page_stat__findnew_alloc(pstat, false);
}

static struct page_stat *page_stat__findnew_alloc(struct page_stat *pstat)
{
	return __page_stat__findnew_alloc(pstat, true);
}

static struct page_stat *
525
__page_stat__findnew_caller(struct page_stat *pstat, bool create)
526 527 528 529
{
	struct rb_node **node = &page_caller_tree.rb_node;
	struct rb_node *parent = NULL;
	struct page_stat *data;
530
	struct sort_dimension *sort;
531 532

	while (*node) {
533
		int cmp = 0;
534 535 536 537

		parent = *node;
		data = rb_entry(*node, struct page_stat, node);

538 539 540 541 542 543
		list_for_each_entry(sort, &page_caller_sort_input, list) {
			cmp = sort->cmp(pstat, data);
			if (cmp)
				break;
		}

544 545 546 547 548 549 550 551 552 553 554 555 556
		if (cmp < 0)
			node = &parent->rb_left;
		else if (cmp > 0)
			node = &parent->rb_right;
		else
			return data;
	}

	if (!create)
		return NULL;

	data = zalloc(sizeof(*data));
	if (data != NULL) {
557 558 559 560
		data->callsite = pstat->callsite;
		data->order = pstat->order;
		data->gfp_flags = pstat->gfp_flags;
		data->migrate_type = pstat->migrate_type;
561 562 563 564 565 566 567 568

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

	return data;
}

569
static struct page_stat *page_stat__find_caller(struct page_stat *pstat)
570
{
571
	return __page_stat__findnew_caller(pstat, false);
572 573
}

574
static struct page_stat *page_stat__findnew_caller(struct page_stat *pstat)
575
{
576
	return __page_stat__findnew_caller(pstat, true);
577 578
}

579 580 581 582 583 584 585 586 587
static bool valid_page(u64 pfn_or_page)
{
	if (use_pfn && pfn_or_page == -1UL)
		return false;
	if (!use_pfn && pfn_or_page == 0)
		return false;
	return true;
}

588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757
struct gfp_flag {
	unsigned int flags;
	char *compact_str;
	char *human_readable;
};

static struct gfp_flag *gfps;
static int nr_gfps;

static int gfpcmp(const void *a, const void *b)
{
	const struct gfp_flag *fa = a;
	const struct gfp_flag *fb = b;

	return fa->flags - fb->flags;
}

/* see include/trace/events/gfpflags.h */
static const struct {
	const char *original;
	const char *compact;
} gfp_compact_table[] = {
	{ "GFP_TRANSHUGE",		"THP" },
	{ "GFP_HIGHUSER_MOVABLE",	"HUM" },
	{ "GFP_HIGHUSER",		"HU" },
	{ "GFP_USER",			"U" },
	{ "GFP_TEMPORARY",		"TMP" },
	{ "GFP_KERNEL",			"K" },
	{ "GFP_NOFS",			"NF" },
	{ "GFP_ATOMIC",			"A" },
	{ "GFP_NOIO",			"NI" },
	{ "GFP_HIGH",			"H" },
	{ "GFP_WAIT",			"W" },
	{ "GFP_IO",			"I" },
	{ "GFP_COLD",			"CO" },
	{ "GFP_NOWARN",			"NWR" },
	{ "GFP_REPEAT",			"R" },
	{ "GFP_NOFAIL",			"NF" },
	{ "GFP_NORETRY",		"NR" },
	{ "GFP_COMP",			"C" },
	{ "GFP_ZERO",			"Z" },
	{ "GFP_NOMEMALLOC",		"NMA" },
	{ "GFP_MEMALLOC",		"MA" },
	{ "GFP_HARDWALL",		"HW" },
	{ "GFP_THISNODE",		"TN" },
	{ "GFP_RECLAIMABLE",		"RC" },
	{ "GFP_MOVABLE",		"M" },
	{ "GFP_NOTRACK",		"NT" },
	{ "GFP_NO_KSWAPD",		"NK" },
	{ "GFP_OTHER_NODE",		"ON" },
	{ "GFP_NOWAIT",			"NW" },
};

static size_t max_gfp_len;

static char *compact_gfp_flags(char *gfp_flags)
{
	char *orig_flags = strdup(gfp_flags);
	char *new_flags = NULL;
	char *str, *pos;
	size_t len = 0;

	if (orig_flags == NULL)
		return NULL;

	str = strtok_r(orig_flags, "|", &pos);
	while (str) {
		size_t i;
		char *new;
		const char *cpt;

		for (i = 0; i < ARRAY_SIZE(gfp_compact_table); i++) {
			if (strcmp(gfp_compact_table[i].original, str))
				continue;

			cpt = gfp_compact_table[i].compact;
			new = realloc(new_flags, len + strlen(cpt) + 2);
			if (new == NULL) {
				free(new_flags);
				return NULL;
			}

			new_flags = new;

			if (!len) {
				strcpy(new_flags, cpt);
			} else {
				strcat(new_flags, "|");
				strcat(new_flags, cpt);
				len++;
			}

			len += strlen(cpt);
		}

		str = strtok_r(NULL, "|", &pos);
	}

	if (max_gfp_len < len)
		max_gfp_len = len;

	free(orig_flags);
	return new_flags;
}

static char *compact_gfp_string(unsigned long gfp_flags)
{
	struct gfp_flag key = {
		.flags = gfp_flags,
	};
	struct gfp_flag *gfp;

	gfp = bsearch(&key, gfps, nr_gfps, sizeof(*gfps), gfpcmp);
	if (gfp)
		return gfp->compact_str;

	return NULL;
}

static int parse_gfp_flags(struct perf_evsel *evsel, struct perf_sample *sample,
			   unsigned int gfp_flags)
{
	struct pevent_record record = {
		.cpu = sample->cpu,
		.data = sample->raw_data,
		.size = sample->raw_size,
	};
	struct trace_seq seq;
	char *str, *pos;

	if (nr_gfps) {
		struct gfp_flag key = {
			.flags = gfp_flags,
		};

		if (bsearch(&key, gfps, nr_gfps, sizeof(*gfps), gfpcmp))
			return 0;
	}

	trace_seq_init(&seq);
	pevent_event_info(&seq, evsel->tp_format, &record);

	str = strtok_r(seq.buffer, " ", &pos);
	while (str) {
		if (!strncmp(str, "gfp_flags=", 10)) {
			struct gfp_flag *new;

			new = realloc(gfps, (nr_gfps + 1) * sizeof(*gfps));
			if (new == NULL)
				return -ENOMEM;

			gfps = new;
			new += nr_gfps++;

			new->flags = gfp_flags;
			new->human_readable = strdup(str + 10);
			new->compact_str = compact_gfp_flags(str + 10);
			if (!new->human_readable || !new->compact_str)
				return -ENOMEM;

			qsort(gfps, nr_gfps, sizeof(*gfps), gfpcmp);
		}

		str = strtok_r(NULL, " ", &pos);
	}

	trace_seq_destroy(&seq);
	return 0;
}

758 759 760 761 762 763 764 765 766
static int perf_evsel__process_page_alloc_event(struct perf_evsel *evsel,
						struct perf_sample *sample)
{
	u64 page;
	unsigned int order = perf_evsel__intval(evsel, sample, "order");
	unsigned int gfp_flags = perf_evsel__intval(evsel, sample, "gfp_flags");
	unsigned int migrate_type = perf_evsel__intval(evsel, sample,
						       "migratetype");
	u64 bytes = kmem_page_size << order;
767
	u64 callsite;
768
	struct page_stat *pstat;
769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789
	struct page_stat this = {
		.order = order,
		.gfp_flags = gfp_flags,
		.migrate_type = migrate_type,
	};

	if (use_pfn)
		page = perf_evsel__intval(evsel, sample, "pfn");
	else
		page = perf_evsel__intval(evsel, sample, "page");

	nr_page_allocs++;
	total_page_alloc_bytes += bytes;

	if (!valid_page(page)) {
		nr_page_fails++;
		total_page_fail_bytes += bytes;

		return 0;
	}

790 791 792
	if (parse_gfp_flags(evsel, sample, gfp_flags) < 0)
		return -1;

793 794
	callsite = find_callsite(evsel, sample);

795 796 797 798 799
	/*
	 * This is to find the current page (with correct gfp flags and
	 * migrate type) at free event.
	 */
	this.page = page;
800
	pstat = page_stat__findnew_page(&this);
801
	if (pstat == NULL)
802 803
		return -ENOMEM;

804 805 806 807
	pstat->nr_alloc++;
	pstat->alloc_bytes += bytes;
	pstat->callsite = callsite;

808 809 810 811 812 813 814 815 816 817
	if (!live_page) {
		pstat = page_stat__findnew_alloc(&this);
		if (pstat == NULL)
			return -ENOMEM;

		pstat->nr_alloc++;
		pstat->alloc_bytes += bytes;
		pstat->callsite = callsite;
	}

818 819
	this.callsite = callsite;
	pstat = page_stat__findnew_caller(&this);
820 821 822
	if (pstat == NULL)
		return -ENOMEM;

823 824
	pstat->nr_alloc++;
	pstat->alloc_bytes += bytes;
825 826 827 828 829 830 831 832 833 834 835 836

	order_stats[order][migrate_type]++;

	return 0;
}

static int perf_evsel__process_page_free_event(struct perf_evsel *evsel,
						struct perf_sample *sample)
{
	u64 page;
	unsigned int order = perf_evsel__intval(evsel, sample, "order");
	u64 bytes = kmem_page_size << order;
837
	struct page_stat *pstat;
838 839 840 841 842 843 844 845 846 847 848 849
	struct page_stat this = {
		.order = order,
	};

	if (use_pfn)
		page = perf_evsel__intval(evsel, sample, "pfn");
	else
		page = perf_evsel__intval(evsel, sample, "page");

	nr_page_frees++;
	total_page_free_bytes += bytes;

850 851
	this.page = page;
	pstat = page_stat__find_page(&this);
852
	if (pstat == NULL) {
853 854 855 856 857 858 859 860 861
		pr_debug2("missing free at page %"PRIx64" (order: %d)\n",
			  page, order);

		nr_page_nomatch++;
		total_page_nomatch_bytes += bytes;

		return 0;
	}

862 863
	this.gfp_flags = pstat->gfp_flags;
	this.migrate_type = pstat->migrate_type;
864
	this.callsite = pstat->callsite;
865

866
	rb_erase(&pstat->node, &page_live_tree);
867
	free(pstat);
868

869 870 871 872 873 874
	if (live_page) {
		order_stats[this.order][this.migrate_type]--;
	} else {
		pstat = page_stat__find_alloc(&this);
		if (pstat == NULL)
			return -ENOMEM;
875

876 877 878
		pstat->nr_free++;
		pstat->free_bytes += bytes;
	}
879

880
	pstat = page_stat__find_caller(&this);
881
	if (pstat == NULL)
882 883
		return -ENOENT;

884 885
	pstat->nr_free++;
	pstat->free_bytes += bytes;
886

887 888 889 890 891 892 893 894 895 896
	if (live_page) {
		pstat->nr_alloc--;
		pstat->alloc_bytes -= bytes;

		if (pstat->nr_alloc == 0) {
			rb_erase(&pstat->node, &page_caller_tree);
			free(pstat);
		}
	}

897 898 899
	return 0;
}

900 901
typedef int (*tracepoint_handler)(struct perf_evsel *evsel,
				  struct perf_sample *sample);
L
Li Zefan 已提交
902

903
static int process_sample_event(struct perf_tool *tool __maybe_unused,
904
				union perf_event *event,
905
				struct perf_sample *sample,
906
				struct perf_evsel *evsel,
907
				struct machine *machine)
L
Li Zefan 已提交
908
{
909
	struct thread *thread = machine__findnew_thread(machine, sample->pid,
910
							sample->tid);
L
Li Zefan 已提交
911 912 913 914 915 916 917

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

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

920 921
	if (evsel->handler != NULL) {
		tracepoint_handler f = evsel->handler;
922 923 924 925
		return f(evsel, sample);
	}

	return 0;
L
Li Zefan 已提交
926 927
}

928 929 930
static struct perf_tool perf_kmem = {
	.sample		 = process_sample_event,
	.comm		 = perf_event__process_comm,
931 932
	.mmap		 = perf_event__process_mmap,
	.mmap2		 = perf_event__process_mmap2,
933
	.ordered_events	 = true,
L
Li Zefan 已提交
934 935 936 937 938 939 940 941 942 943
};

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

944 945 946
static void __print_slab_result(struct rb_root *root,
				struct perf_session *session,
				int n_lines, int is_caller)
L
Li Zefan 已提交
947 948
{
	struct rb_node *next;
949
	struct machine *machine = &session->machines.host;
L
Li Zefan 已提交
950

951
	printf("%.105s\n", graph_dotted_line);
952
	printf(" %-34s |",  is_caller ? "Callsite": "Alloc Ptr");
953
	printf(" Total_alloc/Per | Total_req/Per   | Hit      | Ping-pong | Frag\n");
954
	printf("%.105s\n", graph_dotted_line);
L
Li Zefan 已提交
955 956 957 958

	next = rb_first(root);

	while (next && n_lines--) {
959 960 961
		struct alloc_stat *data = rb_entry(next, struct alloc_stat,
						   node);
		struct symbol *sym = NULL;
962
		struct map *map;
963
		char buf[BUFSIZ];
964 965 966 967
		u64 addr;

		if (is_caller) {
			addr = data->call_site;
968
			if (!raw_ip)
969
				sym = machine__find_kernel_function(machine, addr, &map, NULL);
970 971 972 973
		} else
			addr = data->ptr;

		if (sym != NULL)
974
			snprintf(buf, sizeof(buf), "%s+%" PRIx64 "", sym->name,
975
				 addr - map->unmap_ip(map, sym->start));
976
		else
977
			snprintf(buf, sizeof(buf), "%#" PRIx64 "", addr);
978
		printf(" %-34s |", buf);
L
Li Zefan 已提交
979

980
		printf(" %9llu/%-5lu | %9llu/%-5lu | %8lu | %9lu | %6.3f%%\n",
981
		       (unsigned long long)data->bytes_alloc,
L
Li Zefan 已提交
982 983 984 985
		       (unsigned long)data->bytes_alloc / data->hit,
		       (unsigned long long)data->bytes_req,
		       (unsigned long)data->bytes_req / data->hit,
		       (unsigned long)data->hit,
986
		       (unsigned long)data->pingpong,
L
Li Zefan 已提交
987 988 989 990 991 992
		       fragmentation(data->bytes_req, data->bytes_alloc));

		next = rb_next(next);
	}

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

995
	printf("%.105s\n", graph_dotted_line);
L
Li Zefan 已提交
996 997
}

998 999 1000 1001 1002 1003 1004 1005 1006
static const char * const migrate_type_str[] = {
	"UNMOVABL",
	"RECLAIM",
	"MOVABLE",
	"RESERVED",
	"CMA/ISLT",
	"UNKNOWN",
};

1007
static void __print_page_alloc_result(struct perf_session *session, int n_lines)
1008
{
1009 1010
	struct rb_node *next = rb_first(&page_alloc_sorted);
	struct machine *machine = &session->machines.host;
1011
	const char *format;
1012
	int gfp_len = max(strlen("GFP flags"), max_gfp_len);
1013

1014
	printf("\n%.105s\n", graph_dotted_line);
1015 1016 1017
	printf(" %-16s | %5s alloc (KB) | Hits      | Order | Mig.type | %-*s | Callsite\n",
	       use_pfn ? "PFN" : "Page", live_page ? "Live" : "Total",
	       gfp_len, "GFP flags");
1018
	printf("%.105s\n", graph_dotted_line);
1019 1020

	if (use_pfn)
1021
		format = " %16llu | %'16llu | %'9d | %5d | %8s | %-*s | %s\n";
1022
	else
1023
		format = " %016llx | %'16llu | %'9d | %5d | %8s | %-*s | %s\n";
1024 1025 1026

	while (next && n_lines--) {
		struct page_stat *data;
1027 1028 1029 1030
		struct symbol *sym;
		struct map *map;
		char buf[32];
		char *caller = buf;
1031 1032

		data = rb_entry(next, struct page_stat, node);
1033 1034 1035 1036 1037 1038
		sym = machine__find_kernel_function(machine, data->callsite,
						    &map, NULL);
		if (sym && sym->name)
			caller = sym->name;
		else
			scnprintf(buf, sizeof(buf), "%"PRIx64, data->callsite);
1039 1040 1041 1042 1043

		printf(format, (unsigned long long)data->page,
		       (unsigned long long)data->alloc_bytes / 1024,
		       data->nr_alloc, data->order,
		       migrate_type_str[data->migrate_type],
1044
		       gfp_len, compact_gfp_string(data->gfp_flags), caller);
1045 1046 1047 1048

		next = rb_next(next);
	}

1049 1050 1051 1052
	if (n_lines == -1) {
		printf(" ...              | ...              | ...       | ...   | ...      | %-*s | ...\n",
		       gfp_len, "...");
	}
1053

1054 1055 1056 1057 1058 1059 1060
	printf("%.105s\n", graph_dotted_line);
}

static void __print_page_caller_result(struct perf_session *session, int n_lines)
{
	struct rb_node *next = rb_first(&page_caller_sorted);
	struct machine *machine = &session->machines.host;
1061
	int gfp_len = max(strlen("GFP flags"), max_gfp_len);
1062 1063

	printf("\n%.105s\n", graph_dotted_line);
1064 1065
	printf(" %5s alloc (KB) | Hits      | Order | Mig.type | %-*s | Callsite\n",
	       live_page ? "Live" : "Total", gfp_len, "GFP flags");
1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082
	printf("%.105s\n", graph_dotted_line);

	while (next && n_lines--) {
		struct page_stat *data;
		struct symbol *sym;
		struct map *map;
		char buf[32];
		char *caller = buf;

		data = rb_entry(next, struct page_stat, node);
		sym = machine__find_kernel_function(machine, data->callsite,
						    &map, NULL);
		if (sym && sym->name)
			caller = sym->name;
		else
			scnprintf(buf, sizeof(buf), "%"PRIx64, data->callsite);

1083
		printf(" %'16llu | %'9d | %5d | %8s | %-*s | %s\n",
1084 1085 1086
		       (unsigned long long)data->alloc_bytes / 1024,
		       data->nr_alloc, data->order,
		       migrate_type_str[data->migrate_type],
1087
		       gfp_len, compact_gfp_string(data->gfp_flags), caller);
1088 1089 1090 1091

		next = rb_next(next);
	}

1092 1093 1094 1095
	if (n_lines == -1) {
		printf(" ...              | ...       | ...   | ...      | %-*s | ...\n",
		       gfp_len, "...");
	}
1096 1097

	printf("%.105s\n", graph_dotted_line);
1098 1099
}

1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113
static void print_gfp_flags(void)
{
	int i;

	printf("#\n");
	printf("# GFP flags\n");
	printf("# ---------\n");
	for (i = 0; i < nr_gfps; i++) {
		printf("# %08x: %*s: %s\n", gfps[i].flags,
		       (int) max_gfp_len, gfps[i].compact_str,
		       gfps[i].human_readable);
	}
}

1114
static void print_slab_summary(void)
L
Li Zefan 已提交
1115
{
1116 1117
	printf("\nSUMMARY (SLAB allocator)");
	printf("\n========================\n");
1118 1119 1120
	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",
L
Li Zefan 已提交
1121 1122 1123
	       total_allocated - total_requested);
	printf("Internal fragmentation: %f%%\n",
	       fragmentation(total_requested, total_allocated));
1124
	printf("Cross CPU allocations: %'lu/%'lu\n", nr_cross_allocs, nr_allocs);
L
Li Zefan 已提交
1125 1126
}

1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172
static void print_page_summary(void)
{
	int o, m;
	u64 nr_alloc_freed = nr_page_frees - nr_page_nomatch;
	u64 total_alloc_freed_bytes = total_page_free_bytes - total_page_nomatch_bytes;

	printf("\nSUMMARY (page allocator)");
	printf("\n========================\n");
	printf("%-30s: %'16lu   [ %'16"PRIu64" KB ]\n", "Total allocation requests",
	       nr_page_allocs, total_page_alloc_bytes / 1024);
	printf("%-30s: %'16lu   [ %'16"PRIu64" KB ]\n", "Total free requests",
	       nr_page_frees, total_page_free_bytes / 1024);
	printf("\n");

	printf("%-30s: %'16lu   [ %'16"PRIu64" KB ]\n", "Total alloc+freed requests",
	       nr_alloc_freed, (total_alloc_freed_bytes) / 1024);
	printf("%-30s: %'16lu   [ %'16"PRIu64" KB ]\n", "Total alloc-only requests",
	       nr_page_allocs - nr_alloc_freed,
	       (total_page_alloc_bytes - total_alloc_freed_bytes) / 1024);
	printf("%-30s: %'16lu   [ %'16"PRIu64" KB ]\n", "Total free-only requests",
	       nr_page_nomatch, total_page_nomatch_bytes / 1024);
	printf("\n");

	printf("%-30s: %'16lu   [ %'16"PRIu64" KB ]\n", "Total allocation failures",
	       nr_page_fails, total_page_fail_bytes / 1024);
	printf("\n");

	printf("%5s  %12s  %12s  %12s  %12s  %12s\n", "Order",  "Unmovable",
	       "Reclaimable", "Movable", "Reserved", "CMA/Isolated");
	printf("%.5s  %.12s  %.12s  %.12s  %.12s  %.12s\n", graph_dotted_line,
	       graph_dotted_line, graph_dotted_line, graph_dotted_line,
	       graph_dotted_line, graph_dotted_line);

	for (o = 0; o < MAX_PAGE_ORDER; o++) {
		printf("%5d", o);
		for (m = 0; m < MAX_MIGRATE_TYPES - 1; m++) {
			if (order_stats[o][m])
				printf("  %'12d", order_stats[o][m]);
			else
				printf("  %12c", '.');
		}
		printf("\n");
	}
}

static void print_slab_result(struct perf_session *session)
L
Li Zefan 已提交
1173 1174
{
	if (caller_flag)
1175 1176 1177 1178 1179 1180 1181 1182
		__print_slab_result(&root_caller_sorted, session, caller_lines, 1);
	if (alloc_flag)
		__print_slab_result(&root_alloc_sorted, session, alloc_lines, 0);
	print_slab_summary();
}

static void print_page_result(struct perf_session *session)
{
1183 1184
	if (caller_flag || alloc_flag)
		print_gfp_flags();
1185 1186
	if (caller_flag)
		__print_page_caller_result(session, caller_lines);
L
Li Zefan 已提交
1187
	if (alloc_flag)
1188
		__print_page_alloc_result(session, alloc_lines);
1189 1190 1191 1192 1193 1194 1195 1196 1197
	print_page_summary();
}

static void print_result(struct perf_session *session)
{
	if (kmem_slab)
		print_slab_result(session);
	if (kmem_page)
		print_page_result(session);
L
Li Zefan 已提交
1198 1199
}

1200 1201 1202 1203
static LIST_HEAD(slab_caller_sort);
static LIST_HEAD(slab_alloc_sort);
static LIST_HEAD(page_caller_sort);
static LIST_HEAD(page_alloc_sort);
1204

1205 1206
static void sort_slab_insert(struct rb_root *root, struct alloc_stat *data,
			     struct list_head *sort_list)
L
Li Zefan 已提交
1207 1208 1209
{
	struct rb_node **new = &(root->rb_node);
	struct rb_node *parent = NULL;
1210
	struct sort_dimension *sort;
L
Li Zefan 已提交
1211 1212 1213

	while (*new) {
		struct alloc_stat *this;
1214
		int cmp = 0;
L
Li Zefan 已提交
1215 1216 1217 1218

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

1219 1220 1221 1222 1223
		list_for_each_entry(sort, sort_list, list) {
			cmp = sort->cmp(data, this);
			if (cmp)
				break;
		}
L
Li Zefan 已提交
1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234

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

1235 1236
static void __sort_slab_result(struct rb_root *root, struct rb_root *root_sorted,
			       struct list_head *sort_list)
L
Li Zefan 已提交
1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247
{
	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);
1248 1249 1250 1251
		sort_slab_insert(root_sorted, data, sort_list);
	}
}

1252 1253
static void sort_page_insert(struct rb_root *root, struct page_stat *data,
			     struct list_head *sort_list)
1254 1255 1256
{
	struct rb_node **new = &root->rb_node;
	struct rb_node *parent = NULL;
1257
	struct sort_dimension *sort;
1258 1259 1260 1261 1262 1263 1264 1265

	while (*new) {
		struct page_stat *this;
		int cmp = 0;

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

1266 1267 1268 1269 1270
		list_for_each_entry(sort, sort_list, list) {
			cmp = sort->cmp(data, this);
			if (cmp)
				break;
		}
1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281

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

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

1282 1283
static void __sort_page_result(struct rb_root *root, struct rb_root *root_sorted,
			       struct list_head *sort_list)
1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294
{
	struct rb_node *node;
	struct page_stat *data;

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

		rb_erase(node, root);
		data = rb_entry(node, struct page_stat, node);
1295
		sort_page_insert(root_sorted, data, sort_list);
L
Li Zefan 已提交
1296 1297 1298 1299 1300
	}
}

static void sort_result(void)
{
1301 1302
	if (kmem_slab) {
		__sort_slab_result(&root_alloc_stat, &root_alloc_sorted,
1303
				   &slab_alloc_sort);
1304
		__sort_slab_result(&root_caller_stat, &root_caller_sorted,
1305
				   &slab_caller_sort);
1306 1307
	}
	if (kmem_page) {
1308 1309 1310 1311 1312 1313 1314
		if (live_page)
			__sort_page_result(&page_live_tree, &page_alloc_sorted,
					   &page_alloc_sort);
		else
			__sort_page_result(&page_alloc_tree, &page_alloc_sorted,
					   &page_alloc_sort);

1315 1316
		__sort_page_result(&page_caller_tree, &page_caller_sorted,
				   &page_caller_sort);
1317
	}
L
Li Zefan 已提交
1318 1319
}

1320
static int __cmd_kmem(struct perf_session *session)
L
Li Zefan 已提交
1321
{
1322
	int err = -EINVAL;
1323
	struct perf_evsel *evsel;
1324
	const struct perf_evsel_str_handler kmem_tracepoints[] = {
1325
		/* slab allocator */
1326 1327 1328 1329 1330 1331
		{ "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, },
1332 1333 1334
		/* page allocator */
		{ "kmem:mm_page_alloc",		perf_evsel__process_page_alloc_event, },
		{ "kmem:mm_page_free",		perf_evsel__process_page_free_event, },
1335
	};
1336

1337
	if (!perf_session__has_traces(session, "kmem record"))
1338
		goto out;
1339

1340 1341
	if (perf_session__set_tracepoints_handlers(session, kmem_tracepoints)) {
		pr_err("Initializing perf session tracepoint handlers failed\n");
1342
		goto out;
1343 1344
	}

1345 1346 1347 1348 1349 1350 1351 1352
	evlist__for_each(session->evlist, evsel) {
		if (!strcmp(perf_evsel__name(evsel), "kmem:mm_page_alloc") &&
		    perf_evsel__field(evsel, "pfn")) {
			use_pfn = true;
			break;
		}
	}

L
Li Zefan 已提交
1353
	setup_pager();
1354
	err = perf_session__process_events(session);
1355 1356
	if (err != 0) {
		pr_err("error during process events: %d\n", err);
1357
		goto out;
1358
	}
L
Li Zefan 已提交
1359
	sort_result();
1360
	print_result(session);
1361
out:
1362
	return err;
L
Li Zefan 已提交
1363 1364
}

1365 1366
/* slab sort keys */
static int ptr_cmp(void *a, void *b)
L
Li Zefan 已提交
1367
{
1368 1369 1370
	struct alloc_stat *l = a;
	struct alloc_stat *r = b;

L
Li Zefan 已提交
1371 1372 1373 1374 1375 1376 1377
	if (l->ptr < r->ptr)
		return -1;
	else if (l->ptr > r->ptr)
		return 1;
	return 0;
}

1378 1379 1380 1381 1382
static struct sort_dimension ptr_sort_dimension = {
	.name	= "ptr",
	.cmp	= ptr_cmp,
};

1383
static int slab_callsite_cmp(void *a, void *b)
L
Li Zefan 已提交
1384
{
1385 1386 1387
	struct alloc_stat *l = a;
	struct alloc_stat *r = b;

L
Li Zefan 已提交
1388 1389 1390 1391 1392 1393 1394
	if (l->call_site < r->call_site)
		return -1;
	else if (l->call_site > r->call_site)
		return 1;
	return 0;
}

1395 1396
static struct sort_dimension callsite_sort_dimension = {
	.name	= "callsite",
1397
	.cmp	= slab_callsite_cmp,
1398 1399
};

1400
static int hit_cmp(void *a, void *b)
1401
{
1402 1403 1404
	struct alloc_stat *l = a;
	struct alloc_stat *r = b;

1405 1406 1407 1408 1409 1410 1411
	if (l->hit < r->hit)
		return -1;
	else if (l->hit > r->hit)
		return 1;
	return 0;
}

1412 1413 1414 1415 1416
static struct sort_dimension hit_sort_dimension = {
	.name	= "hit",
	.cmp	= hit_cmp,
};

1417
static int bytes_cmp(void *a, void *b)
L
Li Zefan 已提交
1418
{
1419 1420 1421
	struct alloc_stat *l = a;
	struct alloc_stat *r = b;

L
Li Zefan 已提交
1422 1423 1424 1425 1426 1427 1428
	if (l->bytes_alloc < r->bytes_alloc)
		return -1;
	else if (l->bytes_alloc > r->bytes_alloc)
		return 1;
	return 0;
}

1429 1430 1431 1432 1433
static struct sort_dimension bytes_sort_dimension = {
	.name	= "bytes",
	.cmp	= bytes_cmp,
};

1434
static int frag_cmp(void *a, void *b)
1435 1436
{
	double x, y;
1437 1438
	struct alloc_stat *l = a;
	struct alloc_stat *r = b;
1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449

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

1450 1451 1452 1453 1454
static struct sort_dimension frag_sort_dimension = {
	.name	= "frag",
	.cmp	= frag_cmp,
};

1455
static int pingpong_cmp(void *a, void *b)
1456
{
1457 1458 1459
	struct alloc_stat *l = a;
	struct alloc_stat *r = b;

1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471
	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,
};

1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600
/* page sort keys */
static int page_cmp(void *a, void *b)
{
	struct page_stat *l = a;
	struct page_stat *r = b;

	if (l->page < r->page)
		return -1;
	else if (l->page > r->page)
		return 1;
	return 0;
}

static struct sort_dimension page_sort_dimension = {
	.name	= "page",
	.cmp	= page_cmp,
};

static int page_callsite_cmp(void *a, void *b)
{
	struct page_stat *l = a;
	struct page_stat *r = b;

	if (l->callsite < r->callsite)
		return -1;
	else if (l->callsite > r->callsite)
		return 1;
	return 0;
}

static struct sort_dimension page_callsite_sort_dimension = {
	.name	= "callsite",
	.cmp	= page_callsite_cmp,
};

static int page_hit_cmp(void *a, void *b)
{
	struct page_stat *l = a;
	struct page_stat *r = b;

	if (l->nr_alloc < r->nr_alloc)
		return -1;
	else if (l->nr_alloc > r->nr_alloc)
		return 1;
	return 0;
}

static struct sort_dimension page_hit_sort_dimension = {
	.name	= "hit",
	.cmp	= page_hit_cmp,
};

static int page_bytes_cmp(void *a, void *b)
{
	struct page_stat *l = a;
	struct page_stat *r = b;

	if (l->alloc_bytes < r->alloc_bytes)
		return -1;
	else if (l->alloc_bytes > r->alloc_bytes)
		return 1;
	return 0;
}

static struct sort_dimension page_bytes_sort_dimension = {
	.name	= "bytes",
	.cmp	= page_bytes_cmp,
};

static int page_order_cmp(void *a, void *b)
{
	struct page_stat *l = a;
	struct page_stat *r = b;

	if (l->order < r->order)
		return -1;
	else if (l->order > r->order)
		return 1;
	return 0;
}

static struct sort_dimension page_order_sort_dimension = {
	.name	= "order",
	.cmp	= page_order_cmp,
};

static int migrate_type_cmp(void *a, void *b)
{
	struct page_stat *l = a;
	struct page_stat *r = b;

	/* for internal use to find free'd page */
	if (l->migrate_type == -1U)
		return 0;

	if (l->migrate_type < r->migrate_type)
		return -1;
	else if (l->migrate_type > r->migrate_type)
		return 1;
	return 0;
}

static struct sort_dimension migrate_type_sort_dimension = {
	.name	= "migtype",
	.cmp	= migrate_type_cmp,
};

static int gfp_flags_cmp(void *a, void *b)
{
	struct page_stat *l = a;
	struct page_stat *r = b;

	/* for internal use to find free'd page */
	if (l->gfp_flags == -1U)
		return 0;

	if (l->gfp_flags < r->gfp_flags)
		return -1;
	else if (l->gfp_flags > r->gfp_flags)
		return 1;
	return 0;
}

static struct sort_dimension gfp_flags_sort_dimension = {
	.name	= "gfp",
	.cmp	= gfp_flags_cmp,
};

static struct sort_dimension *slab_sorts[] = {
1601 1602 1603 1604 1605
	&ptr_sort_dimension,
	&callsite_sort_dimension,
	&hit_sort_dimension,
	&bytes_sort_dimension,
	&frag_sort_dimension,
1606
	&pingpong_sort_dimension,
1607 1608
};

1609 1610 1611 1612 1613 1614 1615 1616 1617
static struct sort_dimension *page_sorts[] = {
	&page_sort_dimension,
	&page_callsite_sort_dimension,
	&page_hit_sort_dimension,
	&page_bytes_sort_dimension,
	&page_order_sort_dimension,
	&migrate_type_sort_dimension,
	&gfp_flags_sort_dimension,
};
1618

1619
static int slab_sort_dimension__add(const char *tok, struct list_head *list)
1620 1621 1622 1623
{
	struct sort_dimension *sort;
	int i;

1624 1625 1626
	for (i = 0; i < (int)ARRAY_SIZE(slab_sorts); i++) {
		if (!strcmp(slab_sorts[i]->name, tok)) {
			sort = memdup(slab_sorts[i], sizeof(*slab_sorts[i]));
1627
			if (!sort) {
1628
				pr_err("%s: memdup failed\n", __func__);
1629 1630
				return -1;
			}
1631 1632 1633 1634 1635 1636 1637 1638
			list_add_tail(&sort->list, list);
			return 0;
		}
	}

	return -1;
}

1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659
static int page_sort_dimension__add(const char *tok, struct list_head *list)
{
	struct sort_dimension *sort;
	int i;

	for (i = 0; i < (int)ARRAY_SIZE(page_sorts); i++) {
		if (!strcmp(page_sorts[i]->name, tok)) {
			sort = memdup(page_sorts[i], sizeof(*page_sorts[i]));
			if (!sort) {
				pr_err("%s: memdup failed\n", __func__);
				return -1;
			}
			list_add_tail(&sort->list, list);
			return 0;
		}
	}

	return -1;
}

static int setup_slab_sorting(struct list_head *sort_list, const char *arg)
1660 1661 1662
{
	char *tok;
	char *str = strdup(arg);
1663
	char *pos = str;
1664

1665 1666 1667 1668
	if (!str) {
		pr_err("%s: strdup failed\n", __func__);
		return -1;
	}
1669 1670

	while (true) {
1671
		tok = strsep(&pos, ",");
1672 1673
		if (!tok)
			break;
1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701
		if (slab_sort_dimension__add(tok, sort_list) < 0) {
			error("Unknown slab --sort key: '%s'", tok);
			free(str);
			return -1;
		}
	}

	free(str);
	return 0;
}

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

	if (!str) {
		pr_err("%s: strdup failed\n", __func__);
		return -1;
	}

	while (true) {
		tok = strsep(&pos, ",");
		if (!tok)
			break;
		if (page_sort_dimension__add(tok, sort_list) < 0) {
			error("Unknown page --sort key: '%s'", tok);
N
Namhyung Kim 已提交
1702
			free(str);
1703 1704 1705 1706 1707 1708 1709 1710
			return -1;
		}
	}

	free(str);
	return 0;
}

1711 1712
static int parse_sort_opt(const struct option *opt __maybe_unused,
			  const char *arg, int unset __maybe_unused)
L
Li Zefan 已提交
1713 1714 1715 1716
{
	if (!arg)
		return -1;

1717 1718
	if (kmem_page > kmem_slab ||
	    (kmem_page == 0 && kmem_slab == 0 && kmem_default == KMEM_PAGE)) {
1719 1720 1721 1722 1723 1724 1725 1726 1727 1728
		if (caller_flag > alloc_flag)
			return setup_page_sorting(&page_caller_sort, arg);
		else
			return setup_page_sorting(&page_alloc_sort, arg);
	} else {
		if (caller_flag > alloc_flag)
			return setup_slab_sorting(&slab_caller_sort, arg);
		else
			return setup_slab_sorting(&slab_alloc_sort, arg);
	}
L
Li Zefan 已提交
1729 1730 1731 1732

	return 0;
}

1733 1734 1735
static int parse_caller_opt(const struct option *opt __maybe_unused,
			    const char *arg __maybe_unused,
			    int unset __maybe_unused)
L
Li Zefan 已提交
1736
{
1737 1738 1739
	caller_flag = (alloc_flag + 1);
	return 0;
}
L
Li Zefan 已提交
1740

1741 1742 1743
static int parse_alloc_opt(const struct option *opt __maybe_unused,
			   const char *arg __maybe_unused,
			   int unset __maybe_unused)
1744 1745
{
	alloc_flag = (caller_flag + 1);
L
Li Zefan 已提交
1746 1747 1748
	return 0;
}

1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764
static int parse_slab_opt(const struct option *opt __maybe_unused,
			  const char *arg __maybe_unused,
			  int unset __maybe_unused)
{
	kmem_slab = (kmem_page + 1);
	return 0;
}

static int parse_page_opt(const struct option *opt __maybe_unused,
			  const char *arg __maybe_unused,
			  int unset __maybe_unused)
{
	kmem_page = (kmem_slab + 1);
	return 0;
}

1765 1766
static int parse_line_opt(const struct option *opt __maybe_unused,
			  const char *arg, int unset __maybe_unused)
L
Li Zefan 已提交
1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782
{
	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;
}

1783 1784 1785
static int __cmd_record(int argc, const char **argv)
{
	const char * const record_args[] = {
1786
	"record", "-a", "-R", "-c", "1",
1787 1788
	};
	const char * const slab_events[] = {
L
Li Zefan 已提交
1789 1790 1791 1792 1793 1794
	"-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",
1795
	};
1796 1797 1798 1799
	const char * const page_events[] = {
	"-e", "kmem:mm_page_alloc",
	"-e", "kmem:mm_page_free",
	};
L
Li Zefan 已提交
1800 1801 1802 1803
	unsigned int rec_argc, i, j;
	const char **rec_argv;

	rec_argc = ARRAY_SIZE(record_args) + argc - 1;
1804 1805 1806
	if (kmem_slab)
		rec_argc += ARRAY_SIZE(slab_events);
	if (kmem_page)
1807
		rec_argc += ARRAY_SIZE(page_events) + 1; /* for -g */
1808

L
Li Zefan 已提交
1809 1810
	rec_argv = calloc(rec_argc + 1, sizeof(char *));

1811 1812 1813
	if (rec_argv == NULL)
		return -ENOMEM;

L
Li Zefan 已提交
1814 1815 1816
	for (i = 0; i < ARRAY_SIZE(record_args); i++)
		rec_argv[i] = strdup(record_args[i]);

1817 1818 1819 1820 1821
	if (kmem_slab) {
		for (j = 0; j < ARRAY_SIZE(slab_events); j++, i++)
			rec_argv[i] = strdup(slab_events[j]);
	}
	if (kmem_page) {
1822 1823
		rec_argv[i++] = strdup("-g");

1824 1825 1826 1827
		for (j = 0; j < ARRAY_SIZE(page_events); j++, i++)
			rec_argv[i] = strdup(page_events[j]);
	}

L
Li Zefan 已提交
1828 1829 1830 1831 1832 1833
	for (j = 1; j < (unsigned int)argc; j++, i++)
		rec_argv[i] = argv[j];

	return cmd_record(i, rec_argv, NULL);
}

1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849
static int kmem_config(const char *var, const char *value, void *cb)
{
	if (!strcmp(var, "kmem.default")) {
		if (!strcmp(value, "slab"))
			kmem_default = KMEM_SLAB;
		else if (!strcmp(value, "page"))
			kmem_default = KMEM_PAGE;
		else
			pr_err("invalid default value ('slab' or 'page' required): %s\n",
			       value);
		return 0;
	}

	return perf_default_config(var, value, cb);
}

1850
int cmd_kmem(int argc, const char **argv, const char *prefix __maybe_unused)
L
Li Zefan 已提交
1851
{
1852 1853
	const char * const default_slab_sort = "frag,hit,bytes";
	const char * const default_page_sort = "bytes,hit";
1854 1855 1856
	struct perf_data_file file = {
		.mode = PERF_DATA_MODE_READ,
	};
1857 1858
	const struct option kmem_options[] = {
	OPT_STRING('i', "input", &input_name, "file", "input file name"),
N
Namhyung Kim 已提交
1859 1860
	OPT_INCR('v', "verbose", &verbose,
		    "be more verbose (show symbol address, etc)"),
1861 1862 1863 1864 1865
	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...]",
1866 1867
		     "sort by keys: ptr, callsite, bytes, hit, pingpong, frag, "
		     "page, order, migtype, gfp", parse_sort_opt),
1868 1869
	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"),
1870
	OPT_BOOLEAN('f', "force", &file.force, "don't complain, do it"),
1871 1872 1873 1874
	OPT_CALLBACK_NOOPT(0, "slab", NULL, NULL, "Analyze slab allocator",
			   parse_slab_opt),
	OPT_CALLBACK_NOOPT(0, "page", NULL, NULL, "Analyze page allocator",
			   parse_page_opt),
1875
	OPT_BOOLEAN(0, "live", &live_page, "Show live page stat"),
1876 1877
	OPT_END()
	};
1878 1879 1880
	const char *const kmem_subcommands[] = { "record", "stat", NULL };
	const char *kmem_usage[] = {
		NULL,
1881 1882
		NULL
	};
1883 1884
	struct perf_session *session;
	int ret = -1;
1885
	const char errmsg[] = "No %s allocation events found.  Have you run 'perf kmem record --%s'?\n";
1886

1887
	perf_config(kmem_config, NULL);
1888 1889
	argc = parse_options_subcommand(argc, argv, kmem_options,
					kmem_subcommands, kmem_usage, 0);
L
Li Zefan 已提交
1890

1891
	if (!argc)
L
Li Zefan 已提交
1892 1893
		usage_with_options(kmem_usage, kmem_options);

1894 1895 1896 1897 1898 1899
	if (kmem_slab == 0 && kmem_page == 0) {
		if (kmem_default == KMEM_SLAB)
			kmem_slab = 1;
		else
			kmem_page = 1;
	}
1900

1901
	if (!strncmp(argv[0], "rec", 3)) {
1902
		symbol__init(NULL);
1903
		return __cmd_record(argc, argv);
1904 1905
	}

J
Jiri Olsa 已提交
1906 1907
	file.path = input_name;

1908
	kmem_session = session = perf_session__new(&file, false, &perf_kmem);
1909
	if (session == NULL)
1910
		return -1;
1911

1912 1913 1914 1915 1916 1917 1918 1919
	if (kmem_slab) {
		if (!perf_evlist__find_tracepoint_by_name(session->evlist,
							  "kmem:kmalloc")) {
			pr_err(errmsg, "slab", "slab");
			return -1;
		}
	}

1920
	if (kmem_page) {
1921
		struct perf_evsel *evsel;
1922

1923 1924 1925 1926
		evsel = perf_evlist__find_tracepoint_by_name(session->evlist,
							     "kmem:mm_page_alloc");
		if (evsel == NULL) {
			pr_err(errmsg, "page", "page");
1927 1928 1929 1930
			return -1;
		}

		kmem_page_size = pevent_get_page_size(evsel->tp_format->pevent);
1931
		symbol_conf.use_callchain = true;
1932 1933
	}

1934
	symbol__init(&session->header.env);
1935 1936

	if (!strcmp(argv[0], "stat")) {
1937 1938
		setlocale(LC_ALL, "");

1939
		if (cpu__setup_cpunode_map())
1940
			goto out_delete;
1941

1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956
		if (list_empty(&slab_caller_sort))
			setup_slab_sorting(&slab_caller_sort, default_slab_sort);
		if (list_empty(&slab_alloc_sort))
			setup_slab_sorting(&slab_alloc_sort, default_slab_sort);
		if (list_empty(&page_caller_sort))
			setup_page_sorting(&page_caller_sort, default_page_sort);
		if (list_empty(&page_alloc_sort))
			setup_page_sorting(&page_alloc_sort, default_page_sort);

		if (kmem_page) {
			setup_page_sorting(&page_alloc_sort_input,
					   "page,order,migtype,gfp");
			setup_page_sorting(&page_caller_sort_input,
					   "callsite,order,migtype,gfp");
		}
1957
		ret = __cmd_kmem(session);
1958 1959
	} else
		usage_with_options(kmem_usage, kmem_options);
1960

1961 1962 1963 1964
out_delete:
	perf_session__delete(session);

	return ret;
L
Li Zefan 已提交
1965 1966
}