xs.h 27 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243
  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_starts_and_ends(const char *prefix, const char *str, const char *suffix);
  64. #define xs_startswith(str, prefix) xs_starts_and_ends(prefix, str, NULL)
  65. #define xs_endswith(str, suffix) xs_starts_and_ends(NULL, str, suffix)
  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, strlen(str), suffix, strlen(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. int diff = stsz - sfsz;
  352. char *ss;
  353. int offset = 0;
  354. while (times > 0 && (ss = strstr(str + offset, sfrom)) != NULL) {
  355. int n_offset = ss - str;
  356. if (diff < 0)
  357. str = xs_collapse(str, n_offset, -diff);
  358. else
  359. if (diff > 0)
  360. str = xs_expand(str, n_offset, diff);
  361. memcpy(str + n_offset, sto, stsz);
  362. offset = n_offset + stsz;
  363. times--;
  364. }
  365. return str;
  366. }
  367. xs_str *xs_fmt(const char *fmt, ...)
  368. /* formats a string with printf()-like marks */
  369. {
  370. int n;
  371. xs_str *s = NULL;
  372. va_list ap;
  373. va_start(ap, fmt);
  374. n = vsnprintf(s, 0, fmt, ap);
  375. va_end(ap);
  376. if (n > 0) {
  377. s = xs_realloc(NULL, _xs_blk_size(n + 1));
  378. va_start(ap, fmt);
  379. vsnprintf(s, n + 1, fmt, ap);
  380. va_end(ap);
  381. }
  382. return s;
  383. }
  384. int xs_str_in(const char *haystack, const char *needle)
  385. /* finds needle in haystack and returns the offset or -1 */
  386. {
  387. char *s;
  388. int r = -1;
  389. if ((s = strstr(haystack, needle)) != NULL)
  390. r = s - haystack;
  391. return r;
  392. }
  393. int xs_starts_and_ends(const char *prefix, const char *str, const char *suffix)
  394. /* returns true if str starts with prefix and ends with suffix */
  395. {
  396. int sz = strlen(str);
  397. int psz = prefix ? strlen(prefix) : 0;
  398. int ssz = suffix ? strlen(suffix) : 0;
  399. if (sz < psz || sz < ssz)
  400. return 0;
  401. if (prefix && memcmp(str, prefix, psz) != 0)
  402. return 0;
  403. if (suffix && memcmp(str + sz - ssz, suffix, ssz) != 0)
  404. return 0;
  405. return 1;
  406. }
  407. xs_str *xs_crop_i(xs_str *str, int start, int end)
  408. /* crops the d_char to be only from start to end */
  409. {
  410. XS_ASSERT_TYPE(str, XSTYPE_STRING);
  411. int sz = strlen(str);
  412. if (end <= 0)
  413. end = sz + end;
  414. /* crop from the top */
  415. str[end] = '\0';
  416. /* crop from the bottom */
  417. str = xs_collapse(str, 0, start);
  418. return str;
  419. }
  420. xs_str *xs_strip_chars_i(xs_str *str, const char *chars)
  421. /* strips the string of chars from the start and the end */
  422. {
  423. XS_ASSERT_TYPE(str, XSTYPE_STRING);
  424. int n;
  425. /* strip first from the end */
  426. for (n = strlen(str); n > 0 && strchr(chars, str[n - 1]); n--);
  427. str[n] = '\0';
  428. if (str[0]) {
  429. /* now strip from the beginning */
  430. for (n = 0; str[n] && strchr(chars, str[n]); n++);
  431. if (n)
  432. str = xs_collapse(str, 0, n);
  433. }
  434. return str;
  435. }
  436. xs_str *xs_tolower_i(xs_str *str)
  437. /* convert to lowercase */
  438. {
  439. XS_ASSERT_TYPE(str, XSTYPE_STRING);
  440. int n;
  441. for (n = 0; str[n]; n++)
  442. str[n] = tolower(str[n]);
  443. return str;
  444. }
  445. /** lists **/
  446. xs_list *xs_list_new(void)
  447. /* creates a new list */
  448. {
  449. return memcpy(
  450. xs_realloc(NULL, _xs_blk_size(sizeof(xs_stock_list))),
  451. xs_stock_list, sizeof(xs_stock_list)
  452. );
  453. }
  454. xs_list *_xs_list_write_litem(xs_list *list, int offset, const char *mem, int dsz)
  455. /* writes a list item */
  456. {
  457. XS_ASSERT_TYPE(list, XSTYPE_LIST);
  458. if (mem == NULL) {
  459. mem = xs_stock_null;
  460. dsz = sizeof(xs_stock_null);
  461. }
  462. list = xs_expand(list, offset, dsz + 1);
  463. list[offset] = XSTYPE_LITEM;
  464. memcpy(list + offset + 1, mem, dsz);
  465. return list;
  466. }
  467. xs_list *xs_list_append_m(xs_list *list, const char *mem, int dsz)
  468. /* adds a memory block to the list */
  469. {
  470. XS_ASSERT_TYPE(list, XSTYPE_LIST);
  471. return _xs_list_write_litem(list, xs_size(list) - 1, mem, dsz);
  472. }
  473. int xs_list_iter(xs_list **list, xs_val **value)
  474. /* iterates a list value */
  475. {
  476. int goon = 1;
  477. xs_val *p = *list;
  478. /* skip the start of the list */
  479. if (xs_type(p) == XSTYPE_LIST)
  480. p += 4;
  481. /* an element? */
  482. if (xs_type(p) == XSTYPE_LITEM) {
  483. p++;
  484. *value = p;
  485. p += xs_size(*value);
  486. }
  487. else {
  488. /* end of list */
  489. goon = 0;
  490. }
  491. /* store back the pointer */
  492. *list = p;
  493. return goon;
  494. }
  495. int xs_list_len(const xs_list *list)
  496. /* returns the number of elements in the list */
  497. {
  498. XS_ASSERT_TYPE_NULL(list, XSTYPE_LIST);
  499. int c = 0;
  500. xs_list *p = (xs_list *)list;
  501. xs_val *v;
  502. while (xs_list_iter(&p, &v))
  503. c++;
  504. return c;
  505. }
  506. xs_val *xs_list_get(const xs_list *list, int num)
  507. /* returns the element #num */
  508. {
  509. XS_ASSERT_TYPE(list, XSTYPE_LIST);
  510. if (num < 0)
  511. num = xs_list_len(list) + num;
  512. int c = 0;
  513. xs_list *p = (xs_list *)list;
  514. xs_val *v;
  515. while (xs_list_iter(&p, &v)) {
  516. if (c == num)
  517. return v;
  518. c++;
  519. }
  520. return NULL;
  521. }
  522. xs_list *xs_list_del(xs_list *list, int num)
  523. /* deletes element #num */
  524. {
  525. XS_ASSERT_TYPE(list, XSTYPE_LIST);
  526. xs_val *v;
  527. if ((v = xs_list_get(list, num)) != NULL)
  528. list = xs_collapse(list, v - 1 - list, xs_size(v - 1));
  529. return list;
  530. }
  531. xs_list *xs_list_insert(xs_list *list, int num, const xs_val *data)
  532. /* inserts an element at #num position */
  533. {
  534. XS_ASSERT_TYPE(list, XSTYPE_LIST);
  535. xs_val *v;
  536. int offset;
  537. if ((v = xs_list_get(list, num)) != NULL)
  538. offset = v - list;
  539. else
  540. offset = xs_size(list);
  541. return _xs_list_write_litem(list, offset - 1, data, xs_size(data));
  542. }
  543. xs_list *xs_list_insert_sorted(xs_list *list, const xs_str *str)
  544. /* inserts a string in the list in its ordered position */
  545. {
  546. XS_ASSERT_TYPE(list, XSTYPE_LIST);
  547. XS_ASSERT_TYPE(str, XSTYPE_STRING);
  548. char *p, *v;
  549. int offset = xs_size(list);
  550. p = list;
  551. while (xs_list_iter(&p, &v)) {
  552. /* if this element is greater or equal, insert here */
  553. if (strcmp(v, str) >= 0) {
  554. offset = v - list;
  555. break;
  556. }
  557. }
  558. return _xs_list_write_litem(list, offset - 1, str, xs_size(str));
  559. }
  560. xs_list *xs_list_set(xs_list *list, int num, const xs_val *data)
  561. /* sets the element at #num position */
  562. {
  563. XS_ASSERT_TYPE(list, XSTYPE_LIST);
  564. list = xs_list_del(list, num);
  565. list = xs_list_insert(list, num, data);
  566. return list;
  567. }
  568. xs_list *xs_list_dequeue(xs_list *list, xs_val **data, int last)
  569. /* gets a copy of the first or last element of a list, shrinking it */
  570. {
  571. XS_ASSERT_TYPE(list, XSTYPE_LIST);
  572. xs_list *p = list;
  573. xs_val *v = NULL;
  574. if (!last) {
  575. /* get the first */
  576. xs_list_iter(&p, &v);
  577. }
  578. else {
  579. /* iterate to the end */
  580. while (xs_list_iter(&p, &v));
  581. }
  582. if (v != NULL) {
  583. *data = xs_dup(v);
  584. /* collapse from the address of the element */
  585. list = xs_collapse(list, v - 1 - list, xs_size(v - 1));
  586. }
  587. return list;
  588. }
  589. int xs_list_in(const xs_list *list, const xs_val *val)
  590. /* returns the position of val in list or -1 */
  591. {
  592. XS_ASSERT_TYPE_NULL(list, XSTYPE_LIST);
  593. int n = 0;
  594. xs_list *p = (xs_list *)list;
  595. xs_val *v;
  596. int sz = xs_size(val);
  597. while (xs_list_iter(&p, &v)) {
  598. if (sz == xs_size(v) && memcmp(val, v, sz) == 0)
  599. return n;
  600. n++;
  601. }
  602. return -1;
  603. }
  604. xs_str *xs_join(const xs_list *list, const char *sep)
  605. /* joins a list into a string */
  606. {
  607. XS_ASSERT_TYPE(list, XSTYPE_LIST);
  608. xs_str *s = NULL;
  609. xs_list *p = (xs_list *)list;
  610. xs_val *v;
  611. int c = 0;
  612. int offset = 0;
  613. int ssz = strlen(sep);
  614. while (xs_list_iter(&p, &v)) {
  615. /* refuse to join non-string values */
  616. if (xs_type(v) == XSTYPE_STRING) {
  617. int sz;
  618. /* add the separator */
  619. if (c != 0) {
  620. s = xs_realloc(s, offset + ssz);
  621. memcpy(s + offset, sep, ssz);
  622. offset += ssz;
  623. }
  624. /* add the element */
  625. sz = strlen(v);
  626. s = xs_realloc(s, offset + sz);
  627. memcpy(s + offset, v, sz);
  628. offset += sz;
  629. c++;
  630. }
  631. }
  632. /* null-terminate */
  633. s = xs_realloc(s, _xs_blk_size(offset + 1));
  634. s[offset] = '\0';
  635. return s;
  636. }
  637. xs_list *xs_split_n(const char *str, const char *sep, int times)
  638. /* splits a string into a list upto n times */
  639. {
  640. int sz = strlen(sep);
  641. char *ss;
  642. xs_list *list;
  643. list = xs_list_new();
  644. while (times > 0 && (ss = strstr(str, sep)) != NULL) {
  645. /* add the first part (without the asciiz) */
  646. list = xs_list_append_m(list, str, ss - str);
  647. /* add the asciiz */
  648. list = xs_insert_m(list, xs_size(list) - 1, "", 1);
  649. /* skip past the separator */
  650. str = ss + sz;
  651. times--;
  652. }
  653. /* add the rest of the string */
  654. list = xs_list_append(list, str);
  655. return list;
  656. }
  657. xs_list *xs_list_cat(xs_list *l1, const xs_list *l2)
  658. /* concatenates list l2 to l1 */
  659. {
  660. XS_ASSERT_TYPE(l1, XSTYPE_LIST);
  661. XS_ASSERT_TYPE(l2, XSTYPE_LIST);
  662. /* inserts at the end of l1 the content of l2 (skipping header and footer) */
  663. return xs_insert_m(l1, xs_size(l1) - 1, l2 + 4, xs_size(l2) - 5);
  664. }
  665. /** dicts **/
  666. xs_dict *xs_dict_new(void)
  667. /* creates a new dict */
  668. {
  669. return memcpy(
  670. xs_realloc(NULL, _xs_blk_size(sizeof(xs_stock_dict))),
  671. xs_stock_dict, sizeof(xs_stock_dict)
  672. );
  673. }
  674. xs_dict *_xs_dict_write_ditem(xs_dict *dict, int offset, const xs_str *key,
  675. const xs_val *data, int dsz)
  676. /* inserts a memory block into the dict */
  677. {
  678. XS_ASSERT_TYPE(dict, XSTYPE_DICT);
  679. XS_ASSERT_TYPE(key, XSTYPE_STRING);
  680. if (data == NULL) {
  681. data = xs_stock_null;
  682. dsz = sizeof(xs_stock_null);
  683. }
  684. int ksz = xs_size(key);
  685. dict = xs_expand(dict, offset, 1 + ksz + dsz);
  686. dict[offset] = XSTYPE_DITEM;
  687. memcpy(&dict[offset + 1], key, ksz);
  688. memcpy(&dict[offset + 1 + ksz], data, dsz);
  689. return dict;
  690. }
  691. xs_dict *xs_dict_append_m(xs_dict *dict, const xs_str *key, const xs_val *mem, int dsz)
  692. /* appends a memory block to the dict */
  693. {
  694. return _xs_dict_write_ditem(dict, xs_size(dict) - 1, key, mem, dsz);
  695. }
  696. xs_dict *xs_dict_prepend_m(xs_dict *dict, const xs_str *key, const xs_val *mem, int dsz)
  697. /* prepends a memory block to the dict */
  698. {
  699. return _xs_dict_write_ditem(dict, 4, key, mem, dsz);
  700. }
  701. int xs_dict_iter(xs_dict **dict, xs_str **key, xs_val **value)
  702. /* iterates a dict value */
  703. {
  704. int goon = 1;
  705. xs_val *p = *dict;
  706. /* skip the start of the list */
  707. if (xs_type(p) == XSTYPE_DICT)
  708. p += 4;
  709. /* an element? */
  710. if (xs_type(p) == XSTYPE_DITEM) {
  711. p++;
  712. *key = p;
  713. p += xs_size(*key);
  714. *value = p;
  715. p += xs_size(*value);
  716. }
  717. else {
  718. /* end of list */
  719. goon = 0;
  720. }
  721. /* store back the pointer */
  722. *dict = p;
  723. return goon;
  724. }
  725. xs_val *xs_dict_get(const xs_dict *dict, const xs_str *key)
  726. /* returns the value directed by key */
  727. {
  728. XS_ASSERT_TYPE(dict, XSTYPE_DICT);
  729. XS_ASSERT_TYPE(key, XSTYPE_STRING);
  730. xs_dict *p = (xs_dict *)dict;
  731. xs_str *k;
  732. xs_val *v;
  733. while (xs_dict_iter(&p, &k, &v)) {
  734. if (strcmp(k, key) == 0)
  735. return v;
  736. }
  737. return NULL;
  738. }
  739. xs_dict *xs_dict_del(xs_dict *dict, const xs_str *key)
  740. /* deletes a key */
  741. {
  742. XS_ASSERT_TYPE(dict, XSTYPE_DICT);
  743. XS_ASSERT_TYPE(key, XSTYPE_STRING);
  744. xs_str *k;
  745. xs_val *v;
  746. xs_dict *p = dict;
  747. while (xs_dict_iter(&p, &k, &v)) {
  748. if (strcmp(k, key) == 0) {
  749. /* the address of the item is just behind the key */
  750. char *i = k - 1;
  751. dict = xs_collapse(dict, i - dict, xs_size(i));
  752. break;
  753. }
  754. }
  755. return dict;
  756. }
  757. xs_dict *xs_dict_set(xs_dict *dict, const xs_str *key, const xs_val *data)
  758. /* sets (replaces) a key */
  759. {
  760. XS_ASSERT_TYPE(dict, XSTYPE_DICT);
  761. XS_ASSERT_TYPE(key, XSTYPE_STRING);
  762. /* delete the possibly existing key */
  763. dict = xs_dict_del(dict, key);
  764. /* add the data */
  765. dict = xs_dict_append(dict, key, data);
  766. return dict;
  767. }
  768. /** other values **/
  769. xs_val *xs_val_new(xstype t)
  770. /* adds a new special value */
  771. {
  772. xs_val *v = xs_realloc(NULL, _xs_blk_size(1));
  773. v[0] = t;
  774. return v;
  775. }
  776. /** numbers */
  777. xs_number *xs_number_new(double f)
  778. /* adds a new number value */
  779. {
  780. xs_number *v;
  781. char tmp[64];
  782. snprintf(tmp, sizeof(tmp), "%.15lf", f);
  783. /* strip useless zeros */
  784. if (strchr(tmp, '.') != NULL) {
  785. char *ptr;
  786. for (ptr = tmp + strlen(tmp) - 1; *ptr == '0'; ptr--);
  787. if (*ptr != '.')
  788. ptr++;
  789. *ptr = '\0';
  790. }
  791. /* alloc for the marker and the full string */
  792. v = xs_realloc(NULL, _xs_blk_size(1 + xs_size(tmp)));
  793. v[0] = XSTYPE_NUMBER;
  794. memcpy(&v[1], tmp, xs_size(tmp));
  795. return v;
  796. }
  797. double xs_number_get(const xs_number *v)
  798. /* gets the number as a double */
  799. {
  800. double f = 0.0;
  801. if (v != NULL && v[0] == XSTYPE_NUMBER)
  802. f = atof(&v[1]);
  803. return f;
  804. }
  805. const char *xs_number_str(const xs_number *v)
  806. /* gets the number as a string */
  807. {
  808. const char *p = NULL;
  809. if (v != NULL && v[0] == XSTYPE_NUMBER)
  810. p = &v[1];
  811. return p;
  812. }
  813. /** raw data blocks **/
  814. xs_data *xs_data_new(const void *data, int size)
  815. /* returns a new raw data value */
  816. {
  817. xs_data *v;
  818. /* add the overhead (data type + 24bit size) */
  819. int total_size = size + 4;
  820. v = xs_realloc(NULL, _xs_blk_size(total_size));
  821. v[0] = XSTYPE_DATA;
  822. _xs_put_24b(v + 1, total_size);
  823. memcpy(&v[4], data, size);
  824. return v;
  825. }
  826. int xs_data_size(const xs_data *value)
  827. /* returns the size of the data stored inside value */
  828. {
  829. return _xs_get_24b(value + 1) - 4;
  830. }
  831. void xs_data_get(const xs_data *value, void *data)
  832. /* copies the raw data stored inside value into data */
  833. {
  834. int size = _xs_get_24b(value + 1) - 4;
  835. memcpy(data, &value[4], size);
  836. }
  837. void *xs_memmem(const char *haystack, int h_size, const char *needle, int n_size)
  838. /* clone of memmem */
  839. {
  840. char *p, *r = NULL;
  841. int offset = 0;
  842. while (!r && h_size - offset > n_size &&
  843. (p = memchr(haystack + offset, *needle, h_size - offset))) {
  844. if (memcmp(p, needle, n_size) == 0)
  845. r = p;
  846. else
  847. offset = p - haystack + 1;
  848. }
  849. return r;
  850. }
  851. /** hex **/
  852. xs_str *xs_hex_enc(const xs_val *data, int size)
  853. /* returns an hexdump of data */
  854. {
  855. xs_str *s;
  856. char *p;
  857. int n;
  858. p = s = xs_realloc(NULL, _xs_blk_size(size * 2 + 1));
  859. for (n = 0; n < size; n++) {
  860. snprintf(p, 3, "%02x", (unsigned char)data[n]);
  861. p += 2;
  862. }
  863. *p = '\0';
  864. return s;
  865. }
  866. xs_val *xs_hex_dec(const xs_str *hex, int *size)
  867. /* decodes an hexdump into data */
  868. {
  869. int sz = strlen(hex);
  870. xs_val *s = NULL;
  871. char *p;
  872. int n;
  873. if (sz % 2)
  874. return NULL;
  875. p = s = xs_realloc(NULL, _xs_blk_size(sz / 2 + 1));
  876. for (n = 0; n < sz; n += 2) {
  877. int i;
  878. if (sscanf(&hex[n], "%02x", &i) == 0) {
  879. /* decoding error */
  880. return xs_free(s);
  881. }
  882. else
  883. *p = i;
  884. p++;
  885. }
  886. *p = '\0';
  887. *size = sz / 2;
  888. return s;
  889. }
  890. int xs_is_hex(const char *str)
  891. /* returns 1 if str is an hex string */
  892. {
  893. while (*str) {
  894. if (strchr("0123456789abcdefABCDEF", *str++) == NULL)
  895. return 0;
  896. }
  897. return 1;
  898. }
  899. unsigned int xs_hash_func(const char *data, int size)
  900. /* a general purpose hashing function */
  901. {
  902. unsigned int hash = 0x666;
  903. int n;
  904. for (n = 0; n < size; n++) {
  905. hash ^= data[n];
  906. hash *= 111111111;
  907. }
  908. return hash ^ hash >> 16;
  909. }
  910. #endif /* XS_IMPLEMENTATION */
  911. #endif /* _XS_H */