[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"


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 *self,
					u64 total_samples)
{
	struct callchain_list *chain;
	size_t ret = 0;

	if (!self)
		return 0;

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


	list_for_each_entry(chain, &self->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 *self,
				      u64 total_samples)
{
	size_t ret = 0;
	u32 entries_printed = 0;
	struct rb_node *rb_node;
	struct callchain_node *chain;

	rb_node = rb_first(self);
	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__fprintf(struct hist_entry *he, size_t size,
			       struct hists *hists, FILE *fp)
{
	char bf[512];
	int ret;
	struct perf_hpp hpp = {
		.buf		= bf,
		.size		= size,
	};
	bool color = !symbol_conf.field_sep;

	if (size == 0 || size > sizeof(bf))
		size = hpp.size = sizeof(bf);

	ret = hist_entry__period_snprintf(&hpp, he, color);
	hist_entry__sort_snprintf(he, bf + ret, size - ret, hists);

	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, FILE *fp)
{
	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 idx, nr_rows = 0;
	char bf[96];
	struct perf_hpp dummy_hpp = {
		.buf	= bf,
		.size	= sizeof(bf),
	};
	bool first = true;

	init_rem_hits();

	if (!show_header)
		goto print_entries;

	fprintf(fp, "# ");
	for (idx = 0; idx < PERF_HPP__MAX_INDEX; idx++) {
		if (!perf_hpp__format[idx].cond)
			continue;

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

		perf_hpp__format[idx].header(&dummy_hpp);
		fprintf(fp, "%s", bf);
	}

	list_for_each_entry(se, &hist_entry__sort_list, list) {
		if (se->elide)
			continue;
		if (sep) {
			fprintf(fp, "%c%s", *sep, se->se_header);
			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);
		fprintf(fp, "  %*s", width, se->se_header);
	}

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

	if (sep)
		goto print_entries;

	first = true;

	fprintf(fp, "# ");
	for (idx = 0; idx < PERF_HPP__MAX_INDEX; idx++) {
		unsigned int i;

		if (!perf_hpp__format[idx].cond)
			continue;

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

		width = perf_hpp__format[idx].width(&dummy_hpp);
		for (i = 0; i < width; i++)
			fprintf(fp, ".");
	}

	list_for_each_entry(se, &hist_entry__sort_list, list) {
		unsigned int i;

		if (se->elide)
			continue;

		fprintf(fp, "  ");
		width = hists__col_len(hists, se->se_width_idx);
		if (width == 0)
			width = strlen(se->se_header);
		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:
	for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) {
		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);

		if (h->filtered)
			continue;

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

		if (max_rows && ++nr_rows >= max_rows)
			goto out;

		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);
		}
	}
out:
	free(rem_sq_bracket);

	return ret;
}

