mirror of
https://github.com/AuxXxilium/linux_dsm_epyc7002.git
synced 2024-12-26 18:55:26 +07:00
b24413180f
Many source files in the tree are missing licensing information, which makes it harder for compliance tools to determine the correct license. By default all files without license information are under the default license of the kernel, which is GPL version 2. Update the files which contain no license information with the 'GPL-2.0' SPDX license identifier. The SPDX identifier is a legally binding shorthand, which can be used instead of the full boiler plate text. This patch is based on work done by Thomas Gleixner and Kate Stewart and Philippe Ombredanne. How this work was done: Patches were generated and checked against linux-4.14-rc6 for a subset of the use cases: - file had no licensing information it it. - file was a */uapi/* one with no licensing information in it, - file was a */uapi/* one with existing licensing information, Further patches will be generated in subsequent months to fix up cases where non-standard license headers were used, and references to license had to be inferred by heuristics based on keywords. The analysis to determine which SPDX License Identifier to be applied to a file was done in a spreadsheet of side by side results from of the output of two independent scanners (ScanCode & Windriver) producing SPDX tag:value files created by Philippe Ombredanne. Philippe prepared the base worksheet, and did an initial spot review of a few 1000 files. The 4.13 kernel was the starting point of the analysis with 60,537 files assessed. Kate Stewart did a file by file comparison of the scanner results in the spreadsheet to determine which SPDX license identifier(s) to be applied to the file. She confirmed any determination that was not immediately clear with lawyers working with the Linux Foundation. Criteria used to select files for SPDX license identifier tagging was: - Files considered eligible had to be source code files. - Make and config files were included as candidates if they contained >5 lines of source - File already had some variant of a license header in it (even if <5 lines). All documentation files were explicitly excluded. The following heuristics were used to determine which SPDX license identifiers to apply. - when both scanners couldn't find any license traces, file was considered to have no license information in it, and the top level COPYING file license applied. For non */uapi/* files that summary was: SPDX license identifier # files ---------------------------------------------------|------- GPL-2.0 11139 and resulted in the first patch in this series. If that file was a */uapi/* path one, it was "GPL-2.0 WITH Linux-syscall-note" otherwise it was "GPL-2.0". Results of that was: SPDX license identifier # files ---------------------------------------------------|------- GPL-2.0 WITH Linux-syscall-note 930 and resulted in the second patch in this series. - if a file had some form of licensing information in it, and was one of the */uapi/* ones, it was denoted with the Linux-syscall-note if any GPL family license was found in the file or had no licensing in it (per prior point). Results summary: SPDX license identifier # files ---------------------------------------------------|------ GPL-2.0 WITH Linux-syscall-note 270 GPL-2.0+ WITH Linux-syscall-note 169 ((GPL-2.0 WITH Linux-syscall-note) OR BSD-2-Clause) 21 ((GPL-2.0 WITH Linux-syscall-note) OR BSD-3-Clause) 17 LGPL-2.1+ WITH Linux-syscall-note 15 GPL-1.0+ WITH Linux-syscall-note 14 ((GPL-2.0+ WITH Linux-syscall-note) OR BSD-3-Clause) 5 LGPL-2.0+ WITH Linux-syscall-note 4 LGPL-2.1 WITH Linux-syscall-note 3 ((GPL-2.0 WITH Linux-syscall-note) OR MIT) 3 ((GPL-2.0 WITH Linux-syscall-note) AND MIT) 1 and that resulted in the third patch in this series. - when the two scanners agreed on the detected license(s), that became the concluded license(s). - when there was disagreement between the two scanners (one detected a license but the other didn't, or they both detected different licenses) a manual inspection of the file occurred. - In most cases a manual inspection of the information in the file resulted in a clear resolution of the license that should apply (and which scanner probably needed to revisit its heuristics). - When it was not immediately clear, the license identifier was confirmed with lawyers working with the Linux Foundation. - If there was any question as to the appropriate license identifier, the file was flagged for further research and to be revisited later in time. In total, over 70 hours of logged manual review was done on the spreadsheet to determine the SPDX license identifiers to apply to the source files by Kate, Philippe, Thomas and, in some cases, confirmation by lawyers working with the Linux Foundation. Kate also obtained a third independent scan of the 4.13 code base from FOSSology, and compared selected files where the other two scanners disagreed against that SPDX file, to see if there was new insights. The Windriver scanner is based on an older version of FOSSology in part, so they are related. Thomas did random spot checks in about 500 files from the spreadsheets for the uapi headers and agreed with SPDX license identifier in the files he inspected. For the non-uapi files Thomas did random spot checks in about 15000 files. In initial set of patches against 4.14-rc6, 3 files were found to have copy/paste license identifier errors, and have been fixed to reflect the correct identifier. Additionally Philippe spent 10 hours this week doing a detailed manual inspection and review of the 12,461 patched files from the initial patch version early this week with: - a full scancode scan run, collecting the matched texts, detected license ids and scores - reviewing anything where there was a license detected (about 500+ files) to ensure that the applied SPDX license was correct - reviewing anything where there was no detection but the patch license was not GPL-2.0 WITH Linux-syscall-note to ensure that the applied SPDX license was correct This produced a worksheet with 20 files needing minor correction. This worksheet was then exported into 3 different .csv files for the different types of files to be modified. These .csv files were then reviewed by Greg. Thomas wrote a script to parse the csv files and add the proper SPDX tag to the file, in the format that the file expected. This script was further refined by Greg based on the output to detect more types of files automatically and to distinguish between header and source .c files (which need different comment types.) Finally Greg ran the script using the .csv files to generate the patches. Reviewed-by: Kate Stewart <kstewart@linuxfoundation.org> Reviewed-by: Philippe Ombredanne <pombredanne@nexb.com> Reviewed-by: Thomas Gleixner <tglx@linutronix.de> Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
507 lines
15 KiB
C
507 lines
15 KiB
C
/* SPDX-License-Identifier: GPL-2.0 */
|
|
#ifndef __PERF_HIST_H
|
|
#define __PERF_HIST_H
|
|
|
|
#include <linux/types.h>
|
|
#include <pthread.h>
|
|
#include "callchain.h"
|
|
#include "evsel.h"
|
|
#include "header.h"
|
|
#include "color.h"
|
|
#include "ui/progress.h"
|
|
|
|
struct hist_entry;
|
|
struct hist_entry_ops;
|
|
struct addr_location;
|
|
struct symbol;
|
|
|
|
enum hist_filter {
|
|
HIST_FILTER__DSO,
|
|
HIST_FILTER__THREAD,
|
|
HIST_FILTER__PARENT,
|
|
HIST_FILTER__SYMBOL,
|
|
HIST_FILTER__GUEST,
|
|
HIST_FILTER__HOST,
|
|
HIST_FILTER__SOCKET,
|
|
HIST_FILTER__C2C,
|
|
};
|
|
|
|
enum hist_column {
|
|
HISTC_SYMBOL,
|
|
HISTC_DSO,
|
|
HISTC_THREAD,
|
|
HISTC_COMM,
|
|
HISTC_CGROUP_ID,
|
|
HISTC_PARENT,
|
|
HISTC_CPU,
|
|
HISTC_SOCKET,
|
|
HISTC_SRCLINE,
|
|
HISTC_SRCFILE,
|
|
HISTC_MISPREDICT,
|
|
HISTC_IN_TX,
|
|
HISTC_ABORT,
|
|
HISTC_SYMBOL_FROM,
|
|
HISTC_SYMBOL_TO,
|
|
HISTC_DSO_FROM,
|
|
HISTC_DSO_TO,
|
|
HISTC_LOCAL_WEIGHT,
|
|
HISTC_GLOBAL_WEIGHT,
|
|
HISTC_MEM_DADDR_SYMBOL,
|
|
HISTC_MEM_DADDR_DSO,
|
|
HISTC_MEM_PHYS_DADDR,
|
|
HISTC_MEM_LOCKED,
|
|
HISTC_MEM_TLB,
|
|
HISTC_MEM_LVL,
|
|
HISTC_MEM_SNOOP,
|
|
HISTC_MEM_DCACHELINE,
|
|
HISTC_MEM_IADDR_SYMBOL,
|
|
HISTC_TRANSACTION,
|
|
HISTC_CYCLES,
|
|
HISTC_SRCLINE_FROM,
|
|
HISTC_SRCLINE_TO,
|
|
HISTC_TRACE,
|
|
HISTC_SYM_SIZE,
|
|
HISTC_NR_COLS, /* Last entry */
|
|
};
|
|
|
|
struct thread;
|
|
struct dso;
|
|
|
|
struct hists {
|
|
struct rb_root entries_in_array[2];
|
|
struct rb_root *entries_in;
|
|
struct rb_root entries;
|
|
struct rb_root entries_collapsed;
|
|
u64 nr_entries;
|
|
u64 nr_non_filtered_entries;
|
|
u64 callchain_period;
|
|
u64 callchain_non_filtered_period;
|
|
struct thread *thread_filter;
|
|
const struct dso *dso_filter;
|
|
const char *uid_filter_str;
|
|
const char *symbol_filter_str;
|
|
pthread_mutex_t lock;
|
|
struct events_stats stats;
|
|
u64 event_stream;
|
|
u16 col_len[HISTC_NR_COLS];
|
|
int socket_filter;
|
|
struct perf_hpp_list *hpp_list;
|
|
struct list_head hpp_formats;
|
|
int nr_hpp_node;
|
|
};
|
|
|
|
#define hists__has(__h, __f) (__h)->hpp_list->__f
|
|
|
|
struct hist_entry_iter;
|
|
|
|
struct hist_iter_ops {
|
|
int (*prepare_entry)(struct hist_entry_iter *, struct addr_location *);
|
|
int (*add_single_entry)(struct hist_entry_iter *, struct addr_location *);
|
|
int (*next_entry)(struct hist_entry_iter *, struct addr_location *);
|
|
int (*add_next_entry)(struct hist_entry_iter *, struct addr_location *);
|
|
int (*finish_entry)(struct hist_entry_iter *, struct addr_location *);
|
|
};
|
|
|
|
struct hist_entry_iter {
|
|
int total;
|
|
int curr;
|
|
|
|
bool hide_unresolved;
|
|
int max_stack;
|
|
|
|
struct perf_evsel *evsel;
|
|
struct perf_sample *sample;
|
|
struct hist_entry *he;
|
|
struct symbol *parent;
|
|
void *priv;
|
|
|
|
const struct hist_iter_ops *ops;
|
|
/* user-defined callback function (optional) */
|
|
int (*add_entry_cb)(struct hist_entry_iter *iter,
|
|
struct addr_location *al, bool single, void *arg);
|
|
};
|
|
|
|
extern const struct hist_iter_ops hist_iter_normal;
|
|
extern const struct hist_iter_ops hist_iter_branch;
|
|
extern const struct hist_iter_ops hist_iter_mem;
|
|
extern const struct hist_iter_ops hist_iter_cumulative;
|
|
|
|
struct hist_entry *hists__add_entry(struct hists *hists,
|
|
struct addr_location *al,
|
|
struct symbol *parent,
|
|
struct branch_info *bi,
|
|
struct mem_info *mi,
|
|
struct perf_sample *sample,
|
|
bool sample_self);
|
|
|
|
struct hist_entry *hists__add_entry_ops(struct hists *hists,
|
|
struct hist_entry_ops *ops,
|
|
struct addr_location *al,
|
|
struct symbol *sym_parent,
|
|
struct branch_info *bi,
|
|
struct mem_info *mi,
|
|
struct perf_sample *sample,
|
|
bool sample_self);
|
|
|
|
int hist_entry_iter__add(struct hist_entry_iter *iter, struct addr_location *al,
|
|
int max_stack_depth, void *arg);
|
|
|
|
struct perf_hpp;
|
|
struct perf_hpp_fmt;
|
|
|
|
int64_t hist_entry__cmp(struct hist_entry *left, struct hist_entry *right);
|
|
int64_t hist_entry__collapse(struct hist_entry *left, struct hist_entry *right);
|
|
int hist_entry__transaction_len(void);
|
|
int hist_entry__sort_snprintf(struct hist_entry *he, char *bf, size_t size,
|
|
struct hists *hists);
|
|
int hist_entry__snprintf_alignment(struct hist_entry *he, struct perf_hpp *hpp,
|
|
struct perf_hpp_fmt *fmt, int printed);
|
|
void hist_entry__delete(struct hist_entry *he);
|
|
|
|
typedef int (*hists__resort_cb_t)(struct hist_entry *he);
|
|
|
|
void perf_evsel__output_resort(struct perf_evsel *evsel, struct ui_progress *prog);
|
|
void hists__output_resort(struct hists *hists, struct ui_progress *prog);
|
|
void hists__output_resort_cb(struct hists *hists, struct ui_progress *prog,
|
|
hists__resort_cb_t cb);
|
|
int hists__collapse_resort(struct hists *hists, struct ui_progress *prog);
|
|
|
|
void hists__decay_entries(struct hists *hists, bool zap_user, bool zap_kernel);
|
|
void hists__delete_entries(struct hists *hists);
|
|
void hists__output_recalc_col_len(struct hists *hists, int max_rows);
|
|
|
|
u64 hists__total_period(struct hists *hists);
|
|
void hists__reset_stats(struct hists *hists);
|
|
void hists__inc_stats(struct hists *hists, struct hist_entry *h);
|
|
void hists__inc_nr_events(struct hists *hists, u32 type);
|
|
void hists__inc_nr_samples(struct hists *hists, bool filtered);
|
|
void events_stats__inc(struct events_stats *stats, u32 type);
|
|
size_t events_stats__fprintf(struct events_stats *stats, FILE *fp);
|
|
|
|
size_t hists__fprintf(struct hists *hists, bool show_header, int max_rows,
|
|
int max_cols, float min_pcnt, FILE *fp,
|
|
bool use_callchain);
|
|
size_t perf_evlist__fprintf_nr_events(struct perf_evlist *evlist, FILE *fp);
|
|
|
|
void hists__filter_by_dso(struct hists *hists);
|
|
void hists__filter_by_thread(struct hists *hists);
|
|
void hists__filter_by_symbol(struct hists *hists);
|
|
void hists__filter_by_socket(struct hists *hists);
|
|
|
|
static inline bool hists__has_filter(struct hists *hists)
|
|
{
|
|
return hists->thread_filter || hists->dso_filter ||
|
|
hists->symbol_filter_str || (hists->socket_filter > -1);
|
|
}
|
|
|
|
u16 hists__col_len(struct hists *hists, enum hist_column col);
|
|
void hists__set_col_len(struct hists *hists, enum hist_column col, u16 len);
|
|
bool hists__new_col_len(struct hists *hists, enum hist_column col, u16 len);
|
|
void hists__reset_col_len(struct hists *hists);
|
|
void hists__calc_col_len(struct hists *hists, struct hist_entry *he);
|
|
|
|
void hists__match(struct hists *leader, struct hists *other);
|
|
int hists__link(struct hists *leader, struct hists *other);
|
|
|
|
struct hists_evsel {
|
|
struct perf_evsel evsel;
|
|
struct hists hists;
|
|
};
|
|
|
|
static inline struct perf_evsel *hists_to_evsel(struct hists *hists)
|
|
{
|
|
struct hists_evsel *hevsel = container_of(hists, struct hists_evsel, hists);
|
|
return &hevsel->evsel;
|
|
}
|
|
|
|
static inline struct hists *evsel__hists(struct perf_evsel *evsel)
|
|
{
|
|
struct hists_evsel *hevsel = (struct hists_evsel *)evsel;
|
|
return &hevsel->hists;
|
|
}
|
|
|
|
int hists__init(void);
|
|
int __hists__init(struct hists *hists, struct perf_hpp_list *hpp_list);
|
|
|
|
struct rb_root *hists__get_rotate_entries_in(struct hists *hists);
|
|
|
|
struct perf_hpp {
|
|
char *buf;
|
|
size_t size;
|
|
const char *sep;
|
|
void *ptr;
|
|
};
|
|
|
|
struct perf_hpp_fmt {
|
|
const char *name;
|
|
int (*header)(struct perf_hpp_fmt *fmt, struct perf_hpp *hpp,
|
|
struct hists *hists, int line, int *span);
|
|
int (*width)(struct perf_hpp_fmt *fmt, struct perf_hpp *hpp,
|
|
struct hists *hists);
|
|
int (*color)(struct perf_hpp_fmt *fmt, struct perf_hpp *hpp,
|
|
struct hist_entry *he);
|
|
int (*entry)(struct perf_hpp_fmt *fmt, struct perf_hpp *hpp,
|
|
struct hist_entry *he);
|
|
int64_t (*cmp)(struct perf_hpp_fmt *fmt,
|
|
struct hist_entry *a, struct hist_entry *b);
|
|
int64_t (*collapse)(struct perf_hpp_fmt *fmt,
|
|
struct hist_entry *a, struct hist_entry *b);
|
|
int64_t (*sort)(struct perf_hpp_fmt *fmt,
|
|
struct hist_entry *a, struct hist_entry *b);
|
|
bool (*equal)(struct perf_hpp_fmt *a, struct perf_hpp_fmt *b);
|
|
void (*free)(struct perf_hpp_fmt *fmt);
|
|
|
|
struct list_head list;
|
|
struct list_head sort_list;
|
|
bool elide;
|
|
int len;
|
|
int user_len;
|
|
int idx;
|
|
int level;
|
|
};
|
|
|
|
struct perf_hpp_list {
|
|
struct list_head fields;
|
|
struct list_head sorts;
|
|
|
|
int nr_header_lines;
|
|
int need_collapse;
|
|
int parent;
|
|
int sym;
|
|
int dso;
|
|
int socket;
|
|
int thread;
|
|
int comm;
|
|
};
|
|
|
|
extern struct perf_hpp_list perf_hpp_list;
|
|
|
|
struct perf_hpp_list_node {
|
|
struct list_head list;
|
|
struct perf_hpp_list hpp;
|
|
int level;
|
|
bool skip;
|
|
};
|
|
|
|
void perf_hpp_list__column_register(struct perf_hpp_list *list,
|
|
struct perf_hpp_fmt *format);
|
|
void perf_hpp_list__register_sort_field(struct perf_hpp_list *list,
|
|
struct perf_hpp_fmt *format);
|
|
void perf_hpp_list__prepend_sort_field(struct perf_hpp_list *list,
|
|
struct perf_hpp_fmt *format);
|
|
|
|
static inline void perf_hpp__column_register(struct perf_hpp_fmt *format)
|
|
{
|
|
perf_hpp_list__column_register(&perf_hpp_list, format);
|
|
}
|
|
|
|
static inline void perf_hpp__register_sort_field(struct perf_hpp_fmt *format)
|
|
{
|
|
perf_hpp_list__register_sort_field(&perf_hpp_list, format);
|
|
}
|
|
|
|
static inline void perf_hpp__prepend_sort_field(struct perf_hpp_fmt *format)
|
|
{
|
|
perf_hpp_list__prepend_sort_field(&perf_hpp_list, format);
|
|
}
|
|
|
|
#define perf_hpp_list__for_each_format(_list, format) \
|
|
list_for_each_entry(format, &(_list)->fields, list)
|
|
|
|
#define perf_hpp_list__for_each_format_safe(_list, format, tmp) \
|
|
list_for_each_entry_safe(format, tmp, &(_list)->fields, list)
|
|
|
|
#define perf_hpp_list__for_each_sort_list(_list, format) \
|
|
list_for_each_entry(format, &(_list)->sorts, sort_list)
|
|
|
|
#define perf_hpp_list__for_each_sort_list_safe(_list, format, tmp) \
|
|
list_for_each_entry_safe(format, tmp, &(_list)->sorts, sort_list)
|
|
|
|
#define hists__for_each_format(hists, format) \
|
|
perf_hpp_list__for_each_format((hists)->hpp_list, fmt)
|
|
|
|
#define hists__for_each_sort_list(hists, format) \
|
|
perf_hpp_list__for_each_sort_list((hists)->hpp_list, fmt)
|
|
|
|
extern struct perf_hpp_fmt perf_hpp__format[];
|
|
|
|
enum {
|
|
/* Matches perf_hpp__format array. */
|
|
PERF_HPP__OVERHEAD,
|
|
PERF_HPP__OVERHEAD_SYS,
|
|
PERF_HPP__OVERHEAD_US,
|
|
PERF_HPP__OVERHEAD_GUEST_SYS,
|
|
PERF_HPP__OVERHEAD_GUEST_US,
|
|
PERF_HPP__OVERHEAD_ACC,
|
|
PERF_HPP__SAMPLES,
|
|
PERF_HPP__PERIOD,
|
|
|
|
PERF_HPP__MAX_INDEX
|
|
};
|
|
|
|
void perf_hpp__init(void);
|
|
void perf_hpp__column_unregister(struct perf_hpp_fmt *format);
|
|
void perf_hpp__cancel_cumulate(void);
|
|
void perf_hpp__setup_output_field(struct perf_hpp_list *list);
|
|
void perf_hpp__reset_output_field(struct perf_hpp_list *list);
|
|
void perf_hpp__append_sort_keys(struct perf_hpp_list *list);
|
|
int perf_hpp__setup_hists_formats(struct perf_hpp_list *list,
|
|
struct perf_evlist *evlist);
|
|
|
|
|
|
bool perf_hpp__is_sort_entry(struct perf_hpp_fmt *format);
|
|
bool perf_hpp__is_dynamic_entry(struct perf_hpp_fmt *format);
|
|
bool perf_hpp__defined_dynamic_entry(struct perf_hpp_fmt *fmt, struct hists *hists);
|
|
bool perf_hpp__is_trace_entry(struct perf_hpp_fmt *fmt);
|
|
bool perf_hpp__is_srcline_entry(struct perf_hpp_fmt *fmt);
|
|
bool perf_hpp__is_srcfile_entry(struct perf_hpp_fmt *fmt);
|
|
bool perf_hpp__is_thread_entry(struct perf_hpp_fmt *fmt);
|
|
bool perf_hpp__is_comm_entry(struct perf_hpp_fmt *fmt);
|
|
bool perf_hpp__is_dso_entry(struct perf_hpp_fmt *fmt);
|
|
bool perf_hpp__is_sym_entry(struct perf_hpp_fmt *fmt);
|
|
|
|
struct perf_hpp_fmt *perf_hpp_fmt__dup(struct perf_hpp_fmt *fmt);
|
|
|
|
int hist_entry__filter(struct hist_entry *he, int type, const void *arg);
|
|
|
|
static inline bool perf_hpp__should_skip(struct perf_hpp_fmt *format,
|
|
struct hists *hists)
|
|
{
|
|
if (format->elide)
|
|
return true;
|
|
|
|
if (perf_hpp__is_dynamic_entry(format) &&
|
|
!perf_hpp__defined_dynamic_entry(format, hists))
|
|
return true;
|
|
|
|
return false;
|
|
}
|
|
|
|
void perf_hpp__reset_width(struct perf_hpp_fmt *fmt, struct hists *hists);
|
|
void perf_hpp__reset_sort_width(struct perf_hpp_fmt *fmt, struct hists *hists);
|
|
void perf_hpp__set_user_width(const char *width_list_str);
|
|
void hists__reset_column_width(struct hists *hists);
|
|
|
|
typedef u64 (*hpp_field_fn)(struct hist_entry *he);
|
|
typedef int (*hpp_callback_fn)(struct perf_hpp *hpp, bool front);
|
|
typedef int (*hpp_snprint_fn)(struct perf_hpp *hpp, const char *fmt, ...);
|
|
|
|
int hpp__fmt(struct perf_hpp_fmt *fmt, struct perf_hpp *hpp,
|
|
struct hist_entry *he, hpp_field_fn get_field,
|
|
const char *fmtstr, hpp_snprint_fn print_fn, bool fmt_percent);
|
|
int hpp__fmt_acc(struct perf_hpp_fmt *fmt, struct perf_hpp *hpp,
|
|
struct hist_entry *he, hpp_field_fn get_field,
|
|
const char *fmtstr, hpp_snprint_fn print_fn, bool fmt_percent);
|
|
|
|
static inline void advance_hpp(struct perf_hpp *hpp, int inc)
|
|
{
|
|
hpp->buf += inc;
|
|
hpp->size -= inc;
|
|
}
|
|
|
|
static inline size_t perf_hpp__use_color(void)
|
|
{
|
|
return !symbol_conf.field_sep;
|
|
}
|
|
|
|
static inline size_t perf_hpp__color_overhead(void)
|
|
{
|
|
return perf_hpp__use_color() ?
|
|
(COLOR_MAXLEN + sizeof(PERF_COLOR_RESET)) * PERF_HPP__MAX_INDEX
|
|
: 0;
|
|
}
|
|
|
|
struct perf_evlist;
|
|
|
|
struct hist_browser_timer {
|
|
void (*timer)(void *arg);
|
|
void *arg;
|
|
int refresh;
|
|
};
|
|
|
|
#ifdef HAVE_SLANG_SUPPORT
|
|
#include "../ui/keysyms.h"
|
|
int map_symbol__tui_annotate(struct map_symbol *ms, struct perf_evsel *evsel,
|
|
struct hist_browser_timer *hbt);
|
|
|
|
int hist_entry__tui_annotate(struct hist_entry *he, struct perf_evsel *evsel,
|
|
struct hist_browser_timer *hbt);
|
|
|
|
int perf_evlist__tui_browse_hists(struct perf_evlist *evlist, const char *help,
|
|
struct hist_browser_timer *hbt,
|
|
float min_pcnt,
|
|
struct perf_env *env);
|
|
int script_browse(const char *script_opt);
|
|
#else
|
|
static inline
|
|
int perf_evlist__tui_browse_hists(struct perf_evlist *evlist __maybe_unused,
|
|
const char *help __maybe_unused,
|
|
struct hist_browser_timer *hbt __maybe_unused,
|
|
float min_pcnt __maybe_unused,
|
|
struct perf_env *env __maybe_unused)
|
|
{
|
|
return 0;
|
|
}
|
|
static inline int map_symbol__tui_annotate(struct map_symbol *ms __maybe_unused,
|
|
struct perf_evsel *evsel __maybe_unused,
|
|
struct hist_browser_timer *hbt __maybe_unused)
|
|
{
|
|
return 0;
|
|
}
|
|
|
|
static inline int hist_entry__tui_annotate(struct hist_entry *he __maybe_unused,
|
|
struct perf_evsel *evsel __maybe_unused,
|
|
struct hist_browser_timer *hbt __maybe_unused)
|
|
{
|
|
return 0;
|
|
}
|
|
|
|
static inline int script_browse(const char *script_opt __maybe_unused)
|
|
{
|
|
return 0;
|
|
}
|
|
|
|
#define K_LEFT -1000
|
|
#define K_RIGHT -2000
|
|
#define K_SWITCH_INPUT_DATA -3000
|
|
#endif
|
|
|
|
unsigned int hists__sort_list_width(struct hists *hists);
|
|
unsigned int hists__overhead_width(struct hists *hists);
|
|
|
|
void hist__account_cycles(struct branch_stack *bs, struct addr_location *al,
|
|
struct perf_sample *sample, bool nonany_branch_mode);
|
|
|
|
struct option;
|
|
int parse_filter_percentage(const struct option *opt, const char *arg, int unset);
|
|
int perf_hist_config(const char *var, const char *value);
|
|
|
|
void perf_hpp_list__init(struct perf_hpp_list *list);
|
|
|
|
enum hierarchy_move_dir {
|
|
HMD_NORMAL,
|
|
HMD_FORCE_SIBLING,
|
|
HMD_FORCE_CHILD,
|
|
};
|
|
|
|
struct rb_node *rb_hierarchy_last(struct rb_node *node);
|
|
struct rb_node *__rb_hierarchy_next(struct rb_node *node,
|
|
enum hierarchy_move_dir hmd);
|
|
struct rb_node *rb_hierarchy_prev(struct rb_node *node);
|
|
|
|
static inline struct rb_node *rb_hierarchy_next(struct rb_node *node)
|
|
{
|
|
return __rb_hierarchy_next(node, HMD_NORMAL);
|
|
}
|
|
|
|
#define HIERARCHY_INDENT 3
|
|
|
|
bool hist_entry__has_hierarchy_children(struct hist_entry *he, float limit);
|
|
int hpp_color_scnprintf(struct perf_hpp *hpp, const char *fmt, ...);
|
|
int __hpp__slsmg_color_printf(struct perf_hpp *hpp, const char *fmt, ...);
|
|
int __hist_entry__snprintf(struct hist_entry *he, struct perf_hpp *hpp,
|
|
struct perf_hpp_list *hpp_list);
|
|
int hists__fprintf_headers(struct hists *hists, FILE *fp);
|
|
|
|
#endif /* __PERF_HIST_H */
|