xs.h 29 KB

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