blob: 020b9ca1b47ed8c2d4f0db22a4c6918b5ca5e7b6 [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);
David Ahern813335b2013-10-08 21:26:52 -060027struct int_node *intlist__findnew(struct intlist *ilist, int i);
David Ahern70b40c42012-07-30 22:31:34 -060028
29static inline bool intlist__has_entry(struct intlist *ilist, int i)
30{
31 return intlist__find(ilist, i) != NULL;
32}
33
34static inline bool intlist__empty(const struct intlist *ilist)
35{
36 return rblist__empty(&ilist->rblist);
37}
38
39static inline unsigned int intlist__nr_entries(const struct intlist *ilist)
40{
41 return rblist__nr_entries(&ilist->rblist);
42}
43
44/* For intlist iteration */
45static inline struct int_node *intlist__first(struct intlist *ilist)
46{
47 struct rb_node *rn = rb_first(&ilist->rblist.entries);
48 return rn ? rb_entry(rn, struct int_node, rb_node) : NULL;
49}
50static inline struct int_node *intlist__next(struct int_node *in)
51{
52 struct rb_node *rn;
53 if (!in)
54 return NULL;
55 rn = rb_next(&in->rb_node);
56 return rn ? rb_entry(rn, struct int_node, rb_node) : NULL;
57}
58
59/**
Arnaldo Carvalho de Melo10daf4d2016-06-23 11:39:19 -030060 * intlist__for_each_entry - iterate over a intlist
David Ahern70b40c42012-07-30 22:31:34 -060061 * @pos: the &struct int_node to use as a loop cursor.
62 * @ilist: the &struct intlist for loop.
63 */
Arnaldo Carvalho de Melo10daf4d2016-06-23 11:39:19 -030064#define intlist__for_each_entry(pos, ilist) \
David Ahern70b40c42012-07-30 22:31:34 -060065 for (pos = intlist__first(ilist); pos; pos = intlist__next(pos))
66
67/**
Arnaldo Carvalho de Melo10daf4d2016-06-23 11:39:19 -030068 * intlist__for_each_entry_safe - iterate over a intlist safe against removal of
David Ahern70b40c42012-07-30 22:31:34 -060069 * int_node
70 * @pos: the &struct int_node to use as a loop cursor.
71 * @n: another &struct int_node to use as temporary storage.
72 * @ilist: the &struct intlist for loop.
73 */
Arnaldo Carvalho de Melo10daf4d2016-06-23 11:39:19 -030074#define intlist__for_each_entry_safe(pos, n, ilist) \
David Ahern70b40c42012-07-30 22:31:34 -060075 for (pos = intlist__first(ilist), n = intlist__next(pos); pos;\
76 pos = n, n = intlist__next(n))
77#endif /* __PERF_INTLIST_H */