xs.h 28 KB

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