]> git.proxmox.com Git - mirror_ubuntu-artful-kernel.git/blame - tools/perf/util/sort.h
perf tools: Get current comm instead of last one
[mirror_ubuntu-artful-kernel.git] / tools / perf / util / sort.h
CommitLineData
dd68ada2
JK
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;
edb7c60e
ACM
28extern const char *sort_order;
29extern const char default_parent_pattern[];
30extern const char *parent_pattern;
31extern const char default_sort_order[];
b21484f1
GP
32extern regex_t ignore_callees_regex;
33extern int have_ignore_callees;
dd68ada2
JK
34extern int sort__need_collapse;
35extern int sort__has_parent;
1af55640 36extern int sort__has_sym;
55369fc1 37extern enum sort_mode sort__mode;
dd68ada2
JK
38extern struct sort_entry sort_comm;
39extern struct sort_entry sort_dso;
40extern struct sort_entry sort_sym;
41extern struct sort_entry sort_parent;
a68c2c58
SE
42extern struct sort_entry sort_dso_from;
43extern struct sort_entry sort_dso_to;
44extern struct sort_entry sort_sym_from;
45extern struct sort_entry sort_sym_to;
a4fb581b 46extern enum sort_type sort__first_dimension;
dd68ada2 47
b24c28f7
NK
48struct he_stat {
49 u64 period;
50 u64 period_sys;
51 u64 period_us;
52 u64 period_guest_sys;
53 u64 period_guest_us;
05484298 54 u64 weight;
b24c28f7
NK
55 u32 nr_events;
56};
57
96c47f19
JO
58struct hist_entry_diff {
59 bool computed;
60
96c47f19
JO
61 /* PERF_HPP__DELTA */
62 double period_ratio_delta;
63
64 /* PERF_HPP__RATIO */
65 double period_ratio;
81d5f958
JO
66
67 /* HISTC_WEIGHTED_DIFF */
68 s64 wdiff;
96c47f19
JO
69};
70
0f0cbf7a
ACM
71/**
72 * struct hist_entry - histogram entry
73 *
74 * @row_offset - offset from the first callchain expanded to appear on screen
75 * @nr_rows - rows expanded in callchain, recalculated on folding/unfolding
76 */
dd68ada2 77struct hist_entry {
1980c2eb 78 struct rb_node rb_node_in;
dd68ada2 79 struct rb_node rb_node;
b821c732
ACM
80 union {
81 struct list_head node;
82 struct list_head head;
83 } pairs;
b24c28f7 84 struct he_stat stat;
59fd5306 85 struct map_symbol ms;
a5e29aca 86 struct thread *thread;
4dfced35 87 struct comm *comm;
dd68ada2 88 u64 ip;
475eeab9 89 u64 transaction;
f60f3593 90 s32 cpu;
0f0cbf7a 91
96c47f19
JO
92 struct hist_entry_diff diff;
93
e0af43d2
JO
94 /* We are added by hists__add_dummy_entry. */
95 bool dummy;
96
0f0cbf7a
ACM
97 /* XXX These two should move to some tree widget lib */
98 u16 row_offset;
99 u16 nr_rows;
100
101 bool init_have_children;
dd68ada2 102 char level;
df71d95f 103 bool used;
a5e29aca 104 u8 filtered;
409a8be6 105 char *srcline;
83753190 106 struct symbol *parent;
dd464345 107 unsigned long position;
b821c732 108 struct rb_root sorted_chain;
b5387528 109 struct branch_info *branch_info;
ae359f19 110 struct hists *hists;
98a3b32c
SE
111 struct mem_info *mem_info;
112 struct callchain_root callchain[0]; /* must be last member */
dd68ada2
JK
113};
114
b821c732
ACM
115static inline bool hist_entry__has_pairs(struct hist_entry *he)
116{
117 return !list_empty(&he->pairs.node);
118}
119
120static inline struct hist_entry *hist_entry__next_pair(struct hist_entry *he)
121{
122 if (hist_entry__has_pairs(he))
123 return list_entry(he->pairs.node.next, struct hist_entry, pairs.node);
124 return NULL;
125}
126
4d23322a
JO
127static inline void hist_entry__add_pair(struct hist_entry *pair,
128 struct hist_entry *he)
b821c732 129{
4d23322a 130 list_add_tail(&pair->pairs.node, &he->pairs.head);
b821c732
ACM
131}
132
55369fc1
NK
133enum sort_mode {
134 SORT_MODE__NORMAL,
135 SORT_MODE__BRANCH,
136 SORT_MODE__MEMORY,
137};
138
a4fb581b 139enum sort_type {
fc5871ed 140 /* common sort keys */
a4fb581b
FW
141 SORT_PID,
142 SORT_COMM,
143 SORT_DSO,
144 SORT_SYM,
f60f3593
AS
145 SORT_PARENT,
146 SORT_CPU,
fc5871ed 147 SORT_SRCLINE,
f9ea55d0
AK
148 SORT_LOCAL_WEIGHT,
149 SORT_GLOBAL_WEIGHT,
475eeab9 150 SORT_TRANSACTION,
fc5871ed
NK
151
152 /* branch stack specific sort keys */
153 __SORT_BRANCH_STACK,
154 SORT_DSO_FROM = __SORT_BRANCH_STACK,
b5387528
RAV
155 SORT_DSO_TO,
156 SORT_SYM_FROM,
157 SORT_SYM_TO,
158 SORT_MISPREDICT,
f5d05bce
AK
159 SORT_ABORT,
160 SORT_IN_TX,
afab87b9
NK
161
162 /* memory mode specific sort keys */
163 __SORT_MEMORY_MODE,
f9ea55d0 164 SORT_MEM_DADDR_SYMBOL = __SORT_MEMORY_MODE,
afab87b9
NK
165 SORT_MEM_DADDR_DSO,
166 SORT_MEM_LOCKED,
167 SORT_MEM_TLB,
168 SORT_MEM_LVL,
169 SORT_MEM_SNOOP,
a4fb581b
FW
170};
171
dd68ada2
JK
172/*
173 * configurable sorting bits
174 */
175
176struct sort_entry {
177 struct list_head list;
178
fcd14984 179 const char *se_header;
dd68ada2 180
fcd14984
FW
181 int64_t (*se_cmp)(struct hist_entry *, struct hist_entry *);
182 int64_t (*se_collapse)(struct hist_entry *, struct hist_entry *);
183 int (*se_snprintf)(struct hist_entry *self, char *bf, size_t size,
184 unsigned int width);
8a6c5b26 185 u8 se_width_idx;
dd68ada2
JK
186 bool elide;
187};
188
189extern struct sort_entry sort_thread;
190extern struct list_head hist_entry__sort_list;
191
55309985 192int setup_sorting(void);
dd68ada2 193extern int sort_dimension__add(const char *);
08e71542 194void sort__setup_elide(FILE *fp);
dd68ada2 195
b21484f1
GP
196int report_parse_ignore_callees_opt(const struct option *opt, const char *arg, int unset);
197
dd68ada2 198#endif /* __PERF_SORT_H */