xs.h 27 KB

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