xs.h 24 KB

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