xs.h 19 KB

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