1 #ifndef __PERF_RBLIST_H
2 #define __PERF_RBLIST_H
4 #include <linux/rbtree.h>
8 * create node structs of the form:
10 * struct rb_node rb_node;
14 * create list structs of the form:
16 * struct rblist rblist;
22 struct rb_root entries
;
23 unsigned int nr_entries
;
25 int (*node_cmp
)(struct rb_node
*rbn
, const void *entry
);
26 struct rb_node
*(*node_new
)(struct rblist
*rlist
, const void *new_entry
);
27 void (*node_delete
)(struct rblist
*rblist
, struct rb_node
*rb_node
);
30 void rblist__init(struct rblist
*rblist
);
31 void rblist__delete(struct rblist
*rblist
);
32 int rblist__add_node(struct rblist
*rblist
, const void *new_entry
);
33 void rblist__remove_node(struct rblist
*rblist
, struct rb_node
*rb_node
);
34 struct rb_node
*rblist__find(struct rblist
*rblist
, const void *entry
);
35 struct rb_node
*rblist__findnew(struct rblist
*rblist
, const void *entry
);
36 struct rb_node
*rblist__entry(const struct rblist
*rblist
, unsigned int idx
);
38 static inline bool rblist__empty(const struct rblist
*rblist
)
40 return rblist
->nr_entries
== 0;
43 static inline unsigned int rblist__nr_entries(const struct rblist
*rblist
)
45 return rblist
->nr_entries
;
48 #endif /* __PERF_RBLIST_H */