Root/
1 | #ifndef __PERF_STRLIST_H |
2 | #define __PERF_STRLIST_H |
3 | |
4 | #include <linux/rbtree.h> |
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; |
14 | unsigned int nr_entries; |
15 | bool dupstr; |
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 | |
25 | struct str_node *strlist__entry(const struct strlist *self, unsigned int idx); |
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 | } |
32 | |
33 | static inline bool strlist__empty(const struct strlist *self) |
34 | { |
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; |
41 | } |
42 | |
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 | |
77 | int strlist__parse_list(struct strlist *self, const char *s); |
78 | #endif /* __PERF_STRLIST_H */ |
79 |
Branches:
ben-wpan
ben-wpan-stefan
javiroman/ks7010
jz-2.6.34
jz-2.6.34-rc5
jz-2.6.34-rc6
jz-2.6.34-rc7
jz-2.6.35
jz-2.6.36
jz-2.6.37
jz-2.6.38
jz-2.6.39
jz-3.0
jz-3.1
jz-3.11
jz-3.12
jz-3.13
jz-3.15
jz-3.16
jz-3.18-dt
jz-3.2
jz-3.3
jz-3.4
jz-3.5
jz-3.6
jz-3.6-rc2-pwm
jz-3.9
jz-3.9-clk
jz-3.9-rc8
jz47xx
jz47xx-2.6.38
master
Tags:
od-2011-09-04
od-2011-09-18
v2.6.34-rc5
v2.6.34-rc6
v2.6.34-rc7
v3.9