size_t hists__fprintf_nr_events(struct hists *hists, FILE *fp)
{
	int i;
	size_t ret = 0;

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

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

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

		ret += fprintf(fp, "%16s events: %10d\n", name,
			       hists->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"
	6
	7
	8	static size_t callchain__fprintf_left_margin(FILE *fp, int left_margin)
	9	{
	10	int i;
	11	int ret = fprintf(fp, " ");
	12
	13	for (i = 0; i < left_margin; i++)
	14	ret += fprintf(fp, " ");
	15
	16	return ret;
	17	}
	18
	19	static size_t ipchain__fprintf_graph_line(FILE *fp, int depth, int depth_mask,
	20	int left_margin)
	21	{
	22	int i;
	23	size_t ret = callchain__fprintf_left_margin(fp, left_margin);
	24
	25	for (i = 0; i < depth; i++)
	26	if (depth_mask & (1 << i))
	27	ret += fprintf(fp, "\| ");
	28	else
	29	ret += fprintf(fp, " ");
	30
	31	ret += fprintf(fp, "\n");
	32
	33	return ret;
	34	}
	35
	36	static size_t ipchain__fprintf_graph(FILE fp, struct callchain_list chain,
	37	int depth, int depth_mask, int period,
	38	u64 total_samples, u64 hits,
	39	int left_margin)
	40	{
	41	int i;
	42	size_t ret = 0;
	43
	44	ret += callchain__fprintf_left_margin(fp, left_margin);
	45	for (i = 0; i < depth; i++) {
	46	if (depth_mask & (1 << i))
	47	ret += fprintf(fp, "\|");
	48	else
	49	ret += fprintf(fp, " ");
	50	if (!period && i == depth - 1) {
	51	double percent;
	52
	53	percent = hits * 100.0 / total_samples;
	54	ret += percent_color_fprintf(fp, "--%2.2f%%-- ", percent);
	55	} else
	56	ret += fprintf(fp, "%s", " ");
	57	}
	58	if (chain->ms.sym)
	59	ret += fprintf(fp, "%s\n", chain->ms.sym->name);
	60	else
	61	ret += fprintf(fp, "0x%0" PRIx64 "\n", chain->ip);
	62
	63	return ret;
	64	}
	65
66	static struct symbol *rem_sq_bracket;
67	static struct callchain_list rem_hits;
68
69	static void init_rem_hits(void)
70	{
71	rem_sq_bracket = malloc(sizeof(*rem_sq_bracket) + 6);
72	if (!rem_sq_bracket) {
73	fprintf(stderr, "Not enough memory to display remaining hits\n");
74	return;
75	}
76
77	strcpy(rem_sq_bracket->name, "[...]");
78	rem_hits.ms.sym = rem_sq_bracket;
79	}
80
81	static size_t __callchain__fprintf_graph(FILE fp, struct rb_root root,
82	u64 total_samples, int depth,
83	int depth_mask, int left_margin)
84	{
85	struct rb_node node, next;
86	struct callchain_node *child;
87	struct callchain_list *chain;
88	int new_depth_mask = depth_mask;
89	u64 remaining;
90	size_t ret = 0;
91	int i;
92	uint entries_printed = 0;
93
94	remaining = total_samples;
95
96	node = rb_first(root);
97	while (node) {
98	u64 new_total;
99	u64 cumul;
100
101	child = rb_entry(node, struct callchain_node, rb_node);
102	cumul = callchain_cumul_hits(child);
103	remaining -= cumul;
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) {
124	ret += ipchain__fprintf_graph(fp, chain, depth,
125	new_depth_mask, i++,
126	total_samples,
127	cumul,
128	left_margin);
129	}
130
131	if (callchain_param.mode == CHAIN_GRAPH_REL)
132	new_total = child->children_hit;
133	else
134	new_total = total_samples;
135
136	ret += __callchain__fprintf_graph(fp, &child->rb_root, new_total,
137	depth + 1,
138	new_depth_mask \| (1 << depth),
139	left_margin);
140	node = next;
141	if (++entries_printed == callchain_param.print_limit)
142	break;
143	}
144
145	if (callchain_param.mode == CHAIN_GRAPH_REL &&
146	remaining && remaining != total_samples) {
147
148	if (!rem_sq_bracket)
149	return ret;
150
151	new_depth_mask &= ~(1 << (depth - 1));
152	ret += ipchain__fprintf_graph(fp, &rem_hits, depth,
153	new_depth_mask, 0, total_samples,
154	remaining, left_margin);
155	}
156
157	return ret;
158	}
159
160	static size_t callchain__fprintf_graph(FILE fp, struct rb_root root,
161	u64 total_samples, int left_margin)
162	{
163	struct callchain_node *cnode;
164	struct callchain_list *chain;
165	u32 entries_printed = 0;
166	bool printed = false;
167	struct rb_node *node;
168	int i = 0;
169	int ret = 0;
170
171	/*
172	* If have one single callchain root, don't bother printing
173	* its percentage (100 % in fractal mode and the same percentage
174	* than the hist in graph mode). This also avoid one level of column.
175	*/
176	node = rb_first(root);
177	if (node && !rb_next(node)) {
178	cnode = rb_entry(node, struct callchain_node, rb_node);
179	list_for_each_entry(chain, &cnode->val, list) {
180	/*
181	* If we sort by symbol, the first entry is the same than
182	* the symbol. No need to print it otherwise it appears as
183	* displayed twice.
184	*/
185	if (!i++ && sort__first_dimension == SORT_SYM)
186	continue;
187	if (!printed) {
188	ret += callchain__fprintf_left_margin(fp, left_margin);
189	ret += fprintf(fp, "\|\n");
190	ret += callchain__fprintf_left_margin(fp, left_margin);
191	ret += fprintf(fp, "---");
192	left_margin += 3;
193	printed = true;
194	} else
195	ret += callchain__fprintf_left_margin(fp, left_margin);
196
197	if (chain->ms.sym)
198	ret += fprintf(fp, " %s\n", chain->ms.sym->name);
199	else
200	ret += fprintf(fp, " %p\n", (void *)(long)chain->ip);
201
202	if (++entries_printed == callchain_param.print_limit)
203	break;
204	}
205	root = &cnode->rb_root;
206	}
207
208	ret += __callchain__fprintf_graph(fp, root, total_samples,
209	1, 1, left_margin);
210	ret += fprintf(fp, "\n");
211
212	return ret;
213	}
214
215	static size_t __callchain__fprintf_flat(FILE *fp,
216	struct callchain_node *self,
217	u64 total_samples)
218	{
219	struct callchain_list *chain;
220	size_t ret = 0;
221
222	if (!self)
223	return 0;
224
225	ret += __callchain__fprintf_flat(fp, self->parent, total_samples);
226
227
228	list_for_each_entry(chain, &self->val, list) {
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
241	static size_t callchain__fprintf_flat(FILE fp, struct rb_root self,
242	u64 total_samples)
243	{
244	size_t ret = 0;
245	u32 entries_printed = 0;
246	struct rb_node *rb_node;
247	struct callchain_node *chain;
248
249	rb_node = rb_first(self);
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 NK	299
	300	if (sort__first_dimension == SORT_COMM) {
	301	struct sort_entry *se = list_first_entry(&hist_entry__sort_list,
	302	typeof(*se), list);
	303	left_margin = hists__col_len(hists, se->se_width_idx);
	304	left_margin -= thread__comm_len(he->thread);
	305	}
	306
	307	return hist_entry_callchain__fprintf(he, total_period, left_margin, fp);
	308	}
	309
7ccf4f90	310	static int hist_entry__fprintf(struct hist_entry *he, size_t size,
b5ff71c3	311	struct hists hists, FILE fp)
7ccf4f90 NK	312	{
	313	char bf[512];
	314	int ret;
ea251d51 NK	315	struct perf_hpp hpp = {
	316	.buf = bf,
	317	.size = size,
ea251d51	318	};
9ffad987	319	bool color = !symbol_conf.field_sep;
7ccf4f90 NK	320
7ccf4f90 NK	321	if (size == 0 \|\| size > sizeof(bf))
ea251d51	322	size = hpp.size = sizeof(bf);
7ccf4f90	323
9ffad987	324	ret = hist_entry__period_snprintf(&hpp, he, color);
000078bc	325	hist_entry__sort_snprintf(he, bf + ret, size - ret, hists);
7ccf4f90	326
000078bc	327	ret = fprintf(fp, "%s\n", bf);
7ccf4f90	328
000078bc	329	if (symbol_conf.use_callchain)
b5ff71c3	330	ret += hist_entry__callchain_fprintf(he, hists, fp);
7ccf4f90	331
000078bc	332	return ret;
7ccf4f90 NK	333	}
7ccf4f90 NK	334
41724e4c	335	size_t hists__fprintf(struct hists *hists, bool show_header, int max_rows,
7ccf4f90 NK	336	int max_cols, FILE *fp)
	337	{
	338	struct sort_entry *se;
	339	struct rb_node *nd;
	340	size_t ret = 0;
7ccf4f90 NK	341	unsigned int width;
	342	const char *sep = symbol_conf.field_sep;
	343	const char *col_width = symbol_conf.col_width_list_str;
ea251d51	344	int idx, nr_rows = 0;
ed279da2	345	char bf[96];
ea251d51 NK	346	struct perf_hpp dummy_hpp = {
	347	.buf = bf,
	348	.size = sizeof(bf),
ea251d51	349	};
5395a048	350	bool first = true;
7ccf4f90 NK	351
	352	init_rem_hits();
	353
	354	if (!show_header)
	355	goto print_entries;
	356
ea251d51 NK	357	fprintf(fp, "# ");
	358	for (idx = 0; idx < PERF_HPP__MAX_INDEX; idx++) {
	359	if (!perf_hpp__format[idx].cond)
	360	continue;
7ccf4f90	361
5395a048	362	if (!first)
ea251d51	363	fprintf(fp, "%s", sep ?: " ");
5395a048 JO	364	else
5395a048 JO	365	first = false;
7ccf4f90	366
ea251d51 NK	367	perf_hpp__format[idx].header(&dummy_hpp);
ea251d51 NK	368	fprintf(fp, "%s", bf);
7ccf4f90 NK	369	}
	370
	371	list_for_each_entry(se, &hist_entry__sort_list, list) {
	372	if (se->elide)
	373	continue;
	374	if (sep) {
	375	fprintf(fp, "%c%s", *sep, se->se_header);
	376	continue;
	377	}
	378	width = strlen(se->se_header);
	379	if (symbol_conf.col_width_list_str) {
	380	if (col_width) {
	381	hists__set_col_len(hists, se->se_width_idx,
	382	atoi(col_width));
	383	col_width = strchr(col_width, ',');
	384	if (col_width)
	385	++col_width;
	386	}
	387	}
	388	if (!hists__new_col_len(hists, se->se_width_idx, width))
	389	width = hists__col_len(hists, se->se_width_idx);
	390	fprintf(fp, " %*s", width, se->se_header);
	391	}
	392
	393	fprintf(fp, "\n");
	394	if (max_rows && ++nr_rows >= max_rows)
	395	goto out;
	396
	397	if (sep)
	398	goto print_entries;
	399
5395a048 JO	400	first = true;
5395a048 JO	401
ea251d51 NK	402	fprintf(fp, "# ");
	403	for (idx = 0; idx < PERF_HPP__MAX_INDEX; idx++) {
	404	unsigned int i;
	405
	406	if (!perf_hpp__format[idx].cond)
	407	continue;
	408
5395a048	409	if (!first)
ea251d51	410	fprintf(fp, "%s", sep ?: " ");
5395a048 JO	411	else
5395a048 JO	412	first = false;
ea251d51 NK	413
	414	width = perf_hpp__format[idx].width(&dummy_hpp);
	415	for (i = 0; i < width; i++)
	416	fprintf(fp, ".");
7ccf4f90	417	}
ea251d51	418
7ccf4f90 NK	419	list_for_each_entry(se, &hist_entry__sort_list, list) {
	420	unsigned int i;
	421
	422	if (se->elide)
	423	continue;
	424
	425	fprintf(fp, " ");
	426	width = hists__col_len(hists, se->se_width_idx);
	427	if (width == 0)
	428	width = strlen(se->se_header);
	429	for (i = 0; i < width; i++)
	430	fprintf(fp, ".");
	431	}
	432
	433	fprintf(fp, "\n");
	434	if (max_rows && ++nr_rows >= max_rows)
	435	goto out;
	436
	437	fprintf(fp, "#\n");
	438	if (max_rows && ++nr_rows >= max_rows)
	439	goto out;
	440
	441	print_entries:
7ccf4f90 NK	442	for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) {
	443	struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
	444
	445	if (h->filtered)
	446	continue;
	447
b5ff71c3	448	ret += hist_entry__fprintf(h, max_cols, hists, fp);
7ccf4f90	449
7ccf4f90 NK	450	if (max_rows && ++nr_rows >= max_rows)
	451	goto out;
	452
	453	if (h->ms.map == NULL && verbose > 1) {
	454	__map_groups__fprintf_maps(&h->thread->mg,
	455	MAP__FUNCTION, verbose, fp);
	456	fprintf(fp, "%.10s end\n", graph_dotted_line);
	457	}
	458	}
	459	out:
	460	free(rem_sq_bracket);
	461
	462	return ret;
	463	}
	464
	465	size_t hists__fprintf_nr_events(struct hists hists, FILE fp)
	466	{
	467	int i;
	468	size_t ret = 0;
	469
	470	for (i = 0; i < PERF_RECORD_HEADER_MAX; ++i) {
	471	const char *name;
	472
	473	if (hists->stats.nr_events[i] == 0)
	474	continue;
	475
	476	name = perf_event__name(i);
	477	if (!strcmp(name, "UNKNOWN"))
	478	continue;
	479
	480	ret += fprintf(fp, "%16s events: %10d\n", name,
	481	hists->stats.nr_events[i]);
	482	}
	483
	484	return ret;
	485	}