util.c 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717
  1. /*
  2. * Copyright 2011 Con Kolivas
  3. * Copyright 2010 Jeff Garzik
  4. *
  5. * This program is free software; you can redistribute it and/or modify it
  6. * under the terms of the GNU General Public License as published by the Free
  7. * Software Foundation; either version 2 of the License, or (at your option)
  8. * any later version. See COPYING for more details.
  9. */
  10. #define _GNU_SOURCE
  11. #include "config.h"
  12. #include <stdio.h>
  13. #include <stdlib.h>
  14. #include <ctype.h>
  15. #include <stdarg.h>
  16. #include <string.h>
  17. #include <jansson.h>
  18. #include <curl/curl.h>
  19. #include <time.h>
  20. #include <curses.h>
  21. #include <errno.h>
  22. #include <unistd.h>
  23. #include <sys/types.h>
  24. #ifndef WIN32
  25. # include <sys/socket.h>
  26. # include <netinet/in.h>
  27. # include <netinet/tcp.h>
  28. #else
  29. # include <winsock2.h>
  30. # include <mstcpip.h>
  31. #endif
  32. #include "miner.h"
  33. #include "elist.h"
  34. #if JANSSON_MAJOR_VERSION >= 2
  35. #define JSON_LOADS(str, err_ptr) json_loads((str), 0, (err_ptr))
  36. #else
  37. #define JSON_LOADS(str, err_ptr) json_loads((str), (err_ptr))
  38. #endif
  39. bool successful_connect = false;
  40. bool test_and_set(bool *var)
  41. {
  42. bool ret;
  43. mutex_lock(&control_lock);
  44. ret = *var;
  45. *var = true;
  46. mutex_unlock(&control_lock);
  47. return ret;
  48. }
  49. bool test_and_clear(bool *var)
  50. {
  51. bool ret;
  52. mutex_lock(&control_lock);
  53. ret = *var;
  54. *var = false;
  55. mutex_unlock(&control_lock);
  56. return ret;
  57. }
  58. struct data_buffer {
  59. void *buf;
  60. size_t len;
  61. };
  62. struct upload_buffer {
  63. const void *buf;
  64. size_t len;
  65. };
  66. struct header_info {
  67. char *lp_path;
  68. bool has_rolltime;
  69. };
  70. struct tq_ent {
  71. void *data;
  72. struct list_head q_node;
  73. };
  74. struct thread_q {
  75. struct list_head q;
  76. bool frozen;
  77. pthread_mutex_t mutex;
  78. pthread_cond_t cond;
  79. };
  80. void vapplog(int prio, const char *fmt, va_list ap)
  81. {
  82. #ifdef HAVE_SYSLOG_H
  83. if (use_syslog) {
  84. vsyslog(prio, fmt, ap);
  85. }
  86. #else
  87. if (0) {}
  88. #endif
  89. else if (opt_log_output || prio == LOG_WARNING || prio == LOG_ERR) {
  90. char *f;
  91. int len;
  92. struct timeval tv = { };
  93. struct tm tm;
  94. gettimeofday(&tv, NULL);
  95. localtime_r(&tv.tv_sec, &tm);
  96. len = 40 + strlen(fmt) + 22;
  97. f = alloca(len);
  98. sprintf(f, "[%d-%02d-%02d %02d:%02d:%02d] %s \n",
  99. tm.tm_year + 1900,
  100. tm.tm_mon + 1,
  101. tm.tm_mday,
  102. tm.tm_hour,
  103. tm.tm_min,
  104. tm.tm_sec,
  105. fmt);
  106. /* Only output to stderr if it's not going to the screen as well */
  107. if (!isatty(fileno((FILE *)stderr))) {
  108. va_list apc;
  109. va_copy(apc, ap);
  110. vfprintf(stderr, f, apc); /* atomic write to stderr */
  111. fflush(stderr);
  112. }
  113. log_curses(prio, f, ap);
  114. }
  115. }
  116. void applog(int prio, const char *fmt, ...)
  117. {
  118. va_list ap;
  119. va_start(ap, fmt);
  120. vapplog(prio, fmt, ap);
  121. va_end(ap);
  122. }
  123. static void databuf_free(struct data_buffer *db)
  124. {
  125. if (!db)
  126. return;
  127. free(db->buf);
  128. memset(db, 0, sizeof(*db));
  129. }
  130. static size_t all_data_cb(const void *ptr, size_t size, size_t nmemb,
  131. void *user_data)
  132. {
  133. struct data_buffer *db = user_data;
  134. size_t len = size * nmemb;
  135. size_t oldlen, newlen;
  136. void *newmem;
  137. static const unsigned char zero = 0;
  138. oldlen = db->len;
  139. newlen = oldlen + len;
  140. newmem = realloc(db->buf, newlen + 1);
  141. if (!newmem)
  142. return 0;
  143. db->buf = newmem;
  144. db->len = newlen;
  145. memcpy(db->buf + oldlen, ptr, len);
  146. memcpy(db->buf + newlen, &zero, 1); /* null terminate */
  147. return len;
  148. }
  149. static size_t upload_data_cb(void *ptr, size_t size, size_t nmemb,
  150. void *user_data)
  151. {
  152. struct upload_buffer *ub = user_data;
  153. int len = size * nmemb;
  154. if (len > ub->len)
  155. len = ub->len;
  156. if (len) {
  157. memcpy(ptr, ub->buf, len);
  158. ub->buf += len;
  159. ub->len -= len;
  160. }
  161. return len;
  162. }
  163. static size_t resp_hdr_cb(void *ptr, size_t size, size_t nmemb, void *user_data)
  164. {
  165. struct header_info *hi = user_data;
  166. size_t remlen, slen, ptrlen = size * nmemb;
  167. char *rem, *val = NULL, *key = NULL;
  168. void *tmp;
  169. val = calloc(1, ptrlen);
  170. key = calloc(1, ptrlen);
  171. if (!key || !val)
  172. goto out;
  173. tmp = memchr(ptr, ':', ptrlen);
  174. if (!tmp || (tmp == ptr)) /* skip empty keys / blanks */
  175. goto out;
  176. slen = tmp - ptr;
  177. if ((slen + 1) == ptrlen) /* skip key w/ no value */
  178. goto out;
  179. memcpy(key, ptr, slen); /* store & nul term key */
  180. key[slen] = 0;
  181. rem = ptr + slen + 1; /* trim value's leading whitespace */
  182. remlen = ptrlen - slen - 1;
  183. while ((remlen > 0) && (isspace(*rem))) {
  184. remlen--;
  185. rem++;
  186. }
  187. memcpy(val, rem, remlen); /* store value, trim trailing ws */
  188. val[remlen] = 0;
  189. while ((*val) && (isspace(val[strlen(val) - 1]))) {
  190. val[strlen(val) - 1] = 0;
  191. }
  192. if (!*val) /* skip blank value */
  193. goto out;
  194. if (opt_protocol)
  195. applog(LOG_DEBUG, "HTTP hdr(%s): %s", key, val);
  196. if (!strcasecmp("X-Roll-Ntime", key)) {
  197. if (opt_debug)
  198. applog(LOG_DEBUG, "X-Roll-Ntime found");
  199. hi->has_rolltime = true;
  200. }
  201. if (!strcasecmp("X-Long-Polling", key)) {
  202. hi->lp_path = val; /* steal memory reference */
  203. val = NULL;
  204. }
  205. out:
  206. free(key);
  207. free(val);
  208. return ptrlen;
  209. }
  210. int json_rpc_call_sockopt_cb(void *userdata, curl_socket_t fd, curlsocktype purpose)
  211. {
  212. int keepalive = 1;
  213. int tcp_keepcnt = 5;
  214. int tcp_keepidle = 120;
  215. int tcp_keepintvl = 120;
  216. #ifndef WIN32
  217. if (unlikely(setsockopt(fd, SOL_SOCKET, SO_KEEPALIVE, &keepalive, sizeof(keepalive))))
  218. return 1;
  219. # ifdef __linux
  220. if (unlikely(setsockopt(fd, SOL_TCP, TCP_KEEPCNT, &tcp_keepcnt, sizeof(tcp_keepcnt))))
  221. return 1;
  222. if (unlikely(setsockopt(fd, SOL_TCP, TCP_KEEPIDLE, &tcp_keepidle, sizeof(tcp_keepidle))))
  223. return 1;
  224. if (unlikely(setsockopt(fd, SOL_TCP, TCP_KEEPINTVL, &tcp_keepintvl, sizeof(tcp_keepintvl))))
  225. return 1;
  226. # endif /* __linux */
  227. # ifdef __APPLE_CC__
  228. if (unlikely(setsockopt(fd, IPPROTO_TCP, TCP_KEEPALIVE, &tcp_keepintvl, sizeof(tcp_keepintvl))))
  229. return 1;
  230. # endif /* __APPLE_CC__ */
  231. #else /* WIN32 */
  232. struct tcp_keepalive vals;
  233. vals.onoff = 1;
  234. vals.keepalivetime = tcp_keepidle * 1000;
  235. vals.keepaliveinterval = tcp_keepintvl * 1000;
  236. DWORD outputBytes;
  237. if (unlikely(WSAIoctl(fd, SIO_KEEPALIVE_VALS, &vals, sizeof(vals), NULL, 0, &outputBytes, NULL, NULL)))
  238. return 1;
  239. #endif /* WIN32 */
  240. return 0;
  241. }
  242. json_t *json_rpc_call(CURL *curl, const char *url,
  243. const char *userpass, const char *rpc_req,
  244. bool probe, bool longpoll, bool *rolltime,
  245. struct pool *pool)
  246. {
  247. json_t *val, *err_val, *res_val;
  248. int rc;
  249. struct data_buffer all_data = { };
  250. struct upload_buffer upload_data;
  251. json_error_t err = { };
  252. struct curl_slist *headers = NULL;
  253. char len_hdr[64], user_agent_hdr[128];
  254. char curl_err_str[CURL_ERROR_SIZE];
  255. long timeout = longpoll ? (60 * 60) : 60;
  256. struct header_info hi = { };
  257. bool probing = false;
  258. /* it is assumed that 'curl' is freshly [re]initialized at this pt */
  259. if (probe) {
  260. probing = !pool->probed;
  261. /* Probe for only 15 seconds */
  262. timeout = 15;
  263. }
  264. curl_easy_setopt(curl, CURLOPT_TIMEOUT, timeout);
  265. if (opt_protocol)
  266. curl_easy_setopt(curl, CURLOPT_VERBOSE, 1);
  267. curl_easy_setopt(curl, CURLOPT_NOSIGNAL, 1);
  268. curl_easy_setopt(curl, CURLOPT_URL, url);
  269. curl_easy_setopt(curl, CURLOPT_ENCODING, "");
  270. curl_easy_setopt(curl, CURLOPT_FAILONERROR, 1);
  271. curl_easy_setopt(curl, CURLOPT_TCP_NODELAY, 1);
  272. curl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, all_data_cb);
  273. curl_easy_setopt(curl, CURLOPT_WRITEDATA, &all_data);
  274. curl_easy_setopt(curl, CURLOPT_READFUNCTION, upload_data_cb);
  275. curl_easy_setopt(curl, CURLOPT_READDATA, &upload_data);
  276. curl_easy_setopt(curl, CURLOPT_ERRORBUFFER, curl_err_str);
  277. curl_easy_setopt(curl, CURLOPT_FOLLOWLOCATION, 1);
  278. curl_easy_setopt(curl, CURLOPT_HEADERFUNCTION, resp_hdr_cb);
  279. curl_easy_setopt(curl, CURLOPT_HEADERDATA, &hi);
  280. if (userpass) {
  281. curl_easy_setopt(curl, CURLOPT_USERPWD, userpass);
  282. curl_easy_setopt(curl, CURLOPT_HTTPAUTH, CURLAUTH_BASIC);
  283. }
  284. #ifdef CURL_HAS_SOCKOPT
  285. if (longpoll)
  286. curl_easy_setopt(curl, CURLOPT_SOCKOPTFUNCTION, json_rpc_call_sockopt_cb);
  287. #endif
  288. curl_easy_setopt(curl, CURLOPT_POST, 1);
  289. if (opt_protocol)
  290. applog(LOG_DEBUG, "JSON protocol request:\n%s", rpc_req);
  291. upload_data.buf = rpc_req;
  292. upload_data.len = strlen(rpc_req);
  293. sprintf(len_hdr, "Content-Length: %lu",
  294. (unsigned long) upload_data.len);
  295. sprintf(user_agent_hdr, "User-Agent: %s", PACKAGE_STRING);
  296. headers = curl_slist_append(headers,
  297. "Content-type: application/json");
  298. headers = curl_slist_append(headers, len_hdr);
  299. headers = curl_slist_append(headers, user_agent_hdr);
  300. headers = curl_slist_append(headers, "Expect:"); /* disable Expect hdr*/
  301. curl_easy_setopt(curl, CURLOPT_HTTPHEADER, headers);
  302. rc = curl_easy_perform(curl);
  303. if (rc) {
  304. applog(LOG_INFO, "HTTP request failed: %s", curl_err_str);
  305. goto err_out;
  306. }
  307. if (!all_data.buf) {
  308. if (opt_debug)
  309. applog(LOG_DEBUG, "Empty data received in json_rpc_call.");
  310. goto err_out;
  311. }
  312. if (probing) {
  313. pool->probed = true;
  314. /* If X-Long-Polling was found, activate long polling */
  315. if (hi.lp_path)
  316. pool->hdr_path = hi.lp_path;
  317. else
  318. pool->hdr_path = NULL;
  319. }
  320. *rolltime = hi.has_rolltime;
  321. val = JSON_LOADS(all_data.buf, &err);
  322. if (!val) {
  323. applog(LOG_INFO, "JSON decode failed(%d): %s", err.line, err.text);
  324. if (opt_protocol)
  325. applog(LOG_DEBUG, "JSON protocol response:\n%s", all_data.buf);
  326. goto err_out;
  327. }
  328. if (opt_protocol) {
  329. char *s = json_dumps(val, JSON_INDENT(3));
  330. applog(LOG_DEBUG, "JSON protocol response:\n%s", s);
  331. free(s);
  332. }
  333. /* JSON-RPC valid response returns a non-null 'result',
  334. * and a null 'error'.
  335. */
  336. res_val = json_object_get(val, "result");
  337. err_val = json_object_get(val, "error");
  338. if (!res_val || json_is_null(res_val) ||
  339. (err_val && !json_is_null(err_val))) {
  340. char *s;
  341. if (err_val)
  342. s = json_dumps(err_val, JSON_INDENT(3));
  343. else
  344. s = strdup("(unknown reason)");
  345. applog(LOG_INFO, "JSON-RPC call failed: %s", s);
  346. free(s);
  347. goto err_out;
  348. }
  349. successful_connect = true;
  350. databuf_free(&all_data);
  351. curl_slist_free_all(headers);
  352. curl_easy_reset(curl);
  353. return val;
  354. err_out:
  355. databuf_free(&all_data);
  356. curl_slist_free_all(headers);
  357. curl_easy_reset(curl);
  358. if (!successful_connect)
  359. applog(LOG_DEBUG, "Failed to connect in json_rpc_call");
  360. return NULL;
  361. }
  362. char *bin2hex(const unsigned char *p, size_t len)
  363. {
  364. int i;
  365. char *s = malloc((len * 2) + 1);
  366. if (!s)
  367. return NULL;
  368. for (i = 0; i < len; i++)
  369. sprintf(s + (i * 2), "%02x", (unsigned int) p[i]);
  370. return s;
  371. }
  372. bool hex2bin(unsigned char *p, const char *hexstr, size_t len)
  373. {
  374. while (*hexstr && len) {
  375. char hex_byte[3];
  376. unsigned int v;
  377. if (!hexstr[1]) {
  378. applog(LOG_ERR, "hex2bin str truncated");
  379. return false;
  380. }
  381. hex_byte[0] = hexstr[0];
  382. hex_byte[1] = hexstr[1];
  383. hex_byte[2] = 0;
  384. if (sscanf(hex_byte, "%x", &v) != 1) {
  385. applog(LOG_ERR, "hex2bin sscanf '%s' failed", hex_byte);
  386. return false;
  387. }
  388. *p = (unsigned char) v;
  389. p++;
  390. hexstr += 2;
  391. len--;
  392. }
  393. return (len == 0 && *hexstr == 0) ? true : false;
  394. }
  395. /* Subtract the `struct timeval' values X and Y,
  396. storing the result in RESULT.
  397. Return 1 if the difference is negative, otherwise 0. */
  398. int
  399. timeval_subtract (
  400. struct timeval *result, struct timeval *x, struct timeval *y)
  401. {
  402. /* Perform the carry for the later subtraction by updating Y. */
  403. if (x->tv_usec < y->tv_usec) {
  404. int nsec = (y->tv_usec - x->tv_usec) / 1000000 + 1;
  405. y->tv_usec -= 1000000 * nsec;
  406. y->tv_sec += nsec;
  407. }
  408. if (x->tv_usec - y->tv_usec > 1000000) {
  409. int nsec = (x->tv_usec - y->tv_usec) / 1000000;
  410. y->tv_usec += 1000000 * nsec;
  411. y->tv_sec -= nsec;
  412. }
  413. /* Compute the time remaining to wait.
  414. `tv_usec' is certainly positive. */
  415. result->tv_sec = x->tv_sec - y->tv_sec;
  416. result->tv_usec = x->tv_usec - y->tv_usec;
  417. /* Return 1 if result is negative. */
  418. return x->tv_sec < y->tv_sec;
  419. }
  420. bool fulltest(const unsigned char *hash, const unsigned char *target)
  421. {
  422. unsigned char hash_swap[32], target_swap[32];
  423. uint32_t *hash32 = (uint32_t *) hash_swap;
  424. uint32_t *target32 = (uint32_t *) target_swap;
  425. int i;
  426. bool rc = true;
  427. char *hash_str, *target_str;
  428. swap256(hash_swap, hash);
  429. swap256(target_swap, target);
  430. for (i = 0; i < 32/4; i++) {
  431. uint32_t h32tmp = swab32(hash32[i]);
  432. uint32_t t32tmp = target32[i];
  433. target32[i] = swab32(target32[i]); /* for printing */
  434. if (h32tmp > t32tmp) {
  435. rc = false;
  436. break;
  437. }
  438. if (h32tmp < t32tmp) {
  439. rc = true;
  440. break;
  441. }
  442. }
  443. if (opt_debug) {
  444. hash_str = bin2hex(hash_swap, 32);
  445. target_str = bin2hex(target_swap, 32);
  446. applog(LOG_DEBUG, " Proof: %s\nTarget: %s\nTrgVal? %s",
  447. hash_str,
  448. target_str,
  449. rc ? "YES (hash < target)" :
  450. "no (false positive; hash > target)");
  451. free(hash_str);
  452. free(target_str);
  453. }
  454. return rc;
  455. }
  456. struct thread_q *tq_new(void)
  457. {
  458. struct thread_q *tq;
  459. tq = calloc(1, sizeof(*tq));
  460. if (!tq)
  461. return NULL;
  462. INIT_LIST_HEAD(&tq->q);
  463. pthread_mutex_init(&tq->mutex, NULL);
  464. pthread_cond_init(&tq->cond, NULL);
  465. return tq;
  466. }
  467. void tq_free(struct thread_q *tq)
  468. {
  469. struct tq_ent *ent, *iter;
  470. if (!tq)
  471. return;
  472. list_for_each_entry_safe(ent, iter, &tq->q, q_node) {
  473. list_del(&ent->q_node);
  474. free(ent);
  475. }
  476. pthread_cond_destroy(&tq->cond);
  477. pthread_mutex_destroy(&tq->mutex);
  478. memset(tq, 0, sizeof(*tq)); /* poison */
  479. free(tq);
  480. }
  481. static void tq_freezethaw(struct thread_q *tq, bool frozen)
  482. {
  483. mutex_lock(&tq->mutex);
  484. tq->frozen = frozen;
  485. pthread_cond_signal(&tq->cond);
  486. mutex_unlock(&tq->mutex);
  487. }
  488. void tq_freeze(struct thread_q *tq)
  489. {
  490. tq_freezethaw(tq, true);
  491. }
  492. void tq_thaw(struct thread_q *tq)
  493. {
  494. tq_freezethaw(tq, false);
  495. }
  496. bool tq_push_head(struct thread_q *tq, void *data)
  497. {
  498. struct tq_ent *ent;
  499. bool rc = true;
  500. ent = calloc(1, sizeof(*ent));
  501. if (!ent)
  502. return false;
  503. ent->data = data;
  504. INIT_LIST_HEAD(&ent->q_node);
  505. mutex_lock(&tq->mutex);
  506. if (!tq->frozen) {
  507. list_add(&ent->q_node, &tq->q);
  508. } else {
  509. free(ent);
  510. rc = false;
  511. }
  512. pthread_cond_signal(&tq->cond);
  513. mutex_unlock(&tq->mutex);
  514. return rc;
  515. }
  516. bool tq_push(struct thread_q *tq, void *data)
  517. {
  518. struct tq_ent *ent;
  519. bool rc = true;
  520. ent = calloc(1, sizeof(*ent));
  521. if (!ent)
  522. return false;
  523. ent->data = data;
  524. INIT_LIST_HEAD(&ent->q_node);
  525. mutex_lock(&tq->mutex);
  526. if (!tq->frozen) {
  527. list_add_tail(&ent->q_node, &tq->q);
  528. } else {
  529. free(ent);
  530. rc = false;
  531. }
  532. pthread_cond_signal(&tq->cond);
  533. mutex_unlock(&tq->mutex);
  534. return rc;
  535. }
  536. void *tq_pop(struct thread_q *tq, const struct timespec *abstime)
  537. {
  538. struct tq_ent *ent;
  539. void *rval = NULL;
  540. int rc;
  541. mutex_lock(&tq->mutex);
  542. if (!list_empty(&tq->q))
  543. goto pop;
  544. if (abstime)
  545. rc = pthread_cond_timedwait(&tq->cond, &tq->mutex, abstime);
  546. else
  547. rc = pthread_cond_wait(&tq->cond, &tq->mutex);
  548. if (rc)
  549. goto out;
  550. if (list_empty(&tq->q))
  551. goto out;
  552. pop:
  553. ent = list_entry(tq->q.next, struct tq_ent, q_node);
  554. rval = ent->data;
  555. list_del(&ent->q_node);
  556. free(ent);
  557. out:
  558. mutex_unlock(&tq->mutex);
  559. return rval;
  560. }
  561. inline int thr_info_create(struct thr_info *thr, pthread_attr_t *attr, void *(*start) (void *), void *arg)
  562. {
  563. int ret = 0;
  564. thr->pth = malloc(sizeof(pthread_t));
  565. ret = pthread_create(thr->pth, attr, start, arg);
  566. if (unlikely(ret)) {
  567. free(thr->pth);
  568. thr->pth = 0;
  569. }
  570. return ret;
  571. }