xs.h 27 KB

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