Loading...
1#ifndef __PERF_SORT_H
2#define __PERF_SORT_H
3#include "../builtin.h"
4
5#include "util.h"
6
7#include "color.h"
8#include <linux/list.h>
9#include "cache.h"
10#include <linux/rbtree.h>
11#include "symbol.h"
12#include "string.h"
13#include "callchain.h"
14#include "strlist.h"
15#include "values.h"
16
17#include "../perf.h"
18#include "debug.h"
19#include "header.h"
20
21#include "parse-options.h"
22#include "parse-events.h"
23
24#include "thread.h"
25#include "sort.h"
26
27extern regex_t parent_regex;
28extern const char *sort_order;
29extern const char default_parent_pattern[];
30extern const char *parent_pattern;
31extern const char default_sort_order[];
32extern int sort__need_collapse;
33extern int sort__has_parent;
34extern char *field_sep;
35extern struct sort_entry sort_comm;
36extern struct sort_entry sort_dso;
37extern struct sort_entry sort_sym;
38extern struct sort_entry sort_parent;
39extern enum sort_type sort__first_dimension;
40
41/**
42 * struct hist_entry - histogram entry
43 *
44 * @row_offset - offset from the first callchain expanded to appear on screen
45 * @nr_rows - rows expanded in callchain, recalculated on folding/unfolding
46 */
47struct hist_entry {
48 struct rb_node rb_node;
49 u64 period;
50 u64 period_sys;
51 u64 period_us;
52 u64 period_guest_sys;
53 u64 period_guest_us;
54 struct map_symbol ms;
55 struct thread *thread;
56 u64 ip;
57 s32 cpu;
58 u32 nr_events;
59
60 /* XXX These two should move to some tree widget lib */
61 u16 row_offset;
62 u16 nr_rows;
63
64 bool init_have_children;
65 char level;
66 u8 filtered;
67 struct symbol *parent;
68 union {
69 unsigned long position;
70 struct hist_entry *pair;
71 struct rb_root sorted_chain;
72 };
73 struct callchain_root callchain[0];
74};
75
76enum sort_type {
77 SORT_PID,
78 SORT_COMM,
79 SORT_DSO,
80 SORT_SYM,
81 SORT_PARENT,
82 SORT_CPU,
83};
84
85/*
86 * configurable sorting bits
87 */
88
89struct sort_entry {
90 struct list_head list;
91
92 const char *se_header;
93
94 int64_t (*se_cmp)(struct hist_entry *, struct hist_entry *);
95 int64_t (*se_collapse)(struct hist_entry *, struct hist_entry *);
96 int (*se_snprintf)(struct hist_entry *self, char *bf, size_t size,
97 unsigned int width);
98 u8 se_width_idx;
99 bool elide;
100};
101
102extern struct sort_entry sort_thread;
103extern struct list_head hist_entry__sort_list;
104
105void setup_sorting(const char * const usagestr[], const struct option *opts);
106extern int sort_dimension__add(const char *);
107void sort_entry__setup_elide(struct sort_entry *self, struct strlist *list,
108 const char *list_name, FILE *fp);
109
110#endif /* __PERF_SORT_H */
1#ifndef __PERF_SORT_H
2#define __PERF_SORT_H
3#include "../builtin.h"
4
5#include "util.h"
6
7#include "color.h"
8#include <linux/list.h>
9#include "cache.h"
10#include <linux/rbtree.h>
11#include "symbol.h"
12#include "string.h"
13#include "callchain.h"
14#include "strlist.h"
15#include "values.h"
16
17#include "../perf.h"
18#include "debug.h"
19#include "header.h"
20
21#include "parse-options.h"
22#include "parse-events.h"
23
24#include "thread.h"
25
26extern regex_t parent_regex;
27extern const char *sort_order;
28extern const char default_parent_pattern[];
29extern const char *parent_pattern;
30extern const char default_sort_order[];
31extern regex_t ignore_callees_regex;
32extern int have_ignore_callees;
33extern int sort__need_collapse;
34extern int sort__has_parent;
35extern int sort__has_sym;
36extern enum sort_mode sort__mode;
37extern struct sort_entry sort_comm;
38extern struct sort_entry sort_dso;
39extern struct sort_entry sort_sym;
40extern struct sort_entry sort_parent;
41extern struct sort_entry sort_dso_from;
42extern struct sort_entry sort_dso_to;
43extern struct sort_entry sort_sym_from;
44extern struct sort_entry sort_sym_to;
45extern enum sort_type sort__first_dimension;
46
47struct he_stat {
48 u64 period;
49 u64 period_sys;
50 u64 period_us;
51 u64 period_guest_sys;
52 u64 period_guest_us;
53 u64 weight;
54 u32 nr_events;
55};
56
57struct hist_entry_diff {
58 bool computed;
59
60 /* PERF_HPP__DELTA */
61 double period_ratio_delta;
62
63 /* PERF_HPP__RATIO */
64 double period_ratio;
65
66 /* HISTC_WEIGHTED_DIFF */
67 s64 wdiff;
68};
69
70/**
71 * struct hist_entry - histogram entry
72 *
73 * @row_offset - offset from the first callchain expanded to appear on screen
74 * @nr_rows - rows expanded in callchain, recalculated on folding/unfolding
75 */
76struct hist_entry {
77 struct rb_node rb_node_in;
78 struct rb_node rb_node;
79 union {
80 struct list_head node;
81 struct list_head head;
82 } pairs;
83 struct he_stat stat;
84 struct map_symbol ms;
85 struct thread *thread;
86 struct comm *comm;
87 u64 ip;
88 u64 transaction;
89 s32 cpu;
90
91 struct hist_entry_diff diff;
92
93 /* We are added by hists__add_dummy_entry. */
94 bool dummy;
95
96 /* XXX These two should move to some tree widget lib */
97 u16 row_offset;
98 u16 nr_rows;
99
100 bool init_have_children;
101 char level;
102 bool used;
103 u8 filtered;
104 char *srcline;
105 struct symbol *parent;
106 unsigned long position;
107 struct rb_root sorted_chain;
108 struct branch_info *branch_info;
109 struct hists *hists;
110 struct mem_info *mem_info;
111 struct callchain_root callchain[0]; /* must be last member */
112};
113
114static inline bool hist_entry__has_pairs(struct hist_entry *he)
115{
116 return !list_empty(&he->pairs.node);
117}
118
119static inline struct hist_entry *hist_entry__next_pair(struct hist_entry *he)
120{
121 if (hist_entry__has_pairs(he))
122 return list_entry(he->pairs.node.next, struct hist_entry, pairs.node);
123 return NULL;
124}
125
126static inline void hist_entry__add_pair(struct hist_entry *pair,
127 struct hist_entry *he)
128{
129 list_add_tail(&pair->pairs.node, &he->pairs.head);
130}
131
132enum sort_mode {
133 SORT_MODE__NORMAL,
134 SORT_MODE__BRANCH,
135 SORT_MODE__MEMORY,
136};
137
138enum sort_type {
139 /* common sort keys */
140 SORT_PID,
141 SORT_COMM,
142 SORT_DSO,
143 SORT_SYM,
144 SORT_PARENT,
145 SORT_CPU,
146 SORT_SRCLINE,
147 SORT_LOCAL_WEIGHT,
148 SORT_GLOBAL_WEIGHT,
149 SORT_TRANSACTION,
150
151 /* branch stack specific sort keys */
152 __SORT_BRANCH_STACK,
153 SORT_DSO_FROM = __SORT_BRANCH_STACK,
154 SORT_DSO_TO,
155 SORT_SYM_FROM,
156 SORT_SYM_TO,
157 SORT_MISPREDICT,
158 SORT_ABORT,
159 SORT_IN_TX,
160
161 /* memory mode specific sort keys */
162 __SORT_MEMORY_MODE,
163 SORT_MEM_DADDR_SYMBOL = __SORT_MEMORY_MODE,
164 SORT_MEM_DADDR_DSO,
165 SORT_MEM_LOCKED,
166 SORT_MEM_TLB,
167 SORT_MEM_LVL,
168 SORT_MEM_SNOOP,
169};
170
171/*
172 * configurable sorting bits
173 */
174
175struct sort_entry {
176 struct list_head list;
177
178 const char *se_header;
179
180 int64_t (*se_cmp)(struct hist_entry *, struct hist_entry *);
181 int64_t (*se_collapse)(struct hist_entry *, struct hist_entry *);
182 int (*se_snprintf)(struct hist_entry *he, char *bf, size_t size,
183 unsigned int width);
184 u8 se_width_idx;
185 bool elide;
186};
187
188extern struct sort_entry sort_thread;
189extern struct list_head hist_entry__sort_list;
190
191int setup_sorting(void);
192extern int sort_dimension__add(const char *);
193void sort__setup_elide(FILE *fp);
194
195int report_parse_ignore_callees_opt(const struct option *opt, const char *arg, int unset);
196
197#endif /* __PERF_SORT_H */