2 #ifndef __PERF_INTLIST_H 3 #define __PERF_INTLIST_H 5 #include <linux/rbtree.h> 65 #define intlist__for_each_entry(pos, ilist) \ 66 for (pos = intlist__first(ilist); pos; pos = intlist__next(pos)) 75 #define intlist__for_each_entry_safe(pos, n, ilist) \ 76 for (pos = intlist__first(ilist), n = intlist__next(pos); pos;\ 77 pos = n, n = intlist__next(n)) static bool rblist__empty(const struct rblist *rblist)
struct intlist * intlist__new(const char *slist)
static bool intlist__empty(const struct intlist *ilist)
struct int_node * intlist__entry(const struct intlist *ilist, unsigned int idx)
static struct int_node * intlist__first(struct intlist *ilist)
void intlist__remove(struct intlist *ilist, struct int_node *in)
static struct int_node * intlist__next(struct int_node *in)
static bool intlist__has_entry(struct intlist *ilist, int i)
static unsigned int rblist__nr_entries(const struct rblist *rblist)
int intlist__add(struct intlist *ilist, int i)
struct int_node * intlist__findnew(struct intlist *ilist, int i)
void intlist__delete(struct intlist *ilist)
static unsigned int intlist__nr_entries(const struct intlist *ilist)
struct int_node * intlist__find(struct intlist *ilist, int i)