xs.h 27 KB

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