[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++ && sort__first_dimension == SORT_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 (sort__first_dimension == SORT_COMM) {
		struct sort_entry *se = list_first_entry(&hist_entry__sort_list,
							 typeof(*se), list);
		left_margin = hists__col_len(hists, se->se_width_idx);
		left_margin -= thread__comm_len(he->thread);
	}

	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 sort_entry *se;
	struct rb_node *nd;
	size_t ret = 0;
	unsigned int width;
	const char *sep = symbol_conf.field_sep;
	const char *col_width = symbol_conf.col_width_list_str;
	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();

	list_for_each_entry(se, &hist_entry__sort_list, list) {
		if (se->elide)
			continue;
		width = strlen(se->se_header);
		if (symbol_conf.col_width_list_str) {
			if (col_width) {
				hists__set_col_len(hists, se->se_width_idx,
						   atoi(col_width));
				col_width = strchr(col_width, ',');
				if (col_width)
					++col_width;
			}
		}
		if (!hists__new_col_len(hists, se->se_width_idx, width))
			width = hists__col_len(hists, se->se_width_idx);
	}

	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	*/
186	if (!i++ && sort__first_dimension == SORT_SYM)
187	continue;
188	if (!printed) {
189	ret += callchain__fprintf_left_margin(fp, left_margin);
190	ret += fprintf(fp, "\|\n");
191	ret += callchain__fprintf_left_margin(fp, left_margin);
192	ret += fprintf(fp, "---");
193	left_margin += 3;
194	printed = true;
195	} else
196	ret += callchain__fprintf_left_margin(fp, left_margin);
197
198	if (chain->ms.sym)
199	ret += fprintf(fp, " %s\n", chain->ms.sym->name);
200	else
201	ret += fprintf(fp, " %p\n", (void *)(long)chain->ip);
202
203	if (++entries_printed == callchain_param.print_limit)
204	break;
205	}
206	root = &cnode->rb_root;
207	}
208
209	ret += __callchain__fprintf_graph(fp, root, total_samples,
210	1, 1, left_margin);
211	ret += fprintf(fp, "\n");
212
213	return ret;
214	}
215
316c7136	216	static size_t __callchain__fprintf_flat(FILE fp, struct callchain_node node,
7ccf4f90 NK	217	u64 total_samples)
	218	{
	219	struct callchain_list *chain;
	220	size_t ret = 0;
	221
316c7136	222	if (!node)
7ccf4f90 NK	223	return 0;
7ccf4f90 NK	224
316c7136	225	ret += __callchain__fprintf_flat(fp, node->parent, total_samples);
7ccf4f90 NK	226
7ccf4f90 NK	227
316c7136	228	list_for_each_entry(chain, &node->val, list) {
7ccf4f90 NK	229	if (chain->ip >= PERF_CONTEXT_MAX)
	230	continue;
	231	if (chain->ms.sym)
	232	ret += fprintf(fp, " %s\n", chain->ms.sym->name);
	233	else
	234	ret += fprintf(fp, " %p\n",
	235	(void *)(long)chain->ip);
	236	}
	237
	238	return ret;
	239	}
	240
316c7136	241	static size_t callchain__fprintf_flat(FILE fp, struct rb_root tree,
7ccf4f90 NK	242	u64 total_samples)
	243	{
	244	size_t ret = 0;
	245	u32 entries_printed = 0;
7ccf4f90	246	struct callchain_node *chain;
316c7136	247	struct rb_node *rb_node = rb_first(tree);
7ccf4f90	248
7ccf4f90 NK	249	while (rb_node) {
	250	double percent;
	251
	252	chain = rb_entry(rb_node, struct callchain_node, rb_node);
	253	percent = chain->hit * 100.0 / total_samples;
	254
	255	ret = percent_color_fprintf(fp, " %6.2f%%\n", percent);
	256	ret += __callchain__fprintf_flat(fp, chain, total_samples);
	257	ret += fprintf(fp, "\n");
	258	if (++entries_printed == callchain_param.print_limit)
	259	break;
	260
	261	rb_node = rb_next(rb_node);
	262	}
	263
	264	return ret;
	265	}
	266
	267	static size_t hist_entry_callchain__fprintf(struct hist_entry *he,
	268	u64 total_samples, int left_margin,
	269	FILE *fp)
	270	{
	271	switch (callchain_param.mode) {
	272	case CHAIN_GRAPH_REL:
b24c28f7	273	return callchain__fprintf_graph(fp, &he->sorted_chain, he->stat.period,
7ccf4f90 NK	274	left_margin);
	275	break;
	276	case CHAIN_GRAPH_ABS:
	277	return callchain__fprintf_graph(fp, &he->sorted_chain, total_samples,
	278	left_margin);
	279	break;
	280	case CHAIN_FLAT:
	281	return callchain__fprintf_flat(fp, &he->sorted_chain, total_samples);
	282	break;
	283	case CHAIN_NONE:
	284	break;
	285	default:
	286	pr_err("Bad callchain mode\n");
	287	}
	288
	289	return 0;
	290	}
	291
