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

 
 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__findnew(struct rblist *rblist, const void *entry);
36struct rb_node *rblist__entry(const struct rblist *rblist, unsigned int idx);
37
38static inline bool rblist__empty(const struct rblist *rblist)
39{
40	return rblist->nr_entries == 0;
41}
42
43static inline unsigned int rblist__nr_entries(const struct rblist *rblist)
44{
45	return rblist->nr_entries;
46}
47
48#endif /* __PERF_RBLIST_H */