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