xs.h 18 KB

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