strlist.h 2.2 KB

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