ini.c 4.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244
  1. /** @file ini.c
  2. * @brief Functions for working with INI files.
  3. */
  4. #include <stdlib.h>
  5. #include <stdio.h>
  6. #include <string.h>
  7. #include <assert.h>
  8. #include <ctype.h>
  9. #include "private.h"
  10. #include "faux/faux.h"
  11. #include "faux/str.h"
  12. #include "faux/ini.h"
  13. faux_ini_t *faux_ini_new(void) {
  14. faux_ini_t *ini;
  15. ini = faux_zmalloc(sizeof(*ini));
  16. if (!ini)
  17. return NULL;
  18. // Init
  19. ini->list = faux_list_new(faux_pair_compare, faux_pair_free);
  20. return ini;
  21. }
  22. void faux_ini_free(faux_ini_t *ini) {
  23. assert(ini);
  24. if (!ini)
  25. return;
  26. faux_list_free(ini->list);
  27. faux_free(ini);
  28. }
  29. const faux_pair_t *faux_ini_set(faux_ini_t *ini, const char *name, const char *value) {
  30. faux_pair_t *pair = NULL;
  31. faux_list_node_t *node = NULL;
  32. faux_pair_t *found_pair = NULL;
  33. assert(ini);
  34. assert(name);
  35. if (!ini || !name)
  36. return NULL;
  37. pair = faux_pair_new(name, value);
  38. assert(pair);
  39. if (!pair)
  40. return NULL;
  41. // NULL 'value' means: remove entry from list
  42. if (!value) {
  43. node = faux_list_find_node(ini->list, faux_pair_compare, pair);
  44. faux_pair_free(pair);
  45. if (node)
  46. faux_list_del(ini->list, node);
  47. return NULL;
  48. }
  49. // Try to add new entry or find existent entry with the same 'name'
  50. node = faux_list_add_find(ini->list, pair);
  51. if (!node) { // Something went wrong
  52. faux_pair_free(pair);
  53. return NULL;
  54. }
  55. found_pair = faux_list_data(node);
  56. if (found_pair != pair) { // Item already exists so use existent
  57. faux_pair_free(pair);
  58. faux_pair_set_value(found_pair, value); // Replace value by new one
  59. return found_pair;
  60. }
  61. // The new entry was added
  62. return pair;
  63. }
  64. void faux_ini_unset(faux_ini_t *ini, const char *name) {
  65. faux_ini_set(ini, name, NULL);
  66. }
  67. /* Find pair by name */
  68. const faux_pair_t *faux_ini_find_pair(const faux_ini_t *ini, const char *name) {
  69. faux_list_node_t *iter = NULL;
  70. faux_pair_t *pair = NULL;
  71. assert(ini);
  72. assert(name);
  73. if (!ini || !name)
  74. return NULL;
  75. pair = faux_pair_new(name, NULL);
  76. if (!pair)
  77. return NULL;
  78. iter = faux_list_find_node(ini->list, faux_pair_compare, pair);
  79. faux_pair_free(pair);
  80. return faux_list_data(iter);
  81. }
  82. /* Find value by name */
  83. const char *faux_ini_find(const faux_ini_t *ini, const char *name) {
  84. const faux_pair_t *pair = faux_ini_find_pair(ini, name);
  85. if (!pair)
  86. return NULL;
  87. return faux_pair_value(pair);
  88. }
  89. faux_ini_node_t *faux_ini_init_iter(const faux_ini_t *ini) {
  90. assert(ini);
  91. if (!ini)
  92. return NULL;
  93. return (faux_ini_node_t *)faux_list_head(ini->list);
  94. }
  95. const faux_pair_t *faux_ini_each(faux_ini_node_t **iter) {
  96. return (const faux_pair_t *)faux_list_each((faux_list_node_t **)iter);
  97. }
  98. int faux_ini_parse_str(faux_ini_t *ini, const char *string) {
  99. char *buffer = NULL;
  100. char *saveptr = NULL;
  101. char *line = NULL;
  102. assert(ini);
  103. if (!ini)
  104. return -1;
  105. if (!string)
  106. return 0;
  107. buffer = faux_str_dup(string);
  108. // Now loop though each line
  109. for (line = strtok_r(buffer, "\n", &saveptr);
  110. line; line = strtok_r(NULL, "\n", &saveptr)) {
  111. char *str = NULL;
  112. char *name = NULL;
  113. char *value = NULL;
  114. char *savestr = NULL;
  115. char *ns = line;
  116. const char *begin = NULL;
  117. size_t len = 0;
  118. size_t offset = 0;
  119. size_t quoted = 0;
  120. char *rname = NULL;
  121. char *rvalue = NULL;
  122. if (!*ns) // Empty
  123. continue;
  124. while (*ns && isspace(*ns))
  125. ns++;
  126. if ('#' == *ns) // Comment
  127. continue;
  128. if ('=' == *ns) // Broken string
  129. continue;
  130. str = faux_str_dup(ns);
  131. name = strtok_r(str, "=", &savestr);
  132. if (!name) {
  133. faux_str_free(str);
  134. continue;
  135. }
  136. value = strtok_r(NULL, "=", &savestr);
  137. begin = faux_str_nextword(name, &len, &offset, &quoted);
  138. rname = faux_str_dupn(begin, len);
  139. if (!value) { // Empty value
  140. rvalue = NULL;
  141. } else {
  142. begin = faux_str_nextword(value, &len, &offset, &quoted);
  143. rvalue = faux_str_dupn(begin, len);
  144. }
  145. faux_ini_set(ini, rname, rvalue);
  146. faux_str_free(rname);
  147. faux_str_free(rvalue);
  148. faux_str_free(str);
  149. }
  150. faux_str_free(buffer);
  151. return 0;
  152. }
  153. int faux_ini_parse_file(faux_ini_t *ini, const char *fn) {
  154. int ret = -1;
  155. FILE *f = NULL;
  156. char *buf = NULL;
  157. unsigned int p = 0;
  158. const int chunk_size = 128;
  159. int size = chunk_size;
  160. assert(ini);
  161. assert(fn);
  162. if (!ini)
  163. return -1;
  164. if (!fn || !*fn)
  165. return -1;
  166. f = fopen(fn, "r");
  167. if (!f)
  168. return -1;
  169. buf = faux_zmalloc(size);
  170. while (fgets(buf + p, size - p, f)) {
  171. char *tmp = NULL;
  172. if (feof(f) || strchr(buf + p, '\n') || strchr(buf + p, '\r')) {
  173. faux_ini_parse_str(ini, buf);
  174. p = 0;
  175. continue;
  176. }
  177. p = size - 1;
  178. size += chunk_size;
  179. tmp = realloc(buf, size);
  180. if (!tmp)
  181. goto error;
  182. buf = tmp;
  183. }
  184. ret = 0;
  185. error:
  186. faux_free(buf);
  187. fclose(f);
  188. return ret;
  189. }