[mirror_ubuntu-jammy-kernel.git] / tools / perf / builtin-kmem.c

#include "builtin.h"
#include "perf.h"

#include "util/util.h"
#include "util/cache.h"
#include "util/symbol.h"
#include "util/thread.h"
#include "util/header.h"
#include "util/session.h"

#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 char const		*input_name = "perf.data";

static int			alloc_flag;
static int			caller_flag;

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

static bool			raw_ip;

static char			default_sort_order[] = "frag,hit,bytes";

static int			*cpunode_map;
static int			max_cpu_num;

struct alloc_stat {
	u64	call_site;
	u64	ptr;
	u64	bytes_req;
	u64	bytes_alloc;
	u32	hit;
	u32	pingpong;

	short	alloc_cpu;

	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;
static unsigned long nr_allocs, nr_cross_allocs;

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

static void init_cpunode_map(void)
{
	FILE *fp;
	int i;

	fp = fopen("/sys/devices/system/cpu/kernel_max", "r");
	if (!fp) {
		max_cpu_num = 4096;
		return;
	}

	if (fscanf(fp, "%d", &max_cpu_num) < 1)
		die("Failed to read 'kernel_max' from sysfs");
	max_cpu_num++;

	cpunode_map = calloc(max_cpu_num, sizeof(int));
	if (!cpunode_map)
		die("calloc");
	for (i = 0; i < max_cpu_num; i++)
		cpunode_map[i] = -1;
	fclose(fp);
}

static void setup_cpunode_map(void)
{
	struct dirent *dent1, *dent2;
	DIR *dir1, *dir2;
	unsigned int cpu, mem;
	char buf[PATH_MAX];

	init_cpunode_map();

	dir1 = opendir(PATH_SYS_NODE);
	if (!dir1)
		return;

	while (true) {
		dent1 = readdir(dir1);
		if (!dent1)
			break;

		if (sscanf(dent1->d_name, "node%u", &mem) < 1)
			continue;

		snprintf(buf, PATH_MAX, "%s/%s", PATH_SYS_NODE, dent1->d_name);
		dir2 = opendir(buf);
		if (!dir2)
			continue;
		while (true) {
			dent2 = readdir(dir2);
			if (!dent2)
				break;
			if (sscanf(dent2->d_name, "cpu%u", &cpu) < 1)
				continue;
			cpunode_map[cpu] = mem;
		}
	}
}

static void insert_alloc_stat(unsigned long call_site, unsigned long ptr,
			      int bytes_req, int bytes_alloc, int cpu)
{
	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;
		data->bytes_alloc += bytes_req;
	} else {
		data = malloc(sizeof(*data));
		if (!data)
			die("malloc");
		data->ptr = ptr;
		data->pingpong = 0;
		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);
	}
	data->call_site = call_site;
	data->alloc_cpu = cpu;
}

static void insert_caller_stat(unsigned long call_site,
			      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;
		data->bytes_alloc += bytes_req;
	} else {
		data = malloc(sizeof(*data));
		if (!data)
			die("malloc");
		data->call_site = call_site;
		data->pingpong = 0;
		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);
	}
}

static void process_alloc_event(void *data,
				struct event *event,
				int cpu,
				u64 timestamp __used,
				struct thread *thread __used,
				int node)
{
	unsigned long call_site;
	unsigned long ptr;
	int bytes_req;
	int bytes_alloc;
	int node1, node2;

	ptr = raw_field_value(event, "ptr", data);
	call_site = raw_field_value(event, "call_site", data);
	bytes_req = raw_field_value(event, "bytes_req", data);
	bytes_alloc = raw_field_value(event, "bytes_alloc", data);

	insert_alloc_stat(call_site, ptr, bytes_req, bytes_alloc, cpu);
	insert_caller_stat(call_site, bytes_req, bytes_alloc);

	total_requested += bytes_req;
	total_allocated += bytes_alloc;

	if (node) {
		node1 = cpunode_map[cpu];
		node2 = raw_field_value(event, "node", data);
		if (node1 != node2)
			nr_cross_allocs++;
	}
	nr_allocs++;
}

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

static void process_free_event(void *data,
			       struct event *event,
			       int cpu,
			       u64 timestamp __used,
			       struct thread *thread __used)
{
	unsigned long ptr;
	struct alloc_stat *s_alloc, *s_caller;

