1 #ifndef __PERF_HIST_H 2 #define __PERF_HIST_H 3 4 #include <linux/types.h> 5 #include "callchain.h" 6 7 extern struct callchain_param callchain_param; 8 9 struct hist_entry; 10 struct addr_location; 11 struct symbol; 12 struct rb_root; 13 14 struct objdump_line { 15 struct list_head node; 16 s64 offset; 17 char *line; 18 }; 19 20 void objdump_line__free(struct objdump_line *self); 21 struct objdump_line *objdump__get_next_ip_line(struct list_head *head, 22 struct objdump_line *pos); 23 24 struct sym_hist { 25 u64 sum; 26 u64 ip[0]; 27 }; 28 29 struct sym_ext { 30 struct rb_node node; 31 double percent; 32 char *path; 33 }; 34 35 struct 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 */ 52 struct 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 59 struct hists { 60 struct rb_node rb_node; 61 struct rb_root entries; 62 u64 nr_entries; 63 struct events_stats stats; 64 u64 config; 65 u64 event_stream; 66 u32 type; 67 u32 max_sym_namelen; 68 }; 69 70 struct hist_entry *__hists__add_entry(struct hists *self, 71 struct addr_location *al, 72 struct symbol *parent, u64 period); 73 extern int64_t hist_entry__cmp(struct hist_entry *, struct hist_entry *); 74 extern int64_t hist_entry__collapse(struct hist_entry *, struct hist_entry *); 75 int hist_entry__fprintf(struct hist_entry *self, struct hists *pair_hists, 76 bool show_displacement, long displacement, FILE *fp, 77 u64 total); 78 int hist_entry__snprintf(struct hist_entry *self, char *bf, size_t size, 79 struct hists *pair_hists, bool show_displacement, 80 long displacement, bool color, u64 total); 81 void hist_entry__free(struct hist_entry *); 82 83 void hists__output_resort(struct hists *self); 84 void hists__collapse_resort(struct hists *self); 85 86 void hists__inc_nr_events(struct hists *self, u32 type); 87 size_t hists__fprintf_nr_events(struct hists *self, FILE *fp); 88 89 size_t hists__fprintf(struct hists *self, struct hists *pair, 90 bool show_displacement, FILE *fp); 91 92 int hist_entry__inc_addr_samples(struct hist_entry *self, u64 ip); 93 int hist_entry__annotate(struct hist_entry *self, struct list_head *head); 94 95 void hists__filter_by_dso(struct hists *self, const struct dso *dso); 96 void hists__filter_by_thread(struct hists *self, const struct thread *thread); 97 98 #ifdef NO_NEWT_SUPPORT 99 static inline int hists__browse(struct hists *self __used, 100 const char *helpline __used, 101 const char *ev_name __used) 102 { 103 return 0; 104 } 105 106 static inline int hists__tui_browse_tree(struct rb_root *self __used, 107 const char *help __used) 108 { 109 return 0; 110 } 111 112 static inline int hist_entry__tui_annotate(struct hist_entry *self __used) 113 { 114 return 0; 115 } 116 #define KEY_LEFT -1 117 #define KEY_RIGHT -2 118 #else 119 #include <newt.h> 120 int hists__browse(struct hists *self, const char *helpline, 121 const char *ev_name); 122 int hist_entry__tui_annotate(struct hist_entry *self); 123 124 #define KEY_LEFT NEWT_KEY_LEFT 125 #define KEY_RIGHT NEWT_KEY_RIGHT 126 127 int hists__tui_browse_tree(struct rb_root *self, const char *help); 128 #endif 129 #endif /* __PERF_HIST_H */ 130