util.h 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665
  1. /*
  2. * Copyright 2013-2014 Luke Dashjr
  3. * Copyright 2012-2013 Con Kolivas
  4. * Copyright 2011 Andrew Smith
  5. * Copyright 2011 Jeff Garzik
  6. *
  7. * This program is free software; you can redistribute it and/or modify it
  8. * under the terms of the GNU General Public License as published by the Free
  9. * Software Foundation; either version 3 of the License, or (at your option)
  10. * any later version. See COPYING for more details.
  11. */
  12. #ifndef BFG_UTIL_H
  13. #define BFG_UTIL_H
  14. #include <stdbool.h>
  15. #include <stdint.h>
  16. #include <string.h>
  17. #include <sys/time.h>
  18. #include <curl/curl.h>
  19. #include <jansson.h>
  20. #include "compat.h"
  21. #define INVALID_TIMESTAMP ((time_t)-1)
  22. #if defined(unix) || defined(__APPLE__)
  23. #include <errno.h>
  24. #include <sys/socket.h>
  25. #include <netinet/in.h>
  26. #include <arpa/inet.h>
  27. #define SOCKETTYPE int
  28. #define SOCKETFAIL(a) ((a) < 0)
  29. #define INVSOCK -1
  30. #define INVINETADDR -1
  31. #define CLOSESOCKET close
  32. #define SOCKERR (errno)
  33. #define SOCKERRMSG bfg_strerror(errno, BST_SOCKET)
  34. static inline bool sock_blocks(void)
  35. {
  36. return (errno == EAGAIN || errno == EWOULDBLOCK);
  37. }
  38. #elif defined WIN32
  39. #include <ws2tcpip.h>
  40. #include <winsock2.h>
  41. #define SOCKETTYPE SOCKET
  42. #define SOCKETFAIL(a) ((int)(a) == SOCKET_ERROR)
  43. #define INVSOCK INVALID_SOCKET
  44. #define INVINETADDR INADDR_NONE
  45. #define CLOSESOCKET closesocket
  46. #define SOCKERR (WSAGetLastError())
  47. #define SOCKERRMSG bfg_strerror(WSAGetLastError(), BST_SOCKET)
  48. static inline bool sock_blocks(void)
  49. {
  50. return (WSAGetLastError() == WSAEWOULDBLOCK);
  51. }
  52. #ifndef SHUT_RDWR
  53. #define SHUT_RDWR SD_BOTH
  54. #endif
  55. #ifndef in_addr_t
  56. #define in_addr_t uint32_t
  57. #endif
  58. #endif
  59. #define IGNORE_RETURN_VALUE(expr) {if(expr);}(void)0
  60. #if JANSSON_MAJOR_VERSION >= 2
  61. #define JSON_LOADS(str, err_ptr) json_loads((str), 0, (err_ptr))
  62. #else
  63. #define JSON_LOADS(str, err_ptr) json_loads((str), (err_ptr))
  64. #endif
  65. extern char *json_dumps_ANY(json_t *, size_t flags);
  66. static inline
  67. const char *bfg_json_obj_string(json_t *json, const char *key, const char *fail)
  68. {
  69. json = json_object_get(json, key);
  70. if (!json)
  71. return fail;
  72. return json_string_value(json) ?: fail;
  73. }
  74. extern const char *__json_array_string(json_t *, unsigned int entry);
  75. static inline
  76. bool isCspace(int c)
  77. {
  78. switch (c)
  79. {
  80. case ' ': case '\f': case '\n': case '\r': case '\t': case '\v':
  81. return true;
  82. default:
  83. return false;
  84. }
  85. }
  86. typedef struct timeval cgtimer_t;
  87. struct thr_info;
  88. struct pool;
  89. enum dev_reason;
  90. struct cgpu_info;
  91. extern void json_rpc_call_async(CURL *, const char *url, const char *userpass, const char *rpc_req, bool longpoll, struct pool *pool, bool share, void *priv);
  92. extern json_t *json_rpc_call_completed(CURL *, int rc, bool probe, int *rolltime, void *out_priv);
  93. extern char *absolute_uri(char *uri, const char *ref); // ref must be a root URI
  94. extern size_t ucs2_to_utf8(char *out, const uint16_t *in, size_t sz);
  95. extern char *ucs2_to_utf8_dup(uint16_t *in, size_t sz);
  96. #define BFGINIT(var, val) do{ \
  97. if (!(var)) \
  98. (var) = val; \
  99. }while(0)
  100. extern void gen_hash(unsigned char *data, unsigned char *hash, int len);
  101. extern void hash_data(unsigned char *out_hash, const unsigned char *data);
  102. extern void real_block_target(unsigned char *target, const unsigned char *data);
  103. extern bool hash_target_check(const unsigned char *hash, const unsigned char *target);
  104. extern bool hash_target_check_v(const unsigned char *hash, const unsigned char *target);
  105. int thr_info_create(struct thr_info *thr, pthread_attr_t *attr, void *(*start) (void *), void *arg);
  106. void thr_info_freeze(struct thr_info *thr);
  107. void thr_info_cancel(struct thr_info *thr);
  108. void subtime(struct timeval *a, struct timeval *b);
  109. void addtime(struct timeval *a, struct timeval *b);
  110. bool time_more(struct timeval *a, struct timeval *b);
  111. bool time_less(struct timeval *a, struct timeval *b);
  112. void copy_time(struct timeval *dest, const struct timeval *src);
  113. void timespec_to_val(struct timeval *val, const struct timespec *spec);
  114. void timeval_to_spec(struct timespec *spec, const struct timeval *val);
  115. void us_to_timeval(struct timeval *val, int64_t us);
  116. void us_to_timespec(struct timespec *spec, int64_t us);
  117. void ms_to_timespec(struct timespec *spec, int64_t ms);
  118. void timeraddspec(struct timespec *a, const struct timespec *b);
  119. void cgsleep_ms(int ms);
  120. void cgsleep_us(int64_t us);
  121. #define cgtimer_time(ts_start) timer_set_now(ts_start)
  122. #define cgsleep_prepare_r(ts_start) cgtimer_time(ts_start)
  123. void cgsleep_ms_r(cgtimer_t *ts_start, int ms);
  124. void (*cgsleep_us_r)(cgtimer_t *ts_start, int64_t us);
  125. static inline
  126. int cgtimer_to_ms(cgtimer_t *cgt)
  127. {
  128. return (cgt->tv_sec * 1000) + (cgt->tv_usec / 1000);
  129. }
  130. #define cgtimer_sub(a, b, res) timersub(a, b, res)
  131. double us_tdiff(struct timeval *end, struct timeval *start);
  132. double tdiff(struct timeval *end, struct timeval *start);
  133. bool _stratum_send(struct pool *pool, char *s, ssize_t len, bool force);
  134. #define stratum_send(pool, s, len) _stratum_send(pool, s, len, false)
  135. bool sock_full(struct pool *pool);
  136. char *recv_line(struct pool *pool);
  137. bool parse_method(struct pool *pool, char *s);
  138. bool extract_sockaddr(char *url, char **sockaddr_url, char **sockaddr_port);
  139. bool auth_stratum(struct pool *pool);
  140. bool initiate_stratum(struct pool *pool);
  141. bool restart_stratum(struct pool *pool);
  142. void suspend_stratum(struct pool *pool);
  143. extern void dev_error_update(struct cgpu_info *, enum dev_reason);
  144. void dev_error(struct cgpu_info *dev, enum dev_reason reason);
  145. void *realloc_strcat(char *ptr, char *s);
  146. extern char *sanestr(char *o, char *s);
  147. void RenameThread(const char* name);
  148. enum bfg_strerror_type {
  149. BST_ERRNO,
  150. BST_SOCKET,
  151. BST_LIBUSB,
  152. BST_SYSTEM,
  153. };
  154. extern const char *bfg_strerror(int, enum bfg_strerror_type);
  155. extern void *bfg_slurp_file(void *buf, size_t bufsz, const char *filename);
  156. typedef SOCKETTYPE notifier_t[2];
  157. extern void notifier_init(notifier_t);
  158. extern void notifier_wake(notifier_t);
  159. extern void notifier_read(notifier_t);
  160. extern void notifier_init_invalid(notifier_t);
  161. extern void notifier_destroy(notifier_t);
  162. /* Align a size_t to 4 byte boundaries for fussy arches */
  163. static inline void align_len(size_t *len)
  164. {
  165. if (*len % 4)
  166. *len += 4 - (*len % 4);
  167. }
  168. static inline
  169. uint8_t upk_u8(const void * const bufp, const int offset)
  170. {
  171. const uint8_t * const buf = bufp;
  172. return buf[offset];
  173. }
  174. static inline
  175. uint16_t upk_u16be(const void * const bufp, const int offset)
  176. {
  177. const uint8_t * const buf = bufp;
  178. return (((uint16_t)buf[offset+0]) << 8)
  179. | (((uint16_t)buf[offset+1]) << 0);
  180. }
  181. static inline
  182. uint32_t upk_u32be(const void * const bufp, const int offset)
  183. {
  184. const uint8_t * const buf = bufp;
  185. return (((uint32_t)buf[offset+0]) << 0x18)
  186. | (((uint32_t)buf[offset+1]) << 0x10)
  187. | (((uint32_t)buf[offset+2]) << 8)
  188. | (((uint32_t)buf[offset+3]) << 0);
  189. }
  190. static inline
  191. uint64_t upk_u64be(const void * const bufp, const int offset)
  192. {
  193. const uint8_t * const buf = bufp;
  194. return (((uint64_t)buf[offset+0]) << 0x38)
  195. | (((uint64_t)buf[offset+1]) << 0x30)
  196. | (((uint64_t)buf[offset+2]) << 0x28)
  197. | (((uint64_t)buf[offset+3]) << 0x20)
  198. | (((uint64_t)buf[offset+4]) << 0x18)
  199. | (((uint64_t)buf[offset+5]) << 0x10)
  200. | (((uint64_t)buf[offset+6]) << 8)
  201. | (((uint64_t)buf[offset+7]) << 0);
  202. }
  203. static inline
  204. uint16_t upk_u16le(const void * const bufp, const int offset)
  205. {
  206. const uint8_t * const buf = bufp;
  207. return (((uint16_t)buf[offset+0]) << 0)
  208. | (((uint16_t)buf[offset+1]) << 8);
  209. }
  210. static inline
  211. uint32_t upk_u32le(const void * const bufp, const int offset)
  212. {
  213. const uint8_t * const buf = bufp;
  214. return (((uint32_t)buf[offset+0]) << 0)
  215. | (((uint32_t)buf[offset+1]) << 8)
  216. | (((uint32_t)buf[offset+2]) << 0x10)
  217. | (((uint32_t)buf[offset+3]) << 0x18);
  218. }
  219. static inline
  220. uint64_t upk_u64le(const void * const bufp, const int offset)
  221. {
  222. const uint8_t * const buf = bufp;
  223. return (((uint64_t)buf[offset+0]) << 0)
  224. | (((uint64_t)buf[offset+1]) << 8)
  225. | (((uint64_t)buf[offset+2]) << 0x10)
  226. | (((uint64_t)buf[offset+3]) << 0x18)
  227. | (((uint64_t)buf[offset+4]) << 0x20)
  228. | (((uint64_t)buf[offset+5]) << 0x28)
  229. | (((uint64_t)buf[offset+6]) << 0x30)
  230. | (((uint64_t)buf[offset+7]) << 0x38);
  231. }
  232. static inline
  233. void pk_u8(void * const bufp, const int offset, const uint8_t nv)
  234. {
  235. uint8_t * const buf = bufp;
  236. buf[offset] = nv;
  237. }
  238. static inline
  239. void pk_u16be(void * const bufp, const int offset, const uint16_t nv)
  240. {
  241. uint8_t * const buf = bufp;
  242. buf[offset+0] = (nv >> 8) & 0xff;
  243. buf[offset+1] = (nv >> 0) & 0xff;
  244. }
  245. static inline
  246. void pk_u32be(void * const bufp, const int offset, const uint32_t nv)
  247. {
  248. uint8_t * const buf = bufp;
  249. buf[offset+0] = (nv >> 0x18) & 0xff;
  250. buf[offset+1] = (nv >> 0x10) & 0xff;
  251. buf[offset+2] = (nv >> 8) & 0xff;
  252. buf[offset+3] = (nv >> 0) & 0xff;
  253. }
  254. static inline
  255. void pk_u64be(void * const bufp, const int offset, const uint64_t nv)
  256. {
  257. uint8_t * const buf = bufp;
  258. buf[offset+0] = (nv >> 0x38) & 0xff;
  259. buf[offset+1] = (nv >> 0x30) & 0xff;
  260. buf[offset+2] = (nv >> 0x28) & 0xff;
  261. buf[offset+3] = (nv >> 0x20) & 0xff;
  262. buf[offset+4] = (nv >> 0x18) & 0xff;
  263. buf[offset+5] = (nv >> 0x10) & 0xff;
  264. buf[offset+6] = (nv >> 8) & 0xff;
  265. buf[offset+7] = (nv >> 0) & 0xff;
  266. }
  267. static inline
  268. void pk_u16le(void * const bufp, const int offset, const uint16_t nv)
  269. {
  270. uint8_t * const buf = bufp;
  271. buf[offset+0] = (nv >> 0) & 0xff;
  272. buf[offset+1] = (nv >> 8) & 0xff;
  273. }
  274. static inline
  275. void pk_u32le(void * const bufp, const int offset, const uint32_t nv)
  276. {
  277. uint8_t * const buf = bufp;
  278. buf[offset+0] = (nv >> 0) & 0xff;
  279. buf[offset+1] = (nv >> 8) & 0xff;
  280. buf[offset+2] = (nv >> 0x10) & 0xff;
  281. buf[offset+3] = (nv >> 0x18) & 0xff;
  282. }
  283. static inline
  284. void pk_u64le(void * const bufp, const int offset, const uint64_t nv)
  285. {
  286. uint8_t * const buf = bufp;
  287. buf[offset+0] = (nv >> 0) & 0xff;
  288. buf[offset+1] = (nv >> 8) & 0xff;
  289. buf[offset+2] = (nv >> 0x10) & 0xff;
  290. buf[offset+3] = (nv >> 0x18) & 0xff;
  291. buf[offset+4] = (nv >> 0x20) & 0xff;
  292. buf[offset+5] = (nv >> 0x28) & 0xff;
  293. buf[offset+6] = (nv >> 0x30) & 0xff;
  294. buf[offset+7] = (nv >> 0x38) & 0xff;
  295. }
  296. typedef struct bytes_t {
  297. uint8_t *buf;
  298. size_t sz;
  299. size_t allocsz;
  300. } bytes_t;
  301. #define BYTES_INIT ((bytes_t){.buf=NULL,})
  302. static inline
  303. void bytes_init(bytes_t *b)
  304. {
  305. *b = BYTES_INIT;
  306. }
  307. // This can't be inline without ugly const/non-const issues
  308. #define bytes_buf(b) ((b)->buf)
  309. static inline
  310. size_t bytes_len(const bytes_t *b)
  311. {
  312. return b->sz;
  313. }
  314. static inline
  315. ssize_t bytes_find(const bytes_t * const b, const uint8_t needle)
  316. {
  317. const size_t blen = bytes_len(b);
  318. const uint8_t * const buf = bytes_buf(b);
  319. for (int i = 0; i < blen; ++i)
  320. if (buf[i] == needle)
  321. return i;
  322. return -1;
  323. }
  324. extern void _bytes_alloc_failure(size_t);
  325. static inline
  326. void bytes_extend_buf(bytes_t * const b, const size_t newsz)
  327. {
  328. if (newsz <= b->allocsz)
  329. return;
  330. if (!b->allocsz)
  331. b->allocsz = 0x10;
  332. do {
  333. b->allocsz *= 2;
  334. } while (newsz > b->allocsz);
  335. b->buf = realloc(b->buf, b->allocsz);
  336. if (!b->buf)
  337. _bytes_alloc_failure(b->allocsz);
  338. }
  339. static inline
  340. void bytes_resize(bytes_t * const b, const size_t newsz)
  341. {
  342. bytes_extend_buf(b, newsz);;
  343. b->sz = newsz;
  344. }
  345. static inline
  346. void *bytes_preappend(bytes_t * const b, const size_t addsz)
  347. {
  348. size_t origsz = bytes_len(b);
  349. bytes_extend_buf(b, origsz + addsz);
  350. return &bytes_buf(b)[origsz];
  351. }
  352. static inline
  353. void bytes_postappend(bytes_t * const b, const size_t addsz)
  354. {
  355. size_t origsz = bytes_len(b);
  356. bytes_resize(b, origsz + addsz);
  357. }
  358. static inline
  359. void bytes_append(bytes_t * const b, const void * const add, const size_t addsz)
  360. {
  361. void * const appendbuf = bytes_preappend(b, addsz);
  362. memcpy(appendbuf, add, addsz);
  363. bytes_postappend(b, addsz);
  364. }
  365. static inline
  366. void bytes_cat(bytes_t *b, const bytes_t *cat)
  367. {
  368. bytes_append(b, bytes_buf(cat), bytes_len(cat));
  369. }
  370. static inline
  371. void bytes_cpy(bytes_t *dst, const bytes_t *src)
  372. {
  373. dst->sz = src->sz;
  374. if (!dst->sz) {
  375. dst->allocsz = 0;
  376. dst->buf = NULL;
  377. return;
  378. }
  379. dst->allocsz = src->allocsz;
  380. size_t half;
  381. while (dst->sz <= (half = dst->allocsz / 2))
  382. dst->allocsz = half;
  383. dst->buf = malloc(dst->allocsz);
  384. memcpy(dst->buf, src->buf, dst->sz);
  385. }
  386. static inline
  387. void bytes_assimilate_raw(bytes_t * const b, void * const buf, const size_t bufsz, const size_t buflen)
  388. {
  389. free(b->buf);
  390. b->buf = buf;
  391. b->allocsz = bufsz;
  392. b->sz = buflen;
  393. }
  394. static inline
  395. void bytes_shift(bytes_t *b, size_t shift)
  396. {
  397. if (shift >= b->sz)
  398. {
  399. b->sz = 0;
  400. return;
  401. }
  402. b->sz -= shift;
  403. memmove(bytes_buf(b), &bytes_buf(b)[shift], bytes_len(b));
  404. }
  405. static inline
  406. void bytes_reset(bytes_t *b)
  407. {
  408. b->sz = 0;
  409. }
  410. static inline
  411. void bytes_nullterminate(bytes_t *b)
  412. {
  413. bytes_append(b, "", 1);
  414. --b->sz;
  415. }
  416. static inline
  417. void bytes_free(bytes_t *b)
  418. {
  419. free(b->buf);
  420. b->sz = b->allocsz = 0;
  421. }
  422. static inline
  423. void set_maxfd(int *p_maxfd, int fd)
  424. {
  425. if (fd > *p_maxfd)
  426. *p_maxfd = fd;
  427. }
  428. static inline
  429. void timer_unset(struct timeval *tvp)
  430. {
  431. tvp->tv_sec = -1;
  432. }
  433. static inline
  434. bool timer_isset(const struct timeval *tvp)
  435. {
  436. return tvp->tv_sec != -1;
  437. }
  438. extern void (*timer_set_now)(struct timeval *);
  439. #define cgtime(tvp) timer_set_now(tvp)
  440. #define TIMEVAL_USECS(usecs) ( \
  441. (struct timeval){ \
  442. .tv_sec = (usecs) / 1000000, \
  443. .tv_usec = (usecs) % 1000000, \
  444. } \
  445. )
  446. static inline
  447. long timeval_to_us(const struct timeval *tvp)
  448. {
  449. return ((long)tvp->tv_sec * 1000000) + tvp->tv_usec;
  450. }
  451. #define timer_set_delay(tvp_timer, tvp_now, usecs) do { \
  452. struct timeval tv_add = TIMEVAL_USECS(usecs); \
  453. timeradd(&tv_add, tvp_now, tvp_timer); \
  454. } while(0)
  455. #define timer_set_delay_from_now(tvp_timer, usecs) do { \
  456. struct timeval tv_now; \
  457. timer_set_now(&tv_now); \
  458. timer_set_delay(tvp_timer, &tv_now, usecs); \
  459. } while(0)
  460. static inline
  461. const struct timeval *_bfg_nullisnow(const struct timeval *tvp, struct timeval *tvp_buf)
  462. {
  463. if (tvp)
  464. return tvp;
  465. cgtime(tvp_buf);
  466. return tvp_buf;
  467. }
  468. static inline
  469. long timer_elapsed_us(const struct timeval *tvp_timer, const struct timeval *tvp_now)
  470. {
  471. struct timeval tv;
  472. const struct timeval *_tvp_now = _bfg_nullisnow(tvp_now, &tv);
  473. timersub(_tvp_now, tvp_timer, &tv);
  474. return timeval_to_us(&tv);
  475. }
  476. #define ms_tdiff(end, start) (timer_elapsed_us(start, end) / 1000)
  477. static inline
  478. int timer_elapsed(const struct timeval *tvp_timer, const struct timeval *tvp_now)
  479. {
  480. struct timeval tv;
  481. const struct timeval *_tvp_now = _bfg_nullisnow(tvp_now, &tv);
  482. timersub(_tvp_now, tvp_timer, &tv);
  483. return tv.tv_sec;
  484. }
  485. static inline
  486. bool timer_passed(const struct timeval *tvp_timer, const struct timeval *tvp_now)
  487. {
  488. if (!timer_isset(tvp_timer))
  489. return false;
  490. struct timeval tv;
  491. const struct timeval *_tvp_now = _bfg_nullisnow(tvp_now, &tv);
  492. return timercmp(tvp_timer, _tvp_now, <);
  493. }
  494. #if defined(WIN32) && !defined(HAVE_POOR_GETTIMEOFDAY)
  495. #define HAVE_POOR_GETTIMEOFDAY
  496. #endif
  497. #ifdef HAVE_POOR_GETTIMEOFDAY
  498. extern void bfg_gettimeofday(struct timeval *);
  499. #else
  500. #define bfg_gettimeofday(out) gettimeofday(out, NULL)
  501. #endif
  502. static inline
  503. void reduce_timeout_to(struct timeval *tvp_timeout, struct timeval *tvp_time)
  504. {
  505. if (!timer_isset(tvp_time))
  506. return;
  507. if ((!timer_isset(tvp_timeout)) || timercmp(tvp_time, tvp_timeout, <))
  508. *tvp_timeout = *tvp_time;
  509. }
  510. static inline
  511. struct timeval *select_timeout(struct timeval *tvp_timeout, struct timeval *tvp_now)
  512. {
  513. if (!timer_isset(tvp_timeout))
  514. return NULL;
  515. if (timercmp(tvp_timeout, tvp_now, <))
  516. timerclear(tvp_timeout);
  517. else
  518. timersub(tvp_timeout, tvp_now, tvp_timeout);
  519. return tvp_timeout;
  520. }
  521. #define _SNP2(fn, ...) do{ \
  522. int __n42 = fn(s, sz, __VA_ARGS__); \
  523. s += __n42; \
  524. sz = (sz <= __n42) ? 0 : (sz - __n42); \
  525. rv += __n42; \
  526. }while(0)
  527. #define _SNP(...) _SNP2(snprintf, __VA_ARGS__)
  528. #define REPLACEMENT_CHAR (0xFFFD)
  529. #define U8_DEGREE "\xc2\xb0"
  530. #define U8_HLINE "\xe2\x94\x80"
  531. #define U8_BTEE "\xe2\x94\xb4"
  532. extern int32_t utf8_decode(const void *, int *out_len);
  533. extern void utf8_test();
  534. #define RUNONCE(rv) do { \
  535. static bool _runonce = false; \
  536. if (_runonce) \
  537. return rv; \
  538. _runonce = true; \
  539. } while(0)
  540. static inline
  541. char *maybe_strdup(const char *s)
  542. {
  543. return s ? strdup(s) : NULL;
  544. }
  545. static inline
  546. void maybe_strdup_if_null(const char **p, const char *s)
  547. {
  548. if (!*p)
  549. *p = maybe_strdup(s);
  550. }
  551. extern char *trimmed_strdup(const char *);
  552. extern void run_cmd(const char *cmd);
  553. extern uint8_t crc5usb(unsigned char *ptr, uint8_t len);
  554. extern void bfg_init_checksums(void);
  555. extern uint8_t crc8ccitt(const void *, size_t);
  556. #endif /* __UTIL_H__ */