xs.h 28 KB

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