xs.h 19 KB

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