xs.h 19 KB

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