xs.h 26 KB

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