blob: 0eb00ac39e011e53137dffdbaca39768644c0b3d [file] [log] [blame]
David Ahern70b40c42012-07-30 22:31:34 -06001#ifndef __PERF_INTLIST_H
2#define __PERF_INTLIST_H
3
4#include <linux/rbtree.h>
5#include <stdbool.h>
6
7#include "rblist.h"
8
9struct int_node {
10 struct rb_node rb_node;
11 int i;
David Ahern2969b122013-09-28 13:13:02 -060012 void *priv;
David Ahern70b40c42012-07-30 22:31:34 -060013};
14
15struct intlist {
16 struct rblist rblist;
17};
18
Arnaldo Carvalho de Meloffe0fb72013-01-24 16:17:27 -030019struct intlist *intlist__new(const char *slist);
David Ahern70b40c42012-07-30 22:31:34 -060020void intlist__delete(struct intlist *ilist);
21
22void intlist__remove(struct intlist *ilist, struct int_node *in);
23int intlist__add(struct intlist *ilist, int i);
24
25struct int_node *intlist__entry(const struct intlist *ilist, unsigned int idx);
26struct int_node *intlist__find(struct intlist *ilist, int i);
27
28static inline bool intlist__has_entry(struct intlist *ilist, int i)
29{
30 return intlist__find(ilist, i) != NULL;
31}
32
33static inline bool intlist__empty(const struct intlist *ilist)
34{
35 return rblist__empty(&ilist->rblist);
36}
37
38static inline unsigned int intlist__nr_entries(const struct intlist *ilist)
39{
40 return rblist__nr_entries(&ilist->rblist);
41}
42
43/* For intlist iteration */
44static inline struct int_node *intlist__first(struct intlist *ilist)
45{
46 struct rb_node *rn = rb_first(&ilist->rblist.entries);
47 return rn ? rb_entry(rn, struct int_node, rb_node) : NULL;
48}
49static inline struct int_node *intlist__next(struct int_node *in)
50{
51 struct rb_node *rn;
52 if (!in)
53 return NULL;
54 rn = rb_next(&in->rb_node);
55 return rn ? rb_entry(rn, struct int_node, rb_node) : NULL;
56}
57
58/**
59 * intlist_for_each - iterate over a intlist
60 * @pos: the &struct int_node to use as a loop cursor.
61 * @ilist: the &struct intlist for loop.
62 */
63#define intlist__for_each(pos, ilist) \
64 for (pos = intlist__first(ilist); pos; pos = intlist__next(pos))
65
66/**
67 * intlist_for_each_safe - iterate over a intlist safe against removal of
68 * int_node
69 * @pos: the &struct int_node to use as a loop cursor.
70 * @n: another &struct int_node to use as temporary storage.
71 * @ilist: the &struct intlist for loop.
72 */
73#define intlist__for_each_safe(pos, n, ilist) \
74 for (pos = intlist__first(ilist), n = intlist__next(pos); pos;\
75 pos = n, n = intlist__next(n))
76#endif /* __PERF_INTLIST_H */