linux/tools/perf/util/sort.h
<<
>>
Prefs
   1#ifndef __PERF_SORT_H
   2#define __PERF_SORT_H
   3#include "../builtin.h"
   4
   5#include <regex.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 "values.h"
  15
  16#include "../perf.h"
  17#include "debug.h"
  18#include "header.h"
  19
  20#include <subcmd/parse-options.h>
  21#include "parse-events.h"
  22#include "hist.h"
  23#include "srcline.h"
  24
  25struct thread;
  26
  27extern regex_t parent_regex;
  28extern const char *sort_order;
  29extern const char *field_order;
  30extern const char default_parent_pattern[];
  31extern const char *parent_pattern;
  32extern const char *default_sort_order;
  33extern regex_t ignore_callees_regex;
  34extern int have_ignore_callees;
  35extern enum sort_mode sort__mode;
  36extern struct sort_entry sort_comm;
  37extern struct sort_entry sort_dso;
  38extern struct sort_entry sort_sym;
  39extern struct sort_entry sort_parent;
  40extern struct sort_entry sort_dso_from;
  41extern struct sort_entry sort_dso_to;
  42extern struct sort_entry sort_sym_from;
  43extern struct sort_entry sort_sym_to;
  44extern struct sort_entry sort_srcline;
  45extern enum sort_type sort__first_dimension;
  46extern const char default_mem_sort_order[];
  47
  48struct he_stat {
  49        u64                     period;
  50        u64                     period_sys;
  51        u64                     period_us;
  52        u64                     period_guest_sys;
  53        u64                     period_guest_us;
  54        u64                     weight;
  55        u32                     nr_events;
  56};
  57
  58struct namespace_id {
  59        u64                     dev;
  60        u64                     ino;
  61};
  62
  63struct hist_entry_diff {
  64        bool    computed;
  65        union {
  66                /* PERF_HPP__DELTA */
  67                double  period_ratio_delta;
  68
  69                /* PERF_HPP__RATIO */
  70                double  period_ratio;
  71
  72                /* HISTC_WEIGHTED_DIFF */
  73                s64     wdiff;
  74        };
  75};
  76
  77struct hist_entry_ops {
  78        void    *(*new)(size_t size);
  79        void    (*free)(void *ptr);
  80};
  81
  82/**
  83 * struct hist_entry - histogram entry
  84 *
  85 * @row_offset - offset from the first callchain expanded to appear on screen
  86 * @nr_rows - rows expanded in callchain, recalculated on folding/unfolding
  87 */
  88struct hist_entry {
  89        struct rb_node          rb_node_in;
  90        struct rb_node          rb_node;
  91        union {
  92                struct list_head node;
  93                struct list_head head;
  94        } pairs;
  95        struct he_stat          stat;
  96        struct he_stat          *stat_acc;
  97        struct map_symbol       ms;
  98        struct thread           *thread;
  99        struct comm             *comm;
 100        struct namespace_id     cgroup_id;
 101        u64                     ip;
 102        u64                     transaction;
 103        s32                     socket;
 104        s32                     cpu;
 105        u8                      cpumode;
 106        u8                      depth;
 107
 108        /* We are added by hists__add_dummy_entry. */
 109        bool                    dummy;
 110        bool                    leaf;
 111
 112        char                    level;
 113        u8                      filtered;
 114        union {
 115                /*
 116                 * Since perf diff only supports the stdio output, TUI
 117                 * fields are only accessed from perf report (or perf
 118                 * top).  So make it a union to reduce memory usage.
 119                 */
 120                struct hist_entry_diff  diff;
 121                struct /* for TUI */ {
 122                        u16     row_offset;
 123                        u16     nr_rows;
 124                        bool    init_have_children;
 125                        bool    unfolded;
 126                        bool    has_children;
 127                        bool    has_no_entry;
 128                };
 129        };
 130        char                    *srcline;
 131        char                    *srcfile;
 132        struct inline_node      *inline_node;
 133        struct symbol           *parent;
 134        struct branch_info      *branch_info;
 135        struct hists            *hists;
 136        struct mem_info         *mem_info;
 137        void                    *raw_data;
 138        u32                     raw_size;
 139        void                    *trace_output;
 140        struct perf_hpp_list    *hpp_list;
 141        struct hist_entry       *parent_he;
 142        struct hist_entry_ops   *ops;
 143        union {
 144                /* this is for hierarchical entry structure */
 145                struct {
 146                        struct rb_root  hroot_in;
 147                        struct rb_root  hroot_out;
 148                };                              /* non-leaf entries */
 149                struct rb_root  sorted_chain;   /* leaf entry has callchains */
 150        };
 151        struct callchain_root   callchain[0]; /* must be last member */
 152};
 153
 154static inline bool hist_entry__has_pairs(struct hist_entry *he)
 155{
 156        return !list_empty(&he->pairs.node);
 157}
 158
 159static inline struct hist_entry *hist_entry__next_pair(struct hist_entry *he)
 160{
 161        if (hist_entry__has_pairs(he))
 162                return list_entry(he->pairs.node.next, struct hist_entry, pairs.node);
 163        return NULL;
 164}
 165
 166static inline void hist_entry__add_pair(struct hist_entry *pair,
 167                                        struct hist_entry *he)
 168{
 169        list_add_tail(&pair->pairs.node, &he->pairs.head);
 170}
 171
 172static inline float hist_entry__get_percent_limit(struct hist_entry *he)
 173{
 174        u64 period = he->stat.period;
 175        u64 total_period = hists__total_period(he->hists);
 176
 177        if (unlikely(total_period == 0))
 178                return 0;
 179
 180        if (symbol_conf.cumulate_callchain)
 181                period = he->stat_acc->period;
 182
 183        return period * 100.0 / total_period;
 184}
 185
 186static inline u64 cl_address(u64 address)
 187{
 188        /* return the cacheline of the address */
 189        return (address & ~(cacheline_size - 1));
 190}
 191
 192static inline u64 cl_offset(u64 address)
 193{
 194        /* return the cacheline of the address */
 195        return (address & (cacheline_size - 1));
 196}
 197
 198enum sort_mode {
 199        SORT_MODE__NORMAL,
 200        SORT_MODE__BRANCH,
 201        SORT_MODE__MEMORY,
 202        SORT_MODE__TOP,
 203        SORT_MODE__DIFF,
 204        SORT_MODE__TRACEPOINT,
 205};
 206
 207enum sort_type {
 208        /* common sort keys */
 209        SORT_PID,
 210        SORT_COMM,
 211        SORT_DSO,
 212        SORT_SYM,
 213        SORT_PARENT,
 214        SORT_CPU,
 215        SORT_SOCKET,
 216        SORT_SRCLINE,
 217        SORT_SRCFILE,
 218        SORT_LOCAL_WEIGHT,
 219        SORT_GLOBAL_WEIGHT,
 220        SORT_TRANSACTION,
 221        SORT_TRACE,
 222        SORT_SYM_SIZE,
 223        SORT_CGROUP_ID,
 224
 225        /* branch stack specific sort keys */
 226        __SORT_BRANCH_STACK,
 227        SORT_DSO_FROM = __SORT_BRANCH_STACK,
 228        SORT_DSO_TO,
 229        SORT_SYM_FROM,
 230        SORT_SYM_TO,
 231        SORT_MISPREDICT,
 232        SORT_ABORT,
 233        SORT_IN_TX,
 234        SORT_CYCLES,
 235        SORT_SRCLINE_FROM,
 236        SORT_SRCLINE_TO,
 237
 238        /* memory mode specific sort keys */
 239        __SORT_MEMORY_MODE,
 240        SORT_MEM_DADDR_SYMBOL = __SORT_MEMORY_MODE,
 241        SORT_MEM_DADDR_DSO,
 242        SORT_MEM_LOCKED,
 243        SORT_MEM_TLB,
 244        SORT_MEM_LVL,
 245        SORT_MEM_SNOOP,
 246        SORT_MEM_DCACHELINE,
 247        SORT_MEM_IADDR_SYMBOL,
 248};
 249
 250/*
 251 * configurable sorting bits
 252 */
 253
 254struct sort_entry {
 255        const char *se_header;
 256
 257        int64_t (*se_cmp)(struct hist_entry *, struct hist_entry *);
 258        int64_t (*se_collapse)(struct hist_entry *, struct hist_entry *);
 259        int64_t (*se_sort)(struct hist_entry *, struct hist_entry *);
 260        int     (*se_snprintf)(struct hist_entry *he, char *bf, size_t size,
 261                               unsigned int width);
 262        int     (*se_filter)(struct hist_entry *he, int type, const void *arg);
 263        u8      se_width_idx;
 264};
 265
 266extern struct sort_entry sort_thread;
 267extern struct list_head hist_entry__sort_list;
 268
 269struct perf_evlist;
 270struct pevent;
 271int setup_sorting(struct perf_evlist *evlist);
 272int setup_output_field(void);
 273void reset_output_field(void);
 274void sort__setup_elide(FILE *fp);
 275void perf_hpp__set_elide(int idx, bool elide);
 276
 277int report_parse_ignore_callees_opt(const struct option *opt, const char *arg, int unset);
 278
 279bool is_strict_order(const char *order);
 280
 281int hpp_dimension__add_output(unsigned col);
 282void reset_dimensions(void);
 283int sort_dimension__add(struct perf_hpp_list *list, const char *tok,
 284                        struct perf_evlist *evlist,
 285                        int level);
 286int output_field_add(struct perf_hpp_list *list, char *tok);
 287int64_t
 288sort__iaddr_cmp(struct hist_entry *left, struct hist_entry *right);
 289int64_t
 290sort__daddr_cmp(struct hist_entry *left, struct hist_entry *right);
 291int64_t
 292sort__dcacheline_cmp(struct hist_entry *left, struct hist_entry *right);
 293char *hist_entry__get_srcline(struct hist_entry *he);
 294#endif  /* __PERF_SORT_H */
 295