xs.h 27 KB

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