[linux-2.6-block.git] / tools / perf / ui / stdio / hist.c

#include <stdio.h>

#include "../../util/util.h"
#include "../../util/hist.h"
#include "../../util/sort.h"
#include "../../util/evsel.h"


static size_t callchain__fprintf_left_margin(FILE *fp, int left_margin)
{
	int i;
	int ret = fprintf(fp, "            ");

	for (i = 0; i < left_margin; i++)
		ret += fprintf(fp, " ");

	return ret;
}

static size_t ipchain__fprintf_graph_line(FILE *fp, int depth, int depth_mask,
					  int left_margin)
{
	int i;
	size_t ret = callchain__fprintf_left_margin(fp, left_margin);

	for (i = 0; i < depth; i++)
		if (depth_mask & (1 << i))
			ret += fprintf(fp, "|          ");
		else
			ret += fprintf(fp, "           ");

	ret += fprintf(fp, "\n");

	return ret;
}

static size_t ipchain__fprintf_graph(FILE *fp, struct callchain_node *node,
				     struct callchain_list *chain,
				     int depth, int depth_mask, int period,
				     u64 total_samples, int left_margin)
{
	int i;
	size_t ret = 0;
	char bf[1024];

	ret += callchain__fprintf_left_margin(fp, left_margin);
	for (i = 0; i < depth; i++) {
		if (depth_mask & (1 << i))
			ret += fprintf(fp, "|");
		else
			ret += fprintf(fp, " ");
		if (!period && i == depth - 1) {
			ret += fprintf(fp, "--");
			ret += callchain_node__fprintf_value(node, fp, total_samples);
			ret += fprintf(fp, "--");
		} else
			ret += fprintf(fp, "%s", "          ");
	}
	fputs(callchain_list__sym_name(chain, bf, sizeof(bf), false), fp);
	fputc('\n', fp);
	return ret;
}

static struct symbol *rem_sq_bracket;
static struct callchain_list rem_hits;

static void init_rem_hits(void)
{
	rem_sq_bracket = malloc(sizeof(*rem_sq_bracket) + 6);
	if (!rem_sq_bracket) {
		fprintf(stderr, "Not enough memory to display remaining hits\n");
		return;
	}

	strcpy(rem_sq_bracket->name, "[...]");
	rem_hits.ms.sym = rem_sq_bracket;
}

static size_t __callchain__fprintf_graph(FILE *fp, struct rb_root *root,
					 u64 total_samples, int depth,
					 int depth_mask, int left_margin)
{
	struct rb_node *node, *next;
	struct callchain_node *child = NULL;
	struct callchain_list *chain;
	int new_depth_mask = depth_mask;
	u64 remaining;
	size_t ret = 0;
	int i;
	uint entries_printed = 0;
	int cumul_count = 0;

	remaining = total_samples;

	node = rb_first(root);
	while (node) {
		u64 new_total;
		u64 cumul;

		child = rb_entry(node, struct callchain_node, rb_node);
		cumul = callchain_cumul_hits(child);
		remaining -= cumul;
		cumul_count += callchain_cumul_counts(child);

		/*
		 * The depth mask manages the output of pipes that show
		 * the depth. We don't want to keep the pipes of the current
		 * level for the last child of this depth.
		 * Except if we have remaining filtered hits. They will
		 * supersede the last child
		 */
		next = rb_next(node);
		if (!next && (callchain_param.mode != CHAIN_GRAPH_REL || !remaining))
			new_depth_mask &= ~(1 << (depth - 1));

		/*
		 * But we keep the older depth mask for the line separator
		 * to keep the level link until we reach the last child
		 */
		ret += ipchain__fprintf_graph_line(fp, depth, depth_mask,
						   left_margin);
		i = 0;
		list_for_each_entry(chain, &child->val, list) {
			ret += ipchain__fprintf_graph(fp, child, chain, depth,
						      new_depth_mask, i++,
						      total_samples,
						      left_margin);
		}

		if (callchain_param.mode == CHAIN_GRAPH_REL)
			new_total = child->children_hit;
		else
			new_total = total_samples;

		ret += __callchain__fprintf_graph(fp, &child->rb_root, new_total,
						  depth + 1,
						  new_depth_mask | (1 << depth),
						  left_margin);
		node = next;
		if (++entries_printed == callchain_param.print_limit)
			break;
	}

	if (callchain_param.mode == CHAIN_GRAPH_REL &&
		remaining && remaining != total_samples) {
		struct callchain_node rem_node = {
			.hit = remaining,
		};

		if (!rem_sq_bracket)
			return ret;

		if (callchain_param.value == CCVAL_COUNT && child && child->parent) {
			rem_node.count = child->parent->children_count - cumul_count;
			if (rem_node.count <= 0)
				return ret;
		}

		new_depth_mask &= ~(1 << (depth - 1));
		ret += ipchain__fprintf_graph(fp, &rem_node, &rem_hits, depth,
					      new_depth_mask, 0, total_samples,
					      left_margin);
	}

	return ret;
}

