strlist.h 2.5 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788
  1. /* SPDX-License-Identifier: GPL-2.0 */
  2. #ifndef __PERF_STRLIST_H
  3. #define __PERF_STRLIST_H
  4. #include <linux/rbtree.h>
  5. #include <stdbool.h>
  6. #include "rblist.h"
  7. struct str_node {
  8. struct rb_node rb_node;
  9. const char *s;
  10. };
  11. struct strlist {
  12. struct rblist rblist;
  13. bool file_only;
  14. };
  15. /*
  16. * @file_only: When dirname is present, only consider entries as filenames,
  17. * that should not be added to the list if dirname/entry is not
  18. * found
  19. */
  20. struct strlist_config {
  21. bool file_only;
  22. const char *dirname;
  23. };
  24. struct strlist *strlist__new(const char *slist, const struct strlist_config *config);
  25. void strlist__delete(struct strlist *slist);
  26. void strlist__remove(struct strlist *slist, struct str_node *sn);
  27. int strlist__load(struct strlist *slist, const char *filename);
  28. int strlist__add(struct strlist *slist, const char *str);
  29. struct str_node *strlist__entry(const struct strlist *slist, unsigned int idx);
  30. struct str_node *strlist__find(struct strlist *slist, const char *entry);
  31. static inline bool strlist__has_entry(struct strlist *slist, const char *entry)
  32. {
  33. return strlist__find(slist, entry) != NULL;
  34. }
  35. static inline bool strlist__empty(const struct strlist *slist)
  36. {
  37. return rblist__empty(&slist->rblist);
  38. }
  39. static inline unsigned int strlist__nr_entries(const struct strlist *slist)
  40. {
  41. return rblist__nr_entries(&slist->rblist);
  42. }
  43. /* For strlist iteration */
  44. static inline struct str_node *strlist__first(struct strlist *slist)
  45. {
  46. struct rb_node *rn = rb_first_cached(&slist->rblist.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. * strlist_for_each - iterate over a strlist
  59. * @pos: the &struct str_node to use as a loop cursor.
  60. * @slist: the &struct strlist for loop.
  61. */
  62. #define strlist__for_each_entry(pos, slist) \
  63. for (pos = strlist__first(slist); pos; pos = strlist__next(pos))
  64. /**
  65. * strlist_for_each_safe - iterate over a strlist safe against removal of
  66. * str_node
  67. * @pos: the &struct str_node to use as a loop cursor.
  68. * @n: another &struct str_node to use as temporary storage.
  69. * @slist: the &struct strlist for loop.
  70. */
  71. #define strlist__for_each_entry_safe(pos, n, slist) \
  72. for (pos = strlist__first(slist), n = strlist__next(pos); pos;\
  73. pos = n, n = strlist__next(n))
  74. #endif /* __PERF_STRLIST_H */