util.c 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710
  1. /*
  2. * Copyright 2011-2012 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 3 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 <errno.h>
  21. #include <unistd.h>
  22. #include <sys/types.h>
  23. #ifndef WIN32
  24. # include <sys/socket.h>
  25. # include <netinet/in.h>
  26. # include <netinet/tcp.h>
  27. #else
  28. # include <winsock2.h>
  29. # include <mstcpip.h>
  30. #endif
  31. #include "miner.h"
  32. #include "elist.h"
  33. #include "compat.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. unsigned 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 tcp_keepidle = 120;
  157. int tcp_keepintvl = 120;
  158. #ifndef WIN32
  159. int keepalive = 1;
  160. int tcp_keepcnt = 5;
  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 = {NULL, 0};
  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 = {NULL, false, NULL};
  215. bool probing = false;
  216. memset(&err, 0, sizeof(err));
  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 (longpoll)
  292. pool_tclear(pool, &pool->lp_sent);
  293. if (rc) {
  294. applog(LOG_INFO, "HTTP request failed: %s", curl_err_str);
  295. goto err_out;
  296. }
  297. if (!all_data.buf) {
  298. applog(LOG_DEBUG, "Empty data received in json_rpc_call.");
  299. goto err_out;
  300. }
  301. if (probing) {
  302. pool->probed = true;
  303. /* If X-Long-Polling was found, activate long polling */
  304. if (hi.lp_path) {
  305. if (pool->hdr_path != NULL)
  306. free(pool->hdr_path);
  307. pool->hdr_path = hi.lp_path;
  308. } else {
  309. pool->hdr_path = NULL;
  310. }
  311. } else if (hi.lp_path) {
  312. free(hi.lp_path);
  313. hi.lp_path = NULL;
  314. }
  315. *rolltime = hi.has_rolltime;
  316. val = JSON_LOADS(all_data.buf, &err);
  317. if (!val) {
  318. applog(LOG_INFO, "JSON decode failed(%d): %s", err.line, err.text);
  319. if (opt_protocol)
  320. applog(LOG_DEBUG, "JSON protocol response:\n%s", all_data.buf);
  321. goto err_out;
  322. }
  323. if (opt_protocol) {
  324. char *s = json_dumps(val, JSON_INDENT(3));
  325. applog(LOG_DEBUG, "JSON protocol response:\n%s", s);
  326. free(s);
  327. }
  328. /* JSON-RPC valid response returns a non-null 'result',
  329. * and a null 'error'.
  330. */
  331. res_val = json_object_get(val, "result");
  332. err_val = json_object_get(val, "error");
  333. if (!res_val || json_is_null(res_val) ||
  334. (err_val && !json_is_null(err_val))) {
  335. char *s;
  336. if (err_val)
  337. s = json_dumps(err_val, JSON_INDENT(3));
  338. else
  339. s = strdup("(unknown reason)");
  340. applog(LOG_INFO, "JSON-RPC call failed: %s", s);
  341. free(s);
  342. goto err_out;
  343. }
  344. if (hi.reason) {
  345. json_object_set_new(val, "reject-reason", json_string(hi.reason));
  346. free(hi.reason);
  347. hi.reason = NULL;
  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. curl_easy_setopt(curl, CURLOPT_FRESH_CONNECT, 1);
  361. return NULL;
  362. }
  363. char *bin2hex(const unsigned char *p, size_t len)
  364. {
  365. unsigned int i;
  366. char *s = malloc((len * 2) + 1);
  367. if (!s)
  368. return NULL;
  369. for (i = 0; i < len; i++)
  370. sprintf(s + (i * 2), "%02x", (unsigned int) p[i]);
  371. return s;
  372. }
  373. bool hex2bin(unsigned char *p, const char *hexstr, size_t len)
  374. {
  375. while (*hexstr && len) {
  376. char hex_byte[3];
  377. unsigned int v;
  378. if (!hexstr[1]) {
  379. applog(LOG_ERR, "hex2bin str truncated");
  380. return false;
  381. }
  382. hex_byte[0] = hexstr[0];
  383. hex_byte[1] = hexstr[1];
  384. hex_byte[2] = 0;
  385. if (sscanf(hex_byte, "%x", &v) != 1) {
  386. applog(LOG_ERR, "hex2bin sscanf '%s' failed", hex_byte);
  387. return false;
  388. }
  389. *p = (unsigned char) v;
  390. p++;
  391. hexstr += 2;
  392. len--;
  393. }
  394. return (len == 0 && *hexstr == 0) ? true : false;
  395. }
  396. /* Subtract the `struct timeval' values X and Y,
  397. storing the result in RESULT.
  398. Return 1 if the difference is negative, otherwise 0. */
  399. int
  400. timeval_subtract (
  401. struct timeval *result, struct timeval *x, struct timeval *y)
  402. {
  403. /* Perform the carry for the later subtraction by updating Y. */
  404. if (x->tv_usec < y->tv_usec) {
  405. int nsec = (y->tv_usec - x->tv_usec) / 1000000 + 1;
  406. y->tv_usec -= 1000000 * nsec;
  407. y->tv_sec += nsec;
  408. }
  409. if (x->tv_usec - y->tv_usec > 1000000) {
  410. int nsec = (x->tv_usec - y->tv_usec) / 1000000;
  411. y->tv_usec += 1000000 * nsec;
  412. y->tv_sec -= nsec;
  413. }
  414. /* Compute the time remaining to wait.
  415. `tv_usec' is certainly positive. */
  416. result->tv_sec = x->tv_sec - y->tv_sec;
  417. result->tv_usec = x->tv_usec - y->tv_usec;
  418. /* Return 1 if result is negative. */
  419. return x->tv_sec < y->tv_sec;
  420. }
  421. bool fulltest(const unsigned char *hash, const unsigned char *target)
  422. {
  423. unsigned char hash_swap[32], target_swap[32];
  424. uint32_t *hash32 = (uint32_t *) hash_swap;
  425. uint32_t *target32 = (uint32_t *) target_swap;
  426. int i;
  427. bool rc = true;
  428. char *hash_str, *target_str;
  429. swap256(hash_swap, hash);
  430. swap256(target_swap, target);
  431. for (i = 0; i < 32/4; i++) {
  432. uint32_t h32tmp = swab32(hash32[i]);
  433. uint32_t t32tmp = target32[i];
  434. target32[i] = swab32(target32[i]); /* for printing */
  435. if (h32tmp > t32tmp) {
  436. rc = false;
  437. break;
  438. }
  439. if (h32tmp < t32tmp) {
  440. rc = true;
  441. break;
  442. }
  443. }
  444. if (opt_debug) {
  445. hash_str = bin2hex(hash_swap, 32);
  446. target_str = bin2hex(target_swap, 32);
  447. applog(LOG_DEBUG, " Proof: %s\nTarget: %s\nTrgVal? %s",
  448. hash_str,
  449. target_str,
  450. rc ? "YES (hash < target)" :
  451. "no (false positive; hash > target)");
  452. free(hash_str);
  453. free(target_str);
  454. }
  455. return rc;
  456. }
  457. struct thread_q *tq_new(void)
  458. {
  459. struct thread_q *tq;
  460. tq = calloc(1, sizeof(*tq));
  461. if (!tq)
  462. return NULL;
  463. INIT_LIST_HEAD(&tq->q);
  464. pthread_mutex_init(&tq->mutex, NULL);
  465. pthread_cond_init(&tq->cond, NULL);
  466. return tq;
  467. }
  468. void tq_free(struct thread_q *tq)
  469. {
  470. struct tq_ent *ent, *iter;
  471. if (!tq)
  472. return;
  473. list_for_each_entry_safe(ent, iter, &tq->q, q_node) {
  474. list_del(&ent->q_node);
  475. free(ent);
  476. }
  477. pthread_cond_destroy(&tq->cond);
  478. pthread_mutex_destroy(&tq->mutex);
  479. memset(tq, 0, sizeof(*tq)); /* poison */
  480. free(tq);
  481. }
  482. static void tq_freezethaw(struct thread_q *tq, bool frozen)
  483. {
  484. mutex_lock(&tq->mutex);
  485. tq->frozen = frozen;
  486. pthread_cond_signal(&tq->cond);
  487. mutex_unlock(&tq->mutex);
  488. }
  489. void tq_freeze(struct thread_q *tq)
  490. {
  491. tq_freezethaw(tq, true);
  492. }
  493. void tq_thaw(struct thread_q *tq)
  494. {
  495. tq_freezethaw(tq, false);
  496. }
  497. bool tq_push(struct thread_q *tq, void *data)
  498. {
  499. struct tq_ent *ent;
  500. bool rc = true;
  501. ent = calloc(1, sizeof(*ent));
  502. if (!ent)
  503. return false;
  504. ent->data = data;
  505. INIT_LIST_HEAD(&ent->q_node);
  506. mutex_lock(&tq->mutex);
  507. if (!tq->frozen) {
  508. list_add_tail(&ent->q_node, &tq->q);
  509. } else {
  510. free(ent);
  511. rc = false;
  512. }
  513. pthread_cond_signal(&tq->cond);
  514. mutex_unlock(&tq->mutex);
  515. return rc;
  516. }
  517. void *tq_pop(struct thread_q *tq, const struct timespec *abstime)
  518. {
  519. struct tq_ent *ent;
  520. void *rval = NULL;
  521. int rc;
  522. mutex_lock(&tq->mutex);
  523. if (!list_empty(&tq->q))
  524. goto pop;
  525. if (abstime)
  526. rc = pthread_cond_timedwait(&tq->cond, &tq->mutex, abstime);
  527. else
  528. rc = pthread_cond_wait(&tq->cond, &tq->mutex);
  529. if (rc)
  530. goto out;
  531. if (list_empty(&tq->q))
  532. goto out;
  533. pop:
  534. ent = list_entry(tq->q.next, struct tq_ent, q_node);
  535. rval = ent->data;
  536. list_del(&ent->q_node);
  537. free(ent);
  538. out:
  539. mutex_unlock(&tq->mutex);
  540. return rval;
  541. }
  542. int thr_info_create(struct thr_info *thr, pthread_attr_t *attr, void *(*start) (void *), void *arg)
  543. {
  544. int ret;
  545. ret = pthread_create(&thr->pth, attr, start, arg);
  546. return ret;
  547. }
  548. void thr_info_freeze(struct thr_info *thr)
  549. {
  550. struct tq_ent *ent, *iter;
  551. struct thread_q *tq;
  552. if (!thr)
  553. return;
  554. tq = thr->q;
  555. if (!tq)
  556. return;
  557. mutex_lock(&tq->mutex);
  558. tq->frozen = true;
  559. list_for_each_entry_safe(ent, iter, &tq->q, q_node) {
  560. list_del(&ent->q_node);
  561. free(ent);
  562. }
  563. mutex_unlock(&tq->mutex);
  564. }
  565. void thr_info_cancel(struct thr_info *thr)
  566. {
  567. if (!thr)
  568. return;
  569. if (PTH(thr) != 0L) {
  570. pthread_cancel(thr->pth);
  571. PTH(thr) = 0L;
  572. }
  573. }