xs.h 29 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335
  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. xs_val *xs_dup(const xs_val *data);
  53. xs_val *xs_expand(xs_val *data, int offset, int size);
  54. xs_val *xs_collapse(xs_val *data, int offset, int size);
  55. xs_val *xs_insert_m(xs_val *data, int offset, const char *mem, int size);
  56. #define xs_insert(data, offset, data2) xs_insert_m(data, offset, data2, xs_size(data2))
  57. #define xs_append_m(data, mem, size) xs_insert_m(data, xs_size(data) - 1, mem, size)
  58. xs_val *xs_stock(int type);
  59. xs_str *xs_str_new(const char *str);
  60. xs_str *xs_str_new_sz(const char *mem, int sz);
  61. xs_str *xs_str_wrap_i(const char *prefix, xs_str *str, const char *suffix);
  62. #define xs_str_prepend_i(str, prefix) xs_str_wrap_i(prefix, str, NULL)
  63. xs_str *_xs_str_cat(xs_str *str, const char *strs[]);
  64. #define xs_str_cat(str, ...) _xs_str_cat(str, (const char *[]){ __VA_ARGS__, NULL })
  65. xs_str *xs_replace_in(xs_str *str, const char *sfrom, const char *sto, int times);
  66. #define xs_replace_i(str, sfrom, sto) xs_replace_in(str, sfrom, sto, XS_ALL)
  67. #define xs_replace(str, sfrom, sto) xs_replace_in(xs_dup(str), sfrom, sto, XS_ALL)
  68. #define xs_replace_n(str, sfrom, sto, times) xs_replace_in(xs_dup(str), sfrom, sto, times)
  69. xs_str *xs_fmt(const char *fmt, ...);
  70. int xs_str_in(const char *haystack, const char *needle);
  71. int xs_starts_and_ends(const char *prefix, const char *str, const char *suffix);
  72. #define xs_startswith(str, prefix) xs_starts_and_ends(prefix, str, NULL)
  73. #define xs_endswith(str, suffix) xs_starts_and_ends(NULL, str, suffix)
  74. xs_str *xs_crop_i(xs_str *str, int start, int end);
  75. xs_str *xs_lstrip_chars_i(xs_str *str, const char *chars);
  76. xs_str *xs_rstrip_chars_i(xs_str *str, const char *chars);
  77. xs_str *xs_strip_chars_i(xs_str *str, const char *chars);
  78. #define xs_strip_i(str) xs_strip_chars_i(str, " \r\n\t\v\f")
  79. xs_str *xs_tolower_i(xs_str *str);
  80. xs_list *xs_list_new(void);
  81. xs_list *xs_list_append_m(xs_list *list, const char *mem, int dsz);
  82. xs_list *_xs_list_append(xs_list *list, const xs_val *vals[]);
  83. #define xs_list_append(list, ...) _xs_list_append(list, (const xs_val *[]){ __VA_ARGS__, NULL })
  84. int xs_list_iter(xs_list **list, const xs_val **value);
  85. int xs_list_next(const xs_list *list, const xs_val **value, int *ctxt);
  86. int xs_list_len(const xs_list *list);
  87. const xs_val *xs_list_get(const xs_list *list, int num);
  88. xs_list *xs_list_del(xs_list *list, int num);
  89. xs_list *xs_list_insert(xs_list *list, int num, const xs_val *data);
  90. xs_list *xs_list_set(xs_list *list, int num, const xs_val *data);
  91. xs_list *xs_list_dequeue(xs_list *list, xs_val **data, int last);
  92. #define xs_list_pop(list, data) xs_list_dequeue(list, data, 1)
  93. #define xs_list_shift(list, data) xs_list_dequeue(list, data, 0)
  94. int xs_list_in(const xs_list *list, const xs_val *val);
  95. xs_str *xs_join(const xs_list *list, const char *sep);
  96. xs_list *xs_split_n(const char *str, const char *sep, int times);
  97. #define xs_split(str, sep) xs_split_n(str, sep, XS_ALL)
  98. xs_list *xs_list_cat(xs_list *l1, const xs_list *l2);
  99. int xs_keyval_size(const xs_str *key, const xs_val *value);
  100. xs_str *xs_keyval_key(const xs_keyval *keyval);
  101. xs_val *xs_keyval_value(const xs_keyval *keyval);
  102. xs_keyval *xs_keyval_make(xs_keyval *keyval, const xs_str *key, const xs_val *value);
  103. xs_dict *xs_dict_new(void);
  104. xs_dict *xs_dict_append(xs_dict *dict, const xs_str *key, const xs_val *value);
  105. xs_dict *xs_dict_prepend(xs_dict *dict, const xs_str *key, const xs_val *value);
  106. int xs_dict_next(const xs_dict *dict, const xs_str **key, const xs_val **value, int *ctxt);
  107. const xs_val *xs_dict_get_def(const xs_dict *dict, const xs_str *key, const xs_val *def);
  108. #define xs_dict_get(dict, key) xs_dict_get_def(dict, key, NULL)
  109. xs_dict *xs_dict_del(xs_dict *dict, const xs_str *key);
  110. xs_dict *xs_dict_set(xs_dict *dict, const xs_str *key, const xs_val *data);
  111. xs_dict *xs_dict_gc(xs_dict *dict);
  112. xs_val *xs_val_new(xstype t);
  113. xs_number *xs_number_new(double f);
  114. double xs_number_get(const xs_number *v);
  115. const char *xs_number_str(const xs_number *v);
  116. xs_data *xs_data_new(const void *data, int size);
  117. int xs_data_size(const xs_data *value);
  118. void xs_data_get(void *data, const xs_data *value);
  119. void *xs_memmem(const char *haystack, int h_size, const char *needle, int n_size);
  120. unsigned int xs_hash_func(const char *data, int size);
  121. #ifdef XS_ASSERT
  122. #include <assert.h>
  123. #define XS_ASSERT_TYPE(v, t) assert(xs_type(v) == t)
  124. #define XS_ASSERT_TYPE_NULL(v, t) assert(v == NULL || xs_type(v) == t)
  125. #else
  126. #define XS_ASSERT_TYPE(v, t) (void)(0)
  127. #define XS_ASSERT_TYPE_NULL(v, t) (void)(0)
  128. #endif
  129. #define xs_return(v) xs_val *__r = v; v = NULL; return __r
  130. #ifdef XS_IMPLEMENTATION
  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_KEYVAL:
  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_size(xs_val *ptr, int i)
  223. /* must match _XS_TYPE_SIZE */
  224. {
  225. memcpy(ptr + 1, &i, sizeof(i));
  226. }
  227. int _xs_get_size(const xs_val *ptr)
  228. /* must match _XS_TYPE_SIZE */
  229. {
  230. int i;
  231. memcpy(&i, ptr + 1, sizeof(i));
  232. return i;
  233. }
  234. int xs_size(const xs_val *data)
  235. /* returns the size of data in bytes */
  236. {
  237. int len = 0;
  238. const char *p;
  239. if (data == NULL)
  240. return 0;
  241. switch (xs_type(data)) {
  242. case XSTYPE_STRING:
  243. len = strlen(data) + 1;
  244. break;
  245. case XSTYPE_LIST:
  246. case XSTYPE_DICT:
  247. case XSTYPE_DATA:
  248. len = _xs_get_size(data);
  249. break;
  250. case XSTYPE_KEYVAL:
  251. /* calculate the size of the key and the value */
  252. p = data + 1;
  253. p += xs_size(p);
  254. p += xs_size(p);
  255. len = p - data;
  256. break;
  257. case XSTYPE_LITEM:
  258. /* it's the size of the item + 1 */
  259. p = data + 1;
  260. p += xs_size(p);
  261. len = p - data;
  262. break;
  263. case XSTYPE_NUMBER:
  264. len = 1 + xs_size(data + 1);
  265. break;
  266. default:
  267. len = 1;
  268. }
  269. return len;
  270. }
  271. int xs_is_null(const xs_val *data)
  272. /* checks for null */
  273. {
  274. return (xs_type(data) == XSTYPE_NULL);
  275. }
  276. int xs_cmp(const xs_val *v1, const xs_val *v2)
  277. /* compares two values */
  278. {
  279. int s1 = xs_size(v1);
  280. int s2 = xs_size(v2);
  281. int d = s1 - s2;
  282. return d == 0 ? memcmp(v1, v2, s1) : d;
  283. }
  284. xs_val *xs_dup(const xs_val *data)
  285. /* creates a duplicate of data */
  286. {
  287. xs_val *s = NULL;
  288. if (data) {
  289. int sz = xs_size(data);
  290. s = xs_realloc(NULL, _xs_blk_size(sz));
  291. memcpy(s, data, sz);
  292. }
  293. return s;
  294. }
  295. xs_val *xs_expand(xs_val *data, int offset, int size)
  296. /* opens a hole in data */
  297. {
  298. int sz = xs_size(data);
  299. int n;
  300. sz += size;
  301. /* open room */
  302. data = xs_realloc(data, _xs_blk_size(sz));
  303. /* move up the rest of the data */
  304. for (n = sz - 1; n >= offset + size; n--)
  305. data[n] = data[n - size];
  306. if (xs_type(data) == XSTYPE_LIST ||
  307. xs_type(data) == XSTYPE_DICT ||
  308. xs_type(data) == XSTYPE_DATA)
  309. _xs_put_size(data, sz);
  310. return data;
  311. }
  312. xs_val *xs_collapse(xs_val *data, int offset, int size)
  313. /* shrinks data */
  314. {
  315. int sz = xs_size(data);
  316. int n;
  317. /* don't try to delete beyond the limit */
  318. if (offset + size > sz)
  319. size = sz - offset;
  320. /* shrink total size */
  321. sz -= size;
  322. for (n = offset; n < sz; n++)
  323. data[n] = data[n + size];
  324. if (xs_type(data) == XSTYPE_LIST ||
  325. xs_type(data) == XSTYPE_DICT ||
  326. xs_type(data) == XSTYPE_DATA)
  327. _xs_put_size(data, sz);
  328. return xs_realloc(data, _xs_blk_size(sz));
  329. }
  330. xs_val *xs_insert_m(xs_val *data, int offset, const char *mem, int size)
  331. /* inserts a memory block */
  332. {
  333. data = xs_expand(data, offset, size);
  334. memcpy(data + offset, mem, size);
  335. return data;
  336. }
  337. xs_val *xs_stock(int type)
  338. /* returns stock values */
  339. {
  340. static xs_val stock_null[] = { XSTYPE_NULL };
  341. static xs_val stock_true[] = { XSTYPE_TRUE };
  342. static xs_val stock_false[] = { XSTYPE_FALSE };
  343. static xs_val stock_0[] = { XSTYPE_NUMBER, '0', '\0' };
  344. static xs_val stock_1[] = { XSTYPE_NUMBER, '1', '\0' };
  345. static xs_list *stock_list = NULL;
  346. static xs_dict *stock_dict = NULL;
  347. switch (type) {
  348. case 0: return stock_0;
  349. case 1: return stock_1;
  350. case XSTYPE_NULL: return stock_null;
  351. case XSTYPE_TRUE: return stock_true;
  352. case XSTYPE_FALSE: return stock_false;
  353. case XSTYPE_LIST:
  354. if (stock_list == NULL)
  355. stock_list = xs_list_new();
  356. return stock_list;
  357. case XSTYPE_DICT:
  358. if (stock_dict == NULL)
  359. stock_dict = xs_dict_new();
  360. return stock_dict;
  361. }
  362. return NULL;
  363. }
  364. /** strings **/
  365. xs_str *xs_str_new(const char *str)
  366. /* creates a new string */
  367. {
  368. return xs_insert(NULL, 0, str ? str : "");
  369. }
  370. xs_str *xs_str_new_sz(const char *mem, int sz)
  371. /* creates a new string from a memory block, adding an asciiz */
  372. {
  373. xs_str *s = xs_realloc(NULL, _xs_blk_size(sz + 1));
  374. memcpy(s, mem, sz);
  375. s[sz] = '\0';
  376. return s;
  377. }
  378. xs_str *xs_str_wrap_i(const char *prefix, xs_str *str, const char *suffix)
  379. /* wraps str with prefix and suffix */
  380. {
  381. XS_ASSERT_TYPE(str, XSTYPE_STRING);
  382. if (prefix)
  383. str = xs_insert_m(str, 0, prefix, strlen(prefix));
  384. if (suffix)
  385. str = xs_insert_m(str, strlen(str), suffix, strlen(suffix));
  386. return str;
  387. }
  388. xs_str *_xs_str_cat(xs_str *str, const char *strs[])
  389. /* concatenates all strings after str */
  390. {
  391. int o = strlen(str);
  392. while (*strs) {
  393. int sz = strlen(*strs);
  394. str = xs_insert_m(str, o, *strs, sz);
  395. o += sz;
  396. strs++;
  397. }
  398. return str;
  399. }
  400. xs_str *xs_replace_in(xs_str *str, const char *sfrom, const char *sto, int times)
  401. /* replaces inline all sfrom with sto */
  402. {
  403. XS_ASSERT_TYPE(str, XSTYPE_STRING);
  404. int sfsz = strlen(sfrom);
  405. int stsz = strlen(sto);
  406. int diff = stsz - sfsz;
  407. char *ss;
  408. int offset = 0;
  409. while (times > 0 && (ss = strstr(str + offset, sfrom)) != NULL) {
  410. int n_offset = ss - str;
  411. if (diff < 0)
  412. str = xs_collapse(str, n_offset, -diff);
  413. else
  414. if (diff > 0)
  415. str = xs_expand(str, n_offset, diff);
  416. memcpy(str + n_offset, sto, stsz);
  417. offset = n_offset + stsz;
  418. times--;
  419. }
  420. return str;
  421. }
  422. xs_str *xs_fmt(const char *fmt, ...)
  423. /* formats a string with printf()-like marks */
  424. {
  425. int n;
  426. xs_str *s = NULL;
  427. va_list ap;
  428. va_start(ap, fmt);
  429. n = vsnprintf(s, 0, fmt, ap);
  430. va_end(ap);
  431. if (n > 0) {
  432. s = xs_realloc(NULL, _xs_blk_size(n + 1));
  433. va_start(ap, fmt);
  434. vsnprintf(s, n + 1, fmt, ap);
  435. va_end(ap);
  436. }
  437. return s;
  438. }
  439. int xs_str_in(const char *haystack, const char *needle)
  440. /* finds needle in haystack and returns the offset or -1 */
  441. {
  442. char *s;
  443. int r = -1;
  444. if ((s = strstr(haystack, needle)) != NULL)
  445. r = s - haystack;
  446. return r;
  447. }
  448. int xs_starts_and_ends(const char *prefix, const char *str, const char *suffix)
  449. /* returns true if str starts with prefix and ends with suffix */
  450. {
  451. int sz = strlen(str);
  452. int psz = prefix ? strlen(prefix) : 0;
  453. int ssz = suffix ? strlen(suffix) : 0;
  454. if (sz < psz || sz < ssz)
  455. return 0;
  456. if (prefix && memcmp(str, prefix, psz) != 0)
  457. return 0;
  458. if (suffix && memcmp(str + sz - ssz, suffix, ssz) != 0)
  459. return 0;
  460. return 1;
  461. }
  462. xs_str *xs_crop_i(xs_str *str, int start, int end)
  463. /* crops the string to be only from start to end */
  464. {
  465. XS_ASSERT_TYPE(str, XSTYPE_STRING);
  466. int sz = strlen(str);
  467. if (end <= 0)
  468. end = sz + end;
  469. /* crop from the top */
  470. str[end] = '\0';
  471. /* crop from the bottom */
  472. str = xs_collapse(str, 0, start);
  473. return str;
  474. }
  475. xs_str *xs_lstrip_chars_i(xs_str *str, const char *chars)
  476. /* strips all chars from the start of str */
  477. {
  478. int n;
  479. for (n = 0; str[n] && strchr(chars, str[n]); n++);
  480. if (n)
  481. str = xs_collapse(str, 0, n);
  482. return str;
  483. }
  484. xs_str *xs_rstrip_chars_i(xs_str *str, const char *chars)
  485. /* strips all chars from the end of str */
  486. {
  487. int n;
  488. for (n = strlen(str); n > 0 && strchr(chars, str[n - 1]); n--);
  489. str[n] = '\0';
  490. return str;
  491. }
  492. xs_str *xs_strip_chars_i(xs_str *str, const char *chars)
  493. /* strips the string of chars from the start and the end */
  494. {
  495. return xs_lstrip_chars_i(xs_rstrip_chars_i(str, chars), chars);
  496. }
  497. xs_str *xs_tolower_i(xs_str *str)
  498. /* convert to lowercase */
  499. {
  500. XS_ASSERT_TYPE(str, XSTYPE_STRING);
  501. int n;
  502. for (n = 0; str[n]; n++)
  503. str[n] = tolower(str[n]);
  504. return str;
  505. }
  506. /** lists **/
  507. xs_list *xs_list_new(void)
  508. /* creates a new list */
  509. {
  510. int sz = 1 + _XS_TYPE_SIZE + 1;
  511. xs_list *l = xs_realloc(NULL, sz);
  512. memset(l, XSTYPE_EOM, sz);
  513. l[0] = XSTYPE_LIST;
  514. _xs_put_size(l, sz);
  515. return l;
  516. }
  517. xs_list *_xs_list_write_litem(xs_list *list, int offset, const char *mem, int dsz)
  518. /* writes a list item */
  519. {
  520. XS_ASSERT_TYPE(list, XSTYPE_LIST);
  521. if (mem == NULL) {
  522. mem = xs_stock(XSTYPE_NULL);
  523. dsz = xs_size(mem);
  524. }
  525. list = xs_expand(list, offset, dsz + 1);
  526. list[offset] = XSTYPE_LITEM;
  527. memcpy(list + offset + 1, mem, dsz);
  528. return list;
  529. }
  530. xs_list *xs_list_append_m(xs_list *list, const char *mem, int dsz)
  531. /* adds a memory block to the list */
  532. {
  533. XS_ASSERT_TYPE(list, XSTYPE_LIST);
  534. return _xs_list_write_litem(list, xs_size(list) - 1, mem, dsz);
  535. }
  536. xs_list *_xs_list_append(xs_list *list, const xs_val *vals[])
  537. /* adds several values to the list */
  538. {
  539. /* special case: if the first argument is NULL, just insert it */
  540. if (*vals == NULL)
  541. return xs_list_append_m(list, NULL, 0);
  542. while (*vals) {
  543. list = xs_list_append_m(list, *vals, xs_size(*vals));
  544. vals++;
  545. }
  546. return list;
  547. }
  548. int xs_list_iter(xs_list **list, const xs_val **value)
  549. /* iterates a list value */
  550. {
  551. int goon = 1;
  552. xs_val *p = *list;
  553. /* skip the start of the list */
  554. if (xs_type(p) == XSTYPE_LIST)
  555. p += 1 + _XS_TYPE_SIZE;
  556. /* an element? */
  557. if (xs_type(p) == XSTYPE_LITEM) {
  558. p++;
  559. *value = p;
  560. p += xs_size(*value);
  561. }
  562. else {
  563. /* end of list */
  564. goon = 0;
  565. }
  566. /* store back the pointer */
  567. *list = p;
  568. return goon;
  569. }
  570. int xs_list_next(const xs_list *list, const xs_val **value, int *ctxt)
  571. /* iterates a list, with context */
  572. {
  573. if (xs_type(list) != XSTYPE_LIST)
  574. return 0;
  575. int goon = 1;
  576. const char *p = list;
  577. /* skip the start of the list */
  578. if (*ctxt == 0)
  579. *ctxt = 1 + _XS_TYPE_SIZE;
  580. p += *ctxt;
  581. /* an element? */
  582. if (xs_type(p) == XSTYPE_LITEM) {
  583. p++;
  584. *value = p;
  585. p += xs_size(*value);
  586. }
  587. else {
  588. /* end of list */
  589. goon = 0;
  590. }
  591. /* update the context */
  592. *ctxt = p - list;
  593. return goon;
  594. }
  595. int xs_list_len(const xs_list *list)
  596. /* returns the number of elements in the list */
  597. {
  598. XS_ASSERT_TYPE_NULL(list, XSTYPE_LIST);
  599. int c = 0, ct = 0;
  600. const xs_val *v;
  601. while (xs_list_next(list, &v, &ct))
  602. c++;
  603. return c;
  604. }
  605. const xs_val *xs_list_get(const xs_list *list, int num)
  606. /* returns the element #num */
  607. {
  608. XS_ASSERT_TYPE(list, XSTYPE_LIST);
  609. if (num < 0)
  610. num = xs_list_len(list) + num;
  611. int c = 0, ct = 0;
  612. const xs_val *v;
  613. while (xs_list_next(list, &v, &ct)) {
  614. if (c == num)
  615. return v;
  616. c++;
  617. }
  618. return NULL;
  619. }
  620. xs_list *xs_list_del(xs_list *list, int num)
  621. /* deletes element #num */
  622. {
  623. XS_ASSERT_TYPE(list, XSTYPE_LIST);
  624. const xs_val *v;
  625. if ((v = xs_list_get(list, num)) != NULL)
  626. list = xs_collapse(list, v - 1 - list, xs_size(v - 1));
  627. return list;
  628. }
  629. xs_list *xs_list_insert(xs_list *list, int num, const xs_val *data)
  630. /* inserts an element at #num position */
  631. {
  632. XS_ASSERT_TYPE(list, XSTYPE_LIST);
  633. const xs_val *v;
  634. int offset;
  635. if ((v = xs_list_get(list, num)) != NULL)
  636. offset = v - list;
  637. else
  638. offset = xs_size(list);
  639. return _xs_list_write_litem(list, offset - 1, data, xs_size(data));
  640. }
  641. xs_list *xs_list_set(xs_list *list, int num, const xs_val *data)
  642. /* sets the element at #num position */
  643. {
  644. XS_ASSERT_TYPE(list, XSTYPE_LIST);
  645. list = xs_list_del(list, num);
  646. list = xs_list_insert(list, num, data);
  647. return list;
  648. }
  649. xs_list *xs_list_dequeue(xs_list *list, xs_val **data, int last)
  650. /* gets a copy of the first or last element of a list, shrinking it */
  651. {
  652. XS_ASSERT_TYPE(list, XSTYPE_LIST);
  653. int ct = 0;
  654. const xs_val *v = NULL;
  655. if (!last) {
  656. /* get the first */
  657. xs_list_next(list, &v, &ct);
  658. }
  659. else {
  660. /* iterate to the end */
  661. while (xs_list_next(list, &v, &ct));
  662. }
  663. if (v != NULL) {
  664. *data = xs_dup(v);
  665. /* collapse from the address of the element */
  666. list = xs_collapse(list, v - 1 - list, xs_size(v - 1));
  667. }
  668. return list;
  669. }
  670. int xs_list_in(const xs_list *list, const xs_val *val)
  671. /* returns the position of val in list or -1 */
  672. {
  673. XS_ASSERT_TYPE_NULL(list, XSTYPE_LIST);
  674. int n = 0;
  675. int ct = 0;
  676. const xs_val *v;
  677. int sz = xs_size(val);
  678. while (xs_list_next(list, &v, &ct)) {
  679. if (sz == xs_size(v) && memcmp(val, v, sz) == 0)
  680. return n;
  681. n++;
  682. }
  683. return -1;
  684. }
  685. xs_str *xs_join(const xs_list *list, const char *sep)
  686. /* joins a list into a string */
  687. {
  688. XS_ASSERT_TYPE(list, XSTYPE_LIST);
  689. xs_str *s = NULL;
  690. const xs_val *v;
  691. int c = 0;
  692. int ct = 0;
  693. int offset = 0;
  694. int ssz = strlen(sep);
  695. while (xs_list_next(list, &v, &ct)) {
  696. /* refuse to join non-string values */
  697. if (xs_type(v) == XSTYPE_STRING) {
  698. int sz;
  699. /* add the separator */
  700. if (c != 0 && ssz) {
  701. s = xs_realloc(s, offset + ssz);
  702. memcpy(s + offset, sep, ssz);
  703. offset += ssz;
  704. }
  705. /* add the element */
  706. if ((sz = strlen(v)) > 0) {
  707. s = xs_realloc(s, offset + sz);
  708. memcpy(s + offset, v, sz);
  709. offset += sz;
  710. }
  711. c++;
  712. }
  713. }
  714. /* null-terminate */
  715. s = xs_realloc(s, _xs_blk_size(offset + 1));
  716. s[offset] = '\0';
  717. return s;
  718. }
  719. xs_list *xs_split_n(const char *str, const char *sep, int times)
  720. /* splits a string into a list upto n times */
  721. {
  722. int sz = strlen(sep);
  723. char *ss;
  724. xs_list *list;
  725. list = xs_list_new();
  726. while (times > 0 && (ss = strstr(str, sep)) != NULL) {
  727. /* create a new string with this slice and add it to the list */
  728. xs *s = xs_str_new_sz(str, ss - str);
  729. list = xs_list_append(list, s);
  730. /* skip past the separator */
  731. str = ss + sz;
  732. times--;
  733. }
  734. /* add the rest of the string */
  735. list = xs_list_append(list, str);
  736. return list;
  737. }
  738. xs_list *xs_list_cat(xs_list *l1, const xs_list *l2)
  739. /* concatenates list l2 to l1 */
  740. {
  741. XS_ASSERT_TYPE(l1, XSTYPE_LIST);
  742. XS_ASSERT_TYPE(l2, XSTYPE_LIST);
  743. /* inserts at the end of l1 the content of l2 (skipping header and footer) */
  744. return xs_insert_m(l1, xs_size(l1) - 1,
  745. l2 + 1 + _XS_TYPE_SIZE, xs_size(l2) - (1 + _XS_TYPE_SIZE + 1));
  746. }
  747. /** keyvals **/
  748. int xs_keyval_size(const xs_str *key, const xs_val *value)
  749. /* returns the needed size for a keyval */
  750. {
  751. return 1 + xs_size(key) + xs_size(value);
  752. }
  753. xs_str *xs_keyval_key(const xs_keyval *keyval)
  754. /* returns a pointer to the key of the keyval */
  755. {
  756. return (xs_str *)&keyval[1];
  757. }
  758. xs_val *xs_keyval_value(const xs_keyval *keyval)
  759. /* returns a pointer to the value of the keyval */
  760. {
  761. return (xs_val *)&keyval[1 + xs_size(xs_keyval_key(keyval))];
  762. }
  763. xs_keyval *xs_keyval_make(xs_keyval *keyval, const xs_str *key, const xs_val *value)
  764. /* builds a keyval into mem (should have enough size) */
  765. {
  766. keyval[0] = XSTYPE_KEYVAL;
  767. memcpy(xs_keyval_key(keyval), key, xs_size(key));
  768. memcpy(xs_keyval_value(keyval), value, xs_size(value));
  769. return keyval;
  770. }
  771. /** dicts **/
  772. xs_dict *xs_dict_new(void)
  773. /* creates a new dict */
  774. {
  775. int sz = 1 + _XS_TYPE_SIZE + 1;
  776. xs_dict *d = xs_realloc(NULL, sz);
  777. memset(d, XSTYPE_EOM, sz);
  778. d[0] = XSTYPE_DICT;
  779. _xs_put_size(d, sz);
  780. return d;
  781. }
  782. xs_dict *_xs_dict_write_keyval(xs_dict *dict, int offset, const xs_str *key, const xs_val *value)
  783. /* adds a new keyval to the dict */
  784. {
  785. XS_ASSERT_TYPE(dict, XSTYPE_DICT);
  786. XS_ASSERT_TYPE(key, XSTYPE_STRING);
  787. if (value == NULL)
  788. value = xs_stock(XSTYPE_NULL);
  789. dict = xs_expand(dict, offset, xs_keyval_size(key, value));
  790. xs_keyval_make(&dict[offset], key, value);
  791. return dict;
  792. }
  793. xs_dict *xs_dict_append(xs_dict *dict, const xs_str *key, const xs_val *value)
  794. /* appends a memory block to the dict */
  795. {
  796. return _xs_dict_write_keyval(dict, xs_size(dict) - 1, key, value);
  797. }
  798. xs_dict *xs_dict_prepend(xs_dict *dict, const xs_str *key, const xs_val *value)
  799. /* prepends a memory block to the dict */
  800. {
  801. return _xs_dict_write_keyval(dict, 1 + _XS_TYPE_SIZE, key, value);
  802. }
  803. int xs_dict_next(const xs_dict *dict, const xs_str **key, const xs_val **value, int *ctxt)
  804. /* iterates a dict, with context */
  805. {
  806. if (xs_type(dict) != XSTYPE_DICT)
  807. return 0;
  808. int goon = 1;
  809. char *p = (char *)dict;
  810. /* skip the start of the list */
  811. if (*ctxt == 0)
  812. *ctxt = 1 + _XS_TYPE_SIZE;
  813. p += *ctxt;
  814. /* an element? */
  815. if (xs_type(p) == XSTYPE_KEYVAL) {
  816. p++;
  817. *key = p;
  818. p += xs_size(*key);
  819. *value = p;
  820. p += xs_size(*value);
  821. }
  822. else {
  823. /* end of list */
  824. goon = 0;
  825. }
  826. /* store back the pointer */
  827. *ctxt = p - dict;
  828. return goon;
  829. }
  830. const xs_val *xs_dict_get_def(const xs_dict *dict, const xs_str *key, const xs_val *def)
  831. /* returns the value directed by key, or the default value */
  832. {
  833. XS_ASSERT_TYPE(dict, XSTYPE_DICT);
  834. XS_ASSERT_TYPE(key, XSTYPE_STRING);
  835. const xs_str *k;
  836. const xs_val *v;
  837. int c = 0;
  838. while (xs_dict_next(dict, &k, &v, &c)) {
  839. if (strcmp(k, key) == 0)
  840. return v;
  841. }
  842. return (xs_val *)def;
  843. }
  844. xs_dict *xs_dict_del(xs_dict *dict, const xs_str *key)
  845. /* deletes a key */
  846. {
  847. XS_ASSERT_TYPE(dict, XSTYPE_DICT);
  848. XS_ASSERT_TYPE(key, XSTYPE_STRING);
  849. const xs_str *k;
  850. const xs_val *v;
  851. int c = 0;
  852. while (xs_dict_next(dict, &k, &v, &c)) {
  853. if (strcmp(k, key) == 0) {
  854. /* the address of the item is just behind the key */
  855. char *i = (char *)k - 1;
  856. dict = xs_collapse(dict, i - dict, xs_size(i));
  857. break;
  858. }
  859. }
  860. return dict;
  861. }
  862. xs_dict *xs_dict_set(xs_dict *dict, const xs_str *key, const xs_val *data)
  863. /* sets (replaces) a key */
  864. {
  865. XS_ASSERT_TYPE(dict, XSTYPE_DICT);
  866. XS_ASSERT_TYPE(key, XSTYPE_STRING);
  867. /* delete the possibly existing key */
  868. dict = xs_dict_del(dict, key);
  869. /* add the data */
  870. dict = xs_dict_append(dict, key, data);
  871. return dict;
  872. }
  873. xs_dict *xs_dict_gc(xs_dict *dict)
  874. /* collects garbage (leaked values) inside a dict */
  875. {
  876. /* this kind of dicts does not get garbage */
  877. return dict;
  878. }
  879. /** other values **/
  880. xs_val *xs_val_new(xstype t)
  881. /* adds a new special value */
  882. {
  883. xs_val *v = xs_realloc(NULL, _xs_blk_size(1));
  884. v[0] = t;
  885. return v;
  886. }
  887. /** numbers */
  888. xs_number *xs_number_new(double f)
  889. /* adds a new number value */
  890. {
  891. xs_number *v;
  892. char tmp[64];
  893. snprintf(tmp, sizeof(tmp), "%.15lf", f);
  894. /* strip useless zeros */
  895. if (strchr(tmp, '.') != NULL) {
  896. char *ptr;
  897. for (ptr = tmp + strlen(tmp) - 1; *ptr == '0'; ptr--);
  898. if (*ptr != '.')
  899. ptr++;
  900. *ptr = '\0';
  901. }
  902. /* alloc for the marker and the full string */
  903. v = xs_realloc(NULL, _xs_blk_size(1 + xs_size(tmp)));
  904. v[0] = XSTYPE_NUMBER;
  905. memcpy(&v[1], tmp, xs_size(tmp));
  906. return v;
  907. }
  908. double xs_number_get(const xs_number *v)
  909. /* gets the number as a double */
  910. {
  911. double f = 0.0;
  912. if (xs_type(v) == XSTYPE_NUMBER)
  913. f = atof(&v[1]);
  914. else
  915. if (xs_type(v) == XSTYPE_STRING)
  916. f = atof(v);
  917. return f;
  918. }
  919. const char *xs_number_str(const xs_number *v)
  920. /* gets the number as a string */
  921. {
  922. const char *p = NULL;
  923. if (xs_type(v) == XSTYPE_NUMBER)
  924. p = &v[1];
  925. return p;
  926. }
  927. /** raw data blocks **/
  928. xs_data *xs_data_new(const void *data, int size)
  929. /* returns a new raw data value */
  930. {
  931. xs_data *v;
  932. /* add the overhead (data type + size) */
  933. int total_size = size + 1 + _XS_TYPE_SIZE;
  934. v = xs_realloc(NULL, _xs_blk_size(total_size));
  935. v[0] = XSTYPE_DATA;
  936. _xs_put_size(v, total_size);
  937. memcpy(&v[1 + _XS_TYPE_SIZE], data, size);
  938. return v;
  939. }
  940. int xs_data_size(const xs_data *value)
  941. /* returns the size of the data stored inside value */
  942. {
  943. return _xs_get_size(value) - (1 + _XS_TYPE_SIZE);
  944. }
  945. void xs_data_get(void *data, const xs_data *value)
  946. /* copies the raw data stored inside value into data */
  947. {
  948. memcpy(data, &value[1 + _XS_TYPE_SIZE], xs_data_size(value));
  949. }
  950. void *xs_memmem(const char *haystack, int h_size, const char *needle, int n_size)
  951. /* clone of memmem */
  952. {
  953. char *p, *r = NULL;
  954. int offset = 0;
  955. while (!r && h_size - offset > n_size &&
  956. (p = memchr(haystack + offset, *needle, h_size - offset))) {
  957. if (memcmp(p, needle, n_size) == 0)
  958. r = p;
  959. else
  960. offset = p - haystack + 1;
  961. }
  962. return r;
  963. }
  964. unsigned int xs_hash_func(const char *data, int size)
  965. /* a general purpose hashing function */
  966. {
  967. unsigned int hash = 0x666;
  968. int n;
  969. for (n = 0; n < size; n++) {
  970. hash ^= (unsigned char)data[n];
  971. hash *= 111111111;
  972. }
  973. return hash ^ hash >> 16;
  974. }
  975. #endif /* XS_IMPLEMENTATION */
  976. #endif /* _XS_H */