callchain_node
static size_t callchain__fprintf_folded(FILE *fp, struct callchain_node *node)
struct callchain_node *chain;
chain = rb_entry(rb_node, struct callchain_node, rb_node);
struct callchain_node *cnode;
cnode = rb_entry(rb_first(root), struct callchain_node, rb_node);
struct callchain_node *child = rb_entry(node, struct callchain_node, rb_node);
struct callchain_node *child = rb_entry(node, struct callchain_node, rb_node);
static int callchain_node__count_rows_rb_tree(struct callchain_node *node)
struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);
static int callchain_node__count_flat_rows(struct callchain_node *node)
static int callchain_node__count_folded_rows(struct callchain_node *node __maybe_unused)
static int callchain_node__count_rows(struct callchain_node *node)
struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);
static void callchain_node__init_have_children_rb_tree(struct callchain_node *node)
struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);
static void callchain_node__init_have_children(struct callchain_node *node,
struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);
static int callchain_node__set_folding_rb_tree(struct callchain_node *node, bool unfold)
struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);
static int callchain_node__set_folding(struct callchain_node *node, bool unfold)
struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);
struct callchain_node *node,
struct callchain_node *child;
child = rb_entry(node, struct callchain_node, rb_node);
struct callchain_node *child = rb_entry(node, struct callchain_node, rb_node);
struct callchain_node *node;
node = rb_entry(nd, struct callchain_node, rb_node);
struct callchain_node *node;
node = rb_entry(nd, struct callchain_node, rb_node);
struct callchain_node *node;
node = rb_entry(nd, struct callchain_node, rb_node);
struct callchain_node *child = NULL;
child = rb_entry(node, struct callchain_node, rb_node);
struct callchain_node rem_node = {
struct callchain_node *cnode;
cnode = rb_entry(node, struct callchain_node, rb_node);
struct callchain_node *cnode;
cnode = rb_entry(node, struct callchain_node, rb_node);
static size_t __callchain__fprintf_flat(FILE *fp, struct callchain_node *node,
struct callchain_node *chain;
chain = rb_entry(rb_node, struct callchain_node, rb_node);
static size_t __callchain__fprintf_folded(FILE *fp, struct callchain_node *node)
struct callchain_node *chain;
chain = rb_entry(rb_node, struct callchain_node, rb_node);
static size_t ipchain__fprintf_graph(FILE *fp, struct callchain_node *node,
struct callchain_node *dst, struct callchain_node *src)
struct callchain_node *child;
child = container_of(n, struct callchain_node, rb_node_in);
char *callchain_node__scnprintf_value(struct callchain_node *node,
int callchain_node__fprintf_value(struct callchain_node *node,
static void callchain_counts_value(struct callchain_node *node,
static int callchain_node_branch_counts_cumul(struct callchain_node *node,
struct callchain_node *child;
child = rb_entry(n, struct callchain_node, rb_node_in);
static void free_callchain_node(struct callchain_node *node)
struct callchain_node *child;
child = container_of(n, struct callchain_node, rb_node_in);
static u64 decay_callchain_node(struct callchain_node *node)
struct callchain_node *child;
child = container_of(n, struct callchain_node, rb_node_in);
int callchain_node__make_parent_list(struct callchain_node *node)
struct callchain_node *parent = node->parent;
bool callchain_cnode_matched(struct callchain_node *base_cnode,
struct callchain_node *pair_cnode)
struct callchain_node *node;
node = rb_entry(rb_node, struct callchain_node, rb_node);
s64 callchain_avg_cycles(struct callchain_node *cnode)
rb_insert_callchain(struct rb_root *root, struct callchain_node *chain,
struct callchain_node *rnode;
rnode = rb_entry(parent, struct callchain_node, rb_node);
__sort_chain_flat(struct rb_root *rb_root, struct callchain_node *node,
struct callchain_node *child;
child = rb_entry(n, struct callchain_node, rb_node_in);
static void __sort_chain_graph_abs(struct callchain_node *node,
struct callchain_node *child;
child = rb_entry(n, struct callchain_node, rb_node_in);
static void __sort_chain_graph_rel(struct callchain_node *node,
struct callchain_node *child;
child = rb_entry(n, struct callchain_node, rb_node_in);
static struct callchain_node *
create_child(struct callchain_node *parent, bool inherit_children)
struct callchain_node *new;
struct callchain_node *child;
child = rb_entry(n, struct callchain_node, rb_node_in);
fill_node(struct callchain_node *node, struct callchain_cursor *cursor)
static struct callchain_node *
add_child(struct callchain_node *parent,
struct callchain_node *new;
split_add_child(struct callchain_node *parent,
struct callchain_node *new;
struct callchain_node *first;
first = rb_entry(p, struct callchain_node, rb_node_in);
append_chain(struct callchain_node *root,
append_chain_children(struct callchain_node *root,
struct callchain_node *rnode;
rnode = rb_entry(parent, struct callchain_node, rb_node_in);
append_chain(struct callchain_node *root,
static inline u64 callchain_cumul_hits(struct callchain_node *node)
static inline unsigned callchain_cumul_counts(struct callchain_node *node)
char *callchain_node__scnprintf_value(struct callchain_node *node,
int callchain_node__fprintf_value(struct callchain_node *node,
int callchain_node__make_parent_list(struct callchain_node *node);
bool callchain_cnode_matched(struct callchain_node *base_cnode,
struct callchain_node *pair_cnode);
s64 callchain_avg_cycles(struct callchain_node *cnode);
struct callchain_node *parent;
struct callchain_node node;
struct callchain_node *cnode;
cnode = rb_entry(rb_node, struct callchain_node, rb_node);
struct callchain_node *base_cnode = base_stream->cnode;
struct callchain_node *pair_cnode = base_stream->pair_cnode;
struct callchain_node *cnode = stream->cnode;
struct callchain_node *cnode)
struct callchain_node *cnode;
struct callchain_node *pair_cnode;
struct callchain_node;