mirror of
https://github.com/adulau/aha.git
synced 2024-12-28 11:46:19 +00:00
8cb76d99d7
We plan to display the callchains depending on some user-configurable parameters. To gather the callchains stats from the recorded stream in a fast way, this patch introduces an ad hoc radix tree adapted for callchains and also a rbtree to sort these callchains once we have gathered every events from the stream. Signed-off-by: Frederic Weisbecker <fweisbec@gmail.com> Cc: Peter Zijlstra <a.p.zijlstra@chello.nl> Cc: Mike Galbraith <efault@gmx.de> Cc: Paul Mackerras <paulus@samba.org> LKML-Reference: <1246026481-8314-2-git-send-email-fweisbec@gmail.com> Signed-off-by: Ingo Molnar <mingo@elte.hu>
33 lines
711 B
C
33 lines
711 B
C
#ifndef __PERF_CALLCHAIN_H
|
|
#define __PERF_CALLCHAIN_H
|
|
|
|
#include "../perf.h"
|
|
#include "list.h"
|
|
#include "rbtree.h"
|
|
|
|
|
|
struct callchain_node {
|
|
struct callchain_node *parent;
|
|
struct list_head brothers;
|
|
struct list_head children;
|
|
struct list_head val;
|
|
struct rb_node rb_node;
|
|
int val_nr;
|
|
int hit;
|
|
};
|
|
|
|
struct callchain_list {
|
|
unsigned long ip;
|
|
struct list_head list;
|
|
};
|
|
|
|
static inline void callchain_init(struct callchain_node *node)
|
|
{
|
|
INIT_LIST_HEAD(&node->brothers);
|
|
INIT_LIST_HEAD(&node->children);
|
|
INIT_LIST_HEAD(&node->val);
|
|
}
|
|
|
|
void append_chain(struct callchain_node *root, struct ip_callchain *chain);
|
|
void sort_chain_to_rbtree(struct rb_root *rb_root, struct callchain_node *node);
|
|
#endif
|