xs.h 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949
  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 s, e;
  352. for (s = 0; strchr(chars, str[s]); s++);
  353. for (e = strlen(str); e > 0 && strchr(chars, str[e - 1]); e--);
  354. str[e] = '\0';
  355. return xs_collapse(str, 0, s);
  356. }
  357. d_char *xs_tolower(d_char *str)
  358. /* convert to lowercase */
  359. {
  360. int n;
  361. for (n = 0; str[n]; n++)
  362. str[n] = tolower(str[n]);
  363. return str;
  364. }
  365. /** lists **/
  366. d_char *xs_list_new(void)
  367. /* creates a new list */
  368. {
  369. d_char *list;
  370. list = xs_realloc(NULL, _xs_blk_size(5));
  371. list[0] = XSTYPE_LIST;
  372. list[4] = XSTYPE_EOL;
  373. _xs_put_24b(list + 1, 5);
  374. return list;
  375. }
  376. d_char *_xs_list_write_litem(d_char *list, int offset, const char *mem, int dsz)
  377. /* writes a list item */
  378. {
  379. char c = XSTYPE_LITEM;
  380. list = xs_insert_m(list, offset, &c, 1);
  381. list = xs_insert_m(list, offset + 1, mem, dsz);
  382. return list;
  383. }
  384. d_char *xs_list_append_m(d_char *list, const char *mem, int dsz)
  385. /* adds a memory block to the list */
  386. {
  387. return _xs_list_write_litem(list, xs_size(list) - 1, mem, dsz);
  388. }
  389. int xs_list_iter(char **list, char **value)
  390. /* iterates a list value */
  391. {
  392. int goon = 1;
  393. char *p;
  394. if (list == NULL || *list == NULL)
  395. return 0;
  396. p = *list;
  397. /* skip the start of the list */
  398. if (*p == XSTYPE_LIST)
  399. p += 4;
  400. /* an element? */
  401. if (*p == XSTYPE_LITEM) {
  402. p++;
  403. *value = p;
  404. p += xs_size(*value);
  405. }
  406. else {
  407. /* end of list */
  408. p++;
  409. goon = 0;
  410. }
  411. /* store back the pointer */
  412. *list = p;
  413. return goon;
  414. }
  415. int xs_list_len(char *list)
  416. /* returns the number of elements in the list */
  417. {
  418. int c = 0;
  419. char *v;
  420. while (xs_list_iter(&list, &v))
  421. c++;
  422. return c;
  423. }
  424. char *xs_list_get(char *list, int num)
  425. /* returns the element #num */
  426. {
  427. char *v;
  428. int c = 0;
  429. if (num < 0)
  430. num = xs_list_len(list) + num;
  431. while (xs_list_iter(&list, &v)) {
  432. if (c == num)
  433. return v;
  434. c++;
  435. }
  436. return NULL;
  437. }
  438. d_char *xs_list_del(d_char *list, int num)
  439. /* deletes element #num */
  440. {
  441. char *v;
  442. if ((v = xs_list_get(list, num)) != NULL)
  443. list = xs_collapse(list, v - 1 - list, xs_size(v - 1));
  444. return list;
  445. }
  446. d_char *xs_list_insert(d_char *list, int num, const char *data)
  447. /* inserts an element at #num position */
  448. {
  449. char *v;
  450. int offset;
  451. if ((v = xs_list_get(list, num)) != NULL)
  452. offset = v - list;
  453. else
  454. offset = xs_size(list);
  455. return _xs_list_write_litem(list, offset - 1, data, xs_size(data));
  456. }
  457. d_char *xs_list_insert_sorted(d_char *list, const char *str)
  458. /* inserts a string in the list in its ordered position */
  459. {
  460. char *p, *v;
  461. int offset = xs_size(list);
  462. p = list;
  463. while (xs_list_iter(&p, &v)) {
  464. /* if this element is greater or equal, insert here */
  465. if (strcmp(v, str) >= 0) {
  466. offset = v - list;
  467. break;
  468. }
  469. }
  470. return _xs_list_write_litem(list, offset - 1, str, xs_size(str));
  471. }
  472. d_char *xs_list_set(d_char *list, int num, const char *data)
  473. /* sets the element at #num position */
  474. {
  475. list = xs_list_del(list, num);
  476. list = xs_list_insert(list, num, data);
  477. return list;
  478. }
  479. d_char *xs_list_pop(d_char *list, char **data)
  480. /* pops the last element from the list */
  481. {
  482. if ((*data = xs_list_get(list, -1)) != NULL) {
  483. *data = xs_dup(*data);
  484. list = xs_list_del(list, -1);
  485. }
  486. return list;
  487. }
  488. int xs_list_in(char *list, const char *val)
  489. /* returns the position of val in list or -1 */
  490. {
  491. int n = 0;
  492. char *v;
  493. int sz = xs_size(val);
  494. while (xs_list_iter(&list, &v)) {
  495. if (sz == xs_size(v) && memcmp(val, v, sz) == 0)
  496. return n;
  497. n++;
  498. }
  499. return -1;
  500. }
  501. d_char *xs_join(char *list, const char *sep)
  502. /* joins a list into a string */
  503. {
  504. d_char *s = NULL;
  505. char *v;
  506. int c = 0;
  507. int offset = 0;
  508. int ssz = strlen(sep);
  509. while (xs_list_iter(&list, &v)) {
  510. /* refuse to join non-string values */
  511. if (xs_type(v) == XSTYPE_STRING) {
  512. int sz;
  513. /* add the separator */
  514. if (c != 0) {
  515. s = xs_realloc(s, offset + ssz);
  516. memcpy(s + offset, sep, ssz);
  517. offset += ssz;
  518. }
  519. /* add the element */
  520. sz = strlen(v);
  521. s = xs_realloc(s, offset + sz);
  522. memcpy(s + offset, v, sz);
  523. offset += sz;
  524. c++;
  525. }
  526. }
  527. /* null-terminate */
  528. s = xs_realloc(s, _xs_blk_size(offset + 1));
  529. s[offset] = '\0';
  530. return s;
  531. }
  532. d_char *xs_split_n(const char *str, const char *sep, int times)
  533. /* splits a string into a list upto n times */
  534. {
  535. int sz = strlen(sep);
  536. char *ss;
  537. d_char *list;
  538. list = xs_list_new();
  539. while (times > 0 && (ss = strstr(str, sep)) != NULL) {
  540. /* add the first part (without the asciiz) */
  541. list = xs_list_append_m(list, str, ss - str);
  542. /* add the asciiz */
  543. list = xs_str_cat(list, "");
  544. /* skip past the separator */
  545. str = ss + sz;
  546. times--;
  547. }
  548. /* add the rest of the string */
  549. list = xs_list_append(list, str);
  550. return list;
  551. }
  552. /** dicts **/
  553. d_char *xs_dict_new(void)
  554. /* creates a new dict */
  555. {
  556. d_char *dict;
  557. dict = xs_realloc(NULL, _xs_blk_size(5));
  558. dict[0] = XSTYPE_DICT;
  559. dict[4] = XSTYPE_EOD;
  560. _xs_put_24b(dict + 1, 5);
  561. return dict;
  562. }
  563. d_char *xs_dict_append_m(d_char *dict, const char *key, const char *mem, int dsz)
  564. /* adds a memory block to the dict */
  565. {
  566. char c = XSTYPE_DITEM;
  567. int sz = xs_size(dict);
  568. int ksz = xs_size(key);
  569. dict = xs_insert_m(dict, sz - 1, &c, 1);
  570. dict = xs_insert_m(dict, sz, key, ksz);
  571. dict = xs_insert_m(dict, sz + ksz, mem, dsz);
  572. return dict;
  573. }
  574. int xs_dict_iter(char **dict, char **key, char **value)
  575. /* iterates a dict value */
  576. {
  577. int goon = 1;
  578. char *p;
  579. if (dict == NULL || *dict == NULL)
  580. return 0;
  581. p = *dict;
  582. /* skip the start of the list */
  583. if (*p == XSTYPE_DICT)
  584. p += 4;
  585. /* an element? */
  586. if (*p == XSTYPE_DITEM) {
  587. p++;
  588. *key = p;
  589. p += xs_size(*key);
  590. *value = p;
  591. p += xs_size(*value);
  592. }
  593. else {
  594. /* end of list */
  595. p++;
  596. goon = 0;
  597. }
  598. /* store back the pointer */
  599. *dict = p;
  600. return goon;
  601. }
  602. char *xs_dict_get(char *dict, const char *key)
  603. /* returns the value directed by key */
  604. {
  605. char *k, *v;
  606. while (xs_dict_iter(&dict, &k, &v)) {
  607. if (strcmp(k, key) == 0)
  608. return v;
  609. }
  610. return NULL;
  611. }
  612. d_char *xs_dict_del(d_char *dict, const char *key)
  613. /* deletes a key */
  614. {
  615. char *k, *v;
  616. char *p = dict;
  617. while (xs_dict_iter(&p, &k, &v)) {
  618. if (strcmp(k, key) == 0) {
  619. /* the address of the item is just behind the key */
  620. char *i = k - 1;
  621. dict = xs_collapse(dict, i - dict, xs_size(i));
  622. break;
  623. }
  624. }
  625. return dict;
  626. }
  627. d_char *xs_dict_set(d_char *dict, const char *key, const char *data)
  628. /* sets (replaces) a key */
  629. {
  630. /* delete the possibly existing key */
  631. dict = xs_dict_del(dict, key);
  632. /* append the data */
  633. dict = xs_dict_append(dict, key, data);
  634. return dict;
  635. }
  636. /** other values **/
  637. d_char *xs_val_new(xstype t)
  638. /* adds a new special value */
  639. {
  640. d_char *v = xs_realloc(NULL, _xs_blk_size(1));
  641. v[0] = t;
  642. return v;
  643. }
  644. /** numbers */
  645. d_char *xs_number_new(double f)
  646. /* adds a new number value */
  647. {
  648. d_char *v;
  649. char tmp[64];
  650. snprintf(tmp, sizeof(tmp), "%.15lf", f);
  651. /* strip useless zeros */
  652. if (strchr(tmp, '.') != NULL) {
  653. char *ptr;
  654. for (ptr = tmp + strlen(tmp) - 1; *ptr == '0'; ptr--);
  655. if (*ptr != '.')
  656. ptr++;
  657. *ptr = '\0';
  658. }
  659. /* alloc for the marker and the full string */
  660. v = xs_realloc(NULL, _xs_blk_size(1 + xs_size(tmp)));
  661. v[0] = XSTYPE_NUMBER;
  662. memcpy(&v[1], tmp, xs_size(tmp));
  663. return v;
  664. }
  665. double xs_number_get(const char *v)
  666. /* gets the number as a double */
  667. {
  668. double f = 0.0;
  669. if (v != NULL && v[0] == XSTYPE_NUMBER)
  670. f = atof(&v[1]);
  671. return f;
  672. }
  673. const char *xs_number_str(const char *v)
  674. /* gets the number as a string */
  675. {
  676. const char *p = NULL;
  677. if (v != NULL && v[0] == XSTYPE_NUMBER)
  678. p = &v[1];
  679. return p;
  680. }
  681. void *xs_memmem(const char *haystack, int h_size, const char *needle, int n_size)
  682. /* clone of memmem */
  683. {
  684. char *p, *r = NULL;
  685. int offset = 0;
  686. while (!r && h_size - offset > n_size &&
  687. (p = memchr(haystack + offset, *needle, h_size - offset))) {
  688. if (memcmp(p, needle, n_size) == 0)
  689. r = p;
  690. else
  691. offset = p - haystack + 1;
  692. }
  693. return r;
  694. }
  695. #endif /* XS_IMPLEMENTATION */
  696. #endif /* _XS_H */