xs.h 27 KB

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