util.c 92 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774
  1. /*
  2. * Copyright 2011-2014 Con Kolivas
  3. * Copyright 2011-2014 Luke Dashjr
  4. * Copyright 2014 Nate Woolls
  5. * Copyright 2010-2011 Jeff Garzik
  6. * Copyright 2012 Giel van Schijndel
  7. * Copyright 2012 Gavin Andresen
  8. * Copyright 2013 Lingchao Xu
  9. *
  10. * This program is free software; you can redistribute it and/or modify it
  11. * under the terms of the GNU General Public License as published by the Free
  12. * Software Foundation; either version 3 of the License, or (at your option)
  13. * any later version. See COPYING for more details.
  14. */
  15. #include "config.h"
  16. #include <math.h>
  17. #include <stdbool.h>
  18. #include <stdint.h>
  19. #include <stdio.h>
  20. #include <stdlib.h>
  21. #include <ctype.h>
  22. #include <stdarg.h>
  23. #include <string.h>
  24. #include <pthread.h>
  25. #include <jansson.h>
  26. #include <curl/curl.h>
  27. #include <time.h>
  28. #include <errno.h>
  29. #include <unistd.h>
  30. #include <sys/types.h>
  31. #ifdef HAVE_SYS_PRCTL_H
  32. # include <sys/prctl.h>
  33. #endif
  34. #if defined(__FreeBSD__) || defined(__OpenBSD__)
  35. # include <pthread_np.h>
  36. #endif
  37. #ifndef WIN32
  38. #include <fcntl.h>
  39. # ifdef __linux
  40. # include <sys/prctl.h>
  41. # endif
  42. # include <sys/socket.h>
  43. # include <netinet/in.h>
  44. # include <netinet/tcp.h>
  45. # include <netdb.h>
  46. #else
  47. # include <windows.h>
  48. # include <winsock2.h>
  49. # include <mstcpip.h>
  50. # include <ws2tcpip.h>
  51. # include <mmsystem.h>
  52. #endif
  53. #include <utlist.h>
  54. #ifdef NEED_BFG_LOWL_VCOM
  55. #include "lowl-vcom.h"
  56. #endif
  57. #include "miner.h"
  58. #include "compat.h"
  59. #include "util.h"
  60. #include "version.h"
  61. #define DEFAULT_SOCKWAIT 60
  62. bool successful_connect = false;
  63. struct timeval nettime;
  64. struct data_buffer {
  65. void *buf;
  66. size_t len;
  67. curl_socket_t *idlemarker;
  68. };
  69. struct upload_buffer {
  70. const void *buf;
  71. size_t len;
  72. };
  73. struct header_info {
  74. char *lp_path;
  75. int rolltime;
  76. char *reason;
  77. char *stratum_url;
  78. bool hadrolltime;
  79. bool canroll;
  80. bool hadexpire;
  81. };
  82. struct tq_ent {
  83. void *data;
  84. struct tq_ent *prev;
  85. struct tq_ent *next;
  86. };
  87. static void databuf_free(struct data_buffer *db)
  88. {
  89. if (!db)
  90. return;
  91. free(db->buf);
  92. #ifdef DEBUG_DATABUF
  93. applog(LOG_DEBUG, "databuf_free(%p)", db->buf);
  94. #endif
  95. memset(db, 0, sizeof(*db));
  96. }
  97. struct json_rpc_call_state {
  98. struct data_buffer all_data;
  99. struct header_info hi;
  100. void *priv;
  101. char curl_err_str[CURL_ERROR_SIZE];
  102. struct curl_slist *headers;
  103. struct upload_buffer upload_data;
  104. struct pool *pool;
  105. bool longpoll;
  106. };
  107. // aka data_buffer_write
  108. static size_t all_data_cb(const void *ptr, size_t size, size_t nmemb,
  109. void *user_data)
  110. {
  111. struct data_buffer *db = user_data;
  112. size_t oldlen, newlen;
  113. oldlen = db->len;
  114. if (unlikely(nmemb == 0 || size == 0 || oldlen >= SIZE_MAX - size))
  115. return 0;
  116. if (unlikely(nmemb > (SIZE_MAX - oldlen) / size))
  117. nmemb = (SIZE_MAX - oldlen) / size;
  118. size_t len = size * nmemb;
  119. void *newmem;
  120. static const unsigned char zero = 0;
  121. if (db->idlemarker) {
  122. const unsigned char *cptr = ptr;
  123. for (size_t i = 0; i < len; ++i)
  124. if (!(isCspace(cptr[i]) || cptr[i] == '{')) {
  125. *db->idlemarker = CURL_SOCKET_BAD;
  126. db->idlemarker = NULL;
  127. break;
  128. }
  129. }
  130. newlen = oldlen + len;
  131. newmem = realloc(db->buf, newlen + 1);
  132. #ifdef DEBUG_DATABUF
  133. applog(LOG_DEBUG, "data_buffer_write realloc(%p, %lu) => %p", db->buf, (long unsigned)(newlen + 1), newmem);
  134. #endif
  135. if (!newmem)
  136. return 0;
  137. db->buf = newmem;
  138. db->len = newlen;
  139. memcpy(db->buf + oldlen, ptr, len);
  140. memcpy(db->buf + newlen, &zero, 1); /* null terminate */
  141. return nmemb;
  142. }
  143. static size_t upload_data_cb(void *ptr, size_t size, size_t nmemb,
  144. void *user_data)
  145. {
  146. struct json_rpc_call_state * const state = user_data;
  147. struct upload_buffer * const ub = &state->upload_data;
  148. unsigned int len = size * nmemb;
  149. if (state->longpoll)
  150. {
  151. struct pool * const pool = state->pool;
  152. pool->lp_active = true;
  153. }
  154. if (len > ub->len)
  155. len = ub->len;
  156. if (len) {
  157. memcpy(ptr, ub->buf, len);
  158. ub->buf += len;
  159. ub->len -= len;
  160. }
  161. return len;
  162. }
  163. static size_t resp_hdr_cb(void *ptr, size_t size, size_t nmemb, void *user_data)
  164. {
  165. struct header_info *hi = user_data;
  166. size_t remlen, slen, ptrlen = size * nmemb;
  167. char *rem, *val = NULL, *key = NULL;
  168. void *tmp;
  169. val = calloc(1, ptrlen);
  170. key = calloc(1, ptrlen);
  171. if (!key || !val)
  172. goto out;
  173. tmp = memchr(ptr, ':', ptrlen);
  174. if (!tmp || (tmp == ptr)) /* skip empty keys / blanks */
  175. goto out;
  176. slen = tmp - ptr;
  177. if ((slen + 1) == ptrlen) /* skip key w/ no value */
  178. goto out;
  179. memcpy(key, ptr, slen); /* store & nul term key */
  180. key[slen] = 0;
  181. rem = ptr + slen + 1; /* trim value's leading whitespace */
  182. remlen = ptrlen - slen - 1;
  183. while ((remlen > 0) && (isCspace(*rem))) {
  184. remlen--;
  185. rem++;
  186. }
  187. memcpy(val, rem, remlen); /* store value, trim trailing ws */
  188. val[remlen] = 0;
  189. while ((*val) && (isCspace(val[strlen(val) - 1])))
  190. val[strlen(val) - 1] = 0;
  191. if (!*val) /* skip blank value */
  192. goto out;
  193. if (opt_protocol)
  194. applog(LOG_DEBUG, "HTTP hdr(%s): %s", key, val);
  195. if (!strcasecmp("X-Roll-Ntime", key)) {
  196. hi->hadrolltime = true;
  197. if (!strncasecmp("N", val, 1))
  198. applog(LOG_DEBUG, "X-Roll-Ntime: N found");
  199. else {
  200. hi->canroll = true;
  201. /* Check to see if expire= is supported and if not, set
  202. * the rolltime to the default scantime */
  203. if (strlen(val) > 7 && !strncasecmp("expire=", val, 7)) {
  204. sscanf(val + 7, "%d", &hi->rolltime);
  205. hi->hadexpire = true;
  206. } else
  207. hi->rolltime = opt_scantime;
  208. applog(LOG_DEBUG, "X-Roll-Ntime expiry set to %d", hi->rolltime);
  209. }
  210. }
  211. if (!strcasecmp("X-Long-Polling", key)) {
  212. hi->lp_path = val; /* steal memory reference */
  213. val = NULL;
  214. }
  215. if (!strcasecmp("X-Reject-Reason", key)) {
  216. hi->reason = val; /* steal memory reference */
  217. val = NULL;
  218. }
  219. if (!strcasecmp("X-Stratum", key)) {
  220. hi->stratum_url = val;
  221. val = NULL;
  222. }
  223. out:
  224. free(key);
  225. free(val);
  226. return ptrlen;
  227. }
  228. static int keep_sockalive(SOCKETTYPE fd)
  229. {
  230. const int tcp_one = 1;
  231. const int tcp_keepidle = 45;
  232. const int tcp_keepintvl = 30;
  233. int ret = 0;
  234. if (unlikely(setsockopt(fd, SOL_SOCKET, SO_KEEPALIVE, (const char *)&tcp_one, sizeof(tcp_one))))
  235. ret = 1;
  236. #ifndef WIN32
  237. int flags = fcntl(fd, F_GETFL, 0);
  238. fcntl(fd, F_SETFL, O_NONBLOCK | flags);
  239. #else
  240. u_long flags = 1;
  241. ioctlsocket(fd, FIONBIO, &flags);
  242. #endif
  243. if (!opt_delaynet)
  244. #ifndef __linux
  245. if (unlikely(setsockopt(fd, IPPROTO_TCP, TCP_NODELAY, (const void *)&tcp_one, sizeof(tcp_one))))
  246. #else /* __linux */
  247. if (unlikely(setsockopt(fd, SOL_TCP, TCP_NODELAY, (const void *)&tcp_one, sizeof(tcp_one))))
  248. #endif /* __linux */
  249. ret = 1;
  250. #ifdef __linux
  251. if (unlikely(setsockopt(fd, SOL_TCP, TCP_KEEPCNT, &tcp_one, sizeof(tcp_one))))
  252. ret = 1;
  253. if (unlikely(setsockopt(fd, SOL_TCP, TCP_KEEPIDLE, &tcp_keepidle, sizeof(tcp_keepidle))))
  254. ret = 1;
  255. if (unlikely(setsockopt(fd, SOL_TCP, TCP_KEEPINTVL, &tcp_keepintvl, sizeof(tcp_keepintvl))))
  256. ret = 1;
  257. #endif /* __linux */
  258. #ifdef __APPLE_CC__
  259. if (unlikely(setsockopt(fd, IPPROTO_TCP, TCP_KEEPALIVE, &tcp_keepintvl, sizeof(tcp_keepintvl))))
  260. ret = 1;
  261. #endif /* __APPLE_CC__ */
  262. #ifdef WIN32
  263. const int zero = 0;
  264. struct tcp_keepalive vals;
  265. vals.onoff = 1;
  266. vals.keepalivetime = tcp_keepidle * 1000;
  267. vals.keepaliveinterval = tcp_keepintvl * 1000;
  268. DWORD outputBytes;
  269. if (unlikely(WSAIoctl(fd, SIO_KEEPALIVE_VALS, &vals, sizeof(vals), NULL, 0, &outputBytes, NULL, NULL)))
  270. ret = 1;
  271. /* Windows happily submits indefinitely to the send buffer blissfully
  272. * unaware nothing is getting there without gracefully failing unless
  273. * we disable the send buffer */
  274. if (unlikely(setsockopt(fd, SOL_SOCKET, SO_SNDBUF, (const char *)&zero, sizeof(zero))))
  275. ret = 1;
  276. #endif /* WIN32 */
  277. return ret;
  278. }
  279. void set_cloexec_socket(SOCKETTYPE sock, const bool cloexec)
  280. {
  281. #ifdef WIN32
  282. SetHandleInformation((HANDLE)sock, HANDLE_FLAG_INHERIT, cloexec ? 0 : HANDLE_FLAG_INHERIT);
  283. #elif defined(F_GETFD) && defined(F_SETFD) && defined(O_CLOEXEC)
  284. const int curflags = fcntl(sock, F_GETFD);
  285. int flags = curflags;
  286. if (cloexec)
  287. flags |= FD_CLOEXEC;
  288. else
  289. flags &= ~FD_CLOEXEC;
  290. if (flags != curflags)
  291. fcntl(sock, F_SETFD, flags);
  292. #endif
  293. }
  294. int json_rpc_call_sockopt_cb(void __maybe_unused *userdata, curl_socket_t fd,
  295. curlsocktype __maybe_unused purpose)
  296. {
  297. return keep_sockalive(fd);
  298. }
  299. static void last_nettime(struct timeval *last)
  300. {
  301. rd_lock(&netacc_lock);
  302. last->tv_sec = nettime.tv_sec;
  303. last->tv_usec = nettime.tv_usec;
  304. rd_unlock(&netacc_lock);
  305. }
  306. static void set_nettime(void)
  307. {
  308. wr_lock(&netacc_lock);
  309. cgtime(&nettime);
  310. wr_unlock(&netacc_lock);
  311. }
  312. static int curl_debug_cb(__maybe_unused CURL *handle, curl_infotype type,
  313. char *data, size_t size,
  314. void *userdata)
  315. {
  316. struct pool *pool = (struct pool *)userdata;
  317. switch(type) {
  318. case CURLINFO_HEADER_IN:
  319. case CURLINFO_DATA_IN:
  320. case CURLINFO_SSL_DATA_IN:
  321. pool->cgminer_pool_stats.bytes_received += size;
  322. total_bytes_rcvd += size;
  323. pool->cgminer_pool_stats.net_bytes_received += size;
  324. break;
  325. case CURLINFO_HEADER_OUT:
  326. case CURLINFO_DATA_OUT:
  327. case CURLINFO_SSL_DATA_OUT:
  328. pool->cgminer_pool_stats.bytes_sent += size;
  329. total_bytes_sent += size;
  330. pool->cgminer_pool_stats.net_bytes_sent += size;
  331. break;
  332. case CURLINFO_TEXT:
  333. {
  334. if (!opt_protocol)
  335. break;
  336. // data is not null-terminated, so we need to copy and terminate it for applog
  337. char datacp[size + 1];
  338. memcpy(datacp, data, size);
  339. while (likely(size) && unlikely(isCspace(datacp[size-1])))
  340. --size;
  341. if (unlikely(!size))
  342. break;
  343. datacp[size] = '\0';
  344. applog(LOG_DEBUG, "Pool %u: %s", pool->pool_no, datacp);
  345. break;
  346. }
  347. default:
  348. break;
  349. }
  350. return 0;
  351. }
  352. void json_rpc_call_async(CURL *curl, const char *url,
  353. const char *userpass, const char *rpc_req,
  354. bool longpoll,
  355. struct pool *pool, bool share,
  356. void *priv)
  357. {
  358. struct json_rpc_call_state *state = malloc(sizeof(struct json_rpc_call_state));
  359. *state = (struct json_rpc_call_state){
  360. .priv = priv,
  361. .pool = pool,
  362. };
  363. long timeout = longpoll ? (60 * 60) : 60;
  364. char len_hdr[64], user_agent_hdr[128];
  365. struct curl_slist *headers = NULL;
  366. if (longpoll)
  367. {
  368. state->all_data.idlemarker = &pool->lp_socket;
  369. state->longpoll = true;
  370. }
  371. /* it is assumed that 'curl' is freshly [re]initialized at this pt */
  372. curl_easy_setopt(curl, CURLOPT_PRIVATE, state);
  373. curl_easy_setopt(curl, CURLOPT_TIMEOUT, timeout);
  374. /* We use DEBUGFUNCTION to count bytes sent/received, and verbose is needed
  375. * to enable it */
  376. curl_easy_setopt(curl, CURLOPT_DEBUGFUNCTION, curl_debug_cb);
  377. curl_easy_setopt(curl, CURLOPT_DEBUGDATA, (void *)pool);
  378. curl_easy_setopt(curl, CURLOPT_VERBOSE, 1);
  379. curl_easy_setopt(curl, CURLOPT_NOSIGNAL, 1);
  380. curl_easy_setopt(curl, CURLOPT_URL, url);
  381. curl_easy_setopt(curl, CURLOPT_ENCODING, "");
  382. curl_easy_setopt(curl, CURLOPT_FAILONERROR, 1);
  383. /* Shares are staggered already and delays in submission can be costly
  384. * so do not delay them */
  385. if (!opt_delaynet || share)
  386. curl_easy_setopt(curl, CURLOPT_TCP_NODELAY, 1);
  387. curl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, all_data_cb);
  388. curl_easy_setopt(curl, CURLOPT_WRITEDATA, &state->all_data);
  389. curl_easy_setopt(curl, CURLOPT_READFUNCTION, upload_data_cb);
  390. curl_easy_setopt(curl, CURLOPT_READDATA, state);
  391. curl_easy_setopt(curl, CURLOPT_ERRORBUFFER, &state->curl_err_str[0]);
  392. curl_easy_setopt(curl, CURLOPT_FOLLOWLOCATION, 1);
  393. curl_easy_setopt(curl, CURLOPT_HEADERFUNCTION, resp_hdr_cb);
  394. curl_easy_setopt(curl, CURLOPT_HEADERDATA, &state->hi);
  395. curl_easy_setopt(curl, CURLOPT_USE_SSL, CURLUSESSL_TRY);
  396. if (pool->rpc_proxy) {
  397. curl_easy_setopt(curl, CURLOPT_PROXY, pool->rpc_proxy);
  398. } else if (opt_socks_proxy) {
  399. curl_easy_setopt(curl, CURLOPT_PROXY, opt_socks_proxy);
  400. curl_easy_setopt(curl, CURLOPT_PROXYTYPE, CURLPROXY_SOCKS5);
  401. }
  402. if (userpass) {
  403. curl_easy_setopt(curl, CURLOPT_USERPWD, userpass);
  404. curl_easy_setopt(curl, CURLOPT_HTTPAUTH, CURLAUTH_BASIC);
  405. }
  406. if (longpoll)
  407. curl_easy_setopt(curl, CURLOPT_SOCKOPTFUNCTION, json_rpc_call_sockopt_cb);
  408. curl_easy_setopt(curl, CURLOPT_POST, 1);
  409. if (opt_protocol)
  410. applog(LOG_DEBUG, "JSON protocol request:\n%s", rpc_req);
  411. state->upload_data.buf = rpc_req;
  412. state->upload_data.len = strlen(rpc_req);
  413. sprintf(len_hdr, "Content-Length: %lu",
  414. (unsigned long) state->upload_data.len);
  415. sprintf(user_agent_hdr, "User-Agent: %s", PACKAGE"/"VERSION);
  416. headers = curl_slist_append(headers,
  417. "Content-type: application/json");
  418. headers = curl_slist_append(headers,
  419. "X-Mining-Extensions: longpoll midstate rollntime submitold");
  420. if (longpoll)
  421. headers = curl_slist_append(headers,
  422. "X-Minimum-Wait: 0");
  423. if (likely(global_hashrate)) {
  424. char ghashrate[255];
  425. sprintf(ghashrate, "X-Mining-Hashrate: %"PRIu64, (uint64_t)global_hashrate);
  426. headers = curl_slist_append(headers, ghashrate);
  427. }
  428. headers = curl_slist_append(headers, len_hdr);
  429. headers = curl_slist_append(headers, user_agent_hdr);
  430. headers = curl_slist_append(headers, "Expect:"); /* disable Expect hdr*/
  431. curl_easy_setopt(curl, CURLOPT_HTTPHEADER, headers);
  432. state->headers = headers;
  433. if (opt_delaynet) {
  434. /* Don't delay share submission, but still track the nettime */
  435. if (!share) {
  436. long long now_msecs, last_msecs;
  437. struct timeval now, last;
  438. cgtime(&now);
  439. last_nettime(&last);
  440. now_msecs = (long long)now.tv_sec * 1000;
  441. now_msecs += now.tv_usec / 1000;
  442. last_msecs = (long long)last.tv_sec * 1000;
  443. last_msecs += last.tv_usec / 1000;
  444. if (now_msecs > last_msecs && now_msecs - last_msecs < 250) {
  445. struct timespec rgtp;
  446. rgtp.tv_sec = 0;
  447. rgtp.tv_nsec = (250 - (now_msecs - last_msecs)) * 1000000;
  448. nanosleep(&rgtp, NULL);
  449. }
  450. }
  451. set_nettime();
  452. }
  453. }
  454. json_t *json_rpc_call_completed(CURL *curl, int rc, bool probe, int *rolltime, void *out_priv)
  455. {
  456. struct json_rpc_call_state *state;
  457. if (curl_easy_getinfo(curl, CURLINFO_PRIVATE, (void*)&state) != CURLE_OK) {
  458. applog(LOG_ERR, "Failed to get private curl data");
  459. if (out_priv)
  460. *(void**)out_priv = NULL;
  461. goto err_out;
  462. }
  463. if (out_priv)
  464. *(void**)out_priv = state->priv;
  465. json_t *val, *err_val, *res_val;
  466. json_error_t err;
  467. struct pool *pool = state->pool;
  468. bool probing = probe && !pool->probed;
  469. if (rc) {
  470. applog(LOG_INFO, "HTTP request failed: %s", state->curl_err_str);
  471. goto err_out;
  472. }
  473. if (!state->all_data.buf) {
  474. applog(LOG_DEBUG, "Empty data received in json_rpc_call.");
  475. goto err_out;
  476. }
  477. pool->cgminer_pool_stats.times_sent++;
  478. pool->cgminer_pool_stats.times_received++;
  479. if (probing) {
  480. pool->probed = true;
  481. /* If X-Long-Polling was found, activate long polling */
  482. if (state->hi.lp_path) {
  483. if (pool->hdr_path != NULL)
  484. free(pool->hdr_path);
  485. pool->hdr_path = state->hi.lp_path;
  486. } else
  487. pool->hdr_path = NULL;
  488. if (state->hi.stratum_url) {
  489. pool->stratum_url = state->hi.stratum_url;
  490. state->hi.stratum_url = NULL;
  491. }
  492. } else {
  493. if (state->hi.lp_path) {
  494. free(state->hi.lp_path);
  495. state->hi.lp_path = NULL;
  496. }
  497. if (state->hi.stratum_url) {
  498. free(state->hi.stratum_url);
  499. state->hi.stratum_url = NULL;
  500. }
  501. }
  502. if (pool->force_rollntime)
  503. {
  504. state->hi.canroll = true;
  505. state->hi.hadexpire = true;
  506. state->hi.rolltime = pool->force_rollntime;
  507. }
  508. if (rolltime)
  509. *rolltime = state->hi.rolltime;
  510. pool->cgminer_pool_stats.rolltime = state->hi.rolltime;
  511. pool->cgminer_pool_stats.hadrolltime = state->hi.hadrolltime;
  512. pool->cgminer_pool_stats.canroll = state->hi.canroll;
  513. pool->cgminer_pool_stats.hadexpire = state->hi.hadexpire;
  514. val = JSON_LOADS(state->all_data.buf, &err);
  515. if (!val) {
  516. applog(LOG_INFO, "JSON decode failed(%d): %s", err.line, err.text);
  517. if (opt_protocol)
  518. applog(LOG_DEBUG, "JSON protocol response:\n%s", (char*)state->all_data.buf);
  519. goto err_out;
  520. }
  521. if (opt_protocol) {
  522. char *s = json_dumps(val, JSON_INDENT(3));
  523. applog(LOG_DEBUG, "JSON protocol response:\n%s", s);
  524. free(s);
  525. }
  526. /* JSON-RPC valid response returns a non-null 'result',
  527. * and a null 'error'.
  528. */
  529. res_val = json_object_get(val, "result");
  530. err_val = json_object_get(val, "error");
  531. if (!res_val ||(err_val && !json_is_null(err_val))) {
  532. char *s;
  533. if (err_val)
  534. s = json_dumps(err_val, JSON_INDENT(3));
  535. else
  536. s = strdup("(unknown reason)");
  537. applog(LOG_INFO, "JSON-RPC call failed: %s", s);
  538. free(s);
  539. json_decref(val);
  540. goto err_out;
  541. }
  542. if (state->hi.reason) {
  543. json_object_set_new(val, "reject-reason", json_string(state->hi.reason));
  544. free(state->hi.reason);
  545. state->hi.reason = NULL;
  546. }
  547. successful_connect = true;
  548. databuf_free(&state->all_data);
  549. curl_slist_free_all(state->headers);
  550. curl_easy_reset(curl);
  551. free(state);
  552. return val;
  553. err_out:
  554. databuf_free(&state->all_data);
  555. curl_slist_free_all(state->headers);
  556. curl_easy_reset(curl);
  557. if (!successful_connect)
  558. applog(LOG_DEBUG, "Failed to connect in json_rpc_call");
  559. curl_easy_setopt(curl, CURLOPT_FRESH_CONNECT, 1);
  560. free(state);
  561. return NULL;
  562. }
  563. json_t *json_rpc_call(CURL *curl, const char *url,
  564. const char *userpass, const char *rpc_req,
  565. bool probe, bool longpoll, int *rolltime,
  566. struct pool *pool, bool share)
  567. {
  568. json_rpc_call_async(curl, url, userpass, rpc_req, longpoll, pool, share, NULL);
  569. int rc = curl_easy_perform(curl);
  570. return json_rpc_call_completed(curl, rc, probe, rolltime, NULL);
  571. }
  572. bool our_curl_supports_proxy_uris()
  573. {
  574. curl_version_info_data *data = curl_version_info(CURLVERSION_NOW);
  575. return data->age && data->version_num >= (( 7 <<16)|( 21 <<8)| 7); // 7.21.7
  576. }
  577. // NOTE: This assumes reference URI is a root
  578. char *absolute_uri(char *uri, const char *ref)
  579. {
  580. if (strstr(uri, "://"))
  581. return strdup(uri);
  582. char *copy_start, *abs;
  583. bool need_slash = false;
  584. copy_start = (uri[0] == '/') ? &uri[1] : uri;
  585. if (ref[strlen(ref) - 1] != '/')
  586. need_slash = true;
  587. abs = malloc(strlen(ref) + strlen(copy_start) + 2);
  588. if (!abs) {
  589. applog(LOG_ERR, "Malloc failure in absolute_uri");
  590. return NULL;
  591. }
  592. sprintf(abs, "%s%s%s", ref, need_slash ? "/" : "", copy_start);
  593. return abs;
  594. }
  595. static const char _hexchars[0x10] = "0123456789abcdef";
  596. void bin2hex(char *out, const void *in, size_t len)
  597. {
  598. const unsigned char *p = in;
  599. while (len--)
  600. {
  601. (out++)[0] = _hexchars[p[0] >> 4];
  602. (out++)[0] = _hexchars[p[0] & 0xf];
  603. ++p;
  604. }
  605. out[0] = '\0';
  606. }
  607. static inline
  608. int _hex2bin_char(const char c)
  609. {
  610. if (c >= '0' && c <= '9')
  611. return c - '0';
  612. if (c >= 'a' && c <= 'f')
  613. return (c - 'a') + 10;
  614. if (c >= 'A' && c <= 'F')
  615. return (c - 'A') + 10;
  616. return -1;
  617. }
  618. /* Does the reverse of bin2hex but does not allocate any ram */
  619. bool hex2bin(unsigned char *p, const char *hexstr, size_t len)
  620. {
  621. int n, o;
  622. while (len--)
  623. {
  624. n = _hex2bin_char((hexstr++)[0]);
  625. if (unlikely(n == -1))
  626. {
  627. badchar:
  628. if (!hexstr[-1])
  629. applog(LOG_ERR, "hex2bin: str truncated");
  630. else
  631. applog(LOG_ERR, "hex2bin: invalid character 0x%02x", (int)hexstr[-1]);
  632. return false;
  633. }
  634. o = _hex2bin_char((hexstr++)[0]);
  635. if (unlikely(o == -1))
  636. goto badchar;
  637. (p++)[0] = (n << 4) | o;
  638. }
  639. return likely(!hexstr[0]);
  640. }
  641. size_t ucs2_to_utf8(char * const out, const uint16_t * const in, const size_t sz)
  642. {
  643. uint8_t *p = (void*)out;
  644. for (int i = 0; i < sz; ++i)
  645. {
  646. const uint16_t c = in[i];
  647. if (c < 0x80)
  648. p++[0] = c;
  649. else
  650. {
  651. if (c < 0x800)
  652. p++[0] = 0xc0 | (c >> 6);
  653. else
  654. {
  655. p++[0] = 0xe0 | (c >> 12);
  656. p++[0] = 0x80 | ((c >> 6) & 0x3f);
  657. }
  658. p++[0] = 0x80 | (c & 0x3f);
  659. }
  660. }
  661. return p - (uint8_t*)(void*)out;
  662. }
  663. char *ucs2_to_utf8_dup(uint16_t * const in, size_t sz)
  664. {
  665. char * const out = malloc((sz * 4) + 1);
  666. sz = ucs2_to_utf8(out, in, sz);
  667. out[sz] = '\0';
  668. return out;
  669. }
  670. void hash_data(unsigned char *out_hash, const unsigned char *data)
  671. {
  672. unsigned char blkheader[80];
  673. // 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
  674. swap32yes(blkheader, data, 80 / 4);
  675. // double-SHA256 to get the block hash
  676. gen_hash(blkheader, out_hash, 80);
  677. }
  678. // Example output: 0000000000000000000000000000000000000000000000000000ffff00000000 (bdiff 1)
  679. void real_block_target(unsigned char *target, const unsigned char *data)
  680. {
  681. uint8_t targetshift;
  682. if (unlikely(data[72] < 3 || data[72] > 0x20))
  683. {
  684. // Invalid (out of bounds) target
  685. memset(target, 0xff, 32);
  686. return;
  687. }
  688. targetshift = data[72] - 3;
  689. memset(target, 0, targetshift);
  690. target[targetshift++] = data[75];
  691. target[targetshift++] = data[74];
  692. target[targetshift++] = data[73];
  693. memset(&target[targetshift], 0, 0x20 - targetshift);
  694. }
  695. bool hash_target_check(const unsigned char *hash, const unsigned char *target)
  696. {
  697. const uint32_t *h32 = (uint32_t*)&hash[0];
  698. const uint32_t *t32 = (uint32_t*)&target[0];
  699. for (int i = 7; i >= 0; --i) {
  700. uint32_t h32i = le32toh(h32[i]);
  701. uint32_t t32i = le32toh(t32[i]);
  702. if (h32i > t32i)
  703. return false;
  704. if (h32i < t32i)
  705. return true;
  706. }
  707. return true;
  708. }
  709. bool hash_target_check_v(const unsigned char *hash, const unsigned char *target)
  710. {
  711. bool rc;
  712. rc = hash_target_check(hash, target);
  713. if (opt_debug) {
  714. unsigned char hash_swap[32], target_swap[32];
  715. char hash_str[65];
  716. char target_str[65];
  717. for (int i = 0; i < 32; ++i) {
  718. hash_swap[i] = hash[31-i];
  719. target_swap[i] = target[31-i];
  720. }
  721. bin2hex(hash_str, hash_swap, 32);
  722. bin2hex(target_str, target_swap, 32);
  723. applog(LOG_DEBUG, " Proof: %s\nTarget: %s\nTrgVal? %s",
  724. hash_str,
  725. target_str,
  726. rc ? "YES (hash <= target)" :
  727. "no (false positive; hash > target)");
  728. }
  729. return rc;
  730. }
  731. // This operates on a native-endian SHA256 state
  732. // In other words, on little endian platforms, every 4 bytes are in reverse order
  733. bool fulltest(const unsigned char *hash, const unsigned char *target)
  734. {
  735. unsigned char hash2[32];
  736. swap32tobe(hash2, hash, 32 / 4);
  737. return hash_target_check_v(hash2, target);
  738. }
  739. struct thread_q *tq_new(void)
  740. {
  741. struct thread_q *tq;
  742. tq = calloc(1, sizeof(*tq));
  743. if (!tq)
  744. return NULL;
  745. pthread_mutex_init(&tq->mutex, NULL);
  746. pthread_cond_init(&tq->cond, NULL);
  747. return tq;
  748. }
  749. void tq_free(struct thread_q *tq)
  750. {
  751. struct tq_ent *ent, *iter;
  752. if (!tq)
  753. return;
  754. DL_FOREACH_SAFE(tq->q, ent, iter) {
  755. DL_DELETE(tq->q, ent);
  756. free(ent);
  757. }
  758. pthread_cond_destroy(&tq->cond);
  759. pthread_mutex_destroy(&tq->mutex);
  760. memset(tq, 0, sizeof(*tq)); /* poison */
  761. free(tq);
  762. }
  763. static void tq_freezethaw(struct thread_q *tq, bool frozen)
  764. {
  765. mutex_lock(&tq->mutex);
  766. tq->frozen = frozen;
  767. pthread_cond_signal(&tq->cond);
  768. mutex_unlock(&tq->mutex);
  769. }
  770. void tq_freeze(struct thread_q *tq)
  771. {
  772. tq_freezethaw(tq, true);
  773. }
  774. void tq_thaw(struct thread_q *tq)
  775. {
  776. tq_freezethaw(tq, false);
  777. }
  778. bool tq_push(struct thread_q *tq, void *data)
  779. {
  780. struct tq_ent *ent;
  781. bool rc = true;
  782. ent = calloc(1, sizeof(*ent));
  783. if (!ent)
  784. return false;
  785. ent->data = data;
  786. mutex_lock(&tq->mutex);
  787. if (!tq->frozen) {
  788. DL_APPEND(tq->q, ent);
  789. } else {
  790. free(ent);
  791. rc = false;
  792. }
  793. pthread_cond_signal(&tq->cond);
  794. mutex_unlock(&tq->mutex);
  795. return rc;
  796. }
  797. void *tq_pop(struct thread_q *tq, const struct timespec *abstime)
  798. {
  799. struct tq_ent *ent;
  800. void *rval = NULL;
  801. int rc;
  802. mutex_lock(&tq->mutex);
  803. if (tq->q)
  804. goto pop;
  805. if (abstime)
  806. rc = pthread_cond_timedwait(&tq->cond, &tq->mutex, abstime);
  807. else
  808. rc = pthread_cond_wait(&tq->cond, &tq->mutex);
  809. if (rc)
  810. goto out;
  811. if (!tq->q)
  812. goto out;
  813. pop:
  814. ent = tq->q;
  815. rval = ent->data;
  816. DL_DELETE(tq->q, ent);
  817. free(ent);
  818. out:
  819. mutex_unlock(&tq->mutex);
  820. return rval;
  821. }
  822. int thr_info_create(struct thr_info *thr, pthread_attr_t *attr, void *(*start) (void *), void *arg)
  823. {
  824. int rv = pthread_create(&thr->pth, attr, start, arg);
  825. if (likely(!rv))
  826. thr->has_pth = true;
  827. return rv;
  828. }
  829. void thr_info_freeze(struct thr_info *thr)
  830. {
  831. struct tq_ent *ent, *iter;
  832. struct thread_q *tq;
  833. if (!thr)
  834. return;
  835. tq = thr->q;
  836. if (!tq)
  837. return;
  838. mutex_lock(&tq->mutex);
  839. tq->frozen = true;
  840. DL_FOREACH_SAFE(tq->q, ent, iter) {
  841. DL_DELETE(tq->q, ent);
  842. free(ent);
  843. }
  844. mutex_unlock(&tq->mutex);
  845. }
  846. void thr_info_cancel(struct thr_info *thr)
  847. {
  848. if (!thr)
  849. return;
  850. if (thr->has_pth) {
  851. pthread_cancel(thr->pth);
  852. thr->has_pth = false;
  853. }
  854. }
  855. #ifndef HAVE_PTHREAD_CANCEL
  856. // Bionic (Android) is intentionally missing pthread_cancel, so it is implemented using pthread_kill
  857. enum pthread_cancel_workaround_mode {
  858. PCWM_DEFAULT = 0,
  859. PCWM_TERMINATE = 1,
  860. PCWM_ASYNC = 2,
  861. PCWM_DISABLED = 4,
  862. PCWM_CANCELLED = 8,
  863. };
  864. static pthread_key_t key_pcwm;
  865. struct sigaction pcwm_orig_term_handler;
  866. static
  867. void do_pthread_cancel_exit(int flags)
  868. {
  869. if (!(flags & PCWM_ASYNC))
  870. // NOTE: Logging disables cancel while mutex held, so this is safe
  871. applog(LOG_WARNING, "pthread_cancel workaround: Cannot defer cancellation, terminating thread NOW");
  872. pthread_exit(PTHREAD_CANCELED);
  873. }
  874. static
  875. void sighandler_pthread_cancel(int sig)
  876. {
  877. int flags = (int)pthread_getspecific(key_pcwm);
  878. if (flags & PCWM_TERMINATE) // Main thread
  879. {
  880. // Restore original handler and call it
  881. if (sigaction(sig, &pcwm_orig_term_handler, NULL))
  882. quit(1, "pthread_cancel workaround: Failed to restore original handler");
  883. raise(SIGTERM);
  884. quit(1, "pthread_cancel workaround: Original handler returned");
  885. }
  886. if (flags & PCWM_CANCELLED) // Already pending cancel
  887. return;
  888. if (flags & PCWM_DISABLED)
  889. {
  890. flags |= PCWM_CANCELLED;
  891. if (pthread_setspecific(key_pcwm, (void*)flags))
  892. quit(1, "pthread_cancel workaround: pthread_setspecific failed (setting PCWM_CANCELLED)");
  893. return;
  894. }
  895. do_pthread_cancel_exit(flags);
  896. }
  897. void pthread_testcancel(void)
  898. {
  899. int flags = (int)pthread_getspecific(key_pcwm);
  900. if (flags & PCWM_CANCELLED && !(flags & PCWM_DISABLED))
  901. do_pthread_cancel_exit(flags);
  902. }
  903. int pthread_setcancelstate(int state, int *oldstate)
  904. {
  905. int flags = (int)pthread_getspecific(key_pcwm);
  906. if (oldstate)
  907. *oldstate = (flags & PCWM_DISABLED) ? PTHREAD_CANCEL_DISABLE : PTHREAD_CANCEL_ENABLE;
  908. if (state == PTHREAD_CANCEL_DISABLE)
  909. flags |= PCWM_DISABLED;
  910. else
  911. {
  912. if (flags & PCWM_CANCELLED)
  913. do_pthread_cancel_exit(flags);
  914. flags &= ~PCWM_DISABLED;
  915. }
  916. if (pthread_setspecific(key_pcwm, (void*)flags))
  917. return -1;
  918. return 0;
  919. }
  920. int pthread_setcanceltype(int type, int *oldtype)
  921. {
  922. int flags = (int)pthread_getspecific(key_pcwm);
  923. if (oldtype)
  924. *oldtype = (flags & PCWM_ASYNC) ? PTHREAD_CANCEL_ASYNCHRONOUS : PTHREAD_CANCEL_DEFERRED;
  925. if (type == PTHREAD_CANCEL_ASYNCHRONOUS)
  926. flags |= PCWM_ASYNC;
  927. else
  928. flags &= ~PCWM_ASYNC;
  929. if (pthread_setspecific(key_pcwm, (void*)flags))
  930. return -1;
  931. return 0;
  932. }
  933. void setup_pthread_cancel_workaround()
  934. {
  935. if (pthread_key_create(&key_pcwm, NULL))
  936. quit(1, "pthread_cancel workaround: pthread_key_create failed");
  937. if (pthread_setspecific(key_pcwm, (void*)PCWM_TERMINATE))
  938. quit(1, "pthread_cancel workaround: pthread_setspecific failed");
  939. struct sigaction new_sigact = {
  940. .sa_handler = sighandler_pthread_cancel,
  941. };
  942. if (sigaction(SIGTERM, &new_sigact, &pcwm_orig_term_handler))
  943. quit(1, "pthread_cancel workaround: Failed to install SIGTERM handler");
  944. }
  945. #endif
  946. static void _now_gettimeofday(struct timeval *);
  947. static void _cgsleep_us_r_nanosleep(cgtimer_t *, int64_t);
  948. #ifdef HAVE_POOR_GETTIMEOFDAY
  949. static struct timeval tv_timeofday_offset;
  950. static struct timeval _tv_timeofday_lastchecked;
  951. static pthread_mutex_t _tv_timeofday_mutex = PTHREAD_MUTEX_INITIALIZER;
  952. static
  953. void bfg_calibrate_timeofday(struct timeval *expected, char *buf)
  954. {
  955. struct timeval actual, delta;
  956. timeradd(expected, &tv_timeofday_offset, expected);
  957. _now_gettimeofday(&actual);
  958. if (expected->tv_sec >= actual.tv_sec - 1 && expected->tv_sec <= actual.tv_sec + 1)
  959. // Within reason - no change necessary
  960. return;
  961. timersub(&actual, expected, &delta);
  962. timeradd(&tv_timeofday_offset, &delta, &tv_timeofday_offset);
  963. sprintf(buf, "Recalibrating timeofday offset (delta %ld.%06lds)", (long)delta.tv_sec, (long)delta.tv_usec);
  964. *expected = actual;
  965. }
  966. void bfg_gettimeofday(struct timeval *out)
  967. {
  968. char buf[64] = "";
  969. timer_set_now(out);
  970. mutex_lock(&_tv_timeofday_mutex);
  971. if (_tv_timeofday_lastchecked.tv_sec < out->tv_sec - 21)
  972. bfg_calibrate_timeofday(out, buf);
  973. else
  974. timeradd(out, &tv_timeofday_offset, out);
  975. mutex_unlock(&_tv_timeofday_mutex);
  976. if (unlikely(buf[0]))
  977. applog(LOG_WARNING, "%s", buf);
  978. }
  979. #endif
  980. #ifdef WIN32
  981. static LARGE_INTEGER _perffreq;
  982. static
  983. void _now_queryperformancecounter(struct timeval *tv)
  984. {
  985. LARGE_INTEGER now;
  986. if (unlikely(!QueryPerformanceCounter(&now)))
  987. quit(1, "QueryPerformanceCounter failed");
  988. *tv = (struct timeval){
  989. .tv_sec = now.QuadPart / _perffreq.QuadPart,
  990. .tv_usec = (now.QuadPart % _perffreq.QuadPart) * 1000000 / _perffreq.QuadPart,
  991. };
  992. }
  993. #endif
  994. static void bfg_init_time();
  995. static
  996. void _now_is_not_set(__maybe_unused struct timeval *tv)
  997. {
  998. bfg_init_time();
  999. timer_set_now(tv);
  1000. }
  1001. void (*timer_set_now)(struct timeval *tv) = _now_is_not_set;
  1002. void (*cgsleep_us_r)(cgtimer_t *, int64_t) = _cgsleep_us_r_nanosleep;
  1003. #ifdef HAVE_CLOCK_GETTIME_MONOTONIC
  1004. static clockid_t bfg_timer_clk;
  1005. static
  1006. void _now_clock_gettime(struct timeval *tv)
  1007. {
  1008. struct timespec ts;
  1009. if (unlikely(clock_gettime(bfg_timer_clk, &ts)))
  1010. quit(1, "clock_gettime failed");
  1011. *tv = (struct timeval){
  1012. .tv_sec = ts.tv_sec,
  1013. .tv_usec = ts.tv_nsec / 1000,
  1014. };
  1015. }
  1016. #ifdef HAVE_CLOCK_NANOSLEEP
  1017. static
  1018. void _cgsleep_us_r_monotonic(cgtimer_t *tv_start, int64_t us)
  1019. {
  1020. struct timeval tv_end[1];
  1021. struct timespec ts_end[1];
  1022. int ret;
  1023. timer_set_delay(tv_end, tv_start, us);
  1024. timeval_to_spec(ts_end, tv_end);
  1025. do {
  1026. ret = clock_nanosleep(CLOCK_MONOTONIC, TIMER_ABSTIME, ts_end, NULL);
  1027. } while (ret == EINTR);
  1028. }
  1029. #endif
  1030. static
  1031. bool _bfg_try_clock_gettime(clockid_t clk)
  1032. {
  1033. struct timespec ts;
  1034. if (clock_gettime(clk, &ts))
  1035. return false;
  1036. bfg_timer_clk = clk;
  1037. timer_set_now = _now_clock_gettime;
  1038. return true;
  1039. }
  1040. #endif
  1041. static
  1042. void bfg_init_time()
  1043. {
  1044. if (timer_set_now != _now_is_not_set)
  1045. return;
  1046. #ifdef HAVE_CLOCK_GETTIME_MONOTONIC
  1047. #ifdef HAVE_CLOCK_GETTIME_MONOTONIC_RAW
  1048. if (_bfg_try_clock_gettime(CLOCK_MONOTONIC_RAW))
  1049. applog(LOG_DEBUG, "Timers: Using clock_gettime(CLOCK_MONOTONIC_RAW)");
  1050. else
  1051. #endif
  1052. if (_bfg_try_clock_gettime(CLOCK_MONOTONIC))
  1053. {
  1054. applog(LOG_DEBUG, "Timers: Using clock_gettime(CLOCK_MONOTONIC)");
  1055. #ifdef HAVE_CLOCK_NANOSLEEP
  1056. cgsleep_us_r = _cgsleep_us_r_monotonic;
  1057. #endif
  1058. }
  1059. else
  1060. #endif
  1061. #ifdef WIN32
  1062. if (QueryPerformanceFrequency(&_perffreq) && _perffreq.QuadPart)
  1063. {
  1064. timer_set_now = _now_queryperformancecounter;
  1065. applog(LOG_DEBUG, "Timers: Using QueryPerformanceCounter");
  1066. }
  1067. else
  1068. #endif
  1069. {
  1070. timer_set_now = _now_gettimeofday;
  1071. applog(LOG_DEBUG, "Timers: Using gettimeofday");
  1072. }
  1073. #ifdef HAVE_POOR_GETTIMEOFDAY
  1074. char buf[64] = "";
  1075. struct timeval tv;
  1076. timer_set_now(&tv);
  1077. bfg_calibrate_timeofday(&tv, buf);
  1078. applog(LOG_DEBUG, "%s", buf);
  1079. #endif
  1080. }
  1081. void subtime(struct timeval *a, struct timeval *b)
  1082. {
  1083. timersub(a, b, b);
  1084. }
  1085. void addtime(struct timeval *a, struct timeval *b)
  1086. {
  1087. timeradd(a, b, b);
  1088. }
  1089. bool time_more(struct timeval *a, struct timeval *b)
  1090. {
  1091. return timercmp(a, b, >);
  1092. }
  1093. bool time_less(struct timeval *a, struct timeval *b)
  1094. {
  1095. return timercmp(a, b, <);
  1096. }
  1097. void copy_time(struct timeval *dest, const struct timeval *src)
  1098. {
  1099. memcpy(dest, src, sizeof(struct timeval));
  1100. }
  1101. void timespec_to_val(struct timeval *val, const struct timespec *spec)
  1102. {
  1103. val->tv_sec = spec->tv_sec;
  1104. val->tv_usec = spec->tv_nsec / 1000;
  1105. }
  1106. void timeval_to_spec(struct timespec *spec, const struct timeval *val)
  1107. {
  1108. spec->tv_sec = val->tv_sec;
  1109. spec->tv_nsec = val->tv_usec * 1000;
  1110. }
  1111. void us_to_timeval(struct timeval *val, int64_t us)
  1112. {
  1113. lldiv_t tvdiv = lldiv(us, 1000000);
  1114. val->tv_sec = tvdiv.quot;
  1115. val->tv_usec = tvdiv.rem;
  1116. }
  1117. void us_to_timespec(struct timespec *spec, int64_t us)
  1118. {
  1119. lldiv_t tvdiv = lldiv(us, 1000000);
  1120. spec->tv_sec = tvdiv.quot;
  1121. spec->tv_nsec = tvdiv.rem * 1000;
  1122. }
  1123. void ms_to_timespec(struct timespec *spec, int64_t ms)
  1124. {
  1125. lldiv_t tvdiv = lldiv(ms, 1000);
  1126. spec->tv_sec = tvdiv.quot;
  1127. spec->tv_nsec = tvdiv.rem * 1000000;
  1128. }
  1129. void timeraddspec(struct timespec *a, const struct timespec *b)
  1130. {
  1131. a->tv_sec += b->tv_sec;
  1132. a->tv_nsec += b->tv_nsec;
  1133. if (a->tv_nsec >= 1000000000) {
  1134. a->tv_nsec -= 1000000000;
  1135. a->tv_sec++;
  1136. }
  1137. }
  1138. #ifndef WIN32
  1139. static
  1140. void _now_gettimeofday(struct timeval *tv)
  1141. {
  1142. gettimeofday(tv, NULL);
  1143. }
  1144. #else
  1145. /* Windows start time is since 1601 lol so convert it to unix epoch 1970. */
  1146. #define EPOCHFILETIME (116444736000000000LL)
  1147. void _now_gettimeofday(struct timeval *tv)
  1148. {
  1149. FILETIME ft;
  1150. LARGE_INTEGER li;
  1151. GetSystemTimeAsFileTime(&ft);
  1152. li.LowPart = ft.dwLowDateTime;
  1153. li.HighPart = ft.dwHighDateTime;
  1154. li.QuadPart -= EPOCHFILETIME;
  1155. /* SystemTime is in decimicroseconds so divide by an unusual number */
  1156. tv->tv_sec = li.QuadPart / 10000000;
  1157. tv->tv_usec = li.QuadPart % 10000000;
  1158. }
  1159. #endif
  1160. void cgsleep_ms_r(cgtimer_t *tv_start, int ms)
  1161. {
  1162. cgsleep_us_r(tv_start, ((int64_t)ms) * 1000);
  1163. }
  1164. static
  1165. void _cgsleep_us_r_nanosleep(cgtimer_t *tv_start, int64_t us)
  1166. {
  1167. struct timeval tv_timer[1], tv[1];
  1168. struct timespec ts[1];
  1169. timer_set_delay(tv_timer, tv_start, us);
  1170. while (true)
  1171. {
  1172. timer_set_now(tv);
  1173. if (!timercmp(tv_timer, tv, >))
  1174. return;
  1175. timersub(tv_timer, tv, tv);
  1176. timeval_to_spec(ts, tv);
  1177. nanosleep(ts, NULL);
  1178. }
  1179. }
  1180. void cgsleep_ms(int ms)
  1181. {
  1182. cgtimer_t ts_start;
  1183. cgsleep_prepare_r(&ts_start);
  1184. cgsleep_ms_r(&ts_start, ms);
  1185. }
  1186. void cgsleep_us(int64_t us)
  1187. {
  1188. cgtimer_t ts_start;
  1189. cgsleep_prepare_r(&ts_start);
  1190. cgsleep_us_r(&ts_start, us);
  1191. }
  1192. /* Returns the microseconds difference between end and start times as a double */
  1193. double us_tdiff(struct timeval *end, struct timeval *start)
  1194. {
  1195. return end->tv_sec * 1000000 + end->tv_usec - start->tv_sec * 1000000 - start->tv_usec;
  1196. }
  1197. /* Returns the seconds difference between end and start times as a double */
  1198. double tdiff(struct timeval *end, struct timeval *start)
  1199. {
  1200. return end->tv_sec - start->tv_sec + (end->tv_usec - start->tv_usec) / 1000000.0;
  1201. }
  1202. int double_find_precision(double f, const double base)
  1203. {
  1204. int rv = 0;
  1205. for ( ; floor(f) != f; ++rv)
  1206. f *= base;
  1207. return rv;
  1208. }
  1209. int utf8_len(const uint8_t b)
  1210. {
  1211. if (!(b & 0x80))
  1212. return 1;
  1213. if (!(b & 0x20))
  1214. return 2;
  1215. else
  1216. if (!(b & 0x10))
  1217. return 3;
  1218. else
  1219. return 4;
  1220. }
  1221. int32_t utf8_decode(const void *b, int *out_len)
  1222. {
  1223. int32_t w;
  1224. const unsigned char *s = b;
  1225. *out_len = utf8_len(s[0]);
  1226. if (*out_len == 1)
  1227. // ASCII
  1228. return s[0];
  1229. #ifdef STRICT_UTF8
  1230. if (unlikely(!(s[0] & 0x40)))
  1231. goto invalid;
  1232. if (unlikely(s[0] & 0x38 == 0x38))
  1233. goto invalid;
  1234. #endif
  1235. w = s[0] & ((2 << (6 - *out_len)) - 1);
  1236. for (int i = 1; i < *out_len; ++i)
  1237. {
  1238. #ifdef STRICT_UTF8
  1239. if (unlikely((s[i] & 0xc0) != 0x80))
  1240. goto invalid;
  1241. #endif
  1242. w = (w << 6) | (s[i] & 0x3f);
  1243. }
  1244. #if defined(STRICT_UTF8)
  1245. if (unlikely(w > 0x10FFFF))
  1246. goto invalid;
  1247. // FIXME: UTF-8 requires smallest possible encoding; check it
  1248. #endif
  1249. return w;
  1250. #ifdef STRICT_UTF8
  1251. invalid:
  1252. *out_len = 1;
  1253. return REPLACEMENT_CHAR;
  1254. #endif
  1255. }
  1256. size_t utf8_strlen(const void * const b)
  1257. {
  1258. const uint8_t *s = b;
  1259. size_t c = 0;
  1260. int clen, i;
  1261. while (s[0])
  1262. {
  1263. clen = utf8_len(s[0]);
  1264. for (i = 0; i < clen; ++i)
  1265. if (!s[i])
  1266. clen = 1;
  1267. ++c;
  1268. s += clen;
  1269. }
  1270. return c;
  1271. }
  1272. static
  1273. void _utf8_test(const char *s, const wchar_t expected, int expectedlen)
  1274. {
  1275. int len;
  1276. wchar_t r;
  1277. if (expected != REPLACEMENT_CHAR)
  1278. {
  1279. len = utf8_len(((uint8_t*)s)[0]);
  1280. if (len != expectedlen)
  1281. applog(LOG_ERR, "UTF-8 test U+%06lX (len %d) failed: got utf8_len=>%d", (unsigned long)expected, expectedlen, len);
  1282. len = utf8_strlen(s);
  1283. if (len != (s[0] ? 1 : 0))
  1284. applog(LOG_ERR, "UTF-8 test U+%06lX (len %d) failed: got utf8_strlen=>%d", (unsigned long)expected, expectedlen, len);
  1285. len = -1;
  1286. }
  1287. r = utf8_decode(s, &len);
  1288. if (unlikely(r != expected || expectedlen != len))
  1289. applog(LOG_ERR, "UTF-8 test U+%06lX (len %d) failed: got U+%06lX (len %d)", (unsigned long)expected, expectedlen, (unsigned long)r, len);
  1290. }
  1291. #define _test_intrange(s, ...) _test_intrange(s, (int[]){ __VA_ARGS__ })
  1292. void utf8_test()
  1293. {
  1294. _utf8_test("", 0, 1);
  1295. _utf8_test("\1", 1, 1);
  1296. _utf8_test("\x7f", 0x7f, 1);
  1297. #if WCHAR_MAX >= 0x80
  1298. _utf8_test("\xc2\x80", 0x80, 2);
  1299. #if WCHAR_MAX >= 0xff
  1300. _utf8_test("\xc3\xbf", 0xff, 2);
  1301. #if WCHAR_MAX >= 0x7ff
  1302. _utf8_test("\xdf\xbf", 0x7ff, 2);
  1303. #if WCHAR_MAX >= 0x800
  1304. _utf8_test("\xe0\xa0\x80", 0x800, 3);
  1305. #if WCHAR_MAX >= 0xffff
  1306. _utf8_test("\xef\xbf\xbf", 0xffff, 3);
  1307. #if WCHAR_MAX >= 0x10000
  1308. _utf8_test("\xf0\x90\x80\x80", 0x10000, 4);
  1309. #if WCHAR_MAX >= 0x10ffff
  1310. _utf8_test("\xf4\x8f\xbf\xbf", 0x10ffff, 4);
  1311. #endif
  1312. #endif
  1313. #endif
  1314. #endif
  1315. #endif
  1316. #endif
  1317. #endif
  1318. #ifdef STRICT_UTF8
  1319. _utf8_test("\x80", REPLACEMENT_CHAR, 1);
  1320. _utf8_test("\xbf", REPLACEMENT_CHAR, 1);
  1321. _utf8_test("\xfe", REPLACEMENT_CHAR, 1);
  1322. _utf8_test("\xff", REPLACEMENT_CHAR, 1);
  1323. #endif
  1324. }
  1325. bool extract_sockaddr(char *url, char **sockaddr_url, char **sockaddr_port)
  1326. {
  1327. char *url_begin, *url_end, *ipv6_begin, *ipv6_end, *port_start = NULL;
  1328. char url_address[256], port[6];
  1329. int url_len, port_len = 0;
  1330. url_begin = strstr(url, "//");
  1331. if (!url_begin)
  1332. url_begin = url;
  1333. else
  1334. url_begin += 2;
  1335. /* Look for numeric ipv6 entries */
  1336. ipv6_begin = strstr(url_begin, "[");
  1337. ipv6_end = strstr(url_begin, "]");
  1338. if (ipv6_begin && ipv6_end && ipv6_end > ipv6_begin)
  1339. url_end = strstr(ipv6_end, ":");
  1340. else
  1341. url_end = strstr(url_begin, ":");
  1342. if (url_end) {
  1343. url_len = url_end - url_begin;
  1344. port_len = strlen(url_begin) - url_len - 1;
  1345. if (port_len < 1)
  1346. return false;
  1347. port_start = url_end + 1;
  1348. } else
  1349. url_len = strlen(url_begin);
  1350. if (url_len < 1)
  1351. return false;
  1352. if (url_len >= sizeof(url_address))
  1353. {
  1354. applog(LOG_WARNING, "%s: Truncating overflowed address '%.*s'",
  1355. __func__, url_len, url_begin);
  1356. url_len = sizeof(url_address) - 1;
  1357. }
  1358. sprintf(url_address, "%.*s", url_len, url_begin);
  1359. if (port_len) {
  1360. char *slash;
  1361. snprintf(port, 6, "%.*s", port_len, port_start);
  1362. slash = strchr(port, '/');
  1363. if (slash)
  1364. *slash = '\0';
  1365. } else
  1366. strcpy(port, "80");
  1367. free(*sockaddr_port);
  1368. *sockaddr_port = strdup(port);
  1369. free(*sockaddr_url);
  1370. *sockaddr_url = strdup(url_address);
  1371. return true;
  1372. }
  1373. enum send_ret {
  1374. SEND_OK,
  1375. SEND_SELECTFAIL,
  1376. SEND_SENDFAIL,
  1377. SEND_INACTIVE
  1378. };
  1379. /* Send a single command across a socket, appending \n to it. This should all
  1380. * be done under stratum lock except when first establishing the socket */
  1381. static enum send_ret __stratum_send(struct pool *pool, char *s, ssize_t len)
  1382. {
  1383. SOCKETTYPE sock = pool->sock;
  1384. ssize_t ssent = 0;
  1385. strcat(s, "\n");
  1386. len++;
  1387. while (len > 0 ) {
  1388. struct timeval timeout = {1, 0};
  1389. size_t sent = 0;
  1390. CURLcode rc;
  1391. fd_set wd;
  1392. retry:
  1393. FD_ZERO(&wd);
  1394. FD_SET(sock, &wd);
  1395. if (select(sock + 1, NULL, &wd, NULL, &timeout) < 1) {
  1396. if (interrupted())
  1397. goto retry;
  1398. return SEND_SELECTFAIL;
  1399. }
  1400. rc = curl_easy_send(pool->stratum_curl, s + ssent, len, &sent);
  1401. if (rc != CURLE_OK)
  1402. {
  1403. if (rc != CURLE_AGAIN)
  1404. return SEND_SENDFAIL;
  1405. sent = 0;
  1406. }
  1407. ssent += sent;
  1408. len -= sent;
  1409. }
  1410. pool->cgminer_pool_stats.times_sent++;
  1411. pool->cgminer_pool_stats.bytes_sent += ssent;
  1412. total_bytes_sent += ssent;
  1413. pool->cgminer_pool_stats.net_bytes_sent += ssent;
  1414. return SEND_OK;
  1415. }
  1416. bool _stratum_send(struct pool *pool, char *s, ssize_t len, bool force)
  1417. {
  1418. enum send_ret ret = SEND_INACTIVE;
  1419. if (opt_protocol)
  1420. applog(LOG_DEBUG, "Pool %u: SEND: %s", pool->pool_no, s);
  1421. mutex_lock(&pool->stratum_lock);
  1422. if (pool->stratum_active || force)
  1423. ret = __stratum_send(pool, s, len);
  1424. mutex_unlock(&pool->stratum_lock);
  1425. /* This is to avoid doing applog under stratum_lock */
  1426. switch (ret) {
  1427. default:
  1428. case SEND_OK:
  1429. break;
  1430. case SEND_SELECTFAIL:
  1431. applog(LOG_DEBUG, "Write select failed on pool %d sock", pool->pool_no);
  1432. suspend_stratum(pool);
  1433. break;
  1434. case SEND_SENDFAIL:
  1435. applog(LOG_DEBUG, "Failed to send in stratum_send");
  1436. suspend_stratum(pool);
  1437. break;
  1438. case SEND_INACTIVE:
  1439. applog(LOG_DEBUG, "Stratum send failed due to no pool stratum_active");
  1440. break;
  1441. }
  1442. return (ret == SEND_OK);
  1443. }
  1444. static bool socket_full(struct pool *pool, int wait)
  1445. {
  1446. SOCKETTYPE sock = pool->sock;
  1447. struct timeval timeout;
  1448. fd_set rd;
  1449. if (sock == INVSOCK)
  1450. return true;
  1451. if (unlikely(wait < 0))
  1452. wait = 0;
  1453. FD_ZERO(&rd);
  1454. FD_SET(sock, &rd);
  1455. timeout.tv_usec = 0;
  1456. timeout.tv_sec = wait;
  1457. if (select(sock + 1, &rd, NULL, NULL, &timeout) > 0)
  1458. return true;
  1459. return false;
  1460. }
  1461. /* Check to see if Santa's been good to you */
  1462. bool sock_full(struct pool *pool)
  1463. {
  1464. if (strlen(pool->sockbuf))
  1465. return true;
  1466. return (socket_full(pool, 0));
  1467. }
  1468. static void clear_sockbuf(struct pool *pool)
  1469. {
  1470. strcpy(pool->sockbuf, "");
  1471. }
  1472. static void clear_sock(struct pool *pool)
  1473. {
  1474. size_t n = 0;
  1475. mutex_lock(&pool->stratum_lock);
  1476. do {
  1477. n = 0;
  1478. if (pool->sock)
  1479. curl_easy_recv(pool->stratum_curl, pool->sockbuf, RECVSIZE, &n);
  1480. } while (n > 0);
  1481. mutex_unlock(&pool->stratum_lock);
  1482. clear_sockbuf(pool);
  1483. }
  1484. /* Make sure the pool sockbuf is large enough to cope with any coinbase size
  1485. * by reallocing it to a large enough size rounded up to a multiple of RBUFSIZE
  1486. * and zeroing the new memory */
  1487. static void recalloc_sock(struct pool *pool, size_t len)
  1488. {
  1489. size_t old, new;
  1490. old = strlen(pool->sockbuf);
  1491. new = old + len + 1;
  1492. if (new < pool->sockbuf_size)
  1493. return;
  1494. new = new + (RBUFSIZE - (new % RBUFSIZE));
  1495. // Avoid potentially recursive locking
  1496. // applog(LOG_DEBUG, "Recallocing pool sockbuf to %lu", (unsigned long)new);
  1497. pool->sockbuf = realloc(pool->sockbuf, new);
  1498. if (!pool->sockbuf)
  1499. quithere(1, "Failed to realloc pool sockbuf");
  1500. memset(pool->sockbuf + old, 0, new - old);
  1501. pool->sockbuf_size = new;
  1502. }
  1503. /* Peeks at a socket to find the first end of line and then reads just that
  1504. * from the socket and returns that as a malloced char */
  1505. char *recv_line(struct pool *pool)
  1506. {
  1507. char *tok, *sret = NULL;
  1508. ssize_t len, buflen;
  1509. int waited = 0;
  1510. if (!strstr(pool->sockbuf, "\n")) {
  1511. struct timeval rstart, now;
  1512. cgtime(&rstart);
  1513. if (!socket_full(pool, DEFAULT_SOCKWAIT)) {
  1514. applog(LOG_DEBUG, "Timed out waiting for data on socket_full");
  1515. goto out;
  1516. }
  1517. do {
  1518. char s[RBUFSIZE];
  1519. size_t slen;
  1520. size_t n = 0;
  1521. CURLcode rc;
  1522. memset(s, 0, RBUFSIZE);
  1523. rc = curl_easy_recv(pool->stratum_curl, s, RECVSIZE, &n);
  1524. if (rc == CURLE_OK && !n)
  1525. {
  1526. applog(LOG_DEBUG, "Socket closed waiting in recv_line");
  1527. suspend_stratum(pool);
  1528. break;
  1529. }
  1530. cgtime(&now);
  1531. waited = tdiff(&now, &rstart);
  1532. if (rc != CURLE_OK)
  1533. {
  1534. if (rc != CURLE_AGAIN || !socket_full(pool, DEFAULT_SOCKWAIT - waited))
  1535. {
  1536. applog(LOG_DEBUG, "Failed to recv sock in recv_line");
  1537. suspend_stratum(pool);
  1538. break;
  1539. }
  1540. } else {
  1541. slen = strlen(s);
  1542. recalloc_sock(pool, slen);
  1543. strcat(pool->sockbuf, s);
  1544. }
  1545. } while (waited < DEFAULT_SOCKWAIT && !strstr(pool->sockbuf, "\n"));
  1546. }
  1547. buflen = strlen(pool->sockbuf);
  1548. tok = strtok(pool->sockbuf, "\n");
  1549. if (!tok) {
  1550. applog(LOG_DEBUG, "Failed to parse a \\n terminated string in recv_line");
  1551. goto out;
  1552. }
  1553. sret = strdup(tok);
  1554. len = strlen(sret);
  1555. /* Copy what's left in the buffer after the \n, including the
  1556. * terminating \0 */
  1557. if (buflen > len + 1)
  1558. memmove(pool->sockbuf, pool->sockbuf + len + 1, buflen - len + 1);
  1559. else
  1560. strcpy(pool->sockbuf, "");
  1561. pool->cgminer_pool_stats.times_received++;
  1562. pool->cgminer_pool_stats.bytes_received += len;
  1563. total_bytes_rcvd += len;
  1564. pool->cgminer_pool_stats.net_bytes_received += len;
  1565. out:
  1566. if (!sret)
  1567. clear_sock(pool);
  1568. else if (opt_protocol)
  1569. applog(LOG_DEBUG, "Pool %u: RECV: %s", pool->pool_no, sret);
  1570. return sret;
  1571. }
  1572. /* Dumps any JSON value as a string. Just like jansson 2.1's JSON_ENCODE_ANY
  1573. * flag, but this is compatible with 2.0. */
  1574. char *json_dumps_ANY(json_t *json, size_t flags)
  1575. {
  1576. switch (json_typeof(json))
  1577. {
  1578. case JSON_ARRAY:
  1579. case JSON_OBJECT:
  1580. return json_dumps(json, flags);
  1581. default:
  1582. break;
  1583. }
  1584. char *rv;
  1585. #ifdef JSON_ENCODE_ANY
  1586. rv = json_dumps(json, JSON_ENCODE_ANY | flags);
  1587. if (rv)
  1588. return rv;
  1589. #endif
  1590. json_t *tmp = json_array();
  1591. char *s;
  1592. int i;
  1593. size_t len;
  1594. if (!tmp)
  1595. quithere(1, "Failed to allocate json array");
  1596. if (json_array_append(tmp, json))
  1597. quithere(1, "Failed to append temporary array");
  1598. s = json_dumps(tmp, flags);
  1599. if (!s)
  1600. return NULL;
  1601. for (i = 0; s[i] != '['; ++i)
  1602. if (unlikely(!(s[i] && isCspace(s[i]))))
  1603. quithere(1, "Failed to find opening bracket in array dump");
  1604. len = strlen(&s[++i]) - 1;
  1605. if (unlikely(s[i+len] != ']'))
  1606. quithere(1, "Failed to find closing bracket in array dump");
  1607. rv = malloc(len + 1);
  1608. memcpy(rv, &s[i], len);
  1609. rv[len] = '\0';
  1610. free(s);
  1611. json_decref(tmp);
  1612. return rv;
  1613. }
  1614. /* Extracts a string value from a json array with error checking. To be used
  1615. * when the value of the string returned is only examined and not to be stored.
  1616. * See json_array_string below */
  1617. const char *__json_array_string(json_t *val, unsigned int entry)
  1618. {
  1619. json_t *arr_entry;
  1620. if (json_is_null(val))
  1621. return NULL;
  1622. if (!json_is_array(val))
  1623. return NULL;
  1624. if (entry > json_array_size(val))
  1625. return NULL;
  1626. arr_entry = json_array_get(val, entry);
  1627. if (!json_is_string(arr_entry))
  1628. return NULL;
  1629. return json_string_value(arr_entry);
  1630. }
  1631. /* Creates a freshly malloced dup of __json_array_string */
  1632. static char *json_array_string(json_t *val, unsigned int entry)
  1633. {
  1634. const char *buf = __json_array_string(val, entry);
  1635. if (buf)
  1636. return strdup(buf);
  1637. return NULL;
  1638. }
  1639. void *my_memrchr(const void * const datap, const int c, const size_t sz)
  1640. {
  1641. const uint8_t *data = datap;
  1642. const uint8_t *p = &data[sz];
  1643. while (p > data)
  1644. if (*--p == c)
  1645. return (void *)p;
  1646. return NULL;
  1647. }
  1648. bool isCalpha(const int c)
  1649. {
  1650. if (c >= 'A' && c <= 'Z')
  1651. return true;
  1652. if (c >= 'a' && c <= 'z')
  1653. return true;
  1654. return false;
  1655. }
  1656. static
  1657. bool _appdata_file_call(const char * const appname, const char * const filename, const appdata_file_callback_t cb, void * const userp, const char * const path)
  1658. {
  1659. if (!(path && path[0]))
  1660. return false;
  1661. char filepath[PATH_MAX];
  1662. snprintf(filepath, sizeof(filepath), "%s/%s/%s", path, appname, filename);
  1663. if (!access(filepath, R_OK))
  1664. return cb(filepath, userp);
  1665. return false;
  1666. }
  1667. #define _APPDATA_FILE_CALL(appname, path) do{ \
  1668. if (_appdata_file_call(appname, filename, cb, userp, path)) \
  1669. return true; \
  1670. }while(0)
  1671. bool appdata_file_call(const char *appname, const char * const filename, const appdata_file_callback_t cb, void * const userp)
  1672. {
  1673. size_t appname_len = strlen(appname);
  1674. char appname_lcd[appname_len + 1];
  1675. appname_lcd[0] = '.';
  1676. char *appname_lc = &appname_lcd[1];
  1677. for (size_t i = 0; i <= appname_len; ++i)
  1678. appname_lc[i] = tolower(appname[i]);
  1679. appname_lc[appname_len] = '\0';
  1680. const char * const HOME = getenv("HOME");
  1681. _APPDATA_FILE_CALL(".", ".");
  1682. #ifdef WIN32
  1683. _APPDATA_FILE_CALL(appname, getenv("APPDATA"));
  1684. #elif defined(__APPLE__)
  1685. if (HOME && HOME[0])
  1686. {
  1687. char AppSupport[strlen(HOME) + 28 + 1];
  1688. snprintf(AppSupport, sizeof(AppSupport), "%s/Library/Application Support", HOME);
  1689. _APPDATA_FILE_CALL(appname, AppSupport);
  1690. }
  1691. #endif
  1692. _APPDATA_FILE_CALL(appname_lcd, HOME);
  1693. #ifdef WIN32
  1694. _APPDATA_FILE_CALL(appname, getenv("ALLUSERSAPPDATA"));
  1695. #elif defined(__APPLE__)
  1696. _APPDATA_FILE_CALL(appname, "/Library/Application Support");
  1697. #endif
  1698. #ifndef WIN32
  1699. _APPDATA_FILE_CALL(appname_lc, "/etc");
  1700. #endif
  1701. return false;
  1702. }
  1703. static
  1704. bool _appdata_file_find_first(const char * const filepath, void *userp)
  1705. {
  1706. char **rv = userp;
  1707. *rv = strdup(filepath);
  1708. return true;
  1709. }
  1710. char *appdata_file_find_first(const char * const appname, const char * const filename)
  1711. {
  1712. char *rv;
  1713. if (appdata_file_call(appname, filename, _appdata_file_find_first, &rv))
  1714. return rv;
  1715. return NULL;
  1716. }
  1717. const char *get_registered_domain(size_t * const out_domainlen, const char * const fqdn, const size_t fqdnlen)
  1718. {
  1719. const char *s;
  1720. int dots = 0;
  1721. for (s = &fqdn[fqdnlen-1]; s >= fqdn; --s)
  1722. {
  1723. if (s[0] == '.')
  1724. {
  1725. *out_domainlen = fqdnlen - (&s[1] - fqdn);
  1726. if (++dots >= 2 && *out_domainlen > 5)
  1727. return &s[1];
  1728. }
  1729. else
  1730. if (!(dots || isCalpha(s[0])))
  1731. {
  1732. *out_domainlen = fqdnlen;
  1733. return fqdn;
  1734. }
  1735. }
  1736. *out_domainlen = fqdnlen;
  1737. return fqdn;
  1738. }
  1739. const char *extract_domain(size_t * const out_domainlen, const char * const uri, const size_t urilen)
  1740. {
  1741. const char *p = uri, *b, *q, *s;
  1742. bool alldigit;
  1743. p = memchr(&p[1], '/', urilen - (&p[1] - uri));
  1744. if (p)
  1745. {
  1746. if (p[-1] == ':')
  1747. {
  1748. // part of the URI scheme, ignore it
  1749. while (p[0] == '/')
  1750. ++p;
  1751. p = memchr(p, '/', urilen - (p - uri)) ?: &uri[urilen];
  1752. }
  1753. }
  1754. else
  1755. p = &uri[urilen];
  1756. s = p;
  1757. q = my_memrchr(uri, ':', p - uri);
  1758. if (q)
  1759. {
  1760. alldigit = true;
  1761. for (q = b = &q[1]; q < p; ++q)
  1762. if (!isdigit(q[0]))
  1763. {
  1764. alldigit = false;
  1765. break;
  1766. }
  1767. if (alldigit && p != b)
  1768. p = &b[-1];
  1769. }
  1770. alldigit = true;
  1771. for (b = uri; b < p; ++b)
  1772. {
  1773. if (b[0] == ':')
  1774. break;
  1775. if (alldigit && !isdigit(b[0]))
  1776. alldigit = false;
  1777. }
  1778. if ((b < p && b[0] == ':') && (b == uri || !alldigit))
  1779. b = &b[1];
  1780. else
  1781. b = uri;
  1782. while (b <= p && b[0] == '/')
  1783. ++b;
  1784. if (p - b > 1 && b[0] == '[' && p[-1] == ']')
  1785. {
  1786. ++b;
  1787. --p;
  1788. }
  1789. else
  1790. if (memchr(b, ':', p - b))
  1791. p = s;
  1792. if (p > b && p[-1] == '.')
  1793. --p;
  1794. *out_domainlen = p - b;
  1795. return b;
  1796. }
  1797. bool match_domains(const char * const a, const size_t alen, const char * const b, const size_t blen)
  1798. {
  1799. size_t a_domainlen, b_domainlen;
  1800. const char *a_domain, *b_domain;
  1801. a_domain = extract_domain(&a_domainlen, a, alen);
  1802. a_domain = get_registered_domain(&a_domainlen, a_domain, a_domainlen);
  1803. b_domain = extract_domain(&b_domainlen, b, blen);
  1804. b_domain = get_registered_domain(&b_domainlen, b_domain, b_domainlen);
  1805. if (a_domainlen != b_domainlen)
  1806. return false;
  1807. return !strncasecmp(a_domain, b_domain, a_domainlen);
  1808. }
  1809. static
  1810. void _test_extract_domain(const char * const expect, const char * const uri)
  1811. {
  1812. size_t sz;
  1813. const char * const d = extract_domain(&sz, uri, strlen(uri));
  1814. if (sz != strlen(expect) || strncasecmp(d, expect, sz))
  1815. applog(LOG_WARNING, "extract_domain \"%s\" test failed; got \"%.*s\" instead of \"%s\"",
  1816. uri, (int)sz, d, expect);
  1817. }
  1818. static
  1819. void _test_get_regd_domain(const char * const expect, const char * const fqdn)
  1820. {
  1821. size_t sz;
  1822. const char * const d = get_registered_domain(&sz, fqdn, strlen(fqdn));
  1823. if (d == NULL || sz != strlen(expect) || strncasecmp(d, expect, sz))
  1824. applog(LOG_WARNING, "get_registered_domain \"%s\" test failed; got \"%.*s\" instead of \"%s\"",
  1825. fqdn, (int)sz, d, expect);
  1826. }
  1827. void test_domain_funcs()
  1828. {
  1829. _test_extract_domain("s.m.eligius.st", "http://s.m.eligius.st:3334");
  1830. _test_extract_domain("s.m.eligius.st", "http://s.m.eligius.st:3334/abc/abc/");
  1831. _test_extract_domain("s.m.eligius.st", "http://s.m.eligius.st/abc/abc/");
  1832. _test_extract_domain("s.m.eligius.st", "http://s.m.eligius.st");
  1833. _test_extract_domain("s.m.eligius.st", "http:s.m.eligius.st");
  1834. _test_extract_domain("s.m.eligius.st", "stratum+tcp:s.m.eligius.st");
  1835. _test_extract_domain("s.m.eligius.st", "stratum+tcp:s.m.eligius.st:3334");
  1836. _test_extract_domain("s.m.eligius.st", "stratum+tcp://s.m.eligius.st:3334");
  1837. _test_extract_domain("s.m.eligius.st", "stratum+tcp://s.m.eligius.st:3334///");
  1838. _test_extract_domain("s.m.eligius.st", "stratum+tcp://s.m.eligius.st.:3334///");
  1839. _test_extract_domain("s.m.eligius.st", "s.m.eligius.st:3334");
  1840. _test_extract_domain("s.m.eligius.st", "s.m.eligius.st:3334///");
  1841. _test_extract_domain("foohost", "foohost:3334");
  1842. _test_extract_domain("foohost", "foohost:3334///");
  1843. _test_extract_domain("foohost", "foohost:3334/abc.com//");
  1844. _test_extract_domain("", "foohost:");
  1845. _test_extract_domain("3334", "foohost://3334/abc.com//");
  1846. _test_extract_domain("192.0.2.0", "foohost:192.0.2.0");
  1847. _test_extract_domain("192.0.2.0", "192.0.2.0:3334");
  1848. _test_extract_domain("192.0.2.0", "192.0.2.0:3334///");
  1849. _test_extract_domain("2001:db8::1", "2001:db8::1");
  1850. _test_extract_domain("2001:db8::1", "http://[2001:db8::1]");
  1851. _test_extract_domain("2001:db8::1", "http:[2001:db8::1]");
  1852. _test_extract_domain("2001:db8::1", "http://[2001:db8::1]:42");
  1853. _test_extract_domain("2001:db8::1", "http://[2001:db8::1]:42/abc//def/ghi");
  1854. _test_extract_domain("2001:db8::cafe", "http://[2001:db8::cafe]");
  1855. _test_extract_domain("2001:db8::cafe", "http:[2001:db8::cafe]");
  1856. _test_extract_domain("2001:db8::cafe", "http://[2001:db8::cafe]:42");
  1857. _test_extract_domain("2001:db8::cafe", "http://[2001:db8::cafe]:42/abc//def/ghi");
  1858. _test_get_regd_domain("eligius.st", "s.m.eligius.st");
  1859. _test_get_regd_domain("eligius.st", "eligius.st");
  1860. _test_get_regd_domain("foohost.co.uk", "myserver.foohost.co.uk");
  1861. _test_get_regd_domain("foohost", "foohost");
  1862. _test_get_regd_domain("192.0.2.0", "192.0.2.0");
  1863. _test_get_regd_domain("2001:db8::1", "2001:db8::1");
  1864. }
  1865. struct bfg_strtobool_keyword {
  1866. bool val;
  1867. const char *keyword;
  1868. };
  1869. bool bfg_strtobool(const char * const s, char ** const endptr, __maybe_unused const int opts)
  1870. {
  1871. struct bfg_strtobool_keyword keywords[] = {
  1872. {false, "false"},
  1873. {false, "never"},
  1874. {false, "none"},
  1875. {false, "off"},
  1876. {false, "no"},
  1877. {false, "0"},
  1878. {true , "always"},
  1879. {true , "true"},
  1880. {true , "yes"},
  1881. {true , "on"},
  1882. };
  1883. const int total_keywords = sizeof(keywords) / sizeof(*keywords);
  1884. for (int i = 0; i < total_keywords; ++i)
  1885. {
  1886. const size_t kwlen = strlen(keywords[i].keyword);
  1887. if (!strncasecmp(keywords[i].keyword, s, kwlen))
  1888. {
  1889. if (endptr)
  1890. *endptr = (char*)&s[kwlen];
  1891. return keywords[i].val;
  1892. }
  1893. }
  1894. char *lend;
  1895. strtol(s, &lend, 0);
  1896. if (lend > s)
  1897. {
  1898. if (endptr)
  1899. *endptr = lend;
  1900. // Any number other than "0" is intentionally considered true, including 0x0
  1901. return true;
  1902. }
  1903. *endptr = (char*)s;
  1904. return false;
  1905. }
  1906. #define URI_FIND_PARAM_FOUND ((const char *)uri_find_param)
  1907. const char *uri_find_param(const char * const uri, const char * const param, bool * const invert_p)
  1908. {
  1909. const char *start = strchr(uri, '#');
  1910. if (invert_p)
  1911. *invert_p = false;
  1912. if (!start)
  1913. return NULL;
  1914. const char *p = start;
  1915. ++start;
  1916. nextmatch:
  1917. p = strstr(&p[1], param);
  1918. if (!p)
  1919. return NULL;
  1920. const char *q = &p[strlen(param)];
  1921. if (isCalpha(q[0]))
  1922. goto nextmatch;
  1923. if (invert_p && p - start >= 2 && (!strncasecmp(&p[-2], "no", 2)) && !isCalpha(p[-3]))
  1924. *invert_p = true;
  1925. else
  1926. if (isCalpha(p[-1]))
  1927. goto nextmatch;
  1928. if (q[0] == '=')
  1929. return &q[1];
  1930. return URI_FIND_PARAM_FOUND;
  1931. }
  1932. enum bfg_tristate uri_get_param_bool2(const char * const uri, const char * const param)
  1933. {
  1934. bool invert, foundval = true;
  1935. const char *q = uri_find_param(uri, param, &invert);
  1936. if (!q)
  1937. return BTS_UNKNOWN;
  1938. else
  1939. if (q != URI_FIND_PARAM_FOUND)
  1940. {
  1941. char *end;
  1942. bool v = bfg_strtobool(q, &end, 0);
  1943. if (end > q && !isCalpha(end[0]))
  1944. foundval = v;
  1945. }
  1946. if (invert)
  1947. foundval = !foundval;
  1948. return foundval;
  1949. }
  1950. bool uri_get_param_bool(const char * const uri, const char * const param, const bool defval)
  1951. {
  1952. const enum bfg_tristate rv = uri_get_param_bool2(uri, param);
  1953. if (rv == BTS_UNKNOWN)
  1954. return defval;
  1955. return rv;
  1956. }
  1957. static
  1958. void _test_uri_find_param(const char * const uri, const char * const param, const int expect_offset, const int expect_invert)
  1959. {
  1960. bool invert;
  1961. const char *actual = uri_find_param(uri, param, (expect_invert >= 0) ? &invert : NULL);
  1962. int actual_offset;
  1963. if (actual == URI_FIND_PARAM_FOUND)
  1964. actual_offset = -1;
  1965. else
  1966. if (!actual)
  1967. actual_offset = -2;
  1968. else
  1969. actual_offset = actual - uri;
  1970. int actual_invert = (expect_invert >= 0) ? (invert ? 1 : 0) : -1;
  1971. if (actual_offset != expect_offset || expect_invert != actual_invert)
  1972. applog(LOG_WARNING, "%s(\"%s\", \"%s\", %s) test failed (offset: expect=%d actual=%d; invert: expect=%d actual=%d)",
  1973. "uri_find_param", uri, param, (expect_invert >= 0) ? "(invert)" : "NULL",
  1974. expect_offset, actual_offset,
  1975. expect_invert, actual_invert);
  1976. }
  1977. static
  1978. void _test_uri_get_param(const char * const uri, const char * const param, const bool defval, const bool expect)
  1979. {
  1980. const bool actual = uri_get_param_bool(uri, param, defval);
  1981. if (actual != expect)
  1982. applog(LOG_WARNING, "%s(\"%s\", \"%s\", %s) test failed",
  1983. "uri_get_param_bool", uri, param, defval ? "true" : "false");
  1984. }
  1985. void test_uri_get_param()
  1986. {
  1987. _test_uri_find_param("stratum+tcp://footest/#redirect", "redirect", -1, -1);
  1988. _test_uri_find_param("stratum+tcp://footest/#redirectme", "redirect", -2, -1);
  1989. _test_uri_find_param("stratum+tcp://footest/#noredirect", "redirect", -2, -1);
  1990. _test_uri_find_param("stratum+tcp://footest/#noredirect", "redirect", -1, 1);
  1991. _test_uri_find_param("stratum+tcp://footest/#redirect", "redirect", -1, 0);
  1992. _test_uri_find_param("stratum+tcp://footest/#redirect=", "redirect", 32, -1);
  1993. _test_uri_find_param("stratum+tcp://footest/#noredirect=", "redirect", 34, 1);
  1994. _test_uri_get_param("stratum+tcp://footest/#redirect", "redirect", false, true);
  1995. _test_uri_get_param("stratum+tcp://footest/#redirectme", "redirect", false, false);
  1996. _test_uri_get_param("stratum+tcp://footest/#noredirect", "redirect", false, false);
  1997. _test_uri_get_param("stratum+tcp://footest/#redirect=0", "redirect", false, false);
  1998. _test_uri_get_param("stratum+tcp://footest/#redirect=1", "redirect", false, true);
  1999. _test_uri_get_param("stratum+tcp://footest/#redirect", "redirect", true, true);
  2000. _test_uri_get_param("stratum+tcp://footest/#redirectme", "redirect", true, true);
  2001. _test_uri_get_param("stratum+tcp://footest/#noredirect", "redirect", true, false);
  2002. _test_uri_get_param("stratum+tcp://footest/#redirect=0", "redirect", true, false);
  2003. _test_uri_get_param("stratum+tcp://footest/#redirect=1", "redirect", true, true);
  2004. _test_uri_get_param("stratum+tcp://footest/#redirect=0,foo=1", "redirect", true, false);
  2005. _test_uri_get_param("stratum+tcp://footest/#redirect=1,foo=0", "redirect", false, true);
  2006. _test_uri_get_param("stratum+tcp://footest/#foo=1,noredirect=0,foo=1", "redirect", false, true);
  2007. _test_uri_get_param("stratum+tcp://footest/#bar=0,noredirect=1,foo=0", "redirect", true, false);
  2008. _test_uri_get_param("stratum+tcp://footest/#redirect=false", "redirect", true, false);
  2009. _test_uri_get_param("stratum+tcp://footest/#redirect=no", "redirect", true, false);
  2010. _test_uri_get_param("stratum+tcp://footest/#redirect=yes", "redirect", false, true);
  2011. }
  2012. void stratum_probe_transparency(struct pool *pool)
  2013. {
  2014. // Request transaction data to discourage pools from doing anything shady
  2015. char s[1024];
  2016. int sLen;
  2017. sLen = sprintf(s, "{\"params\": [\"%s\"], \"id\": \"txlist%s\", \"method\": \"mining.get_transactions\"}",
  2018. pool->swork.job_id,
  2019. pool->swork.job_id);
  2020. stratum_send(pool, s, sLen);
  2021. if ((!pool->swork.opaque) && !timer_isset(&pool->swork.tv_transparency))
  2022. timer_set_delay_from_now(&pool->swork.tv_transparency, 21093750L);
  2023. pool->swork.transparency_probed = true;
  2024. }
  2025. static bool parse_notify(struct pool *pool, json_t *val)
  2026. {
  2027. const char *prev_hash, *coinbase1, *coinbase2, *bbversion, *nbit, *ntime;
  2028. char *job_id;
  2029. bool clean, ret = false;
  2030. int merkles, i;
  2031. size_t cb1_len, cb2_len;
  2032. json_t *arr;
  2033. arr = json_array_get(val, 4);
  2034. if (!arr || !json_is_array(arr))
  2035. goto out;
  2036. merkles = json_array_size(arr);
  2037. for (i = 0; i < merkles; i++)
  2038. if (!json_is_string(json_array_get(arr, i)))
  2039. goto out;
  2040. prev_hash = __json_array_string(val, 1);
  2041. coinbase1 = __json_array_string(val, 2);
  2042. coinbase2 = __json_array_string(val, 3);
  2043. bbversion = __json_array_string(val, 5);
  2044. nbit = __json_array_string(val, 6);
  2045. ntime = __json_array_string(val, 7);
  2046. clean = json_is_true(json_array_get(val, 8));
  2047. if (!prev_hash || !coinbase1 || !coinbase2 || !bbversion || !nbit || !ntime)
  2048. goto out;
  2049. job_id = json_array_string(val, 0);
  2050. if (!job_id)
  2051. goto out;
  2052. cg_wlock(&pool->data_lock);
  2053. cgtime(&pool->swork.tv_received);
  2054. free(pool->swork.job_id);
  2055. pool->swork.job_id = job_id;
  2056. if (pool->swork.tr)
  2057. {
  2058. tmpl_decref(pool->swork.tr);
  2059. pool->swork.tr = NULL;
  2060. }
  2061. pool->submit_old = !clean;
  2062. pool->swork.clean = true;
  2063. if (pool->next_nonce1)
  2064. {
  2065. free(pool->swork.nonce1);
  2066. pool->n1_len = strlen(pool->next_nonce1) / 2;
  2067. pool->swork.nonce1 = pool->next_nonce1;
  2068. pool->next_nonce1 = NULL;
  2069. }
  2070. int n2size = pool->swork.n2size = pool->next_n2size;
  2071. pool->nonce2sz = (n2size > sizeof(pool->nonce2)) ? sizeof(pool->nonce2) : n2size;
  2072. #ifdef WORDS_BIGENDIAN
  2073. pool->nonce2off = (n2size < sizeof(pool->nonce2)) ? (sizeof(pool->nonce2) - n2size) : 0;
  2074. #endif
  2075. hex2bin(&pool->swork.header1[0], bbversion, 4);
  2076. hex2bin(&pool->swork.header1[4], prev_hash, 32);
  2077. hex2bin((void*)&pool->swork.ntime, ntime, 4);
  2078. pool->swork.ntime = be32toh(pool->swork.ntime);
  2079. hex2bin(&pool->swork.diffbits[0], nbit, 4);
  2080. /* Nominally allow a driver to ntime roll 60 seconds */
  2081. set_simple_ntime_roll_limit(&pool->swork.ntime_roll_limits, pool->swork.ntime, 60);
  2082. cb1_len = strlen(coinbase1) / 2;
  2083. pool->swork.nonce2_offset = cb1_len + pool->n1_len;
  2084. cb2_len = strlen(coinbase2) / 2;
  2085. bytes_resize(&pool->swork.coinbase, pool->swork.nonce2_offset + pool->swork.n2size + cb2_len);
  2086. uint8_t *coinbase = bytes_buf(&pool->swork.coinbase);
  2087. hex2bin(coinbase, coinbase1, cb1_len);
  2088. hex2bin(&coinbase[cb1_len], pool->swork.nonce1, pool->n1_len);
  2089. // NOTE: gap for nonce2, filled at work generation time
  2090. hex2bin(&coinbase[pool->swork.nonce2_offset + pool->swork.n2size], coinbase2, cb2_len);
  2091. bytes_resize(&pool->swork.merkle_bin, 32 * merkles);
  2092. for (i = 0; i < merkles; i++)
  2093. hex2bin(&bytes_buf(&pool->swork.merkle_bin)[i * 32], json_string_value(json_array_get(arr, i)), 32);
  2094. pool->swork.merkles = merkles;
  2095. pool->nonce2 = 0;
  2096. memcpy(pool->swork.target, pool->next_target, 0x20);
  2097. cg_wunlock(&pool->data_lock);
  2098. applog(LOG_DEBUG, "Received stratum notify from pool %u with job_id=%s",
  2099. pool->pool_no, job_id);
  2100. if (opt_debug && opt_protocol)
  2101. {
  2102. applog(LOG_DEBUG, "job_id: %s", job_id);
  2103. applog(LOG_DEBUG, "prev_hash: %s", prev_hash);
  2104. applog(LOG_DEBUG, "coinbase1: %s", coinbase1);
  2105. applog(LOG_DEBUG, "coinbase2: %s", coinbase2);
  2106. for (i = 0; i < merkles; i++)
  2107. applog(LOG_DEBUG, "merkle%d: %s", i, json_string_value(json_array_get(arr, i)));
  2108. applog(LOG_DEBUG, "bbversion: %s", bbversion);
  2109. applog(LOG_DEBUG, "nbit: %s", nbit);
  2110. applog(LOG_DEBUG, "ntime: %s", ntime);
  2111. applog(LOG_DEBUG, "clean: %s", clean ? "yes" : "no");
  2112. }
  2113. /* A notify message is the closest stratum gets to a getwork */
  2114. pool->getwork_requested++;
  2115. total_getworks++;
  2116. if ((merkles && (!pool->swork.transparency_probed || rand() <= RAND_MAX / (opt_skip_checks + 1))) || timer_isset(&pool->swork.tv_transparency))
  2117. if (pool->probed)
  2118. stratum_probe_transparency(pool);
  2119. ret = true;
  2120. out:
  2121. return ret;
  2122. }
  2123. static bool parse_diff(struct pool *pool, json_t *val)
  2124. {
  2125. double diff;
  2126. diff = json_number_value(json_array_get(val, 0));
  2127. if (diff == 0)
  2128. return false;
  2129. if ((int64_t)diff != diff)
  2130. {
  2131. // Assume fractional values are proper bdiff per specification
  2132. // Allow integers to be interpreted as pdiff, since the difference is trivial and some pools see it this way
  2133. diff = bdiff_to_pdiff(diff);
  2134. }
  2135. if ((!opt_scrypt) && diff < 1 && diff > 0.999)
  2136. diff = 1;
  2137. #ifdef USE_SCRYPT
  2138. // Broken Scrypt pools multiply difficulty by 0x10000
  2139. const double broken_scrypt_diff_multiplier = 0x10000;
  2140. /* 7/12/2014: P2Pool code was fixed: https://github.com/forrestv/p2pool/pull/210
  2141. 7/15/2014: Popular pools unfixed: wemineltc, dogehouse, p2pool.org
  2142. Cannot find a broken Scrypt pool that will dispense diff lower than 16 */
  2143. // Ideally pools will fix their implementation and we can remove this
  2144. // This should suffice until miners are hashing Scrypt at ~1-7 Gh/s (based on a share rate target of 10-60s)
  2145. const double minimum_broken_scrypt_diff = 16;
  2146. // Diff 16 at 1.15 Gh/s = 1 share / 60s
  2147. // Diff 16 at 7.00 Gh/s = 1 share / 10s
  2148. if (opt_scrypt && (diff >= minimum_broken_scrypt_diff))
  2149. diff /= broken_scrypt_diff_multiplier;
  2150. #endif
  2151. cg_wlock(&pool->data_lock);
  2152. set_target_to_pdiff(pool->next_target, diff);
  2153. cg_wunlock(&pool->data_lock);
  2154. applog(LOG_DEBUG, "Pool %d stratum difficulty set to %g", pool->pool_no, diff);
  2155. return true;
  2156. }
  2157. static
  2158. bool stratum_set_extranonce(struct pool * const pool, json_t * const val, json_t * const params)
  2159. {
  2160. char *nonce1 = NULL;
  2161. int n2size = 0;
  2162. json_t *j;
  2163. if (!json_is_array(params))
  2164. goto err;
  2165. switch (json_array_size(params))
  2166. {
  2167. default: // >=2
  2168. // n2size
  2169. j = json_array_get(params, 1);
  2170. if (json_is_number(j))
  2171. {
  2172. n2size = json_integer_value(j);
  2173. if (n2size < 1)
  2174. goto err;
  2175. }
  2176. else
  2177. if (!json_is_null(j))
  2178. goto err;
  2179. // fallthru
  2180. case 1:
  2181. // nonce1
  2182. j = json_array_get(params, 0);
  2183. if (json_is_string(j))
  2184. nonce1 = strdup(json_string_value(j));
  2185. else
  2186. if (!json_is_null(j))
  2187. goto err;
  2188. break;
  2189. case 0:
  2190. applog(LOG_WARNING, "Pool %u: No-op mining.set_extranonce?", pool->pool_no);
  2191. return true;
  2192. }
  2193. cg_wlock(&pool->data_lock);
  2194. if (nonce1)
  2195. {
  2196. free(pool->next_nonce1);
  2197. pool->next_nonce1 = nonce1;
  2198. }
  2199. if (n2size)
  2200. pool->next_n2size = n2size;
  2201. cg_wunlock(&pool->data_lock);
  2202. return true;
  2203. err:
  2204. applog(LOG_ERR, "Pool %u: Invalid mining.set_extranonce", pool->pool_no);
  2205. json_t *id = json_object_get(val, "id");
  2206. if (id && !json_is_null(id))
  2207. {
  2208. char s[RBUFSIZE], *idstr;
  2209. idstr = json_dumps_ANY(id, 0);
  2210. sprintf(s, "{\"id\": %s, \"result\": null, \"error\": [20, \"Invalid params\"]}", idstr);
  2211. free(idstr);
  2212. stratum_send(pool, s, strlen(s));
  2213. }
  2214. return true;
  2215. }
  2216. static bool parse_reconnect(struct pool *pool, json_t *val)
  2217. {
  2218. if (opt_disable_client_reconnect)
  2219. return false;
  2220. const char *url;
  2221. char address[256];
  2222. json_t *port_json;
  2223. url = __json_array_string(val, 0);
  2224. if (!url)
  2225. url = pool->sockaddr_url;
  2226. else
  2227. if (!pool_may_redirect_to(pool, url))
  2228. return false;
  2229. port_json = json_array_get(val, 1);
  2230. if (json_is_number(port_json))
  2231. {
  2232. const unsigned port = json_number_value(port_json);
  2233. snprintf(address, sizeof(address), "%s:%u", url, port);
  2234. }
  2235. else
  2236. {
  2237. const char *port;
  2238. if (json_is_string(port_json))
  2239. port = json_string_value(port_json);
  2240. else
  2241. port = pool->stratum_port;
  2242. snprintf(address, sizeof(address), "%s:%s", url, port);
  2243. }
  2244. if (!extract_sockaddr(address, &pool->sockaddr_url, &pool->stratum_port))
  2245. return false;
  2246. pool->stratum_url = pool->sockaddr_url;
  2247. applog(LOG_NOTICE, "Reconnect requested from pool %d to %s", pool->pool_no, address);
  2248. if (!restart_stratum(pool))
  2249. return false;
  2250. return true;
  2251. }
  2252. static bool send_version(struct pool *pool, json_t *val)
  2253. {
  2254. char s[RBUFSIZE], *idstr;
  2255. json_t *id = json_object_get(val, "id");
  2256. if (!(id && !json_is_null(id)))
  2257. return false;
  2258. idstr = json_dumps_ANY(id, 0);
  2259. sprintf(s, "{\"id\": %s, \"result\": \""PACKAGE"/"VERSION"\", \"error\": null}", idstr);
  2260. free(idstr);
  2261. if (!stratum_send(pool, s, strlen(s)))
  2262. return false;
  2263. return true;
  2264. }
  2265. static bool stratum_show_message(struct pool *pool, json_t *val, json_t *params)
  2266. {
  2267. char *msg;
  2268. char s[RBUFSIZE], *idstr;
  2269. json_t *id = json_object_get(val, "id");
  2270. msg = json_array_string(params, 0);
  2271. if (likely(msg))
  2272. {
  2273. free(pool->admin_msg);
  2274. pool->admin_msg = msg;
  2275. applog(LOG_NOTICE, "Message from pool %u: %s", pool->pool_no, msg);
  2276. }
  2277. if (!(id && !json_is_null(id)))
  2278. return true;
  2279. idstr = json_dumps_ANY(id, 0);
  2280. if (likely(msg))
  2281. sprintf(s, "{\"id\": %s, \"result\": true, \"error\": null}", idstr);
  2282. else
  2283. sprintf(s, "{\"id\": %s, \"result\": null, \"error\": [-1, \"Failed to parse message\", null]}", idstr);
  2284. free(idstr);
  2285. if (!stratum_send(pool, s, strlen(s)))
  2286. return false;
  2287. return true;
  2288. }
  2289. bool parse_method(struct pool *pool, char *s)
  2290. {
  2291. json_t *val = NULL, *method, *err_val, *params;
  2292. json_error_t err;
  2293. bool ret = false;
  2294. const char *buf;
  2295. if (!s)
  2296. goto out;
  2297. val = JSON_LOADS(s, &err);
  2298. if (!val) {
  2299. applog(LOG_INFO, "JSON decode failed(%d): %s", err.line, err.text);
  2300. goto out;
  2301. }
  2302. method = json_object_get(val, "method");
  2303. if (!method)
  2304. goto out;
  2305. err_val = json_object_get(val, "error");
  2306. params = json_object_get(val, "params");
  2307. if (err_val && !json_is_null(err_val)) {
  2308. char *ss;
  2309. if (err_val)
  2310. ss = json_dumps(err_val, JSON_INDENT(3));
  2311. else
  2312. ss = strdup("(unknown reason)");
  2313. applog(LOG_INFO, "JSON-RPC method decode failed: %s", ss);
  2314. free(ss);
  2315. goto out;
  2316. }
  2317. buf = json_string_value(method);
  2318. if (!buf)
  2319. goto out;
  2320. if (!strncasecmp(buf, "mining.notify", 13)) {
  2321. if (parse_notify(pool, params))
  2322. pool->stratum_notify = ret = true;
  2323. else
  2324. pool->stratum_notify = ret = false;
  2325. goto out;
  2326. }
  2327. if (!strncasecmp(buf, "mining.set_difficulty", 21) && parse_diff(pool, params)) {
  2328. ret = true;
  2329. goto out;
  2330. }
  2331. if (!strncasecmp(buf, "client.reconnect", 16) && parse_reconnect(pool, params)) {
  2332. ret = true;
  2333. goto out;
  2334. }
  2335. if (!strncasecmp(buf, "client.get_version", 18) && send_version(pool, val)) {
  2336. ret = true;
  2337. goto out;
  2338. }
  2339. if (!strncasecmp(buf, "client.show_message", 19) && stratum_show_message(pool, val, params)) {
  2340. ret = true;
  2341. goto out;
  2342. }
  2343. if (!strncasecmp(buf, "mining.set_extranonce", 21) && stratum_set_extranonce(pool, val, params)) {
  2344. ret = true;
  2345. goto out;
  2346. }
  2347. out:
  2348. if (val)
  2349. json_decref(val);
  2350. return ret;
  2351. }
  2352. extern bool parse_stratum_response(struct pool *, char *s);
  2353. bool auth_stratum(struct pool *pool)
  2354. {
  2355. json_t *val = NULL, *res_val, *err_val;
  2356. char s[RBUFSIZE], *sret = NULL;
  2357. json_error_t err;
  2358. bool ret = false;
  2359. sprintf(s, "{\"id\": \"auth\", \"method\": \"mining.authorize\", \"params\": [\"%s\", \"%s\"]}",
  2360. pool->rpc_user, pool->rpc_pass);
  2361. if (!stratum_send(pool, s, strlen(s)))
  2362. goto out;
  2363. /* Parse all data in the queue and anything left should be auth */
  2364. while (42) {
  2365. sret = recv_line(pool);
  2366. if (!sret)
  2367. goto out;
  2368. if (parse_method(pool, sret))
  2369. free(sret);
  2370. else
  2371. {
  2372. bool unknown = true;
  2373. val = JSON_LOADS(sret, &err);
  2374. json_t *j_id = json_object_get(val, "id");
  2375. if (json_is_string(j_id))
  2376. {
  2377. if (!strcmp(json_string_value(j_id), "auth"))
  2378. break;
  2379. else
  2380. if (!strcmp(json_string_value(j_id), "xnsub"))
  2381. unknown = false;
  2382. }
  2383. if (unknown)
  2384. applog(LOG_WARNING, "Pool %u: Unknown stratum msg: %s", pool->pool_no, sret);
  2385. free(sret);
  2386. }
  2387. }
  2388. free(sret);
  2389. res_val = json_object_get(val, "result");
  2390. err_val = json_object_get(val, "error");
  2391. if (!res_val || json_is_false(res_val) || (err_val && !json_is_null(err_val))) {
  2392. char *ss;
  2393. if (err_val)
  2394. ss = json_dumps(err_val, JSON_INDENT(3));
  2395. else
  2396. ss = strdup("(unknown reason)");
  2397. applog(LOG_WARNING, "pool %d JSON stratum auth failed: %s", pool->pool_no, ss);
  2398. free(ss);
  2399. goto out;
  2400. }
  2401. ret = true;
  2402. applog(LOG_INFO, "Stratum authorisation success for pool %d", pool->pool_no);
  2403. pool->probed = true;
  2404. successful_connect = true;
  2405. out:
  2406. if (val)
  2407. json_decref(val);
  2408. if (pool->stratum_notify)
  2409. stratum_probe_transparency(pool);
  2410. return ret;
  2411. }
  2412. curl_socket_t grab_socket_opensocket_cb(void *clientp, __maybe_unused curlsocktype purpose, struct curl_sockaddr *addr)
  2413. {
  2414. struct pool *pool = clientp;
  2415. curl_socket_t sck = bfg_socket(addr->family, addr->socktype, addr->protocol);
  2416. pool->sock = sck;
  2417. return sck;
  2418. }
  2419. static bool setup_stratum_curl(struct pool *pool)
  2420. {
  2421. CURL *curl = NULL;
  2422. char s[RBUFSIZE];
  2423. bool ret = false;
  2424. bool tls_only = false, try_tls = true;
  2425. bool tlsca = uri_get_param_bool(pool->rpc_url, "tlsca", false);
  2426. {
  2427. const enum bfg_tristate tlsparam = uri_get_param_bool2(pool->rpc_url, "tls");
  2428. if (tlsparam != BTS_UNKNOWN)
  2429. try_tls = tls_only = tlsparam;
  2430. else
  2431. if (tlsca)
  2432. // If tlsca is enabled, require TLS by default
  2433. tls_only = true;
  2434. }
  2435. applog(LOG_DEBUG, "initiate_stratum with sockbuf=%p", pool->sockbuf);
  2436. mutex_lock(&pool->stratum_lock);
  2437. timer_unset(&pool->swork.tv_transparency);
  2438. pool->stratum_active = false;
  2439. pool->stratum_notify = false;
  2440. pool->swork.transparency_probed = false;
  2441. if (pool->stratum_curl)
  2442. curl_easy_cleanup(pool->stratum_curl);
  2443. pool->stratum_curl = curl_easy_init();
  2444. if (unlikely(!pool->stratum_curl))
  2445. quithere(1, "Failed to curl_easy_init");
  2446. if (pool->sockbuf)
  2447. pool->sockbuf[0] = '\0';
  2448. curl = pool->stratum_curl;
  2449. if (!pool->sockbuf) {
  2450. pool->sockbuf = calloc(RBUFSIZE, 1);
  2451. if (!pool->sockbuf)
  2452. quithere(1, "Failed to calloc pool sockbuf");
  2453. pool->sockbuf_size = RBUFSIZE;
  2454. }
  2455. curl_easy_setopt(curl, CURLOPT_FRESH_CONNECT, 1);
  2456. curl_easy_setopt(curl, CURLOPT_CONNECTTIMEOUT, 30);
  2457. curl_easy_setopt(curl, CURLOPT_ERRORBUFFER, pool->curl_err_str);
  2458. curl_easy_setopt(curl, CURLOPT_NOSIGNAL, 1);
  2459. if (!opt_delaynet)
  2460. curl_easy_setopt(curl, CURLOPT_TCP_NODELAY, 1);
  2461. /* We use DEBUGFUNCTION to count bytes sent/received, and verbose is needed
  2462. * to enable it */
  2463. curl_easy_setopt(curl, CURLOPT_DEBUGFUNCTION, curl_debug_cb);
  2464. curl_easy_setopt(curl, CURLOPT_DEBUGDATA, (void *)pool);
  2465. curl_easy_setopt(curl, CURLOPT_VERBOSE, 1);
  2466. // CURLINFO_LASTSOCKET is broken on Win64 (which has a wider SOCKET type than curl_easy_getinfo returns), so we use this hack for now
  2467. curl_easy_setopt(curl, CURLOPT_OPENSOCKETFUNCTION, grab_socket_opensocket_cb);
  2468. curl_easy_setopt(curl, CURLOPT_OPENSOCKETDATA, pool);
  2469. curl_easy_setopt(curl, CURLOPT_USE_SSL, CURLUSESSL_TRY);
  2470. curl_easy_setopt(curl, CURLOPT_SSL_VERIFYHOST, (long)(tlsca ? 2 : 0));
  2471. curl_easy_setopt(curl, CURLOPT_SSL_VERIFYPEER, (long)(tlsca ? 1 : 0));
  2472. if (pool->rpc_proxy) {
  2473. curl_easy_setopt(curl, CURLOPT_HTTPPROXYTUNNEL, 1);
  2474. curl_easy_setopt(curl, CURLOPT_PROXY, pool->rpc_proxy);
  2475. } else if (opt_socks_proxy) {
  2476. curl_easy_setopt(curl, CURLOPT_HTTPPROXYTUNNEL, 1);
  2477. curl_easy_setopt(curl, CURLOPT_PROXY, opt_socks_proxy);
  2478. curl_easy_setopt(curl, CURLOPT_PROXYTYPE, CURLPROXY_SOCKS5);
  2479. }
  2480. curl_easy_setopt(curl, CURLOPT_CONNECT_ONLY, 1);
  2481. retry:
  2482. /* Create a http url for use with curl */
  2483. sprintf(s, "http%s://%s:%s", try_tls ? "s" : "",
  2484. pool->sockaddr_url, pool->stratum_port);
  2485. curl_easy_setopt(curl, CURLOPT_URL, s);
  2486. pool->sock = INVSOCK;
  2487. if (curl_easy_perform(curl)) {
  2488. if (try_tls)
  2489. {
  2490. applog(LOG_DEBUG, "Stratum connect failed with TLS to pool %u: %s",
  2491. pool->pool_no, pool->curl_err_str);
  2492. if (!tls_only)
  2493. {
  2494. try_tls = false;
  2495. goto retry;
  2496. }
  2497. }
  2498. else
  2499. applog(LOG_INFO, "Stratum connect failed to pool %d: %s",
  2500. pool->pool_no, pool->curl_err_str);
  2501. errout:
  2502. curl_easy_cleanup(curl);
  2503. pool->stratum_curl = NULL;
  2504. goto out;
  2505. }
  2506. if (pool->sock == INVSOCK)
  2507. {
  2508. applog(LOG_ERR, "Stratum connect succeeded, but technical problem extracting socket (pool %u)", pool->pool_no);
  2509. goto errout;
  2510. }
  2511. keep_sockalive(pool->sock);
  2512. pool->cgminer_pool_stats.times_sent++;
  2513. pool->cgminer_pool_stats.times_received++;
  2514. ret = true;
  2515. out:
  2516. mutex_unlock(&pool->stratum_lock);
  2517. return ret;
  2518. }
  2519. static char *get_sessionid(json_t *val)
  2520. {
  2521. char *ret = NULL;
  2522. json_t *arr_val;
  2523. int arrsize, i;
  2524. arr_val = json_array_get(val, 0);
  2525. if (!arr_val || !json_is_array(arr_val))
  2526. goto out;
  2527. arrsize = json_array_size(arr_val);
  2528. for (i = 0; i < arrsize; i++) {
  2529. json_t *arr = json_array_get(arr_val, i);
  2530. const char *notify;
  2531. if (!arr | !json_is_array(arr))
  2532. break;
  2533. notify = __json_array_string(arr, 0);
  2534. if (!notify)
  2535. continue;
  2536. if (!strncasecmp(notify, "mining.notify", 13)) {
  2537. ret = json_array_string(arr, 1);
  2538. break;
  2539. }
  2540. }
  2541. out:
  2542. return ret;
  2543. }
  2544. void suspend_stratum(struct pool *pool)
  2545. {
  2546. clear_sockbuf(pool);
  2547. applog(LOG_INFO, "Closing socket for stratum pool %d", pool->pool_no);
  2548. mutex_lock(&pool->stratum_lock);
  2549. pool->stratum_active = pool->stratum_notify = false;
  2550. if (pool->stratum_curl) {
  2551. curl_easy_cleanup(pool->stratum_curl);
  2552. }
  2553. pool->stratum_curl = NULL;
  2554. pool->sock = INVSOCK;
  2555. mutex_unlock(&pool->stratum_lock);
  2556. }
  2557. bool initiate_stratum(struct pool *pool)
  2558. {
  2559. bool ret = false, recvd = false, noresume = false, sockd = false;
  2560. bool trysuggest = request_target_str;
  2561. char s[RBUFSIZE], *sret = NULL, *nonce1, *sessionid;
  2562. json_t *val = NULL, *res_val, *err_val;
  2563. json_error_t err;
  2564. int n2size;
  2565. resend:
  2566. if (!setup_stratum_curl(pool)) {
  2567. sockd = false;
  2568. goto out;
  2569. }
  2570. sockd = true;
  2571. clear_sock(pool);
  2572. if (trysuggest)
  2573. {
  2574. int sz = sprintf(s, "{\"id\": null, \"method\": \"mining.suggest_target\", \"params\": [\"%s\"]}", request_target_str);
  2575. if (!_stratum_send(pool, s, sz, true))
  2576. {
  2577. applog(LOG_DEBUG, "Pool %u: Failed to send suggest_target in initiate_stratum", pool->pool_no);
  2578. goto out;
  2579. }
  2580. recvd = true;
  2581. }
  2582. if (noresume) {
  2583. sprintf(s, "{\"id\": %d, \"method\": \"mining.subscribe\", \"params\": []}", swork_id++);
  2584. } else {
  2585. if (pool->sessionid)
  2586. sprintf(s, "{\"id\": %d, \"method\": \"mining.subscribe\", \"params\": [\""PACKAGE"/"VERSION"\", \"%s\"]}", swork_id++, pool->sessionid);
  2587. else
  2588. sprintf(s, "{\"id\": %d, \"method\": \"mining.subscribe\", \"params\": [\""PACKAGE"/"VERSION"\"]}", swork_id++);
  2589. }
  2590. if (!_stratum_send(pool, s, strlen(s), true)) {
  2591. applog(LOG_DEBUG, "Failed to send s in initiate_stratum");
  2592. goto out;
  2593. }
  2594. recvd = true;
  2595. if (!socket_full(pool, DEFAULT_SOCKWAIT)) {
  2596. applog(LOG_DEBUG, "Timed out waiting for response in initiate_stratum");
  2597. goto out;
  2598. }
  2599. sret = recv_line(pool);
  2600. if (!sret)
  2601. goto out;
  2602. val = JSON_LOADS(sret, &err);
  2603. free(sret);
  2604. if (!val) {
  2605. applog(LOG_INFO, "JSON decode failed(%d): %s", err.line, err.text);
  2606. goto out;
  2607. }
  2608. res_val = json_object_get(val, "result");
  2609. err_val = json_object_get(val, "error");
  2610. if (!res_val || json_is_null(res_val) ||
  2611. (err_val && !json_is_null(err_val))) {
  2612. char *ss;
  2613. if (err_val)
  2614. ss = json_dumps(err_val, JSON_INDENT(3));
  2615. else
  2616. ss = strdup("(unknown reason)");
  2617. applog(LOG_INFO, "JSON-RPC decode failed: %s", ss);
  2618. free(ss);
  2619. goto out;
  2620. }
  2621. sessionid = get_sessionid(res_val);
  2622. if (!sessionid)
  2623. applog(LOG_DEBUG, "Failed to get sessionid in initiate_stratum");
  2624. nonce1 = json_array_string(res_val, 1);
  2625. if (!nonce1) {
  2626. applog(LOG_INFO, "Failed to get nonce1 in initiate_stratum");
  2627. free(sessionid);
  2628. goto out;
  2629. }
  2630. n2size = json_integer_value(json_array_get(res_val, 2));
  2631. if (n2size < 1)
  2632. {
  2633. applog(LOG_INFO, "Failed to get n2size in initiate_stratum");
  2634. free(sessionid);
  2635. free(nonce1);
  2636. goto out;
  2637. }
  2638. cg_wlock(&pool->data_lock);
  2639. free(pool->sessionid);
  2640. pool->sessionid = sessionid;
  2641. free(pool->next_nonce1);
  2642. pool->next_nonce1 = nonce1;
  2643. pool->next_n2size = n2size;
  2644. cg_wunlock(&pool->data_lock);
  2645. if (sessionid)
  2646. applog(LOG_DEBUG, "Pool %d stratum session id: %s", pool->pool_no, pool->sessionid);
  2647. ret = true;
  2648. out:
  2649. if (val)
  2650. {
  2651. json_decref(val);
  2652. val = NULL;
  2653. }
  2654. if (ret) {
  2655. if (!pool->stratum_url)
  2656. pool->stratum_url = pool->sockaddr_url;
  2657. pool->stratum_active = true;
  2658. set_target_to_pdiff(pool->next_target, 1);
  2659. if (opt_protocol) {
  2660. applog(LOG_DEBUG, "Pool %d confirmed mining.subscribe with extranonce1 %s extran2size %d",
  2661. pool->pool_no, pool->next_nonce1, pool->next_n2size);
  2662. }
  2663. if (uri_get_param_bool(pool->rpc_url, "xnsub", false))
  2664. {
  2665. sprintf(s, "{\"id\": \"xnsub\", \"method\": \"mining.extranonce.subscribe\", \"params\": []}");
  2666. _stratum_send(pool, s, strlen(s), true);
  2667. }
  2668. } else {
  2669. if (recvd)
  2670. {
  2671. if (trysuggest)
  2672. {
  2673. applog(LOG_DEBUG, "Pool %u: Failed to connect stratum with mining.suggest_target, retrying without", pool->pool_no);
  2674. trysuggest = false;
  2675. goto resend;
  2676. }
  2677. if (!noresume)
  2678. {
  2679. applog(LOG_DEBUG, "Failed to resume stratum, trying afresh");
  2680. noresume = true;
  2681. goto resend;
  2682. }
  2683. }
  2684. applog(LOG_DEBUG, "Initiate stratum failed");
  2685. if (sockd)
  2686. suspend_stratum(pool);
  2687. }
  2688. return ret;
  2689. }
  2690. bool restart_stratum(struct pool *pool)
  2691. {
  2692. bool ret = true;
  2693. mutex_lock(&pool->pool_test_lock);
  2694. if (pool->stratum_active)
  2695. suspend_stratum(pool);
  2696. if (!initiate_stratum(pool))
  2697. return_via(out, ret = false);
  2698. if (!auth_stratum(pool))
  2699. return_via(out, ret = false);
  2700. out:
  2701. mutex_unlock(&pool->pool_test_lock);
  2702. return ret;
  2703. }
  2704. void dev_error_update(struct cgpu_info *dev, enum dev_reason reason)
  2705. {
  2706. dev->device_last_not_well = time(NULL);
  2707. cgtime(&dev->tv_device_last_not_well);
  2708. dev->device_not_well_reason = reason;
  2709. }
  2710. void dev_error(struct cgpu_info *dev, enum dev_reason reason)
  2711. {
  2712. dev_error_update(dev, reason);
  2713. switch (reason) {
  2714. case REASON_THREAD_FAIL_INIT:
  2715. dev->thread_fail_init_count++;
  2716. break;
  2717. case REASON_THREAD_ZERO_HASH:
  2718. dev->thread_zero_hash_count++;
  2719. break;
  2720. case REASON_THREAD_FAIL_QUEUE:
  2721. dev->thread_fail_queue_count++;
  2722. break;
  2723. case REASON_DEV_SICK_IDLE_60:
  2724. dev->dev_sick_idle_60_count++;
  2725. break;
  2726. case REASON_DEV_DEAD_IDLE_600:
  2727. dev->dev_dead_idle_600_count++;
  2728. break;
  2729. case REASON_DEV_NOSTART:
  2730. dev->dev_nostart_count++;
  2731. break;
  2732. case REASON_DEV_OVER_HEAT:
  2733. dev->dev_over_heat_count++;
  2734. break;
  2735. case REASON_DEV_THERMAL_CUTOFF:
  2736. dev->dev_thermal_cutoff_count++;
  2737. break;
  2738. case REASON_DEV_COMMS_ERROR:
  2739. dev->dev_comms_error_count++;
  2740. break;
  2741. case REASON_DEV_THROTTLE:
  2742. dev->dev_throttle_count++;
  2743. break;
  2744. }
  2745. }
  2746. /* Realloc an existing string to fit an extra string s, appending s to it. */
  2747. void *realloc_strcat(char *ptr, char *s)
  2748. {
  2749. size_t old = strlen(ptr), len = strlen(s);
  2750. char *ret;
  2751. if (!len)
  2752. return ptr;
  2753. len += old + 1;
  2754. align_len(&len);
  2755. ret = malloc(len);
  2756. if (unlikely(!ret))
  2757. quithere(1, "Failed to malloc");
  2758. sprintf(ret, "%s%s", ptr, s);
  2759. free(ptr);
  2760. return ret;
  2761. }
  2762. static
  2763. bool sanechars[] = {
  2764. false, false, false, false, false, false, false, false,
  2765. false, false, false, false, false, false, false, false,
  2766. false, false, false, false, false, false, false, false,
  2767. false, false, false, false, false, false, false, false,
  2768. false, false, false, false, false, false, false, false,
  2769. false, false, false, false, false, true , false, false,
  2770. true , true , true , true , true , true , true , true ,
  2771. true , true , false, false, false, false, false, false,
  2772. false, true , true , true , true , true , true , true ,
  2773. true , true , true , true , true , true , true , true ,
  2774. true , true , true , true , true , true , true , true ,
  2775. true , true , true , false, false, false, false, false,
  2776. false, true , true , true , true , true , true , true ,
  2777. true , true , true , true , true , true , true , true ,
  2778. true , true , true , true , true , true , true , true ,
  2779. true , true , true , false, false, false, false, false,
  2780. };
  2781. char *sanestr(char *o, char *s)
  2782. {
  2783. char *rv = o;
  2784. bool br = false;
  2785. for ( ; s[0]; ++s)
  2786. {
  2787. if (sanechars[s[0] & 0x7f])
  2788. {
  2789. if (br)
  2790. {
  2791. br = false;
  2792. if (s[0] >= '0' && s[0] <= '9')
  2793. (o++)[0] = '_';
  2794. }
  2795. (o++)[0] = s[0];
  2796. }
  2797. else
  2798. if (o != s && o[-1] >= '0' && o[-1] <= '9')
  2799. br = true;
  2800. }
  2801. o[0] = '\0';
  2802. return rv;
  2803. }
  2804. void RenameThread(const char* name)
  2805. {
  2806. #if defined(PR_SET_NAME)
  2807. // Only the first 15 characters are used (16 - NUL terminator)
  2808. prctl(PR_SET_NAME, name, 0, 0, 0);
  2809. #elif defined(__APPLE__)
  2810. pthread_setname_np(name);
  2811. #elif (defined(__FreeBSD__) || defined(__OpenBSD__))
  2812. pthread_set_name_np(pthread_self(), name);
  2813. #else
  2814. // Prevent warnings for unused parameters...
  2815. (void)name;
  2816. #endif
  2817. }
  2818. static pthread_key_t key_bfgtls;
  2819. struct bfgtls_data {
  2820. char *bfg_strerror_result;
  2821. size_t bfg_strerror_resultsz;
  2822. #ifdef WIN32
  2823. LPSTR bfg_strerror_socketresult;
  2824. #endif
  2825. #ifdef NEED_BFG_LOWL_VCOM
  2826. struct detectone_meta_info_t __detectone_meta_info;
  2827. #endif
  2828. unsigned probe_result_flags;
  2829. };
  2830. static
  2831. struct bfgtls_data *get_bfgtls()
  2832. {
  2833. struct bfgtls_data *bfgtls = pthread_getspecific(key_bfgtls);
  2834. if (bfgtls)
  2835. return bfgtls;
  2836. void *p;
  2837. bfgtls = malloc(sizeof(*bfgtls));
  2838. if (!bfgtls)
  2839. quithere(1, "malloc bfgtls failed");
  2840. p = malloc(64);
  2841. if (!p)
  2842. quithere(1, "malloc bfg_strerror_result failed");
  2843. *bfgtls = (struct bfgtls_data){
  2844. .bfg_strerror_resultsz = 64,
  2845. .bfg_strerror_result = p,
  2846. };
  2847. if (pthread_setspecific(key_bfgtls, bfgtls))
  2848. quithere(1, "pthread_setspecific failed");
  2849. return bfgtls;
  2850. }
  2851. static
  2852. void bfgtls_free(void * const p)
  2853. {
  2854. struct bfgtls_data * const bfgtls = p;
  2855. free(bfgtls->bfg_strerror_result);
  2856. #ifdef WIN32
  2857. if (bfgtls->bfg_strerror_socketresult)
  2858. LocalFree(bfgtls->bfg_strerror_socketresult);
  2859. #endif
  2860. free(bfgtls);
  2861. }
  2862. #ifdef NEED_BFG_LOWL_VCOM
  2863. struct detectone_meta_info_t *_detectone_meta_info()
  2864. {
  2865. return &get_bfgtls()->__detectone_meta_info;
  2866. }
  2867. #endif
  2868. unsigned *_bfg_probe_result_flags()
  2869. {
  2870. return &get_bfgtls()->probe_result_flags;
  2871. }
  2872. void bfg_init_threadlocal()
  2873. {
  2874. if (pthread_key_create(&key_bfgtls, bfgtls_free))
  2875. quithere(1, "pthread_key_create failed");
  2876. }
  2877. static
  2878. bool bfg_grow_buffer(char ** const bufp, size_t * const bufszp, size_t minimum)
  2879. {
  2880. if (minimum <= *bufszp)
  2881. return false;
  2882. while (minimum > *bufszp)
  2883. *bufszp = 2;
  2884. *bufp = realloc(*bufp, *bufszp);
  2885. if (unlikely(!*bufp))
  2886. quithere(1, "realloc failed");
  2887. return true;
  2888. }
  2889. static
  2890. const char *bfg_strcpy_growing_buffer(char ** const bufp, size_t * const bufszp, const char *src)
  2891. {
  2892. if (!src)
  2893. return NULL;
  2894. const size_t srcsz = strlen(src) + 1;
  2895. bfg_grow_buffer(bufp, bufszp, srcsz);
  2896. memcpy(*bufp, src, srcsz);
  2897. return *bufp;
  2898. }
  2899. // Guaranteed to always return some string (or quit)
  2900. const char *bfg_strerror(int e, enum bfg_strerror_type type)
  2901. {
  2902. static __maybe_unused pthread_mutex_t mutex = PTHREAD_MUTEX_INITIALIZER;
  2903. struct bfgtls_data *bfgtls = get_bfgtls();
  2904. size_t * const bufszp = &bfgtls->bfg_strerror_resultsz;
  2905. char ** const bufp = &bfgtls->bfg_strerror_result;
  2906. const char *have = NULL;
  2907. switch (type) {
  2908. case BST_LIBUSB:
  2909. // NOTE: Nested preprocessor checks since the latter isn't defined at all without the former
  2910. #ifdef HAVE_LIBUSB
  2911. # if HAVE_DECL_LIBUSB_ERROR_NAME
  2912. // libusb makes no guarantees for thread-safety or persistence
  2913. mutex_lock(&mutex);
  2914. have = bfg_strcpy_growing_buffer(bufp, bufszp, libusb_error_name(e));
  2915. mutex_unlock(&mutex);
  2916. # endif
  2917. #endif
  2918. break;
  2919. case BST_SOCKET:
  2920. case BST_SYSTEM:
  2921. {
  2922. #ifdef WIN32
  2923. // Windows has a different namespace for system and socket errors
  2924. LPSTR *msg = &bfgtls->bfg_strerror_socketresult;
  2925. if (*msg)
  2926. LocalFree(*msg);
  2927. if (FormatMessage(FORMAT_MESSAGE_ALLOCATE_BUFFER | FORMAT_MESSAGE_FROM_SYSTEM, 0, e, 0, (LPSTR)msg, 0, 0))
  2928. {
  2929. LPSTR msgp = *msg;
  2930. size_t n = strlen(msgp);
  2931. while (isCspace(msgp[--n]))
  2932. msgp[n] = '\0';
  2933. return *msg;
  2934. }
  2935. *msg = NULL;
  2936. break;
  2937. #endif
  2938. }
  2939. // Fallthru on non-WIN32
  2940. case BST_ERRNO:
  2941. {
  2942. #ifdef __STRERROR_S_WORKS
  2943. // FIXME: Not sure how to get this on MingW64
  2944. retry:
  2945. if (likely(!strerror_s(*bufp, *bufszp, e)))
  2946. {
  2947. if (bfg_grow_buffer(bufp, bufszp, strlen(*bufp) + 2))
  2948. goto retry;
  2949. return *bufp;
  2950. }
  2951. // TODO: XSI strerror_r
  2952. // TODO: GNU strerror_r
  2953. #else
  2954. mutex_lock(&mutex);
  2955. have = bfg_strcpy_growing_buffer(bufp, bufszp, strerror(e));
  2956. mutex_unlock(&mutex);
  2957. #endif
  2958. }
  2959. }
  2960. if (have)
  2961. return *bufp;
  2962. // Failback: Stringify the number
  2963. static const char fmt[] = "%s error #%d", *typestr;
  2964. switch (type) {
  2965. case BST_ERRNO:
  2966. typestr = "System";
  2967. break;
  2968. case BST_SOCKET:
  2969. typestr = "Socket";
  2970. break;
  2971. case BST_LIBUSB:
  2972. typestr = "libusb";
  2973. break;
  2974. default:
  2975. typestr = "Unexpected";
  2976. }
  2977. int sz = snprintf((char*)bfgtls, 0, fmt, typestr, e) + 1;
  2978. bfg_grow_buffer(bufp, bufszp, sz);
  2979. sprintf(*bufp, fmt, typestr, e);
  2980. return *bufp;
  2981. }
  2982. void notifier_init(notifier_t pipefd)
  2983. {
  2984. #ifdef WIN32
  2985. #define WindowsErrorStr(e) bfg_strerror(e, BST_SOCKET)
  2986. SOCKET listener, connecter, acceptor;
  2987. listener = bfg_socket(AF_INET, SOCK_STREAM, 0);
  2988. if (listener == INVALID_SOCKET)
  2989. quit(1, "Failed to create listener socket"IN_FMT_FFL": %s",
  2990. __FILE__, __func__, __LINE__, WindowsErrorStr(WSAGetLastError()));
  2991. connecter = bfg_socket(AF_INET, SOCK_STREAM, 0);
  2992. if (connecter == INVALID_SOCKET)
  2993. quit(1, "Failed to create connect socket"IN_FMT_FFL": %s",
  2994. __FILE__, __func__, __LINE__, WindowsErrorStr(WSAGetLastError()));
  2995. struct sockaddr_in inaddr = {
  2996. .sin_family = AF_INET,
  2997. .sin_addr = {
  2998. .s_addr = htonl(INADDR_LOOPBACK),
  2999. },
  3000. .sin_port = 0,
  3001. };
  3002. {
  3003. static const int reuse = 1;
  3004. setsockopt(listener, SOL_SOCKET, SO_REUSEADDR, (const char*)&reuse, sizeof(reuse));
  3005. }
  3006. if (bind(listener, (struct sockaddr*)&inaddr, sizeof(inaddr)) == SOCKET_ERROR)
  3007. quit(1, "Failed to bind listener socket"IN_FMT_FFL": %s",
  3008. __FILE__, __func__, __LINE__, WindowsErrorStr(WSAGetLastError()));
  3009. socklen_t inaddr_sz = sizeof(inaddr);
  3010. if (getsockname(listener, (struct sockaddr*)&inaddr, &inaddr_sz) == SOCKET_ERROR)
  3011. quit(1, "Failed to getsockname"IN_FMT_FFL": %s",
  3012. __FILE__, __func__, __LINE__, WindowsErrorStr(WSAGetLastError()));
  3013. if (listen(listener, 1) == SOCKET_ERROR)
  3014. quit(1, "Failed to listen"IN_FMT_FFL": %s",
  3015. __FILE__, __func__, __LINE__, WindowsErrorStr(WSAGetLastError()));
  3016. inaddr.sin_family = AF_INET;
  3017. inaddr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
  3018. if (connect(connecter, (struct sockaddr*)&inaddr, inaddr_sz) == SOCKET_ERROR)
  3019. quit(1, "Failed to connect"IN_FMT_FFL": %s",
  3020. __FILE__, __func__, __LINE__, WindowsErrorStr(WSAGetLastError()));
  3021. acceptor = accept(listener, NULL, NULL);
  3022. if (acceptor == INVALID_SOCKET)
  3023. quit(1, "Failed to accept"IN_FMT_FFL": %s",
  3024. __FILE__, __func__, __LINE__, WindowsErrorStr(WSAGetLastError()));
  3025. closesocket(listener);
  3026. pipefd[0] = connecter;
  3027. pipefd[1] = acceptor;
  3028. #else
  3029. if (pipe(pipefd))
  3030. quithere(1, "Failed to create pipe");
  3031. #endif
  3032. }
  3033. void *bfg_slurp_file(void * const bufp, size_t bufsz, const char * const filename)
  3034. {
  3035. char *buf = bufp;
  3036. FILE * const F = fopen(filename, "r");
  3037. if (!F)
  3038. goto err;
  3039. if (!buf)
  3040. {
  3041. fseek(F, 0, SEEK_END);
  3042. const long filesz = ftell(F);
  3043. if (unlikely(filesz < 0))
  3044. {
  3045. fclose(F);
  3046. goto err;
  3047. }
  3048. rewind(F);
  3049. bufsz = filesz + 1;
  3050. buf = malloc(bufsz);
  3051. }
  3052. const size_t rsz = fread(buf, 1, bufsz - 1, F);
  3053. fclose(F);
  3054. buf[rsz] = '\0';
  3055. return buf;
  3056. err:
  3057. if (buf)
  3058. buf[0] = '\0';
  3059. return NULL;
  3060. }
  3061. void notifier_wake(notifier_t fd)
  3062. {
  3063. if (fd[1] == INVSOCK)
  3064. return;
  3065. if (1 !=
  3066. #ifdef WIN32
  3067. send(fd[1], "\0", 1, 0)
  3068. #else
  3069. write(fd[1], "\0", 1)
  3070. #endif
  3071. )
  3072. applog(LOG_WARNING, "Error trying to wake notifier");
  3073. }
  3074. void notifier_read(notifier_t fd)
  3075. {
  3076. char buf[0x10];
  3077. #ifdef WIN32
  3078. IGNORE_RETURN_VALUE(recv(fd[0], buf, sizeof(buf), 0));
  3079. #else
  3080. IGNORE_RETURN_VALUE(read(fd[0], buf, sizeof(buf)));
  3081. #endif
  3082. }
  3083. void notifier_init_invalid(notifier_t fd)
  3084. {
  3085. fd[0] = fd[1] = INVSOCK;
  3086. }
  3087. void notifier_destroy(notifier_t fd)
  3088. {
  3089. #ifdef WIN32
  3090. closesocket(fd[0]);
  3091. closesocket(fd[1]);
  3092. #else
  3093. close(fd[0]);
  3094. close(fd[1]);
  3095. #endif
  3096. fd[0] = fd[1] = INVSOCK;
  3097. }
  3098. void _bytes_alloc_failure(size_t sz)
  3099. {
  3100. quit(1, "bytes_resize failed to allocate %lu bytes", (unsigned long)sz);
  3101. }
  3102. char *trimmed_strdup(const char *s)
  3103. {
  3104. size_t n;
  3105. char *c;
  3106. while (isspace(s[0]))
  3107. ++s;
  3108. n = strlen(s) - 1;
  3109. while (isspace(s[n]))
  3110. --n;
  3111. ++n;
  3112. c = malloc(n + 1);
  3113. c[n] = '\0';
  3114. memcpy(c, s, n);
  3115. return c;
  3116. }
  3117. void *cmd_thread(void *cmdp)
  3118. {
  3119. const char *cmd = cmdp;
  3120. applog(LOG_DEBUG, "Executing command: %s", cmd);
  3121. int rc = system(cmd);
  3122. if (rc)
  3123. applog(LOG_WARNING, "Command returned %d exit code: %s", rc, cmd);
  3124. return NULL;
  3125. }
  3126. void run_cmd(const char *cmd)
  3127. {
  3128. if (!cmd)
  3129. return;
  3130. pthread_t pth;
  3131. pthread_create(&pth, NULL, cmd_thread, (void*)cmd);
  3132. }
  3133. uint8_t crc5usb(unsigned char *ptr, uint8_t len)
  3134. {
  3135. uint8_t i, j, k;
  3136. uint8_t crc = 0x1f;
  3137. uint8_t crcin[5] = {1, 1, 1, 1, 1};
  3138. uint8_t crcout[5] = {1, 1, 1, 1, 1};
  3139. uint8_t din = 0;
  3140. j = 0x80;
  3141. k = 0;
  3142. for (i = 0; i < len; i++)
  3143. {
  3144. if (*ptr & j)
  3145. din = 1;
  3146. else
  3147. din = 0;
  3148. crcout[0] = crcin[4] ^ din;
  3149. crcout[1] = crcin[0];
  3150. crcout[2] = crcin[1] ^ crcin[4] ^ din;
  3151. crcout[3] = crcin[2];
  3152. crcout[4] = crcin[3];
  3153. j = j >> 1;
  3154. k++;
  3155. if (k == 8)
  3156. {
  3157. j = 0x80;
  3158. k = 0;
  3159. ptr++;
  3160. }
  3161. memcpy(crcin, crcout, 5);
  3162. }
  3163. crc = 0;
  3164. if(crcin[4])
  3165. crc |= 0x10;
  3166. if(crcin[3])
  3167. crc |= 0x08;
  3168. if(crcin[2])
  3169. crc |= 0x04;
  3170. if(crcin[1])
  3171. crc |= 0x02;
  3172. if(crcin[0])
  3173. crc |= 0x01;
  3174. return crc;
  3175. }
  3176. static uint8_t _crc8ccitt_table[0x100];
  3177. void bfg_init_checksums(void)
  3178. {
  3179. for (int i = 0; i < 0x100; ++i)
  3180. {
  3181. uint8_t crc = i;
  3182. for (int j = 0; j < 8; ++j)
  3183. crc = (crc << 1) ^ ((crc & 0x80) ? 7 : 0);
  3184. _crc8ccitt_table[i] = crc & 0xff;
  3185. }
  3186. }
  3187. uint8_t crc8ccitt(const void * const buf, const size_t buflen)
  3188. {
  3189. const uint8_t *p = buf;
  3190. uint8_t crc = 0xff;
  3191. for (int i = 0; i < buflen; ++i)
  3192. crc = _crc8ccitt_table[crc ^ *p++];
  3193. return crc;
  3194. }
  3195. static uint16_t crc16tab[] = {
  3196. 0x0000,0x1021,0x2042,0x3063,0x4084,0x50a5,0x60c6,0x70e7,
  3197. 0x8108,0x9129,0xa14a,0xb16b,0xc18c,0xd1ad,0xe1ce,0xf1ef,
  3198. 0x1231,0x0210,0x3273,0x2252,0x52b5,0x4294,0x72f7,0x62d6,
  3199. 0x9339,0x8318,0xb37b,0xa35a,0xd3bd,0xc39c,0xf3ff,0xe3de,
  3200. 0x2462,0x3443,0x0420,0x1401,0x64e6,0x74c7,0x44a4,0x5485,
  3201. 0xa56a,0xb54b,0x8528,0x9509,0xe5ee,0xf5cf,0xc5ac,0xd58d,
  3202. 0x3653,0x2672,0x1611,0x0630,0x76d7,0x66f6,0x5695,0x46b4,
  3203. 0xb75b,0xa77a,0x9719,0x8738,0xf7df,0xe7fe,0xd79d,0xc7bc,
  3204. 0x48c4,0x58e5,0x6886,0x78a7,0x0840,0x1861,0x2802,0x3823,
  3205. 0xc9cc,0xd9ed,0xe98e,0xf9af,0x8948,0x9969,0xa90a,0xb92b,
  3206. 0x5af5,0x4ad4,0x7ab7,0x6a96,0x1a71,0x0a50,0x3a33,0x2a12,
  3207. 0xdbfd,0xcbdc,0xfbbf,0xeb9e,0x9b79,0x8b58,0xbb3b,0xab1a,
  3208. 0x6ca6,0x7c87,0x4ce4,0x5cc5,0x2c22,0x3c03,0x0c60,0x1c41,
  3209. 0xedae,0xfd8f,0xcdec,0xddcd,0xad2a,0xbd0b,0x8d68,0x9d49,
  3210. 0x7e97,0x6eb6,0x5ed5,0x4ef4,0x3e13,0x2e32,0x1e51,0x0e70,
  3211. 0xff9f,0xefbe,0xdfdd,0xcffc,0xbf1b,0xaf3a,0x9f59,0x8f78,
  3212. 0x9188,0x81a9,0xb1ca,0xa1eb,0xd10c,0xc12d,0xf14e,0xe16f,
  3213. 0x1080,0x00a1,0x30c2,0x20e3,0x5004,0x4025,0x7046,0x6067,
  3214. 0x83b9,0x9398,0xa3fb,0xb3da,0xc33d,0xd31c,0xe37f,0xf35e,
  3215. 0x02b1,0x1290,0x22f3,0x32d2,0x4235,0x5214,0x6277,0x7256,
  3216. 0xb5ea,0xa5cb,0x95a8,0x8589,0xf56e,0xe54f,0xd52c,0xc50d,
  3217. 0x34e2,0x24c3,0x14a0,0x0481,0x7466,0x6447,0x5424,0x4405,
  3218. 0xa7db,0xb7fa,0x8799,0x97b8,0xe75f,0xf77e,0xc71d,0xd73c,
  3219. 0x26d3,0x36f2,0x0691,0x16b0,0x6657,0x7676,0x4615,0x5634,
  3220. 0xd94c,0xc96d,0xf90e,0xe92f,0x99c8,0x89e9,0xb98a,0xa9ab,
  3221. 0x5844,0x4865,0x7806,0x6827,0x18c0,0x08e1,0x3882,0x28a3,
  3222. 0xcb7d,0xdb5c,0xeb3f,0xfb1e,0x8bf9,0x9bd8,0xabbb,0xbb9a,
  3223. 0x4a75,0x5a54,0x6a37,0x7a16,0x0af1,0x1ad0,0x2ab3,0x3a92,
  3224. 0xfd2e,0xed0f,0xdd6c,0xcd4d,0xbdaa,0xad8b,0x9de8,0x8dc9,
  3225. 0x7c26,0x6c07,0x5c64,0x4c45,0x3ca2,0x2c83,0x1ce0,0x0cc1,
  3226. 0xef1f,0xff3e,0xcf5d,0xdf7c,0xaf9b,0xbfba,0x8fd9,0x9ff8,
  3227. 0x6e17,0x7e36,0x4e55,0x5e74,0x2e93,0x3eb2,0x0ed1,0x1ef0,
  3228. };
  3229. static
  3230. uint16_t crc16_floating(uint16_t next_byte, uint16_t seed)
  3231. {
  3232. return ((seed << 8) ^ crc16tab[(seed >> 8) ^ next_byte]) & 0xFFFF;
  3233. }
  3234. uint16_t crc16(const void *p, size_t sz, uint16_t crc)
  3235. {
  3236. const uint8_t * const s = p;
  3237. for (size_t i = 0; i < sz; ++i)
  3238. crc = crc16_floating(s[i], crc);
  3239. return crc;
  3240. }