util.c 16 KB

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