xs.h 26 KB

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