2
0

glue.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455
  1. /*
  2. Copyright 2019-2020 Bruce A Henderson
  3. Licensed under the Apache License, Version 2.0 (the "License");
  4. you may not use this file except in compliance with the License.
  5. You may obtain a copy of the License at
  6. http://www.apache.org/licenses/LICENSE-2.0
  7. Unless required by applicable law or agreed to in writing, software
  8. distributed under the License is distributed on an "AS IS" BASIS,
  9. WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  10. See the License for the specific language governing permissions and
  11. limitations under the License.
  12. */
  13. #include "text.mod/mxml.mod/mxml/mxml.h"
  14. #include "brl.mod/blitz.mod/blitz.h"
  15. extern int text_xml__xmlstream_read(void *, void *, unsigned int);
  16. extern int text_xml__xmlstream_write(void *, const void *, unsigned int);
  17. mxml_node_t * bmx_mxmlGetFirstChild(mxml_node_t * node);
  18. static int bmx_mxml_stream_read(void * ctxt, void *buf, unsigned int length) {
  19. return text_xml__xmlstream_read(ctxt, buf, length);
  20. }
  21. static int bmx_mxml_stream_write(void * ctxt, const void *buf, unsigned int length) {
  22. return text_xml__xmlstream_write(ctxt, buf, length);
  23. }
  24. static mxml_node_t * bmx_add_directive_if_required(mxml_node_t * doc) {
  25. if (doc && strncasecmp(mxmlGetElement(doc), "?xml", 4) != 0) {
  26. mxml_node_t * d = mxmlNewXML(NULL);
  27. mxmlAdd(d, MXML_ADD_AFTER, NULL, doc);
  28. doc = d;
  29. }
  30. return doc;
  31. }
  32. struct whitespace_t {
  33. char buf[4096];
  34. int spaces;
  35. };
  36. static int bmx_mxml_getDepth(mxml_node_t * node) {
  37. int count = 0;
  38. while (node = mxmlGetParent(node)) {
  39. count++;
  40. }
  41. return count;
  42. }
  43. static const char * bmx_mxml_whitspace_cb(mxml_node_t * node, int where, void * ctxt) {
  44. struct whitespace_t * ws = (struct whitespace_t*)ctxt;
  45. if (ws) {
  46. int depth = bmx_mxml_getDepth(node);
  47. if (depth > 0) {
  48. ws->buf[0] = '\n';
  49. depth--;
  50. if (depth > 2047) {
  51. depth = 2047;
  52. }
  53. if (ws->spaces < depth) {
  54. char * q = 1 + ws->buf + ws->spaces * 2;
  55. for (int i = ws->spaces; i < depth; i++) {
  56. *q++ = ' ';
  57. *q++ = ' ';
  58. }
  59. }
  60. ws->buf[1 + depth * 2] = 0;
  61. ws->spaces = depth;
  62. switch(where) {
  63. case MXML_WS_BEFORE_OPEN:
  64. return ws->buf;
  65. case MXML_WS_BEFORE_CLOSE:
  66. if (bmx_mxmlGetFirstChild(node) != NULL) {
  67. return ws->buf;
  68. }
  69. break;
  70. }
  71. }
  72. }
  73. return NULL;
  74. }
  75. mxml_node_t * bmx_mxmlNewXML(BBString * version) {
  76. char * v = bbStringToUTF8String(version);
  77. mxml_node_t * node = mxmlNewXML(v);
  78. bbMemFree(v);
  79. return node;
  80. }
  81. mxml_node_t * bmx_mxmlNewElement(mxml_node_t * parent, BBString * name) {
  82. char * n = bbStringToUTF8String(name);
  83. if (!parent) {
  84. parent = MXML_NO_PARENT;
  85. }
  86. mxml_node_t * node = mxmlNewElement(parent, n);
  87. bbMemFree(n);
  88. return node;
  89. }
  90. void bmx_mxmlDelete(mxml_node_t * node) {
  91. mxmlDelete(node);
  92. }
  93. mxml_node_t * bmx_mxmlGetRootElement(mxml_node_t * node) {
  94. while (mxmlGetParent(node) != NULL) {
  95. node = mxmlGetParent(node);
  96. }
  97. // mxml turns the ?xml directive into the root element, so we need to skip it.
  98. // Also, there's no real concept of "directive" elements in mxml, so they appear as MXML_ELEMENT.
  99. if (node && strncasecmp(mxmlGetElement(node), "?xml", 4) == 0) {
  100. mxml_node_t * n = mxmlWalkNext(node, node, MXML_DESCEND);
  101. while (n && mxmlGetType(n) != MXML_ELEMENT) {
  102. n = mxmlWalkNext(n, node, MXML_DESCEND);
  103. }
  104. if (n) {
  105. node = n;
  106. }
  107. }
  108. return node;
  109. }
  110. mxml_node_t * bmx_mxmlSetRootElement(mxml_node_t * parent, mxml_node_t * root) {
  111. mxml_node_t * r = bmx_mxmlGetRootElement(parent);
  112. if (r) {
  113. mxmlRemove(r);
  114. }
  115. mxmlAdd(parent, MXML_ADD_AFTER, MXML_ADD_TO_PARENT, root);
  116. return r;
  117. }
  118. void bmx_mxmlAdd(mxml_node_t * parent, int where, mxml_node_t * child, mxml_node_t * node) {
  119. if (!child) {
  120. child = MXML_ADD_TO_PARENT;
  121. }
  122. mxmlAdd(parent, where, child, node);
  123. }
  124. BBString * bmx_mxmlGetElement(mxml_node_t * node) {
  125. char * n = mxmlGetElement(node);
  126. if (n) {
  127. return bbStringFromUTF8String(n);
  128. }
  129. return &bbEmptyString;
  130. }
  131. int bmx_mxmlSaveStdout(mxml_node_t * node, int format) {
  132. if (!format) {
  133. return mxmlSaveFile(node, stdout, MXML_NO_CALLBACK, NULL);
  134. } else {
  135. struct whitespace_t ws = {};
  136. return mxmlSaveFile(node, stdout, bmx_mxml_whitspace_cb, &ws);
  137. }
  138. }
  139. void bmx_mxmlSetContent(mxml_node_t * node, BBString * content) {
  140. mxml_node_t * child = mxmlGetFirstChild(node);
  141. while (child != NULL) {
  142. mxml_node_t * next = mxmlGetNextSibling(child);
  143. mxml_type_t type = mxmlGetType(child);
  144. if (type == MXML_TEXT || type == MXML_INTEGER || type == MXML_OPAQUE || type == MXML_REAL || type == MXML_CUSTOM) {
  145. mxmlDelete(child);
  146. }
  147. child = next;
  148. }
  149. char * c = bbStringToUTF8String(content);
  150. mxmlNewOpaque(node, c);
  151. bbMemFree(c);
  152. }
  153. BBString * bmx_mxmlSaveString(mxml_node_t * node, int format) {
  154. mxml_save_cb_t cb = MXML_NO_CALLBACK;
  155. if (format) {
  156. cb = bmx_mxml_whitspace_cb;
  157. }
  158. struct whitespace_t ws = {};
  159. char tmp[1];
  160. int size = mxmlSaveString(node, tmp, 1, cb, &ws);
  161. char * buf = bbMemAlloc(size);
  162. mxmlSaveString(node, buf, size, cb, &ws);
  163. buf[size-1] = 0;
  164. BBString * s = bbStringFromUTF8String(buf);
  165. bbMemFree(buf);
  166. return s;
  167. }
  168. void bmx_mxmlElementSetAttr(mxml_node_t * node, BBString * name, BBString * value) {
  169. char * n = bbStringToUTF8String(name);
  170. char * v = bbStringToUTF8String(value);
  171. mxmlElementSetAttr(node, n, v);
  172. bbMemFree(v);
  173. bbMemFree(n);
  174. }
  175. BBString * bmx_mxmlElementGetAttr(mxml_node_t * node, BBString * name) {
  176. char * n = bbStringToUTF8String(name);
  177. char * v = mxmlElementGetAttr(node, n);
  178. bbMemFree(n);
  179. if (v) {
  180. return bbStringFromUTF8String(v);
  181. }
  182. return &bbEmptyString;
  183. }
  184. void bmx_mxmlElementDeleteAttr(mxml_node_t * node, BBString * name) {
  185. char * n = bbStringToUTF8String(name);
  186. mxmlElementDeleteAttr(node, n);
  187. bbMemFree(n);
  188. }
  189. int bmx_mxmlElementHasAttr(mxml_node_t * node, BBString * name) {
  190. char * n = bbStringToUTF8String(name);
  191. char * v = mxmlElementGetAttr(node, n);
  192. bbMemFree(n);
  193. return v != NULL;
  194. }
  195. void bmx_mxmlSetElement(mxml_node_t * node, BBString * name) {
  196. char * n = bbStringToUTF8String(name);
  197. mxmlSetElement(node, n);
  198. bbMemFree(n);
  199. }
  200. int bmx_mxmlElementGetAttrCount(mxml_node_t * node) {
  201. return mxmlElementGetAttrCount(node);
  202. }
  203. BBString * bmx_mxmlElementGetAttrByIndex(mxml_node_t * node, int index, BBString ** name) {
  204. char * n;
  205. char * v = mxmlElementGetAttrByIndex(node, index, &n);
  206. if (v) {
  207. *name = bbStringFromUTF8String(n);
  208. return bbStringFromUTF8String(v);
  209. } else {
  210. *name = &bbEmptyString;
  211. return &bbEmptyString;
  212. }
  213. }
  214. mxml_node_t * bmx_mxmlLoadStream(BBObject * stream) {
  215. mxml_node_t * doc = mxmlLoadStream(NULL, bmx_mxml_stream_read, stream, MXML_OPAQUE_CALLBACK);
  216. // add a directive if the document doesn't have one
  217. doc = bmx_add_directive_if_required(doc);
  218. return doc;
  219. }
  220. mxml_node_t * bmx_mxmlWalkNext(mxml_node_t * node, mxml_node_t * top, int descend) {
  221. return mxmlWalkNext(node, top, descend);
  222. }
  223. int bmx_mxmlGetType(mxml_node_t * node) {
  224. return mxmlGetType(node);
  225. }
  226. void bmx_mxmlAddContent(mxml_node_t * node, BBString * content) {
  227. char * c = bbStringToUTF8String(content);
  228. mxmlNewText(node, 0, c);
  229. bbMemFree(c);
  230. }
  231. mxml_node_t * bmx_mxmlGetParent(mxml_node_t * node) {
  232. return mxmlGetParent(node);
  233. }
  234. mxml_node_t * bmx_mxmlGetFirstChild(mxml_node_t * node) {
  235. mxml_node_t * n = mxmlGetFirstChild(node);
  236. while (n && mxmlGetType(n) != MXML_ELEMENT) {
  237. n = mxmlGetNextSibling(n);
  238. }
  239. return n;
  240. }
  241. mxml_node_t * bmx_mxmlGetLastChild(mxml_node_t * node) {
  242. mxml_node_t * n = mxmlGetLastChild(node);
  243. while (n && mxmlGetType(n) != MXML_ELEMENT) {
  244. n = mxmlGetPrevSibling(n);
  245. }
  246. return n;
  247. }
  248. mxml_node_t * bmx_mxmlGetNextSibling(mxml_node_t * node) {
  249. mxml_node_t * n = mxmlGetNextSibling(node);
  250. while (n && mxmlGetType(n) != MXML_ELEMENT) {
  251. n = mxmlGetNextSibling(n);
  252. }
  253. return n;
  254. }
  255. mxml_node_t * bmx_mxmlGetPrevSibling(mxml_node_t * node) {
  256. mxml_node_t * n = mxmlGetPrevSibling(node);
  257. while (n && mxmlGetType(n) != MXML_ELEMENT) {
  258. n = mxmlGetPrevSibling(n);
  259. }
  260. return n;
  261. }
  262. int bmx_mxmlSaveStream(mxml_node_t * node, BBObject * stream, int format) {
  263. if (!format) {
  264. return mxmlSaveStream(node, bmx_mxml_stream_write, stream, NULL, NULL);
  265. } else {
  266. struct whitespace_t ws = {};
  267. return mxmlSaveStream(node, bmx_mxml_stream_write, stream, bmx_mxml_whitspace_cb, &ws);
  268. }
  269. }
  270. struct _string_buf {
  271. BBString * txt;
  272. int txtOffset;
  273. char padding[2];
  274. int padCount;
  275. };
  276. // direct string to utf-8 stream
  277. static int bmx_mxml_string_read(void * ctxt, void *buf, unsigned int length) {
  278. struct _string_buf * data = (struct _string_buf*)ctxt;
  279. int txtLength = data->txt->length;
  280. int count = 0;
  281. unsigned short *p = data->txt->buf + data->txtOffset;
  282. char *q = buf;
  283. char *a = data->padding;
  284. while (data->txtOffset < txtLength && count < length) {
  285. while (data->padCount > 0) {
  286. *q++ = a[--data->padCount];
  287. count++;
  288. }
  289. unsigned int c=*p++;
  290. if( c<0x80 ){
  291. *q++ = c;
  292. count++;
  293. }else if( c<0x800 ){
  294. *q++ = 0xc0|(c>>6);
  295. if (++count < length) {
  296. *q++ = 0x80|(c&0x3f);
  297. count++;
  298. } else {
  299. data->padding[data->padCount++] = 0x80|(c&0x3f);
  300. continue;
  301. }
  302. }else{
  303. *q++ = 0xe0|(c>>12);
  304. if (++count < length) {
  305. *q++ = 0x80|((c>>6)&0x3f);
  306. if (++count < length) {
  307. *q++ = 0x80|(c&0x3f);
  308. count++;
  309. } else {
  310. data->padding[data->padCount++] = 0x80|(c&0x3f);
  311. continue;
  312. }
  313. } else {
  314. data->padding[1] = 0x80|((c>>6)&0x3f);
  315. data->padding[0] = 0x80|(c&0x3f);
  316. data->padCount = 2;
  317. continue;
  318. }
  319. }
  320. data->txtOffset++;
  321. }
  322. return count;
  323. }
  324. mxml_node_t * bmx_mxmlLoadString(BBString * txt) {
  325. if (txt == &bbEmptyString) {
  326. return NULL;
  327. }
  328. struct _string_buf buf = {txt = txt};
  329. mxml_node_t * doc = mxmlLoadStream(NULL, bmx_mxml_string_read, &buf, MXML_OPAQUE_CALLBACK);
  330. // add a directive if the document doesn't have one
  331. doc = bmx_add_directive_if_required(doc);
  332. return doc;
  333. }
  334. void bmx_mxmlSetWrapMargin(int column) {
  335. mxmlSetWrapMargin(column);
  336. }
  337. BBString * bmx_mxmlGetContent(mxml_node_t * node) {
  338. const char * txt = mxmlGetOpaque(node);
  339. if (!txt || strlen(txt) == 0) {
  340. return &bbEmptyString;
  341. }
  342. return bbStringFromUTF8String(txt);
  343. }
  344. BBString * bmx_mxmlGetCDATA(mxml_node_t * node) {
  345. const char * txt = mxmlGetCDATA(node);
  346. if (!txt || strlen(txt) == 0) {
  347. return &bbEmptyString;
  348. }
  349. return bbStringFromUTF8String(txt);
  350. }
  351. mxml_node_t * bmx_mxmlFindElement(mxml_node_t * node, BBString * element, BBString * attr, BBString * value, int descend) {
  352. char * e = 0;
  353. char * a = 0;
  354. char * v = 0;
  355. if (element != &bbEmptyString) {
  356. e = bbStringToUTF8String(element);
  357. }
  358. if (attr != &bbEmptyString) {
  359. a = bbStringToUTF8String(attr);
  360. }
  361. if (value != &bbEmptyString) {
  362. v = bbStringToUTF8String(value);
  363. }
  364. mxml_node_t * result = mxmlFindElement(node, node, e, a, v, descend);
  365. bbMemFree(v);
  366. bbMemFree(a);
  367. bbMemFree(e);
  368. return result;
  369. }
  370. void bmx_mxmlSetErrorCallback(mxml_error_cb_t cb){
  371. mxmlSetErrorCallback(cb);
  372. }