xs.h 18 KB

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