xs.h 28 KB

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