xs.h 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794
  1. /* copyright (c) 2022 grunfink - 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_NULL = 0x18,
  14. XSTYPE_TRUE = 0x06,
  15. XSTYPE_FALSE = 0x15,
  16. XSTYPE_LIST = 0x11,
  17. XSTYPE_LITEM = 0x1f,
  18. XSTYPE_EOL = 0x12,
  19. XSTYPE_DICT = 0x13,
  20. XSTYPE_DITEM = 0x1e,
  21. XSTYPE_EOD = 0x14,
  22. XSTYPE_NUMBER = 0x17,
  23. XSTYPE_STRING = 0x02
  24. } xstype;
  25. /* dynamic strings */
  26. typedef char d_char;
  27. /* auto-destroyable strings */
  28. #define xs __attribute__ ((__cleanup__ (_xs_destroy))) d_char
  29. void *xs_free(void *ptr);
  30. void *_xs_realloc(void *ptr, size_t size, const char *file, int line);
  31. #define xs_realloc(ptr, size) _xs_realloc(ptr, size, __FILE__, __LINE__)
  32. int _xs_blk_size(int sz);
  33. void _xs_destroy(char **var);
  34. #define xs_debug() raise(SIGTRAP)
  35. xstype xs_type(const char *data);
  36. int xs_size(const char *data);
  37. int xs_is_null(const char *data);
  38. d_char *xs_dup(const char *data);
  39. d_char *xs_expand(d_char *data, int offset, int size);
  40. d_char *xs_collapse(d_char *data, int offset, int size);
  41. d_char *xs_insert_m(d_char *data, int offset, const char *mem, int size);
  42. #define xs_insert(data, offset, data2) xs_insert_m(data, offset, data2, xs_size(data2))
  43. #define xs_append_m(data, mem, size) xs_insert_m(data, xs_size(data) - 1, mem, size)
  44. d_char *xs_str_new(const char *str);
  45. #define xs_str_cat(str1, str2) xs_insert(str1, xs_size(str1) - 1, str2)
  46. d_char *xs_replace_i(d_char *str, const char *sfrom, const char *sto);
  47. #define xs_replace(str, sfrom, sto) xs_replace_i(xs_dup(str), sfrom, sto)
  48. d_char *xs_fmt(const char *fmt, ...);
  49. int xs_str_in(const char *haystack, const char *needle);
  50. int xs_startswith(const char *str, const char *prefix);
  51. int xs_endswith(const char *str, const char *postfix);
  52. d_char *xs_crop(d_char *str, int start, int end);
  53. d_char *xs_strip(d_char *str);
  54. d_char *xs_tolower(d_char *str);
  55. d_char *xs_list_new(void);
  56. d_char *xs_list_append_m(d_char *list, const char *mem, int dsz);
  57. #define xs_list_append(list, data) xs_list_append_m(list, data, xs_size(data))
  58. int xs_list_iter(char **list, char **value);
  59. int xs_list_len(char *list);
  60. char *xs_list_get(char *list, int num);
  61. int xs_list_in(char *list, char *val);
  62. d_char *xs_join(char *list, const char *sep);
  63. d_char *xs_split_n(const char *str, const char *sep, int times);
  64. #define xs_split(str, sep) xs_split_n(str, sep, 0xfffffff)
  65. d_char *xs_dict_new(void);
  66. d_char *xs_dict_append_m(d_char *dict, const char *key, const char *mem, int dsz);
  67. #define xs_dict_append(dict, key, data) xs_dict_append_m(dict, key, data, xs_size(data))
  68. int xs_dict_iter(char **dict, char **key, char **value);
  69. char *xs_dict_get(char *dict, const char *key);
  70. d_char *xs_dict_del(d_char *dict, const char *key);
  71. d_char *xs_dict_set(d_char *dict, const char *key, const char *data);
  72. d_char *xs_val_new(xstype t);
  73. d_char *xs_number_new(double f);
  74. double xs_number_get(const char *v);
  75. const char *xs_number_str(const char *v);
  76. #ifdef XS_IMPLEMENTATION
  77. void *_xs_realloc(void *ptr, size_t size, const char *file, int line)
  78. {
  79. d_char *ndata = realloc(ptr, size);
  80. if (ndata == NULL) {
  81. fprintf(stderr, "**OUT OF MEMORY**\n");
  82. abort();
  83. }
  84. #ifdef XS_DEBUG
  85. if (ndata != ptr) {
  86. FILE *f = fopen("xs_memory.out", "a");
  87. if (ptr != NULL)
  88. fprintf(f, "%p b\n", ptr);
  89. fprintf(f, "%p a %ld %s %d\n", ndata, size, file, line);
  90. fclose(f);
  91. }
  92. #endif
  93. return ndata;
  94. }
  95. void *xs_free(void *ptr)
  96. {
  97. #ifdef XS_DEBUG
  98. if (ptr != NULL) {
  99. FILE *f = fopen("xs_memory.out", "a");
  100. fprintf(f, "%p b\n", ptr);
  101. fclose(f);
  102. }
  103. #endif
  104. free(ptr);
  105. return NULL;
  106. }
  107. void _xs_destroy(char **var)
  108. {
  109. /*
  110. if (_xs_debug)
  111. printf("_xs_destroy %p\n", var);
  112. */
  113. xs_free(*var);
  114. }
  115. int _xs_blk_size(int sz)
  116. /* calculates the block size */
  117. {
  118. int blk_size = 4096;
  119. if (sz < 256)
  120. blk_size = 32;
  121. else
  122. if (sz < 4096)
  123. blk_size = 256;
  124. return ((((sz) + blk_size) / blk_size) * blk_size);
  125. }
  126. xstype xs_type(const char *data)
  127. /* return the type of data */
  128. {
  129. xstype t;
  130. switch (data[0]) {
  131. case XSTYPE_NULL:
  132. case XSTYPE_TRUE:
  133. case XSTYPE_FALSE:
  134. case XSTYPE_LIST:
  135. case XSTYPE_EOL:
  136. case XSTYPE_DICT:
  137. case XSTYPE_EOD:
  138. case XSTYPE_LITEM:
  139. case XSTYPE_DITEM:
  140. case XSTYPE_NUMBER:
  141. t = data[0];
  142. break;
  143. default:
  144. t = XSTYPE_STRING;
  145. break;
  146. }
  147. return t;
  148. }
  149. int xs_size(const char *data)
  150. /* returns the size of data in bytes */
  151. {
  152. int len = 0;
  153. int c = 0;
  154. const char *p;
  155. if (data == NULL)
  156. return 0;
  157. switch (xs_type(data)) {
  158. case XSTYPE_STRING:
  159. len = strlen(data) + 1;
  160. break;
  161. case XSTYPE_LIST:
  162. /* look for a balanced EOL */
  163. do {
  164. c += data[len] == XSTYPE_LIST ? 1 : data[len] == XSTYPE_EOL ? -1 : 0;
  165. len++;
  166. } while (c);
  167. break;
  168. case XSTYPE_DICT:
  169. /* look for a balanced EOD */
  170. do {
  171. c += data[len] == XSTYPE_DICT ? 1 : data[len] == XSTYPE_EOD ? -1 : 0;
  172. len++;
  173. } while (c);
  174. break;
  175. case XSTYPE_DITEM:
  176. /* calculate the size of the key and the value */
  177. p = data + 1;
  178. p += xs_size(p);
  179. p += xs_size(p);
  180. len = p - data;
  181. break;
  182. case XSTYPE_LITEM:
  183. /* it's the size of the item + 1 */
  184. p = data + 1;
  185. p += xs_size(p);
  186. len = p - data;
  187. break;
  188. case XSTYPE_NUMBER:
  189. len = 1 + xs_size(data + 1);
  190. break;
  191. default:
  192. len = 1;
  193. }
  194. return len;
  195. }
  196. int xs_is_null(const char *data)
  197. /* checks for null */
  198. {
  199. return !!(data == NULL || xs_type(data) == XSTYPE_NULL);
  200. }
  201. d_char *xs_dup(const char *data)
  202. /* creates a duplicate of data */
  203. {
  204. int sz = xs_size(data);
  205. d_char *s = xs_realloc(NULL, _xs_blk_size(sz));
  206. memcpy(s, data, sz);
  207. return s;
  208. }
  209. d_char *xs_expand(d_char *data, int offset, int size)
  210. /* opens a hole in data */
  211. {
  212. int sz = xs_size(data);
  213. /* open room */
  214. if (sz == 0 || _xs_blk_size(sz) != _xs_blk_size(sz + size))
  215. data = xs_realloc(data, _xs_blk_size(sz + size));
  216. /* move up the rest of the data */
  217. if (data != NULL)
  218. memmove(data + offset + size, data + offset, sz - offset);
  219. return data;
  220. }
  221. d_char *xs_collapse(d_char *data, int offset, int size)
  222. /* shrinks data */
  223. {
  224. int sz = xs_size(data);
  225. int n;
  226. /* don't try to delete beyond the limit */
  227. if (offset + size > sz)
  228. size = sz - offset;
  229. /* shrink total size */
  230. sz -= size;
  231. for (n = offset; n < sz; n++)
  232. data[n] = data[n + size];
  233. return xs_realloc(data, _xs_blk_size(sz));
  234. }
  235. d_char *xs_insert_m(d_char *data, int offset, const char *mem, int size)
  236. /* inserts a memory block */
  237. {
  238. data = xs_expand(data, offset, size);
  239. memcpy(data + offset, mem, size);
  240. return data;
  241. }
  242. /** strings **/
  243. d_char *xs_str_new(const char *str)
  244. /* creates a new string */
  245. {
  246. return xs_insert(NULL, 0, str ? str : "");
  247. }
  248. d_char *xs_replace_i(d_char *str, const char *sfrom, const char *sto)
  249. /* replaces inline all sfrom with sto */
  250. {
  251. int sfsz = strlen(sfrom);
  252. int stsz = strlen(sto);
  253. char *ss;
  254. int offset = 0;
  255. while ((ss = strstr(str + offset, sfrom)) != NULL) {
  256. int n_offset = ss - str;
  257. str = xs_collapse(str, n_offset, sfsz);
  258. str = xs_expand(str, n_offset, stsz);
  259. memcpy(str + n_offset, sto, stsz);
  260. offset = n_offset + stsz;
  261. }
  262. return str;
  263. }
  264. d_char *xs_fmt(const char *fmt, ...)
  265. /* formats a string with printf()-like marks */
  266. {
  267. int n;
  268. d_char *s = NULL;
  269. va_list ap;
  270. va_start(ap, fmt);
  271. n = vsnprintf(s, 0, fmt, ap);
  272. va_end(ap);
  273. if (n > 0) {
  274. s = xs_realloc(NULL, _xs_blk_size(n + 1));
  275. va_start(ap, fmt);
  276. vsnprintf(s, n + 1, fmt, ap);
  277. va_end(ap);
  278. }
  279. return s;
  280. }
  281. int xs_str_in(const char *haystack, const char *needle)
  282. /* finds needle in haystack and returns the offset or -1 */
  283. {
  284. char *s;
  285. int r = -1;
  286. if ((s = strstr(haystack, needle)) != NULL)
  287. r = s - haystack;
  288. return r;
  289. }
  290. int xs_startswith(const char *str, const char *prefix)
  291. /* returns true if str starts with prefix */
  292. {
  293. return !!(xs_str_in(str, prefix) == 0);
  294. }
  295. int xs_endswith(const char *str, const char *postfix)
  296. /* returns true if str ends with postfix */
  297. {
  298. int ssz = strlen(str);
  299. int psz = strlen(postfix);
  300. return !!(ssz >= psz && memcmp(postfix, str + ssz - psz, psz) == 0);
  301. }
  302. d_char *xs_crop(d_char *str, int start, int end)
  303. /* crops the d_char to be only from start to end */
  304. {
  305. int sz = strlen(str);
  306. if (end <= 0)
  307. end = sz + end;
  308. /* crop from the top */
  309. str[end] = '\0';
  310. /* crop from the bottom */
  311. str = xs_collapse(str, 0, start);
  312. return str;
  313. }
  314. d_char *xs_strip(d_char *str)
  315. /* strips the string of blanks from the start and the end */
  316. {
  317. int s, e;
  318. for (s = 0; isspace(str[s]); s++);
  319. for (e = strlen(str); e > 0 && isspace(str[e - 1]); e--);
  320. return xs_crop(str, s, e);
  321. }
  322. d_char *xs_tolower(d_char *str)
  323. /* convert to lowercase */
  324. {
  325. int n;
  326. for (n = 0; str[n]; n++)
  327. str[n] = tolower(str[n]);
  328. return str;
  329. }
  330. /** lists **/
  331. d_char *xs_list_new(void)
  332. /* creates a new list */
  333. {
  334. d_char *list;
  335. list = xs_realloc(NULL, _xs_blk_size(2));
  336. list[0] = XSTYPE_LIST;
  337. list[1] = XSTYPE_EOL;
  338. return list;
  339. }
  340. d_char *xs_list_append_m(d_char *list, const char *mem, int dsz)
  341. /* adds a memory block to the list */
  342. {
  343. char c = XSTYPE_LITEM;
  344. int lsz = xs_size(list);
  345. list = xs_insert_m(list, lsz - 1, &c, 1);
  346. list = xs_insert_m(list, lsz, mem, dsz);
  347. return list;
  348. }
  349. int xs_list_iter(char **list, char **value)
  350. /* iterates a list value */
  351. {
  352. int goon = 1;
  353. char *p;
  354. if (list == NULL || *list == NULL)
  355. return 0;
  356. p = *list;
  357. /* skip a possible start of the list */
  358. if (*p == XSTYPE_LIST)
  359. p++;
  360. /* an element? */
  361. if (*p == XSTYPE_LITEM) {
  362. p++;
  363. *value = p;
  364. p += xs_size(*value);
  365. }
  366. else {
  367. /* end of list */
  368. p++;
  369. goon = 0;
  370. }
  371. /* store back the pointer */
  372. *list = p;
  373. return goon;
  374. }
  375. int xs_list_len(char *list)
  376. /* returns the number of elements in the list */
  377. {
  378. int c = 0;
  379. char *v;
  380. while (xs_list_iter(&list, &v))
  381. c++;
  382. return c;
  383. }
  384. char *xs_list_get(char *list, int num)
  385. /* returns the element #num */
  386. {
  387. char *v;
  388. int c = 0;
  389. if (num < 0)
  390. num = xs_list_len(list) + num;
  391. while (xs_list_iter(&list, &v)) {
  392. if (c == num)
  393. return v;
  394. c++;
  395. }
  396. return NULL;
  397. }
  398. int xs_list_in(char *list, char *val)
  399. /* returns the position of val in list or -1 */
  400. {
  401. int n = 0;
  402. char *v;
  403. int sz = xs_size(val);
  404. while (xs_list_iter(&list, &v)) {
  405. if (sz == xs_size(v) && memcmp(val, v, sz) == 0)
  406. return n;
  407. n++;
  408. }
  409. return -1;
  410. }
  411. d_char *xs_join(char *list, const char *sep)
  412. /* joins a list into a string */
  413. {
  414. d_char *s;
  415. char *v;
  416. int c = 0;
  417. s = xs_str_new(NULL);
  418. while (xs_list_iter(&list, &v)) {
  419. /* refuse to join non-string values */
  420. if (xs_type(v) == XSTYPE_STRING) {
  421. /* add the separator */
  422. if (c != 0)
  423. s = xs_str_cat(s, sep);
  424. /* add the element */
  425. s = xs_str_cat(s, v);
  426. c++;
  427. }
  428. }
  429. return s;
  430. }
  431. d_char *xs_split_n(const char *str, const char *sep, int times)
  432. /* splits a string into a list upto n times */
  433. {
  434. int sz = strlen(sep);
  435. char *ss;
  436. d_char *list;
  437. list = xs_list_new();
  438. while (times > 0 && (ss = strstr(str, sep)) != NULL) {
  439. /* add the first part (without the asciiz) */
  440. list = xs_list_append_m(list, str, ss - str);
  441. /* add the asciiz */
  442. list = xs_str_cat(list, "");
  443. /* skip past the separator */
  444. str = ss + sz;
  445. times--;
  446. }
  447. /* add the rest of the string */
  448. list = xs_list_append(list, str);
  449. return list;
  450. }
  451. /** dicts **/
  452. d_char *xs_dict_new(void)
  453. /* creates a new dict */
  454. {
  455. d_char *dict;
  456. dict = xs_realloc(NULL, _xs_blk_size(2));
  457. dict[0] = XSTYPE_DICT;
  458. dict[1] = XSTYPE_EOD;
  459. return dict;
  460. }
  461. d_char *xs_dict_append_m(d_char *dict, const char *key, const char *mem, int dsz)
  462. /* adds a memory block to the dict */
  463. {
  464. char c = XSTYPE_DITEM;
  465. int sz = xs_size(dict);
  466. int ksz = xs_size(key);
  467. dict = xs_insert_m(dict, sz - 1, &c, 1);
  468. dict = xs_insert_m(dict, sz, key, ksz);
  469. dict = xs_insert_m(dict, sz + ksz, mem, dsz);
  470. return dict;
  471. }
  472. int xs_dict_iter(char **dict, char **key, char **value)
  473. /* iterates a dict value */
  474. {
  475. int goon = 1;
  476. char *p;
  477. if (dict == NULL || *dict == NULL)
  478. return 0;
  479. p = *dict;
  480. /* skip a possible start of the list */
  481. if (*p == XSTYPE_DICT)
  482. p++;
  483. /* an element? */
  484. if (*p == XSTYPE_DITEM) {
  485. p++;
  486. *key = p;
  487. p += xs_size(*key);
  488. *value = p;
  489. p += xs_size(*value);
  490. }
  491. else {
  492. /* end of list */
  493. p++;
  494. goon = 0;
  495. }
  496. /* store back the pointer */
  497. *dict = p;
  498. return goon;
  499. }
  500. char *xs_dict_get(char *dict, const char *key)
  501. /* returns the value directed by key */
  502. {
  503. char *k, *v;
  504. while (xs_dict_iter(&dict, &k, &v)) {
  505. if (strcmp(k, key) == 0)
  506. return v;
  507. }
  508. return NULL;
  509. }
  510. d_char *xs_dict_del(d_char *dict, const char *key)
  511. /* deletes a key */
  512. {
  513. char *k, *v;
  514. char *p = dict;
  515. while (xs_dict_iter(&p, &k, &v)) {
  516. if (strcmp(k, key) == 0) {
  517. /* the address of the item is just behind the key */
  518. char *i = k - 1;
  519. dict = xs_collapse(dict, i - dict, xs_size(i));
  520. break;
  521. }
  522. }
  523. return dict;
  524. }
  525. d_char *xs_dict_set(d_char *dict, const char *key, const char *data)
  526. /* sets (replaces) a key */
  527. {
  528. /* delete the possibly existing key */
  529. dict = xs_dict_del(dict, key);
  530. /* append the data */
  531. dict = xs_dict_append(dict, key, data);
  532. return dict;
  533. }
  534. /** other values **/
  535. d_char *xs_val_new(xstype t)
  536. /* adds a new special value */
  537. {
  538. d_char *v = xs_realloc(NULL, _xs_blk_size(1));
  539. v[0] = t;
  540. return v;
  541. }
  542. /** numbers */
  543. d_char *xs_number_new(double f)
  544. /* adds a new number value */
  545. {
  546. d_char *v;
  547. char tmp[64];
  548. snprintf(tmp, sizeof(tmp), "%.15lf", f);
  549. /* strip useless zeros */
  550. if (strchr(tmp, '.') != NULL) {
  551. char *ptr;
  552. for (ptr = tmp + strlen(tmp) - 1; *ptr == '0'; ptr--);
  553. if (*ptr != '.')
  554. ptr++;
  555. *ptr = '\0';
  556. }
  557. /* alloc for the marker and the full string */
  558. v = xs_realloc(NULL, _xs_blk_size(1 + xs_size(tmp)));
  559. v[0] = XSTYPE_NUMBER;
  560. memcpy(&v[1], tmp, xs_size(tmp));
  561. return v;
  562. }
  563. double xs_number_get(const char *v)
  564. /* gets the number as a double */
  565. {
  566. double f = 0.0;
  567. if (v != NULL && v[0] == XSTYPE_NUMBER)
  568. f = atof(&v[1]);
  569. return f;
  570. }
  571. const char *xs_number_str(const char *v)
  572. /* gets the number as a string */
  573. {
  574. const char *p = NULL;
  575. if (v != NULL && v[0] == XSTYPE_NUMBER)
  576. p = &v[1];
  577. return p;
  578. }
  579. #endif /* XS_IMPLEMENTATION */
  580. #endif /* _XS_H */