xs.h 23 KB

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