LXR linux/tools/perf/util/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#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 int sort__has_sym;
  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 enum sort_type sort__first_dimension;
  45
  46struct he_stat {
  47        u64                     period;
  48        u64                     period_sys;
  49        u64                     period_us;
  50        u64                     period_guest_sys;
  51        u64                     period_guest_us;
  52        u64                     weight;
  53        u32                     nr_events;
  54};
  55
  56struct hist_entry_diff {
  57        bool    computed;
  58
  59        /* PERF_HPP__DELTA */
  60        double  period_ratio_delta;
  61
  62        /* PERF_HPP__RATIO */
  63        double  period_ratio;
  64
  65        /* HISTC_WEIGHTED_DIFF */
  66        s64     wdiff;
  67};
  68
  69/**
  70 * struct hist_entry - histogram entry
  71 *
  72 * @row_offset - offset from the first callchain expanded to appear on screen
  73 * @nr_rows - rows expanded in callchain, recalculated on folding/unfolding
  74 */
  75struct hist_entry {
  76        struct rb_node          rb_node_in;
  77        struct rb_node          rb_node;
  78        union {
  79                struct list_head node;
  80                struct list_head head;
  81        } pairs;
  82        struct he_stat          stat;
  83        struct map_symbol       ms;
  84        struct thread           *thread;
  85        u64                     ip;
  86        s32                     cpu;
  87
  88        struct hist_entry_diff  diff;
  89
  90        /* XXX These two should move to some tree widget lib */
  91        u16                     row_offset;
  92        u16                     nr_rows;
  93
  94        bool                    init_have_children;
  95        char                    level;
  96        bool                    used;
  97        u8                      filtered;
  98        char                    *srcline;
  99        struct symbol           *parent;
 100        unsigned long           position;
 101        struct rb_root          sorted_chain;
 102        struct branch_info      *branch_info;
 103        struct hists            *hists;
 104        struct mem_info         *mem_info;
 105        struct callchain_root   callchain[0]; /* must be last member */
 106};
 107
 108static inline bool hist_entry__has_pairs(struct hist_entry *he)
 109{
 110        return !list_empty(&he->pairs.node);
 111}
 112
 113static inline struct hist_entry *hist_entry__next_pair(struct hist_entry *he)
 114{
 115        if (hist_entry__has_pairs(he))
 116                return list_entry(he->pairs.node.next, struct hist_entry, pairs.node);
 117        return NULL;
 118}
 119
 120static inline void hist_entry__add_pair(struct hist_entry *pair,
 121                                        struct hist_entry *he)
 122{
 123        list_add_tail(&pair->pairs.node, &he->pairs.head);
 124}
 125
 126enum sort_mode {
 127        SORT_MODE__NORMAL,
 128        SORT_MODE__BRANCH,
 129        SORT_MODE__MEMORY,
 130};
 131
 132enum sort_type {
 133        /* common sort keys */
 134        SORT_PID,
 135        SORT_COMM,
 136        SORT_DSO,
 137        SORT_SYM,
 138        SORT_PARENT,
 139        SORT_CPU,
 140        SORT_SRCLINE,
 141
 142        /* branch stack specific sort keys */
 143        __SORT_BRANCH_STACK,
 144        SORT_DSO_FROM = __SORT_BRANCH_STACK,
 145        SORT_DSO_TO,
 146        SORT_SYM_FROM,
 147        SORT_SYM_TO,
 148        SORT_MISPREDICT,
 149
 150        /* memory mode specific sort keys */
 151        __SORT_MEMORY_MODE,
 152        SORT_LOCAL_WEIGHT = __SORT_MEMORY_MODE,
 153        SORT_GLOBAL_WEIGHT,
 154        SORT_MEM_DADDR_SYMBOL,
 155        SORT_MEM_DADDR_DSO,
 156        SORT_MEM_LOCKED,
 157        SORT_MEM_TLB,
 158        SORT_MEM_LVL,
 159        SORT_MEM_SNOOP,
 160};
 161
 162/*
 163 * configurable sorting bits
 164 */
 165
 166struct sort_entry {
 167        struct list_head list;
 168
 169        const char *se_header;
 170
 171        int64_t (*se_cmp)(struct hist_entry *, struct hist_entry *);
 172        int64_t (*se_collapse)(struct hist_entry *, struct hist_entry *);
 173        int     (*se_snprintf)(struct hist_entry *self, char *bf, size_t size,
 174                               unsigned int width);
 175        u8      se_width_idx;
 176        bool    elide;
 177};
 178
 179extern struct sort_entry sort_thread;
 180extern struct list_head hist_entry__sort_list;
 181
 182int setup_sorting(void);
 183extern int sort_dimension__add(const char *);
 184void sort__setup_elide(FILE *fp);
 185
 186#endif  /* __PERF_SORT_H */
 187