Commit | Line | Data |
---|---|---|
8b40f521 JK |
1 | #ifndef __PERF_STRLIST_H |
2 | #define __PERF_STRLIST_H | |
25903407 | 3 | |
43cbcd8a | 4 | #include <linux/rbtree.h> |
25903407 ACM |
5 | #include <stdbool.h> |
6 | ||
ee8dd3ca DA |
7 | #include "rblist.h" |
8 | ||
25903407 ACM |
9 | struct str_node { |
10 | struct rb_node rb_node; | |
11 | const char *s; | |
12 | }; | |
13 | ||
14 | struct strlist { | |
ee8dd3ca | 15 | struct rblist rblist; |
27d0fd41 | 16 | bool dupstr; |
25903407 ACM |
17 | }; |
18 | ||
19 | struct strlist *strlist__new(bool dupstr, const char *slist); | |
d8639f06 | 20 | void strlist__delete(struct strlist *slist); |
25903407 | 21 | |
d8639f06 ACM |
22 | void strlist__remove(struct strlist *slist, struct str_node *sn); |
23 | int strlist__load(struct strlist *slist, const char *filename); | |
24 | int strlist__add(struct strlist *slist, const char *str); | |
25903407 | 25 | |
d8639f06 ACM |
26 | struct str_node *strlist__entry(const struct strlist *slist, unsigned int idx); |
27 | struct str_node *strlist__find(struct strlist *slist, const char *entry); | |
3e340590 | 28 | |
d8639f06 | 29 | static inline bool strlist__has_entry(struct strlist *slist, const char *entry) |
3e340590 | 30 | { |
d8639f06 | 31 | return strlist__find(slist, entry) != NULL; |
3e340590 | 32 | } |
25903407 | 33 | |
d8639f06 | 34 | static inline bool strlist__empty(const struct strlist *slist) |
25903407 | 35 | { |
d8639f06 | 36 | return rblist__empty(&slist->rblist); |
27d0fd41 ACM |
37 | } |
38 | ||
d8639f06 | 39 | static inline unsigned int strlist__nr_entries(const struct strlist *slist) |
27d0fd41 | 40 | { |
d8639f06 | 41 | return rblist__nr_entries(&slist->rblist); |
25903407 ACM |
42 | } |
43 | ||
abf5ef72 | 44 | /* For strlist iteration */ |
d8639f06 | 45 | static inline struct str_node *strlist__first(struct strlist *slist) |
abf5ef72 | 46 | { |
d8639f06 | 47 | struct rb_node *rn = rb_first(&slist->rblist.entries); |
abf5ef72 MH |
48 | return rn ? rb_entry(rn, struct str_node, rb_node) : NULL; |
49 | } | |
50 | static inline struct str_node *strlist__next(struct str_node *sn) | |
51 | { | |
52 | struct rb_node *rn; | |
53 | if (!sn) | |
54 | return NULL; | |
55 | rn = rb_next(&sn->rb_node); | |
56 | return rn ? rb_entry(rn, struct str_node, rb_node) : NULL; | |
57 | } | |
58 | ||
59 | /** | |
60 | * strlist_for_each - iterate over a strlist | |
61 | * @pos: the &struct str_node to use as a loop cursor. | |
d8639f06 | 62 | * @slist: the &struct strlist for loop. |
abf5ef72 | 63 | */ |
d8639f06 ACM |
64 | #define strlist__for_each(pos, slist) \ |
65 | for (pos = strlist__first(slist); pos; pos = strlist__next(pos)) | |
abf5ef72 MH |
66 | |
67 | /** | |
68 | * strlist_for_each_safe - iterate over a strlist safe against removal of | |
69 | * str_node | |
70 | * @pos: the &struct str_node to use as a loop cursor. | |
71 | * @n: another &struct str_node to use as temporary storage. | |
d8639f06 | 72 | * @slist: the &struct strlist for loop. |
abf5ef72 | 73 | */ |
d8639f06 ACM |
74 | #define strlist__for_each_safe(pos, n, slist) \ |
75 | for (pos = strlist__first(slist), n = strlist__next(pos); pos;\ | |
abf5ef72 MH |
76 | pos = n, n = strlist__next(n)) |
77 | ||
d8639f06 | 78 | int strlist__parse_list(struct strlist *slist, const char *s); |
8b40f521 | 79 | #endif /* __PERF_STRLIST_H */ |