xs.h 27 KB

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