util.c 15 KB

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