/*
 * If have one single callchain root, don't bother printing
 * its percentage (100 % in fractal mode and the same percentage
 * than the hist in graph mode). This also avoid one level of column.
 *
 * However when percent-limit applied, it's possible that single callchain
 * node have different (non-100% in fractal mode) percentage.
 */
static bool need_percent_display(struct rb_node *node, u64 parent_samples)
{
	struct callchain_node *cnode;

	if (rb_next(node))
		return true;

	cnode = rb_entry(node, struct callchain_node, rb_node);
	return callchain_cumul_hits(cnode) != parent_samples;
}

static size_t callchain__fprintf_graph(FILE *fp, struct rb_root *root,
				       u64 total_samples, u64 parent_samples,
				       int left_margin)
{
	struct callchain_node *cnode;
	struct callchain_list *chain;
	u32 entries_printed = 0;
	bool printed = false;
	struct rb_node *node;
	int i = 0;
	int ret = 0;
	char bf[1024];

	node = rb_first(root);
	if (node && !need_percent_display(node, parent_samples)) {
		cnode = rb_entry(node, struct callchain_node, rb_node);
		list_for_each_entry(chain, &cnode->val, list) {
			/*
			 * If we sort by symbol, the first entry is the same than
			 * the symbol. No need to print it otherwise it appears as
			 * displayed twice.
			 */
			if (!i++ && field_order == NULL &&
			    sort_order && !prefixcmp(sort_order, "sym"))
				continue;
			if (!printed) {
				ret += callchain__fprintf_left_margin(fp, left_margin);
				ret += fprintf(fp, "|\n");
				ret += callchain__fprintf_left_margin(fp, left_margin);
				ret += fprintf(fp, "---");
				left_margin += 3;
				printed = true;
			} else
				ret += callchain__fprintf_left_margin(fp, left_margin);

			ret += fprintf(fp, "%s\n", callchain_list__sym_name(chain, bf, sizeof(bf),
							false));

			if (++entries_printed == callchain_param.print_limit)
				break;
		}
		root = &cnode->rb_root;
	}

	if (callchain_param.mode == CHAIN_GRAPH_REL)
		total_samples = parent_samples;

	ret += __callchain__fprintf_graph(fp, root, total_samples,
					  1, 1, left_margin);
	ret += fprintf(fp, "\n");

	return ret;
}

static size_t __callchain__fprintf_flat(FILE *fp, struct callchain_node *node,
					u64 total_samples)
{
	struct callchain_list *chain;
	size_t ret = 0;
	char bf[1024];

	if (!node)
		return 0;

	ret += __callchain__fprintf_flat(fp, node->parent, total_samples);


	list_for_each_entry(chain, &node->val, list) {
		if (chain->ip >= PERF_CONTEXT_MAX)
			continue;
		ret += fprintf(fp, "                %s\n", callchain_list__sym_name(chain,
					bf, sizeof(bf), false));
	}

	return ret;
}

static size_t callchain__fprintf_flat(FILE *fp, struct rb_root *tree,
				      u64 total_samples)
{
	size_t ret = 0;
	u32 entries_printed = 0;
	struct callchain_node *chain;
	struct rb_node *rb_node = rb_first(tree);

	while (rb_node) {
		chain = rb_entry(rb_node, struct callchain_node, rb_node);

		ret += fprintf(fp, "           ");
		ret += callchain_node__fprintf_value(chain, fp, total_samples);
		ret += fprintf(fp, "\n");
		ret += __callchain__fprintf_flat(fp, chain, total_samples);
		ret += fprintf(fp, "\n");
		if (++entries_printed == callchain_param.print_limit)
			break;

		rb_node = rb_next(rb_node);
	}

	return ret;
}

static size_t __callchain__fprintf_folded(FILE *fp, struct callchain_node *node)
{
	const char *sep = symbol_conf.field_sep ?: ";";
	struct callchain_list *chain;
	size_t ret = 0;
	char bf[1024];
	bool first;

	if (!node)
		return 0;

	ret += __callchain__fprintf_folded(fp, node->parent);

	first = (ret == 0);
	list_for_each_entry(chain, &node->val, list) {
		if (chain->ip >= PERF_CONTEXT_MAX)
			continue;
		ret += fprintf(fp, "%s%s", first ? "" : sep,
			       callchain_list__sym_name(chain,
						bf, sizeof(bf), false));
		first = false;
	}

	return ret;
}

static size_t callchain__fprintf_folded(FILE *fp, struct rb_root *tree,
					u64 total_samples)
{
	size_t ret = 0;
	u32 entries_printed = 0;
	struct callchain_node *chain;
	struct rb_node *rb_node = rb_first(tree);

	while (rb_node) {

		chain = rb_entry(rb_node, struct callchain_node, rb_node);

		ret += callchain_node__fprintf_value(chain, fp, total_samples);
		ret += fprintf(fp, " ");
		ret += __callchain__fprintf_folded(fp, chain);
		ret += fprintf(fp, "\n");
		if (++entries_printed == callchain_param.print_limit)
			break;

		rb_node = rb_next(rb_node);
	}

	return ret;
}

