xs.h 25 KB

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