000078bc NK	292	static size_t hist_entry__callchain_fprintf(struct hist_entry *he,
000078bc NK	293	struct hists *hists,
b5ff71c3	294	FILE *fp)
000078bc NK	295	{
000078bc NK	296	int left_margin = 0;
b5ff71c3	297	u64 total_period = hists->stats.total_period;
000078bc NK	298
	299	if (sort__first_dimension == SORT_COMM) {
	300	struct sort_entry *se = list_first_entry(&hist_entry__sort_list,
	301	typeof(*se), list);
	302	left_margin = hists__col_len(hists, se->se_width_idx);
	303	left_margin -= thread__comm_len(he->thread);
	304	}
	305
	306	return hist_entry_callchain__fprintf(he, total_period, left_margin, fp);
	307	}
	308
26d8b338	309	static int hist_entry__snprintf(struct hist_entry he, struct perf_hpp hpp)
be0e6d10 JO	310	{
	311	const char *sep = symbol_conf.field_sep;
	312	struct perf_hpp_fmt *fmt;
	313	char *start = hpp->buf;
	314	int ret;
	315	bool first = true;
	316
	317	if (symbol_conf.exclude_other && !he->parent)
	318	return 0;
	319
	320	perf_hpp__for_each_format(fmt) {
e67d49a7 NK	321	if (perf_hpp__should_skip(fmt))
	322	continue;
	323
be0e6d10 JO	324	/*
	325	* If there's no field_sep, we still need
	326	* to display initial ' '.
	327	*/
	328	if (!sep \|\| !first) {
	329	ret = scnprintf(hpp->buf, hpp->size, "%s", sep ?: " ");
	330	advance_hpp(hpp, ret);
	331	} else
	332	first = false;
	333
9754c4f9	334	if (perf_hpp__use_color() && fmt->color)
be0e6d10 JO	335	ret = fmt->color(fmt, hpp, he);
	336	else
	337	ret = fmt->entry(fmt, hpp, he);
	338
	339	advance_hpp(hpp, ret);
	340	}
	341
	342	return hpp->buf - start;
	343	}
	344
