[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_list *chain,
				     int depth, int depth_mask, int period,
				     u64 total_samples, u64 hits,
				     int left_margin)
{
	int i;
	size_t ret = 0;

	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) {
			double percent;

			percent = hits * 100.0 / total_samples;
			ret += percent_color_fprintf(fp, "--%2.2f%%-- ", percent);
		} else
			ret += fprintf(fp, "%s", "          ");
	}
	if (chain->ms.sym)
		ret += fprintf(fp, "%s\n", chain->ms.sym->name);
	else
		ret += fprintf(fp, "0x%0" PRIx64 "\n", chain->ip);

	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;
	struct callchain_list *chain;
	int new_depth_mask = depth_mask;
	u64 remaining;
	size_t ret = 0;
	int i;
	uint entries_printed = 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;

		/*
		 * 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, chain, depth,
						      new_depth_mask, i++,
						      total_samples,
						      cumul,
						      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) {

		if (!rem_sq_bracket)
			return ret;

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

	return ret;
}

static size_t callchain__fprintf_graph(FILE *fp, struct rb_root *root,
				       u64 total_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;

	/*
	 * 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.
	 */
	node = rb_first(root);
	if (node && !rb_next(node)) {
		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);

			if (chain->ms.sym)
				ret += fprintf(fp, " %s\n", chain->ms.sym->name);
			else
				ret += fprintf(fp, " %p\n", (void *)(long)chain->ip);

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

	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;

	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;
		if (chain->ms.sym)
			ret += fprintf(fp, "                %s\n", chain->ms.sym->name);
		else
			ret += fprintf(fp, "                %p\n",
					(void *)(long)chain->ip);
	}

	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) {
		double percent;

		chain = rb_entry(rb_node, struct callchain_node, rb_node);
		percent = chain->hit * 100.0 / total_samples;

		ret = percent_color_fprintf(fp, "           %6.2f%%\n", percent);
		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 hist_entry_callchain__fprintf(struct hist_entry *he,
					    u64 total_samples, int left_margin,
					    FILE *fp)
{
	switch (callchain_param.mode) {
	case CHAIN_GRAPH_REL:
		return callchain__fprintf_graph(fp, &he->sorted_chain, he->stat.period,
						left_margin);
		break;
	case CHAIN_GRAPH_ABS:
		return callchain__fprintf_graph(fp, &he->sorted_chain, total_samples,
						left_margin);
		break;
	case CHAIN_FLAT:
		return callchain__fprintf_flat(fp, &he->sorted_chain, total_samples);
		break;
	case CHAIN_NONE:
		break;
	default:
		pr_err("Bad callchain mode\n");
	}

	return 0;
}

static size_t hist_entry__callchain_fprintf(struct hist_entry *he,
					    struct hists *hists,
					    FILE *fp)
{
	int left_margin = 0;
	u64 total_period = hists->stats.total_period;

	if (field_order == NULL && (sort_order == NULL ||
				    !prefixcmp(sort_order, "comm"))) {
		struct perf_hpp_fmt *fmt;

		perf_hpp__for_each_format(fmt) {
			if (!perf_hpp__is_sort_entry(fmt))
				continue;

			/* must be 'comm' sort entry */
			left_margin = fmt->width(fmt, NULL, hists_to_evsel(hists));
			left_margin -= thread__comm_len(he->thread);
			break;
		}
	}
	return hist_entry_callchain__fprintf(he, total_period, left_margin, fp);
}

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

	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, hists, 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 (!show_header)
		goto print_entries;

	fprintf(fp, "# ");

	perf_hpp__for_each_format(fmt) {
		if (perf_hpp__should_skip(fmt))
			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))
			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 = h->stat.period * 100.0 /
					hists->stats.total_period;

		if (h->filtered)
			continue;

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