2 #ifndef __PERF_RBLIST_H 3 #define __PERF_RBLIST_H 5 #include <linux/rbtree.h> 27 struct rb_node *(*node_new)(
struct rblist *rlist,
const void *new_entry);
static bool rblist__empty(const struct rblist *rblist)
void rblist__remove_node(struct rblist *rblist, struct rb_node *rb_node)
int rblist__add_node(struct rblist *rblist, const void *new_entry)
struct rb_node * rblist__find(struct rblist *rblist, const void *entry)
int(* node_cmp)(struct rb_node *rbn, const void *entry)
void(* node_delete)(struct rblist *rblist, struct rb_node *rb_node)
void rblist__delete(struct rblist *rblist)
static int entry(u64 ip, struct unwind_info *ui)
static unsigned int rblist__nr_entries(const struct rblist *rblist)
struct rb_node * rblist__entry(const struct rblist *rblist, unsigned int idx)
struct rb_node * rblist__findnew(struct rblist *rblist, const void *entry)
void rblist__init(struct rblist *rblist)
void rblist__exit(struct rblist *rblist)