static size_t hist_entry_callchain__fprintf(struct hist_entry *he,
					    u64 total_samples, int left_margin,
					    FILE *fp)
{
	u64 parent_samples = he->stat.period;

	if (symbol_conf.cumulate_callchain)
		parent_samples = he->stat_acc->period;

	switch (callchain_param.mode) {
	case CHAIN_GRAPH_REL:
		return callchain__fprintf_graph(fp, &he->sorted_chain, total_samples,
						parent_samples, left_margin);
		break;
	case CHAIN_GRAPH_ABS:
		return callchain__fprintf_graph(fp, &he->sorted_chain, total_samples,
						parent_samples, left_margin);
		break;
	case CHAIN_FLAT:
		return callchain__fprintf_flat(fp, &he->sorted_chain, total_samples);
		break;
	case CHAIN_FOLDED:
		return callchain__fprintf_folded(fp, &he->sorted_chain, total_samples);
		break;
	case CHAIN_NONE:
		break;
	default:
		pr_err("Bad callchain mode\n");
	}

	return 0;
}

static int hist_entry__snprintf(struct hist_entry *he, struct perf_hpp *hpp)
{
	const char *sep = symbol_conf.field_sep;
	struct perf_hpp_fmt *fmt;
	char *start = hpp->buf;
	int ret;
	bool first = true;

	if (symbol_conf.exclude_other && !he->parent)
		return 0;

	perf_hpp__for_each_format(fmt) {
		if (perf_hpp__should_skip(fmt, he->hists))
			continue;

		/*
		 * If there's no field_sep, we still need
		 * to display initial '  '.
		 */
		if (!sep || !first) {
			ret = scnprintf(hpp->buf, hpp->size, "%s", sep ?: "  ");
			advance_hpp(hpp, ret);
		} else
			first = false;

		if (perf_hpp__use_color() && fmt->color)
			ret = fmt->color(fmt, hpp, he);
		else
			ret = fmt->entry(fmt, hpp, he);

		advance_hpp(hpp, ret);
	}

	return hpp->buf - start;
}

static int hist_entry__fprintf(struct hist_entry *he, size_t size,
			       struct hists *hists,
			       char *bf, size_t bfsz, FILE *fp)
{
	int ret;
	struct perf_hpp hpp = {
		.buf		= bf,
		.size		= size,
	};
	u64 total_period = hists->stats.total_period;

	if (size == 0 || size > bfsz)
		size = hpp.size = bfsz;

	hist_entry__snprintf(he, &hpp);

	ret = fprintf(fp, "%s\n", bf);

	if (symbol_conf.use_callchain)
		ret += hist_entry_callchain__fprintf(he, total_period, 0, fp);

	return ret;
}

size_t hists__fprintf(struct hists *hists, bool show_header, int max_rows,
		      int max_cols, float min_pcnt, FILE *fp)
{
	struct perf_hpp_fmt *fmt;
	struct rb_node *nd;
	size_t ret = 0;
	unsigned int width;
	const char *sep = symbol_conf.field_sep;
	int nr_rows = 0;
	char bf[96];
	struct perf_hpp dummy_hpp = {
		.buf	= bf,
		.size	= sizeof(bf),
	};
	bool first = true;
	size_t linesz;
	char *line = NULL;

	init_rem_hits();

	perf_hpp__for_each_format(fmt)
		perf_hpp__reset_width(fmt, hists);

	if (symbol_conf.col_width_list_str)
		perf_hpp__set_user_width(symbol_conf.col_width_list_str);

	if (!show_header)
		goto print_entries;

	fprintf(fp, "# ");

	perf_hpp__for_each_format(fmt) {
		if (perf_hpp__should_skip(fmt, hists))
			continue;

		if (!first)
			fprintf(fp, "%s", sep ?: "  ");
		else
			first = false;

		fmt->header(fmt, &dummy_hpp, hists_to_evsel(hists));
		fprintf(fp, "%s", bf);
	}

	fprintf(fp, "\n");
	if (max_rows && ++nr_rows >= max_rows)
		goto out;

	if (sep)
		goto print_entries;

	first = true;

	fprintf(fp, "# ");

	perf_hpp__for_each_format(fmt) {
		unsigned int i;

		if (perf_hpp__should_skip(fmt, hists))
			continue;

		if (!first)
			fprintf(fp, "%s", sep ?: "  ");
		else
			first = false;

		width = fmt->width(fmt, &dummy_hpp, hists_to_evsel(hists));
		for (i = 0; i < width; i++)
			fprintf(fp, ".");
	}

	fprintf(fp, "\n");
	if (max_rows && ++nr_rows >= max_rows)
		goto out;

	fprintf(fp, "#\n");
	if (max_rows && ++nr_rows >= max_rows)
		goto out;

print_entries:
	linesz = hists__sort_list_width(hists) + 3 + 1;
	linesz += perf_hpp__color_overhead();
	line = malloc(linesz);
	if (line == NULL) {
		ret = -1;
		goto out;
	}

	for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) {
		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
		float percent;

		if (h->filtered)
			continue;

		percent = hist_entry__get_percent_limit(h);
		if (percent < min_pcnt)
			continue;

		ret += hist_entry__fprintf(h, max_cols, hists, line, linesz, fp);

		if (max_rows && ++nr_rows >= max_rows)
			break;

		if (h->ms.map == NULL && verbose > 1) {
			__map_groups__fprintf_maps(h->thread->mg,
						   MAP__FUNCTION, fp);
			fprintf(fp, "%.10s end\n", graph_dotted_line);
		}
	}

	free(line);
