xs.h 27 KB

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