	ptr = raw_field_value(event, "ptr", data);

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

	if (cpu != s_alloc->alloc_cpu) {
		s_alloc->pingpong++;

		s_caller = search_alloc_stat(0, s_alloc->call_site,
					     &root_caller_stat, callsite_cmp);
		assert(s_caller);
		s_caller->pingpong++;
	}
	s_alloc->alloc_cpu = -1;
}

static void
process_raw_event(event_t *raw_event __used, void *data,
		  int cpu, u64 timestamp, struct thread *thread)
{
	struct event *event;
	int type;

	type = trace_parse_common_type(data);
	event = trace_find_event(type);

	if (!strcmp(event->name, "kmalloc") ||
	    !strcmp(event->name, "kmem_cache_alloc")) {
		process_alloc_event(data, event, cpu, timestamp, thread, 0);
		return;
	}

	if (!strcmp(event->name, "kmalloc_node") ||
	    !strcmp(event->name, "kmem_cache_alloc_node")) {
		process_alloc_event(data, event, cpu, timestamp, thread, 1);
		return;
	}

	if (!strcmp(event->name, "kfree") ||
	    !strcmp(event->name, "kmem_cache_free")) {
		process_free_event(data, event, cpu, timestamp, thread);
		return;
	}
}

static int process_sample_event(event_t *event, struct perf_session *session)
{
	struct sample_data data;
	struct thread *thread;

	memset(&data, 0, sizeof(data));
	data.time = -1;
	data.cpu = -1;
	data.period = 1;

	event__parse_sample(event, session->sample_type, &data);

	dump_printf("(IP, %d): %d/%d: %p period: %Ld\n",
		event->header.misc,
		data.pid, data.tid,
		(void *)(long)data.ip,
		(long long)data.period);

	thread = perf_session__findnew(session, event->ip.pid);
	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);

	process_raw_event(event, data.raw_data, data.cpu,
			  data.time, thread);

	return 0;
}

static struct perf_event_ops event_ops = {
	.sample	= process_sample_event,
	.comm	= event__process_comm,
};

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

static void __print_result(struct rb_root *root, struct perf_session *session,
			   int n_lines, int is_caller)
{
	struct rb_node *next;

	printf("%.102s\n", graph_dotted_line);
	printf(" %-34s |",  is_caller ? "Callsite": "Alloc Ptr");
	printf(" Total_alloc/Per | Total_req/Per   | Hit   | Ping-pong | Frag\n");
	printf("%.102s\n", graph_dotted_line);

	next = rb_first(root);

	while (next && n_lines--) {
		struct alloc_stat *data = rb_entry(next, struct alloc_stat,
						   node);
		struct symbol *sym = NULL;
		char buf[BUFSIZ];
		u64 addr;

		if (is_caller) {
			addr = data->call_site;
			if (!raw_ip)
				sym = map_groups__find_function(&session->kmaps, session, addr, NULL);
		} else
			addr = data->ptr;

		if (sym != NULL)
			snprintf(buf, sizeof(buf), "%s+%Lx", sym->name,
				 addr - sym->start);
		else
			snprintf(buf, sizeof(buf), "%#Lx", addr);
		printf(" %-34s |", buf);

		printf(" %9llu/%-5lu | %9llu/%-5lu | %6lu | %8lu | %6.3f%%\n",
		       (unsigned long long)data->bytes_alloc,
		       (unsigned long)data->bytes_alloc / data->hit,
		       (unsigned long long)data->bytes_req,
		       (unsigned long)data->bytes_req / data->hit,
		       (unsigned long)data->hit,
		       (unsigned long)data->pingpong,
		       fragmentation(data->bytes_req, data->bytes_alloc));

		next = rb_next(next);
	}

	if (n_lines == -1)
		printf(" ...                                | ...             | ...             | ...    | ...      | ...   \n");

	printf("%.102s\n", graph_dotted_line);
}

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));
	printf("Cross CPU allocations: %lu/%lu\n", nr_cross_allocs, nr_allocs);
}

static void print_result(struct perf_session *session)
{
	if (caller_flag)
		__print_result(&root_caller_sorted, session, caller_lines, 1);
	if (alloc_flag)
		__print_result(&root_alloc_sorted, session, alloc_lines, 0);
	print_summary();
}

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