out:
	zfree(&rem_sq_bracket);

	return ret;
}

size_t events_stats__fprintf(struct events_stats *stats, FILE *fp)
{
	int i;
	size_t ret = 0;

	for (i = 0; i < PERF_RECORD_HEADER_MAX; ++i) {
		const char *name;

		if (stats->nr_events[i] == 0)
			continue;

		name = perf_event__name(i);
		if (!strcmp(name, "UNKNOWN"))
			continue;

		ret += fprintf(fp, "%16s events: %10d\n", name,
			       stats->nr_events[i]);
	}

	return ret;
}
Commit	Line	Data
7ccf4f90	1	#include <stdio.h>
7ccf4f90 NK	2
	3	#include "../../util/util.h"
	4	#include "../../util/hist.h"
	5	#include "../../util/sort.h"
5b9e2146	6	#include "../../util/evsel.h"
7ccf4f90 NK	7
	8
	9	static size_t callchain__fprintf_left_margin(FILE *fp, int left_margin)
	10	{
	11	int i;
	12	int ret = fprintf(fp, " ");
	13
	14	for (i = 0; i < left_margin; i++)
	15	ret += fprintf(fp, " ");
	16
	17	return ret;
	18	}
	19
	20	static size_t ipchain__fprintf_graph_line(FILE *fp, int depth, int depth_mask,
	21	int left_margin)
	22	{
	23	int i;
	24	size_t ret = callchain__fprintf_left_margin(fp, left_margin);
	25
	26	for (i = 0; i < depth; i++)
	27	if (depth_mask & (1 << i))
	28	ret += fprintf(fp, "\| ");
	29	else
	30	ret += fprintf(fp, " ");
	31
	32	ret += fprintf(fp, "\n");
	33
	34	return ret;
	35	}
	36
