xs.h 25 KB

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