strlist.c 4.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209
  1. /*
  2. * (c) 2009 Arnaldo Carvalho de Melo <acme@redhat.com>
  3. *
  4. * Licensed under the GPLv2.
  5. */
  6. #include "strlist.h"
  7. #include "util.h"
  8. #include <errno.h>
  9. #include <stdio.h>
  10. #include <stdlib.h>
  11. #include <string.h>
  12. #include <unistd.h>
  13. static
  14. struct rb_node *strlist__node_new(struct rblist *rblist, const void *entry)
  15. {
  16. const char *s = entry;
  17. struct rb_node *rc = NULL;
  18. struct strlist *strlist = container_of(rblist, struct strlist, rblist);
  19. struct str_node *snode = malloc(sizeof(*snode));
  20. if (snode != NULL) {
  21. if (strlist->dupstr) {
  22. s = strdup(s);
  23. if (s == NULL)
  24. goto out_delete;
  25. }
  26. snode->s = s;
  27. rc = &snode->rb_node;
  28. }
  29. return rc;
  30. out_delete:
  31. free(snode);
  32. return NULL;
  33. }
  34. static void str_node__delete(struct str_node *snode, bool dupstr)
  35. {
  36. if (dupstr)
  37. zfree((char **)&snode->s);
  38. free(snode);
  39. }
  40. static
  41. void strlist__node_delete(struct rblist *rblist, struct rb_node *rb_node)
  42. {
  43. struct strlist *slist = container_of(rblist, struct strlist, rblist);
  44. struct str_node *snode = container_of(rb_node, struct str_node, rb_node);
  45. str_node__delete(snode, slist->dupstr);
  46. }
  47. static int strlist__node_cmp(struct rb_node *rb_node, const void *entry)
  48. {
  49. const char *str = entry;
  50. struct str_node *snode = container_of(rb_node, struct str_node, rb_node);
  51. return strcmp(snode->s, str);
  52. }
  53. int strlist__add(struct strlist *slist, const char *new_entry)
  54. {
  55. return rblist__add_node(&slist->rblist, new_entry);
  56. }
  57. int strlist__load(struct strlist *slist, const char *filename)
  58. {
  59. char entry[1024];
  60. int err;
  61. FILE *fp = fopen(filename, "r");
  62. if (fp == NULL)
  63. return -errno;
  64. while (fgets(entry, sizeof(entry), fp) != NULL) {
  65. const size_t len = strlen(entry);
  66. if (len == 0)
  67. continue;
  68. entry[len - 1] = '\0';
  69. err = strlist__add(slist, entry);
  70. if (err != 0)
  71. goto out;
  72. }
  73. err = 0;
  74. out:
  75. fclose(fp);
  76. return err;
  77. }
  78. void strlist__remove(struct strlist *slist, struct str_node *snode)
  79. {
  80. rblist__remove_node(&slist->rblist, &snode->rb_node);
  81. }
  82. struct str_node *strlist__find(struct strlist *slist, const char *entry)
  83. {
  84. struct str_node *snode = NULL;
  85. struct rb_node *rb_node = rblist__find(&slist->rblist, entry);
  86. if (rb_node)
  87. snode = container_of(rb_node, struct str_node, rb_node);
  88. return snode;
  89. }
  90. static int strlist__parse_list_entry(struct strlist *slist, const char *s,
  91. const char *subst_dir)
  92. {
  93. int err;
  94. char *subst = NULL;
  95. if (strncmp(s, "file://", 7) == 0)
  96. return strlist__load(slist, s + 7);
  97. if (subst_dir) {
  98. err = -ENOMEM;
  99. if (asprintf(&subst, "%s/%s", subst_dir, s) < 0)
  100. goto out;
  101. if (access(subst, F_OK) == 0) {
  102. err = strlist__load(slist, subst);
  103. goto out;
  104. }
  105. if (slist->file_only) {
  106. err = -ENOENT;
  107. goto out;
  108. }
  109. }
  110. err = strlist__add(slist, s);
  111. out:
  112. free(subst);
  113. return err;
  114. }
  115. static int strlist__parse_list(struct strlist *slist, const char *s, const char *subst_dir)
  116. {
  117. char *sep;
  118. int err;
  119. while ((sep = strchr(s, ',')) != NULL) {
  120. *sep = '\0';
  121. err = strlist__parse_list_entry(slist, s, subst_dir);
  122. *sep = ',';
  123. if (err != 0)
  124. return err;
  125. s = sep + 1;
  126. }
  127. return *s ? strlist__parse_list_entry(slist, s, subst_dir) : 0;
  128. }
  129. struct strlist *strlist__new(const char *list, const struct strlist_config *config)
  130. {
  131. struct strlist *slist = malloc(sizeof(*slist));
  132. if (slist != NULL) {
  133. bool dupstr = true;
  134. bool file_only = false;
  135. const char *dirname = NULL;
  136. if (config) {
  137. dupstr = !config->dont_dupstr;
  138. dirname = config->dirname;
  139. file_only = config->file_only;
  140. }
  141. rblist__init(&slist->rblist);
  142. slist->rblist.node_cmp = strlist__node_cmp;
  143. slist->rblist.node_new = strlist__node_new;
  144. slist->rblist.node_delete = strlist__node_delete;
  145. slist->dupstr = dupstr;
  146. slist->file_only = file_only;
  147. if (list && strlist__parse_list(slist, list, dirname) != 0)
  148. goto out_error;
  149. }
  150. return slist;
  151. out_error:
  152. free(slist);
  153. return NULL;
  154. }
  155. void strlist__delete(struct strlist *slist)
  156. {
  157. if (slist != NULL)
  158. rblist__delete(&slist->rblist);
  159. }
  160. struct str_node *strlist__entry(const struct strlist *slist, unsigned int idx)
  161. {
  162. struct str_node *snode = NULL;
  163. struct rb_node *rb_node;
  164. rb_node = rblist__entry(&slist->rblist, idx);
  165. if (rb_node)
  166. snode = container_of(rb_node, struct str_node, rb_node);
  167. return snode;
  168. }