xs.h 26 KB

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