5ab250ca NK	37	static size_t ipchain__fprintf_graph(FILE fp, struct callchain_node node,
5ab250ca NK	38	struct callchain_list *chain,
7ccf4f90	39	int depth, int depth_mask, int period,
5ab250ca	40	u64 total_samples, int left_margin)
7ccf4f90 NK	41	{
	42	int i;
	43	size_t ret = 0;
2989ccaa	44	char bf[1024];
7ccf4f90 NK	45
	46	ret += callchain__fprintf_left_margin(fp, left_margin);
	47	for (i = 0; i < depth; i++) {
	48	if (depth_mask & (1 << i))
	49	ret += fprintf(fp, "\|");
	50	else
	51	ret += fprintf(fp, " ");
	52	if (!period && i == depth - 1) {
5ab250ca NK	53	ret += fprintf(fp, "--");
	54	ret += callchain_node__fprintf_value(node, fp, total_samples);
	55	ret += fprintf(fp, "--");
7ccf4f90 NK	56	} else
	57	ret += fprintf(fp, "%s", " ");
	58	}
2989ccaa AK	59	fputs(callchain_list__sym_name(chain, bf, sizeof(bf), false), fp);
2989ccaa AK	60	fputc('\n', fp);
7ccf4f90 NK	61	return ret;
	62	}
	63
	64	static struct symbol *rem_sq_bracket;
	65	static struct callchain_list rem_hits;
	66
	67	static void init_rem_hits(void)
	68	{
	69	rem_sq_bracket = malloc(sizeof(*rem_sq_bracket) + 6);
	70	if (!rem_sq_bracket) {
	71	fprintf(stderr, "Not enough memory to display remaining hits\n");
	72	return;
	73	}
	74
	75	strcpy(rem_sq_bracket->name, "[...]");
	76	rem_hits.ms.sym = rem_sq_bracket;
	77	}
	78
	79	static size_t __callchain__fprintf_graph(FILE fp, struct rb_root root,
	80	u64 total_samples, int depth,
	81	int depth_mask, int left_margin)
	82	{
	83	struct rb_node node, next;
f2af0086	84	struct callchain_node *child = NULL;
7ccf4f90 NK	85	struct callchain_list *chain;
	86	int new_depth_mask = depth_mask;
	87	u64 remaining;
	88	size_t ret = 0;
	89	int i;
	90	uint entries_printed = 0;
f2af0086	91	int cumul_count = 0;
7ccf4f90 NK	92
	93	remaining = total_samples;
	94
	95	node = rb_first(root);
	96	while (node) {
	97	u64 new_total;
	98	u64 cumul;
	99
	100	child = rb_entry(node, struct callchain_node, rb_node);
	101	cumul = callchain_cumul_hits(child);
	102	remaining -= cumul;
f2af0086	103	cumul_count += callchain_cumul_counts(child);
7ccf4f90 NK	104
	105	/*
	106	* The depth mask manages the output of pipes that show
	107	* the depth. We don't want to keep the pipes of the current
	108	* level for the last child of this depth.
	109	* Except if we have remaining filtered hits. They will
	110	* supersede the last child
	111	*/
	112	next = rb_next(node);
	113	if (!next && (callchain_param.mode != CHAIN_GRAPH_REL \|\| !remaining))
	114	new_depth_mask &= ~(1 << (depth - 1));
	115
	116	/*
	117	* But we keep the older depth mask for the line separator
	118	* to keep the level link until we reach the last child
	119	*/
	120	ret += ipchain__fprintf_graph_line(fp, depth, depth_mask,
	121	left_margin);
	122	i = 0;
	123	list_for_each_entry(chain, &child->val, list) {
5ab250ca	124	ret += ipchain__fprintf_graph(fp, child, chain, depth,
7ccf4f90 NK	125	new_depth_mask, i++,
7ccf4f90 NK	126	total_samples,
7ccf4f90 NK	127	left_margin);
	128	}
	129
	130	if (callchain_param.mode == CHAIN_GRAPH_REL)
	131	new_total = child->children_hit;
	132	else
	133	new_total = total_samples;
	134
	135	ret += __callchain__fprintf_graph(fp, &child->rb_root, new_total,
	136	depth + 1,
	137	new_depth_mask \| (1 << depth),
	138	left_margin);
	139	node = next;
	140	if (++entries_printed == callchain_param.print_limit)
	141	break;
	142	}
	143
	144	if (callchain_param.mode == CHAIN_GRAPH_REL &&
	145	remaining && remaining != total_samples) {
5ab250ca NK	146	struct callchain_node rem_node = {
	147	.hit = remaining,
	148	};
7ccf4f90 NK	149
	150	if (!rem_sq_bracket)
	151	return ret;
	152
f2af0086 NK	153	if (callchain_param.value == CCVAL_COUNT && child && child->parent) {
	154	rem_node.count = child->parent->children_count - cumul_count;
	155	if (rem_node.count <= 0)
	156	return ret;
	157	}
	158
7ccf4f90	159	new_depth_mask &= ~(1 << (depth - 1));
5ab250ca	160	ret += ipchain__fprintf_graph(fp, &rem_node, &rem_hits, depth,
7ccf4f90	161	new_depth_mask, 0, total_samples,
5ab250ca	162	left_margin);
7ccf4f90 NK	163	}
	164
	165	return ret;
	166	}
	167
7ed5d6e2 NK	168	/*
	169	* If have one single callchain root, don't bother printing
	170	* its percentage (100 % in fractal mode and the same percentage
	171	* than the hist in graph mode). This also avoid one level of column.
	172	*
	173	* However when percent-limit applied, it's possible that single callchain
	174	* node have different (non-100% in fractal mode) percentage.
	175	*/
	176	static bool need_percent_display(struct rb_node *node, u64 parent_samples)
	177	{
	178	struct callchain_node *cnode;
	179
	180	if (rb_next(node))
	181	return true;
	182
	183	cnode = rb_entry(node, struct callchain_node, rb_node);
	184	return callchain_cumul_hits(cnode) != parent_samples;
	185	}
	186
