util.h 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827
  1. /*
  2. * Copyright 2013-2014 Luke Dashjr
  3. * Copyright 2012-2014 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/types.h>
  25. #include <sys/socket.h>
  26. #include <netinet/in.h>
  27. #include <arpa/inet.h>
  28. #define SOCKETTYPE int
  29. #define SOCKETFAIL(a) ((a) < 0)
  30. #define INVSOCK -1
  31. #define INVINETADDR -1
  32. #define CLOSESOCKET close
  33. #define SOCKERR (errno)
  34. #define SOCKERRMSG bfg_strerror(errno, BST_SOCKET)
  35. static inline bool sock_blocks(void)
  36. {
  37. return (errno == EAGAIN || errno == EWOULDBLOCK);
  38. }
  39. static inline bool interrupted(void)
  40. {
  41. return (errno == EINTR);
  42. }
  43. #elif defined WIN32
  44. #include <ws2tcpip.h>
  45. #include <winsock2.h>
  46. #define SOCKETTYPE SOCKET
  47. #define SOCKETFAIL(a) ((int)(a) == SOCKET_ERROR)
  48. #define INVSOCK INVALID_SOCKET
  49. #define INVINETADDR INADDR_NONE
  50. #define CLOSESOCKET closesocket
  51. #define SOCKERR (WSAGetLastError())
  52. #define SOCKERRMSG bfg_strerror(WSAGetLastError(), BST_SOCKET)
  53. /* Check for windows variants of the errors as well as when ming
  54. * decides to wrap the error into the errno equivalent. */
  55. static inline bool sock_blocks(void)
  56. {
  57. return (WSAGetLastError() == WSAEWOULDBLOCK || errno == EAGAIN);
  58. }
  59. static inline bool interrupted(void)
  60. {
  61. return (WSAGetLastError() == WSAEINTR || errno == EINTR);
  62. }
  63. #ifndef SHUT_RDWR
  64. #define SHUT_RDWR SD_BOTH
  65. #endif
  66. #ifndef in_addr_t
  67. #define in_addr_t uint32_t
  68. #endif
  69. #endif
  70. #define IGNORE_RETURN_VALUE(expr) {if(expr);}(void)0
  71. enum bfg_tristate {
  72. BTS_FALSE = (int)false,
  73. BTS_TRUE = (int)true,
  74. BTS_UNKNOWN,
  75. };
  76. #if JANSSON_MAJOR_VERSION >= 2
  77. #define JSON_LOADS(str, err_ptr) json_loads((str), 0, (err_ptr))
  78. #else
  79. #define JSON_LOADS(str, err_ptr) json_loads((str), (err_ptr))
  80. #endif
  81. extern char *json_dumps_ANY(json_t *, size_t flags);
  82. static inline
  83. const char *bfg_json_obj_string(json_t *json, const char *key, const char *fail)
  84. {
  85. json = json_object_get(json, key);
  86. if (!json)
  87. return fail;
  88. return json_string_value(json) ?: fail;
  89. }
  90. extern const char *__json_array_string(json_t *, unsigned int entry);
  91. #ifndef min
  92. # define min(a, b) ((a) < (b) ? (a) : (b))
  93. #endif
  94. extern void *my_memrchr(const void *, int, size_t);
  95. extern bool isCalpha(int);
  96. static inline
  97. bool isCspace(int c)
  98. {
  99. switch (c)
  100. {
  101. case ' ': case '\f': case '\n': case '\r': case '\t': case '\v':
  102. return true;
  103. default:
  104. return false;
  105. }
  106. }
  107. typedef bool (*appdata_file_callback_t)(const char *, void *);
  108. extern bool appdata_file_call(const char *appname, const char *filename, appdata_file_callback_t, void *userp);
  109. extern char *appdata_file_find_first(const char *appname, const char *filename);
  110. extern const char *get_registered_domain(size_t *out_len, const char *, size_t len);
  111. extern const char *extract_domain(size_t *out_len, const char *uri, size_t urilen);
  112. extern bool match_domains(const char *a, size_t alen, const char *b, size_t blen);
  113. extern void test_domain_funcs();
  114. extern bool bfg_strtobool(const char *, char **endptr, int opts);
  115. extern enum bfg_tristate uri_get_param_bool2(const char *ri, const char *param);
  116. extern bool uri_get_param_bool(const char *uri, const char *param, bool defval);
  117. extern void test_uri_get_param();
  118. enum bfg_gpio_value {
  119. BGV_LOW = 0,
  120. BGV_HIGH = 1,
  121. BGV_ERROR = -1,
  122. };
  123. typedef struct timeval cgtimer_t;
  124. struct thr_info;
  125. struct pool;
  126. enum dev_reason;
  127. struct cgpu_info;
  128. extern void set_cloexec_socket(SOCKETTYPE, bool cloexec);
  129. static inline
  130. SOCKETTYPE bfg_socket(const int domain, const int type, const int protocol)
  131. {
  132. const bool cloexec = true;
  133. SOCKETTYPE sock;
  134. #ifdef WIN32
  135. # ifndef WSA_FLAG_NO_HANDLE_INHERIT
  136. # define WSA_FLAG_NO_HANDLE_INHERIT 0x80
  137. # endif
  138. sock = WSASocket(domain, type, protocol, NULL, 0, WSA_FLAG_OVERLAPPED | ((cloexec) ? WSA_FLAG_NO_HANDLE_INHERIT : 0));
  139. if (sock == INVSOCK)
  140. #endif
  141. sock = socket(domain, type, protocol);
  142. if (sock == INVSOCK)
  143. return INVSOCK;
  144. set_cloexec_socket(sock, cloexec);
  145. return sock;
  146. }
  147. 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);
  148. extern json_t *json_rpc_call_completed(CURL *, int rc, bool probe, int *rolltime, void *out_priv);
  149. extern char *absolute_uri(char *uri, const char *ref); // ref must be a root URI
  150. extern size_t ucs2_to_utf8(char *out, const uint16_t *in, size_t sz);
  151. extern char *ucs2_to_utf8_dup(uint16_t *in, size_t sz);
  152. #define BFGINIT(var, val) do{ \
  153. if (!(var)) \
  154. (var) = val; \
  155. }while(0)
  156. extern void gen_hash(unsigned char *data, unsigned char *hash, int len);
  157. extern void hash_data(unsigned char *out_hash, const unsigned char *data);
  158. extern void real_block_target(unsigned char *target, const unsigned char *data);
  159. extern bool hash_target_check(const unsigned char *hash, const unsigned char *target);
  160. extern bool hash_target_check_v(const unsigned char *hash, const unsigned char *target);
  161. int thr_info_create(struct thr_info *thr, pthread_attr_t *attr, void *(*start) (void *), void *arg);
  162. void thr_info_freeze(struct thr_info *thr);
  163. void thr_info_cancel(struct thr_info *thr);
  164. void subtime(struct timeval *a, struct timeval *b);
  165. void addtime(struct timeval *a, struct timeval *b);
  166. bool time_more(struct timeval *a, struct timeval *b);
  167. bool time_less(struct timeval *a, struct timeval *b);
  168. void copy_time(struct timeval *dest, const struct timeval *src);
  169. void timespec_to_val(struct timeval *val, const struct timespec *spec);
  170. void timeval_to_spec(struct timespec *spec, const struct timeval *val);
  171. void us_to_timeval(struct timeval *val, int64_t us);
  172. void us_to_timespec(struct timespec *spec, int64_t us);
  173. void ms_to_timespec(struct timespec *spec, int64_t ms);
  174. void timeraddspec(struct timespec *a, const struct timespec *b);
  175. void cgsleep_ms(int ms);
  176. void cgsleep_us(int64_t us);
  177. #define cgtimer_time(ts_start) timer_set_now(ts_start)
  178. #define cgsleep_prepare_r(ts_start) cgtimer_time(ts_start)
  179. void cgsleep_ms_r(cgtimer_t *ts_start, int ms);
  180. void (*cgsleep_us_r)(cgtimer_t *ts_start, int64_t us);
  181. static inline
  182. int cgtimer_to_ms(cgtimer_t *cgt)
  183. {
  184. return (cgt->tv_sec * 1000) + (cgt->tv_usec / 1000);
  185. }
  186. #define cgtimer_sub(a, b, res) timersub(a, b, res)
  187. double us_tdiff(struct timeval *end, struct timeval *start);
  188. double tdiff(struct timeval *end, struct timeval *start);
  189. bool _stratum_send(struct pool *pool, char *s, ssize_t len, bool force);
  190. #define stratum_send(pool, s, len) _stratum_send(pool, s, len, false)
  191. bool sock_full(struct pool *pool);
  192. char *recv_line(struct pool *pool);
  193. bool parse_method(struct pool *pool, char *s);
  194. bool extract_sockaddr(char *url, char **sockaddr_url, char **sockaddr_port);
  195. bool auth_stratum(struct pool *pool);
  196. bool initiate_stratum(struct pool *pool);
  197. bool restart_stratum(struct pool *pool);
  198. void suspend_stratum(struct pool *pool);
  199. extern void dev_error_update(struct cgpu_info *, enum dev_reason);
  200. void dev_error(struct cgpu_info *dev, enum dev_reason reason);
  201. void *realloc_strcat(char *ptr, char *s);
  202. extern char *sanestr(char *o, char *s);
  203. void RenameThread(const char* name);
  204. enum bfg_strerror_type {
  205. BST_ERRNO,
  206. BST_SOCKET,
  207. BST_LIBUSB,
  208. BST_SYSTEM,
  209. };
  210. extern const char *bfg_strerror(int, enum bfg_strerror_type);
  211. extern void *bfg_slurp_file(void *buf, size_t bufsz, const char *filename);
  212. typedef SOCKETTYPE notifier_t[2];
  213. extern void notifier_init(notifier_t);
  214. extern void notifier_wake(notifier_t);
  215. extern void notifier_read(notifier_t);
  216. extern bool notifier_wait(notifier_t, const struct timeval *);
  217. extern bool notifier_wait_us(notifier_t, unsigned long long usecs);
  218. extern void notifier_reset(notifier_t);
  219. extern void notifier_init_invalid(notifier_t);
  220. extern void notifier_destroy(notifier_t);
  221. /* Align a size_t to 4 byte boundaries for fussy arches */
  222. static inline void align_len(size_t *len)
  223. {
  224. if (*len % 4)
  225. *len += 4 - (*len % 4);
  226. }
  227. static inline
  228. uint8_t bitflip8(uint8_t p)
  229. {
  230. p = ((p & 0xaa) >> 1) | ((p & 0x55) << 1);
  231. p = ((p & 0xcc) >> 2) | ((p & 0x33) << 2);
  232. p = ((p & 0xf0) >> 4) | ((p & 0x0f) << 4);
  233. return p;
  234. }
  235. static inline
  236. uint8_t upk_u8(const void * const bufp, const int offset)
  237. {
  238. const uint8_t * const buf = bufp;
  239. return buf[offset];
  240. }
  241. #define upk_u8be(buf, offset) upk_u8(buf, offset)
  242. static inline
  243. uint16_t upk_u16be(const void * const bufp, const int offset)
  244. {
  245. const uint8_t * const buf = bufp;
  246. return (((uint16_t)buf[offset+0]) << 8)
  247. | (((uint16_t)buf[offset+1]) << 0);
  248. }
  249. static inline
  250. uint32_t upk_u32be(const void * const bufp, const int offset)
  251. {
  252. const uint8_t * const buf = bufp;
  253. return (((uint32_t)buf[offset+0]) << 0x18)
  254. | (((uint32_t)buf[offset+1]) << 0x10)
  255. | (((uint32_t)buf[offset+2]) << 8)
  256. | (((uint32_t)buf[offset+3]) << 0);
  257. }
  258. static inline
  259. uint64_t upk_u64be(const void * const bufp, const int offset)
  260. {
  261. const uint8_t * const buf = bufp;
  262. return (((uint64_t)buf[offset+0]) << 0x38)
  263. | (((uint64_t)buf[offset+1]) << 0x30)
  264. | (((uint64_t)buf[offset+2]) << 0x28)
  265. | (((uint64_t)buf[offset+3]) << 0x20)
  266. | (((uint64_t)buf[offset+4]) << 0x18)
  267. | (((uint64_t)buf[offset+5]) << 0x10)
  268. | (((uint64_t)buf[offset+6]) << 8)
  269. | (((uint64_t)buf[offset+7]) << 0);
  270. }
  271. #define upk_u8le(buf, offset) upk_u8(buf, offset)
  272. static inline
  273. uint16_t upk_u16le(const void * const bufp, const int offset)
  274. {
  275. const uint8_t * const buf = bufp;
  276. return (((uint16_t)buf[offset+0]) << 0)
  277. | (((uint16_t)buf[offset+1]) << 8);
  278. }
  279. static inline
  280. uint32_t upk_u32le(const void * const bufp, const int offset)
  281. {
  282. const uint8_t * const buf = bufp;
  283. return (((uint32_t)buf[offset+0]) << 0)
  284. | (((uint32_t)buf[offset+1]) << 8)
  285. | (((uint32_t)buf[offset+2]) << 0x10)
  286. | (((uint32_t)buf[offset+3]) << 0x18);
  287. }
  288. static inline
  289. uint64_t upk_u64le(const void * const bufp, const int offset)
  290. {
  291. const uint8_t * const buf = bufp;
  292. return (((uint64_t)buf[offset+0]) << 0)
  293. | (((uint64_t)buf[offset+1]) << 8)
  294. | (((uint64_t)buf[offset+2]) << 0x10)
  295. | (((uint64_t)buf[offset+3]) << 0x18)
  296. | (((uint64_t)buf[offset+4]) << 0x20)
  297. | (((uint64_t)buf[offset+5]) << 0x28)
  298. | (((uint64_t)buf[offset+6]) << 0x30)
  299. | (((uint64_t)buf[offset+7]) << 0x38);
  300. }
  301. static inline
  302. void pk_u8(void * const bufp, const int offset, const uint8_t nv)
  303. {
  304. uint8_t * const buf = bufp;
  305. buf[offset] = nv;
  306. }
  307. #define pk_u8be(buf, offset, nv) pk_u8(buf, offset, nv)
  308. static inline
  309. void pk_u16be(void * const bufp, const int offset, const uint16_t nv)
  310. {
  311. uint8_t * const buf = bufp;
  312. buf[offset+0] = (nv >> 8) & 0xff;
  313. buf[offset+1] = (nv >> 0) & 0xff;
  314. }
  315. static inline
  316. void pk_u32be(void * const bufp, const int offset, const uint32_t nv)
  317. {
  318. uint8_t * const buf = bufp;
  319. buf[offset+0] = (nv >> 0x18) & 0xff;
  320. buf[offset+1] = (nv >> 0x10) & 0xff;
  321. buf[offset+2] = (nv >> 8) & 0xff;
  322. buf[offset+3] = (nv >> 0) & 0xff;
  323. }
  324. static inline
  325. void pk_u64be(void * const bufp, const int offset, const uint64_t nv)
  326. {
  327. uint8_t * const buf = bufp;
  328. buf[offset+0] = (nv >> 0x38) & 0xff;
  329. buf[offset+1] = (nv >> 0x30) & 0xff;
  330. buf[offset+2] = (nv >> 0x28) & 0xff;
  331. buf[offset+3] = (nv >> 0x20) & 0xff;
  332. buf[offset+4] = (nv >> 0x18) & 0xff;
  333. buf[offset+5] = (nv >> 0x10) & 0xff;
  334. buf[offset+6] = (nv >> 8) & 0xff;
  335. buf[offset+7] = (nv >> 0) & 0xff;
  336. }
  337. #define pk_u8le(buf, offset, nv) pk_u8(buf, offset, nv)
  338. static inline
  339. void pk_u16le(void * const bufp, const int offset, const uint16_t nv)
  340. {
  341. uint8_t * const buf = bufp;
  342. buf[offset+0] = (nv >> 0) & 0xff;
  343. buf[offset+1] = (nv >> 8) & 0xff;
  344. }
  345. static inline
  346. void pk_u32le(void * const bufp, const int offset, const uint32_t nv)
  347. {
  348. uint8_t * const buf = bufp;
  349. buf[offset+0] = (nv >> 0) & 0xff;
  350. buf[offset+1] = (nv >> 8) & 0xff;
  351. buf[offset+2] = (nv >> 0x10) & 0xff;
  352. buf[offset+3] = (nv >> 0x18) & 0xff;
  353. }
  354. static inline
  355. void pk_u64le(void * const bufp, const int offset, const uint64_t nv)
  356. {
  357. uint8_t * const buf = bufp;
  358. buf[offset+0] = (nv >> 0) & 0xff;
  359. buf[offset+1] = (nv >> 8) & 0xff;
  360. buf[offset+2] = (nv >> 0x10) & 0xff;
  361. buf[offset+3] = (nv >> 0x18) & 0xff;
  362. buf[offset+4] = (nv >> 0x20) & 0xff;
  363. buf[offset+5] = (nv >> 0x28) & 0xff;
  364. buf[offset+6] = (nv >> 0x30) & 0xff;
  365. buf[offset+7] = (nv >> 0x38) & 0xff;
  366. }
  367. #define _pk_uNle(bitwidth, newvalue) do{ \
  368. uint ## bitwidth ## _t _mask = 1; \
  369. _mask <<= _bitlen; \
  370. --_mask; \
  371. uint ## bitwidth ## _t _filt = _mask; \
  372. _filt <<= _bitoff; \
  373. _filt = ~_filt; \
  374. uint ## bitwidth ## _t _u = upk_u ## bitwidth ## le(_buf, 0); \
  375. _u = (_u & _filt) | (((newvalue) & _mask) << _bitoff); \
  376. pk_u ## bitwidth ## le(_buf, 0, _u); \
  377. }while(0)
  378. #define pk_uNle(bufp, offset, bitoffset, bitlength, newvalue) do{ \
  379. uint8_t * const _buf = &((uint8_t *)(bufp))[offset]; \
  380. const int _bitoff = (bitoffset), _bitlen = bitlength; \
  381. const int _bittot = bitoffset + bitlength; \
  382. _Static_assert((bitoffset + bitlength) <= 0x40, "Too many bits addressed in pk_uNle (bitoffset + bitlength must be <= 64)"); \
  383. if (_bittot <= 8) \
  384. _pk_uNle( 8, newvalue); \
  385. else \
  386. if (_bittot <= 0x10) \
  387. _pk_uNle(16, newvalue); \
  388. else \
  389. if (_bittot <= 0x20) \
  390. _pk_uNle(32, newvalue); \
  391. else \
  392. _pk_uNle(64, newvalue); \
  393. }while(0)
  394. #define is_power_of_two(n) \
  395. (0 == ((n) && ((n) - 1)))
  396. static inline
  397. uint32_t upper_power_of_two_u32(uint32_t n)
  398. {
  399. --n;
  400. for (int i = 1; i <= 0x10; i *= 2)
  401. n |= n >> i;
  402. ++n;
  403. return n;
  404. }
  405. typedef struct bytes_t {
  406. uint8_t *buf;
  407. size_t sz;
  408. size_t allocsz;
  409. } bytes_t;
  410. #define BYTES_INIT {.buf=NULL,}
  411. static inline
  412. void bytes_init(bytes_t *b)
  413. {
  414. *b = (bytes_t)BYTES_INIT;
  415. }
  416. // This can't be inline without ugly const/non-const issues
  417. #define bytes_buf(b) ((b)->buf)
  418. static inline
  419. size_t bytes_len(const bytes_t *b)
  420. {
  421. return b->sz;
  422. }
  423. static inline
  424. ssize_t bytes_find(const bytes_t * const b, const uint8_t needle)
  425. {
  426. const size_t blen = bytes_len(b);
  427. const uint8_t * const buf = bytes_buf(b);
  428. for (int i = 0; i < blen; ++i)
  429. if (buf[i] == needle)
  430. return i;
  431. return -1;
  432. }
  433. static inline
  434. bool bytes_eq(const bytes_t * const a, const bytes_t * const b)
  435. {
  436. if (a->sz != b->sz)
  437. return false;
  438. return !memcmp(a->buf, b->buf, a->sz);
  439. }
  440. extern void _bytes_alloc_failure(size_t);
  441. static inline
  442. void bytes_extend_buf(bytes_t * const b, const size_t newsz)
  443. {
  444. if (newsz <= b->allocsz)
  445. return;
  446. if (!b->allocsz)
  447. b->allocsz = 0x10;
  448. do {
  449. b->allocsz *= 2;
  450. } while (newsz > b->allocsz);
  451. b->buf = realloc(b->buf, b->allocsz);
  452. if (!b->buf)
  453. _bytes_alloc_failure(b->allocsz);
  454. }
  455. static inline
  456. void bytes_resize(bytes_t * const b, const size_t newsz)
  457. {
  458. bytes_extend_buf(b, newsz);
  459. b->sz = newsz;
  460. }
  461. static inline
  462. void *bytes_preappend(bytes_t * const b, const size_t addsz)
  463. {
  464. size_t origsz = bytes_len(b);
  465. bytes_extend_buf(b, origsz + addsz);
  466. return &bytes_buf(b)[origsz];
  467. }
  468. static inline
  469. void bytes_postappend(bytes_t * const b, const size_t addsz)
  470. {
  471. size_t origsz = bytes_len(b);
  472. bytes_resize(b, origsz + addsz);
  473. }
  474. static inline
  475. void bytes_append(bytes_t * const b, const void * const add, const size_t addsz)
  476. {
  477. void * const appendbuf = bytes_preappend(b, addsz);
  478. memcpy(appendbuf, add, addsz);
  479. bytes_postappend(b, addsz);
  480. }
  481. static inline
  482. void bytes_cat(bytes_t *b, const bytes_t *cat)
  483. {
  484. bytes_append(b, bytes_buf(cat), bytes_len(cat));
  485. }
  486. static inline
  487. void bytes_cpy(bytes_t *dst, const bytes_t *src)
  488. {
  489. dst->sz = src->sz;
  490. if (!dst->sz) {
  491. dst->allocsz = 0;
  492. dst->buf = NULL;
  493. return;
  494. }
  495. dst->allocsz = src->allocsz;
  496. size_t half;
  497. while (dst->sz <= (half = dst->allocsz / 2))
  498. dst->allocsz = half;
  499. dst->buf = malloc(dst->allocsz);
  500. memcpy(dst->buf, src->buf, dst->sz);
  501. }
  502. // Efficiently moves the data from src to dst, emptying src in the process
  503. static inline
  504. void bytes_assimilate(bytes_t * const dst, bytes_t * const src)
  505. {
  506. void * const buf = dst->buf;
  507. const size_t allocsz = dst->allocsz;
  508. *dst = *src;
  509. *src = (bytes_t){
  510. .buf = buf,
  511. .allocsz = allocsz,
  512. };
  513. }
  514. static inline
  515. void bytes_assimilate_raw(bytes_t * const b, void * const buf, const size_t bufsz, const size_t buflen)
  516. {
  517. free(b->buf);
  518. b->buf = buf;
  519. b->allocsz = bufsz;
  520. b->sz = buflen;
  521. }
  522. static inline
  523. void bytes_shift(bytes_t *b, size_t shift)
  524. {
  525. if (shift >= b->sz)
  526. {
  527. b->sz = 0;
  528. return;
  529. }
  530. b->sz -= shift;
  531. memmove(bytes_buf(b), &bytes_buf(b)[shift], bytes_len(b));
  532. }
  533. static inline
  534. void bytes_reset(bytes_t *b)
  535. {
  536. b->sz = 0;
  537. }
  538. static inline
  539. void bytes_nullterminate(bytes_t *b)
  540. {
  541. bytes_append(b, "", 1);
  542. --b->sz;
  543. }
  544. static inline
  545. void bytes_free(bytes_t *b)
  546. {
  547. free(b->buf);
  548. b->sz = b->allocsz = 0;
  549. }
  550. static inline
  551. void set_maxfd(int *p_maxfd, int fd)
  552. {
  553. if (fd > *p_maxfd)
  554. *p_maxfd = fd;
  555. }
  556. static inline
  557. void timer_unset(struct timeval *tvp)
  558. {
  559. tvp->tv_sec = -1;
  560. }
  561. static inline
  562. bool timer_isset(const struct timeval *tvp)
  563. {
  564. return tvp->tv_sec != -1;
  565. }
  566. extern void (*timer_set_now)(struct timeval *);
  567. #define cgtime(tvp) timer_set_now(tvp)
  568. #define TIMEVAL_USECS(usecs) ( \
  569. (struct timeval){ \
  570. .tv_sec = (usecs) / 1000000, \
  571. .tv_usec = (usecs) % 1000000, \
  572. } \
  573. )
  574. static inline
  575. long timeval_to_us(const struct timeval *tvp)
  576. {
  577. return ((long)tvp->tv_sec * 1000000) + tvp->tv_usec;
  578. }
  579. #define timer_set_delay(tvp_timer, tvp_now, usecs) do { \
  580. struct timeval tv_add = TIMEVAL_USECS(usecs); \
  581. timeradd(&tv_add, tvp_now, tvp_timer); \
  582. } while(0)
  583. #define timer_set_delay_from_now(tvp_timer, usecs) do { \
  584. struct timeval tv_now; \
  585. timer_set_now(&tv_now); \
  586. timer_set_delay(tvp_timer, &tv_now, usecs); \
  587. } while(0)
  588. static inline
  589. const struct timeval *_bfg_nullisnow(const struct timeval *tvp, struct timeval *tvp_buf)
  590. {
  591. if (tvp)
  592. return tvp;
  593. cgtime(tvp_buf);
  594. return tvp_buf;
  595. }
  596. static inline
  597. long timer_elapsed_us(const struct timeval *tvp_timer, const struct timeval *tvp_now)
  598. {
  599. struct timeval tv;
  600. const struct timeval *_tvp_now = _bfg_nullisnow(tvp_now, &tv);
  601. timersub(_tvp_now, tvp_timer, &tv);
  602. return timeval_to_us(&tv);
  603. }
  604. #define ms_tdiff(end, start) (timer_elapsed_us(start, end) / 1000)
  605. static inline
  606. int timer_elapsed(const struct timeval *tvp_timer, const struct timeval *tvp_now)
  607. {
  608. struct timeval tv;
  609. const struct timeval *_tvp_now = _bfg_nullisnow(tvp_now, &tv);
  610. timersub(_tvp_now, tvp_timer, &tv);
  611. return tv.tv_sec;
  612. }
  613. static inline
  614. bool timer_passed(const struct timeval *tvp_timer, const struct timeval *tvp_now)
  615. {
  616. if (!timer_isset(tvp_timer))
  617. return false;
  618. struct timeval tv;
  619. const struct timeval *_tvp_now = _bfg_nullisnow(tvp_now, &tv);
  620. return timercmp(tvp_timer, _tvp_now, <);
  621. }
  622. #if defined(WIN32) && !defined(HAVE_POOR_GETTIMEOFDAY)
  623. #define HAVE_POOR_GETTIMEOFDAY
  624. #endif
  625. #ifdef HAVE_POOR_GETTIMEOFDAY
  626. extern void bfg_gettimeofday(struct timeval *);
  627. #else
  628. #define bfg_gettimeofday(out) gettimeofday(out, NULL)
  629. #endif
  630. static inline
  631. void reduce_timeout_to(struct timeval *tvp_timeout, struct timeval *tvp_time)
  632. {
  633. if (!timer_isset(tvp_time))
  634. return;
  635. if ((!timer_isset(tvp_timeout)) || timercmp(tvp_time, tvp_timeout, <))
  636. *tvp_timeout = *tvp_time;
  637. }
  638. static inline
  639. struct timeval *select_timeout(struct timeval *tvp_timeout, struct timeval *tvp_now)
  640. {
  641. if (!timer_isset(tvp_timeout))
  642. return NULL;
  643. if (timercmp(tvp_timeout, tvp_now, <))
  644. timerclear(tvp_timeout);
  645. else
  646. timersub(tvp_timeout, tvp_now, tvp_timeout);
  647. return tvp_timeout;
  648. }
  649. #define _SNP2(fn, ...) do{ \
  650. int __n42 = fn(s, sz, __VA_ARGS__); \
  651. s += __n42; \
  652. sz = (sz <= __n42) ? 0 : (sz - __n42); \
  653. rv += __n42; \
  654. }while(0)
  655. #define _SNP(...) _SNP2(snprintf, __VA_ARGS__)
  656. extern int double_find_precision(double, double base);
  657. #define REPLACEMENT_CHAR (0xFFFD)
  658. #define U8_DEGREE "\xc2\xb0"
  659. #define U8_MICRO "\xc2\xb5"
  660. #define U8_HLINE "\xe2\x94\x80"
  661. #define U8_BTEE "\xe2\x94\xb4"
  662. extern int utf8_len(uint8_t);
  663. extern int32_t utf8_decode(const void *, int *out_len);
  664. extern size_t utf8_strlen(const void *);
  665. extern void utf8_test();
  666. #define RUNONCE(rv) do { \
  667. static bool _runonce = false; \
  668. if (_runonce) \
  669. return rv; \
  670. _runonce = true; \
  671. } while(0)
  672. static inline
  673. char *maybe_strdup(const char *s)
  674. {
  675. return s ? strdup(s) : NULL;
  676. }
  677. static inline
  678. void maybe_strdup_if_null(const char **p, const char *s)
  679. {
  680. if (!*p)
  681. *p = maybe_strdup(s);
  682. }
  683. extern char *trimmed_strdup(const char *);
  684. extern void run_cmd(const char *cmd);
  685. extern uint8_t crc5usb(unsigned char *ptr, uint8_t len);
  686. extern void bfg_init_checksums(void);
  687. extern uint8_t crc8ccitt(const void *, size_t);
  688. extern uint16_t crc16(const void *, size_t, uint16_t init);
  689. #define crc16ffff( DATA, SZ) crc16(DATA, SZ, 0xffff)
  690. #define crc16xmodem(DATA, SZ) crc16(DATA, SZ, 0)
  691. #endif /* __UTIL_H__ */