7ccf4f90	345	static int hist_entry__fprintf(struct hist_entry *he, size_t size,
99cf666c ACM	346	struct hists *hists,
99cf666c ACM	347	char bf, size_t bfsz, FILE fp)
7ccf4f90	348	{
7ccf4f90	349	int ret;
ea251d51 NK	350	struct perf_hpp hpp = {
	351	.buf = bf,
	352	.size = size,
ea251d51	353	};
7ccf4f90	354
99cf666c ACM	355	if (size == 0 \|\| size > bfsz)
99cf666c ACM	356	size = hpp.size = bfsz;
7ccf4f90	357
26d8b338	358	hist_entry__snprintf(he, &hpp);
7ccf4f90	359
000078bc	360	ret = fprintf(fp, "%s\n", bf);
7ccf4f90	361
000078bc	362	if (symbol_conf.use_callchain)
b5ff71c3	363	ret += hist_entry__callchain_fprintf(he, hists, fp);
7ccf4f90	364
000078bc	365	return ret;
7ccf4f90 NK	366	}
7ccf4f90 NK	367
41724e4c	368	size_t hists__fprintf(struct hists *hists, bool show_header, int max_rows,
064f1981	369	int max_cols, float min_pcnt, FILE *fp)
7ccf4f90	370	{
1240005e	371	struct perf_hpp_fmt *fmt;
7ccf4f90 NK	372	struct sort_entry *se;
	373	struct rb_node *nd;
	374	size_t ret = 0;
7ccf4f90 NK	375	unsigned int width;
	376	const char *sep = symbol_conf.field_sep;
	377	const char *col_width = symbol_conf.col_width_list_str;
1240005e	378	int nr_rows = 0;
ed279da2	379	char bf[96];
ea251d51 NK	380	struct perf_hpp dummy_hpp = {
	381	.buf = bf,
	382	.size = sizeof(bf),
ea251d51	383	};
5395a048	384	bool first = true;
99cf666c ACM	385	size_t linesz;
99cf666c ACM	386	char *line = NULL;
7ccf4f90 NK	387
	388	init_rem_hits();
	389
7ccf4f90 NK	390	list_for_each_entry(se, &hist_entry__sort_list, list) {
	391	if (se->elide)
	392	continue;
7ccf4f90 NK	393	width = strlen(se->se_header);
	394	if (symbol_conf.col_width_list_str) {
	395	if (col_width) {
	396	hists__set_col_len(hists, se->se_width_idx,
	397	atoi(col_width));
	398	col_width = strchr(col_width, ',');
	399	if (col_width)
	400	++col_width;
	401	}
	402	}
	403	if (!hists__new_col_len(hists, se->se_width_idx, width))
	404	width = hists__col_len(hists, se->se_width_idx);
26d8b338 NK	405	}
	406
	407	if (!show_header)
	408	goto print_entries;
	409
	410	fprintf(fp, "# ");
	411
	412	perf_hpp__for_each_format(fmt) {
e67d49a7 NK	413	if (perf_hpp__should_skip(fmt))
	414	continue;
	415
26d8b338 NK	416	if (!first)
	417	fprintf(fp, "%s", sep ?: " ");
	418	else
	419	first = false;
	420
	421	fmt->header(fmt, &dummy_hpp, hists_to_evsel(hists));
	422	fprintf(fp, "%s", bf);
7ccf4f90 NK	423	}
	424
	425	fprintf(fp, "\n");
	426	if (max_rows && ++nr_rows >= max_rows)
	427	goto out;
	428
	429	if (sep)
	430	goto print_entries;
	431
5395a048 JO	432	first = true;
5395a048 JO	433
ea251d51	434	fprintf(fp, "# ");
ea251d51	435
1240005e JO	436	perf_hpp__for_each_format(fmt) {
1240005e JO	437	unsigned int i;
ea251d51	438
e67d49a7 NK	439	if (perf_hpp__should_skip(fmt))
	440	continue;
	441
5395a048	442	if (!first)
ea251d51	443	fprintf(fp, "%s", sep ?: " ");
5395a048 JO	444	else
5395a048 JO	445	first = false;
ea251d51	446
94a0793d	447	width = fmt->width(fmt, &dummy_hpp, hists_to_evsel(hists));
ea251d51 NK	448	for (i = 0; i < width; i++)
ea251d51 NK	449	fprintf(fp, ".");
7ccf4f90	450	}
ea251d51	451
7ccf4f90 NK	452	fprintf(fp, "\n");
	453	if (max_rows && ++nr_rows >= max_rows)
	454	goto out;
	455
	456	fprintf(fp, "#\n");
	457	if (max_rows && ++nr_rows >= max_rows)
	458	goto out;
	459
	460	print_entries:
99cf666c	461	linesz = hists__sort_list_width(hists) + 3 + 1;
9754c4f9	462	linesz += perf_hpp__color_overhead();
99cf666c ACM	463	line = malloc(linesz);
	464	if (line == NULL) {
	465	ret = -1;
	466	goto out;
	467	}
	468
7ccf4f90 NK	469	for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) {
7ccf4f90 NK	470	struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
064f1981 NK	471	float percent = h->stat.period * 100.0 /
064f1981 NK	472	hists->stats.total_period;
7ccf4f90 NK	473
	474	if (h->filtered)
	475	continue;
	476
064f1981 NK	477	if (percent < min_pcnt)
	478	continue;
	479
99cf666c	480	ret += hist_entry__fprintf(h, max_cols, hists, line, linesz, fp);
7ccf4f90	481
7ccf4f90	482	if (max_rows && ++nr_rows >= max_rows)
99cf666c	483	break;
7ccf4f90 NK	484
7ccf4f90 NK	485	if (h->ms.map == NULL && verbose > 1) {
93d5731d	486	__map_groups__fprintf_maps(h->thread->mg,
7ccf4f90 NK	487	MAP__FUNCTION, verbose, fp);
	488	fprintf(fp, "%.10s end\n", graph_dotted_line);
	489	}
	490	}
99cf666c ACM	491
99cf666c ACM	492	free(line);
7ccf4f90	493	out:
74cf249d	494	zfree(&rem_sq_bracket);
7ccf4f90 NK	495
	496	return ret;
	497	}
	498
52168eea	499	size_t events_stats__fprintf(struct events_stats stats, FILE fp)
7ccf4f90 NK	500	{
	501	int i;
	502	size_t ret = 0;
	503
	504	for (i = 0; i < PERF_RECORD_HEADER_MAX; ++i) {
	505	const char *name;
	506
52168eea	507	if (stats->nr_events[i] == 0)
7ccf4f90 NK	508	continue;
	509
	510	name = perf_event__name(i);
	511	if (!strcmp(name, "UNKNOWN"))
	512	continue;
	513
	514	ret += fprintf(fp, "%16s events: %10d\n", name,
52168eea	515	stats->nr_events[i]);
7ccf4f90 NK	516	}
	517
	518	return ret;
	519	}