xs.h 29 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337
  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__, __FUNCTION__)
  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, 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 + 1);
  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;
  600. xs_list *p = (xs_list *)list;
  601. const xs_val *v;
  602. while (xs_list_iter(&p, &v))
  603. c++;
  604. return c;
  605. }
  606. const xs_val *xs_list_get(const xs_list *list, int num)
  607. /* returns the element #num */
  608. {
  609. XS_ASSERT_TYPE(list, XSTYPE_LIST);
  610. if (num < 0)
  611. num = xs_list_len(list) + num;
  612. int c = 0;
  613. xs_list *p = (xs_list *)list;
  614. const xs_val *v;
  615. while (xs_list_iter(&p, &v)) {
  616. if (c == num)
  617. return v;
  618. c++;
  619. }
  620. return NULL;
  621. }
  622. xs_list *xs_list_del(xs_list *list, int num)
  623. /* deletes element #num */
  624. {
  625. XS_ASSERT_TYPE(list, XSTYPE_LIST);
  626. const xs_val *v;
  627. if ((v = xs_list_get(list, num)) != NULL)
  628. list = xs_collapse(list, v - 1 - list, xs_size(v - 1));
  629. return list;
  630. }
  631. xs_list *xs_list_insert(xs_list *list, int num, const xs_val *data)
  632. /* inserts an element at #num position */
  633. {
  634. XS_ASSERT_TYPE(list, XSTYPE_LIST);
  635. const xs_val *v;
  636. int offset;
  637. if ((v = xs_list_get(list, num)) != NULL)
  638. offset = v - list;
  639. else
  640. offset = xs_size(list);
  641. return _xs_list_write_litem(list, offset - 1, data, xs_size(data));
  642. }
  643. xs_list *xs_list_set(xs_list *list, int num, const xs_val *data)
  644. /* sets the element at #num position */
  645. {
  646. XS_ASSERT_TYPE(list, XSTYPE_LIST);
  647. list = xs_list_del(list, num);
  648. list = xs_list_insert(list, num, data);
  649. return list;
  650. }
  651. xs_list *xs_list_dequeue(xs_list *list, xs_val **data, int last)
  652. /* gets a copy of the first or last element of a list, shrinking it */
  653. {
  654. XS_ASSERT_TYPE(list, XSTYPE_LIST);
  655. xs_list *p = list;
  656. const xs_val *v = NULL;
  657. if (!last) {
  658. /* get the first */
  659. xs_list_iter(&p, &v);
  660. }
  661. else {
  662. /* iterate to the end */
  663. while (xs_list_iter(&p, &v));
  664. }
  665. if (v != NULL) {
  666. *data = xs_dup(v);
  667. /* collapse from the address of the element */
  668. list = xs_collapse(list, v - 1 - list, xs_size(v - 1));
  669. }
  670. return list;
  671. }
  672. int xs_list_in(const xs_list *list, const xs_val *val)
  673. /* returns the position of val in list or -1 */
  674. {
  675. XS_ASSERT_TYPE_NULL(list, XSTYPE_LIST);
  676. int n = 0;
  677. xs_list *p = (xs_list *)list;
  678. const xs_val *v;
  679. int sz = xs_size(val);
  680. while (xs_list_iter(&p, &v)) {
  681. if (sz == xs_size(v) && memcmp(val, v, sz) == 0)
  682. return n;
  683. n++;
  684. }
  685. return -1;
  686. }
  687. xs_str *xs_join(const xs_list *list, const char *sep)
  688. /* joins a list into a string */
  689. {
  690. XS_ASSERT_TYPE(list, XSTYPE_LIST);
  691. xs_str *s = NULL;
  692. xs_list *p = (xs_list *)list;
  693. const xs_val *v;
  694. int c = 0;
  695. int offset = 0;
  696. int ssz = strlen(sep);
  697. while (xs_list_iter(&p, &v)) {
  698. /* refuse to join non-string values */
  699. if (xs_type(v) == XSTYPE_STRING) {
  700. int sz;
  701. /* add the separator */
  702. if (c != 0 && ssz) {
  703. s = xs_realloc(s, offset + ssz);
  704. memcpy(s + offset, sep, ssz);
  705. offset += ssz;
  706. }
  707. /* add the element */
  708. if ((sz = strlen(v)) > 0) {
  709. s = xs_realloc(s, offset + sz);
  710. memcpy(s + offset, v, sz);
  711. offset += sz;
  712. }
  713. c++;
  714. }
  715. }
  716. /* null-terminate */
  717. s = xs_realloc(s, _xs_blk_size(offset + 1));
  718. s[offset] = '\0';
  719. return s;
  720. }
  721. xs_list *xs_split_n(const char *str, const char *sep, int times)
  722. /* splits a string into a list upto n times */
  723. {
  724. int sz = strlen(sep);
  725. char *ss;
  726. xs_list *list;
  727. list = xs_list_new();
  728. while (times > 0 && (ss = strstr(str, sep)) != NULL) {
  729. /* create a new string with this slice and add it to the list */
  730. xs *s = xs_str_new_sz(str, ss - str);
  731. list = xs_list_append(list, s);
  732. /* skip past the separator */
  733. str = ss + sz;
  734. times--;
  735. }
  736. /* add the rest of the string */
  737. list = xs_list_append(list, str);
  738. return list;
  739. }
  740. xs_list *xs_list_cat(xs_list *l1, const xs_list *l2)
  741. /* concatenates list l2 to l1 */
  742. {
  743. XS_ASSERT_TYPE(l1, XSTYPE_LIST);
  744. XS_ASSERT_TYPE(l2, XSTYPE_LIST);
  745. /* inserts at the end of l1 the content of l2 (skipping header and footer) */
  746. return xs_insert_m(l1, xs_size(l1) - 1,
  747. l2 + 1 + _XS_TYPE_SIZE, xs_size(l2) - (1 + _XS_TYPE_SIZE + 1));
  748. }
  749. /** keyvals **/
  750. int xs_keyval_size(const xs_str *key, const xs_val *value)
  751. /* returns the needed size for a keyval */
  752. {
  753. return 1 + xs_size(key) + xs_size(value);
  754. }
  755. xs_str *xs_keyval_key(const xs_keyval *keyval)
  756. /* returns a pointer to the key of the keyval */
  757. {
  758. return (xs_str *)&keyval[1];
  759. }
  760. xs_val *xs_keyval_value(const xs_keyval *keyval)
  761. /* returns a pointer to the value of the keyval */
  762. {
  763. return (xs_val *)&keyval[1 + xs_size(xs_keyval_key(keyval))];
  764. }
  765. xs_keyval *xs_keyval_make(xs_keyval *keyval, const xs_str *key, const xs_val *value)
  766. /* builds a keyval into mem (should have enough size) */
  767. {
  768. keyval[0] = XSTYPE_KEYVAL;
  769. memcpy(xs_keyval_key(keyval), key, xs_size(key));
  770. memcpy(xs_keyval_value(keyval), value, xs_size(value));
  771. return keyval;
  772. }
  773. /** dicts **/
  774. xs_dict *xs_dict_new(void)
  775. /* creates a new dict */
  776. {
  777. int sz = 1 + _XS_TYPE_SIZE + 1;
  778. xs_dict *d = xs_realloc(NULL, sz);
  779. memset(d, XSTYPE_EOM, sz);
  780. d[0] = XSTYPE_DICT;
  781. _xs_put_size(d, sz);
  782. return d;
  783. }
  784. xs_dict *_xs_dict_write_keyval(xs_dict *dict, int offset, const xs_str *key, const xs_val *value)
  785. /* adds a new keyval to the dict */
  786. {
  787. XS_ASSERT_TYPE(dict, XSTYPE_DICT);
  788. XS_ASSERT_TYPE(key, XSTYPE_STRING);
  789. if (value == NULL)
  790. value = xs_stock(XSTYPE_NULL);
  791. dict = xs_expand(dict, offset, xs_keyval_size(key, value));
  792. xs_keyval_make(&dict[offset], key, value);
  793. return dict;
  794. }
  795. xs_dict *xs_dict_append(xs_dict *dict, const xs_str *key, const xs_val *value)
  796. /* appends a memory block to the dict */
  797. {
  798. return _xs_dict_write_keyval(dict, xs_size(dict) - 1, key, value);
  799. }
  800. xs_dict *xs_dict_prepend(xs_dict *dict, const xs_str *key, const xs_val *value)
  801. /* prepends a memory block to the dict */
  802. {
  803. return _xs_dict_write_keyval(dict, 1 + _XS_TYPE_SIZE, key, value);
  804. }
  805. int xs_dict_next(const xs_dict *dict, const xs_str **key, const xs_val **value, int *ctxt)
  806. /* iterates a dict, with context */
  807. {
  808. if (xs_type(dict) != XSTYPE_DICT)
  809. return 0;
  810. int goon = 1;
  811. char *p = (char *)dict;
  812. /* skip the start of the list */
  813. if (*ctxt == 0)
  814. *ctxt = 1 + _XS_TYPE_SIZE;
  815. p += *ctxt;
  816. /* an element? */
  817. if (xs_type(p) == XSTYPE_KEYVAL) {
  818. p++;
  819. *key = p;
  820. p += xs_size(*key);
  821. *value = p;
  822. p += xs_size(*value);
  823. }
  824. else {
  825. /* end of list */
  826. goon = 0;
  827. }
  828. /* store back the pointer */
  829. *ctxt = p - dict;
  830. return goon;
  831. }
  832. const xs_val *xs_dict_get_def(const xs_dict *dict, const xs_str *key, const xs_val *def)
  833. /* returns the value directed by key, or the default value */
  834. {
  835. XS_ASSERT_TYPE(dict, XSTYPE_DICT);
  836. XS_ASSERT_TYPE(key, XSTYPE_STRING);
  837. const xs_str *k;
  838. const xs_val *v;
  839. int c = 0;
  840. while (xs_dict_next(dict, &k, &v, &c)) {
  841. if (strcmp(k, key) == 0)
  842. return v;
  843. }
  844. return (xs_val *)def;
  845. }
  846. xs_dict *xs_dict_del(xs_dict *dict, const xs_str *key)
  847. /* deletes a key */
  848. {
  849. XS_ASSERT_TYPE(dict, XSTYPE_DICT);
  850. XS_ASSERT_TYPE(key, XSTYPE_STRING);
  851. const xs_str *k;
  852. const xs_val *v;
  853. int c = 0;
  854. while (xs_dict_next(dict, &k, &v, &c)) {
  855. if (strcmp(k, key) == 0) {
  856. /* the address of the item is just behind the key */
  857. char *i = (char *)k - 1;
  858. dict = xs_collapse(dict, i - dict, xs_size(i));
  859. break;
  860. }
  861. }
  862. return dict;
  863. }
  864. xs_dict *xs_dict_set(xs_dict *dict, const xs_str *key, const xs_val *data)
  865. /* sets (replaces) a key */
  866. {
  867. XS_ASSERT_TYPE(dict, XSTYPE_DICT);
  868. XS_ASSERT_TYPE(key, XSTYPE_STRING);
  869. /* delete the possibly existing key */
  870. dict = xs_dict_del(dict, key);
  871. /* add the data */
  872. dict = xs_dict_append(dict, key, data);
  873. return dict;
  874. }
  875. xs_dict *xs_dict_gc(xs_dict *dict)
  876. /* collects garbage (leaked values) inside a dict */
  877. {
  878. /* this kind of dicts does not get garbage */
  879. return dict;
  880. }
  881. /** other values **/
  882. xs_val *xs_val_new(xstype t)
  883. /* adds a new special value */
  884. {
  885. xs_val *v = xs_realloc(NULL, _xs_blk_size(1));
  886. v[0] = t;
  887. return v;
  888. }
  889. /** numbers */
  890. xs_number *xs_number_new(double f)
  891. /* adds a new number value */
  892. {
  893. xs_number *v;
  894. char tmp[64];
  895. snprintf(tmp, sizeof(tmp), "%.15lf", f);
  896. /* strip useless zeros */
  897. if (strchr(tmp, '.') != NULL) {
  898. char *ptr;
  899. for (ptr = tmp + strlen(tmp) - 1; *ptr == '0'; ptr--);
  900. if (*ptr != '.')
  901. ptr++;
  902. *ptr = '\0';
  903. }
  904. /* alloc for the marker and the full string */
  905. v = xs_realloc(NULL, _xs_blk_size(1 + xs_size(tmp)));
  906. v[0] = XSTYPE_NUMBER;
  907. memcpy(&v[1], tmp, xs_size(tmp));
  908. return v;
  909. }
  910. double xs_number_get(const xs_number *v)
  911. /* gets the number as a double */
  912. {
  913. double f = 0.0;
  914. if (xs_type(v) == XSTYPE_NUMBER)
  915. f = atof(&v[1]);
  916. else
  917. if (xs_type(v) == XSTYPE_STRING)
  918. f = atof(v);
  919. return f;
  920. }
  921. const char *xs_number_str(const xs_number *v)
  922. /* gets the number as a string */
  923. {
  924. const char *p = NULL;
  925. if (xs_type(v) == XSTYPE_NUMBER)
  926. p = &v[1];
  927. return p;
  928. }
  929. /** raw data blocks **/
  930. xs_data *xs_data_new(const void *data, int size)
  931. /* returns a new raw data value */
  932. {
  933. xs_data *v;
  934. /* add the overhead (data type + size) */
  935. int total_size = size + 1 + _XS_TYPE_SIZE;
  936. v = xs_realloc(NULL, _xs_blk_size(total_size));
  937. v[0] = XSTYPE_DATA;
  938. _xs_put_size(v, total_size);
  939. memcpy(&v[1 + _XS_TYPE_SIZE], data, size);
  940. return v;
  941. }
  942. int xs_data_size(const xs_data *value)
  943. /* returns the size of the data stored inside value */
  944. {
  945. return _xs_get_size(value + 1) - (1 + _XS_TYPE_SIZE);
  946. }
  947. void xs_data_get(void *data, const xs_data *value)
  948. /* copies the raw data stored inside value into data */
  949. {
  950. memcpy(data, &value[1 + _XS_TYPE_SIZE], xs_data_size(value));
  951. }
  952. void *xs_memmem(const char *haystack, int h_size, const char *needle, int n_size)
  953. /* clone of memmem */
  954. {
  955. char *p, *r = NULL;
  956. int offset = 0;
  957. while (!r && h_size - offset > n_size &&
  958. (p = memchr(haystack + offset, *needle, h_size - offset))) {
  959. if (memcmp(p, needle, n_size) == 0)
  960. r = p;
  961. else
  962. offset = p - haystack + 1;
  963. }
  964. return r;
  965. }
  966. unsigned int xs_hash_func(const char *data, int size)
  967. /* a general purpose hashing function */
  968. {
  969. unsigned int hash = 0x666;
  970. int n;
  971. for (n = 0; n < size; n++) {
  972. hash ^= data[n];
  973. hash *= 111111111;
  974. }
  975. return hash ^ hash >> 16;
  976. }
  977. #endif /* XS_IMPLEMENTATION */
  978. #endif /* _XS_H */