xs.h 28 KB

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