util.h 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541
  1. /*
  2. * Copyright 2013 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. static inline bool interrupted(void)
  39. {
  40. return (errno == EINTR);
  41. }
  42. #elif defined WIN32
  43. #include <ws2tcpip.h>
  44. #include <winsock2.h>
  45. #define SOCKETTYPE SOCKET
  46. #define SOCKETFAIL(a) ((int)(a) == SOCKET_ERROR)
  47. #define INVSOCK INVALID_SOCKET
  48. #define INVINETADDR INADDR_NONE
  49. #define CLOSESOCKET closesocket
  50. #define SOCKERR (WSAGetLastError())
  51. #define SOCKERRMSG bfg_strerror(WSAGetLastError(), BST_SOCKET)
  52. /* Check for windows variants of the errors as well as when ming
  53. * decides to wrap the error into the errno equivalent. */
  54. static inline bool sock_blocks(void)
  55. {
  56. return (WSAGetLastError() == WSAEWOULDBLOCK || errno == EAGAIN);
  57. }
  58. static inline bool interrupted(void)
  59. {
  60. return (WSAGetLastError() == WSAEINTR || errno == EINTR);
  61. }
  62. #ifndef SHUT_RDWR
  63. #define SHUT_RDWR SD_BOTH
  64. #endif
  65. #ifndef in_addr_t
  66. #define in_addr_t uint32_t
  67. #endif
  68. #endif
  69. #define IGNORE_RETURN_VALUE(expr) {if(expr);}(void)0
  70. #if JANSSON_MAJOR_VERSION >= 2
  71. #define JSON_LOADS(str, err_ptr) json_loads((str), 0, (err_ptr))
  72. #else
  73. #define JSON_LOADS(str, err_ptr) json_loads((str), (err_ptr))
  74. #endif
  75. extern char *json_dumps_ANY(json_t *, size_t flags);
  76. static inline
  77. const char *bfg_json_obj_string(json_t *json, const char *key, const char *fail)
  78. {
  79. json = json_object_get(json, key);
  80. if (!json)
  81. return fail;
  82. return json_string_value(json) ?: fail;
  83. }
  84. extern const char *__json_array_string(json_t *, unsigned int entry);
  85. extern void *my_memrchr(const void *, int, size_t);
  86. extern bool isCalpha(int);
  87. static inline
  88. bool isCspace(int c)
  89. {
  90. switch (c)
  91. {
  92. case ' ': case '\f': case '\n': case '\r': case '\t': case '\v':
  93. return true;
  94. default:
  95. return false;
  96. }
  97. }
  98. extern const char *get_registered_domain(size_t *out_len, const char *, size_t len);
  99. extern const char *extract_domain(size_t *out_len, const char *uri, size_t urilen);
  100. extern bool match_domains(const char *a, size_t alen, const char *b, size_t blen);
  101. extern void test_domain_funcs();
  102. enum bfg_gpio_value {
  103. BGV_LOW = 0,
  104. BGV_HIGH = 1,
  105. BGV_ERROR = -1,
  106. };
  107. typedef struct timeval cgtimer_t;
  108. struct thr_info;
  109. struct pool;
  110. enum dev_reason;
  111. struct cgpu_info;
  112. 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);
  113. extern json_t *json_rpc_call_completed(CURL *, int rc, bool probe, int *rolltime, void *out_priv);
  114. extern char *absolute_uri(char *uri, const char *ref); // ref must be a root URI
  115. extern size_t ucs2_to_utf8(char *out, const uint16_t *in, size_t sz);
  116. extern char *ucs2_to_utf8_dup(uint16_t *in, size_t sz);
  117. #define BFGINIT(var, val) do{ \
  118. if (!(var)) \
  119. (var) = val; \
  120. }while(0)
  121. extern void gen_hash(unsigned char *data, unsigned char *hash, int len);
  122. extern void hash_data(unsigned char *out_hash, const unsigned char *data);
  123. extern void real_block_target(unsigned char *target, const unsigned char *data);
  124. extern bool hash_target_check(const unsigned char *hash, const unsigned char *target);
  125. extern bool hash_target_check_v(const unsigned char *hash, const unsigned char *target);
  126. int thr_info_create(struct thr_info *thr, pthread_attr_t *attr, void *(*start) (void *), void *arg);
  127. void thr_info_freeze(struct thr_info *thr);
  128. void thr_info_cancel(struct thr_info *thr);
  129. void subtime(struct timeval *a, struct timeval *b);
  130. void addtime(struct timeval *a, struct timeval *b);
  131. bool time_more(struct timeval *a, struct timeval *b);
  132. bool time_less(struct timeval *a, struct timeval *b);
  133. void copy_time(struct timeval *dest, const struct timeval *src);
  134. void timespec_to_val(struct timeval *val, const struct timespec *spec);
  135. void timeval_to_spec(struct timespec *spec, const struct timeval *val);
  136. void us_to_timeval(struct timeval *val, int64_t us);
  137. void us_to_timespec(struct timespec *spec, int64_t us);
  138. void ms_to_timespec(struct timespec *spec, int64_t ms);
  139. void timeraddspec(struct timespec *a, const struct timespec *b);
  140. void cgsleep_ms(int ms);
  141. void cgsleep_us(int64_t us);
  142. #define cgtimer_time(ts_start) timer_set_now(ts_start)
  143. #define cgsleep_prepare_r(ts_start) cgtimer_time(ts_start)
  144. void cgsleep_ms_r(cgtimer_t *ts_start, int ms);
  145. void (*cgsleep_us_r)(cgtimer_t *ts_start, int64_t us);
  146. static inline
  147. int cgtimer_to_ms(cgtimer_t *cgt)
  148. {
  149. return (cgt->tv_sec * 1000) + (cgt->tv_usec / 1000);
  150. }
  151. #define cgtimer_sub(a, b, res) timersub(a, b, res)
  152. double us_tdiff(struct timeval *end, struct timeval *start);
  153. double tdiff(struct timeval *end, struct timeval *start);
  154. bool _stratum_send(struct pool *pool, char *s, ssize_t len, bool force);
  155. #define stratum_send(pool, s, len) _stratum_send(pool, s, len, false)
  156. bool sock_full(struct pool *pool);
  157. char *recv_line(struct pool *pool);
  158. bool parse_method(struct pool *pool, char *s);
  159. bool extract_sockaddr(char *url, char **sockaddr_url, char **sockaddr_port);
  160. bool auth_stratum(struct pool *pool);
  161. bool initiate_stratum(struct pool *pool);
  162. bool restart_stratum(struct pool *pool);
  163. void suspend_stratum(struct pool *pool);
  164. extern void dev_error_update(struct cgpu_info *, enum dev_reason);
  165. void dev_error(struct cgpu_info *dev, enum dev_reason reason);
  166. void *realloc_strcat(char *ptr, char *s);
  167. extern char *sanestr(char *o, char *s);
  168. void RenameThread(const char* name);
  169. enum bfg_strerror_type {
  170. BST_ERRNO,
  171. BST_SOCKET,
  172. BST_LIBUSB,
  173. BST_SYSTEM,
  174. };
  175. extern const char *bfg_strerror(int, enum bfg_strerror_type);
  176. extern void *bfg_slurp_file(void *buf, size_t bufsz, const char *filename);
  177. typedef SOCKETTYPE notifier_t[2];
  178. extern void notifier_init(notifier_t);
  179. extern void notifier_wake(notifier_t);
  180. extern void notifier_read(notifier_t);
  181. extern void notifier_init_invalid(notifier_t);
  182. extern void notifier_destroy(notifier_t);
  183. /* Align a size_t to 4 byte boundaries for fussy arches */
  184. static inline void align_len(size_t *len)
  185. {
  186. if (*len % 4)
  187. *len += 4 - (*len % 4);
  188. }
  189. typedef struct bytes_t {
  190. uint8_t *buf;
  191. size_t sz;
  192. size_t allocsz;
  193. } bytes_t;
  194. #define BYTES_INIT ((bytes_t){.buf=NULL,})
  195. static inline
  196. void bytes_init(bytes_t *b)
  197. {
  198. *b = BYTES_INIT;
  199. }
  200. // This can't be inline without ugly const/non-const issues
  201. #define bytes_buf(b) ((b)->buf)
  202. static inline
  203. size_t bytes_len(const bytes_t *b)
  204. {
  205. return b->sz;
  206. }
  207. static inline
  208. ssize_t bytes_find(const bytes_t * const b, const uint8_t needle)
  209. {
  210. const size_t blen = bytes_len(b);
  211. const uint8_t * const buf = bytes_buf(b);
  212. for (int i = 0; i < blen; ++i)
  213. if (buf[i] == needle)
  214. return i;
  215. return -1;
  216. }
  217. extern void _bytes_alloc_failure(size_t);
  218. static inline
  219. void bytes_extend_buf(bytes_t * const b, const size_t newsz)
  220. {
  221. if (newsz <= b->allocsz)
  222. return;
  223. if (!b->allocsz)
  224. b->allocsz = 0x10;
  225. do {
  226. b->allocsz *= 2;
  227. } while (newsz > b->allocsz);
  228. b->buf = realloc(b->buf, b->allocsz);
  229. if (!b->buf)
  230. _bytes_alloc_failure(b->allocsz);
  231. }
  232. static inline
  233. void bytes_resize(bytes_t * const b, const size_t newsz)
  234. {
  235. bytes_extend_buf(b, newsz);
  236. b->sz = newsz;
  237. }
  238. static inline
  239. void *bytes_preappend(bytes_t * const b, const size_t addsz)
  240. {
  241. size_t origsz = bytes_len(b);
  242. bytes_extend_buf(b, origsz + addsz);
  243. return &bytes_buf(b)[origsz];
  244. }
  245. static inline
  246. void bytes_postappend(bytes_t * const b, const size_t addsz)
  247. {
  248. size_t origsz = bytes_len(b);
  249. bytes_resize(b, origsz + addsz);
  250. }
  251. static inline
  252. void bytes_append(bytes_t * const b, const void * const add, const size_t addsz)
  253. {
  254. void * const appendbuf = bytes_preappend(b, addsz);
  255. memcpy(appendbuf, add, addsz);
  256. bytes_postappend(b, addsz);
  257. }
  258. static inline
  259. void bytes_cat(bytes_t *b, const bytes_t *cat)
  260. {
  261. bytes_append(b, bytes_buf(cat), bytes_len(cat));
  262. }
  263. static inline
  264. void bytes_cpy(bytes_t *dst, const bytes_t *src)
  265. {
  266. dst->sz = src->sz;
  267. if (!dst->sz) {
  268. dst->allocsz = 0;
  269. dst->buf = NULL;
  270. return;
  271. }
  272. dst->allocsz = src->allocsz;
  273. size_t half;
  274. while (dst->sz <= (half = dst->allocsz / 2))
  275. dst->allocsz = half;
  276. dst->buf = malloc(dst->allocsz);
  277. memcpy(dst->buf, src->buf, dst->sz);
  278. }
  279. static inline
  280. void bytes_shift(bytes_t *b, size_t shift)
  281. {
  282. if (shift >= b->sz)
  283. {
  284. b->sz = 0;
  285. return;
  286. }
  287. b->sz -= shift;
  288. memmove(bytes_buf(b), &bytes_buf(b)[shift], bytes_len(b));
  289. }
  290. static inline
  291. void bytes_reset(bytes_t *b)
  292. {
  293. b->sz = 0;
  294. }
  295. static inline
  296. void bytes_nullterminate(bytes_t *b)
  297. {
  298. bytes_append(b, "", 1);
  299. --b->sz;
  300. }
  301. static inline
  302. void bytes_free(bytes_t *b)
  303. {
  304. free(b->buf);
  305. b->sz = b->allocsz = 0;
  306. }
  307. static inline
  308. void set_maxfd(int *p_maxfd, int fd)
  309. {
  310. if (fd > *p_maxfd)
  311. *p_maxfd = fd;
  312. }
  313. static inline
  314. void timer_unset(struct timeval *tvp)
  315. {
  316. tvp->tv_sec = -1;
  317. }
  318. static inline
  319. bool timer_isset(const struct timeval *tvp)
  320. {
  321. return tvp->tv_sec != -1;
  322. }
  323. extern void (*timer_set_now)(struct timeval *);
  324. #define cgtime(tvp) timer_set_now(tvp)
  325. #define TIMEVAL_USECS(usecs) ( \
  326. (struct timeval){ \
  327. .tv_sec = (usecs) / 1000000, \
  328. .tv_usec = (usecs) % 1000000, \
  329. } \
  330. )
  331. static inline
  332. long timeval_to_us(const struct timeval *tvp)
  333. {
  334. return ((long)tvp->tv_sec * 1000000) + tvp->tv_usec;
  335. }
  336. #define timer_set_delay(tvp_timer, tvp_now, usecs) do { \
  337. struct timeval tv_add = TIMEVAL_USECS(usecs); \
  338. timeradd(&tv_add, tvp_now, tvp_timer); \
  339. } while(0)
  340. #define timer_set_delay_from_now(tvp_timer, usecs) do { \
  341. struct timeval tv_now; \
  342. timer_set_now(&tv_now); \
  343. timer_set_delay(tvp_timer, &tv_now, usecs); \
  344. } while(0)
  345. static inline
  346. const struct timeval *_bfg_nullisnow(const struct timeval *tvp, struct timeval *tvp_buf)
  347. {
  348. if (tvp)
  349. return tvp;
  350. cgtime(tvp_buf);
  351. return tvp_buf;
  352. }
  353. static inline
  354. long timer_elapsed_us(const struct timeval *tvp_timer, const struct timeval *tvp_now)
  355. {
  356. struct timeval tv;
  357. const struct timeval *_tvp_now = _bfg_nullisnow(tvp_now, &tv);
  358. timersub(_tvp_now, tvp_timer, &tv);
  359. return timeval_to_us(&tv);
  360. }
  361. #define ms_tdiff(end, start) (timer_elapsed_us(start, end) / 1000)
  362. static inline
  363. int timer_elapsed(const struct timeval *tvp_timer, const struct timeval *tvp_now)
  364. {
  365. struct timeval tv;
  366. const struct timeval *_tvp_now = _bfg_nullisnow(tvp_now, &tv);
  367. timersub(_tvp_now, tvp_timer, &tv);
  368. return tv.tv_sec;
  369. }
  370. static inline
  371. bool timer_passed(const struct timeval *tvp_timer, const struct timeval *tvp_now)
  372. {
  373. if (!timer_isset(tvp_timer))
  374. return false;
  375. struct timeval tv;
  376. const struct timeval *_tvp_now = _bfg_nullisnow(tvp_now, &tv);
  377. return timercmp(tvp_timer, _tvp_now, <);
  378. }
  379. #if defined(WIN32) && !defined(HAVE_POOR_GETTIMEOFDAY)
  380. #define HAVE_POOR_GETTIMEOFDAY
  381. #endif
  382. #ifdef HAVE_POOR_GETTIMEOFDAY
  383. extern void bfg_gettimeofday(struct timeval *);
  384. #else
  385. #define bfg_gettimeofday(out) gettimeofday(out, NULL)
  386. #endif
  387. static inline
  388. void reduce_timeout_to(struct timeval *tvp_timeout, struct timeval *tvp_time)
  389. {
  390. if (!timer_isset(tvp_time))
  391. return;
  392. if ((!timer_isset(tvp_timeout)) || timercmp(tvp_time, tvp_timeout, <))
  393. *tvp_timeout = *tvp_time;
  394. }
  395. static inline
  396. struct timeval *select_timeout(struct timeval *tvp_timeout, struct timeval *tvp_now)
  397. {
  398. if (!timer_isset(tvp_timeout))
  399. return NULL;
  400. if (timercmp(tvp_timeout, tvp_now, <))
  401. timerclear(tvp_timeout);
  402. else
  403. timersub(tvp_timeout, tvp_now, tvp_timeout);
  404. return tvp_timeout;
  405. }
  406. #define _SNP2(fn, ...) do{ \
  407. int __n42 = fn(s, sz, __VA_ARGS__); \
  408. s += __n42; \
  409. sz = (sz <= __n42) ? 0 : (sz - __n42); \
  410. rv += __n42; \
  411. }while(0)
  412. #define _SNP(...) _SNP2(snprintf, __VA_ARGS__)
  413. #define REPLACEMENT_CHAR (0xFFFD)
  414. #define U8_DEGREE "\xc2\xb0"
  415. #define U8_MICRO "\xc2\xb5"
  416. #define U8_HLINE "\xe2\x94\x80"
  417. #define U8_BTEE "\xe2\x94\xb4"
  418. extern int utf8_len(uint8_t);
  419. extern int32_t utf8_decode(const void *, int *out_len);
  420. extern size_t utf8_strlen(const void *);
  421. extern void utf8_test();
  422. #define RUNONCE(rv) do { \
  423. static bool _runonce = false; \
  424. if (_runonce) \
  425. return rv; \
  426. _runonce = true; \
  427. } while(0)
  428. static inline
  429. char *maybe_strdup(const char *s)
  430. {
  431. return s ? strdup(s) : NULL;
  432. }
  433. static inline
  434. void maybe_strdup_if_null(const char **p, const char *s)
  435. {
  436. if (!*p)
  437. *p = maybe_strdup(s);
  438. }
  439. extern char *trimmed_strdup(const char *);
  440. extern void run_cmd(const char *cmd);
  441. extern uint8_t crc5usb(unsigned char *ptr, uint8_t len);
  442. extern void bfg_init_checksums(void);
  443. extern uint8_t crc8ccitt(const void *, size_t);
  444. #endif /* __UTIL_H__ */