xs.h 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891
  1. /* copyright (c) 2022 grunfink - MIT license */
  2. #ifndef _XS_H
  3. #define _XS_H
  4. #include <stdio.h>
  5. #include <string.h>
  6. #include <stdlib.h>
  7. #include <ctype.h>
  8. #include <unistd.h>
  9. #include <stdarg.h>
  10. #include <signal.h>
  11. #include <errno.h>
  12. typedef enum {
  13. XSTYPE_NULL = 0x18,
  14. XSTYPE_TRUE = 0x06,
  15. XSTYPE_FALSE = 0x15,
  16. XSTYPE_LIST = 0x11,
  17. XSTYPE_LITEM = 0x1f,
  18. XSTYPE_EOL = 0x12,
  19. XSTYPE_DICT = 0x13,
  20. XSTYPE_DITEM = 0x1e,
  21. XSTYPE_EOD = 0x14,
  22. XSTYPE_NUMBER = 0x17,
  23. XSTYPE_STRING = 0x02
  24. } xstype;
  25. /* dynamic strings */
  26. typedef char d_char;
  27. /* auto-destroyable strings */
  28. #define xs __attribute__ ((__cleanup__ (_xs_destroy))) d_char
  29. /* not really all, just very much */
  30. #define XS_ALL 0xfffffff
  31. void *xs_free(void *ptr);
  32. void *_xs_realloc(void *ptr, size_t size, const char *file, int line, const char *func);
  33. #define xs_realloc(ptr, size) _xs_realloc(ptr, size, __FILE__, __LINE__, __FUNCTION__)
  34. int _xs_blk_size(int sz);
  35. void _xs_destroy(char **var);
  36. #define xs_debug() raise(SIGTRAP)
  37. xstype xs_type(const char *data);
  38. int xs_size(const char *data);
  39. int xs_is_null(const char *data);
  40. d_char *xs_dup(const char *data);
  41. d_char *xs_expand(d_char *data, int offset, int size);
  42. d_char *xs_collapse(d_char *data, int offset, int size);
  43. d_char *xs_insert_m(d_char *data, int offset, const char *mem, int size);
  44. #define xs_insert(data, offset, data2) xs_insert_m(data, offset, data2, xs_size(data2))
  45. #define xs_append_m(data, mem, size) xs_insert_m(data, xs_size(data) - 1, mem, size)
  46. d_char *xs_str_new(const char *str);
  47. #define xs_str_cat(str1, str2) xs_insert(str1, xs_size(str1) - 1, str2)
  48. d_char *xs_replace_i(d_char *str, const char *sfrom, const char *sto);
  49. #define xs_replace(str, sfrom, sto) xs_replace_i(xs_dup(str), sfrom, sto)
  50. d_char *xs_fmt(const char *fmt, ...);
  51. int xs_str_in(const char *haystack, const char *needle);
  52. int xs_startswith(const char *str, const char *prefix);
  53. int xs_endswith(const char *str, const char *postfix);
  54. d_char *xs_crop(d_char *str, int start, int end);
  55. d_char *xs_strip(d_char *str);
  56. d_char *xs_tolower(d_char *str);
  57. d_char *xs_list_new(void);
  58. d_char *xs_list_append_m(d_char *list, const char *mem, int dsz);
  59. #define xs_list_append(list, data) xs_list_append_m(list, data, xs_size(data))
  60. int xs_list_iter(char **list, char **value);
  61. int xs_list_len(char *list);
  62. char *xs_list_get(char *list, int num);
  63. d_char *xs_list_del(d_char *list, int num);
  64. d_char *xs_list_insert(d_char *list, int num, const char *data);
  65. d_char *xs_list_insert_sorted(d_char *list, const char *str);
  66. d_char *xs_list_set(d_char *list, int num, const char *data);
  67. d_char *xs_list_pop(d_char *list, char **data);
  68. int xs_list_in(char *list, const char *val);
  69. d_char *xs_join(char *list, const char *sep);
  70. d_char *xs_split_n(const char *str, const char *sep, int times);
  71. #define xs_split(str, sep) xs_split_n(str, sep, XS_ALL)
  72. d_char *xs_dict_new(void);
  73. d_char *xs_dict_append_m(d_char *dict, const char *key, const char *mem, int dsz);
  74. #define xs_dict_append(dict, key, data) xs_dict_append_m(dict, key, data, xs_size(data))
  75. int xs_dict_iter(char **dict, char **key, char **value);
  76. char *xs_dict_get(char *dict, const char *key);
  77. d_char *xs_dict_del(d_char *dict, const char *key);
  78. d_char *xs_dict_set(d_char *dict, const char *key, const char *data);
  79. d_char *xs_val_new(xstype t);
  80. d_char *xs_number_new(double f);
  81. double xs_number_get(const char *v);
  82. const char *xs_number_str(const char *v);
  83. #ifdef XS_IMPLEMENTATION
  84. void *_xs_realloc(void *ptr, size_t size, const char *file, int line, const char *func)
  85. {
  86. d_char *ndata = realloc(ptr, size);
  87. if (ndata == NULL) {
  88. fprintf(stderr, "**OUT OF MEMORY**\n");
  89. abort();
  90. }
  91. #ifdef XS_DEBUG
  92. if (ndata != ptr) {
  93. int n;
  94. FILE *f = fopen("xs_memory.out", "a");
  95. if (ptr != NULL)
  96. fprintf(f, "%p r\n", ptr);
  97. fprintf(f, "%p a %ld %s:%d: %s", ndata, size, file, line, func);
  98. if (ptr != NULL) {
  99. fprintf(f, " [");
  100. for (n = 0; n < 32 && ndata[n]; n++) {
  101. if (ndata[n] >= 32 && ndata[n] <= 127)
  102. fprintf(f, "%c", ndata[n]);
  103. else
  104. fprintf(f, "\\%02x", (unsigned char)ndata[n]);
  105. }
  106. fprintf(f, "]");
  107. }
  108. fprintf(f, "\n");
  109. fclose(f);
  110. }
  111. #endif
  112. return ndata;
  113. }
  114. void *xs_free(void *ptr)
  115. {
  116. #ifdef XS_DEBUG
  117. if (ptr != NULL) {
  118. FILE *f = fopen("xs_memory.out", "a");
  119. fprintf(f, "%p b\n", ptr);
  120. fclose(f);
  121. }
  122. #endif
  123. free(ptr);
  124. return NULL;
  125. }
  126. void _xs_destroy(char **var)
  127. {
  128. /*
  129. if (_xs_debug)
  130. printf("_xs_destroy %p\n", var);
  131. */
  132. xs_free(*var);
  133. }
  134. int _xs_blk_size(int sz)
  135. /* calculates the block size */
  136. {
  137. int blk_size = 4096;
  138. if (sz < 256)
  139. blk_size = 32;
  140. else
  141. if (sz < 4096)
  142. blk_size = 256;
  143. return ((((sz) + blk_size) / blk_size) * blk_size);
  144. }
  145. xstype xs_type(const char *data)
  146. /* return the type of data */
  147. {
  148. xstype t;
  149. switch (data[0]) {
  150. case XSTYPE_NULL:
  151. case XSTYPE_TRUE:
  152. case XSTYPE_FALSE:
  153. case XSTYPE_LIST:
  154. case XSTYPE_EOL:
  155. case XSTYPE_DICT:
  156. case XSTYPE_EOD:
  157. case XSTYPE_LITEM:
  158. case XSTYPE_DITEM:
  159. case XSTYPE_NUMBER:
  160. t = data[0];
  161. break;
  162. default:
  163. t = XSTYPE_STRING;
  164. break;
  165. }
  166. return t;
  167. }
  168. int xs_size(const char *data)
  169. /* returns the size of data in bytes */
  170. {
  171. int len = 0;
  172. int c = 0;
  173. const char *p;
  174. if (data == NULL)
  175. return 0;
  176. switch (xs_type(data)) {
  177. case XSTYPE_STRING:
  178. len = strlen(data) + 1;
  179. break;
  180. case XSTYPE_LIST:
  181. /* look for a balanced EOL */
  182. do {
  183. c += data[len] == XSTYPE_LIST ? 1 : data[len] == XSTYPE_EOL ? -1 : 0;
  184. len++;
  185. } while (c);
  186. break;
  187. case XSTYPE_DICT:
  188. /* look for a balanced EOD */
  189. do {
  190. c += data[len] == XSTYPE_DICT ? 1 : data[len] == XSTYPE_EOD ? -1 : 0;
  191. len++;
  192. } while (c);
  193. break;
  194. case XSTYPE_DITEM:
  195. /* calculate the size of the key and the value */
  196. p = data + 1;
  197. p += xs_size(p);
  198. p += xs_size(p);
  199. len = p - data;
  200. break;
  201. case XSTYPE_LITEM:
  202. /* it's the size of the item + 1 */
  203. p = data + 1;
  204. p += xs_size(p);
  205. len = p - data;
  206. break;
  207. case XSTYPE_NUMBER:
  208. len = 1 + xs_size(data + 1);
  209. break;
  210. default:
  211. len = 1;
  212. }
  213. return len;
  214. }
  215. int xs_is_null(const char *data)
  216. /* checks for null */
  217. {
  218. return !!(data == NULL || xs_type(data) == XSTYPE_NULL);
  219. }
  220. d_char *xs_dup(const char *data)
  221. /* creates a duplicate of data */
  222. {
  223. int sz = xs_size(data);
  224. d_char *s = xs_realloc(NULL, _xs_blk_size(sz));
  225. memcpy(s, data, sz);
  226. return s;
  227. }
  228. d_char *xs_expand(d_char *data, int offset, int size)
  229. /* opens a hole in data */
  230. {
  231. int sz = xs_size(data);
  232. /* open room */
  233. if (sz == 0 || _xs_blk_size(sz) != _xs_blk_size(sz + size))
  234. data = xs_realloc(data, _xs_blk_size(sz + size));
  235. /* move up the rest of the data */
  236. if (data != NULL)
  237. memmove(data + offset + size, data + offset, sz - offset);
  238. return data;
  239. }
  240. d_char *xs_collapse(d_char *data, int offset, int size)
  241. /* shrinks data */
  242. {
  243. int sz = xs_size(data);
  244. int n;
  245. /* don't try to delete beyond the limit */
  246. if (offset + size > sz)
  247. size = sz - offset;
  248. /* shrink total size */
  249. sz -= size;
  250. for (n = offset; n < sz; n++)
  251. data[n] = data[n + size];
  252. return xs_realloc(data, _xs_blk_size(sz));
  253. }
  254. d_char *xs_insert_m(d_char *data, int offset, const char *mem, int size)
  255. /* inserts a memory block */
  256. {
  257. data = xs_expand(data, offset, size);
  258. memcpy(data + offset, mem, size);
  259. return data;
  260. }
  261. /** strings **/
  262. d_char *xs_str_new(const char *str)
  263. /* creates a new string */
  264. {
  265. return xs_insert(NULL, 0, str ? str : "");
  266. }
  267. d_char *xs_replace_i(d_char *str, const char *sfrom, const char *sto)
  268. /* replaces inline all sfrom with sto */
  269. {
  270. int sfsz = strlen(sfrom);
  271. int stsz = strlen(sto);
  272. char *ss;
  273. int offset = 0;
  274. while ((ss = strstr(str + offset, sfrom)) != NULL) {
  275. int n_offset = ss - str;
  276. str = xs_collapse(str, n_offset, sfsz);
  277. str = xs_expand(str, n_offset, stsz);
  278. memcpy(str + n_offset, sto, stsz);
  279. offset = n_offset + stsz;
  280. }
  281. return str;
  282. }
  283. d_char *xs_fmt(const char *fmt, ...)
  284. /* formats a string with printf()-like marks */
  285. {
  286. int n;
  287. d_char *s = NULL;
  288. va_list ap;
  289. va_start(ap, fmt);
  290. n = vsnprintf(s, 0, fmt, ap);
  291. va_end(ap);
  292. if (n > 0) {
  293. s = xs_realloc(NULL, _xs_blk_size(n + 1));
  294. va_start(ap, fmt);
  295. vsnprintf(s, n + 1, fmt, ap);
  296. va_end(ap);
  297. }
  298. return s;
  299. }
  300. int xs_str_in(const char *haystack, const char *needle)
  301. /* finds needle in haystack and returns the offset or -1 */
  302. {
  303. char *s;
  304. int r = -1;
  305. if ((s = strstr(haystack, needle)) != NULL)
  306. r = s - haystack;
  307. return r;
  308. }
  309. int xs_startswith(const char *str, const char *prefix)
  310. /* returns true if str starts with prefix */
  311. {
  312. return !!(xs_str_in(str, prefix) == 0);
  313. }
  314. int xs_endswith(const char *str, const char *postfix)
  315. /* returns true if str ends with postfix */
  316. {
  317. int ssz = strlen(str);
  318. int psz = strlen(postfix);
  319. return !!(ssz >= psz && memcmp(postfix, str + ssz - psz, psz) == 0);
  320. }
  321. d_char *xs_crop(d_char *str, int start, int end)
  322. /* crops the d_char to be only from start to end */
  323. {
  324. int sz = strlen(str);
  325. if (end <= 0)
  326. end = sz + end;
  327. /* crop from the top */
  328. str[end] = '\0';
  329. /* crop from the bottom */
  330. str = xs_collapse(str, 0, start);
  331. return str;
  332. }
  333. d_char *xs_strip(d_char *str)
  334. /* strips the string of blanks from the start and the end */
  335. {
  336. int s, e;
  337. for (s = 0; isspace(str[s]); s++);
  338. for (e = strlen(str); e > 0 && isspace(str[e - 1]); e--);
  339. return xs_crop(str, s, e);
  340. }
  341. d_char *xs_tolower(d_char *str)
  342. /* convert to lowercase */
  343. {
  344. int n;
  345. for (n = 0; str[n]; n++)
  346. str[n] = tolower(str[n]);
  347. return str;
  348. }
  349. /** lists **/
  350. d_char *xs_list_new(void)
  351. /* creates a new list */
  352. {
  353. d_char *list;
  354. list = xs_realloc(NULL, _xs_blk_size(2));
  355. list[0] = XSTYPE_LIST;
  356. list[1] = XSTYPE_EOL;
  357. return list;
  358. }
  359. d_char *_xs_list_write_litem(d_char *list, int offset, const char *mem, int dsz)
  360. /* writes a list item */
  361. {
  362. char c = XSTYPE_LITEM;
  363. list = xs_insert_m(list, offset, &c, 1);
  364. list = xs_insert_m(list, offset + 1, mem, dsz);
  365. return list;
  366. }
  367. d_char *xs_list_append_m(d_char *list, const char *mem, int dsz)
  368. /* adds a memory block to the list */
  369. {
  370. return _xs_list_write_litem(list, xs_size(list) - 1, mem, dsz);
  371. }
  372. int xs_list_iter(char **list, char **value)
  373. /* iterates a list value */
  374. {
  375. int goon = 1;
  376. char *p;
  377. if (list == NULL || *list == NULL)
  378. return 0;
  379. p = *list;
  380. /* skip a possible start of the list */
  381. if (*p == XSTYPE_LIST)
  382. p++;
  383. /* an element? */
  384. if (*p == XSTYPE_LITEM) {
  385. p++;
  386. *value = p;
  387. p += xs_size(*value);
  388. }
  389. else {
  390. /* end of list */
  391. p++;
  392. goon = 0;
  393. }
  394. /* store back the pointer */
  395. *list = p;
  396. return goon;
  397. }
  398. int xs_list_len(char *list)
  399. /* returns the number of elements in the list */
  400. {
  401. int c = 0;
  402. char *v;
  403. while (xs_list_iter(&list, &v))
  404. c++;
  405. return c;
  406. }
  407. char *xs_list_get(char *list, int num)
  408. /* returns the element #num */
  409. {
  410. char *v;
  411. int c = 0;
  412. if (num < 0)
  413. num = xs_list_len(list) + num;
  414. while (xs_list_iter(&list, &v)) {
  415. if (c == num)
  416. return v;
  417. c++;
  418. }
  419. return NULL;
  420. }
  421. d_char *xs_list_del(d_char *list, int num)
  422. /* deletes element #num */
  423. {
  424. char *v;
  425. if ((v = xs_list_get(list, num)) != NULL)
  426. list = xs_collapse(list, v - 1 - list, xs_size(v - 1));
  427. return list;
  428. }
  429. d_char *xs_list_insert(d_char *list, int num, const char *data)
  430. /* inserts an element at #num position */
  431. {
  432. char *v;
  433. int offset;
  434. if ((v = xs_list_get(list, num)) != NULL)
  435. offset = v - list;
  436. else
  437. offset = xs_size(list);
  438. return _xs_list_write_litem(list, offset - 1, data, xs_size(data));
  439. }
  440. d_char *xs_list_insert_sorted(d_char *list, const char *str)
  441. /* inserts a string in the list in its ordered position */
  442. {
  443. char *p, *v;
  444. int offset = xs_size(list);
  445. p = list;
  446. while (xs_list_iter(&p, &v)) {
  447. /* if this element is greater or equal, insert here */
  448. if (strcmp(v, str) >= 0) {
  449. offset = v - list;
  450. break;
  451. }
  452. }
  453. return _xs_list_write_litem(list, offset - 1, str, xs_size(str));
  454. }
  455. d_char *xs_list_set(d_char *list, int num, const char *data)
  456. /* sets the element at #num position */
  457. {
  458. list = xs_list_del(list, num);
  459. list = xs_list_insert(list, num, data);
  460. return list;
  461. }
  462. d_char *xs_list_pop(d_char *list, char **data)
  463. /* pops the last element from the list */
  464. {
  465. if ((*data = xs_list_get(list, -1)) != NULL) {
  466. *data = xs_dup(*data);
  467. list = xs_list_del(list, -1);
  468. }
  469. return list;
  470. }
  471. int xs_list_in(char *list, const char *val)
  472. /* returns the position of val in list or -1 */
  473. {
  474. int n = 0;
  475. char *v;
  476. int sz = xs_size(val);
  477. while (xs_list_iter(&list, &v)) {
  478. if (sz == xs_size(v) && memcmp(val, v, sz) == 0)
  479. return n;
  480. n++;
  481. }
  482. return -1;
  483. }
  484. d_char *xs_join(char *list, const char *sep)
  485. /* joins a list into a string */
  486. {
  487. d_char *s;
  488. char *v;
  489. int c = 0;
  490. s = xs_str_new(NULL);
  491. while (xs_list_iter(&list, &v)) {
  492. /* refuse to join non-string values */
  493. if (xs_type(v) == XSTYPE_STRING) {
  494. /* add the separator */
  495. if (c != 0)
  496. s = xs_str_cat(s, sep);
  497. /* add the element */
  498. s = xs_str_cat(s, v);
  499. c++;
  500. }
  501. }
  502. return s;
  503. }
  504. d_char *xs_split_n(const char *str, const char *sep, int times)
  505. /* splits a string into a list upto n times */
  506. {
  507. int sz = strlen(sep);
  508. char *ss;
  509. d_char *list;
  510. list = xs_list_new();
  511. while (times > 0 && (ss = strstr(str, sep)) != NULL) {
  512. /* add the first part (without the asciiz) */
  513. list = xs_list_append_m(list, str, ss - str);
  514. /* add the asciiz */
  515. list = xs_str_cat(list, "");
  516. /* skip past the separator */
  517. str = ss + sz;
  518. times--;
  519. }
  520. /* add the rest of the string */
  521. list = xs_list_append(list, str);
  522. return list;
  523. }
  524. /** dicts **/
  525. d_char *xs_dict_new(void)
  526. /* creates a new dict */
  527. {
  528. d_char *dict;
  529. dict = xs_realloc(NULL, _xs_blk_size(2));
  530. dict[0] = XSTYPE_DICT;
  531. dict[1] = XSTYPE_EOD;
  532. return dict;
  533. }
  534. d_char *xs_dict_append_m(d_char *dict, const char *key, const char *mem, int dsz)
  535. /* adds a memory block to the dict */
  536. {
  537. char c = XSTYPE_DITEM;
  538. int sz = xs_size(dict);
  539. int ksz = xs_size(key);
  540. dict = xs_insert_m(dict, sz - 1, &c, 1);
  541. dict = xs_insert_m(dict, sz, key, ksz);
  542. dict = xs_insert_m(dict, sz + ksz, mem, dsz);
  543. return dict;
  544. }
  545. int xs_dict_iter(char **dict, char **key, char **value)
  546. /* iterates a dict value */
  547. {
  548. int goon = 1;
  549. char *p;
  550. if (dict == NULL || *dict == NULL)
  551. return 0;
  552. p = *dict;
  553. /* skip a possible start of the list */
  554. if (*p == XSTYPE_DICT)
  555. p++;
  556. /* an element? */
  557. if (*p == XSTYPE_DITEM) {
  558. p++;
  559. *key = p;
  560. p += xs_size(*key);
  561. *value = p;
  562. p += xs_size(*value);
  563. }
  564. else {
  565. /* end of list */
  566. p++;
  567. goon = 0;
  568. }
  569. /* store back the pointer */
  570. *dict = p;
  571. return goon;
  572. }
  573. char *xs_dict_get(char *dict, const char *key)
  574. /* returns the value directed by key */
  575. {
  576. char *k, *v;
  577. while (xs_dict_iter(&dict, &k, &v)) {
  578. if (strcmp(k, key) == 0)
  579. return v;
  580. }
  581. return NULL;
  582. }
  583. d_char *xs_dict_del(d_char *dict, const char *key)
  584. /* deletes a key */
  585. {
  586. char *k, *v;
  587. char *p = dict;
  588. while (xs_dict_iter(&p, &k, &v)) {
  589. if (strcmp(k, key) == 0) {
  590. /* the address of the item is just behind the key */
  591. char *i = k - 1;
  592. dict = xs_collapse(dict, i - dict, xs_size(i));
  593. break;
  594. }
  595. }
  596. return dict;
  597. }
  598. d_char *xs_dict_set(d_char *dict, const char *key, const char *data)
  599. /* sets (replaces) a key */
  600. {
  601. /* delete the possibly existing key */
  602. dict = xs_dict_del(dict, key);
  603. /* append the data */
  604. dict = xs_dict_append(dict, key, data);
  605. return dict;
  606. }
  607. /** other values **/
  608. d_char *xs_val_new(xstype t)
  609. /* adds a new special value */
  610. {
  611. d_char *v = xs_realloc(NULL, _xs_blk_size(1));
  612. v[0] = t;
  613. return v;
  614. }
  615. /** numbers */
  616. d_char *xs_number_new(double f)
  617. /* adds a new number value */
  618. {
  619. d_char *v;
  620. char tmp[64];
  621. snprintf(tmp, sizeof(tmp), "%.15lf", f);
  622. /* strip useless zeros */
  623. if (strchr(tmp, '.') != NULL) {
  624. char *ptr;
  625. for (ptr = tmp + strlen(tmp) - 1; *ptr == '0'; ptr--);
  626. if (*ptr != '.')
  627. ptr++;
  628. *ptr = '\0';
  629. }
  630. /* alloc for the marker and the full string */
  631. v = xs_realloc(NULL, _xs_blk_size(1 + xs_size(tmp)));
  632. v[0] = XSTYPE_NUMBER;
  633. memcpy(&v[1], tmp, xs_size(tmp));
  634. return v;
  635. }
  636. double xs_number_get(const char *v)
  637. /* gets the number as a double */
  638. {
  639. double f = 0.0;
  640. if (v != NULL && v[0] == XSTYPE_NUMBER)
  641. f = atof(&v[1]);
  642. return f;
  643. }
  644. const char *xs_number_str(const char *v)
  645. /* gets the number as a string */
  646. {
  647. const char *p = NULL;
  648. if (v != NULL && v[0] == XSTYPE_NUMBER)
  649. p = &v[1];
  650. return p;
  651. }
  652. #endif /* XS_IMPLEMENTATION */
  653. #endif /* _XS_H */