util.c 14 KB

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