• Home
  • History
  • Annotate
  • Line#
  • Navigate
  • Raw
  • Download
  • only in /asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/tools/perf/util/
1#ifndef __PERF_HIST_H
2#define __PERF_HIST_H
3
4#include <linux/types.h>
5#include "callchain.h"
6
7extern struct callchain_param callchain_param;
8
9struct hist_entry;
10struct addr_location;
11struct symbol;
12struct rb_root;
13
14struct objdump_line {
15	struct list_head node;
16	s64		 offset;
17	char		 *line;
18};
19
20void objdump_line__free(struct objdump_line *self);
21struct objdump_line *objdump__get_next_ip_line(struct list_head *head,
22					       struct objdump_line *pos);
23
24struct sym_hist {
25	u64		sum;
26	u64		ip[0];
27};
28
29struct sym_ext {
30	struct rb_node	node;
31	double		percent;
32	char		*path;
33};
34
35struct sym_priv {
36	struct sym_hist	*hist;
37	struct sym_ext	*ext;
38};
39
40/*
41 * The kernel collects the number of events it couldn't send in a stretch and
42 * when possible sends this number in a PERF_RECORD_LOST event. The number of
43 * such "chunks" of lost events is stored in .nr_events[PERF_EVENT_LOST] while
44 * total_lost tells exactly how many events the kernel in fact lost, i.e. it is
45 * the sum of all struct lost_event.lost fields reported.
46 *
47 * The total_period is needed because by default auto-freq is used, so
48 * multipling nr_events[PERF_EVENT_SAMPLE] by a frequency isn't possible to get
49 * the total number of low level events, it is necessary to to sum all struct
50 * sample_event.period and stash the result in total_period.
51 */
52struct events_stats {
53	u64 total_period;
54	u64 total_lost;
55	u32 nr_events[PERF_RECORD_HEADER_MAX];
56	u32 nr_unknown_events;
57};
58
59enum hist_column {
60	HISTC_SYMBOL,
61	HISTC_DSO,
62	HISTC_THREAD,
63	HISTC_COMM,
64	HISTC_PARENT,
65	HISTC_CPU,
66	HISTC_NR_COLS, /* Last entry */
67};
68
69struct hists {
70	struct rb_node		rb_node;
71	struct rb_root		entries;
72	u64			nr_entries;
73	struct events_stats	stats;
74	u64			config;
75	u64			event_stream;
76	u32			type;
77	u16			col_len[HISTC_NR_COLS];
78};
79
80struct hist_entry *__hists__add_entry(struct hists *self,
81				      struct addr_location *al,
82				      struct symbol *parent, u64 period);
83extern int64_t hist_entry__cmp(struct hist_entry *, struct hist_entry *);
84extern int64_t hist_entry__collapse(struct hist_entry *, struct hist_entry *);
85int hist_entry__fprintf(struct hist_entry *self, struct hists *hists,
86			struct hists *pair_hists, bool show_displacement,
87			long displacement, FILE *fp, u64 total);
88int hist_entry__snprintf(struct hist_entry *self, char *bf, size_t size,
89			 struct hists *hists, struct hists *pair_hists,
90			 bool show_displacement, long displacement,
91			 bool color, u64 total);
92void hist_entry__free(struct hist_entry *);
93
94void hists__output_resort(struct hists *self);
95void hists__collapse_resort(struct hists *self);
96
97void hists__inc_nr_events(struct hists *self, u32 type);
98size_t hists__fprintf_nr_events(struct hists *self, FILE *fp);
99
100size_t hists__fprintf(struct hists *self, struct hists *pair,
101		      bool show_displacement, FILE *fp);
102
103int hist_entry__inc_addr_samples(struct hist_entry *self, u64 ip);
104int hist_entry__annotate(struct hist_entry *self, struct list_head *head,
105			 size_t privsize);
106
107void hists__filter_by_dso(struct hists *self, const struct dso *dso);
108void hists__filter_by_thread(struct hists *self, const struct thread *thread);
109
110u16 hists__col_len(struct hists *self, enum hist_column col);
111void hists__set_col_len(struct hists *self, enum hist_column col, u16 len);
112bool hists__new_col_len(struct hists *self, enum hist_column col, u16 len);
113
114#ifdef NO_NEWT_SUPPORT
115static inline int hists__browse(struct hists *self __used,
116				const char *helpline __used,
117				const char *ev_name __used)
118{
119	return 0;
120}
121
122static inline int hists__tui_browse_tree(struct rb_root *self __used,
123					 const char *help __used)
124{
125	return 0;
126}
127
128static inline int hist_entry__tui_annotate(struct hist_entry *self __used)
129{
130	return 0;
131}
132#define KEY_LEFT -1
133#define KEY_RIGHT -2
134#else
135#include <newt.h>
136int hists__browse(struct hists *self, const char *helpline,
137		  const char *ev_name);
138int hist_entry__tui_annotate(struct hist_entry *self);
139
140#define KEY_LEFT NEWT_KEY_LEFT
141#define KEY_RIGHT NEWT_KEY_RIGHT
142
143int hists__tui_browse_tree(struct rb_root *self, const char *help);
144#endif
145
146unsigned int hists__sort_list_width(struct hists *self);
147
148#endif	/* __PERF_HIST_H */
149