7ccf4f90	187	static size_t callchain__fprintf_graph(FILE fp, struct rb_root root,
54d27b31 NK	188	u64 total_samples, u64 parent_samples,
54d27b31 NK	189	int left_margin)
7ccf4f90 NK	190	{
	191	struct callchain_node *cnode;
	192	struct callchain_list *chain;
	193	u32 entries_printed = 0;
	194	bool printed = false;
	195	struct rb_node *node;
	196	int i = 0;
	197	int ret = 0;
2989ccaa	198	char bf[1024];
7ccf4f90	199
7ccf4f90	200	node = rb_first(root);
7ed5d6e2	201	if (node && !need_percent_display(node, parent_samples)) {
7ccf4f90 NK	202	cnode = rb_entry(node, struct callchain_node, rb_node);
	203	list_for_each_entry(chain, &cnode->val, list) {
	204	/*
	205	* If we sort by symbol, the first entry is the same than
	206	* the symbol. No need to print it otherwise it appears as
	207	* displayed twice.
	208	*/
cfaa154b NK	209	if (!i++ && field_order == NULL &&
cfaa154b NK	210	sort_order && !prefixcmp(sort_order, "sym"))
7ccf4f90 NK	211	continue;
	212	if (!printed) {
	213	ret += callchain__fprintf_left_margin(fp, left_margin);
	214	ret += fprintf(fp, "\|\n");
	215	ret += callchain__fprintf_left_margin(fp, left_margin);
	216	ret += fprintf(fp, "---");
	217	left_margin += 3;
	218	printed = true;
	219	} else
	220	ret += callchain__fprintf_left_margin(fp, left_margin);
	221
2989ccaa AK	222	ret += fprintf(fp, "%s\n", callchain_list__sym_name(chain, bf, sizeof(bf),
2989ccaa AK	223	false));
7ccf4f90 NK	224
	225	if (++entries_printed == callchain_param.print_limit)
	226	break;
	227	}
	228	root = &cnode->rb_root;
	229	}
	230
54d27b31 NK	231	if (callchain_param.mode == CHAIN_GRAPH_REL)
	232	total_samples = parent_samples;
	233
7ccf4f90 NK	234	ret += __callchain__fprintf_graph(fp, root, total_samples,
	235	1, 1, left_margin);
	236	ret += fprintf(fp, "\n");
	237
	238	return ret;
	239	}
	240
316c7136	241	static size_t __callchain__fprintf_flat(FILE fp, struct callchain_node node,
7ccf4f90 NK	242	u64 total_samples)
	243	{
	244	struct callchain_list *chain;
	245	size_t ret = 0;
2989ccaa	246	char bf[1024];
7ccf4f90	247
316c7136	248	if (!node)
7ccf4f90 NK	249	return 0;
7ccf4f90 NK	250
316c7136	251	ret += __callchain__fprintf_flat(fp, node->parent, total_samples);
7ccf4f90 NK	252
7ccf4f90 NK	253
316c7136	254	list_for_each_entry(chain, &node->val, list) {
7ccf4f90 NK	255	if (chain->ip >= PERF_CONTEXT_MAX)
7ccf4f90 NK	256	continue;
2989ccaa AK	257	ret += fprintf(fp, " %s\n", callchain_list__sym_name(chain,
2989ccaa AK	258	bf, sizeof(bf), false));
7ccf4f90 NK	259	}
	260
	261	return ret;
	262	}
	263
316c7136	264	static size_t callchain__fprintf_flat(FILE fp, struct rb_root tree,
7ccf4f90 NK	265	u64 total_samples)
	266	{
	267	size_t ret = 0;
	268	u32 entries_printed = 0;
7ccf4f90	269	struct callchain_node *chain;
316c7136	270	struct rb_node *rb_node = rb_first(tree);
7ccf4f90	271
7ccf4f90	272	while (rb_node) {
7ccf4f90	273	chain = rb_entry(rb_node, struct callchain_node, rb_node);
7ccf4f90	274
5ab250ca NK	275	ret += fprintf(fp, " ");
	276	ret += callchain_node__fprintf_value(chain, fp, total_samples);
	277	ret += fprintf(fp, "\n");
7ccf4f90 NK	278	ret += __callchain__fprintf_flat(fp, chain, total_samples);
	279	ret += fprintf(fp, "\n");
	280	if (++entries_printed == callchain_param.print_limit)
	281	break;
	282
	283	rb_node = rb_next(rb_node);
	284	}
	285
	286	return ret;
	287	}
	288
26e77924 NK	289	static size_t __callchain__fprintf_folded(FILE fp, struct callchain_node node)
	290	{
	291	const char *sep = symbol_conf.field_sep ?: ";";
	292	struct callchain_list *chain;
	293	size_t ret = 0;
	294	char bf[1024];
	295	bool first;
	296
	297	if (!node)
	298	return 0;
	299
	300	ret += __callchain__fprintf_folded(fp, node->parent);
	301
	302	first = (ret == 0);
	303	list_for_each_entry(chain, &node->val, list) {
	304	if (chain->ip >= PERF_CONTEXT_MAX)
	305	continue;
	306	ret += fprintf(fp, "%s%s", first ? "" : sep,
	307	callchain_list__sym_name(chain,
	308	bf, sizeof(bf), false));
	309	first = false;
	310	}
	311
	312	return ret;
	313	}
	314
	315	static size_t callchain__fprintf_folded(FILE fp, struct rb_root tree,
	316	u64 total_samples)
	317	{
	318	size_t ret = 0;
	319	u32 entries_printed = 0;
	320	struct callchain_node *chain;
	321	struct rb_node *rb_node = rb_first(tree);
	322
	323	while (rb_node) {
26e77924 NK	324
26e77924 NK	325	chain = rb_entry(rb_node, struct callchain_node, rb_node);
26e77924	326
5ab250ca NK	327	ret += callchain_node__fprintf_value(chain, fp, total_samples);
5ab250ca NK	328	ret += fprintf(fp, " ");
26e77924 NK	329	ret += __callchain__fprintf_folded(fp, chain);
	330	ret += fprintf(fp, "\n");
	331	if (++entries_printed == callchain_param.print_limit)
	332	break;
	333
	334	rb_node = rb_next(rb_node);
	335	}
	336
	337	return ret;
	338	}
	339
