xs.h 34 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491
  1. /* copyright (c) 2022 - 2024 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 size) */
  19. XSTYPE_LITEM = 0x1f, /* Element of a list (any type) */
  20. XSTYPE_DICT = 0x1c, /* Sequence of KEYVALs up to EOM (with size) */
  21. XSTYPE_KEYVAL = 0x1e, /* key + value (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_keyval;
  30. typedef char xs_dict;
  31. typedef char xs_number;
  32. typedef char xs_data;
  33. /* size in bytes of the type size */
  34. #define _XS_TYPE_SIZE 4
  35. /* auto-destroyable strings */
  36. #define xs __attribute__ ((__cleanup__ (_xs_destroy))) xs_val
  37. /* not really all, just very much */
  38. #define XS_ALL 0xfffffff
  39. #ifndef xs_countof
  40. #define xs_countof(a) (sizeof((a)) / sizeof((*a)))
  41. #endif
  42. void *xs_free(void *ptr);
  43. void *_xs_realloc(void *ptr, size_t size, const char *file, int line, const char *func);
  44. #define xs_realloc(ptr, size) _xs_realloc(ptr, size, __FILE__, __LINE__, __func__)
  45. int _xs_blk_size(int sz);
  46. void _xs_destroy(char **var);
  47. #define xs_debug() raise(SIGTRAP)
  48. xstype xs_type(const xs_val *data);
  49. int xs_size(const xs_val *data);
  50. int xs_is_null(const xs_val *data);
  51. int xs_cmp(const xs_val *v1, const xs_val *v2);
  52. const xs_val *xs_or(const xs_val *v1, const xs_val *v2);
  53. xs_val *xs_dup(const xs_val *data);
  54. xs_val *xs_expand(xs_val *data, int offset, int size);
  55. xs_val *xs_collapse(xs_val *data, int offset, int size);
  56. xs_val *xs_insert_m(xs_val *data, int offset, const char *mem, int size);
  57. #define xs_insert(data, offset, data2) xs_insert_m(data, offset, data2, xs_size(data2))
  58. #define xs_append_m(data, mem, size) xs_insert_m(data, xs_size(data) - 1, mem, size)
  59. xs_val *xs_stock(int type);
  60. xs_str *xs_str_new(const char *str);
  61. xs_str *xs_str_new_sz(const char *mem, int sz);
  62. xs_str *xs_str_wrap_i(const char *prefix, xs_str *str, const char *suffix);
  63. #define xs_str_prepend_i(str, prefix) xs_str_wrap_i(prefix, str, NULL)
  64. xs_str *_xs_str_cat(xs_str *str, const char *strs[]);
  65. #define xs_str_cat(str, ...) _xs_str_cat(str, (const char *[]){ __VA_ARGS__, NULL })
  66. xs_str *xs_replace_in(xs_str *str, const char *sfrom, const char *sto, int times);
  67. #define xs_replace_i(str, sfrom, sto) xs_replace_in(str, sfrom, sto, XS_ALL)
  68. #define xs_replace(str, sfrom, sto) xs_replace_in(xs_dup(str), sfrom, sto, XS_ALL)
  69. #define xs_replace_n(str, sfrom, sto, times) xs_replace_in(xs_dup(str), sfrom, sto, times)
  70. xs_str *xs_fmt(const char *fmt, ...);
  71. int xs_str_in(const char *haystack, const char *needle);
  72. int xs_between(const char *prefix, const char *str, const char *suffix);
  73. #define xs_startswith(str, prefix) xs_between(prefix, str, NULL)
  74. #define xs_endswith(str, suffix) xs_between(NULL, str, suffix)
  75. xs_str *xs_crop_i(xs_str *str, int start, int end);
  76. xs_str *xs_lstrip_chars_i(xs_str *str, const char *chars);
  77. xs_str *xs_rstrip_chars_i(xs_str *str, const char *chars);
  78. xs_str *xs_strip_chars_i(xs_str *str, const char *chars);
  79. #define xs_strip_i(str) xs_strip_chars_i(str, " \r\n\t\v\f")
  80. xs_str *xs_tolower_i(xs_str *str);
  81. xs_list *xs_list_new(void);
  82. xs_list *xs_list_append_m(xs_list *list, const char *mem, int dsz);
  83. xs_list *_xs_list_append(xs_list *list, const xs_val *vals[]);
  84. #define xs_list_append(list, ...) _xs_list_append(list, (const xs_val *[]){ __VA_ARGS__, NULL })
  85. int xs_list_iter(xs_list **list, const xs_val **value);
  86. int xs_list_next(const xs_list *list, const xs_val **value, int *ctxt);
  87. int xs_list_len(const xs_list *list);
  88. const xs_val *xs_list_get(const xs_list *list, int num);
  89. xs_list *xs_list_del(xs_list *list, int num);
  90. xs_list *xs_list_insert(xs_list *list, int num, const xs_val *data);
  91. xs_list *xs_list_set(xs_list *list, int num, const xs_val *data);
  92. xs_list *xs_list_dequeue(xs_list *list, xs_val **data, int last);
  93. #define xs_list_pop(list, data) xs_list_dequeue(list, data, 1)
  94. #define xs_list_shift(list, data) xs_list_dequeue(list, data, 0)
  95. int xs_list_in(const xs_list *list, const xs_val *val);
  96. xs_str *xs_join(const xs_list *list, const char *sep);
  97. xs_list *xs_split_n(const char *str, const char *sep, int times);
  98. #define xs_split(str, sep) xs_split_n(str, sep, XS_ALL)
  99. xs_list *xs_list_cat(xs_list *l1, const xs_list *l2);
  100. int xs_keyval_size(const xs_str *key, const xs_val *value);
  101. xs_str *xs_keyval_key(const xs_keyval *keyval);
  102. xs_val *xs_keyval_value(const xs_keyval *keyval);
  103. xs_keyval *xs_keyval_make(xs_keyval *keyval, const xs_str *key, const xs_val *value);
  104. xs_dict *xs_dict_new(void);
  105. xs_dict *xs_dict_append(xs_dict *dict, const xs_str *key, const xs_val *value);
  106. xs_dict *xs_dict_prepend(xs_dict *dict, const xs_str *key, const xs_val *value);
  107. int xs_dict_next(const xs_dict *dict, const xs_str **key, const xs_val **value, int *ctxt);
  108. const xs_val *xs_dict_get(const xs_dict *dict, const xs_str *key);
  109. #define xs_dict_get_def(dict, key, def) xs_or(xs_dict_get(dict, key), def)
  110. xs_dict *xs_dict_del(xs_dict *dict, const xs_str *key);
  111. xs_dict *xs_dict_set(xs_dict *dict, const xs_str *key, const xs_val *data);
  112. xs_dict *xs_dict_gc(const xs_dict *dict);
  113. const xs_val *xs_dict_get_path_sep(const xs_dict *dict, const char *path, const char *sep);
  114. #define xs_dict_get_path(dict, path) xs_dict_get_path_sep(dict, path, ".")
  115. xs_dict *xs_dict_set_path_sep(xs_dict *dict, const char *path, const xs_val *value, const char *sep);
  116. #define xs_dict_set_path(dict, path, value) xs_dict_set_path_sep(dict, path, value, ".")
  117. xs_val *xs_val_new(xstype t);
  118. xs_number *xs_number_new(double f);
  119. double xs_number_get(const xs_number *v);
  120. const char *xs_number_str(const xs_number *v);
  121. xs_data *xs_data_new(const void *data, int size);
  122. int xs_data_size(const xs_data *value);
  123. void xs_data_get(void *data, const xs_data *value);
  124. void *xs_memmem(const char *haystack, int h_size, const char *needle, int n_size);
  125. unsigned int xs_hash_func(const char *data, int size);
  126. #ifdef XS_ASSERT
  127. #include <assert.h>
  128. #define XS_ASSERT_TYPE(v, t) assert(xs_type(v) == t)
  129. #define XS_ASSERT_TYPE_NULL(v, t) assert(v == NULL || xs_type(v) == t)
  130. #else
  131. #define XS_ASSERT_TYPE(v, t) (void)(0)
  132. #define XS_ASSERT_TYPE_NULL(v, t) (void)(0)
  133. #endif
  134. #define xs_return(v) xs_val *__r = v; v = NULL; return __r
  135. #define xs_is_true(v) (xs_type((v)) == XSTYPE_TRUE)
  136. #define xs_is_false(v) (xs_type((v)) == XSTYPE_FALSE)
  137. #define xs_list_foreach(l, v) for (int ct_##__LINE__ = 0; xs_list_next(l, &v, &ct_##__LINE__); )
  138. #define xs_dict_foreach(l, k, v) for (int ct_##__LINE__ = 0; xs_dict_next(l, &k, &v, &ct_##__LINE__); )
  139. #ifdef XS_IMPLEMENTATION
  140. void *_xs_realloc(void *ptr, size_t size, const char *file, int line, const char *func)
  141. {
  142. xs_val *ndata = realloc(ptr, size);
  143. if (ndata == NULL) {
  144. fprintf(stderr, "**OUT OF MEMORY**\n");
  145. abort();
  146. }
  147. #ifdef XS_DEBUG
  148. if (ndata != ptr) {
  149. int n;
  150. FILE *f = fopen("xs_memory.out", "a");
  151. if (ptr != NULL)
  152. fprintf(f, "%p r\n", ptr);
  153. fprintf(f, "%p a %ld %s:%d: %s", ndata, size, file, line, func);
  154. if (ptr != NULL) {
  155. fprintf(f, " [");
  156. for (n = 0; n < 32 && ndata[n]; n++) {
  157. if (ndata[n] >= 32 && ndata[n] <= 127)
  158. fprintf(f, "%c", ndata[n]);
  159. else
  160. fprintf(f, "\\%02x", (unsigned char)ndata[n]);
  161. }
  162. fprintf(f, "]");
  163. }
  164. fprintf(f, "\n");
  165. fclose(f);
  166. }
  167. #else
  168. (void)file;
  169. (void)line;
  170. (void)func;
  171. #endif
  172. return ndata;
  173. }
  174. void *xs_free(void *ptr)
  175. {
  176. #ifdef XS_DEBUG
  177. if (ptr != NULL) {
  178. FILE *f = fopen("xs_memory.out", "a");
  179. fprintf(f, "%p b\n", ptr);
  180. fclose(f);
  181. }
  182. #endif
  183. free(ptr);
  184. return NULL;
  185. }
  186. void _xs_destroy(char **var)
  187. {
  188. /*
  189. if (_xs_debug)
  190. printf("_xs_destroy %p\n", var);
  191. */
  192. xs_free(*var);
  193. }
  194. int _xs_blk_size(int sz)
  195. /* calculates the block size */
  196. {
  197. int blk_size = 4096;
  198. if (sz < 256)
  199. blk_size = 32;
  200. else
  201. if (sz < 4096)
  202. blk_size = 256;
  203. return ((((sz) + blk_size) / blk_size) * blk_size);
  204. }
  205. xstype xs_type(const xs_val *data)
  206. /* return the type of data */
  207. {
  208. xstype t;
  209. if (data == NULL)
  210. t = XSTYPE_NULL;
  211. else
  212. switch (data[0]) {
  213. case XSTYPE_NULL:
  214. case XSTYPE_TRUE:
  215. case XSTYPE_FALSE:
  216. case XSTYPE_LIST:
  217. case XSTYPE_LITEM:
  218. case XSTYPE_DICT:
  219. case XSTYPE_KEYVAL:
  220. case XSTYPE_NUMBER:
  221. case XSTYPE_EOM:
  222. case XSTYPE_DATA:
  223. t = data[0];
  224. break;
  225. default:
  226. t = XSTYPE_STRING;
  227. break;
  228. }
  229. return t;
  230. }
  231. void _xs_put_size(xs_val *ptr, int i)
  232. /* must match _XS_TYPE_SIZE */
  233. {
  234. memcpy(ptr + 1, &i, sizeof(i));
  235. }
  236. int _xs_get_size(const xs_val *ptr)
  237. /* must match _XS_TYPE_SIZE */
  238. {
  239. int i;
  240. memcpy(&i, ptr + 1, sizeof(i));
  241. return i;
  242. }
  243. int xs_size(const xs_val *data)
  244. /* returns the size of data in bytes */
  245. {
  246. int len = 0;
  247. const char *p;
  248. if (data == NULL)
  249. return 0;
  250. switch (xs_type(data)) {
  251. case XSTYPE_STRING:
  252. len = strlen(data) + 1;
  253. break;
  254. case XSTYPE_LIST:
  255. case XSTYPE_DICT:
  256. case XSTYPE_DATA:
  257. len = _xs_get_size(data);
  258. break;
  259. case XSTYPE_KEYVAL:
  260. /* calculate the size of the key and the value */
  261. p = data + 1;
  262. p += xs_size(p);
  263. p += xs_size(p);
  264. len = p - data;
  265. break;
  266. case XSTYPE_LITEM:
  267. /* it's the size of the item + 1 */
  268. p = data + 1;
  269. p += xs_size(p);
  270. len = p - data;
  271. break;
  272. case XSTYPE_NUMBER:
  273. len = 1 + xs_size(data + 1);
  274. break;
  275. default:
  276. len = 1;
  277. }
  278. return len;
  279. }
  280. int xs_is_null(const xs_val *data)
  281. /* checks for null */
  282. {
  283. return (xs_type(data) == XSTYPE_NULL);
  284. }
  285. int xs_cmp(const xs_val *v1, const xs_val *v2)
  286. /* compares two values */
  287. {
  288. int s1 = xs_size(v1);
  289. int s2 = xs_size(v2);
  290. int d = s1 - s2;
  291. return d == 0 ? memcmp(v1, v2, s1) : d;
  292. }
  293. const xs_val *xs_or(const xs_val *v1, const xs_val *v2)
  294. /* returns v1 if it's not NULL, else v2 */
  295. {
  296. return v1 == NULL ? v2 : v1;
  297. }
  298. xs_val *xs_dup(const xs_val *data)
  299. /* creates a duplicate of data */
  300. {
  301. xs_val *s = NULL;
  302. if (data) {
  303. int sz = xs_size(data);
  304. s = xs_realloc(NULL, _xs_blk_size(sz));
  305. memcpy(s, data, sz);
  306. }
  307. return s;
  308. }
  309. xs_val *xs_expand(xs_val *data, int offset, int size)
  310. /* opens a hole in data */
  311. {
  312. int sz = xs_size(data);
  313. int n;
  314. sz += size;
  315. /* open room */
  316. data = xs_realloc(data, _xs_blk_size(sz));
  317. /* move up the rest of the data */
  318. for (n = sz - 1; n >= offset + size; n--)
  319. data[n] = data[n - size];
  320. if (xs_type(data) == XSTYPE_LIST ||
  321. xs_type(data) == XSTYPE_DICT ||
  322. xs_type(data) == XSTYPE_DATA)
  323. _xs_put_size(data, sz);
  324. return data;
  325. }
  326. xs_val *xs_collapse(xs_val *data, int offset, int size)
  327. /* shrinks data */
  328. {
  329. int sz = xs_size(data);
  330. int n;
  331. /* don't try to delete beyond the limit */
  332. if (offset + size > sz)
  333. size = sz - offset;
  334. /* shrink total size */
  335. sz -= size;
  336. for (n = offset; n < sz; n++)
  337. data[n] = data[n + size];
  338. if (xs_type(data) == XSTYPE_LIST ||
  339. xs_type(data) == XSTYPE_DICT ||
  340. xs_type(data) == XSTYPE_DATA)
  341. _xs_put_size(data, sz);
  342. return xs_realloc(data, _xs_blk_size(sz));
  343. }
  344. xs_val *xs_insert_m(xs_val *data, int offset, const char *mem, int size)
  345. /* inserts a memory block */
  346. {
  347. data = xs_expand(data, offset, size);
  348. memcpy(data + offset, mem, size);
  349. return data;
  350. }
  351. xs_val *xs_stock(int type)
  352. /* returns stock values */
  353. {
  354. static xs_val stock_null[] = { XSTYPE_NULL };
  355. static xs_val stock_true[] = { XSTYPE_TRUE };
  356. static xs_val stock_false[] = { XSTYPE_FALSE };
  357. static xs_val stock_0[] = { XSTYPE_NUMBER, '0', '\0' };
  358. static xs_val stock_1[] = { XSTYPE_NUMBER, '1', '\0' };
  359. static xs_list *stock_list = NULL;
  360. static xs_dict *stock_dict = NULL;
  361. switch (type) {
  362. case 0: return stock_0;
  363. case 1: return stock_1;
  364. case XSTYPE_NULL: return stock_null;
  365. case XSTYPE_TRUE: return stock_true;
  366. case XSTYPE_FALSE: return stock_false;
  367. case XSTYPE_LIST:
  368. if (stock_list == NULL)
  369. stock_list = xs_list_new();
  370. return stock_list;
  371. case XSTYPE_DICT:
  372. if (stock_dict == NULL)
  373. stock_dict = xs_dict_new();
  374. return stock_dict;
  375. }
  376. return NULL;
  377. }
  378. /** strings **/
  379. xs_str *xs_str_new(const char *str)
  380. /* creates a new string */
  381. {
  382. return xs_insert(NULL, 0, str ? str : "");
  383. }
  384. xs_str *xs_str_new_sz(const char *mem, int sz)
  385. /* creates a new string from a memory block, adding an asciiz */
  386. {
  387. xs_str *s = xs_realloc(NULL, _xs_blk_size(sz + 1));
  388. memcpy(s, mem, sz);
  389. s[sz] = '\0';
  390. return s;
  391. }
  392. xs_str *xs_str_wrap_i(const char *prefix, xs_str *str, const char *suffix)
  393. /* wraps str with prefix and suffix */
  394. {
  395. XS_ASSERT_TYPE(str, XSTYPE_STRING);
  396. if (prefix)
  397. str = xs_insert_m(str, 0, prefix, strlen(prefix));
  398. if (suffix)
  399. str = xs_insert_m(str, strlen(str), suffix, strlen(suffix));
  400. return str;
  401. }
  402. xs_str *_xs_str_cat(xs_str *str, const char *strs[])
  403. /* concatenates all strings after str */
  404. {
  405. int o = strlen(str);
  406. while (*strs) {
  407. int sz = strlen(*strs);
  408. str = xs_insert_m(str, o, *strs, sz);
  409. o += sz;
  410. strs++;
  411. }
  412. return str;
  413. }
  414. xs_str *xs_replace_in(xs_str *str, const char *sfrom, const char *sto, int times)
  415. /* replaces inline all sfrom with sto */
  416. {
  417. XS_ASSERT_TYPE(str, XSTYPE_STRING);
  418. int sfsz = strlen(sfrom);
  419. int stsz = strlen(sto);
  420. int diff = stsz - sfsz;
  421. char *ss;
  422. int offset = 0;
  423. while (times > 0 && (ss = strstr(str + offset, sfrom)) != NULL) {
  424. int n_offset = ss - str;
  425. if (diff < 0)
  426. str = xs_collapse(str, n_offset, -diff);
  427. else
  428. if (diff > 0)
  429. str = xs_expand(str, n_offset, diff);
  430. memcpy(str + n_offset, sto, stsz);
  431. offset = n_offset + stsz;
  432. times--;
  433. }
  434. return str;
  435. }
  436. xs_str *xs_fmt(const char *fmt, ...)
  437. /* formats a string with printf()-like marks */
  438. {
  439. int n;
  440. xs_str *s = NULL;
  441. va_list ap;
  442. va_start(ap, fmt);
  443. n = vsnprintf(s, 0, fmt, ap);
  444. va_end(ap);
  445. if (n > 0) {
  446. s = xs_realloc(NULL, _xs_blk_size(n + 1));
  447. va_start(ap, fmt);
  448. vsnprintf(s, n + 1, fmt, ap);
  449. va_end(ap);
  450. }
  451. return s;
  452. }
  453. int xs_str_in(const char *haystack, const char *needle)
  454. /* finds needle in haystack and returns the offset or -1 */
  455. {
  456. char *s;
  457. int r = -1;
  458. if ((s = strstr(haystack, needle)) != NULL)
  459. r = s - haystack;
  460. return r;
  461. }
  462. int xs_between(const char *prefix, const char *str, const char *suffix)
  463. /* returns true if str starts with prefix and ends with suffix */
  464. {
  465. int sz = strlen(str);
  466. int psz = prefix ? strlen(prefix) : 0;
  467. int ssz = suffix ? strlen(suffix) : 0;
  468. if (sz < psz || sz < ssz)
  469. return 0;
  470. if (prefix && memcmp(str, prefix, psz) != 0)
  471. return 0;
  472. if (suffix && memcmp(str + sz - ssz, suffix, ssz) != 0)
  473. return 0;
  474. return 1;
  475. }
  476. xs_str *xs_crop_i(xs_str *str, int start, int end)
  477. /* crops the string to be only from start to end */
  478. {
  479. XS_ASSERT_TYPE(str, XSTYPE_STRING);
  480. int sz = strlen(str);
  481. if (end <= 0)
  482. end = sz + end;
  483. /* crop from the top */
  484. str[end] = '\0';
  485. /* crop from the bottom */
  486. str = xs_collapse(str, 0, start);
  487. return str;
  488. }
  489. xs_str *xs_lstrip_chars_i(xs_str *str, const char *chars)
  490. /* strips all chars from the start of str */
  491. {
  492. int n;
  493. for (n = 0; str[n] && strchr(chars, str[n]); n++);
  494. if (n)
  495. str = xs_collapse(str, 0, n);
  496. return str;
  497. }
  498. xs_str *xs_rstrip_chars_i(xs_str *str, const char *chars)
  499. /* strips all chars from the end of str */
  500. {
  501. int n;
  502. for (n = strlen(str); n > 0 && strchr(chars, str[n - 1]); n--);
  503. str[n] = '\0';
  504. return str;
  505. }
  506. xs_str *xs_strip_chars_i(xs_str *str, const char *chars)
  507. /* strips the string of chars from the start and the end */
  508. {
  509. return xs_lstrip_chars_i(xs_rstrip_chars_i(str, chars), chars);
  510. }
  511. xs_str *xs_tolower_i(xs_str *str)
  512. /* convert to lowercase */
  513. {
  514. XS_ASSERT_TYPE(str, XSTYPE_STRING);
  515. int n;
  516. for (n = 0; str[n]; n++)
  517. str[n] = tolower(str[n]);
  518. return str;
  519. }
  520. /** lists **/
  521. xs_list *xs_list_new(void)
  522. /* creates a new list */
  523. {
  524. int sz = 1 + _XS_TYPE_SIZE + 1;
  525. xs_list *l = xs_realloc(NULL, sz);
  526. memset(l, XSTYPE_EOM, sz);
  527. l[0] = XSTYPE_LIST;
  528. _xs_put_size(l, sz);
  529. return l;
  530. }
  531. xs_list *_xs_list_write_litem(xs_list *list, int offset, const char *mem, int dsz)
  532. /* writes a list item */
  533. {
  534. XS_ASSERT_TYPE(list, XSTYPE_LIST);
  535. if (mem == NULL) {
  536. mem = xs_stock(XSTYPE_NULL);
  537. dsz = xs_size(mem);
  538. }
  539. list = xs_expand(list, offset, dsz + 1);
  540. list[offset] = XSTYPE_LITEM;
  541. memcpy(list + offset + 1, mem, dsz);
  542. return list;
  543. }
  544. xs_list *xs_list_append_m(xs_list *list, const char *mem, int dsz)
  545. /* adds a memory block to the list */
  546. {
  547. XS_ASSERT_TYPE(list, XSTYPE_LIST);
  548. return _xs_list_write_litem(list, xs_size(list) - 1, mem, dsz);
  549. }
  550. xs_list *_xs_list_append(xs_list *list, const xs_val *vals[])
  551. /* adds several values to the list */
  552. {
  553. /* special case: if the first argument is NULL, just insert it */
  554. if (*vals == NULL)
  555. return xs_list_append_m(list, NULL, 0);
  556. while (*vals) {
  557. list = xs_list_append_m(list, *vals, xs_size(*vals));
  558. vals++;
  559. }
  560. return list;
  561. }
  562. int xs_list_iter(xs_list **list, const xs_val **value)
  563. /* iterates a list value */
  564. {
  565. int goon = 1;
  566. xs_val *p = *list;
  567. /* skip the start of the list */
  568. if (xs_type(p) == XSTYPE_LIST)
  569. p += 1 + _XS_TYPE_SIZE;
  570. /* an element? */
  571. if (xs_type(p) == XSTYPE_LITEM) {
  572. p++;
  573. *value = p;
  574. p += xs_size(*value);
  575. }
  576. else {
  577. /* end of list */
  578. goon = 0;
  579. }
  580. /* store back the pointer */
  581. *list = p;
  582. return goon;
  583. }
  584. int xs_list_next(const xs_list *list, const xs_val **value, int *ctxt)
  585. /* iterates a list, with context */
  586. {
  587. if (xs_type(list) != XSTYPE_LIST)
  588. return 0;
  589. int goon = 1;
  590. const char *p = list;
  591. /* skip the start of the list */
  592. if (*ctxt == 0)
  593. *ctxt = 1 + _XS_TYPE_SIZE;
  594. p += *ctxt;
  595. /* an element? */
  596. if (xs_type(p) == XSTYPE_LITEM) {
  597. p++;
  598. *value = p;
  599. p += xs_size(*value);
  600. }
  601. else {
  602. /* end of list */
  603. goon = 0;
  604. }
  605. /* update the context */
  606. *ctxt = p - list;
  607. return goon;
  608. }
  609. int xs_list_len(const xs_list *list)
  610. /* returns the number of elements in the list */
  611. {
  612. XS_ASSERT_TYPE_NULL(list, XSTYPE_LIST);
  613. int c = 0;
  614. const xs_val *v;
  615. xs_list_foreach(list, v)
  616. c++;
  617. return c;
  618. }
  619. const xs_val *xs_list_get(const xs_list *list, int num)
  620. /* returns the element #num */
  621. {
  622. XS_ASSERT_TYPE(list, XSTYPE_LIST);
  623. if (num < 0)
  624. num = xs_list_len(list) + num;
  625. int c = 0;
  626. const xs_val *v;
  627. xs_list_foreach(list, v) {
  628. if (c == num)
  629. return v;
  630. c++;
  631. }
  632. return NULL;
  633. }
  634. xs_list *xs_list_del(xs_list *list, int num)
  635. /* deletes element #num */
  636. {
  637. XS_ASSERT_TYPE(list, XSTYPE_LIST);
  638. const xs_val *v;
  639. if ((v = xs_list_get(list, num)) != NULL)
  640. list = xs_collapse(list, v - 1 - list, xs_size(v - 1));
  641. return list;
  642. }
  643. xs_list *xs_list_insert(xs_list *list, int num, const xs_val *data)
  644. /* inserts an element at #num position */
  645. {
  646. XS_ASSERT_TYPE(list, XSTYPE_LIST);
  647. const xs_val *v;
  648. int offset;
  649. if ((v = xs_list_get(list, num)) != NULL)
  650. offset = v - list;
  651. else
  652. offset = xs_size(list);
  653. return _xs_list_write_litem(list, offset - 1, data, xs_size(data));
  654. }
  655. xs_list *xs_list_set(xs_list *list, int num, const xs_val *data)
  656. /* sets the element at #num position */
  657. {
  658. XS_ASSERT_TYPE(list, XSTYPE_LIST);
  659. list = xs_list_del(list, num);
  660. list = xs_list_insert(list, num, data);
  661. return list;
  662. }
  663. xs_list *xs_list_dequeue(xs_list *list, xs_val **data, int last)
  664. /* gets a copy of the first or last element of a list, shrinking it */
  665. {
  666. XS_ASSERT_TYPE(list, XSTYPE_LIST);
  667. int ct = 0;
  668. const xs_val *v = NULL;
  669. if (!last) {
  670. /* get the first */
  671. xs_list_next(list, &v, &ct);
  672. }
  673. else {
  674. /* iterate to the end */
  675. while (xs_list_next(list, &v, &ct));
  676. }
  677. if (v != NULL) {
  678. *data = xs_dup(v);
  679. /* collapse from the address of the element */
  680. list = xs_collapse(list, v - 1 - list, xs_size(v - 1));
  681. }
  682. return list;
  683. }
  684. int xs_list_in(const xs_list *list, const xs_val *val)
  685. /* returns the position of val in list or -1 */
  686. {
  687. XS_ASSERT_TYPE_NULL(list, XSTYPE_LIST);
  688. int n = 0;
  689. const xs_val *v;
  690. int sz = xs_size(val);
  691. xs_list_foreach(list, v) {
  692. if (sz == xs_size(v) && memcmp(val, v, sz) == 0)
  693. return n;
  694. n++;
  695. }
  696. return -1;
  697. }
  698. xs_str *xs_join(const xs_list *list, const char *sep)
  699. /* joins a list into a string */
  700. {
  701. XS_ASSERT_TYPE(list, XSTYPE_LIST);
  702. xs_str *s = NULL;
  703. const xs_val *v;
  704. int c = 0;
  705. int offset = 0;
  706. int ssz = strlen(sep);
  707. xs_list_foreach(list, v) {
  708. /* refuse to join non-string values */
  709. if (xs_type(v) == XSTYPE_STRING) {
  710. int sz;
  711. /* add the separator */
  712. if (c != 0 && ssz) {
  713. s = xs_realloc(s, offset + ssz);
  714. memcpy(s + offset, sep, ssz);
  715. offset += ssz;
  716. }
  717. /* add the element */
  718. if ((sz = strlen(v)) > 0) {
  719. s = xs_realloc(s, offset + sz);
  720. memcpy(s + offset, v, sz);
  721. offset += sz;
  722. }
  723. c++;
  724. }
  725. }
  726. /* null-terminate */
  727. s = xs_realloc(s, _xs_blk_size(offset + 1));
  728. s[offset] = '\0';
  729. return s;
  730. }
  731. xs_list *xs_split_n(const char *str, const char *sep, int times)
  732. /* splits a string into a list upto n times */
  733. {
  734. int sz = strlen(sep);
  735. char *ss;
  736. xs_list *list;
  737. list = xs_list_new();
  738. while (times > 0 && (ss = strstr(str, sep)) != NULL) {
  739. /* create a new string with this slice and add it to the list */
  740. xs *s = xs_str_new_sz(str, ss - str);
  741. list = xs_list_append(list, s);
  742. /* skip past the separator */
  743. str = ss + sz;
  744. times--;
  745. }
  746. /* add the rest of the string */
  747. list = xs_list_append(list, str);
  748. return list;
  749. }
  750. xs_list *xs_list_cat(xs_list *l1, const xs_list *l2)
  751. /* concatenates list l2 to l1 */
  752. {
  753. XS_ASSERT_TYPE(l1, XSTYPE_LIST);
  754. XS_ASSERT_TYPE(l2, XSTYPE_LIST);
  755. /* inserts at the end of l1 the content of l2 (skipping header and footer) */
  756. return xs_insert_m(l1, xs_size(l1) - 1,
  757. l2 + 1 + _XS_TYPE_SIZE, xs_size(l2) - (1 + _XS_TYPE_SIZE + 1));
  758. }
  759. /** keyvals **/
  760. int xs_keyval_size(const xs_str *key, const xs_val *value)
  761. /* returns the needed size for a keyval */
  762. {
  763. return 1 + xs_size(key) + xs_size(value);
  764. }
  765. xs_str *xs_keyval_key(const xs_keyval *keyval)
  766. /* returns a pointer to the key of the keyval */
  767. {
  768. return (xs_str *)&keyval[1];
  769. }
  770. xs_val *xs_keyval_value(const xs_keyval *keyval)
  771. /* returns a pointer to the value of the keyval */
  772. {
  773. return (xs_val *)&keyval[1 + xs_size(xs_keyval_key(keyval))];
  774. }
  775. xs_keyval *xs_keyval_make(xs_keyval *keyval, const xs_str *key, const xs_val *value)
  776. /* builds a keyval into mem (should have enough size) */
  777. {
  778. keyval[0] = XSTYPE_KEYVAL;
  779. memcpy(xs_keyval_key(keyval), key, xs_size(key));
  780. memcpy(xs_keyval_value(keyval), value, xs_size(value));
  781. return keyval;
  782. }
  783. /** dicts **/
  784. typedef struct {
  785. int value_offset; /* offset to value (from dict start) */
  786. int next; /* next node in sequential search */
  787. int child[4]; /* child nodes in hashed search */
  788. char key[]; /* C string key */
  789. } ditem_hdr;
  790. typedef struct {
  791. int size; /* size of full dict (_XS_TYPE_SIZE) */
  792. int first; /* first node for sequential search */
  793. int root; /* root node for hashed search */
  794. ditem_hdr ditems[]; /* the ditems */
  795. } dict_hdr;
  796. xs_dict *xs_dict_new(void)
  797. /* creates a new dict */
  798. {
  799. /* size of dict */
  800. int sz = 1 + sizeof(dict_hdr);
  801. xs_dict *d = xs_realloc(NULL, sz);
  802. memset(d, '\0', sz);
  803. d[0] = XSTYPE_DICT;
  804. _xs_put_size(d, sz);
  805. return d;
  806. }
  807. static int *_xs_dict_locate(const xs_dict *dict, const char *key)
  808. /* locates a ditem */
  809. {
  810. unsigned int h = xs_hash_func(key, strlen(key));
  811. /* start from the root */
  812. dict_hdr *dh = (dict_hdr *)(dict + 1);
  813. int *off = &dh->root;
  814. while (*off) {
  815. /* pointer to ditem */
  816. ditem_hdr *di = (ditem_hdr *)(dict + *off);
  817. /* pointer to the key */
  818. const char *d_key = di->key;
  819. if (strcmp(key, d_key) == 0)
  820. break;
  821. off = &di->child[h >> 30];
  822. h <<= 2;
  823. }
  824. return off;
  825. }
  826. xs_dict *xs_dict_set(xs_dict *dict, const xs_str *key, const xs_val *value)
  827. /* sets a key/value pair */
  828. {
  829. if (value == NULL)
  830. value = xs_stock(XSTYPE_NULL);
  831. if (xs_type(dict) == XSTYPE_DICT) {
  832. int *o = _xs_dict_locate(dict, key);
  833. int end = xs_size(dict);
  834. if (!*o) {
  835. /* ditem does not exist yet: append to the end */
  836. *o = end;
  837. int ksz = xs_size(key);
  838. int vsz = xs_size(value);
  839. int dsz = sizeof(ditem_hdr) + ksz + vsz;
  840. /* open room in the dict for the full ditem */
  841. dict = xs_expand(dict, end, dsz);
  842. dict_hdr *dh = (dict_hdr *)(dict + 1);
  843. /* build the ditem */
  844. ditem_hdr *di = (ditem_hdr *)(dict + end);
  845. memset(di, '\0', dsz);
  846. /* set the offset to the value */
  847. di->value_offset = end + sizeof(ditem_hdr) + ksz;
  848. /* copy the key */
  849. memcpy(di->key, key, ksz);
  850. /* copy the value */
  851. memcpy(dict + di->value_offset, value, vsz);
  852. /* chain to the sequential list */
  853. di->next = dh->first;
  854. dh->first = end;
  855. }
  856. else {
  857. /* ditem already exists */
  858. ditem_hdr *di = (ditem_hdr *)(dict + *o);
  859. /* get pointer to the value offset */
  860. int *i = &di->value_offset;
  861. /* deleted? recover offset */
  862. if (*i < 0)
  863. *i *= -1;
  864. /* get old value */
  865. xs_val *o_value = dict + *i;
  866. /* will new value fit over the old one? */
  867. if (xs_size(value) <= xs_size(o_value)) {
  868. /* just overwrite */
  869. /* (difference is leaked inside the dict) */
  870. memcpy(o_value, value, xs_size(value));
  871. }
  872. else {
  873. /* not enough room: new value will live at the end of the dict */
  874. /* (old value is leaked inside the dict) */
  875. *i = end;
  876. dict = xs_insert(dict, end, value);
  877. }
  878. }
  879. }
  880. return dict;
  881. }
  882. xs_dict *xs_dict_append(xs_dict *dict, const xs_str *key, const xs_val *value)
  883. /* just an alias (for this implementation it's the same) */
  884. {
  885. return xs_dict_set(dict, key, value);
  886. }
  887. xs_dict *xs_dict_prepend(xs_dict *dict, const xs_str *key, const xs_val *value)
  888. /* just an alias (for this implementation it's the same) */
  889. {
  890. return xs_dict_set(dict, key, value);
  891. }
  892. xs_dict *xs_dict_del(xs_dict *dict, const xs_str *key)
  893. /* deletes a key/value pair */
  894. {
  895. if (xs_type(dict) == XSTYPE_DICT) {
  896. int *o = _xs_dict_locate(dict, key);
  897. if (*o) {
  898. /* found ditem */
  899. ditem_hdr *di = (ditem_hdr *)(dict + *o);
  900. /* deleted ditems have a negative value offset */
  901. di->value_offset *= -1;
  902. }
  903. }
  904. return dict;
  905. }
  906. const xs_val *xs_dict_get(const xs_dict *dict, const xs_str *key)
  907. /* gets a value by key, or NULL */
  908. {
  909. if (xs_type(dict) == XSTYPE_DICT) {
  910. int *o = _xs_dict_locate(dict, key);
  911. if (*o) {
  912. /* found ditem */
  913. ditem_hdr *di = (ditem_hdr *)(dict + *o);
  914. if (di->value_offset > 0)
  915. return dict + di->value_offset;
  916. }
  917. }
  918. return NULL;
  919. }
  920. int xs_dict_next(const xs_dict *dict, const xs_str **key, const xs_val **value, int *ctxt)
  921. /* dict iterator, with context */
  922. {
  923. if (xs_type(dict) != XSTYPE_DICT)
  924. return 0;
  925. if (*ctxt == 0) {
  926. /* at the beginning: get the first sequential item */
  927. const dict_hdr *dh = (dict_hdr *)(dict + 1);
  928. *ctxt = dh->first;
  929. }
  930. *value = NULL;
  931. while (*value == NULL && *ctxt > 0) {
  932. const ditem_hdr *di = (ditem_hdr *)(dict + *ctxt);
  933. /* get value */
  934. if (di->value_offset > 0) {
  935. *value = (xs_val *)(dict + di->value_offset);
  936. /* get key */
  937. *key = (xs_str *)&di->key;
  938. }
  939. /* get offset to next ditem */
  940. *ctxt = di->next ? di->next : -1;
  941. }
  942. return *value != NULL;
  943. }
  944. xs_dict *xs_dict_gc(const xs_dict *dict)
  945. /* creates a copy of dict, but garbage-collected */
  946. {
  947. xs_dict *nd = xs_dict_new();
  948. const xs_str *k;
  949. const xs_val *v;
  950. xs_dict_foreach(dict, k, v) {
  951. if (xs_type(v) == XSTYPE_DICT) {
  952. xs *sd = xs_dict_gc(v);
  953. nd = xs_dict_set(nd, k, sd);
  954. }
  955. else
  956. nd = xs_dict_set(nd, k, v);
  957. }
  958. return nd;
  959. }
  960. const xs_val *xs_dict_get_path_sep(const xs_dict *dict, const char *path, const char *sep)
  961. /* gets a value from dict given a path separated by sep */
  962. {
  963. /* split by the separator */
  964. xs *l = xs_split_n(path, sep, 1);
  965. /* only one part? just get */
  966. if (xs_list_len(l) == 1)
  967. return xs_dict_get(dict, path);
  968. const char *prefix = xs_list_get(l, 0);
  969. const char *rest = xs_list_get(l, 1);
  970. const xs_dict *sd = xs_dict_get(dict, prefix);
  971. if (xs_type(sd) == XSTYPE_DICT)
  972. return xs_dict_get_path_sep(sd, rest, sep);
  973. return NULL;
  974. }
  975. xs_dict *xs_dict_set_path_sep(xs_dict *dict, const char *path, const xs_val *value, const char *sep)
  976. /* sets a value into dict given a path separated by sep;
  977. intermediate dicts are created if needed */
  978. {
  979. /* split by the separator */
  980. xs *l = xs_split_n(path, sep, 1);
  981. /* only one part? just set */
  982. if (xs_list_len(l) == 1)
  983. return xs_dict_set(dict, path, value);
  984. const char *prefix = xs_list_get(l, 0);
  985. const char *rest = xs_list_get(l, 1);
  986. xs *nd = NULL;
  987. /* does the first part of path exist? */
  988. const xs_dict *cd = xs_dict_get(dict, prefix);
  989. if (xs_type(cd) == XSTYPE_DICT)
  990. nd = xs_dup(cd);
  991. else
  992. nd = xs_dict_new();
  993. /* move down the path */
  994. nd = xs_dict_set_path_sep(nd, rest, value, sep);
  995. /* set */
  996. return xs_dict_set(dict, prefix, nd);
  997. }
  998. /** other values **/
  999. xs_val *xs_val_new(xstype t)
  1000. /* adds a new special value */
  1001. {
  1002. xs_val *v = xs_realloc(NULL, _xs_blk_size(1));
  1003. v[0] = t;
  1004. return v;
  1005. }
  1006. /** numbers */
  1007. xs_number *xs_number_new(double f)
  1008. /* adds a new number value */
  1009. {
  1010. xs_number *v;
  1011. char tmp[64];
  1012. snprintf(tmp, sizeof(tmp), "%.15lf", f);
  1013. /* strip useless zeros */
  1014. if (strchr(tmp, '.') != NULL) {
  1015. char *ptr;
  1016. for (ptr = tmp + strlen(tmp) - 1; *ptr == '0'; ptr--);
  1017. if (*ptr != '.')
  1018. ptr++;
  1019. *ptr = '\0';
  1020. }
  1021. /* alloc for the marker and the full string */
  1022. v = xs_realloc(NULL, _xs_blk_size(1 + xs_size(tmp)));
  1023. v[0] = XSTYPE_NUMBER;
  1024. memcpy(&v[1], tmp, xs_size(tmp));
  1025. return v;
  1026. }
  1027. double xs_number_get(const xs_number *v)
  1028. /* gets the number as a double */
  1029. {
  1030. double f = 0.0;
  1031. if (xs_type(v) == XSTYPE_NUMBER)
  1032. f = atof(&v[1]);
  1033. else
  1034. if (xs_type(v) == XSTYPE_STRING)
  1035. f = atof(v);
  1036. return f;
  1037. }
  1038. const char *xs_number_str(const xs_number *v)
  1039. /* gets the number as a string */
  1040. {
  1041. const char *p = NULL;
  1042. if (xs_type(v) == XSTYPE_NUMBER)
  1043. p = &v[1];
  1044. return p;
  1045. }
  1046. /** raw data blocks **/
  1047. xs_data *xs_data_new(const void *data, int size)
  1048. /* returns a new raw data value */
  1049. {
  1050. xs_data *v;
  1051. /* add the overhead (data type + size) */
  1052. int total_size = size + 1 + _XS_TYPE_SIZE;
  1053. v = xs_realloc(NULL, _xs_blk_size(total_size));
  1054. v[0] = XSTYPE_DATA;
  1055. _xs_put_size(v, total_size);
  1056. memcpy(&v[1 + _XS_TYPE_SIZE], data, size);
  1057. return v;
  1058. }
  1059. int xs_data_size(const xs_data *value)
  1060. /* returns the size of the data stored inside value */
  1061. {
  1062. return _xs_get_size(value) - (1 + _XS_TYPE_SIZE);
  1063. }
  1064. void xs_data_get(void *data, const xs_data *value)
  1065. /* copies the raw data stored inside value into data */
  1066. {
  1067. memcpy(data, &value[1 + _XS_TYPE_SIZE], xs_data_size(value));
  1068. }
  1069. void *xs_memmem(const char *haystack, int h_size, const char *needle, int n_size)
  1070. /* clone of memmem */
  1071. {
  1072. char *p, *r = NULL;
  1073. int offset = 0;
  1074. while (!r && h_size - offset > n_size &&
  1075. (p = memchr(haystack + offset, *needle, h_size - offset))) {
  1076. if (memcmp(p, needle, n_size) == 0)
  1077. r = p;
  1078. else
  1079. offset = p - haystack + 1;
  1080. }
  1081. return r;
  1082. }
  1083. unsigned int xs_hash_func(const char *data, int size)
  1084. /* a general purpose hashing function */
  1085. {
  1086. unsigned int hash = 0x666;
  1087. int n;
  1088. for (n = 0; n < size; n++) {
  1089. hash ^= (unsigned char)data[n];
  1090. hash *= 111111111;
  1091. }
  1092. return hash ^ hash >> 16;
  1093. }
  1094. #endif /* XS_IMPLEMENTATION */
  1095. #endif /* _XS_H */