xs.h 26 KB

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