1 #ifndef __PERF_INTLIST_H
2 #define __PERF_INTLIST_H
4 #include <linux/rbtree.h>
10 struct rb_node rb_node;
19 struct intlist *intlist__new(const char *slist);
20 void intlist__delete(struct intlist *ilist);
22 void intlist__remove(struct intlist *ilist, struct int_node *in);
23 int intlist__add(struct intlist *ilist, int i);
25 struct int_node *intlist__entry(const struct intlist *ilist, unsigned int idx);
26 struct int_node *intlist__find(struct intlist *ilist, int i);
28 static inline bool intlist__has_entry(struct intlist *ilist, int i)
30 return intlist__find(ilist, i) != NULL;
33 static inline bool intlist__empty(const struct intlist *ilist)
35 return rblist__empty(&ilist->rblist);
38 static inline unsigned int intlist__nr_entries(const struct intlist *ilist)
40 return rblist__nr_entries(&ilist->rblist);
43 /* For intlist iteration */
44 static inline struct int_node *intlist__first(struct intlist *ilist)
46 struct rb_node *rn = rb_first(&ilist->rblist.entries);
47 return rn ? rb_entry(rn, struct int_node, rb_node) : NULL;
49 static inline struct int_node *intlist__next(struct int_node *in)
54 rn = rb_next(&in->rb_node);
55 return rn ? rb_entry(rn, struct int_node, rb_node) : NULL;
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.
63 #define intlist__for_each(pos, ilist) \
64 for (pos = intlist__first(ilist); pos; pos = intlist__next(pos))
67 * intlist_for_each_safe - iterate over a intlist safe against removal of
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.
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 */