xs.h 24 KB

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