xs.h 26 KB

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