xs.h 24 KB

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