xs.h 20 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979
  1. /* copyright (c) 2022 - 2023 grunfink / MIT license */
  2. #ifndef _XS_H
  3. #define _XS_H
  4. #include <stdio.h>
  5. #include <string.h>
  6. #include <stdlib.h>
  7. #include <ctype.h>
  8. #include <unistd.h>
  9. #include <stdarg.h>
  10. #include <signal.h>
  11. #include <errno.h>
  12. typedef enum {
  13. XSTYPE_NULL = 0x18,
  14. XSTYPE_TRUE = 0x06,
  15. XSTYPE_FALSE = 0x15,
  16. XSTYPE_LIST = 0x11,
  17. XSTYPE_LITEM = 0x1f,
  18. XSTYPE_EOL = 0x12,
  19. XSTYPE_DICT = 0x13,
  20. XSTYPE_DITEM = 0x1e,
  21. XSTYPE_EOD = 0x14,
  22. XSTYPE_NUMBER = 0x17,
  23. XSTYPE_STRING = 0x02
  24. } xstype;
  25. /* dynamic strings */
  26. typedef char d_char;
  27. /* auto-destroyable strings */
  28. #define xs __attribute__ ((__cleanup__ (_xs_destroy))) d_char
  29. /* not really all, just very much */
  30. #define XS_ALL 0xfffffff
  31. void *xs_free(void *ptr);
  32. void *_xs_realloc(void *ptr, size_t size, const char *file, int line, const char *func);
  33. #define xs_realloc(ptr, size) _xs_realloc(ptr, size, __FILE__, __LINE__, __FUNCTION__)
  34. int _xs_blk_size(int sz);
  35. void _xs_destroy(char **var);
  36. #define xs_debug() raise(SIGTRAP)
  37. xstype xs_type(const char *data);
  38. int xs_size(const char *data);
  39. int xs_is_null(const char *data);
  40. d_char *xs_dup(const char *data);
  41. d_char *xs_expand(d_char *data, int offset, int size);
  42. d_char *xs_collapse(d_char *data, int offset, int size);
  43. d_char *xs_insert_m(d_char *data, int offset, const char *mem, int size);
  44. #define xs_insert(data, offset, data2) xs_insert_m(data, offset, data2, xs_size(data2))
  45. #define xs_append_m(data, mem, size) xs_insert_m(data, xs_size(data) - 1, mem, size)
  46. d_char *xs_str_new(const char *str);
  47. d_char *xs_str_wrap_i(const char *prefix, d_char *str, const char *suffix);
  48. #define xs_str_prepend_i(str, prefix) xs_str_wrap_i(prefix, str, NULL)
  49. #define xs_str_cat(str, suffix) xs_str_wrap_i(NULL, str, suffix)
  50. d_char *xs_replace_i(d_char *str, const char *sfrom, const char *sto);
  51. #define xs_replace(str, sfrom, sto) xs_replace_i(xs_dup(str), sfrom, sto)
  52. d_char *xs_fmt(const char *fmt, ...);
  53. int xs_str_in(const char *haystack, const char *needle);
  54. int xs_startswith(const char *str, const char *prefix);
  55. int xs_endswith(const char *str, const char *postfix);
  56. d_char *xs_crop_i(d_char *str, int start, int end);
  57. d_char *xs_strip_chars_i(d_char *str, const char *chars);
  58. #define xs_strip_i(str) xs_strip_chars_i(str, " \r\n\t\v\f")
  59. d_char *xs_tolower_i(d_char *str);
  60. d_char *xs_list_new(void);
  61. d_char *xs_list_append_m(d_char *list, const char *mem, int dsz);
  62. #define xs_list_append(list, data) xs_list_append_m(list, data, xs_size(data))
  63. int xs_list_iter(char **list, char **value);
  64. int xs_list_len(char *list);
  65. char *xs_list_get(char *list, int num);
  66. d_char *xs_list_del(d_char *list, int num);
  67. d_char *xs_list_insert(d_char *list, int num, const char *data);
  68. d_char *xs_list_insert_sorted(d_char *list, const char *str);
  69. d_char *xs_list_set(d_char *list, int num, const char *data);
  70. d_char *xs_list_pop(d_char *list, char **data);
  71. int xs_list_in(char *list, const char *val);
  72. d_char *xs_join(char *list, const char *sep);
  73. d_char *xs_split_n(const char *str, const char *sep, int times);
  74. #define xs_split(str, sep) xs_split_n(str, sep, XS_ALL)
  75. d_char *xs_dict_new(void);
  76. d_char *xs_dict_append_m(d_char *dict, const char *key, const char *mem, int dsz);
  77. #define xs_dict_append(dict, key, data) xs_dict_append_m(dict, key, data, xs_size(data))
  78. int xs_dict_iter(char **dict, char **key, char **value);
  79. char *xs_dict_get(char *dict, const char *key);
  80. d_char *xs_dict_del(d_char *dict, const char *key);
  81. d_char *xs_dict_set(d_char *dict, const char *key, const char *data);
  82. d_char *xs_val_new(xstype t);
  83. d_char *xs_number_new(double f);
  84. double xs_number_get(const char *v);
  85. const char *xs_number_str(const char *v);
  86. void *xs_memmem(const char *haystack, int h_size, const char *needle, int n_size);
  87. #ifdef XS_IMPLEMENTATION
  88. void *_xs_realloc(void *ptr, size_t size, const char *file, int line, const char *func)
  89. {
  90. d_char *ndata = realloc(ptr, size);
  91. if (ndata == NULL) {
  92. fprintf(stderr, "**OUT OF MEMORY**\n");
  93. abort();
  94. }
  95. #ifdef XS_DEBUG
  96. if (ndata != ptr) {
  97. int n;
  98. FILE *f = fopen("xs_memory.out", "a");
  99. if (ptr != NULL)
  100. fprintf(f, "%p r\n", ptr);
  101. fprintf(f, "%p a %ld %s:%d: %s", ndata, size, file, line, func);
  102. if (ptr != NULL) {
  103. fprintf(f, " [");
  104. for (n = 0; n < 32 && ndata[n]; n++) {
  105. if (ndata[n] >= 32 && ndata[n] <= 127)
  106. fprintf(f, "%c", ndata[n]);
  107. else
  108. fprintf(f, "\\%02x", (unsigned char)ndata[n]);
  109. }
  110. fprintf(f, "]");
  111. }
  112. fprintf(f, "\n");
  113. fclose(f);
  114. }
  115. #else
  116. (void)file;
  117. (void)line;
  118. (void)func;
  119. #endif
  120. return ndata;
  121. }
  122. void *xs_free(void *ptr)
  123. {
  124. #ifdef XS_DEBUG
  125. if (ptr != NULL) {
  126. FILE *f = fopen("xs_memory.out", "a");
  127. fprintf(f, "%p b\n", ptr);
  128. fclose(f);
  129. }
  130. #endif
  131. free(ptr);
  132. return NULL;
  133. }
  134. void _xs_destroy(char **var)
  135. {
  136. /*
  137. if (_xs_debug)
  138. printf("_xs_destroy %p\n", var);
  139. */
  140. xs_free(*var);
  141. }
  142. int _xs_blk_size(int sz)
  143. /* calculates the block size */
  144. {
  145. int blk_size = 4096;
  146. if (sz < 256)
  147. blk_size = 32;
  148. else
  149. if (sz < 4096)
  150. blk_size = 256;
  151. return ((((sz) + blk_size) / blk_size) * blk_size);
  152. }
  153. xstype xs_type(const char *data)
  154. /* return the type of data */
  155. {
  156. xstype t;
  157. switch (data[0]) {
  158. case XSTYPE_NULL:
  159. case XSTYPE_TRUE:
  160. case XSTYPE_FALSE:
  161. case XSTYPE_LIST:
  162. case XSTYPE_EOL:
  163. case XSTYPE_DICT:
  164. case XSTYPE_EOD:
  165. case XSTYPE_LITEM:
  166. case XSTYPE_DITEM:
  167. case XSTYPE_NUMBER:
  168. t = data[0];
  169. break;
  170. default:
  171. t = XSTYPE_STRING;
  172. break;
  173. }
  174. return t;
  175. }
  176. void _xs_put_24b(char *ptr, int i)
  177. /* writes i as a 24 bit value */
  178. {
  179. unsigned char *p = (unsigned char *)ptr;
  180. p[0] = (i >> 16) & 0xff;
  181. p[1] = (i >> 8) & 0xff;
  182. p[2] = i & 0xff;
  183. }
  184. int _xs_get_24b(const char *ptr)
  185. /* reads a 24 bit value */
  186. {
  187. unsigned char *p = (unsigned char *)ptr;
  188. return (p[0] << 16) | (p[1] << 8) | p[2];
  189. }
  190. int xs_size(const char *data)
  191. /* returns the size of data in bytes */
  192. {
  193. int len = 0;
  194. const char *p;
  195. if (data == NULL)
  196. return 0;
  197. switch (xs_type(data)) {
  198. case XSTYPE_STRING:
  199. len = strlen(data) + 1;
  200. break;
  201. case XSTYPE_LIST:
  202. len = _xs_get_24b(data + 1);
  203. break;
  204. case XSTYPE_DICT:
  205. len = _xs_get_24b(data + 1);
  206. break;
  207. case XSTYPE_DITEM:
  208. /* calculate the size of the key and the value */
  209. p = data + 1;
  210. p += xs_size(p);
  211. p += xs_size(p);
  212. len = p - data;
  213. break;
  214. case XSTYPE_LITEM:
  215. /* it's the size of the item + 1 */
  216. p = data + 1;
  217. p += xs_size(p);
  218. len = p - data;
  219. break;
  220. case XSTYPE_NUMBER:
  221. len = 1 + xs_size(data + 1);
  222. break;
  223. default:
  224. len = 1;
  225. }
  226. return len;
  227. }
  228. int xs_is_null(const char *data)
  229. /* checks for null */
  230. {
  231. return !!(data == NULL || xs_type(data) == XSTYPE_NULL);
  232. }
  233. d_char *xs_dup(const char *data)
  234. /* creates a duplicate of data */
  235. {
  236. int sz = xs_size(data);
  237. d_char *s = xs_realloc(NULL, _xs_blk_size(sz));
  238. memcpy(s, data, sz);
  239. return s;
  240. }
  241. d_char *xs_expand(d_char *data, int offset, int size)
  242. /* opens a hole in data */
  243. {
  244. int sz = xs_size(data);
  245. /* open room */
  246. if (sz == 0 || _xs_blk_size(sz) != _xs_blk_size(sz + size))
  247. data = xs_realloc(data, _xs_blk_size(sz + size));
  248. /* move up the rest of the data */
  249. if (data != NULL)
  250. memmove(data + offset + size, data + offset, sz - offset);
  251. if (xs_type(data) == XSTYPE_LIST || xs_type(data) == XSTYPE_DICT)
  252. _xs_put_24b(data + 1, sz + size);
  253. return data;
  254. }
  255. d_char *xs_collapse(d_char *data, int offset, int size)
  256. /* shrinks data */
  257. {
  258. int sz = xs_size(data);
  259. int n;
  260. /* don't try to delete beyond the limit */
  261. if (offset + size > sz)
  262. size = sz - offset;
  263. /* shrink total size */
  264. sz -= size;
  265. for (n = offset; n < sz; n++)
  266. data[n] = data[n + size];
  267. if (xs_type(data) == XSTYPE_LIST || xs_type(data) == XSTYPE_DICT)
  268. _xs_put_24b(data + 1, sz);
  269. return xs_realloc(data, _xs_blk_size(sz));
  270. }
  271. d_char *xs_insert_m(d_char *data, int offset, const char *mem, int size)
  272. /* inserts a memory block */
  273. {
  274. data = xs_expand(data, offset, size);
  275. memcpy(data + offset, mem, size);
  276. return data;
  277. }
  278. /** strings **/
  279. d_char *xs_str_new(const char *str)
  280. /* creates a new string */
  281. {
  282. return xs_insert(NULL, 0, str ? str : "");
  283. }
  284. d_char *xs_str_wrap_i(const char *prefix, d_char *str, const char *suffix)
  285. /* wraps str with prefix and suffix */
  286. {
  287. if (prefix)
  288. str = xs_insert_m(str, 0, prefix, strlen(prefix));
  289. if (suffix)
  290. str = xs_insert_m(str, xs_size(str) - 1, suffix, xs_size(suffix));
  291. return str;
  292. }
  293. d_char *xs_replace_i(d_char *str, const char *sfrom, const char *sto)
  294. /* replaces inline all sfrom with sto */
  295. {
  296. int sfsz = strlen(sfrom);
  297. int stsz = strlen(sto);
  298. char *ss;
  299. int offset = 0;
  300. while ((ss = strstr(str + offset, sfrom)) != NULL) {
  301. int n_offset = ss - str;
  302. str = xs_collapse(str, n_offset, sfsz);
  303. str = xs_expand(str, n_offset, stsz);
  304. memcpy(str + n_offset, sto, stsz);
  305. offset = n_offset + stsz;
  306. }
  307. return str;
  308. }
  309. d_char *xs_fmt(const char *fmt, ...)
  310. /* formats a string with printf()-like marks */
  311. {
  312. int n;
  313. d_char *s = NULL;
  314. va_list ap;
  315. va_start(ap, fmt);
  316. n = vsnprintf(s, 0, fmt, ap);
  317. va_end(ap);
  318. if (n > 0) {
  319. s = xs_realloc(NULL, _xs_blk_size(n + 1));
  320. va_start(ap, fmt);
  321. vsnprintf(s, n + 1, fmt, ap);
  322. va_end(ap);
  323. }
  324. return s;
  325. }
  326. int xs_str_in(const char *haystack, const char *needle)
  327. /* finds needle in haystack and returns the offset or -1 */
  328. {
  329. char *s;
  330. int r = -1;
  331. if ((s = strstr(haystack, needle)) != NULL)
  332. r = s - haystack;
  333. return r;
  334. }
  335. int xs_startswith(const char *str, const char *prefix)
  336. /* returns true if str starts with prefix */
  337. {
  338. return !!(xs_str_in(str, prefix) == 0);
  339. }
  340. int xs_endswith(const char *str, const char *postfix)
  341. /* returns true if str ends with postfix */
  342. {
  343. int ssz = strlen(str);
  344. int psz = strlen(postfix);
  345. return !!(ssz >= psz && memcmp(postfix, str + ssz - psz, psz) == 0);
  346. }
  347. d_char *xs_crop_i(d_char *str, int start, int end)
  348. /* crops the d_char to be only from start to end */
  349. {
  350. int sz = strlen(str);
  351. if (end <= 0)
  352. end = sz + end;
  353. /* crop from the top */
  354. str[end] = '\0';
  355. /* crop from the bottom */
  356. str = xs_collapse(str, 0, start);
  357. return str;
  358. }
  359. d_char *xs_strip_chars_i(d_char *str, const char *chars)
  360. /* strips the string of chars from the start and the end */
  361. {
  362. int n;
  363. /* strip first from the end */
  364. for (n = strlen(str); n > 0 && strchr(chars, str[n - 1]); n--);
  365. str[n] = '\0';
  366. if (str[0]) {
  367. /* now strip from the beginning */
  368. for (n = 0; str[n] && strchr(chars, str[n]); n++);
  369. if (n)
  370. str = xs_collapse(str, 0, n);
  371. }
  372. return str;
  373. }
  374. d_char *xs_tolower_i(d_char *str)
  375. /* convert to lowercase */
  376. {
  377. int n;
  378. for (n = 0; str[n]; n++)
  379. str[n] = tolower(str[n]);
  380. return str;
  381. }
  382. /** lists **/
  383. d_char *xs_list_new(void)
  384. /* creates a new list */
  385. {
  386. d_char *list;
  387. list = xs_realloc(NULL, _xs_blk_size(5));
  388. list[0] = XSTYPE_LIST;
  389. list[4] = XSTYPE_EOL;
  390. _xs_put_24b(list + 1, 5);
  391. return list;
  392. }
  393. d_char *_xs_list_write_litem(d_char *list, int offset, const char *mem, int dsz)
  394. /* writes a list item */
  395. {
  396. char c = XSTYPE_LITEM;
  397. list = xs_insert_m(list, offset, &c, 1);
  398. list = xs_insert_m(list, offset + 1, mem, dsz);
  399. return list;
  400. }
  401. d_char *xs_list_append_m(d_char *list, const char *mem, int dsz)
  402. /* adds a memory block to the list */
  403. {
  404. return _xs_list_write_litem(list, xs_size(list) - 1, mem, dsz);
  405. }
  406. int xs_list_iter(char **list, char **value)
  407. /* iterates a list value */
  408. {
  409. int goon = 1;
  410. char *p;
  411. if (list == NULL || *list == NULL)
  412. return 0;
  413. p = *list;
  414. /* skip the start of the list */
  415. if (*p == XSTYPE_LIST)
  416. p += 4;
  417. /* an element? */
  418. if (*p == XSTYPE_LITEM) {
  419. p++;
  420. *value = p;
  421. p += xs_size(*value);
  422. }
  423. else {
  424. /* end of list */
  425. p++;
  426. goon = 0;
  427. }
  428. /* store back the pointer */
  429. *list = p;
  430. return goon;
  431. }
  432. int xs_list_len(char *list)
  433. /* returns the number of elements in the list */
  434. {
  435. int c = 0;
  436. char *v;
  437. while (xs_list_iter(&list, &v))
  438. c++;
  439. return c;
  440. }
  441. char *xs_list_get(char *list, int num)
  442. /* returns the element #num */
  443. {
  444. char *v;
  445. int c = 0;
  446. if (num < 0)
  447. num = xs_list_len(list) + num;
  448. while (xs_list_iter(&list, &v)) {
  449. if (c == num)
  450. return v;
  451. c++;
  452. }
  453. return NULL;
  454. }
  455. d_char *xs_list_del(d_char *list, int num)
  456. /* deletes element #num */
  457. {
  458. char *v;
  459. if ((v = xs_list_get(list, num)) != NULL)
  460. list = xs_collapse(list, v - 1 - list, xs_size(v - 1));
  461. return list;
  462. }
  463. d_char *xs_list_insert(d_char *list, int num, const char *data)
  464. /* inserts an element at #num position */
  465. {
  466. char *v;
  467. int offset;
  468. if ((v = xs_list_get(list, num)) != NULL)
  469. offset = v - list;
  470. else
  471. offset = xs_size(list);
  472. return _xs_list_write_litem(list, offset - 1, data, xs_size(data));
  473. }
  474. d_char *xs_list_insert_sorted(d_char *list, const char *str)
  475. /* inserts a string in the list in its ordered position */
  476. {
  477. char *p, *v;
  478. int offset = xs_size(list);
  479. p = list;
  480. while (xs_list_iter(&p, &v)) {
  481. /* if this element is greater or equal, insert here */
  482. if (strcmp(v, str) >= 0) {
  483. offset = v - list;
  484. break;
  485. }
  486. }
  487. return _xs_list_write_litem(list, offset - 1, str, xs_size(str));
  488. }
  489. d_char *xs_list_set(d_char *list, int num, const char *data)
  490. /* sets the element at #num position */
  491. {
  492. list = xs_list_del(list, num);
  493. list = xs_list_insert(list, num, data);
  494. return list;
  495. }
  496. d_char *xs_list_pop(d_char *list, char **data)
  497. /* pops the last element from the list */
  498. {
  499. char *p = list, *v = NULL;
  500. /* iterate to the end */
  501. while (xs_list_iter(&p, &v));
  502. if (v != NULL) {
  503. *data = xs_dup(v);
  504. /* collapse from the address of the element */
  505. list = xs_collapse(list, v - 1 - list, xs_size(v - 1));
  506. }
  507. return list;
  508. }
  509. int xs_list_in(char *list, const char *val)
  510. /* returns the position of val in list or -1 */
  511. {
  512. int n = 0;
  513. char *v;
  514. int sz = xs_size(val);
  515. while (xs_list_iter(&list, &v)) {
  516. if (sz == xs_size(v) && memcmp(val, v, sz) == 0)
  517. return n;
  518. n++;
  519. }
  520. return -1;
  521. }
  522. d_char *xs_join(char *list, const char *sep)
  523. /* joins a list into a string */
  524. {
  525. d_char *s = NULL;
  526. char *v;
  527. int c = 0;
  528. int offset = 0;
  529. int ssz = strlen(sep);
  530. while (xs_list_iter(&list, &v)) {
  531. /* refuse to join non-string values */
  532. if (xs_type(v) == XSTYPE_STRING) {
  533. int sz;
  534. /* add the separator */
  535. if (c != 0) {
  536. s = xs_realloc(s, offset + ssz);
  537. memcpy(s + offset, sep, ssz);
  538. offset += ssz;
  539. }
  540. /* add the element */
  541. sz = strlen(v);
  542. s = xs_realloc(s, offset + sz);
  543. memcpy(s + offset, v, sz);
  544. offset += sz;
  545. c++;
  546. }
  547. }
  548. /* null-terminate */
  549. s = xs_realloc(s, _xs_blk_size(offset + 1));
  550. s[offset] = '\0';
  551. return s;
  552. }
  553. d_char *xs_split_n(const char *str, const char *sep, int times)
  554. /* splits a string into a list upto n times */
  555. {
  556. int sz = strlen(sep);
  557. char *ss;
  558. d_char *list;
  559. list = xs_list_new();
  560. while (times > 0 && (ss = strstr(str, sep)) != NULL) {
  561. /* add the first part (without the asciiz) */
  562. list = xs_list_append_m(list, str, ss - str);
  563. /* add the asciiz */
  564. list = xs_str_cat(list, "");
  565. /* skip past the separator */
  566. str = ss + sz;
  567. times--;
  568. }
  569. /* add the rest of the string */
  570. list = xs_list_append(list, str);
  571. return list;
  572. }
  573. /** dicts **/
  574. d_char *xs_dict_new(void)
  575. /* creates a new dict */
  576. {
  577. d_char *dict;
  578. dict = xs_realloc(NULL, _xs_blk_size(5));
  579. dict[0] = XSTYPE_DICT;
  580. dict[4] = XSTYPE_EOD;
  581. _xs_put_24b(dict + 1, 5);
  582. return dict;
  583. }
  584. d_char *xs_dict_append_m(d_char *dict, const char *key, const char *mem, int dsz)
  585. /* adds a memory block to the dict */
  586. {
  587. char c = XSTYPE_DITEM;
  588. int sz = xs_size(dict);
  589. int ksz = xs_size(key);
  590. dict = xs_insert_m(dict, sz - 1, &c, 1);
  591. dict = xs_insert_m(dict, sz, key, ksz);
  592. dict = xs_insert_m(dict, sz + ksz, mem, dsz);
  593. return dict;
  594. }
  595. int xs_dict_iter(char **dict, char **key, char **value)
  596. /* iterates a dict value */
  597. {
  598. int goon = 1;
  599. char *p;
  600. if (dict == NULL || *dict == NULL)
  601. return 0;
  602. p = *dict;
  603. /* skip the start of the list */
  604. if (*p == XSTYPE_DICT)
  605. p += 4;
  606. /* an element? */
  607. if (*p == XSTYPE_DITEM) {
  608. p++;
  609. *key = p;
  610. p += xs_size(*key);
  611. *value = p;
  612. p += xs_size(*value);
  613. }
  614. else {
  615. /* end of list */
  616. p++;
  617. goon = 0;
  618. }
  619. /* store back the pointer */
  620. *dict = p;
  621. return goon;
  622. }
  623. char *xs_dict_get(char *dict, const char *key)
  624. /* returns the value directed by key */
  625. {
  626. char *k, *v;
  627. while (xs_dict_iter(&dict, &k, &v)) {
  628. if (strcmp(k, key) == 0)
  629. return v;
  630. }
  631. return NULL;
  632. }
  633. d_char *xs_dict_del(d_char *dict, const char *key)
  634. /* deletes a key */
  635. {
  636. char *k, *v;
  637. char *p = dict;
  638. while (xs_dict_iter(&p, &k, &v)) {
  639. if (strcmp(k, key) == 0) {
  640. /* the address of the item is just behind the key */
  641. char *i = k - 1;
  642. dict = xs_collapse(dict, i - dict, xs_size(i));
  643. break;
  644. }
  645. }
  646. return dict;
  647. }
  648. d_char *xs_dict_set(d_char *dict, const char *key, const char *data)
  649. /* sets (replaces) a key */
  650. {
  651. /* delete the possibly existing key */
  652. dict = xs_dict_del(dict, key);
  653. /* append the data */
  654. dict = xs_dict_append(dict, key, data);
  655. return dict;
  656. }
  657. /** other values **/
  658. d_char *xs_val_new(xstype t)
  659. /* adds a new special value */
  660. {
  661. d_char *v = xs_realloc(NULL, _xs_blk_size(1));
  662. v[0] = t;
  663. return v;
  664. }
  665. /** numbers */
  666. d_char *xs_number_new(double f)
  667. /* adds a new number value */
  668. {
  669. d_char *v;
  670. char tmp[64];
  671. snprintf(tmp, sizeof(tmp), "%.15lf", f);
  672. /* strip useless zeros */
  673. if (strchr(tmp, '.') != NULL) {
  674. char *ptr;
  675. for (ptr = tmp + strlen(tmp) - 1; *ptr == '0'; ptr--);
  676. if (*ptr != '.')
  677. ptr++;
  678. *ptr = '\0';
  679. }
  680. /* alloc for the marker and the full string */
  681. v = xs_realloc(NULL, _xs_blk_size(1 + xs_size(tmp)));
  682. v[0] = XSTYPE_NUMBER;
  683. memcpy(&v[1], tmp, xs_size(tmp));
  684. return v;
  685. }
  686. double xs_number_get(const char *v)
  687. /* gets the number as a double */
  688. {
  689. double f = 0.0;
  690. if (v != NULL && v[0] == XSTYPE_NUMBER)
  691. f = atof(&v[1]);
  692. return f;
  693. }
  694. const char *xs_number_str(const char *v)
  695. /* gets the number as a string */
  696. {
  697. const char *p = NULL;
  698. if (v != NULL && v[0] == XSTYPE_NUMBER)
  699. p = &v[1];
  700. return p;
  701. }
  702. void *xs_memmem(const char *haystack, int h_size, const char *needle, int n_size)
  703. /* clone of memmem */
  704. {
  705. char *p, *r = NULL;
  706. int offset = 0;
  707. while (!r && h_size - offset > n_size &&
  708. (p = memchr(haystack + offset, *needle, h_size - offset))) {
  709. if (memcmp(p, needle, n_size) == 0)
  710. r = p;
  711. else
  712. offset = p - haystack + 1;
  713. }
  714. return r;
  715. }
  716. #endif /* XS_IMPLEMENTATION */
  717. #endif /* _XS_H */