7ccf4f90 NK	340	static size_t hist_entry_callchain__fprintf(struct hist_entry *he,
	341	u64 total_samples, int left_margin,
	342	FILE *fp)
	343	{
54d27b31 NK	344	u64 parent_samples = he->stat.period;
	345
	346	if (symbol_conf.cumulate_callchain)
	347	parent_samples = he->stat_acc->period;
	348
7ccf4f90 NK	349	switch (callchain_param.mode) {
7ccf4f90 NK	350	case CHAIN_GRAPH_REL:
54d27b31 NK	351	return callchain__fprintf_graph(fp, &he->sorted_chain, total_samples,
54d27b31 NK	352	parent_samples, left_margin);
7ccf4f90 NK	353	break;
	354	case CHAIN_GRAPH_ABS:
	355	return callchain__fprintf_graph(fp, &he->sorted_chain, total_samples,
54d27b31	356	parent_samples, left_margin);
7ccf4f90 NK	357	break;
	358	case CHAIN_FLAT:
	359	return callchain__fprintf_flat(fp, &he->sorted_chain, total_samples);
	360	break;
26e77924 NK	361	case CHAIN_FOLDED:
	362	return callchain__fprintf_folded(fp, &he->sorted_chain, total_samples);
	363	break;
7ccf4f90 NK	364	case CHAIN_NONE:
	365	break;
	366	default:
	367	pr_err("Bad callchain mode\n");
	368	}
	369
	370	return 0;
	371	}
	372
26d8b338	373	static int hist_entry__snprintf(struct hist_entry he, struct perf_hpp hpp)
be0e6d10 JO	374	{
	375	const char *sep = symbol_conf.field_sep;
	376	struct perf_hpp_fmt *fmt;
	377	char *start = hpp->buf;
	378	int ret;
	379	bool first = true;
	380
	381	if (symbol_conf.exclude_other && !he->parent)
	382	return 0;
	383
	384	perf_hpp__for_each_format(fmt) {
361459f1	385	if (perf_hpp__should_skip(fmt, he->hists))
e67d49a7 NK	386	continue;
e67d49a7 NK	387
be0e6d10 JO	388	/*
	389	* If there's no field_sep, we still need
	390	* to display initial ' '.
	391	*/
	392	if (!sep \|\| !first) {
	393	ret = scnprintf(hpp->buf, hpp->size, "%s", sep ?: " ");
	394	advance_hpp(hpp, ret);
	395	} else
	396	first = false;
	397
9754c4f9	398	if (perf_hpp__use_color() && fmt->color)
be0e6d10 JO	399	ret = fmt->color(fmt, hpp, he);
	400	else
	401	ret = fmt->entry(fmt, hpp, he);
	402
	403	advance_hpp(hpp, ret);
	404	}
	405
	406	return hpp->buf - start;
	407	}
	408
