domnode-expat.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539
  1. static const char version[] = "$Id$";
  2. /*
  3. * Copyright 2002, Meiosys SA (www.meiosys.com). All rights reserved.
  4. *
  5. * See the COPYING file for the terms of usage and distribution.
  6. */
  7. /* domnode - simple XML DOM-like interface
  8. * Copyright (c) 2002 Michael B. Allen <mballen@erols.com>
  9. *
  10. * The MIT License
  11. *
  12. * Permission is hereby granted, free of charge, to any person obtaining a
  13. * copy of this software and associated documentation files (the "Software"),
  14. * to deal in the Software without restriction, including without limitation
  15. * the rights to use, copy, modify, merge, publish, distribute, sublicense,
  16. * and/or sell copies of the Software, and to permit persons to whom the
  17. * Software is furnished to do so, subject to the following conditions:
  18. *
  19. * The above copyright notice and this permission notice shall be included
  20. * in all copies or substantial portions of the Software.
  21. *
  22. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  23. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  24. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
  25. * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR
  26. * OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
  27. * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
  28. * OTHER DEALINGS IN THE SOFTWARE.
  29. */
  30. #ifdef HAVE_CONFIG_H
  31. #include "config.h"
  32. #endif
  33. #include <sd/domnode.h>
  34. #include <sd/stack.h>
  35. #include <sd/malloc.h>
  36. #include <sd/error.h>
  37. #include <stdlib.h>
  38. #include <string.h>
  39. #include <ctype.h>
  40. #ifdef HAVE_LANGINFO_H
  41. # include <langinfo.h>
  42. #endif
  43. #include <assert.h>
  44. #include "expat.h"
  45. struct udata {
  46. char cdata[2048];
  47. size_t wptr;
  48. sd_stack_t* elements;
  49. sd_domnode_t* root;
  50. };
  51. /******************************************************************************/
  52. static struct udata* udata_new(void)
  53. {
  54. struct udata* this;
  55. this = sd_calloc(1, sizeof(*this));
  56. this->cdata[0] = 0;
  57. this->wptr = 0;
  58. this->elements = sd_stack_new(0);
  59. this->root = NULL;
  60. return this;
  61. }
  62. /******************************************************************************/
  63. static void udata_delete(struct udata* this)
  64. {
  65. if (!this)
  66. return;
  67. sd_stack_delete(this->elements, NULL);
  68. free(this);
  69. }
  70. /******************************************************************************/
  71. static void udata_pop_cdata(struct udata* this)
  72. {
  73. this->wptr = 0;
  74. memset(this->cdata, 0, sizeof(this->cdata));
  75. }
  76. /******************************************************************************/
  77. static int udata_push_cdata(struct udata* this, const XML_Char* s, int len)
  78. {
  79. XML_Char *str;
  80. if (!this || !s || !len)
  81. return -1;
  82. str = (XML_Char *)s + len;
  83. while (s < str && isspace(*s)) {
  84. s++;
  85. len--;
  86. }
  87. if (s == str) return -1;
  88. str = (XML_Char *)s + len - 1;
  89. while (str > s && isspace(*str)) {
  90. str--;
  91. len--;
  92. }
  93. if ((this->wptr + len) >= sizeof(this->cdata) - 1){
  94. sd_error("cdata buffer exceeded (maximum %d bytes)\n",
  95. sizeof(this->cdata));
  96. return -1;
  97. }
  98. strncpy(&this->cdata[this->wptr], s, len);
  99. this->wptr += len;
  100. this->cdata[this->wptr] = 0;
  101. return 0;
  102. }
  103. /******************************************************************************/
  104. static int foreach_delete(sd_domnode_t* anode, void* unused)
  105. {
  106. sd_domnode_delete(anode);
  107. return 0;
  108. }
  109. /******************************************************************************/
  110. /*
  111. extern sd_domnode_t* __sd_domnode_new(const char* name, const char* value, int is_elem)
  112. {
  113. sd_domnode_t* this;
  114. this = sd_calloc(1, sizeof(*this));
  115. this->name = name ? sd_strdup(name) : NULL;
  116. this->value = value ? sd_strdup(value): NULL;
  117. this->children = is_elem ? sd_list_new(10) : NULL;
  118. this->attrs = is_elem ? sd_list_new(10) : NULL;
  119. return this;
  120. }
  121. */
  122. /******************************************************************************/
  123. /*
  124. extern sd_domnode_t* sd_domnode_new(const char* name, const char* value)
  125. {
  126. return __sd_domnode_new(name, value, 1);
  127. }
  128. */
  129. /******************************************************************************/
  130. /*
  131. extern void sd_domnode_delete(sd_domnode_t* this)
  132. {
  133. if (!this)
  134. return;
  135. free((void*) this->name);
  136. free((void*) this->value);
  137. sd_list_foreach(this->children, (sd_list_func_t) foreach_delete, NULL);
  138. sd_list_delete(this->children);
  139. sd_list_foreach(this->attrs, (sd_list_func_t) foreach_delete, NULL);
  140. sd_list_delete(this->attrs);
  141. free(this);
  142. }
  143. */
  144. /******************************************************************************/
  145. static void start_handler(struct udata* udata, const XML_Char* name, const XML_Char** atts)
  146. {
  147. sd_domnode_t* parent;
  148. sd_domnode_t* child;
  149. int i;
  150. if (!udata || !name || !atts)
  151. return;
  152. child = __sd_domnode_new(name, NULL, 1);
  153. for (i = 0; atts[i]; i += 2)
  154. sd_list_add(child->attrs, __sd_domnode_new(atts[i], atts[i + 1], 0));
  155. udata_pop_cdata(udata);
  156. /* root node has no parent. save it. */
  157. if ( (parent = sd_stack_peek(udata->elements)) == NULL)
  158. udata->root = child;
  159. else
  160. sd_list_add(parent->children, child);
  161. sd_stack_push(udata->elements, child);
  162. }
  163. /******************************************************************************/
  164. static void end_handler(struct udata* udata, const XML_Char* name)
  165. {
  166. udata_pop_cdata(udata);
  167. sd_stack_pop(udata->elements);
  168. }
  169. /******************************************************************************/
  170. static void cdata_handler(struct udata* udata, const XML_Char* s, int len)
  171. {
  172. sd_domnode_t* parent = sd_stack_peek(udata->elements);
  173. assert(parent != NULL);
  174. if (udata_push_cdata(udata, s, len) == -1)
  175. return;
  176. free((void*) parent->value);
  177. parent->value = strdup(udata->cdata);
  178. }
  179. /******************************************************************************/
  180. static void comment_handler(struct udata* udata, const XML_Char* s)
  181. {
  182. sd_domnode_t* parent = sd_stack_peek(udata->elements);
  183. assert(parent != NULL);
  184. sd_list_add(parent->children, __sd_domnode_new("#comment", s, 0));
  185. }
  186. /******************************************************************************/
  187. extern int sd_domnode_fread(sd_domnode_t* this, FILE* stream)
  188. {
  189. XML_Parser p;
  190. struct udata* udata;
  191. int ret = 0;
  192. if (!this || !stream)
  193. return -1;
  194. if ((p = XML_ParserCreate(NULL)) == NULL)
  195. return -1;
  196. udata = udata_new();
  197. XML_SetStartElementHandler (p, (XML_StartElementHandler) start_handler);
  198. XML_SetEndElementHandler (p, (XML_EndElementHandler) end_handler);
  199. XML_SetCharacterDataHandler (p, (XML_CharacterDataHandler) cdata_handler);
  200. XML_SetCommentHandler (p, (XML_CommentHandler) comment_handler);
  201. XML_SetUserData (p, udata);
  202. for ( ;; ) {
  203. size_t n;
  204. void* buf;
  205. int done;
  206. if ((buf = XML_GetBuffer(p, BUFSIZ)) == NULL) {
  207. ret = -1;
  208. break;
  209. }
  210. if ((n = fread(buf, 1, BUFSIZ, stream)) == 0 && ferror(stream)) {
  211. ret = -1;
  212. break;
  213. }
  214. if (!XML_ParseBuffer(p, n, (done = feof(stream)))) {
  215. sd_error("XML error: %s [%d:%d - %ld]\n",
  216. XML_ErrorString(XML_GetErrorCode(p)),
  217. XML_GetCurrentLineNumber(p),
  218. XML_GetCurrentColumnNumber(p),
  219. XML_GetCurrentByteIndex(p));
  220. ret = -1;
  221. break;
  222. }
  223. if (done)
  224. break;
  225. }
  226. if (udata->root)
  227. {
  228. free((void*) this->name);
  229. free((void*) this->value);
  230. sd_list_foreach(this->children, (sd_list_func_t) foreach_delete, NULL);
  231. sd_list_delete(this->children);
  232. sd_list_foreach(this->attrs, (sd_list_func_t) foreach_delete, NULL);
  233. sd_list_delete(this->attrs);
  234. this->name = udata->root->name;
  235. this->value = udata->root->value;
  236. this->children = udata->root->children;
  237. this->attrs = udata->root->attrs;
  238. free(udata->root);
  239. udata->root = NULL;
  240. }
  241. udata_delete(udata);
  242. XML_ParserFree(p);
  243. return ret;
  244. }
  245. /******************************************************************************/
  246. extern int sd_domnode_read(sd_domnode_t* this, const char* abuffer, size_t asize)
  247. {
  248. XML_Parser p;
  249. struct udata* udata;
  250. int ret = 0;
  251. if (!this)
  252. return -1;
  253. if ((p = XML_ParserCreate(NULL)) == NULL)
  254. return -1;
  255. udata = udata_new();
  256. XML_SetStartElementHandler (p, (XML_StartElementHandler) start_handler);
  257. XML_SetEndElementHandler (p, (XML_EndElementHandler) end_handler);
  258. XML_SetCharacterDataHandler (p, (XML_CharacterDataHandler) cdata_handler);
  259. XML_SetCommentHandler (p, (XML_CommentHandler) comment_handler);
  260. XML_SetUserData (p, udata);
  261. if (!XML_Parse(p, abuffer, asize, 1)) {
  262. sd_error("XML error: %s [%d:%d - %ld]\n",
  263. XML_ErrorString(XML_GetErrorCode(p)),
  264. XML_GetCurrentLineNumber(p),
  265. XML_GetCurrentColumnNumber(p),
  266. XML_GetCurrentByteIndex(p));
  267. ret = -1;
  268. }
  269. if (udata->root)
  270. {
  271. free((void*) this->name);
  272. free((void*) this->value);
  273. sd_list_foreach(this->children, (sd_list_func_t) foreach_delete, NULL);
  274. sd_list_delete(this->children);
  275. sd_list_foreach(this->attrs, (sd_list_func_t) foreach_delete, NULL);
  276. sd_list_delete(this->attrs);
  277. this->name = udata->root->name;
  278. this->value = udata->root->value;
  279. this->children = udata->root->children;
  280. this->attrs = udata->root->attrs;
  281. free(udata->root);
  282. udata->root = NULL;
  283. }
  284. udata_delete(udata);
  285. XML_ParserFree(p);
  286. return ret;
  287. }
  288. /******************************************************************************/
  289. static int _sd_domnode_fwrite(const sd_domnode_t* this, FILE* stream, int indent)
  290. {
  291. sd_list_iter_t* iter;
  292. int i;
  293. if (!this || !this->name || !stream)
  294. return -1;
  295. for (i = 0; i < indent; i++)
  296. fprintf(stream, " ");
  297. if (this->name && strcmp(this->name, "#comment") == 0) {
  298. fprintf(stream, "<!-- %s -->\n", this->value);
  299. return 0;
  300. }
  301. fprintf(stream, "<%s", this->name);
  302. for (iter = sd_list_begin(this->attrs); iter != sd_list_end(this->attrs);
  303. iter = sd_list_iter_next(iter)) {
  304. sd_domnode_t* node = iter->data;
  305. fprintf(stream, " %s=\"%s\"", node->name, node->value);
  306. }
  307. if (this->value || sd_list_get_nelem(this->children)) {
  308. fprintf(stream, ">\n");
  309. if (this->value) {
  310. for (i = 0; i < indent + 1; i++)
  311. fprintf(stream, " ");
  312. fprintf(stream, "%s\n", this->value);
  313. }
  314. for (iter = sd_list_begin(this->children); iter != sd_list_end(this->children);
  315. iter = sd_list_iter_next(iter)) {
  316. sd_domnode_t* node = iter->data;
  317. if (_sd_domnode_fwrite(node, stream, indent + 1) == -1)
  318. return -1;
  319. }
  320. for (i = 0; i < indent; i++)
  321. fprintf(stream, " ");
  322. fprintf(stream, "</%s>\n", this->name);
  323. } else {
  324. fprintf(stream, "/>\n");
  325. }
  326. return 0;
  327. }
  328. /******************************************************************************/
  329. extern int sd_domnode_fwrite(const sd_domnode_t* this, FILE* stream)
  330. {
  331. #ifdef HAVE_NL_LANGINFO
  332. fprintf(stream, "<?xml version=\"1.0\" encoding=\"%s\"?>\n\n",
  333. nl_langinfo(CODESET));
  334. #else
  335. fprintf(stream, "<?xml version=\"1.0\"?>\n\n");
  336. #endif
  337. return _sd_domnode_fwrite(this, stream, 0);
  338. }
  339. /******************************************************************************/
  340. extern int sd_domnode_load(sd_domnode_t* this, const char* afilename)
  341. {
  342. FILE* fp;
  343. int ret = 0;
  344. if ( (fp = fopen(afilename, "r")) == NULL)
  345. return -1;
  346. ret = sd_domnode_fread(this, fp);
  347. fclose(fp);
  348. return 0;
  349. }
  350. /******************************************************************************/
  351. extern int sd_domnode_store(const sd_domnode_t* this, const char* afilename)
  352. {
  353. FILE* fp;
  354. int ret = 0;
  355. if ( (fp = fopen(afilename, "w")) == NULL)
  356. return -1;
  357. ret = sd_domnode_fwrite(this, fp);
  358. fclose(fp);
  359. return 0;
  360. }
  361. /******************************************************************************/
  362. extern sd_domnode_t* sd_domnode_search(const sd_domnode_t* this, const char* name)
  363. {
  364. sd_list_iter_t* i;
  365. for (i = sd_list_begin(this->children); i != sd_list_end(this->children);
  366. i = sd_list_iter_next(i)) {
  367. sd_domnode_t* node = i->data;
  368. if (strcmp(node->name, name) == 0)
  369. return node;
  370. }
  371. for (i = sd_list_begin(this->attrs); i != sd_list_end(this->attrs);
  372. i = sd_list_iter_next(i)) {
  373. sd_domnode_t* node = i->data;
  374. if (strcmp(node->name, name) == 0)
  375. return node;
  376. }
  377. for (i = sd_list_begin(this->children); i != sd_list_end(this->children);
  378. i = sd_list_iter_next(i)) {
  379. sd_domnode_t* node = i->data;
  380. if ((node = sd_domnode_search(node, name)) != NULL)
  381. return node;
  382. }
  383. return NULL;
  384. }
  385. /******************************************************************************/
  386. extern sd_domnode_t* sd_domnode_attrs_put(sd_domnode_t* anode, sd_domnode_t* attr)
  387. {
  388. sd_list_iter_t* i;
  389. if (!anode || !anode->attrs || !attr || !attr->value)
  390. return NULL;
  391. if ( (i = sd_list_lookadd(anode->attrs, attr)) == sd_list_end(anode->attrs))
  392. return NULL;
  393. return i->data;
  394. }
  395. /******************************************************************************/
  396. extern sd_domnode_t* sd_domnode_attrs_get(const sd_domnode_t* anode, const char* name)
  397. {
  398. sd_list_iter_t* i;
  399. if (!anode || !anode->attrs || !name || !*name)
  400. return NULL;
  401. for (i = sd_list_begin(anode->attrs); i != sd_list_end(anode->attrs);
  402. i = sd_list_iter_next(i)) {
  403. sd_domnode_t* node = i->data;
  404. if (strcmp(node->name, name) == 0)
  405. return node;
  406. }
  407. return NULL;
  408. }
  409. /******************************************************************************/
  410. extern sd_domnode_t* sd_domnode_attrs_remove(sd_domnode_t* anode, const char* name)
  411. {
  412. sd_list_iter_t* i;
  413. if (!anode || !anode->attrs || !name || !*name)
  414. return NULL;
  415. for (i = sd_list_begin(anode->attrs); i != sd_list_end(anode->attrs);
  416. i = sd_list_iter_next(i)) {
  417. sd_domnode_t* node = i->data;
  418. if (strcmp(node->name, name) == 0) {
  419. sd_list_iter_del(i);
  420. return node;
  421. }
  422. }
  423. return NULL;
  424. }