xs.h 27 KB

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