7ccf4f90	409	static int hist_entry__fprintf(struct hist_entry *he, size_t size,
99cf666c ACM	410	struct hists *hists,
99cf666c ACM	411	char bf, size_t bfsz, FILE fp)
7ccf4f90	412	{
7ccf4f90	413	int ret;
ea251d51 NK	414	struct perf_hpp hpp = {
	415	.buf = bf,
	416	.size = size,
ea251d51	417	};
7e597d32	418	u64 total_period = hists->stats.total_period;
7ccf4f90	419
99cf666c ACM	420	if (size == 0 \|\| size > bfsz)
99cf666c ACM	421	size = hpp.size = bfsz;
7ccf4f90	422
26d8b338	423	hist_entry__snprintf(he, &hpp);
7ccf4f90	424
000078bc	425	ret = fprintf(fp, "%s\n", bf);
7ccf4f90	426
000078bc	427	if (symbol_conf.use_callchain)
7e597d32	428	ret += hist_entry_callchain__fprintf(he, total_period, 0, fp);
7ccf4f90	429
000078bc	430	return ret;
7ccf4f90 NK	431	}
7ccf4f90 NK	432
41724e4c	433	size_t hists__fprintf(struct hists *hists, bool show_header, int max_rows,
064f1981	434	int max_cols, float min_pcnt, FILE *fp)
7ccf4f90	435	{
1240005e	436	struct perf_hpp_fmt *fmt;
7ccf4f90 NK	437	struct rb_node *nd;
7ccf4f90 NK	438	size_t ret = 0;
7ccf4f90 NK	439	unsigned int width;
7ccf4f90 NK	440	const char *sep = symbol_conf.field_sep;
1240005e	441	int nr_rows = 0;
ed279da2	442	char bf[96];
ea251d51 NK	443	struct perf_hpp dummy_hpp = {
	444	.buf = bf,
	445	.size = sizeof(bf),
ea251d51	446	};
5395a048	447	bool first = true;
99cf666c ACM	448	size_t linesz;
99cf666c ACM	449	char *line = NULL;
7ccf4f90 NK	450
	451	init_rem_hits();
	452
678a500d NK	453	perf_hpp__for_each_format(fmt)
678a500d NK	454	perf_hpp__reset_width(fmt, hists);
26d8b338	455
5b591669 NK	456	if (symbol_conf.col_width_list_str)
	457	perf_hpp__set_user_width(symbol_conf.col_width_list_str);
	458
26d8b338 NK	459	if (!show_header)
	460	goto print_entries;
	461
	462	fprintf(fp, "# ");
	463
	464	perf_hpp__for_each_format(fmt) {
361459f1	465	if (perf_hpp__should_skip(fmt, hists))
e67d49a7 NK	466	continue;
e67d49a7 NK	467
26d8b338 NK	468	if (!first)
	469	fprintf(fp, "%s", sep ?: " ");
	470	else
	471	first = false;
	472
	473	fmt->header(fmt, &dummy_hpp, hists_to_evsel(hists));
	474	fprintf(fp, "%s", bf);
7ccf4f90 NK	475	}
	476
	477	fprintf(fp, "\n");
	478	if (max_rows && ++nr_rows >= max_rows)
	479	goto out;
	480
	481	if (sep)
	482	goto print_entries;
	483
5395a048 JO	484	first = true;
5395a048 JO	485
ea251d51	486	fprintf(fp, "# ");
ea251d51	487
1240005e JO	488	perf_hpp__for_each_format(fmt) {
1240005e JO	489	unsigned int i;
ea251d51	490
361459f1	491	if (perf_hpp__should_skip(fmt, hists))
e67d49a7 NK	492	continue;
e67d49a7 NK	493
5395a048	494	if (!first)
ea251d51	495	fprintf(fp, "%s", sep ?: " ");
5395a048 JO	496	else
5395a048 JO	497	first = false;
ea251d51	498
94a0793d	499	width = fmt->width(fmt, &dummy_hpp, hists_to_evsel(hists));
ea251d51 NK	500	for (i = 0; i < width; i++)
ea251d51 NK	501	fprintf(fp, ".");
7ccf4f90	502	}
ea251d51	503
7ccf4f90 NK	504	fprintf(fp, "\n");
	505	if (max_rows && ++nr_rows >= max_rows)
	506	goto out;
	507
	508	fprintf(fp, "#\n");
	509	if (max_rows && ++nr_rows >= max_rows)
	510	goto out;
	511
	512	print_entries:
99cf666c	513	linesz = hists__sort_list_width(hists) + 3 + 1;
9754c4f9	514	linesz += perf_hpp__color_overhead();
99cf666c ACM	515	line = malloc(linesz);
	516	if (line == NULL) {
	517	ret = -1;
	518	goto out;
	519	}
	520
7ccf4f90 NK	521	for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) {
7ccf4f90 NK	522	struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
14135663	523	float percent;
7ccf4f90 NK	524
	525	if (h->filtered)
	526	continue;
	527
14135663	528	percent = hist_entry__get_percent_limit(h);
064f1981 NK	529	if (percent < min_pcnt)
	530	continue;
	531
99cf666c	532	ret += hist_entry__fprintf(h, max_cols, hists, line, linesz, fp);
7ccf4f90	533
7ccf4f90	534	if (max_rows && ++nr_rows >= max_rows)
99cf666c	535	break;
7ccf4f90 NK	536
7ccf4f90 NK	537	if (h->ms.map == NULL && verbose > 1) {
93d5731d	538	__map_groups__fprintf_maps(h->thread->mg,
acebd408	539	MAP__FUNCTION, fp);
7ccf4f90 NK	540	fprintf(fp, "%.10s end\n", graph_dotted_line);
	541	}
	542	}
99cf666c ACM	543
99cf666c ACM	544	free(line);
7ccf4f90	545	out:
74cf249d	546	zfree(&rem_sq_bracket);
7ccf4f90 NK	547
	548	return ret;
	549	}
	550
52168eea	551	size_t events_stats__fprintf(struct events_stats stats, FILE fp)
7ccf4f90 NK	552	{
	553	int i;
	554	size_t ret = 0;
	555
	556	for (i = 0; i < PERF_RECORD_HEADER_MAX; ++i) {
	557	const char *name;
	558
52168eea	559	if (stats->nr_events[i] == 0)
7ccf4f90 NK	560	continue;
	561
	562	name = perf_event__name(i);
	563	if (!strcmp(name, "UNKNOWN"))
	564	continue;
	565
	566	ret += fprintf(fp, "%16s events: %10d\n", name,
52168eea	567	stats->nr_events[i]);
7ccf4f90 NK	568	}
	569
	570	return ret;
	571	}