util.c 15 KB

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