xs.h 22 KB

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