1#ifndef __PERF_RBLIST_H
2#define __PERF_RBLIST_H
3
4#include <linux/rbtree.h>
5#include <stdbool.h>
6
7/*
8 * create node structs of the form:
9 * struct my_node {
10 *     struct rb_node rb_node;
11 *     ... my data ...
12 * };
13 *
14 * create list structs of the form:
15 * struct mylist {
16 *     struct rblist rblist;
17 *     ... my data ...
18 * };
19 */
20
21struct rblist {
22	struct rb_root entries;
23	unsigned int   nr_entries;
24
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);
28};
29
30void rblist__init(struct rblist *rblist);
31void rblist__delete(struct rblist *rblist);
32int rblist__add_node(struct rblist *rblist, const void *new_entry);
33void rblist__remove_node(struct rblist *rblist, struct rb_node *rb_node);
34struct rb_node *rblist__find(struct rblist *rblist, const void *entry);
35struct rb_node *rblist__entry(const struct rblist *rblist, unsigned int idx);
36
37static inline bool rblist__empty(const struct rblist *rblist)
38{
39	return rblist->nr_entries == 0;
40}
41
42static inline unsigned int rblist__nr_entries(const struct rblist *rblist)
43{
44	return rblist->nr_entries;
45}
46
47#endif /* __PERF_RBLIST_H */
48