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 | ||
4a77e218 ACM |
19 | struct strlist_config { |
20 | bool dont_dupstr; | |
8ff9daf3 | 21 | const char *dirname; |
4a77e218 ACM |
22 | }; |
23 | ||
24 | struct strlist *strlist__new(const char *slist, const struct strlist_config *config); | |
d8639f06 | 25 | void strlist__delete(struct strlist *slist); |
25903407 | 26 | |
d8639f06 ACM |
27 | void strlist__remove(struct strlist *slist, struct str_node *sn); |
28 | int strlist__load(struct strlist *slist, const char *filename); | |
29 | int strlist__add(struct strlist *slist, const char *str); | |
25903407 | 30 | |
d8639f06 ACM |
31 | struct str_node *strlist__entry(const struct strlist *slist, unsigned int idx); |
32 | struct str_node *strlist__find(struct strlist *slist, const char *entry); | |
3e340590 | 33 | |
d8639f06 | 34 | static inline bool strlist__has_entry(struct strlist *slist, const char *entry) |
3e340590 | 35 | { |
d8639f06 | 36 | return strlist__find(slist, entry) != NULL; |
3e340590 | 37 | } |
25903407 | 38 | |
d8639f06 | 39 | static inline bool strlist__empty(const struct strlist *slist) |
25903407 | 40 | { |
d8639f06 | 41 | return rblist__empty(&slist->rblist); |
27d0fd41 ACM |
42 | } |
43 | ||
d8639f06 | 44 | static inline unsigned int strlist__nr_entries(const struct strlist *slist) |
27d0fd41 | 45 | { |
d8639f06 | 46 | return rblist__nr_entries(&slist->rblist); |
25903407 ACM |
47 | } |
48 | ||
abf5ef72 | 49 | /* For strlist iteration */ |
d8639f06 | 50 | static inline struct str_node *strlist__first(struct strlist *slist) |
abf5ef72 | 51 | { |
d8639f06 | 52 | struct rb_node *rn = rb_first(&slist->rblist.entries); |
abf5ef72 MH |
53 | return rn ? rb_entry(rn, struct str_node, rb_node) : NULL; |
54 | } | |
55 | static inline struct str_node *strlist__next(struct str_node *sn) | |
56 | { | |
57 | struct rb_node *rn; | |
58 | if (!sn) | |
59 | return NULL; | |
60 | rn = rb_next(&sn->rb_node); | |
61 | return rn ? rb_entry(rn, struct str_node, rb_node) : NULL; | |
62 | } | |
63 | ||
64 | /** | |
65 | * strlist_for_each - iterate over a strlist | |
66 | * @pos: the &struct str_node to use as a loop cursor. | |
d8639f06 | 67 | * @slist: the &struct strlist for loop. |
abf5ef72 | 68 | */ |
d8639f06 ACM |
69 | #define strlist__for_each(pos, slist) \ |
70 | for (pos = strlist__first(slist); pos; pos = strlist__next(pos)) | |
abf5ef72 MH |
71 | |
72 | /** | |
73 | * strlist_for_each_safe - iterate over a strlist safe against removal of | |
74 | * str_node | |
75 | * @pos: the &struct str_node to use as a loop cursor. | |
76 | * @n: another &struct str_node to use as temporary storage. | |
d8639f06 | 77 | * @slist: the &struct strlist for loop. |
abf5ef72 | 78 | */ |
d8639f06 ACM |
79 | #define strlist__for_each_safe(pos, n, slist) \ |
80 | for (pos = strlist__first(slist), n = strlist__next(pos); pos;\ | |
abf5ef72 | 81 | pos = n, n = strlist__next(n)) |
8b40f521 | 82 | #endif /* __PERF_STRLIST_H */ |