xs.h 26 KB

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