1
0

tree.c 9.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389
  1. /*
  2. * tree.c
  3. *
  4. * This file provides the implementation of a konf_tree class
  5. */
  6. #include "private.h"
  7. #include "lub/argv.h"
  8. #include "lub/string.h"
  9. #include "lub/ctype.h"
  10. #include <assert.h>
  11. #include <stdlib.h>
  12. #include <string.h>
  13. #include <stdio.h>
  14. #include <sys/types.h>
  15. #include <regex.h>
  16. /*---------------------------------------------------------
  17. * PRIVATE META FUNCTIONS
  18. *--------------------------------------------------------- */
  19. static int konf_tree_compare(const void *first, const void *second)
  20. {
  21. const konf_tree_t *f = (const konf_tree_t *)first;
  22. const konf_tree_t *s = (const konf_tree_t *)second;
  23. /* Priority check */
  24. if (f->priority != s->priority)
  25. return (f->priority - s->priority);
  26. /* Sequence check */
  27. if (f->seq_num != s->seq_num)
  28. return (f->seq_num - s->seq_num);
  29. /* Sub-sequence check */
  30. if (f->sub_num != s->sub_num)
  31. return (f->sub_num - s->sub_num);
  32. /* Line check */
  33. return strcmp(f->lower_line, s->lower_line);
  34. }
  35. /*---------------------------------------------------------
  36. * PRIVATE METHODS
  37. *--------------------------------------------------------- */
  38. static void konf_tree_init(konf_tree_t * this, const char *line,
  39. unsigned short priority)
  40. {
  41. /* set up defaults */
  42. this->line = strdup(line);
  43. this->lower_line = lub_string_tolower(line);
  44. this->priority = priority;
  45. this->seq_num = 0;
  46. this->sub_num = KONF_ENTRY_OK;
  47. this->splitter = BOOL_TRUE;
  48. this->depth = -1;
  49. /* initialise the list of commands for this conf */
  50. this->list = lub_list_new(konf_tree_compare);
  51. }
  52. /*--------------------------------------------------------- */
  53. static void konf_tree_fini(konf_tree_t * this)
  54. {
  55. lub_list_node_t *iter;
  56. /* delete each conf held by this conf */
  57. while ((iter = lub_list__get_head(this->list))) {
  58. /* remove the conf from the tree */
  59. lub_list_del(this->list, iter);
  60. /* release the instance */
  61. konf_tree_delete((konf_tree_t *)lub_list_node__get_data(iter));
  62. lub_list_node_free(iter);
  63. }
  64. lub_list_free(this->list);
  65. /* free our memory */
  66. free(this->line);
  67. this->line = NULL;
  68. free(this->lower_line);
  69. this->lower_line = NULL;
  70. }
  71. /*---------------------------------------------------------
  72. * PUBLIC META FUNCTIONS
  73. *--------------------------------------------------------- */
  74. /*--------------------------------------------------------- */
  75. konf_tree_t *konf_tree_new(const char *line, unsigned short priority)
  76. {
  77. konf_tree_t *this = malloc(sizeof(konf_tree_t));
  78. if (this)
  79. konf_tree_init(this, line, priority);
  80. return this;
  81. }
  82. /*---------------------------------------------------------
  83. * PUBLIC METHODS
  84. *--------------------------------------------------------- */
  85. void konf_tree_delete(konf_tree_t * this)
  86. {
  87. konf_tree_fini(this);
  88. free(this);
  89. }
  90. /*--------------------------------------------------------- */
  91. void konf_tree_fprintf(konf_tree_t * this, FILE * stream,
  92. const char *pattern, int top_depth,
  93. bool_t seq, unsigned char prev_pri_hi)
  94. {
  95. konf_tree_t *conf;
  96. lub_list_node_t *iter;
  97. unsigned char pri = 0;
  98. regex_t regexp;
  99. if (this->line && (*(this->line) != '\0') &&
  100. (this->depth > top_depth)) {
  101. char *space = NULL;
  102. unsigned space_num = this->depth - top_depth - 1;
  103. if (space_num > 0) {
  104. space = malloc(space_num + 1);
  105. memset(space, ' ', space_num);
  106. space[space_num] = '\0';
  107. }
  108. if ((0 == this->depth) &&
  109. (this->splitter ||
  110. (konf_tree__get_priority_hi(this) != prev_pri_hi)))
  111. fprintf(stream, "!\n");
  112. fprintf(stream, "%s", space ? space : "");
  113. if (seq && (konf_tree__get_seq_num(this) != 0))
  114. fprintf(stream, "%u ", konf_tree__get_seq_num(this));
  115. fprintf(stream, "%s\n", this->line);
  116. free(space);
  117. }
  118. /* regexp compilation */
  119. if (pattern)
  120. if (regcomp(&regexp, pattern, REG_EXTENDED | REG_ICASE) != 0)
  121. return;
  122. /* iterate child elements */
  123. for(iter = lub_list__get_head(this->list);
  124. iter; iter = lub_list_node__get_next(iter)) {
  125. conf = (konf_tree_t *)lub_list_node__get_data(iter);
  126. if (pattern && (0 != regexec(&regexp, conf->line, 0, NULL, 0)))
  127. continue;
  128. konf_tree_fprintf(conf, stream, NULL, top_depth, seq, pri);
  129. pri = konf_tree__get_priority_hi(conf);
  130. }
  131. if (pattern)
  132. regfree(&regexp);
  133. }
  134. /*-------------------------------------------------------- */
  135. static int normalize_seq(konf_tree_t * this, unsigned short priority,
  136. lub_list_node_t *start)
  137. {
  138. unsigned short cnt = 1;
  139. konf_tree_t *conf = NULL;
  140. lub_list_node_t *iter;
  141. unsigned short cur_pri;
  142. if (start) {
  143. lub_list_node_t *prev;
  144. iter = start;
  145. if ((prev = lub_list_node__get_prev(iter))) {
  146. conf = (konf_tree_t *)lub_list_node__get_data(prev);
  147. cnt = konf_tree__get_seq_num(conf) + 1;
  148. }
  149. } else {
  150. iter = lub_list__get_head(this->list);
  151. }
  152. /* If list is empty */
  153. if (!iter)
  154. return 0;
  155. /* Iterate and renum */
  156. do {
  157. conf = (konf_tree_t *)lub_list_node__get_data(iter);
  158. cur_pri = konf_tree__get_priority(conf);
  159. if (cur_pri > priority)
  160. break;
  161. if (cur_pri < priority)
  162. continue;
  163. if (konf_tree__get_seq_num(conf) == 0)
  164. continue;
  165. konf_tree__set_seq_num(conf, cnt++);
  166. } while ((iter = lub_list_node__get_next(iter)));
  167. return 0;
  168. }
  169. /*--------------------------------------------------------- */
  170. konf_tree_t *konf_tree_new_conf(konf_tree_t * this,
  171. const char *line, unsigned short priority,
  172. bool_t seq, unsigned short seq_num)
  173. {
  174. lub_list_node_t *node;
  175. /* Allocate the memory for a new child element */
  176. konf_tree_t *newconf = konf_tree_new(line, priority);
  177. assert(newconf);
  178. /* Sequence */
  179. if (seq) {
  180. konf_tree__set_seq_num(newconf,
  181. seq_num ? seq_num : 0xffff);
  182. konf_tree__set_sub_num(newconf, KONF_ENTRY_NEW);
  183. }
  184. /* Insert it into the list */
  185. node = lub_list_add(this->list, newconf);
  186. if (seq) {
  187. normalize_seq(this, priority, node);
  188. konf_tree__set_sub_num(newconf, KONF_ENTRY_OK);
  189. }
  190. return newconf;
  191. }
  192. /*--------------------------------------------------------- */
  193. konf_tree_t *konf_tree_find_conf(konf_tree_t * this,
  194. const char *line, unsigned short priority, unsigned short seq_num)
  195. {
  196. konf_tree_t *conf;
  197. lub_list_node_t *iter;
  198. int check_pri = 0;
  199. char *lower_line;
  200. /* If list is empty */
  201. if (!(iter = lub_list__get_tail(this->list)))
  202. return NULL;
  203. if ((0 != priority) && (0 != seq_num))
  204. check_pri = 1;
  205. /* Iterate non-empty tree */
  206. lower_line = lub_string_tolower(line);
  207. do {
  208. conf = (konf_tree_t *)lub_list_node__get_data(iter);
  209. if (check_pri) {
  210. if (priority < conf->priority)
  211. continue;
  212. if (priority > conf->priority)
  213. break;
  214. if (seq_num < conf->seq_num)
  215. continue;
  216. if (seq_num > conf->seq_num)
  217. break;
  218. }
  219. if (!strcmp(conf->lower_line, lower_line)) {
  220. free(lower_line);
  221. return conf;
  222. }
  223. } while ((iter = lub_list_node__get_prev(iter)));
  224. free(lower_line);
  225. return NULL;
  226. }
  227. /*--------------------------------------------------------- */
  228. int konf_tree_del_pattern(konf_tree_t *this,
  229. const char *line, bool_t unique,
  230. const char *pattern, unsigned short priority,
  231. bool_t seq, unsigned short seq_num)
  232. {
  233. int res = 0;
  234. konf_tree_t *conf;
  235. lub_list_node_t *iter;
  236. lub_list_node_t *tmp;
  237. regex_t regexp;
  238. int del_cnt = 0; /* how many strings were deleted */
  239. if (seq && (0 == priority))
  240. return -1;
  241. /* Is tree empty? */
  242. if (!(iter = lub_list__get_head(this->list)))
  243. return 0;
  244. /* Compile regular expression */
  245. if (regcomp(&regexp, pattern, REG_EXTENDED | REG_ICASE) != 0)
  246. return -1;
  247. /* Iterate configuration tree */
  248. tmp = lub_list_node_new(NULL);
  249. do {
  250. conf = (konf_tree_t *)lub_list_node__get_data(iter);
  251. if ((0 != priority) &&
  252. (priority != conf->priority))
  253. continue;
  254. if (seq && (seq_num != 0) &&
  255. (seq_num != conf->seq_num))
  256. continue;
  257. if (seq && (0 == seq_num) && (0 == conf->seq_num))
  258. continue;
  259. if (0 != regexec(&regexp, conf->line, 0, NULL, 0))
  260. continue;
  261. if (unique && line && !strcmp(conf->lower_line, line)) {
  262. res++;
  263. continue;
  264. }
  265. lub_list_del(this->list, iter);
  266. konf_tree_delete(conf);
  267. lub_list_node_copy(tmp, iter);
  268. lub_list_node_free(iter);
  269. iter = tmp;
  270. del_cnt++;
  271. } while ((iter = lub_list_node__get_next(iter)));
  272. lub_list_node_free(tmp);
  273. regfree(&regexp);
  274. if (seq && (del_cnt != 0))
  275. normalize_seq(this, priority, NULL);
  276. return res;
  277. }
  278. /*--------------------------------------------------------- */
  279. unsigned short konf_tree__get_priority(const konf_tree_t * this)
  280. {
  281. return this->priority;
  282. }
  283. /*--------------------------------------------------------- */
  284. unsigned char konf_tree__get_priority_hi(const konf_tree_t * this)
  285. {
  286. return (unsigned char)(this->priority >> 8);
  287. }
  288. /*--------------------------------------------------------- */
  289. unsigned char konf_tree__get_priority_lo(const konf_tree_t * this)
  290. {
  291. return (unsigned char)(this->priority & 0xff);
  292. }
  293. /*--------------------------------------------------------- */
  294. bool_t konf_tree__get_splitter(const konf_tree_t * this)
  295. {
  296. return this->splitter;
  297. }
  298. /*--------------------------------------------------------- */
  299. void konf_tree__set_splitter(konf_tree_t *this, bool_t splitter)
  300. {
  301. this->splitter = splitter;
  302. }
  303. /*--------------------------------------------------------- */
  304. unsigned short konf_tree__get_seq_num(const konf_tree_t * this)
  305. {
  306. return this->seq_num;
  307. }
  308. /*--------------------------------------------------------- */
  309. void konf_tree__set_seq_num(konf_tree_t * this, unsigned short seq_num)
  310. {
  311. this->seq_num = seq_num;
  312. }
  313. /*--------------------------------------------------------- */
  314. unsigned short konf_tree__get_sub_num(const konf_tree_t * this)
  315. {
  316. return this->sub_num;
  317. }
  318. /*--------------------------------------------------------- */
  319. void konf_tree__set_sub_num(konf_tree_t * this, unsigned short sub_num)
  320. {
  321. this->sub_num = sub_num;
  322. }
  323. /*--------------------------------------------------------- */
  324. const char * konf_tree__get_line(const konf_tree_t * this)
  325. {
  326. return this->line;
  327. }
  328. /*--------------------------------------------------------- */
  329. void konf_tree__set_depth(konf_tree_t * this, int depth)
  330. {
  331. this->depth = depth;
  332. }
  333. /*--------------------------------------------------------- */
  334. int konf_tree__get_depth(const konf_tree_t * this)
  335. {
  336. return this->depth;
  337. }