util.c 74 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029
  1. /*
  2. * Copyright 2011-2013 Con Kolivas
  3. * Copyright 2011-2013 Luke Dashjr
  4. * Copyright 2010 Jeff Garzik
  5. * Copyright 2012 Giel van Schijndel
  6. * Copyright 2012 Gavin Andresen
  7. *
  8. * This program is free software; you can redistribute it and/or modify it
  9. * under the terms of the GNU General Public License as published by the Free
  10. * Software Foundation; either version 3 of the License, or (at your option)
  11. * any later version. See COPYING for more details.
  12. */
  13. #include "config.h"
  14. #include <stdarg.h>
  15. #include <stdio.h>
  16. #include <stdlib.h>
  17. #include <ctype.h>
  18. #include <string.h>
  19. #include <pthread.h>
  20. #include <jansson.h>
  21. #include <curl/curl.h>
  22. #include <time.h>
  23. #include <errno.h>
  24. #include <unistd.h>
  25. #include <sys/types.h>
  26. #ifdef HAVE_SYS_PRCTL_H
  27. # include <sys/prctl.h>
  28. #endif
  29. #if defined(__FreeBSD__) || defined(__OpenBSD__)
  30. # include <pthread_np.h>
  31. #endif
  32. #ifndef WIN32
  33. #include <fcntl.h>
  34. # ifdef __linux
  35. # include <sys/prctl.h>
  36. # endif
  37. # include <sys/socket.h>
  38. # include <netinet/in.h>
  39. # include <netinet/tcp.h>
  40. # include <netdb.h>
  41. #else
  42. # include <windows.h>
  43. # include <winsock2.h>
  44. # include <mstcpip.h>
  45. # include <ws2tcpip.h>
  46. # include <mmsystem.h>
  47. #endif
  48. #include <utlist.h>
  49. #include "miner.h"
  50. #include "compat.h"
  51. #include "util.h"
  52. bool successful_connect = false;
  53. struct timeval nettime;
  54. struct data_buffer {
  55. void *buf;
  56. size_t len;
  57. curl_socket_t *idlemarker;
  58. };
  59. struct upload_buffer {
  60. const void *buf;
  61. size_t len;
  62. };
  63. struct header_info {
  64. char *lp_path;
  65. int rolltime;
  66. char *reason;
  67. char *stratum_url;
  68. bool hadrolltime;
  69. bool canroll;
  70. bool hadexpire;
  71. };
  72. struct tq_ent {
  73. void *data;
  74. struct tq_ent *prev;
  75. struct tq_ent *next;
  76. };
  77. static void databuf_free(struct data_buffer *db)
  78. {
  79. if (!db)
  80. return;
  81. free(db->buf);
  82. #ifdef DEBUG_DATABUF
  83. applog(LOG_DEBUG, "databuf_free(%p)", db->buf);
  84. #endif
  85. memset(db, 0, sizeof(*db));
  86. }
  87. // aka data_buffer_write
  88. static size_t all_data_cb(const void *ptr, size_t size, size_t nmemb,
  89. void *user_data)
  90. {
  91. struct data_buffer *db = user_data;
  92. size_t oldlen, newlen;
  93. oldlen = db->len;
  94. if (unlikely(nmemb == 0 || size == 0 || oldlen >= SIZE_MAX - size))
  95. return 0;
  96. if (unlikely(nmemb > (SIZE_MAX - oldlen) / size))
  97. nmemb = (SIZE_MAX - oldlen) / size;
  98. size_t len = size * nmemb;
  99. void *newmem;
  100. static const unsigned char zero = 0;
  101. if (db->idlemarker) {
  102. const unsigned char *cptr = ptr;
  103. for (size_t i = 0; i < len; ++i)
  104. if (!(isCspace(cptr[i]) || cptr[i] == '{')) {
  105. *db->idlemarker = CURL_SOCKET_BAD;
  106. db->idlemarker = NULL;
  107. break;
  108. }
  109. }
  110. newlen = oldlen + len;
  111. newmem = realloc(db->buf, newlen + 1);
  112. #ifdef DEBUG_DATABUF
  113. applog(LOG_DEBUG, "data_buffer_write realloc(%p, %lu) => %p", db->buf, (long unsigned)(newlen + 1), newmem);
  114. #endif
  115. if (!newmem)
  116. return 0;
  117. db->buf = newmem;
  118. db->len = newlen;
  119. memcpy(db->buf + oldlen, ptr, len);
  120. memcpy(db->buf + newlen, &zero, 1); /* null terminate */
  121. return nmemb;
  122. }
  123. static size_t upload_data_cb(void *ptr, size_t size, size_t nmemb,
  124. void *user_data)
  125. {
  126. struct upload_buffer *ub = user_data;
  127. unsigned int len = size * nmemb;
  128. if (len > ub->len)
  129. len = ub->len;
  130. if (len) {
  131. memcpy(ptr, ub->buf, len);
  132. ub->buf += len;
  133. ub->len -= len;
  134. }
  135. return len;
  136. }
  137. static size_t resp_hdr_cb(void *ptr, size_t size, size_t nmemb, void *user_data)
  138. {
  139. struct header_info *hi = user_data;
  140. size_t remlen, slen, ptrlen = size * nmemb;
  141. char *rem, *val = NULL, *key = NULL;
  142. void *tmp;
  143. val = calloc(1, ptrlen);
  144. key = calloc(1, ptrlen);
  145. if (!key || !val)
  146. goto out;
  147. tmp = memchr(ptr, ':', ptrlen);
  148. if (!tmp || (tmp == ptr)) /* skip empty keys / blanks */
  149. goto out;
  150. slen = tmp - ptr;
  151. if ((slen + 1) == ptrlen) /* skip key w/ no value */
  152. goto out;
  153. memcpy(key, ptr, slen); /* store & nul term key */
  154. key[slen] = 0;
  155. rem = ptr + slen + 1; /* trim value's leading whitespace */
  156. remlen = ptrlen - slen - 1;
  157. while ((remlen > 0) && (isCspace(*rem))) {
  158. remlen--;
  159. rem++;
  160. }
  161. memcpy(val, rem, remlen); /* store value, trim trailing ws */
  162. val[remlen] = 0;
  163. while ((*val) && (isCspace(val[strlen(val) - 1])))
  164. val[strlen(val) - 1] = 0;
  165. if (!*val) /* skip blank value */
  166. goto out;
  167. if (opt_protocol)
  168. applog(LOG_DEBUG, "HTTP hdr(%s): %s", key, val);
  169. if (!strcasecmp("X-Roll-Ntime", key)) {
  170. hi->hadrolltime = true;
  171. if (!strncasecmp("N", val, 1))
  172. applog(LOG_DEBUG, "X-Roll-Ntime: N found");
  173. else {
  174. hi->canroll = true;
  175. /* Check to see if expire= is supported and if not, set
  176. * the rolltime to the default scantime */
  177. if (strlen(val) > 7 && !strncasecmp("expire=", val, 7)) {
  178. sscanf(val + 7, "%d", &hi->rolltime);
  179. hi->hadexpire = true;
  180. } else
  181. hi->rolltime = opt_scantime;
  182. applog(LOG_DEBUG, "X-Roll-Ntime expiry set to %d", hi->rolltime);
  183. }
  184. }
  185. if (!strcasecmp("X-Long-Polling", key)) {
  186. hi->lp_path = val; /* steal memory reference */
  187. val = NULL;
  188. }
  189. if (!strcasecmp("X-Reject-Reason", key)) {
  190. hi->reason = val; /* steal memory reference */
  191. val = NULL;
  192. }
  193. if (!strcasecmp("X-Stratum", key)) {
  194. hi->stratum_url = val;
  195. val = NULL;
  196. }
  197. out:
  198. free(key);
  199. free(val);
  200. return ptrlen;
  201. }
  202. static int keep_sockalive(SOCKETTYPE fd)
  203. {
  204. const int tcp_one = 1;
  205. const int tcp_keepidle = 45;
  206. const int tcp_keepintvl = 30;
  207. int ret = 0;
  208. if (unlikely(setsockopt(fd, SOL_SOCKET, SO_KEEPALIVE, (const char *)&tcp_one, sizeof(tcp_one))))
  209. ret = 1;
  210. #ifndef WIN32
  211. int flags = fcntl(fd, F_GETFL, 0);
  212. fcntl(fd, F_SETFL, O_NONBLOCK | flags);
  213. #else
  214. u_long flags = 1;
  215. ioctlsocket(fd, FIONBIO, &flags);
  216. #endif
  217. if (!opt_delaynet)
  218. #ifndef __linux
  219. if (unlikely(setsockopt(fd, IPPROTO_TCP, TCP_NODELAY, (const void *)&tcp_one, sizeof(tcp_one))))
  220. #else /* __linux */
  221. if (unlikely(setsockopt(fd, SOL_TCP, TCP_NODELAY, (const void *)&tcp_one, sizeof(tcp_one))))
  222. #endif /* __linux */
  223. ret = 1;
  224. #ifdef __linux
  225. if (unlikely(setsockopt(fd, SOL_TCP, TCP_KEEPCNT, &tcp_one, sizeof(tcp_one))))
  226. ret = 1;
  227. if (unlikely(setsockopt(fd, SOL_TCP, TCP_KEEPIDLE, &tcp_keepidle, sizeof(tcp_keepidle))))
  228. ret = 1;
  229. if (unlikely(setsockopt(fd, SOL_TCP, TCP_KEEPINTVL, &tcp_keepintvl, sizeof(tcp_keepintvl))))
  230. ret = 1;
  231. #endif /* __linux */
  232. #ifdef __APPLE_CC__
  233. if (unlikely(setsockopt(fd, IPPROTO_TCP, TCP_KEEPALIVE, &tcp_keepintvl, sizeof(tcp_keepintvl))))
  234. ret = 1;
  235. #endif /* __APPLE_CC__ */
  236. #ifdef WIN32
  237. const int zero = 0;
  238. struct tcp_keepalive vals;
  239. vals.onoff = 1;
  240. vals.keepalivetime = tcp_keepidle * 1000;
  241. vals.keepaliveinterval = tcp_keepintvl * 1000;
  242. DWORD outputBytes;
  243. if (unlikely(WSAIoctl(fd, SIO_KEEPALIVE_VALS, &vals, sizeof(vals), NULL, 0, &outputBytes, NULL, NULL)))
  244. ret = 1;
  245. /* Windows happily submits indefinitely to the send buffer blissfully
  246. * unaware nothing is getting there without gracefully failing unless
  247. * we disable the send buffer */
  248. if (unlikely(setsockopt(fd, SOL_SOCKET, SO_SNDBUF, (const char *)&zero, sizeof(zero))))
  249. ret = 1;
  250. #endif /* WIN32 */
  251. return ret;
  252. }
  253. int json_rpc_call_sockopt_cb(void __maybe_unused *userdata, curl_socket_t fd,
  254. curlsocktype __maybe_unused purpose)
  255. {
  256. return keep_sockalive(fd);
  257. }
  258. static void last_nettime(struct timeval *last)
  259. {
  260. rd_lock(&netacc_lock);
  261. last->tv_sec = nettime.tv_sec;
  262. last->tv_usec = nettime.tv_usec;
  263. rd_unlock(&netacc_lock);
  264. }
  265. static void set_nettime(void)
  266. {
  267. wr_lock(&netacc_lock);
  268. cgtime(&nettime);
  269. wr_unlock(&netacc_lock);
  270. }
  271. static int curl_debug_cb(__maybe_unused CURL *handle, curl_infotype type,
  272. char *data, size_t size,
  273. void *userdata)
  274. {
  275. struct pool *pool = (struct pool *)userdata;
  276. switch(type) {
  277. case CURLINFO_HEADER_IN:
  278. case CURLINFO_DATA_IN:
  279. case CURLINFO_SSL_DATA_IN:
  280. pool->cgminer_pool_stats.bytes_received += size;
  281. total_bytes_rcvd += size;
  282. pool->cgminer_pool_stats.net_bytes_received += size;
  283. break;
  284. case CURLINFO_HEADER_OUT:
  285. case CURLINFO_DATA_OUT:
  286. case CURLINFO_SSL_DATA_OUT:
  287. pool->cgminer_pool_stats.bytes_sent += size;
  288. total_bytes_sent += size;
  289. pool->cgminer_pool_stats.net_bytes_sent += size;
  290. break;
  291. case CURLINFO_TEXT:
  292. {
  293. if (!opt_protocol)
  294. break;
  295. // data is not null-terminated, so we need to copy and terminate it for applog
  296. char datacp[size + 1];
  297. memcpy(datacp, data, size);
  298. while (likely(size) && unlikely(isCspace(datacp[size-1])))
  299. --size;
  300. if (unlikely(!size))
  301. break;
  302. datacp[size] = '\0';
  303. applog(LOG_DEBUG, "Pool %u: %s", pool->pool_no, datacp);
  304. break;
  305. }
  306. default:
  307. break;
  308. }
  309. return 0;
  310. }
  311. struct json_rpc_call_state {
  312. struct data_buffer all_data;
  313. struct header_info hi;
  314. void *priv;
  315. char curl_err_str[CURL_ERROR_SIZE];
  316. struct curl_slist *headers;
  317. struct upload_buffer upload_data;
  318. struct pool *pool;
  319. };
  320. void json_rpc_call_async(CURL *curl, const char *url,
  321. const char *userpass, const char *rpc_req,
  322. bool longpoll,
  323. struct pool *pool, bool share,
  324. void *priv)
  325. {
  326. struct json_rpc_call_state *state = malloc(sizeof(struct json_rpc_call_state));
  327. *state = (struct json_rpc_call_state){
  328. .priv = priv,
  329. .pool = pool,
  330. };
  331. long timeout = longpoll ? (60 * 60) : 60;
  332. char len_hdr[64], user_agent_hdr[128];
  333. struct curl_slist *headers = NULL;
  334. if (longpoll)
  335. state->all_data.idlemarker = &pool->lp_socket;
  336. /* it is assumed that 'curl' is freshly [re]initialized at this pt */
  337. curl_easy_setopt(curl, CURLOPT_PRIVATE, state);
  338. curl_easy_setopt(curl, CURLOPT_TIMEOUT, timeout);
  339. /* We use DEBUGFUNCTION to count bytes sent/received, and verbose is needed
  340. * to enable it */
  341. curl_easy_setopt(curl, CURLOPT_DEBUGFUNCTION, curl_debug_cb);
  342. curl_easy_setopt(curl, CURLOPT_DEBUGDATA, (void *)pool);
  343. curl_easy_setopt(curl, CURLOPT_VERBOSE, 1);
  344. curl_easy_setopt(curl, CURLOPT_NOSIGNAL, 1);
  345. curl_easy_setopt(curl, CURLOPT_URL, url);
  346. curl_easy_setopt(curl, CURLOPT_ENCODING, "");
  347. curl_easy_setopt(curl, CURLOPT_FAILONERROR, 1);
  348. /* Shares are staggered already and delays in submission can be costly
  349. * so do not delay them */
  350. if (!opt_delaynet || share)
  351. curl_easy_setopt(curl, CURLOPT_TCP_NODELAY, 1);
  352. curl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, all_data_cb);
  353. curl_easy_setopt(curl, CURLOPT_WRITEDATA, &state->all_data);
  354. curl_easy_setopt(curl, CURLOPT_READFUNCTION, upload_data_cb);
  355. curl_easy_setopt(curl, CURLOPT_READDATA, &state->upload_data);
  356. curl_easy_setopt(curl, CURLOPT_ERRORBUFFER, &state->curl_err_str[0]);
  357. curl_easy_setopt(curl, CURLOPT_FOLLOWLOCATION, 1);
  358. curl_easy_setopt(curl, CURLOPT_HEADERFUNCTION, resp_hdr_cb);
  359. curl_easy_setopt(curl, CURLOPT_HEADERDATA, &state->hi);
  360. curl_easy_setopt(curl, CURLOPT_USE_SSL, CURLUSESSL_TRY);
  361. if (pool->rpc_proxy) {
  362. curl_easy_setopt(curl, CURLOPT_PROXY, pool->rpc_proxy);
  363. } else if (opt_socks_proxy) {
  364. curl_easy_setopt(curl, CURLOPT_PROXY, opt_socks_proxy);
  365. curl_easy_setopt(curl, CURLOPT_PROXYTYPE, CURLPROXY_SOCKS4);
  366. }
  367. if (userpass) {
  368. curl_easy_setopt(curl, CURLOPT_USERPWD, userpass);
  369. curl_easy_setopt(curl, CURLOPT_HTTPAUTH, CURLAUTH_BASIC);
  370. }
  371. if (longpoll)
  372. curl_easy_setopt(curl, CURLOPT_SOCKOPTFUNCTION, json_rpc_call_sockopt_cb);
  373. curl_easy_setopt(curl, CURLOPT_POST, 1);
  374. if (opt_protocol)
  375. applog(LOG_DEBUG, "JSON protocol request:\n%s", rpc_req);
  376. state->upload_data.buf = rpc_req;
  377. state->upload_data.len = strlen(rpc_req);
  378. sprintf(len_hdr, "Content-Length: %lu",
  379. (unsigned long) state->upload_data.len);
  380. sprintf(user_agent_hdr, "User-Agent: %s", PACKAGE"/"VERSION);
  381. headers = curl_slist_append(headers,
  382. "Content-type: application/json");
  383. headers = curl_slist_append(headers,
  384. "X-Mining-Extensions: longpoll midstate rollntime submitold");
  385. if (longpoll)
  386. headers = curl_slist_append(headers,
  387. "X-Minimum-Wait: 0");
  388. if (likely(global_hashrate)) {
  389. char ghashrate[255];
  390. sprintf(ghashrate, "X-Mining-Hashrate: %"PRIu64, (uint64_t)global_hashrate);
  391. headers = curl_slist_append(headers, ghashrate);
  392. }
  393. headers = curl_slist_append(headers, len_hdr);
  394. headers = curl_slist_append(headers, user_agent_hdr);
  395. headers = curl_slist_append(headers, "Expect:"); /* disable Expect hdr*/
  396. curl_easy_setopt(curl, CURLOPT_HTTPHEADER, headers);
  397. state->headers = headers;
  398. if (opt_delaynet) {
  399. /* Don't delay share submission, but still track the nettime */
  400. if (!share) {
  401. long long now_msecs, last_msecs;
  402. struct timeval now, last;
  403. cgtime(&now);
  404. last_nettime(&last);
  405. now_msecs = (long long)now.tv_sec * 1000;
  406. now_msecs += now.tv_usec / 1000;
  407. last_msecs = (long long)last.tv_sec * 1000;
  408. last_msecs += last.tv_usec / 1000;
  409. if (now_msecs > last_msecs && now_msecs - last_msecs < 250) {
  410. struct timespec rgtp;
  411. rgtp.tv_sec = 0;
  412. rgtp.tv_nsec = (250 - (now_msecs - last_msecs)) * 1000000;
  413. nanosleep(&rgtp, NULL);
  414. }
  415. }
  416. set_nettime();
  417. }
  418. }
  419. json_t *json_rpc_call_completed(CURL *curl, int rc, bool probe, int *rolltime, void *out_priv)
  420. {
  421. struct json_rpc_call_state *state;
  422. if (curl_easy_getinfo(curl, CURLINFO_PRIVATE, &state) != CURLE_OK) {
  423. applog(LOG_ERR, "Failed to get private curl data");
  424. if (out_priv)
  425. *(void**)out_priv = NULL;
  426. goto err_out;
  427. }
  428. if (out_priv)
  429. *(void**)out_priv = state->priv;
  430. json_t *val, *err_val, *res_val;
  431. json_error_t err;
  432. struct pool *pool = state->pool;
  433. bool probing = probe && !pool->probed;
  434. if (rc) {
  435. applog(LOG_INFO, "HTTP request failed: %s", state->curl_err_str);
  436. goto err_out;
  437. }
  438. if (!state->all_data.buf) {
  439. applog(LOG_DEBUG, "Empty data received in json_rpc_call.");
  440. goto err_out;
  441. }
  442. pool->cgminer_pool_stats.times_sent++;
  443. pool->cgminer_pool_stats.times_received++;
  444. if (probing) {
  445. pool->probed = true;
  446. /* If X-Long-Polling was found, activate long polling */
  447. if (state->hi.lp_path) {
  448. if (pool->hdr_path != NULL)
  449. free(pool->hdr_path);
  450. pool->hdr_path = state->hi.lp_path;
  451. } else
  452. pool->hdr_path = NULL;
  453. if (state->hi.stratum_url) {
  454. pool->stratum_url = state->hi.stratum_url;
  455. state->hi.stratum_url = NULL;
  456. }
  457. } else {
  458. if (state->hi.lp_path) {
  459. free(state->hi.lp_path);
  460. state->hi.lp_path = NULL;
  461. }
  462. if (state->hi.stratum_url) {
  463. free(state->hi.stratum_url);
  464. state->hi.stratum_url = NULL;
  465. }
  466. }
  467. if (pool->force_rollntime)
  468. {
  469. state->hi.canroll = true;
  470. state->hi.hadexpire = true;
  471. state->hi.rolltime = pool->force_rollntime;
  472. }
  473. if (rolltime)
  474. *rolltime = state->hi.rolltime;
  475. pool->cgminer_pool_stats.rolltime = state->hi.rolltime;
  476. pool->cgminer_pool_stats.hadrolltime = state->hi.hadrolltime;
  477. pool->cgminer_pool_stats.canroll = state->hi.canroll;
  478. pool->cgminer_pool_stats.hadexpire = state->hi.hadexpire;
  479. val = JSON_LOADS(state->all_data.buf, &err);
  480. if (!val) {
  481. applog(LOG_INFO, "JSON decode failed(%d): %s", err.line, err.text);
  482. if (opt_protocol)
  483. applog(LOG_DEBUG, "JSON protocol response:\n%s", (char*)state->all_data.buf);
  484. goto err_out;
  485. }
  486. if (opt_protocol) {
  487. char *s = json_dumps(val, JSON_INDENT(3));
  488. applog(LOG_DEBUG, "JSON protocol response:\n%s", s);
  489. free(s);
  490. }
  491. /* JSON-RPC valid response returns a non-null 'result',
  492. * and a null 'error'.
  493. */
  494. res_val = json_object_get(val, "result");
  495. err_val = json_object_get(val, "error");
  496. if (!res_val ||(err_val && !json_is_null(err_val))) {
  497. char *s;
  498. if (err_val)
  499. s = json_dumps(err_val, JSON_INDENT(3));
  500. else
  501. s = strdup("(unknown reason)");
  502. applog(LOG_INFO, "JSON-RPC call failed: %s", s);
  503. free(s);
  504. json_decref(val);
  505. goto err_out;
  506. }
  507. if (state->hi.reason) {
  508. json_object_set_new(val, "reject-reason", json_string(state->hi.reason));
  509. free(state->hi.reason);
  510. state->hi.reason = NULL;
  511. }
  512. successful_connect = true;
  513. databuf_free(&state->all_data);
  514. curl_slist_free_all(state->headers);
  515. curl_easy_reset(curl);
  516. free(state);
  517. return val;
  518. err_out:
  519. databuf_free(&state->all_data);
  520. curl_slist_free_all(state->headers);
  521. curl_easy_reset(curl);
  522. if (!successful_connect)
  523. applog(LOG_DEBUG, "Failed to connect in json_rpc_call");
  524. curl_easy_setopt(curl, CURLOPT_FRESH_CONNECT, 1);
  525. free(state);
  526. return NULL;
  527. }
  528. json_t *json_rpc_call(CURL *curl, const char *url,
  529. const char *userpass, const char *rpc_req,
  530. bool probe, bool longpoll, int *rolltime,
  531. struct pool *pool, bool share)
  532. {
  533. json_rpc_call_async(curl, url, userpass, rpc_req, longpoll, pool, share, NULL);
  534. int rc = curl_easy_perform(curl);
  535. return json_rpc_call_completed(curl, rc, probe, rolltime, NULL);
  536. }
  537. bool our_curl_supports_proxy_uris()
  538. {
  539. curl_version_info_data *data = curl_version_info(CURLVERSION_NOW);
  540. return data->age && data->version_num >= (( 7 <<16)|( 21 <<8)| 7); // 7.21.7
  541. }
  542. // NOTE: This assumes reference URI is a root
  543. char *absolute_uri(char *uri, const char *ref)
  544. {
  545. if (strstr(uri, "://"))
  546. return strdup(uri);
  547. char *copy_start, *abs;
  548. bool need_slash = false;
  549. copy_start = (uri[0] == '/') ? &uri[1] : uri;
  550. if (ref[strlen(ref) - 1] != '/')
  551. need_slash = true;
  552. abs = malloc(strlen(ref) + strlen(copy_start) + 2);
  553. if (!abs) {
  554. applog(LOG_ERR, "Malloc failure in absolute_uri");
  555. return NULL;
  556. }
  557. sprintf(abs, "%s%s%s", ref, need_slash ? "/" : "", copy_start);
  558. return abs;
  559. }
  560. static const char _hexchars[0x10] = "0123456789abcdef";
  561. void bin2hex(char *out, const void *in, size_t len)
  562. {
  563. const unsigned char *p = in;
  564. while (len--)
  565. {
  566. (out++)[0] = _hexchars[p[0] >> 4];
  567. (out++)[0] = _hexchars[p[0] & 0xf];
  568. ++p;
  569. }
  570. out[0] = '\0';
  571. }
  572. static inline
  573. int _hex2bin_char(const char c)
  574. {
  575. if (c >= '0' && c <= '9')
  576. return c - '0';
  577. if (c >= 'a' && c <= 'f')
  578. return (c - 'a') + 10;
  579. if (c >= 'A' && c <= 'F')
  580. return (c - 'A') + 10;
  581. return -1;
  582. }
  583. /* Does the reverse of bin2hex but does not allocate any ram */
  584. bool hex2bin(unsigned char *p, const char *hexstr, size_t len)
  585. {
  586. int n, o;
  587. while (len--)
  588. {
  589. n = _hex2bin_char((hexstr++)[0]);
  590. if (unlikely(n == -1))
  591. {
  592. badchar:
  593. if (!hexstr[-1])
  594. applog(LOG_ERR, "hex2bin: str truncated");
  595. else
  596. applog(LOG_ERR, "hex2bin: invalid character 0x%02x", (int)hexstr[-1]);
  597. return false;
  598. }
  599. o = _hex2bin_char((hexstr++)[0]);
  600. if (unlikely(o == -1))
  601. goto badchar;
  602. (p++)[0] = (n << 4) | o;
  603. }
  604. return likely(!hexstr[0]);
  605. }
  606. void hash_data(unsigned char *out_hash, const unsigned char *data)
  607. {
  608. unsigned char blkheader[80];
  609. // data is past the first SHA256 step (padding and interpreting as big endian on a little endian platform), so we need to flip each 32-bit chunk around to get the original input block header
  610. swap32yes(blkheader, data, 80 / 4);
  611. // double-SHA256 to get the block hash
  612. gen_hash(blkheader, out_hash, 80);
  613. }
  614. // Example output: 0000000000000000000000000000000000000000000000000000ffff00000000 (bdiff 1)
  615. void real_block_target(unsigned char *target, const unsigned char *data)
  616. {
  617. uint8_t targetshift;
  618. if (unlikely(data[72] < 3 || data[72] > 0x20))
  619. {
  620. // Invalid (out of bounds) target
  621. memset(target, 0xff, 32);
  622. return;
  623. }
  624. targetshift = data[72] - 3;
  625. memset(target, 0, targetshift);
  626. target[targetshift++] = data[75];
  627. target[targetshift++] = data[74];
  628. target[targetshift++] = data[73];
  629. memset(&target[targetshift], 0, 0x20 - targetshift);
  630. }
  631. bool hash_target_check(const unsigned char *hash, const unsigned char *target)
  632. {
  633. const uint32_t *h32 = (uint32_t*)&hash[0];
  634. const uint32_t *t32 = (uint32_t*)&target[0];
  635. for (int i = 7; i >= 0; --i) {
  636. uint32_t h32i = le32toh(h32[i]);
  637. uint32_t t32i = le32toh(t32[i]);
  638. if (h32i > t32i)
  639. return false;
  640. if (h32i < t32i)
  641. return true;
  642. }
  643. return true;
  644. }
  645. bool hash_target_check_v(const unsigned char *hash, const unsigned char *target)
  646. {
  647. bool rc;
  648. rc = hash_target_check(hash, target);
  649. if (opt_debug) {
  650. unsigned char hash_swap[32], target_swap[32];
  651. char hash_str[65];
  652. char target_str[65];
  653. for (int i = 0; i < 32; ++i) {
  654. hash_swap[i] = hash[31-i];
  655. target_swap[i] = target[31-i];
  656. }
  657. bin2hex(hash_str, hash_swap, 32);
  658. bin2hex(target_str, target_swap, 32);
  659. applog(LOG_DEBUG, " Proof: %s\nTarget: %s\nTrgVal? %s",
  660. hash_str,
  661. target_str,
  662. rc ? "YES (hash <= target)" :
  663. "no (false positive; hash > target)");
  664. }
  665. return rc;
  666. }
  667. // This operates on a native-endian SHA256 state
  668. // In other words, on little endian platforms, every 4 bytes are in reverse order
  669. bool fulltest(const unsigned char *hash, const unsigned char *target)
  670. {
  671. unsigned char hash2[32];
  672. swap32tobe(hash2, hash, 32 / 4);
  673. return hash_target_check_v(hash2, target);
  674. }
  675. struct thread_q *tq_new(void)
  676. {
  677. struct thread_q *tq;
  678. tq = calloc(1, sizeof(*tq));
  679. if (!tq)
  680. return NULL;
  681. pthread_mutex_init(&tq->mutex, NULL);
  682. pthread_cond_init(&tq->cond, NULL);
  683. return tq;
  684. }
  685. void tq_free(struct thread_q *tq)
  686. {
  687. struct tq_ent *ent, *iter;
  688. if (!tq)
  689. return;
  690. DL_FOREACH_SAFE(tq->q, ent, iter) {
  691. DL_DELETE(tq->q, ent);
  692. free(ent);
  693. }
  694. pthread_cond_destroy(&tq->cond);
  695. pthread_mutex_destroy(&tq->mutex);
  696. memset(tq, 0, sizeof(*tq)); /* poison */
  697. free(tq);
  698. }
  699. static void tq_freezethaw(struct thread_q *tq, bool frozen)
  700. {
  701. mutex_lock(&tq->mutex);
  702. tq->frozen = frozen;
  703. pthread_cond_signal(&tq->cond);
  704. mutex_unlock(&tq->mutex);
  705. }
  706. void tq_freeze(struct thread_q *tq)
  707. {
  708. tq_freezethaw(tq, true);
  709. }
  710. void tq_thaw(struct thread_q *tq)
  711. {
  712. tq_freezethaw(tq, false);
  713. }
  714. bool tq_push(struct thread_q *tq, void *data)
  715. {
  716. struct tq_ent *ent;
  717. bool rc = true;
  718. ent = calloc(1, sizeof(*ent));
  719. if (!ent)
  720. return false;
  721. ent->data = data;
  722. mutex_lock(&tq->mutex);
  723. if (!tq->frozen) {
  724. DL_APPEND(tq->q, ent);
  725. } else {
  726. free(ent);
  727. rc = false;
  728. }
  729. pthread_cond_signal(&tq->cond);
  730. mutex_unlock(&tq->mutex);
  731. return rc;
  732. }
  733. void *tq_pop(struct thread_q *tq, const struct timespec *abstime)
  734. {
  735. struct tq_ent *ent;
  736. void *rval = NULL;
  737. int rc;
  738. mutex_lock(&tq->mutex);
  739. if (tq->q)
  740. goto pop;
  741. if (abstime)
  742. rc = pthread_cond_timedwait(&tq->cond, &tq->mutex, abstime);
  743. else
  744. rc = pthread_cond_wait(&tq->cond, &tq->mutex);
  745. if (rc)
  746. goto out;
  747. if (!tq->q)
  748. goto out;
  749. pop:
  750. ent = tq->q;
  751. rval = ent->data;
  752. DL_DELETE(tq->q, ent);
  753. free(ent);
  754. out:
  755. mutex_unlock(&tq->mutex);
  756. return rval;
  757. }
  758. int thr_info_create(struct thr_info *thr, pthread_attr_t *attr, void *(*start) (void *), void *arg)
  759. {
  760. int rv = pthread_create(&thr->pth, attr, start, arg);
  761. if (likely(!rv))
  762. thr->has_pth = true;
  763. return rv;
  764. }
  765. void thr_info_freeze(struct thr_info *thr)
  766. {
  767. struct tq_ent *ent, *iter;
  768. struct thread_q *tq;
  769. if (!thr)
  770. return;
  771. tq = thr->q;
  772. if (!tq)
  773. return;
  774. mutex_lock(&tq->mutex);
  775. tq->frozen = true;
  776. DL_FOREACH_SAFE(tq->q, ent, iter) {
  777. DL_DELETE(tq->q, ent);
  778. free(ent);
  779. }
  780. mutex_unlock(&tq->mutex);
  781. }
  782. void thr_info_cancel(struct thr_info *thr)
  783. {
  784. if (!thr)
  785. return;
  786. if (thr->has_pth) {
  787. pthread_cancel(thr->pth);
  788. thr->has_pth = false;
  789. }
  790. }
  791. #ifndef HAVE_PTHREAD_CANCEL
  792. // Bionic (Android) is intentionally missing pthread_cancel, so it is implemented using pthread_kill
  793. enum pthread_cancel_workaround_mode {
  794. PCWM_DEFAULT = 0,
  795. PCWM_TERMINATE = 1,
  796. PCWM_ASYNC = 2,
  797. PCWM_DISABLED = 4,
  798. PCWM_CANCELLED = 8,
  799. };
  800. static pthread_key_t key_pcwm;
  801. struct sigaction pcwm_orig_term_handler;
  802. static
  803. void do_pthread_cancel_exit(int flags)
  804. {
  805. if (!(flags & PCWM_ASYNC))
  806. // NOTE: Logging disables cancel while mutex held, so this is safe
  807. applog(LOG_WARNING, "pthread_cancel workaround: Cannot defer cancellation, terminating thread NOW");
  808. pthread_exit(PTHREAD_CANCELED);
  809. }
  810. static
  811. void sighandler_pthread_cancel(int sig)
  812. {
  813. int flags = (int)pthread_getspecific(key_pcwm);
  814. if (flags & PCWM_TERMINATE) // Main thread
  815. {
  816. // Restore original handler and call it
  817. if (sigaction(sig, &pcwm_orig_term_handler, NULL))
  818. quit(1, "pthread_cancel workaround: Failed to restore original handler");
  819. raise(SIGTERM);
  820. quit(1, "pthread_cancel workaround: Original handler returned");
  821. }
  822. if (flags & PCWM_CANCELLED) // Already pending cancel
  823. return;
  824. if (flags & PCWM_DISABLED)
  825. {
  826. flags |= PCWM_CANCELLED;
  827. if (pthread_setspecific(key_pcwm, (void*)flags))
  828. quit(1, "pthread_cancel workaround: pthread_setspecific failed (setting PCWM_CANCELLED)");
  829. return;
  830. }
  831. do_pthread_cancel_exit(flags);
  832. }
  833. void pthread_testcancel(void)
  834. {
  835. int flags = (int)pthread_getspecific(key_pcwm);
  836. if (flags & PCWM_CANCELLED && !(flags & PCWM_DISABLED))
  837. do_pthread_cancel_exit(flags);
  838. }
  839. int pthread_setcancelstate(int state, int *oldstate)
  840. {
  841. int flags = (int)pthread_getspecific(key_pcwm);
  842. if (oldstate)
  843. *oldstate = (flags & PCWM_DISABLED) ? PTHREAD_CANCEL_DISABLE : PTHREAD_CANCEL_ENABLE;
  844. if (state == PTHREAD_CANCEL_DISABLE)
  845. flags |= PCWM_DISABLED;
  846. else
  847. {
  848. if (flags & PCWM_CANCELLED)
  849. do_pthread_cancel_exit(flags);
  850. flags &= ~PCWM_DISABLED;
  851. }
  852. if (pthread_setspecific(key_pcwm, (void*)flags))
  853. return -1;
  854. return 0;
  855. }
  856. int pthread_setcanceltype(int type, int *oldtype)
  857. {
  858. int flags = (int)pthread_getspecific(key_pcwm);
  859. if (oldtype)
  860. *oldtype = (flags & PCWM_ASYNC) ? PTHREAD_CANCEL_ASYNCHRONOUS : PTHREAD_CANCEL_DEFERRED;
  861. if (type == PTHREAD_CANCEL_ASYNCHRONOUS)
  862. flags |= PCWM_ASYNC;
  863. else
  864. flags &= ~PCWM_ASYNC;
  865. if (pthread_setspecific(key_pcwm, (void*)flags))
  866. return -1;
  867. return 0;
  868. }
  869. void setup_pthread_cancel_workaround()
  870. {
  871. if (pthread_key_create(&key_pcwm, NULL))
  872. quit(1, "pthread_cancel workaround: pthread_key_create failed");
  873. if (pthread_setspecific(key_pcwm, (void*)PCWM_TERMINATE))
  874. quit(1, "pthread_cancel workaround: pthread_setspecific failed");
  875. struct sigaction new_sigact = {
  876. .sa_handler = sighandler_pthread_cancel,
  877. };
  878. if (sigaction(SIGTERM, &new_sigact, &pcwm_orig_term_handler))
  879. quit(1, "pthread_cancel workaround: Failed to install SIGTERM handler");
  880. }
  881. #endif
  882. /* Provide a ms based sleep that uses nanosleep to avoid poor usleep accuracy
  883. * on SMP machines */
  884. void nmsleep(unsigned int msecs)
  885. {
  886. struct timespec twait, tleft;
  887. int ret;
  888. ldiv_t d;
  889. #ifdef WIN32
  890. timeBeginPeriod(1);
  891. #endif
  892. d = ldiv(msecs, 1000);
  893. tleft.tv_sec = d.quot;
  894. tleft.tv_nsec = d.rem * 1000000;
  895. do {
  896. twait.tv_sec = tleft.tv_sec;
  897. twait.tv_nsec = tleft.tv_nsec;
  898. ret = nanosleep(&twait, &tleft);
  899. } while (ret == -1 && errno == EINTR);
  900. #ifdef WIN32
  901. timeEndPeriod(1);
  902. #endif
  903. }
  904. /* Same for usecs */
  905. void nusleep(unsigned int usecs)
  906. {
  907. struct timespec twait, tleft;
  908. int ret;
  909. ldiv_t d;
  910. #ifdef WIN32
  911. timeBeginPeriod(1);
  912. #endif
  913. d = ldiv(usecs, 1000000);
  914. tleft.tv_sec = d.quot;
  915. tleft.tv_nsec = d.rem * 1000;
  916. do {
  917. twait.tv_sec = tleft.tv_sec;
  918. twait.tv_nsec = tleft.tv_nsec;
  919. ret = nanosleep(&twait, &tleft);
  920. } while (ret == -1 && errno == EINTR);
  921. #ifdef WIN32
  922. timeEndPeriod(1);
  923. #endif
  924. }
  925. static
  926. void _now_gettimeofday(struct timeval *tv)
  927. {
  928. #ifdef WIN32
  929. // Windows' default resolution is only 15ms. This requests 1ms.
  930. timeBeginPeriod(1);
  931. #endif
  932. gettimeofday(tv, NULL);
  933. #ifdef WIN32
  934. timeEndPeriod(1);
  935. #endif
  936. }
  937. #ifdef HAVE_POOR_GETTIMEOFDAY
  938. static struct timeval tv_timeofday_offset;
  939. static struct timeval _tv_timeofday_lastchecked;
  940. static pthread_mutex_t _tv_timeofday_mutex = PTHREAD_MUTEX_INITIALIZER;
  941. static
  942. void bfg_calibrate_timeofday(struct timeval *expected, char *buf)
  943. {
  944. struct timeval actual, delta;
  945. timeradd(expected, &tv_timeofday_offset, expected);
  946. _now_gettimeofday(&actual);
  947. if (expected->tv_sec >= actual.tv_sec - 1 && expected->tv_sec <= actual.tv_sec + 1)
  948. // Within reason - no change necessary
  949. return;
  950. timersub(&actual, expected, &delta);
  951. timeradd(&tv_timeofday_offset, &delta, &tv_timeofday_offset);
  952. sprintf(buf, "Recalibrating timeofday offset (delta %ld.%06lds)", (long)delta.tv_sec, (long)delta.tv_usec);
  953. *expected = actual;
  954. }
  955. void bfg_gettimeofday(struct timeval *out)
  956. {
  957. char buf[64] = "";
  958. timer_set_now(out);
  959. mutex_lock(&_tv_timeofday_mutex);
  960. if (_tv_timeofday_lastchecked.tv_sec < out->tv_sec - 21)
  961. bfg_calibrate_timeofday(out, buf);
  962. else
  963. timeradd(out, &tv_timeofday_offset, out);
  964. mutex_unlock(&_tv_timeofday_mutex);
  965. if (unlikely(buf[0]))
  966. applog(LOG_WARNING, "%s", buf);
  967. }
  968. #endif
  969. #ifdef WIN32
  970. static LARGE_INTEGER _perffreq;
  971. static
  972. void _now_queryperformancecounter(struct timeval *tv)
  973. {
  974. LARGE_INTEGER now;
  975. if (unlikely(!QueryPerformanceCounter(&now)))
  976. quit(1, "QueryPerformanceCounter failed");
  977. *tv = (struct timeval){
  978. .tv_sec = now.QuadPart / _perffreq.QuadPart,
  979. .tv_usec = (now.QuadPart % _perffreq.QuadPart) * 1000000 / _perffreq.QuadPart,
  980. };
  981. }
  982. #endif
  983. static
  984. void _now_is_not_set(__maybe_unused struct timeval *tv)
  985. {
  986. // Might be unclean to swap algorithms after getting a timer
  987. quit(1, "timer_set_now called before bfg_init_time");
  988. }
  989. void (*timer_set_now)(struct timeval *tv) = _now_is_not_set;
  990. #ifdef HAVE_CLOCK_GETTIME_MONOTONIC
  991. static clockid_t bfg_timer_clk;
  992. static
  993. void _now_clock_gettime(struct timeval *tv)
  994. {
  995. struct timespec ts;
  996. if (unlikely(clock_gettime(bfg_timer_clk, &ts)))
  997. quit(1, "clock_gettime failed");
  998. *tv = (struct timeval){
  999. .tv_sec = ts.tv_sec,
  1000. .tv_usec = ts.tv_nsec / 1000,
  1001. };
  1002. }
  1003. static
  1004. bool _bfg_try_clock_gettime(clockid_t clk)
  1005. {
  1006. struct timespec ts;
  1007. if (clock_gettime(clk, &ts))
  1008. return false;
  1009. bfg_timer_clk = clk;
  1010. timer_set_now = _now_clock_gettime;
  1011. return true;
  1012. }
  1013. #endif
  1014. void bfg_init_time()
  1015. {
  1016. if (timer_set_now != _now_is_not_set)
  1017. return;
  1018. #ifdef HAVE_CLOCK_GETTIME_MONOTONIC
  1019. #ifdef HAVE_CLOCK_GETTIME_MONOTONIC_RAW
  1020. if (_bfg_try_clock_gettime(CLOCK_MONOTONIC_RAW))
  1021. applog(LOG_DEBUG, "Timers: Using clock_gettime(CLOCK_MONOTONIC_RAW)");
  1022. else
  1023. #endif
  1024. if (_bfg_try_clock_gettime(CLOCK_MONOTONIC))
  1025. applog(LOG_DEBUG, "Timers: Using clock_gettime(CLOCK_MONOTONIC)");
  1026. else
  1027. #endif
  1028. #ifdef WIN32
  1029. if (QueryPerformanceFrequency(&_perffreq) && _perffreq.QuadPart)
  1030. {
  1031. timer_set_now = _now_queryperformancecounter;
  1032. applog(LOG_DEBUG, "Timers: Using QueryPerformanceCounter");
  1033. }
  1034. else
  1035. #endif
  1036. {
  1037. timer_set_now = _now_gettimeofday;
  1038. applog(LOG_DEBUG, "Timers: Using gettimeofday");
  1039. }
  1040. #ifdef HAVE_POOR_GETTIMEOFDAY
  1041. char buf[64] = "";
  1042. struct timeval tv;
  1043. timer_set_now(&tv);
  1044. bfg_calibrate_timeofday(&tv, buf);
  1045. applog(LOG_DEBUG, "%s", buf);
  1046. #endif
  1047. }
  1048. // NOTE: Only supports (BTF_BRACKETS | BTF_DATE | BTF_TIME) for now
  1049. int format_elapsed2(char * const buf, size_t sz, const int fmt, int elapsed)
  1050. {
  1051. unsigned int days, hours;
  1052. div_t d;
  1053. d = div(elapsed, 86400);
  1054. days = d.quot;
  1055. d = div(d.rem, 3600);
  1056. hours = d.quot;
  1057. d = div(d.rem, 60);
  1058. return
  1059. snprintf(buf, sz, "[%3u day%c %02d:%02d:%02d]"
  1060. , days
  1061. , (days == 1) ? ' ' : 's'
  1062. , hours
  1063. , d.quot
  1064. , d.rem
  1065. );
  1066. }
  1067. int format_tm2(char * const buf, size_t sz, const int fmt, const struct tm * const tm, const long usecs)
  1068. {
  1069. char *s = buf;
  1070. int rv = 0;
  1071. if (fmt & BTF_BRACKETS)
  1072. _SNP("[");
  1073. if (fmt & BTF_DATE)
  1074. _SNP("%d-%02d-%02d%s",
  1075. tm->tm_year + 1900,
  1076. tm->tm_mon + 1,
  1077. tm->tm_mday,
  1078. (fmt & 3 /* any time */) ? " " : "");
  1079. if (fmt & 3 /* any time */)
  1080. {
  1081. _SNP("%02d:%02d",
  1082. tm->tm_hour,
  1083. tm->tm_min);
  1084. if (fmt & 1 /* with seconds */)
  1085. {
  1086. _SNP(":%02d", tm->tm_sec);
  1087. if ((fmt & BTF_HRTIME) == BTF_HRTIME)
  1088. _SNP(".%06ld", usecs);
  1089. }
  1090. }
  1091. if (fmt & BTF_BRACKETS)
  1092. _SNP("]");
  1093. return rv;
  1094. }
  1095. int format_timestamp2(char * const buf, size_t sz, const int fmt, const struct timeval * const tv)
  1096. {
  1097. struct tm tm;
  1098. time_t tt = tv->tv_sec;
  1099. localtime_r(&tt, &tm);
  1100. return format_tm2(buf, sz, fmt, &tm, tv->tv_usec);
  1101. }
  1102. void subtime(struct timeval *a, struct timeval *b)
  1103. {
  1104. timersub(a, b, b);
  1105. }
  1106. void addtime(struct timeval *a, struct timeval *b)
  1107. {
  1108. timeradd(a, b, b);
  1109. }
  1110. bool time_more(struct timeval *a, struct timeval *b)
  1111. {
  1112. return timercmp(a, b, >);
  1113. }
  1114. bool time_less(struct timeval *a, struct timeval *b)
  1115. {
  1116. return timercmp(a, b, <);
  1117. }
  1118. void copy_time(struct timeval *dest, const struct timeval *src)
  1119. {
  1120. memcpy(dest, src, sizeof(struct timeval));
  1121. }
  1122. /* Returns the microseconds difference between end and start times as a double */
  1123. double us_tdiff(struct timeval *end, struct timeval *start)
  1124. {
  1125. return end->tv_sec * 1000000 + end->tv_usec - start->tv_sec * 1000000 - start->tv_usec;
  1126. }
  1127. /* Returns the seconds difference between end and start times as a double */
  1128. double tdiff(struct timeval *end, struct timeval *start)
  1129. {
  1130. return end->tv_sec - start->tv_sec + (end->tv_usec - start->tv_usec) / 1000000.0;
  1131. }
  1132. int32_t utf8_decode(const void *b, int *out_len)
  1133. {
  1134. int32_t w;
  1135. const unsigned char *s = b;
  1136. if (!(s[0] & 0x80))
  1137. {
  1138. // ASCII
  1139. *out_len = 1;
  1140. return s[0];
  1141. }
  1142. #ifdef STRICT_UTF8
  1143. if (unlikely(!(s[0] & 0x40)))
  1144. goto invalid;
  1145. #endif
  1146. if (!(s[0] & 0x20))
  1147. *out_len = 2;
  1148. else
  1149. if (!(s[0] & 0x10))
  1150. *out_len = 3;
  1151. else
  1152. if (likely(!(s[0] & 8)))
  1153. *out_len = 4;
  1154. else
  1155. goto invalid;
  1156. w = s[0] & ((2 << (6 - *out_len)) - 1);
  1157. for (int i = 1; i < *out_len; ++i)
  1158. {
  1159. #ifdef STRICT_UTF8
  1160. if (unlikely((s[i] & 0xc0) != 0x80))
  1161. goto invalid;
  1162. #endif
  1163. w = (w << 6) | (s[i] & 0x3f);
  1164. }
  1165. #if defined(STRICT_UTF8)
  1166. if (unlikely(w > 0x10FFFF))
  1167. goto invalid;
  1168. // FIXME: UTF-8 requires smallest possible encoding; check it
  1169. #endif
  1170. return w;
  1171. invalid:
  1172. *out_len = 1;
  1173. return REPLACEMENT_CHAR;
  1174. }
  1175. static
  1176. void _utf8_test(const char *s, const wchar_t expected, int expectedlen)
  1177. {
  1178. int len;
  1179. wchar_t r;
  1180. r = utf8_decode(s, &len);
  1181. if (unlikely(r != expected || expectedlen != len))
  1182. applog(LOG_ERR, "UTF-8 test U+%06lX (len %d) failed: got U+%06lX (len %d)", (unsigned long)expected, expectedlen, (unsigned long)r, len);
  1183. }
  1184. #define _test_intrange(s, ...) _test_intrange(s, (int[]){ __VA_ARGS__ })
  1185. void utf8_test()
  1186. {
  1187. _utf8_test("", 0, 1);
  1188. _utf8_test("\1", 1, 1);
  1189. _utf8_test("\x7f", 0x7f, 1);
  1190. #if WCHAR_MAX >= 0x80
  1191. _utf8_test("\xc2\x80", 0x80, 2);
  1192. #if WCHAR_MAX >= 0xff
  1193. _utf8_test("\xc3\xbf", 0xff, 2);
  1194. #if WCHAR_MAX >= 0x7ff
  1195. _utf8_test("\xdf\xbf", 0x7ff, 2);
  1196. #if WCHAR_MAX >= 0x800
  1197. _utf8_test("\xe0\xa0\x80", 0x800, 3);
  1198. #if WCHAR_MAX >= 0xffff
  1199. _utf8_test("\xef\xbf\xbf", 0xffff, 3);
  1200. #if WCHAR_MAX >= 0x10000
  1201. _utf8_test("\xf0\x90\x80\x80", 0x10000, 4);
  1202. #if WCHAR_MAX >= 0x10ffff
  1203. _utf8_test("\xf4\x8f\xbf\xbf", 0x10ffff, 4);
  1204. #endif
  1205. #endif
  1206. #endif
  1207. #endif
  1208. #endif
  1209. #endif
  1210. #endif
  1211. #ifdef STRICT_UTF8
  1212. _utf8_test("\x80", REPLACEMENT_CHAR, 1);
  1213. _utf8_test("\xbf", REPLACEMENT_CHAR, 1);
  1214. _utf8_test("\xfe", REPLACEMENT_CHAR, 1);
  1215. _utf8_test("\xff", REPLACEMENT_CHAR, 1);
  1216. #endif
  1217. }
  1218. int format_temperature2(char * const buf, size_t sz, const int pad, const bool highprecision, const bool unicode, const float temp)
  1219. {
  1220. return
  1221. snprintf(buf, sz, "%*.*f%sC"
  1222. , pad
  1223. , (highprecision ? 1 : 0)
  1224. , temp
  1225. , (unicode ? U8_DEGREE : "")
  1226. );
  1227. }
  1228. int format_temperature_sz(const int numsz, const bool unicode)
  1229. {
  1230. return numsz + (unicode ? 2 : 1);
  1231. }
  1232. int bfg_vsnprintf(char * const buf, size_t sz, const char *fmt, va_list ap)
  1233. {
  1234. char *s = buf;
  1235. size_t L;
  1236. int arg_d, arg_d_2;
  1237. void *arg_p;
  1238. long arg_ld;
  1239. int64_t arg_d64;
  1240. double arg_f, arg_f_2;
  1241. int rv = 0;
  1242. for (const char *p = fmt; ; ++p)
  1243. {
  1244. switch (p[0])
  1245. {
  1246. case '\0':
  1247. case '\b':
  1248. case '%':
  1249. if ( (L = (p - fmt)) )
  1250. {
  1251. _SNP("%.*s", L, fmt);
  1252. fmt += L;
  1253. }
  1254. if (!fmt[0])
  1255. return (s - buf);
  1256. if (fmt[0] == '\b')
  1257. {
  1258. // BFGMiner custom formatting
  1259. switch (fmt[1])
  1260. {
  1261. case 1: // format_tm
  1262. arg_d = va_arg(ap, int);
  1263. arg_p = va_arg(ap, void*);
  1264. arg_ld = va_arg(ap, long);
  1265. _SNP2(format_tm2, arg_d, arg_p, arg_ld);
  1266. L = sizeof(BPRItm);
  1267. break;
  1268. case 2: // format_timestamp
  1269. arg_d = va_arg(ap, int);
  1270. arg_p = va_arg(ap, void*);
  1271. _SNP2(format_timestamp2, arg_d, arg_p);
  1272. L = sizeof(BPRIts);
  1273. break;
  1274. case 3: // format_time_t
  1275. arg_d = va_arg(ap, int);
  1276. arg_d64 = va_arg(ap, int64_t);
  1277. _SNP2(format_time_t2, arg_d, arg_d64);
  1278. L = sizeof(BPRItt);
  1279. break;
  1280. case 4: // format_elapsed
  1281. arg_d = va_arg(ap, int);
  1282. arg_d_2 = va_arg(ap, int);
  1283. _SNP2(format_elapsed2, arg_d, arg_d_2);
  1284. L = sizeof(BPRIte);
  1285. break;
  1286. case 5: // format_unit (int-precision)
  1287. case 6: // format_unit (float-precision)
  1288. arg_p = va_arg(ap, void*);
  1289. arg_d = va_arg(ap, int);
  1290. arg_f = va_arg(ap, double);
  1291. arg_d_2 = va_arg(ap, int);
  1292. _SNP2(format_unit2, (fmt[1] == 6), arg_p, arg_d, arg_f, arg_d_2);
  1293. L = sizeof(BPRInd);
  1294. break;
  1295. case 7: // temperature
  1296. arg_f = va_arg(ap, double);
  1297. _SNP2(format_temperature2, 0, false, true, arg_f);
  1298. L = sizeof(BPRItp);
  1299. break;
  1300. case 8: // percentage, 2nd arg is OTHERS
  1301. case 9: // percentage, 2nd arg is TOTAL
  1302. arg_f = va_arg(ap, double);
  1303. arg_f_2 = va_arg(ap, double);
  1304. if (fmt[1] == 8)
  1305. arg_f_2 += arg_f;
  1306. _SNP2(percentf3, arg_f, arg_f_2);
  1307. L = sizeof(BPRIpgo);
  1308. break;
  1309. }
  1310. fmt += (L - 1);
  1311. p = fmt - 1;
  1312. break;
  1313. }
  1314. else
  1315. {
  1316. // Standard printf % conversions
  1317. // Thanks to va_list passing not being nice, we have to go into detail here :(
  1318. ++p;
  1319. while (true)
  1320. {
  1321. switch (p++[0])
  1322. {
  1323. // NOTE: Subset of standard and Windows types
  1324. case 'd': case 'i': case 'u': case 'x': case 'X': case 'o': case 'e': case 'E': case 'f': case 'g': case 'G': case 'a': case 'A': case 'c': case 's': case 'p': case '%':
  1325. goto foundend;
  1326. case '0':
  1327. // TODO: invalid sequence
  1328. break;
  1329. }
  1330. }
  1331. foundend:
  1332. L = (p - fmt);
  1333. char fmtcp[L+1];
  1334. memcpy(fmtcp, fmt, L);
  1335. fmtcp[L] = '\0';
  1336. fmt += L;
  1337. p = fmt - 1;
  1338. switch (p[0])
  1339. {
  1340. case 'd': case 'i':
  1341. case 'u':
  1342. case 'x': case 'X':
  1343. case 'o':
  1344. case 'c':
  1345. arg_d = va_arg(ap, int);
  1346. _SNP(fmtcp, arg_d);
  1347. break;
  1348. case 'e': case 'E':
  1349. case 'f':
  1350. case 'g': case 'G':
  1351. case 'a': case 'A':
  1352. arg_f = va_arg(ap, double);
  1353. _SNP(fmtcp, arg_f);
  1354. break;
  1355. case 's':
  1356. case 'p':
  1357. arg_p = va_arg(ap, void*);
  1358. _SNP(fmtcp, arg_p);
  1359. break;
  1360. case '%':
  1361. _SNP(fmtcp, "%%");
  1362. }
  1363. }
  1364. }
  1365. }
  1366. }
  1367. int bfg_snprintf(char * const buf, size_t sz, const char * const fmt, ...)
  1368. {
  1369. va_list ap;
  1370. va_start(ap, fmt);
  1371. int rv = bfg_vsnprintf(buf, sz, fmt, ap);
  1372. va_end(ap);
  1373. return rv;
  1374. }
  1375. static
  1376. void _test_bfg_sprintf(const char * const testname, const char * const fmt, const char * const expected, ...)
  1377. {
  1378. int len = strlen(expected), rv;
  1379. char buf[len + 3];
  1380. va_list ap, ap2;
  1381. va_start(ap, expected);
  1382. buf[len + 2] = '\0';
  1383. // NOTE: Some systems error on 0-sized buffers :(
  1384. for (int i = 1; i < len + 2; ++i)
  1385. {
  1386. memset(buf, 'X', len + 2);
  1387. va_copy(ap2, ap);
  1388. rv = bfg_vsnprintf(buf, i, fmt, ap2);
  1389. va_end(ap2);
  1390. if ( (len != rv) // Return value must be full length
  1391. || ((i > 1) ? memcmp(buf, expected, i - 1) : 0) // Data before end point must match expectations
  1392. || (buf[i - 1]) ) // Final byte in buffer must be null
  1393. applog(LOG_WARNING, "bfg_snprintf test %s/%d failed: returned %d bytes \"%s\" with size %d", testname, i, strlen(buf), buf, rv);
  1394. }
  1395. // Check extra buffer
  1396. rv = bfg_vsnprintf(buf, len + 2, fmt, ap2);
  1397. if (len != rv || memcmp(buf, expected, len + 1))
  1398. applog(LOG_WARNING, "bfg_snprintf test %s/x failed: returned %d bytes \"%s\" with size %d", testname, strlen(buf), buf, rv);
  1399. }
  1400. #define _test_bfg_sprintf(fmt, ...) _test_bfg_sprintf(#fmt, fmt, __VA_ARGS__)
  1401. void test_bfg_snprintf()
  1402. {
  1403. struct tm tm = {
  1404. .tm_year = 115,
  1405. .tm_mon = 5,
  1406. .tm_mday = 3,
  1407. .tm_hour = 13,
  1408. .tm_min = 44,
  1409. .tm_sec = 22,
  1410. };
  1411. struct timeval tv;
  1412. time_t tt;
  1413. _test_bfg_sprintf("abc", "abc");
  1414. _test_bfg_sprintf("a%dbc", "a4bc", 4);
  1415. _test_bfg_sprintf("a%2dbc", "a 4bc", 4);
  1416. _test_bfg_sprintf("a%-2dbc", "a4 bc", 4);
  1417. _test_bfg_sprintf("a%02dbc1", "a04bc1", 4);
  1418. _test_bfg_sprintf("a%02dbc2", "a44bc2", 44);
  1419. _test_bfg_sprintf("a%sbc", "axyzbc", "xyz");
  1420. _test_bfg_sprintf("a%sb%sc", "axyzb123c", "xyz", "123");
  1421. _test_bfg_sprintf("a%ubc", "a255bc", 255);
  1422. _test_bfg_sprintf("a"BPRItm"bc1", "a[2015-06-03 13:44:22.000001]bc1", (BTF_BRACKETS | BTF_DATE | BTF_HRTIME), &tm, 1L);
  1423. _test_bfg_sprintf("a"BPRItm"bc2", "a[2015-06-03 13:44:22]bc2", (BTF_BRACKETS | BTF_DATE | BTF_TIME), &tm, 0L);
  1424. _test_bfg_sprintf("a"BPRItm"bc3", "a[2015-06-03 13:44]bc3", (BTF_BRACKETS | BTF_DATE | BTF_LRTIME), &tm, 0L);
  1425. _test_bfg_sprintf("a"BPRItm"bc4", "a[13:44:22.123456]bc4", (BTF_BRACKETS | BTF_HRTIME), &tm, 123456L);
  1426. _test_bfg_sprintf("a"BPRItm"bc5", "a13:44:22.999999bc5", (BTF_HRTIME), &tm, 999999L);
  1427. _test_bfg_sprintf("a"BPRItm"bc6", "a[2015-06-03]bc6", (BTF_BRACKETS | BTF_DATE), &tm, 0L);
  1428. _test_bfg_sprintf("a"BPRItm"bc7", "a2015-06-03bc7", (BTF_DATE), &tm, 0L);
  1429. tt = mktime(&tm);
  1430. _test_bfg_sprintf("a"BPRItt"bc", "a[2015-06-03 13:44:22.000000]bc", (BTF_BRACKETS | BTF_DATE | BTF_HRTIME), (int64_t)tt);
  1431. tv = (struct timeval){
  1432. .tv_sec = tt,
  1433. .tv_usec = 987654,
  1434. };
  1435. _test_bfg_sprintf("a"BPRIts"bc", "a[2015-06-03 13:44:22.987654]bc", (BTF_BRACKETS | BTF_DATE | BTF_HRTIME), &tv);
  1436. _test_bfg_sprintf("a"BPRIte"bc", "a[ 1 day 05:04:03]bc", (BTF_BRACKETS | BTF_DATE | BTF_TIME), 104643);
  1437. _test_bfg_sprintf("a"BPRIte"bc", "a[ 2 days 05:04:03]bc", (BTF_BRACKETS | BTF_DATE | BTF_TIME), 191043);
  1438. _test_bfg_sprintf("a"BPRInd"bc1", "a 1bc1", "x/y", H2B_NOUNIT, 1., -1);
  1439. _test_bfg_sprintf("a"BPRInd"bc2", "a 1 x/ybc2", "x/y", H2B_SHORT, 1., -1);
  1440. _test_bfg_sprintf("a"BPRInd"bc3", "a 1 x/ybc3", "x/y", H2B_SPACED, 1., -1);
  1441. _test_bfg_sprintf("a"BPRInd"bc4", "a 1 x/ybc4", "x/y", H2B_SHORT, 1., 0);
  1442. _test_bfg_sprintf("a"BPRInd"bc5", "a 0kx/ybc5", "x/y", H2B_SHORT, 1., 1);
  1443. _test_bfg_sprintf("a"BPRInd"bc6", "a 0Mx/ybc6", "x/y", H2B_SHORT, 1., 2);
  1444. _test_bfg_sprintf("a"BPRInd"bc7", "a 0Gx/ybc7", "x/y", H2B_SHORT, 1., 3);
  1445. _test_bfg_sprintf("a"BPRInd"bc8", "a 0Tx/ybc8", "x/y", H2B_SHORT, 1., 4);
  1446. _test_bfg_sprintf("a"BPRInd"bc9", "a 1kx/ybc9", "x/y", H2B_SHORT, 1e3, -1);
  1447. _test_bfg_sprintf("a"BPRInd"bcA", "a 1Mx/ybcA", "x/y", H2B_SHORT, 1e6, -1);
  1448. _test_bfg_sprintf("a"BPRInd"bcB", "a 1Gx/ybcB", "x/y", H2B_SHORT, 1e9, -1);
  1449. _test_bfg_sprintf("a"BPRInd"bcC", "a 1Tx/ybcC", "x/y", H2B_SHORT, 1e12, -1);
  1450. _test_bfg_sprintf("a"BPRInf"bc1", "a 1.0bc1", "x/y", H2B_NOUNIT, 1., -1);
  1451. _test_bfg_sprintf("a"BPRInf"bc2", "a 1.0 x/ybc2", "x/y", H2B_SHORT, 1., -1);
  1452. _test_bfg_sprintf("a"BPRInf"bc3", "a 1.0 x/ybc3", "x/y", H2B_SPACED, 1., -1);
  1453. _test_bfg_sprintf("a"BPRInf"bc4", "a 1.0 x/ybc4", "x/y", H2B_SHORT, 1., 0);
  1454. _test_bfg_sprintf("a"BPRInf"bc5", "a 0.0kx/ybc5", "x/y", H2B_SHORT, 1., 1);
  1455. _test_bfg_sprintf("a"BPRInf"bc6", "a 0.00Mx/ybc6", "x/y", H2B_SHORT, 1., 2);
  1456. _test_bfg_sprintf("a"BPRInf"bc7", "a 0.00Gx/ybc7", "x/y", H2B_SHORT, 1., 3);
  1457. _test_bfg_sprintf("a"BPRInf"bc8", "a 0.00Tx/ybc8", "x/y", H2B_SHORT, 1., 4);
  1458. _test_bfg_sprintf("a"BPRInf"bc9", "a 1.0kx/ybc9", "x/y", H2B_SHORT, 1e3, -1);
  1459. _test_bfg_sprintf("a"BPRInf"bcA", "a 1.00Mx/ybcA", "x/y", H2B_SHORT, 1e6, -1);
  1460. _test_bfg_sprintf("a"BPRInf"bcB", "a 1.00Gx/ybcB", "x/y", H2B_SHORT, 1e9, -1);
  1461. _test_bfg_sprintf("a"BPRInf"bcC", "a 1.00Tx/ybcC", "x/y", H2B_SHORT, 1e12, -1);
  1462. _test_bfg_sprintf("a"BPRItp"bc", "a80"U8_DEGREE"Cbc", 80.);
  1463. _test_bfg_sprintf("a"BPRIpgo"bc1", "anonebc1", 0., 40.);
  1464. _test_bfg_sprintf("a"BPRIpgo"bc2", "a100%bc2", 10., 0.);
  1465. _test_bfg_sprintf("a"BPRIpgo"bc3", "a 20%bc3", 10., 40.);
  1466. _test_bfg_sprintf("a"BPRIpgo"bc4", "a 80%bc4", 40., 10.);
  1467. _test_bfg_sprintf("a"BPRIpgo"bc5", "a2.4%bc5", 1., 40.);
  1468. _test_bfg_sprintf("a"BPRIpgo"bc6", "a.24%bc6", 1., 414.);
  1469. _test_bfg_sprintf("a"BPRIpgt"bc1", "anonebc1", 0., 40.);
  1470. _test_bfg_sprintf("a"BPRIpgt"bc2", "a100%bc2", 10., 10.);
  1471. _test_bfg_sprintf("a"BPRIpgt"bc3", "a 25%bc3", 10., 40.);
  1472. _test_bfg_sprintf("a"BPRIpgt"bc4", "a 40%bc4", 40., 100.);
  1473. _test_bfg_sprintf("a"BPRIpgt"bc5", "a2.5%bc5", 1., 40.);
  1474. _test_bfg_sprintf("a"BPRIpgt"bc6", "a.24%bc6", 1., 414.);
  1475. }
  1476. bool extract_sockaddr(struct pool *pool, char *url)
  1477. {
  1478. char *url_begin, *url_end, *ipv6_begin, *ipv6_end, *port_start = NULL;
  1479. char url_address[256], port[6];
  1480. int url_len, port_len = 0;
  1481. url_begin = strstr(url, "//");
  1482. if (!url_begin)
  1483. url_begin = url;
  1484. else
  1485. url_begin += 2;
  1486. /* Look for numeric ipv6 entries */
  1487. ipv6_begin = strstr(url_begin, "[");
  1488. ipv6_end = strstr(url_begin, "]");
  1489. if (ipv6_begin && ipv6_end && ipv6_end > ipv6_begin)
  1490. url_end = strstr(ipv6_end, ":");
  1491. else
  1492. url_end = strstr(url_begin, ":");
  1493. if (url_end) {
  1494. url_len = url_end - url_begin;
  1495. port_len = strlen(url_begin) - url_len - 1;
  1496. if (port_len < 1)
  1497. return false;
  1498. port_start = url_end + 1;
  1499. } else
  1500. url_len = strlen(url_begin);
  1501. if (url_len < 1)
  1502. return false;
  1503. sprintf(url_address, "%.*s", url_len, url_begin);
  1504. if (port_len)
  1505. snprintf(port, 6, "%.*s", port_len, port_start);
  1506. else
  1507. strcpy(port, "80");
  1508. free(pool->stratum_port);
  1509. pool->stratum_port = strdup(port);
  1510. free(pool->sockaddr_url);
  1511. pool->sockaddr_url = strdup(url_address);
  1512. return true;
  1513. }
  1514. enum send_ret {
  1515. SEND_OK,
  1516. SEND_SELECTFAIL,
  1517. SEND_SENDFAIL,
  1518. SEND_INACTIVE
  1519. };
  1520. /* Send a single command across a socket, appending \n to it. This should all
  1521. * be done under stratum lock except when first establishing the socket */
  1522. static enum send_ret __stratum_send(struct pool *pool, char *s, ssize_t len)
  1523. {
  1524. SOCKETTYPE sock = pool->sock;
  1525. ssize_t ssent = 0;
  1526. strcat(s, "\n");
  1527. len++;
  1528. while (len > 0 ) {
  1529. struct timeval timeout = {1, 0};
  1530. ssize_t sent;
  1531. fd_set wd;
  1532. FD_ZERO(&wd);
  1533. FD_SET(sock, &wd);
  1534. if (select(sock + 1, NULL, &wd, NULL, &timeout) < 1)
  1535. return SEND_SELECTFAIL;
  1536. #ifdef __APPLE__
  1537. sent = send(pool->sock, s + ssent, len, SO_NOSIGPIPE);
  1538. #elif WIN32
  1539. sent = send(pool->sock, s + ssent, len, 0);
  1540. #else
  1541. sent = send(pool->sock, s + ssent, len, MSG_NOSIGNAL);
  1542. #endif
  1543. if (sent < 0) {
  1544. if (!sock_blocks())
  1545. return SEND_SENDFAIL;
  1546. sent = 0;
  1547. }
  1548. ssent += sent;
  1549. len -= sent;
  1550. }
  1551. pool->cgminer_pool_stats.times_sent++;
  1552. pool->cgminer_pool_stats.bytes_sent += ssent;
  1553. total_bytes_sent += ssent;
  1554. pool->cgminer_pool_stats.net_bytes_sent += ssent;
  1555. return SEND_OK;
  1556. }
  1557. bool _stratum_send(struct pool *pool, char *s, ssize_t len, bool force)
  1558. {
  1559. enum send_ret ret = SEND_INACTIVE;
  1560. if (opt_protocol)
  1561. applog(LOG_DEBUG, "Pool %u: SEND: %s", pool->pool_no, s);
  1562. mutex_lock(&pool->stratum_lock);
  1563. if (pool->stratum_active || force)
  1564. ret = __stratum_send(pool, s, len);
  1565. mutex_unlock(&pool->stratum_lock);
  1566. /* This is to avoid doing applog under stratum_lock */
  1567. switch (ret) {
  1568. default:
  1569. case SEND_OK:
  1570. break;
  1571. case SEND_SELECTFAIL:
  1572. applog(LOG_DEBUG, "Write select failed on pool %d sock", pool->pool_no);
  1573. suspend_stratum(pool);
  1574. break;
  1575. case SEND_SENDFAIL:
  1576. applog(LOG_DEBUG, "Failed to send in stratum_send");
  1577. suspend_stratum(pool);
  1578. break;
  1579. case SEND_INACTIVE:
  1580. applog(LOG_DEBUG, "Stratum send failed due to no pool stratum_active");
  1581. break;
  1582. }
  1583. return (ret == SEND_OK);
  1584. }
  1585. static bool socket_full(struct pool *pool, bool wait)
  1586. {
  1587. SOCKETTYPE sock = pool->sock;
  1588. struct timeval timeout;
  1589. fd_set rd;
  1590. FD_ZERO(&rd);
  1591. FD_SET(sock, &rd);
  1592. timeout.tv_usec = 0;
  1593. if (wait)
  1594. timeout.tv_sec = 60;
  1595. else
  1596. timeout.tv_sec = 1;
  1597. if (select(sock + 1, &rd, NULL, NULL, &timeout) > 0)
  1598. return true;
  1599. return false;
  1600. }
  1601. /* Check to see if Santa's been good to you */
  1602. bool sock_full(struct pool *pool)
  1603. {
  1604. if (strlen(pool->sockbuf))
  1605. return true;
  1606. return (socket_full(pool, false));
  1607. }
  1608. static void clear_sockbuf(struct pool *pool)
  1609. {
  1610. strcpy(pool->sockbuf, "");
  1611. }
  1612. static void clear_sock(struct pool *pool)
  1613. {
  1614. ssize_t n;
  1615. mutex_lock(&pool->stratum_lock);
  1616. do {
  1617. if (pool->sock)
  1618. n = recv(pool->sock, pool->sockbuf, RECVSIZE, 0);
  1619. else
  1620. n = 0;
  1621. } while (n > 0);
  1622. mutex_unlock(&pool->stratum_lock);
  1623. clear_sockbuf(pool);
  1624. }
  1625. /* Make sure the pool sockbuf is large enough to cope with any coinbase size
  1626. * by reallocing it to a large enough size rounded up to a multiple of RBUFSIZE
  1627. * and zeroing the new memory */
  1628. static void recalloc_sock(struct pool *pool, size_t len)
  1629. {
  1630. size_t old, new;
  1631. old = strlen(pool->sockbuf);
  1632. new = old + len + 1;
  1633. if (new < pool->sockbuf_size)
  1634. return;
  1635. new = new + (RBUFSIZE - (new % RBUFSIZE));
  1636. // Avoid potentially recursive locking
  1637. // applog(LOG_DEBUG, "Recallocing pool sockbuf to %lu", (unsigned long)new);
  1638. pool->sockbuf = realloc(pool->sockbuf, new);
  1639. if (!pool->sockbuf)
  1640. quit(1, "Failed to realloc pool sockbuf in recalloc_sock");
  1641. memset(pool->sockbuf + old, 0, new - old);
  1642. pool->sockbuf_size = new;
  1643. }
  1644. /* Peeks at a socket to find the first end of line and then reads just that
  1645. * from the socket and returns that as a malloced char */
  1646. char *recv_line(struct pool *pool)
  1647. {
  1648. ssize_t len, buflen;
  1649. char *tok, *sret = NULL;
  1650. if (!strstr(pool->sockbuf, "\n")) {
  1651. struct timeval rstart, now;
  1652. cgtime(&rstart);
  1653. if (!socket_full(pool, true)) {
  1654. applog(LOG_DEBUG, "Timed out waiting for data on socket_full");
  1655. goto out;
  1656. }
  1657. do {
  1658. char s[RBUFSIZE];
  1659. size_t slen;
  1660. ssize_t n;
  1661. memset(s, 0, RBUFSIZE);
  1662. n = recv(pool->sock, s, RECVSIZE, 0);
  1663. if (!n) {
  1664. applog(LOG_DEBUG, "Socket closed waiting in recv_line");
  1665. suspend_stratum(pool);
  1666. break;
  1667. }
  1668. if (n < 0) {
  1669. //Save errno from being overweitten bei socket_ commands
  1670. int socket_recv_errno;
  1671. socket_recv_errno = SOCKERR;
  1672. if (!sock_blocks() || !socket_full(pool, true)) {
  1673. applog(LOG_DEBUG, "Failed to recv sock in recv_line: %s", bfg_strerror(socket_recv_errno, BST_SOCKET));
  1674. suspend_stratum(pool);
  1675. break;
  1676. }
  1677. } else {
  1678. slen = strlen(s);
  1679. recalloc_sock(pool, slen);
  1680. strcat(pool->sockbuf, s);
  1681. }
  1682. cgtime(&now);
  1683. } while (tdiff(&now, &rstart) < 60 && !strstr(pool->sockbuf, "\n"));
  1684. }
  1685. buflen = strlen(pool->sockbuf);
  1686. tok = strtok(pool->sockbuf, "\n");
  1687. if (!tok) {
  1688. applog(LOG_DEBUG, "Failed to parse a \\n terminated string in recv_line");
  1689. goto out;
  1690. }
  1691. sret = strdup(tok);
  1692. len = strlen(sret);
  1693. /* Copy what's left in the buffer after the \n, including the
  1694. * terminating \0 */
  1695. if (buflen > len + 1)
  1696. memmove(pool->sockbuf, pool->sockbuf + len + 1, buflen - len + 1);
  1697. else
  1698. strcpy(pool->sockbuf, "");
  1699. pool->cgminer_pool_stats.times_received++;
  1700. pool->cgminer_pool_stats.bytes_received += len;
  1701. total_bytes_rcvd += len;
  1702. pool->cgminer_pool_stats.net_bytes_received += len;
  1703. out:
  1704. if (!sret)
  1705. clear_sock(pool);
  1706. else if (opt_protocol)
  1707. applog(LOG_DEBUG, "Pool %u: RECV: %s", pool->pool_no, sret);
  1708. return sret;
  1709. }
  1710. /* Dumps any JSON value as a string. Just like jansson 2.1's JSON_ENCODE_ANY
  1711. * flag, but this is compatible with 2.0. */
  1712. char *json_dumps_ANY(json_t *json, size_t flags)
  1713. {
  1714. switch (json_typeof(json))
  1715. {
  1716. case JSON_ARRAY:
  1717. case JSON_OBJECT:
  1718. return json_dumps(json, flags);
  1719. default:
  1720. break;
  1721. }
  1722. char *rv;
  1723. #ifdef JSON_ENCODE_ANY
  1724. rv = json_dumps(json, JSON_ENCODE_ANY | flags);
  1725. if (rv)
  1726. return rv;
  1727. #endif
  1728. json_t *tmp = json_array();
  1729. char *s;
  1730. int i;
  1731. size_t len;
  1732. if (!tmp)
  1733. quit(1, "json_dumps_ANY failed to allocate json array");
  1734. if (json_array_append(tmp, json))
  1735. quit(1, "json_dumps_ANY failed to append temporary array");
  1736. s = json_dumps(tmp, flags);
  1737. if (!s)
  1738. return NULL;
  1739. for (i = 0; s[i] != '['; ++i)
  1740. if (unlikely(!(s[i] && isCspace(s[i]))))
  1741. quit(1, "json_dumps_ANY failed to find opening bracket in array dump");
  1742. len = strlen(&s[++i]) - 1;
  1743. if (unlikely(s[i+len] != ']'))
  1744. quit(1, "json_dumps_ANY failed to find closing bracket in array dump");
  1745. rv = malloc(len + 1);
  1746. memcpy(rv, &s[i], len);
  1747. rv[len] = '\0';
  1748. free(s);
  1749. json_decref(tmp);
  1750. return rv;
  1751. }
  1752. /* Extracts a string value from a json array with error checking. To be used
  1753. * when the value of the string returned is only examined and not to be stored.
  1754. * See json_array_string below */
  1755. static char *__json_array_string(json_t *val, unsigned int entry)
  1756. {
  1757. json_t *arr_entry;
  1758. if (json_is_null(val))
  1759. return NULL;
  1760. if (!json_is_array(val))
  1761. return NULL;
  1762. if (entry > json_array_size(val))
  1763. return NULL;
  1764. arr_entry = json_array_get(val, entry);
  1765. if (!json_is_string(arr_entry))
  1766. return NULL;
  1767. return (char *)json_string_value(arr_entry);
  1768. }
  1769. /* Creates a freshly malloced dup of __json_array_string */
  1770. static char *json_array_string(json_t *val, unsigned int entry)
  1771. {
  1772. char *buf = __json_array_string(val, entry);
  1773. if (buf)
  1774. return strdup(buf);
  1775. return NULL;
  1776. }
  1777. void stratum_probe_transparency(struct pool *pool)
  1778. {
  1779. // Request transaction data to discourage pools from doing anything shady
  1780. char s[1024];
  1781. int sLen;
  1782. sLen = sprintf(s, "{\"params\": [\"%s\"], \"id\": \"txlist%s\", \"method\": \"mining.get_transactions\"}",
  1783. pool->swork.job_id,
  1784. pool->swork.job_id);
  1785. stratum_send(pool, s, sLen);
  1786. if ((!pool->swork.opaque) && !timer_isset(&pool->swork.tv_transparency))
  1787. cgtime(&pool->swork.tv_transparency);
  1788. pool->swork.transparency_probed = true;
  1789. }
  1790. static bool parse_notify(struct pool *pool, json_t *val)
  1791. {
  1792. char *job_id, *prev_hash, *coinbase1, *coinbase2, *bbversion, *nbit, *ntime;
  1793. bool clean, ret = false;
  1794. int merkles, i;
  1795. size_t cb1_len, cb2_len;
  1796. json_t *arr;
  1797. arr = json_array_get(val, 4);
  1798. if (!arr || !json_is_array(arr))
  1799. goto out;
  1800. merkles = json_array_size(arr);
  1801. for (i = 0; i < merkles; i++)
  1802. if (!json_is_string(json_array_get(arr, i)))
  1803. goto out;
  1804. prev_hash = __json_array_string(val, 1);
  1805. coinbase1 = __json_array_string(val, 2);
  1806. coinbase2 = __json_array_string(val, 3);
  1807. bbversion = __json_array_string(val, 5);
  1808. nbit = __json_array_string(val, 6);
  1809. ntime = __json_array_string(val, 7);
  1810. clean = json_is_true(json_array_get(val, 8));
  1811. if (!prev_hash || !coinbase1 || !coinbase2 || !bbversion || !nbit || !ntime)
  1812. goto out;
  1813. job_id = json_array_string(val, 0);
  1814. if (!job_id)
  1815. goto out;
  1816. cg_wlock(&pool->data_lock);
  1817. cgtime(&pool->swork.tv_received);
  1818. free(pool->swork.job_id);
  1819. pool->swork.job_id = job_id;
  1820. pool->submit_old = !clean;
  1821. pool->swork.clean = true;
  1822. hex2bin(&pool->swork.header1[0], bbversion, 4);
  1823. hex2bin(&pool->swork.header1[4], prev_hash, 32);
  1824. hex2bin((void*)&pool->swork.ntime, ntime, 4);
  1825. pool->swork.ntime = be32toh(pool->swork.ntime);
  1826. hex2bin(&pool->swork.diffbits[0], nbit, 4);
  1827. cb1_len = strlen(coinbase1) / 2;
  1828. pool->swork.nonce2_offset = cb1_len + pool->n1_len;
  1829. cb2_len = strlen(coinbase2) / 2;
  1830. bytes_resize(&pool->swork.coinbase, pool->swork.nonce2_offset + pool->n2size + cb2_len);
  1831. uint8_t *coinbase = bytes_buf(&pool->swork.coinbase);
  1832. hex2bin(coinbase, coinbase1, cb1_len);
  1833. hex2bin(&coinbase[cb1_len], pool->nonce1, pool->n1_len);
  1834. // NOTE: gap for nonce2, filled at work generation time
  1835. hex2bin(&coinbase[pool->swork.nonce2_offset + pool->n2size], coinbase2, cb2_len);
  1836. bytes_resize(&pool->swork.merkle_bin, 32 * merkles);
  1837. for (i = 0; i < merkles; i++)
  1838. hex2bin(&bytes_buf(&pool->swork.merkle_bin)[i * 32], json_string_value(json_array_get(arr, i)), 32);
  1839. pool->swork.merkles = merkles;
  1840. if (clean)
  1841. pool->nonce2 = 0;
  1842. cg_wunlock(&pool->data_lock);
  1843. applog(LOG_DEBUG, "Received stratum notify from pool %u with job_id=%s",
  1844. pool->pool_no, job_id);
  1845. if (opt_debug && opt_protocol)
  1846. {
  1847. applog(LOG_DEBUG, "job_id: %s", job_id);
  1848. applog(LOG_DEBUG, "prev_hash: %s", prev_hash);
  1849. applog(LOG_DEBUG, "coinbase1: %s", coinbase1);
  1850. applog(LOG_DEBUG, "coinbase2: %s", coinbase2);
  1851. for (i = 0; i < merkles; i++)
  1852. applog(LOG_DEBUG, "merkle%d: %s", i, json_string_value(json_array_get(arr, i)));
  1853. applog(LOG_DEBUG, "bbversion: %s", bbversion);
  1854. applog(LOG_DEBUG, "nbit: %s", nbit);
  1855. applog(LOG_DEBUG, "ntime: %s", ntime);
  1856. applog(LOG_DEBUG, "clean: %s", clean ? "yes" : "no");
  1857. }
  1858. /* A notify message is the closest stratum gets to a getwork */
  1859. pool->getwork_requested++;
  1860. total_getworks++;
  1861. if ((merkles && (!pool->swork.transparency_probed || rand() <= RAND_MAX / (opt_skip_checks + 1))) || timer_isset(&pool->swork.tv_transparency))
  1862. if (pool->stratum_init)
  1863. stratum_probe_transparency(pool);
  1864. ret = true;
  1865. out:
  1866. return ret;
  1867. }
  1868. static bool parse_diff(struct pool *pool, json_t *val)
  1869. {
  1870. double diff;
  1871. diff = json_number_value(json_array_get(val, 0));
  1872. if (diff == 0)
  1873. return false;
  1874. cg_wlock(&pool->data_lock);
  1875. pool->swork.diff = diff;
  1876. cg_wunlock(&pool->data_lock);
  1877. applog(LOG_DEBUG, "Pool %d stratum bdifficulty set to %f", pool->pool_no, diff);
  1878. return true;
  1879. }
  1880. static bool parse_reconnect(struct pool *pool, json_t *val)
  1881. {
  1882. char *url, *port, address[256];
  1883. memset(address, 0, 255);
  1884. url = (char *)json_string_value(json_array_get(val, 0));
  1885. if (!url)
  1886. url = pool->sockaddr_url;
  1887. port = (char *)json_string_value(json_array_get(val, 1));
  1888. if (!port)
  1889. port = pool->stratum_port;
  1890. sprintf(address, "%s:%s", url, port);
  1891. if (!extract_sockaddr(pool, address))
  1892. return false;
  1893. pool->stratum_url = pool->sockaddr_url;
  1894. applog(LOG_NOTICE, "Reconnect requested from pool %d to %s", pool->pool_no, address);
  1895. if (!restart_stratum(pool))
  1896. return false;
  1897. return true;
  1898. }
  1899. static bool send_version(struct pool *pool, json_t *val)
  1900. {
  1901. char s[RBUFSIZE], *idstr;
  1902. json_t *id = json_object_get(val, "id");
  1903. if (!(id && !json_is_null(id)))
  1904. return false;
  1905. idstr = json_dumps_ANY(id, 0);
  1906. sprintf(s, "{\"id\": %s, \"result\": \""PACKAGE"/"VERSION"\", \"error\": null}", idstr);
  1907. free(idstr);
  1908. if (!stratum_send(pool, s, strlen(s)))
  1909. return false;
  1910. return true;
  1911. }
  1912. static bool stratum_show_message(struct pool *pool, json_t *val, json_t *params)
  1913. {
  1914. char *msg;
  1915. char s[RBUFSIZE], *idstr;
  1916. json_t *id = json_object_get(val, "id");
  1917. msg = json_array_string(params, 0);
  1918. if (likely(msg))
  1919. {
  1920. free(pool->admin_msg);
  1921. pool->admin_msg = msg;
  1922. applog(LOG_NOTICE, "Message from pool %u: %s", pool->pool_no, msg);
  1923. }
  1924. if (!(id && !json_is_null(id)))
  1925. return true;
  1926. idstr = json_dumps_ANY(id, 0);
  1927. if (likely(msg))
  1928. sprintf(s, "{\"id\": %s, \"result\": true, \"error\": null}", idstr);
  1929. else
  1930. sprintf(s, "{\"id\": %s, \"result\": null, \"error\": [-1, \"Failed to parse message\", null]}", idstr);
  1931. free(idstr);
  1932. if (!stratum_send(pool, s, strlen(s)))
  1933. return false;
  1934. return true;
  1935. }
  1936. bool parse_method(struct pool *pool, char *s)
  1937. {
  1938. json_t *val = NULL, *method, *err_val, *params;
  1939. json_error_t err;
  1940. bool ret = false;
  1941. char *buf;
  1942. if (!s)
  1943. goto out;
  1944. val = JSON_LOADS(s, &err);
  1945. if (!val) {
  1946. applog(LOG_INFO, "JSON decode failed(%d): %s", err.line, err.text);
  1947. goto out;
  1948. }
  1949. method = json_object_get(val, "method");
  1950. if (!method)
  1951. goto out;
  1952. err_val = json_object_get(val, "error");
  1953. params = json_object_get(val, "params");
  1954. if (err_val && !json_is_null(err_val)) {
  1955. char *ss;
  1956. if (err_val)
  1957. ss = json_dumps(err_val, JSON_INDENT(3));
  1958. else
  1959. ss = strdup("(unknown reason)");
  1960. applog(LOG_INFO, "JSON-RPC method decode failed: %s", ss);
  1961. free(ss);
  1962. goto out;
  1963. }
  1964. buf = (char *)json_string_value(method);
  1965. if (!buf)
  1966. goto out;
  1967. if (!strncasecmp(buf, "mining.notify", 13)) {
  1968. if (parse_notify(pool, params))
  1969. pool->stratum_notify = ret = true;
  1970. else
  1971. pool->stratum_notify = ret = false;
  1972. goto out;
  1973. }
  1974. if (!strncasecmp(buf, "mining.set_difficulty", 21) && parse_diff(pool, params)) {
  1975. ret = true;
  1976. goto out;
  1977. }
  1978. if (!strncasecmp(buf, "client.reconnect", 16) && parse_reconnect(pool, params)) {
  1979. ret = true;
  1980. goto out;
  1981. }
  1982. if (!strncasecmp(buf, "client.get_version", 18) && send_version(pool, val)) {
  1983. ret = true;
  1984. goto out;
  1985. }
  1986. if (!strncasecmp(buf, "client.show_message", 19) && stratum_show_message(pool, val, params)) {
  1987. ret = true;
  1988. goto out;
  1989. }
  1990. out:
  1991. if (val)
  1992. json_decref(val);
  1993. return ret;
  1994. }
  1995. extern bool parse_stratum_response(struct pool *, char *s);
  1996. bool auth_stratum(struct pool *pool)
  1997. {
  1998. json_t *val = NULL, *res_val, *err_val;
  1999. char s[RBUFSIZE], *sret = NULL;
  2000. json_error_t err;
  2001. bool ret = false;
  2002. sprintf(s, "{\"id\": \"auth\", \"method\": \"mining.authorize\", \"params\": [\"%s\", \"%s\"]}",
  2003. pool->rpc_user, pool->rpc_pass);
  2004. if (!stratum_send(pool, s, strlen(s)))
  2005. goto out;
  2006. /* Parse all data in the queue and anything left should be auth */
  2007. while (42) {
  2008. sret = recv_line(pool);
  2009. if (!sret)
  2010. goto out;
  2011. if (parse_method(pool, sret))
  2012. free(sret);
  2013. else
  2014. break;
  2015. }
  2016. val = JSON_LOADS(sret, &err);
  2017. free(sret);
  2018. res_val = json_object_get(val, "result");
  2019. err_val = json_object_get(val, "error");
  2020. if (!res_val || json_is_false(res_val) || (err_val && !json_is_null(err_val))) {
  2021. char *ss;
  2022. if (err_val)
  2023. ss = json_dumps(err_val, JSON_INDENT(3));
  2024. else
  2025. ss = strdup("(unknown reason)");
  2026. applog(LOG_WARNING, "pool %d JSON stratum auth failed: %s", pool->pool_no, ss);
  2027. free(ss);
  2028. goto out;
  2029. }
  2030. ret = true;
  2031. applog(LOG_INFO, "Stratum authorisation success for pool %d", pool->pool_no);
  2032. pool->probed = true;
  2033. successful_connect = true;
  2034. out:
  2035. if (val)
  2036. json_decref(val);
  2037. if (pool->stratum_notify)
  2038. stratum_probe_transparency(pool);
  2039. return ret;
  2040. }
  2041. curl_socket_t grab_socket_opensocket_cb(void *clientp, __maybe_unused curlsocktype purpose, struct curl_sockaddr *addr)
  2042. {
  2043. struct pool *pool = clientp;
  2044. curl_socket_t sck = socket(addr->family, addr->socktype, addr->protocol);
  2045. pool->sock = sck;
  2046. return sck;
  2047. }
  2048. static bool setup_stratum_curl(struct pool *pool)
  2049. {
  2050. char curl_err_str[CURL_ERROR_SIZE];
  2051. CURL *curl = NULL;
  2052. char s[RBUFSIZE];
  2053. bool ret = false;
  2054. applog(LOG_DEBUG, "initiate_stratum with sockbuf=%p", pool->sockbuf);
  2055. mutex_lock(&pool->stratum_lock);
  2056. timer_unset(&pool->swork.tv_transparency);
  2057. pool->stratum_active = false;
  2058. pool->stratum_notify = false;
  2059. pool->swork.transparency_probed = false;
  2060. if (pool->stratum_curl)
  2061. curl_easy_cleanup(pool->stratum_curl);
  2062. pool->stratum_curl = curl_easy_init();
  2063. if (unlikely(!pool->stratum_curl))
  2064. quit(1, "Failed to curl_easy_init in initiate_stratum");
  2065. if (pool->sockbuf)
  2066. pool->sockbuf[0] = '\0';
  2067. curl = pool->stratum_curl;
  2068. if (!pool->sockbuf) {
  2069. pool->sockbuf = calloc(RBUFSIZE, 1);
  2070. if (!pool->sockbuf)
  2071. quit(1, "Failed to calloc pool sockbuf in initiate_stratum");
  2072. pool->sockbuf_size = RBUFSIZE;
  2073. }
  2074. /* Create a http url for use with curl */
  2075. sprintf(s, "http://%s:%s", pool->sockaddr_url, pool->stratum_port);
  2076. curl_easy_setopt(curl, CURLOPT_FRESH_CONNECT, 1);
  2077. curl_easy_setopt(curl, CURLOPT_CONNECTTIMEOUT, 30);
  2078. curl_easy_setopt(curl, CURLOPT_ERRORBUFFER, curl_err_str);
  2079. curl_easy_setopt(curl, CURLOPT_NOSIGNAL, 1);
  2080. curl_easy_setopt(curl, CURLOPT_URL, s);
  2081. if (!opt_delaynet)
  2082. curl_easy_setopt(curl, CURLOPT_TCP_NODELAY, 1);
  2083. /* We use DEBUGFUNCTION to count bytes sent/received, and verbose is needed
  2084. * to enable it */
  2085. curl_easy_setopt(curl, CURLOPT_DEBUGFUNCTION, curl_debug_cb);
  2086. curl_easy_setopt(curl, CURLOPT_DEBUGDATA, (void *)pool);
  2087. curl_easy_setopt(curl, CURLOPT_VERBOSE, 1);
  2088. // CURLINFO_LASTSOCKET is broken on Win64 (which has a wider SOCKET type than curl_easy_getinfo returns), so we use this hack for now
  2089. curl_easy_setopt(curl, CURLOPT_OPENSOCKETFUNCTION, grab_socket_opensocket_cb);
  2090. curl_easy_setopt(curl, CURLOPT_OPENSOCKETDATA, pool);
  2091. curl_easy_setopt(curl, CURLOPT_USE_SSL, CURLUSESSL_TRY);
  2092. if (pool->rpc_proxy) {
  2093. curl_easy_setopt(curl, CURLOPT_PROXY, pool->rpc_proxy);
  2094. } else if (opt_socks_proxy) {
  2095. curl_easy_setopt(curl, CURLOPT_PROXY, opt_socks_proxy);
  2096. curl_easy_setopt(curl, CURLOPT_PROXYTYPE, CURLPROXY_SOCKS4);
  2097. }
  2098. curl_easy_setopt(curl, CURLOPT_CONNECT_ONLY, 1);
  2099. pool->sock = INVSOCK;
  2100. if (curl_easy_perform(curl)) {
  2101. applog(LOG_INFO, "Stratum connect failed to pool %d: %s", pool->pool_no, curl_err_str);
  2102. errout:
  2103. curl_easy_cleanup(curl);
  2104. pool->stratum_curl = NULL;
  2105. goto out;
  2106. }
  2107. if (pool->sock == INVSOCK)
  2108. {
  2109. applog(LOG_ERR, "Stratum connect succeeded, but technical problem extracting socket (pool %u)", pool->pool_no);
  2110. goto errout;
  2111. }
  2112. keep_sockalive(pool->sock);
  2113. pool->cgminer_pool_stats.times_sent++;
  2114. pool->cgminer_pool_stats.times_received++;
  2115. ret = true;
  2116. out:
  2117. mutex_unlock(&pool->stratum_lock);
  2118. return ret;
  2119. }
  2120. static char *get_sessionid(json_t *val)
  2121. {
  2122. char *ret = NULL;
  2123. json_t *arr_val;
  2124. int arrsize, i;
  2125. arr_val = json_array_get(val, 0);
  2126. if (!arr_val || !json_is_array(arr_val))
  2127. goto out;
  2128. arrsize = json_array_size(arr_val);
  2129. for (i = 0; i < arrsize; i++) {
  2130. json_t *arr = json_array_get(arr_val, i);
  2131. char *notify;
  2132. if (!arr | !json_is_array(arr))
  2133. break;
  2134. notify = __json_array_string(arr, 0);
  2135. if (!notify)
  2136. continue;
  2137. if (!strncasecmp(notify, "mining.notify", 13)) {
  2138. ret = json_array_string(arr, 1);
  2139. break;
  2140. }
  2141. }
  2142. out:
  2143. return ret;
  2144. }
  2145. void suspend_stratum(struct pool *pool)
  2146. {
  2147. clear_sockbuf(pool);
  2148. applog(LOG_INFO, "Closing socket for stratum pool %d", pool->pool_no);
  2149. mutex_lock(&pool->stratum_lock);
  2150. pool->stratum_active = pool->stratum_notify = false;
  2151. if (pool->stratum_curl) {
  2152. curl_easy_cleanup(pool->stratum_curl);
  2153. }
  2154. pool->stratum_curl = NULL;
  2155. pool->sock = INVSOCK;
  2156. mutex_unlock(&pool->stratum_lock);
  2157. }
  2158. bool initiate_stratum(struct pool *pool)
  2159. {
  2160. bool ret = false, recvd = false, noresume = false, sockd = false;
  2161. char s[RBUFSIZE], *sret = NULL, *nonce1, *sessionid;
  2162. json_t *val = NULL, *res_val, *err_val;
  2163. json_error_t err;
  2164. int n2size;
  2165. resend:
  2166. if (!setup_stratum_curl(pool)) {
  2167. sockd = false;
  2168. goto out;
  2169. }
  2170. sockd = true;
  2171. if (noresume) {
  2172. /* Get rid of any crap lying around if we're resending */
  2173. clear_sock(pool);
  2174. sprintf(s, "{\"id\": %d, \"method\": \"mining.subscribe\", \"params\": []}", swork_id++);
  2175. } else {
  2176. if (pool->sessionid)
  2177. sprintf(s, "{\"id\": %d, \"method\": \"mining.subscribe\", \"params\": [\""PACKAGE"/"VERSION"\", \"%s\"]}", swork_id++, pool->sessionid);
  2178. else
  2179. sprintf(s, "{\"id\": %d, \"method\": \"mining.subscribe\", \"params\": [\""PACKAGE"/"VERSION"\"]}", swork_id++);
  2180. }
  2181. if (!_stratum_send(pool, s, strlen(s), true)) {
  2182. applog(LOG_DEBUG, "Failed to send s in initiate_stratum");
  2183. goto out;
  2184. }
  2185. if (!socket_full(pool, true)) {
  2186. applog(LOG_DEBUG, "Timed out waiting for response in initiate_stratum");
  2187. goto out;
  2188. }
  2189. sret = recv_line(pool);
  2190. if (!sret)
  2191. goto out;
  2192. recvd = true;
  2193. val = JSON_LOADS(sret, &err);
  2194. free(sret);
  2195. if (!val) {
  2196. applog(LOG_INFO, "JSON decode failed(%d): %s", err.line, err.text);
  2197. goto out;
  2198. }
  2199. res_val = json_object_get(val, "result");
  2200. err_val = json_object_get(val, "error");
  2201. if (!res_val || json_is_null(res_val) ||
  2202. (err_val && !json_is_null(err_val))) {
  2203. char *ss;
  2204. if (err_val)
  2205. ss = json_dumps(err_val, JSON_INDENT(3));
  2206. else
  2207. ss = strdup("(unknown reason)");
  2208. applog(LOG_INFO, "JSON-RPC decode failed: %s", ss);
  2209. free(ss);
  2210. goto out;
  2211. }
  2212. sessionid = get_sessionid(res_val);
  2213. if (!sessionid)
  2214. applog(LOG_DEBUG, "Failed to get sessionid in initiate_stratum");
  2215. nonce1 = json_array_string(res_val, 1);
  2216. if (!nonce1) {
  2217. applog(LOG_INFO, "Failed to get nonce1 in initiate_stratum");
  2218. free(sessionid);
  2219. goto out;
  2220. }
  2221. n2size = json_integer_value(json_array_get(res_val, 2));
  2222. if (!n2size) {
  2223. applog(LOG_INFO, "Failed to get n2size in initiate_stratum");
  2224. free(sessionid);
  2225. free(nonce1);
  2226. goto out;
  2227. }
  2228. cg_wlock(&pool->data_lock);
  2229. free(pool->sessionid);
  2230. pool->sessionid = sessionid;
  2231. free(pool->nonce1);
  2232. pool->nonce1 = nonce1;
  2233. pool->n1_len = strlen(nonce1) / 2;
  2234. pool->n2size = n2size;
  2235. pool->nonce2sz = (n2size > sizeof(pool->nonce2)) ? sizeof(pool->nonce2) : n2size;
  2236. #ifdef WORDS_BIGENDIAN
  2237. pool->nonce2off = (n2size < sizeof(pool->nonce2)) ? (sizeof(pool->nonce2) - n2size) : 0;
  2238. #endif
  2239. cg_wunlock(&pool->data_lock);
  2240. if (sessionid)
  2241. applog(LOG_DEBUG, "Pool %d stratum session id: %s", pool->pool_no, pool->sessionid);
  2242. ret = true;
  2243. out:
  2244. if (val)
  2245. json_decref(val);
  2246. if (ret) {
  2247. if (!pool->stratum_url)
  2248. pool->stratum_url = pool->sockaddr_url;
  2249. pool->stratum_active = true;
  2250. pool->swork.diff = 1;
  2251. if (opt_protocol) {
  2252. applog(LOG_DEBUG, "Pool %d confirmed mining.subscribe with extranonce1 %s extran2size %d",
  2253. pool->pool_no, pool->nonce1, pool->n2size);
  2254. }
  2255. } else {
  2256. if (recvd && !noresume) {
  2257. applog(LOG_DEBUG, "Failed to resume stratum, trying afresh");
  2258. noresume = true;
  2259. goto resend;
  2260. }
  2261. applog(LOG_DEBUG, "Initiate stratum failed");
  2262. if (sockd)
  2263. suspend_stratum(pool);
  2264. }
  2265. return ret;
  2266. }
  2267. bool restart_stratum(struct pool *pool)
  2268. {
  2269. if (pool->stratum_active)
  2270. suspend_stratum(pool);
  2271. if (!initiate_stratum(pool))
  2272. return false;
  2273. if (!auth_stratum(pool))
  2274. return false;
  2275. return true;
  2276. }
  2277. void dev_error(struct cgpu_info *dev, enum dev_reason reason)
  2278. {
  2279. dev->device_last_not_well = time(NULL);
  2280. cgtime(&dev->tv_device_last_not_well);
  2281. dev->device_not_well_reason = reason;
  2282. switch (reason) {
  2283. case REASON_THREAD_FAIL_INIT:
  2284. dev->thread_fail_init_count++;
  2285. break;
  2286. case REASON_THREAD_ZERO_HASH:
  2287. dev->thread_zero_hash_count++;
  2288. break;
  2289. case REASON_THREAD_FAIL_QUEUE:
  2290. dev->thread_fail_queue_count++;
  2291. break;
  2292. case REASON_DEV_SICK_IDLE_60:
  2293. dev->dev_sick_idle_60_count++;
  2294. break;
  2295. case REASON_DEV_DEAD_IDLE_600:
  2296. dev->dev_dead_idle_600_count++;
  2297. break;
  2298. case REASON_DEV_NOSTART:
  2299. dev->dev_nostart_count++;
  2300. break;
  2301. case REASON_DEV_OVER_HEAT:
  2302. dev->dev_over_heat_count++;
  2303. break;
  2304. case REASON_DEV_THERMAL_CUTOFF:
  2305. dev->dev_thermal_cutoff_count++;
  2306. break;
  2307. case REASON_DEV_COMMS_ERROR:
  2308. dev->dev_comms_error_count++;
  2309. break;
  2310. case REASON_DEV_THROTTLE:
  2311. dev->dev_throttle_count++;
  2312. break;
  2313. }
  2314. }
  2315. /* Realloc an existing string to fit an extra string s, appending s to it. */
  2316. void *realloc_strcat(char *ptr, char *s)
  2317. {
  2318. size_t old = strlen(ptr), len = strlen(s);
  2319. char *ret;
  2320. if (!len)
  2321. return ptr;
  2322. len += old + 1;
  2323. align_len(&len);
  2324. ret = malloc(len);
  2325. if (unlikely(!ret))
  2326. quit(1, "Failed to malloc in realloc_strcat");
  2327. sprintf(ret, "%s%s", ptr, s);
  2328. free(ptr);
  2329. return ret;
  2330. }
  2331. static
  2332. bool sanechars[] = {
  2333. false, false, false, false, false, false, false, false,
  2334. false, false, false, false, false, false, false, false,
  2335. false, false, false, false, false, false, false, false,
  2336. false, false, false, false, false, false, false, false,
  2337. false, false, false, false, false, false, false, false,
  2338. false, false, false, false, false, false, false, false,
  2339. true , true , true , true , true , true , true , true ,
  2340. true , true , false, false, false, false, false, false,
  2341. false, true , true , true , true , true , true , true ,
  2342. true , true , true , true , true , true , true , true ,
  2343. true , true , true , true , true , true , true , true ,
  2344. true , true , true , false, false, false, false, false,
  2345. false, true , true , true , true , true , true , true ,
  2346. true , true , true , true , true , true , true , true ,
  2347. true , true , true , true , true , true , true , true ,
  2348. true , true , true , false, false, false, false, false,
  2349. };
  2350. char *sanestr(char *o, char *s)
  2351. {
  2352. char *rv = o;
  2353. bool br = false;
  2354. for ( ; s[0]; ++s)
  2355. {
  2356. if (sanechars[s[0] & 0x7f])
  2357. {
  2358. if (br)
  2359. {
  2360. br = false;
  2361. if (s[0] >= '0' && s[0] <= '9')
  2362. (o++)[0] = '_';
  2363. }
  2364. (o++)[0] = s[0];
  2365. }
  2366. else
  2367. if (o != s && o[-1] >= '0' && o[-1] <= '9')
  2368. br = true;
  2369. }
  2370. o[0] = '\0';
  2371. return rv;
  2372. }
  2373. void RenameThread(const char* name)
  2374. {
  2375. #if defined(PR_SET_NAME)
  2376. // Only the first 15 characters are used (16 - NUL terminator)
  2377. prctl(PR_SET_NAME, name, 0, 0, 0);
  2378. #elif defined(__APPLE__)
  2379. pthread_setname_np(name);
  2380. #elif (defined(__FreeBSD__) || defined(__OpenBSD__))
  2381. pthread_set_name_np(pthread_self(), name);
  2382. #else
  2383. // Prevent warnings for unused parameters...
  2384. (void)name;
  2385. #endif
  2386. }
  2387. static pthread_key_t key_bfgtls;
  2388. struct bfgtls_data {
  2389. char *bfg_strerror_result;
  2390. size_t bfg_strerror_resultsz;
  2391. #ifdef WIN32
  2392. LPSTR bfg_strerror_socketresult;
  2393. #endif
  2394. };
  2395. static
  2396. struct bfgtls_data *get_bfgtls()
  2397. {
  2398. struct bfgtls_data *bfgtls = pthread_getspecific(key_bfgtls);
  2399. if (bfgtls)
  2400. return bfgtls;
  2401. void *p;
  2402. bfgtls = malloc(sizeof(*bfgtls));
  2403. if (!bfgtls)
  2404. quit(1, "malloc bfgtls failed");
  2405. p = malloc(64);
  2406. if (!p)
  2407. quit(1, "malloc bfg_strerror_result failed");
  2408. *bfgtls = (struct bfgtls_data){
  2409. .bfg_strerror_resultsz = 64,
  2410. .bfg_strerror_result = p,
  2411. };
  2412. if (pthread_setspecific(key_bfgtls, bfgtls))
  2413. quit(1, "pthread_setspecific failed");
  2414. return bfgtls;
  2415. }
  2416. void bfg_init_threadlocal()
  2417. {
  2418. if (pthread_key_create(&key_bfgtls, NULL))
  2419. quit(1, "pthread_key_create failed");
  2420. }
  2421. static
  2422. bool bfg_grow_buffer(char ** const bufp, size_t * const bufszp, size_t minimum)
  2423. {
  2424. if (minimum <= *bufszp)
  2425. return false;
  2426. while (minimum > *bufszp)
  2427. *bufszp = 2;
  2428. *bufp = realloc(*bufp, *bufszp);
  2429. if (unlikely(!*bufp))
  2430. quit(1, "realloc failed in bfg_grow_buffer");
  2431. return true;
  2432. }
  2433. static
  2434. const char *bfg_strcpy_growing_buffer(char ** const bufp, size_t * const bufszp, const char *src)
  2435. {
  2436. if (!src)
  2437. return NULL;
  2438. const size_t srcsz = strlen(src) + 1;
  2439. bfg_grow_buffer(bufp, bufszp, srcsz);
  2440. memcpy(*bufp, src, srcsz);
  2441. return *bufp;
  2442. }
  2443. // Guaranteed to always return some string (or quit)
  2444. const char *bfg_strerror(int e, enum bfg_strerror_type type)
  2445. {
  2446. static __maybe_unused pthread_mutex_t mutex = PTHREAD_MUTEX_INITIALIZER;
  2447. struct bfgtls_data *bfgtls = get_bfgtls();
  2448. size_t * const bufszp = &bfgtls->bfg_strerror_resultsz;
  2449. char ** const bufp = &bfgtls->bfg_strerror_result;
  2450. const char *have = NULL;
  2451. switch (type) {
  2452. case BST_LIBUSB:
  2453. // NOTE: Nested preprocessor checks since the latter isn't defined at all without the former
  2454. #ifdef HAVE_LIBUSB
  2455. # if HAVE_DECL_LIBUSB_ERROR_NAME
  2456. // libusb makes no guarantees for thread-safety or persistence
  2457. mutex_lock(&mutex);
  2458. have = bfg_strcpy_growing_buffer(bufp, bufszp, libusb_error_name(e));
  2459. mutex_unlock(&mutex);
  2460. # endif
  2461. #endif
  2462. break;
  2463. case BST_SOCKET:
  2464. {
  2465. #ifdef WIN32
  2466. // Windows has a different namespace for socket errors
  2467. LPSTR *msg = &bfgtls->bfg_strerror_socketresult;
  2468. if (*msg)
  2469. LocalFree(*msg);
  2470. if (FormatMessage(FORMAT_MESSAGE_ALLOCATE_BUFFER | FORMAT_MESSAGE_FROM_SYSTEM, 0, e, 0, (LPSTR)msg, 0, 0))
  2471. return *msg;
  2472. *msg = NULL;
  2473. break;
  2474. #endif
  2475. }
  2476. // Fallthru on non-WIN32
  2477. case BST_ERRNO:
  2478. {
  2479. #ifdef __STRERROR_S_WORKS
  2480. // FIXME: Not sure how to get this on MingW64
  2481. retry:
  2482. if (likely(!strerror_s(*bufp, *bufszp, e)))
  2483. {
  2484. if (bfg_grow_buffer(bufp, bufszp, strlen(*bufp) + 2))
  2485. goto retry;
  2486. return *bufp;
  2487. }
  2488. // TODO: XSI strerror_r
  2489. // TODO: GNU strerror_r
  2490. #else
  2491. mutex_lock(&mutex);
  2492. have = bfg_strcpy_growing_buffer(bufp, bufszp, strerror(e));
  2493. mutex_unlock(&mutex);
  2494. #endif
  2495. }
  2496. }
  2497. if (have)
  2498. return *bufp;
  2499. // Failback: Stringify the number
  2500. static const char fmt[] = "%s error #%d", *typestr;
  2501. switch (type) {
  2502. case BST_ERRNO:
  2503. typestr = "System";
  2504. break;
  2505. case BST_SOCKET:
  2506. typestr = "Socket";
  2507. break;
  2508. case BST_LIBUSB:
  2509. typestr = "libusb";
  2510. break;
  2511. default:
  2512. typestr = "Unexpected";
  2513. }
  2514. int sz = snprintf((char*)bfgtls, 0, fmt, typestr, e) + 1;
  2515. bfg_grow_buffer(bufp, bufszp, sz);
  2516. sprintf(*bufp, fmt, typestr, e);
  2517. return *bufp;
  2518. }
  2519. void notifier_init(notifier_t pipefd)
  2520. {
  2521. #ifdef WIN32
  2522. #define WindowsErrorStr(e) bfg_strerror(e, true)
  2523. SOCKET listener, connecter, acceptor;
  2524. listener = socket(AF_INET, SOCK_STREAM, 0);
  2525. if (listener == INVALID_SOCKET)
  2526. quit(1, "Failed to create listener socket in create_notifier: %s", WindowsErrorStr(WSAGetLastError()));
  2527. connecter = socket(AF_INET, SOCK_STREAM, 0);
  2528. if (connecter == INVALID_SOCKET)
  2529. quit(1, "Failed to create connect socket in create_notifier: %s", WindowsErrorStr(WSAGetLastError()));
  2530. struct sockaddr_in inaddr = {
  2531. .sin_family = AF_INET,
  2532. .sin_addr = {
  2533. .s_addr = htonl(INADDR_LOOPBACK),
  2534. },
  2535. .sin_port = 0,
  2536. };
  2537. {
  2538. char reuse = 1;
  2539. setsockopt(listener, SOL_SOCKET, SO_REUSEADDR, &reuse, sizeof(reuse));
  2540. }
  2541. if (bind(listener, (struct sockaddr*)&inaddr, sizeof(inaddr)) == SOCKET_ERROR)
  2542. quit(1, "Failed to bind listener socket in create_notifier: %s", WindowsErrorStr(WSAGetLastError()));
  2543. socklen_t inaddr_sz = sizeof(inaddr);
  2544. if (getsockname(listener, (struct sockaddr*)&inaddr, &inaddr_sz) == SOCKET_ERROR)
  2545. quit(1, "Failed to getsockname in create_notifier: %s", WindowsErrorStr(WSAGetLastError()));
  2546. if (listen(listener, 1) == SOCKET_ERROR)
  2547. quit(1, "Failed to listen in create_notifier: %s", WindowsErrorStr(WSAGetLastError()));
  2548. inaddr.sin_family = AF_INET;
  2549. inaddr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
  2550. if (connect(connecter, (struct sockaddr*)&inaddr, inaddr_sz) == SOCKET_ERROR)
  2551. quit(1, "Failed to connect in create_notifier: %s", WindowsErrorStr(WSAGetLastError()));
  2552. acceptor = accept(listener, NULL, NULL);
  2553. if (acceptor == INVALID_SOCKET)
  2554. quit(1, "Failed to accept in create_notifier: %s", WindowsErrorStr(WSAGetLastError()));
  2555. closesocket(listener);
  2556. pipefd[0] = connecter;
  2557. pipefd[1] = acceptor;
  2558. #else
  2559. if (pipe(pipefd))
  2560. quit(1, "Failed to create pipe in create_notifier");
  2561. #endif
  2562. }
  2563. void notifier_wake(notifier_t fd)
  2564. {
  2565. if (fd[1] == INVSOCK)
  2566. return;
  2567. #ifdef WIN32
  2568. (void)send(fd[1], "\0", 1, 0);
  2569. #else
  2570. (void)write(fd[1], "\0", 1);
  2571. #endif
  2572. }
  2573. void notifier_read(notifier_t fd)
  2574. {
  2575. char buf[0x10];
  2576. #ifdef WIN32
  2577. (void)recv(fd[0], buf, sizeof(buf), 0);
  2578. #else
  2579. (void)read(fd[0], buf, sizeof(buf));
  2580. #endif
  2581. }
  2582. void notifier_destroy(notifier_t fd)
  2583. {
  2584. #ifdef WIN32
  2585. closesocket(fd[0]);
  2586. closesocket(fd[1]);
  2587. #else
  2588. close(fd[0]);
  2589. close(fd[1]);
  2590. #endif
  2591. fd[0] = fd[1] = INVSOCK;
  2592. }
  2593. void _bytes_alloc_failure(size_t sz)
  2594. {
  2595. quit(1, "bytes_resize failed to allocate %lu bytes", (unsigned long)sz);
  2596. }