static void sort_insert(struct rb_root *root, struct alloc_stat *data,
			struct list_head *sort_list)
{
	struct rb_node **new = &(root->rb_node);
	struct rb_node *parent = NULL;
	struct sort_dimension *sort;

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

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

		list_for_each_entry(sort, sort_list, list) {
			cmp = sort->cmp(data, this);
			if (cmp)
				break;
		}

		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,
			  struct list_head *sort_list)
{
	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);
		sort_insert(root_sorted, data, sort_list);
	}
}

static void sort_result(void)
{
	__sort_result(&root_alloc_stat, &root_alloc_sorted, &alloc_sort);
	__sort_result(&root_caller_stat, &root_caller_sorted, &caller_sort);
}

static int __cmd_kmem(void)
{
	int err = -EINVAL;
	struct perf_session *session = perf_session__new(input_name, O_RDONLY, 0);
	if (session == NULL)
		return -ENOMEM;

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

	setup_pager();
	err = perf_session__process_events(session, &event_ops);
	if (err != 0)
		goto out_delete;
	sort_result();
	print_result(session);
out_delete:
	perf_session__delete(session);
	return err;
}

static const char * const kmem_usage[] = {
	"perf kmem [<options>] {record|stat}",
	NULL
};

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

static struct sort_dimension ptr_sort_dimension = {
	.name	= "ptr",
	.cmp	= ptr_cmp,
};

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

static struct sort_dimension callsite_sort_dimension = {
	.name	= "callsite",
	.cmp	= callsite_cmp,
};

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

static struct sort_dimension hit_sort_dimension = {
	.name	= "hit",
	.cmp	= hit_cmp,
};

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

static struct sort_dimension bytes_sort_dimension = {
	.name	= "bytes",
	.cmp	= bytes_cmp,
};

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

static struct sort_dimension frag_sort_dimension = {
	.name	= "frag",
	.cmp	= frag_cmp,
};

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

static struct sort_dimension *avail_sorts[] = {
	&ptr_sort_dimension,
	&callsite_sort_dimension,
	&hit_sort_dimension,
	&bytes_sort_dimension,
	&frag_sort_dimension,
	&pingpong_sort_dimension,
};

#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));
			if (!sort)
				die("malloc");
			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);

	if (!str)
		die("strdup");

	while (true) {
		tok = strsep(&str, ",");
		if (!tok)
			break;
		if (sort_dimension__add(tok, sort_list) < 0) {
			error("Unknown --sort key: '%s'", tok);
			return -1;
		}
	}

	free(str);
	return 0;
}

static int parse_sort_opt(const struct option *opt __used,
			  const char *arg, int unset __used)
{
	if (!arg)
		return -1;

	if (caller_flag > alloc_flag)
		return setup_sorting(&caller_sort, arg);
	else
		return setup_sorting(&alloc_sort, arg);

	return 0;
}

static int parse_caller_opt(const struct option *opt __used,
			  const char *arg __used, int unset __used)
{
	caller_flag = (alloc_flag + 1);
	return 0;
}

static int parse_alloc_opt(const struct option *opt __used,
			  const char *arg __used, int unset __used)
{
	alloc_flag = (caller_flag + 1);
	return 0;
}

static int parse_line_opt(const struct option *opt __used,
			  const char *arg, int unset __used)
{
	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;
}

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

static const char *record_args[] = {
	"record",
	"-a",
	"-R",
	"-M",
	"-f",
	"-c", "1",
	"-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",
};

static int __cmd_record(int argc, const char **argv)
{
	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 *));

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

int cmd_kmem(int argc, const char **argv, const char *prefix __used)
{
	argc = parse_options(argc, argv, kmem_options, kmem_usage, 0);

	if (!argc)
		usage_with_options(kmem_usage, kmem_options);

	symbol__init();

	if (!strncmp(argv[0], "rec", 3)) {
		return __cmd_record(argc, argv);
	} else if (!strcmp(argv[0], "stat")) {
		setup_cpunode_map();

		if (list_empty(&caller_sort))
			setup_sorting(&caller_sort, default_sort_order);
		if (list_empty(&alloc_sort))
			setup_sorting(&alloc_sort, default_sort_order);

		return __cmd_kmem();
	}

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