strlist.c 3.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184
  1. /*
  2. * (c) 2009 Arnaldo Carvalho de Melo <acme@redhat.com>
  3. *
  4. * Licensed under the GPLv2.
  5. */
  6. #include "strlist.h"
  7. #include <errno.h>
  8. #include <stdio.h>
  9. #include <stdlib.h>
  10. #include <string.h>
  11. static struct str_node *str_node__new(const char *s, bool dupstr)
  12. {
  13. struct str_node *self = malloc(sizeof(*self));
  14. if (self != NULL) {
  15. if (dupstr) {
  16. s = strdup(s);
  17. if (s == NULL)
  18. goto out_delete;
  19. }
  20. self->s = s;
  21. }
  22. return self;
  23. out_delete:
  24. free(self);
  25. return NULL;
  26. }
  27. static void str_node__delete(struct str_node *self, bool dupstr)
  28. {
  29. if (dupstr)
  30. free((void *)self->s);
  31. free(self);
  32. }
  33. int strlist__add(struct strlist *self, const char *new_entry)
  34. {
  35. struct rb_node **p = &self->entries.rb_node;
  36. struct rb_node *parent = NULL;
  37. struct str_node *sn;
  38. while (*p != NULL) {
  39. int rc;
  40. parent = *p;
  41. sn = rb_entry(parent, struct str_node, rb_node);
  42. rc = strcmp(sn->s, new_entry);
  43. if (rc > 0)
  44. p = &(*p)->rb_left;
  45. else if (rc < 0)
  46. p = &(*p)->rb_right;
  47. else
  48. return -EEXIST;
  49. }
  50. sn = str_node__new(new_entry, self->dupstr);
  51. if (sn == NULL)
  52. return -ENOMEM;
  53. rb_link_node(&sn->rb_node, parent, p);
  54. rb_insert_color(&sn->rb_node, &self->entries);
  55. return 0;
  56. }
  57. int strlist__load(struct strlist *self, 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(self, 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 *self, struct str_node *sn)
  79. {
  80. rb_erase(&sn->rb_node, &self->entries);
  81. str_node__delete(sn, self->dupstr);
  82. }
  83. bool strlist__has_entry(struct strlist *self, const char *entry)
  84. {
  85. struct rb_node **p = &self->entries.rb_node;
  86. struct rb_node *parent = NULL;
  87. while (*p != NULL) {
  88. struct str_node *sn;
  89. int rc;
  90. parent = *p;
  91. sn = rb_entry(parent, struct str_node, rb_node);
  92. rc = strcmp(sn->s, entry);
  93. if (rc > 0)
  94. p = &(*p)->rb_left;
  95. else if (rc < 0)
  96. p = &(*p)->rb_right;
  97. else
  98. return true;
  99. }
  100. return false;
  101. }
  102. static int strlist__parse_list_entry(struct strlist *self, const char *s)
  103. {
  104. if (strncmp(s, "file://", 7) == 0)
  105. return strlist__load(self, s + 7);
  106. return strlist__add(self, s);
  107. }
  108. int strlist__parse_list(struct strlist *self, const char *s)
  109. {
  110. char *sep;
  111. int err;
  112. while ((sep = strchr(s, ',')) != NULL) {
  113. *sep = '\0';
  114. err = strlist__parse_list_entry(self, s);
  115. *sep = ',';
  116. if (err != 0)
  117. return err;
  118. s = sep + 1;
  119. }
  120. return *s ? strlist__parse_list_entry(self, s) : 0;
  121. }
  122. struct strlist *strlist__new(bool dupstr, const char *slist)
  123. {
  124. struct strlist *self = malloc(sizeof(*self));
  125. if (self != NULL) {
  126. self->entries = RB_ROOT;
  127. self->dupstr = dupstr;
  128. if (slist && strlist__parse_list(self, slist) != 0)
  129. goto out_error;
  130. }
  131. return self;
  132. out_error:
  133. free(self);
  134. return NULL;
  135. }
  136. void strlist__delete(struct strlist *self)
  137. {
  138. if (self != NULL) {
  139. struct str_node *pos;
  140. struct rb_node *next = rb_first(&self->entries);
  141. while (next) {
  142. pos = rb_entry(next, struct str_node, rb_node);
  143. next = rb_next(&pos->rb_node);
  144. strlist__remove(self, pos);
  145. }
  146. self->entries = RB_ROOT;
  147. free(self);
  148. }
  149. }