[deliverable/linux.git] / tools / perf / util / intlist.h

#ifndef __PERF_INTLIST_H
#define __PERF_INTLIST_H

#include <linux/rbtree.h>
#include <stdbool.h>

#include "rblist.h"

struct int_node {
	struct rb_node rb_node;
	int i;
	void *priv;
};

struct intlist {
	struct rblist rblist;
};

struct intlist *intlist__new(const char *slist);
void intlist__delete(struct intlist *ilist);

void intlist__remove(struct intlist *ilist, struct int_node *in);
int intlist__add(struct intlist *ilist, int i);

struct int_node *intlist__entry(const struct intlist *ilist, unsigned int idx);
struct int_node *intlist__find(struct intlist *ilist, int i);
struct int_node *intlist__findnew(struct intlist *ilist, int i);

static inline bool intlist__has_entry(struct intlist *ilist, int i)
{
	return intlist__find(ilist, i) != NULL;
}

static inline bool intlist__empty(const struct intlist *ilist)
{
	return rblist__empty(&ilist->rblist);
}

static inline unsigned int intlist__nr_entries(const struct intlist *ilist)
{
	return rblist__nr_entries(&ilist->rblist);
}

/* For intlist iteration */
static inline struct int_node *intlist__first(struct intlist *ilist)
{
	struct rb_node *rn = rb_first(&ilist->rblist.entries);
	return rn ? rb_entry(rn, struct int_node, rb_node) : NULL;
}
static inline struct int_node *intlist__next(struct int_node *in)
{
	struct rb_node *rn;
	if (!in)
		return NULL;
	rn = rb_next(&in->rb_node);
	return rn ? rb_entry(rn, struct int_node, rb_node) : NULL;
}

/**
 * intlist__for_each_entry      - iterate over a intlist
 * @pos:	the &struct int_node to use as a loop cursor.
 * @ilist:	the &struct intlist for loop.
 */
#define intlist__for_each_entry(pos, ilist)	\
	for (pos = intlist__first(ilist); pos; pos = intlist__next(pos))

/**
 * intlist__for_each_entry_safe - iterate over a intlist safe against removal of
 *                         int_node
 * @pos:	the &struct int_node to use as a loop cursor.
 * @n:		another &struct int_node to use as temporary storage.
 * @ilist:	the &struct intlist for loop.
 */
#define intlist__for_each_entry_safe(pos, n, ilist)	\
	for (pos = intlist__first(ilist), n = intlist__next(pos); pos;\
	     pos = n, n = intlist__next(n))
#endif /* __PERF_INTLIST_H */
Commit	Line	Data
70b40c4a DA	1	#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
	9	struct int_node {
	10	struct rb_node rb_node;
	11	int i;
2969b129	12	void *priv;
70b40c4a DA	13	};
	14
	15	struct intlist {
	16	struct rblist rblist;
	17	};
	18
ffe0fb76	19	struct intlist intlist__new(const char slist);
70b40c4a DA	20	void intlist__delete(struct intlist *ilist);
	21
	22	void intlist__remove(struct intlist ilist, struct int_node in);
	23	int intlist__add(struct intlist *ilist, int i);
	24
	25	struct int_node intlist__entry(const struct intlist ilist, unsigned int idx);
	26	struct int_node intlist__find(struct intlist ilist, int i);
813335b8	27	struct int_node intlist__findnew(struct intlist ilist, int i);
70b40c4a DA	28
	29	static inline bool intlist__has_entry(struct intlist *ilist, int i)
	30	{
	31	return intlist__find(ilist, i) != NULL;
	32	}
	33
	34	static inline bool intlist__empty(const struct intlist *ilist)
	35	{
	36	return rblist__empty(&ilist->rblist);
	37	}
	38
	39	static inline unsigned int intlist__nr_entries(const struct intlist *ilist)
	40	{
	41	return rblist__nr_entries(&ilist->rblist);
	42	}
	43
	44	/* For intlist iteration */
	45	static 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	}
	50	static 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	/**
10daf4d0	60	* intlist__for_each_entry - iterate over a intlist
70b40c4a DA	61	* @pos: the &struct int_node to use as a loop cursor.
	62	* @ilist: the &struct intlist for loop.
	63	*/
10daf4d0	64	#define intlist__for_each_entry(pos, ilist) \
70b40c4a DA	65	for (pos = intlist__first(ilist); pos; pos = intlist__next(pos))
	66
	67	/**
10daf4d0	68	* intlist__for_each_entry_safe - iterate over a intlist safe against removal of
70b40c4a DA	69	* 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	*/
10daf4d0	74	#define intlist__for_each_entry_safe(pos, n, ilist) \
70b40c4a DA	75	for (pos = intlist__first(ilist), n = intlist__next(pos); pos;\
	76	pos = n, n = intlist__next(n))
	77	#endif /* __PERF_INTLIST_H */