driver-bitforce.c 51 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890
  1. /*
  2. * Copyright 2012-2013 Luke Dashjr
  3. * Copyright 2012 Con Kolivas
  4. *
  5. * This program is free software; you can redistribute it and/or modify it
  6. * under the terms of the GNU General Public License as published by the Free
  7. * Software Foundation; either version 3 of the License, or (at your option)
  8. * any later version. See COPYING for more details.
  9. */
  10. #include "config.h"
  11. #include <limits.h>
  12. #include <pthread.h>
  13. #include <stdint.h>
  14. #include <stdio.h>
  15. #include <strings.h>
  16. #include <sys/time.h>
  17. #include <unistd.h>
  18. #include "compat.h"
  19. #include "deviceapi.h"
  20. #include "miner.h"
  21. #include "fpgautils.h"
  22. #include "util.h"
  23. #define BITFORCE_SLEEP_MS 500
  24. #define BITFORCE_TIMEOUT_S 7
  25. #define BITFORCE_TIMEOUT_MS (BITFORCE_TIMEOUT_S * 1000)
  26. #define BITFORCE_LONG_TIMEOUT_S 25
  27. #define BITFORCE_LONG_TIMEOUT_MS (BITFORCE_LONG_TIMEOUT_S * 1000)
  28. #define BITFORCE_CHECK_INTERVAL_MS 10
  29. #define WORK_CHECK_INTERVAL_MS 50
  30. #define MAX_START_DELAY_MS 100
  31. #define tv_to_ms(tval) ((unsigned long)(tval.tv_sec * 1000 + tval.tv_usec / 1000))
  32. #define TIME_AVG_CONSTANT 8
  33. #define BITFORCE_QRESULT_LINE_LEN 165
  34. #define BITFORCE_MAX_QUEUED_MAX 40
  35. #define BITFORCE_MIN_QUEUED_MAX 10
  36. #define BITFORCE_MAX_QRESULTS 40
  37. #define BITFORCE_GOAL_QRESULTS 5
  38. #define BITFORCE_MIN_QRESULT_WAIT BITFORCE_CHECK_INTERVAL_MS
  39. #define BITFORCE_MAX_QRESULT_WAIT 1000
  40. #define BITFORCE_MAX_BQUEUE_AT_ONCE 5
  41. enum bitforce_proto {
  42. BFP_WORK,
  43. BFP_RANGE,
  44. BFP_QUEUE,
  45. BFP_BQUEUE,
  46. };
  47. static const char *protonames[] = {
  48. "full work",
  49. "nonce range",
  50. "work queue",
  51. "bulk queue",
  52. };
  53. struct device_drv bitforce_drv;
  54. struct device_drv bitforce_queue_api;
  55. // Code must deal with a timeout
  56. #define BFopen(devpath) serial_open(devpath, 0, 250, true)
  57. static void BFgets(char *buf, size_t bufLen, int fd)
  58. {
  59. char *obuf = buf;
  60. do {
  61. buf[0] = '\0';
  62. --bufLen;
  63. } while (likely(bufLen && read(fd, buf, 1) == 1 && (buf++)[0] != '\n'));
  64. buf[0] = '\0';
  65. if (unlikely(opt_dev_protocol))
  66. applog(LOG_DEBUG, "DEVPROTO: GETS (fd=%d): %s", fd, obuf);
  67. }
  68. static ssize_t BFwrite(int fd, const void *buf, ssize_t bufLen)
  69. {
  70. if ((bufLen) != write(fd, buf, bufLen))
  71. return 0;
  72. else
  73. return bufLen;
  74. }
  75. static ssize_t bitforce_send(int fd, int procid, const void *buf, ssize_t bufLen)
  76. {
  77. if (!procid)
  78. return BFwrite(fd, buf, bufLen);
  79. if (bufLen > 255)
  80. return -1;
  81. size_t bufLeft = bufLen + 3;
  82. char realbuf[bufLeft], *bufp;
  83. ssize_t rv;
  84. memcpy(&realbuf[3], buf, bufLen);
  85. realbuf[0] = '@';
  86. realbuf[1] = procid;
  87. realbuf[2] = bufLen;
  88. bufp = realbuf;
  89. while (true)
  90. {
  91. rv = BFwrite(fd, bufp, bufLeft);
  92. if (rv <= 0)
  93. return rv;
  94. bufLeft -= rv;
  95. }
  96. return bufLen;
  97. }
  98. static
  99. void bitforce_cmd1(int fd, int procid, void *buf, size_t bufsz, const char *cmd)
  100. {
  101. if (unlikely(opt_dev_protocol))
  102. applog(LOG_DEBUG, "DEVPROTO: CMD1 (fd=%d xlink=%d): %s", fd, procid, cmd);
  103. bitforce_send(fd, procid, cmd, 3);
  104. BFgets(buf, bufsz, fd);
  105. }
  106. static
  107. void bitforce_cmd2(int fd, int procid, void *buf, size_t bufsz, const char *cmd, void *data, size_t datasz)
  108. {
  109. bitforce_cmd1(fd, procid, buf, bufsz, cmd);
  110. if (strncasecmp(buf, "OK", 2))
  111. return;
  112. if (unlikely(opt_dev_protocol))
  113. {
  114. char *hex = bin2hex(data, datasz);
  115. applog(LOG_DEBUG, "DEVPROTO: CMD2 (fd=%d xlink=%d): %s", fd, procid, hex);
  116. free(hex);
  117. }
  118. bitforce_send(fd, procid, data, datasz);
  119. BFgets(buf, bufsz, fd);
  120. }
  121. #define BFclose(fd) close(fd)
  122. struct bitforce_init_data {
  123. bool sc;
  124. long devmask;
  125. int *parallels;
  126. };
  127. static bool bitforce_detect_one(const char *devpath)
  128. {
  129. int fdDev = serial_open(devpath, 0, 10, true);
  130. struct cgpu_info *bitforce;
  131. char pdevbuf[0x100];
  132. size_t pdevbuf_len;
  133. char *s;
  134. int procs = 1, parallel = 1;
  135. struct bitforce_init_data *initdata;
  136. applog(LOG_DEBUG, "BFL: Attempting to open %s", devpath);
  137. if (unlikely(fdDev == -1)) {
  138. applog(LOG_DEBUG, "BFL: Failed to open %s", devpath);
  139. return false;
  140. }
  141. bitforce_cmd1(fdDev, 0, pdevbuf, sizeof(pdevbuf), "ZGX");
  142. if (unlikely(!pdevbuf[0])) {
  143. applog(LOG_DEBUG, "BFL: Error reading/timeout (ZGX)");
  144. return 0;
  145. }
  146. if (unlikely(!strstr(pdevbuf, "SHA256"))) {
  147. applog(LOG_DEBUG, "BFL: Didn't recognise BitForce on %s", devpath);
  148. BFclose(fdDev);
  149. return false;
  150. }
  151. applog(LOG_DEBUG, "Found BitForce device on %s", devpath);
  152. initdata = malloc(sizeof(*initdata));
  153. *initdata = (struct bitforce_init_data){
  154. .sc = false,
  155. };
  156. for ( bitforce_cmd1(fdDev, 0, pdevbuf, sizeof(pdevbuf), "ZCX");
  157. strncasecmp(pdevbuf, "OK", 2);
  158. BFgets(pdevbuf, sizeof(pdevbuf), fdDev) )
  159. {
  160. pdevbuf_len = strlen(pdevbuf);
  161. if (unlikely(!pdevbuf_len))
  162. continue;
  163. pdevbuf[pdevbuf_len-1] = '\0'; // trim newline
  164. applog(LOG_DEBUG, " %s", pdevbuf);
  165. if (!strncasecmp(pdevbuf, "DEVICES IN CHAIN:", 17))
  166. procs = atoi(&pdevbuf[17]);
  167. else
  168. if (!strncasecmp(pdevbuf, "CHAIN PRESENCE MASK:", 20))
  169. initdata->devmask = strtol(&pdevbuf[20], NULL, 16);
  170. else
  171. if (!strncasecmp(pdevbuf, "DEVICE:", 7) && strstr(pdevbuf, "SC"))
  172. initdata->sc = true;
  173. else
  174. if (!strncasecmp(pdevbuf, "CHIP PARALLELIZATION: YES @", 27))
  175. parallel = atoi(&pdevbuf[27]);
  176. }
  177. initdata->parallels = malloc(sizeof(initdata->parallels[0]) * procs);
  178. initdata->parallels[0] = parallel;
  179. for (int proc = 1; proc < procs; ++proc)
  180. {
  181. applog(LOG_DEBUG, "Slave board %d:", proc);
  182. initdata->parallels[proc] = 1;
  183. for ( bitforce_cmd1(fdDev, proc, pdevbuf, sizeof(pdevbuf), "ZCX");
  184. strncasecmp(pdevbuf, "OK", 2);
  185. BFgets(pdevbuf, sizeof(pdevbuf), fdDev) )
  186. {
  187. pdevbuf_len = strlen(pdevbuf);
  188. if (unlikely(!pdevbuf_len))
  189. continue;
  190. pdevbuf[pdevbuf_len-1] = '\0'; // trim newline
  191. applog(LOG_DEBUG, " %s", pdevbuf);
  192. if (!strncasecmp(pdevbuf, "CHIP PARALLELIZATION: YES @", 27))
  193. initdata->parallels[proc] = atoi(&pdevbuf[27]);
  194. }
  195. parallel += initdata->parallels[proc];
  196. }
  197. BFclose(fdDev);
  198. if (unlikely(procs < parallel && !initdata->sc))
  199. {
  200. // Only bitforce_queue supports parallelization, so force SC mode and hope for the best
  201. applog(LOG_WARNING, "Chip parallelization detected with non-SC device; this is not supported!");
  202. initdata->sc = true;
  203. }
  204. // We have a real BitForce!
  205. bitforce = calloc(1, sizeof(*bitforce));
  206. bitforce->drv = &bitforce_drv;
  207. if (initdata->sc)
  208. bitforce->drv = &bitforce_queue_api;
  209. bitforce->device_path = strdup(devpath);
  210. bitforce->deven = DEV_ENABLED;
  211. bitforce->procs = parallel;
  212. bitforce->threads = 1;
  213. if (likely((!memcmp(pdevbuf, ">>>ID: ", 7)) && (s = strstr(pdevbuf + 3, ">>>")))) {
  214. s[0] = '\0';
  215. bitforce->name = strdup(pdevbuf + 7);
  216. }
  217. bitforce->device_data = initdata;
  218. mutex_init(&bitforce->device_mutex);
  219. return add_cgpu(bitforce);
  220. }
  221. static int bitforce_detect_auto(void)
  222. {
  223. return serial_autodetect(bitforce_detect_one, "BitFORCE", "SHA256");
  224. }
  225. static void bitforce_detect(void)
  226. {
  227. serial_detect_auto(&bitforce_drv, bitforce_detect_one, bitforce_detect_auto);
  228. }
  229. struct bitforce_data {
  230. int xlink_id;
  231. unsigned char next_work_ob[70]; // Data aligned for 32-bit access
  232. unsigned char *next_work_obs; // Start of data to send
  233. unsigned char next_work_obsz;
  234. const char *next_work_cmd;
  235. char noncebuf[14 + ((BITFORCE_MAX_QRESULTS+1) * BITFORCE_QRESULT_LINE_LEN)];
  236. int poll_func;
  237. enum bitforce_proto proto;
  238. bool sc;
  239. int queued;
  240. int queued_max;
  241. int parallel;
  242. bool already_have_results;
  243. bool just_flushed;
  244. int ready_to_queue;
  245. bool want_to_send_queue;
  246. unsigned result_busy_polled;
  247. unsigned sleep_ms_default;
  248. struct timeval tv_hashmeter_start;
  249. float temp[2];
  250. };
  251. struct bitforce_proc_data {
  252. struct cgpu_info *cgpu;
  253. bool handles_board; // The first processor handles the queue for the entire board
  254. };
  255. static void bitforce_clear_buffer(struct cgpu_info *);
  256. static
  257. void bitforce_comm_error(struct thr_info *thr)
  258. {
  259. struct cgpu_info *bitforce = thr->cgpu;
  260. struct bitforce_data *data = bitforce->device_data;
  261. int *p_fdDev = &bitforce->device->device_fd;
  262. data->noncebuf[0] = '\0';
  263. applog(LOG_ERR, "%"PRIpreprv": Comms error", bitforce->proc_repr);
  264. dev_error(bitforce, REASON_DEV_COMMS_ERROR);
  265. ++bitforce->hw_errors;
  266. ++hw_errors;
  267. BFclose(*p_fdDev);
  268. int fd = *p_fdDev = BFopen(bitforce->device_path);
  269. if (fd == -1)
  270. {
  271. applog(LOG_ERR, "%s: Error reopening %s", bitforce->dev_repr, bitforce->device_path);
  272. return;
  273. }
  274. /* empty read buffer */
  275. bitforce_clear_buffer(bitforce);
  276. }
  277. static void get_bitforce_statline_before(char *buf, struct cgpu_info *bitforce)
  278. {
  279. struct bitforce_data *data = bitforce->device_data;
  280. if (data->temp[0] > 0 && data->temp[1] > 0)
  281. tailsprintf(buf, "%5.1fC/%4.1fC | ", data->temp[0], data->temp[1]);
  282. else
  283. if (bitforce->temp > 0)
  284. tailsprintf(buf, "%5.1fC | ", bitforce->temp);
  285. else
  286. tailsprintf(buf, " | ");
  287. }
  288. static bool bitforce_thread_prepare(struct thr_info *thr)
  289. {
  290. struct cgpu_info *bitforce = thr->cgpu;
  291. int fdDev = BFopen(bitforce->device_path);
  292. struct timeval now;
  293. if (unlikely(fdDev == -1)) {
  294. applog(LOG_ERR, "%s: Failed to open %s", bitforce->dev_repr, bitforce->device_path);
  295. return false;
  296. }
  297. bitforce->device_fd = fdDev;
  298. applog(LOG_INFO, "%s: Opened %s", bitforce->dev_repr, bitforce->device_path);
  299. cgtime(&now);
  300. get_datestamp(bitforce->init, &now);
  301. return true;
  302. }
  303. static void __bitforce_clear_buffer(int fdDev)
  304. {
  305. char pdevbuf[0x100];
  306. int count = 0;
  307. do {
  308. pdevbuf[0] = '\0';
  309. BFgets(pdevbuf, sizeof(pdevbuf), fdDev);
  310. } while (pdevbuf[0] && (++count < 10));
  311. }
  312. static void bitforce_clear_buffer(struct cgpu_info *bitforce)
  313. {
  314. pthread_mutex_t *mutexp = &bitforce->device->device_mutex;
  315. int fdDev;
  316. mutex_lock(mutexp);
  317. fdDev = bitforce->device->device_fd;
  318. if (fdDev)
  319. {
  320. applog(LOG_DEBUG, "%"PRIpreprv": Clearing read buffer", bitforce->proc_repr);
  321. __bitforce_clear_buffer(fdDev);
  322. }
  323. mutex_unlock(mutexp);
  324. }
  325. void bitforce_reinit(struct cgpu_info *bitforce)
  326. {
  327. struct bitforce_data *data = bitforce->device_data;
  328. struct thr_info *thr = bitforce->thr[0];
  329. const char *devpath = bitforce->device_path;
  330. pthread_mutex_t *mutexp = &bitforce->device->device_mutex;
  331. int *p_fdDev = &bitforce->device->device_fd;
  332. int fdDev, retries = 0;
  333. char pdevbuf[0x100];
  334. char *s;
  335. mutex_lock(mutexp);
  336. fdDev = *p_fdDev;
  337. applog(LOG_WARNING, "%"PRIpreprv": Re-initialising", bitforce->proc_repr);
  338. if (fdDev) {
  339. BFclose(fdDev);
  340. nmsleep(5000);
  341. *p_fdDev = 0;
  342. }
  343. fdDev = BFopen(devpath);
  344. if (unlikely(fdDev == -1)) {
  345. mutex_unlock(mutexp);
  346. applog(LOG_ERR, "%s: Failed to open %s", bitforce->dev_repr, devpath);
  347. return;
  348. }
  349. __bitforce_clear_buffer(fdDev);
  350. do {
  351. bitforce_cmd1(fdDev, 0, pdevbuf, sizeof(pdevbuf), "ZGX");
  352. if (unlikely(!pdevbuf[0])) {
  353. mutex_unlock(mutexp);
  354. BFclose(fdDev);
  355. applog(LOG_ERR, "%s: Error reading/timeout (ZGX)", bitforce->dev_repr);
  356. return;
  357. }
  358. if (retries++)
  359. nmsleep(10);
  360. } while (strstr(pdevbuf, "BUSY") && (retries * 10 < BITFORCE_TIMEOUT_MS));
  361. if (unlikely(!strstr(pdevbuf, "SHA256"))) {
  362. mutex_unlock(mutexp);
  363. BFclose(fdDev);
  364. applog(LOG_ERR, "%s: Didn't recognise BitForce on %s returned: %s", bitforce->dev_repr, devpath, pdevbuf);
  365. return;
  366. }
  367. if (likely((!memcmp(pdevbuf, ">>>ID: ", 7)) && (s = strstr(pdevbuf + 3, ">>>")))) {
  368. s[0] = '\0';
  369. free((void*)bitforce->name);
  370. bitforce->name = strdup(pdevbuf + 7);
  371. }
  372. *p_fdDev = fdDev;
  373. bitforce->sleep_ms = data->sleep_ms_default;
  374. if (bitforce->drv == &bitforce_queue_api)
  375. {
  376. struct work *work, *tmp;
  377. timer_set_delay_from_now(&thr->tv_poll, 0);
  378. notifier_wake(thr->notifier);
  379. bitforce_cmd1(fdDev, data->xlink_id, pdevbuf, sizeof(pdevbuf), "ZQX");
  380. DL_FOREACH_SAFE(thr->work_list, work, tmp)
  381. {
  382. DL_DELETE(thr->work_list, work);
  383. free_work(work);
  384. }
  385. data->queued = 0;
  386. data->ready_to_queue = 0;
  387. data->already_have_results = false;
  388. data->just_flushed = true;
  389. thr->queue_full = false;
  390. }
  391. mutex_unlock(mutexp);
  392. }
  393. static void bitforce_flash_led(struct cgpu_info *bitforce)
  394. {
  395. struct bitforce_data *data = bitforce->device_data;
  396. pthread_mutex_t *mutexp = &bitforce->device->device_mutex;
  397. int fdDev = bitforce->device->device_fd;
  398. if (!fdDev)
  399. return;
  400. /* Do not try to flash the led if we're polling for a result to
  401. * minimise the chance of interleaved results */
  402. if (bitforce->polling)
  403. return;
  404. /* It is not critical flashing the led so don't get stuck if we
  405. * can't grab the mutex here */
  406. if (mutex_trylock(mutexp))
  407. return;
  408. char pdevbuf[0x100];
  409. bitforce_cmd1(fdDev, data->xlink_id, pdevbuf, sizeof(pdevbuf), "ZMX");
  410. /* Once we've tried - don't do it until told to again */
  411. bitforce->flash_led = false;
  412. /* However, this stops anything else getting a reply
  413. * So best to delay any other access to the BFL */
  414. nmsleep(4000);
  415. mutex_unlock(mutexp);
  416. return; // nothing is returned by the BFL
  417. }
  418. static
  419. float my_strtof(const char *nptr, char **endptr)
  420. {
  421. float f = strtof(nptr, endptr);
  422. /* Cope with older software that breaks and reads nonsense
  423. * values */
  424. if (f > 100)
  425. f = strtod(nptr, endptr);
  426. return f;
  427. }
  428. static
  429. void set_float_if_gt_zero(float *var, float value)
  430. {
  431. if (value > 0)
  432. *var = value;
  433. }
  434. static bool bitforce_get_temp(struct cgpu_info *bitforce)
  435. {
  436. struct bitforce_data *data = bitforce->device_data;
  437. pthread_mutex_t *mutexp = &bitforce->device->device_mutex;
  438. int fdDev = bitforce->device->device_fd;
  439. char pdevbuf[0x100];
  440. char *s;
  441. if (!fdDev)
  442. return false;
  443. /* Do not try to get the temperature if we're polling for a result to
  444. * minimise the chance of interleaved results */
  445. if (bitforce->polling)
  446. return true;
  447. // Flash instead of Temp - doing both can be too slow
  448. if (bitforce->flash_led) {
  449. bitforce_flash_led(bitforce);
  450. return true;
  451. }
  452. /* It is not critical getting temperature so don't get stuck if we
  453. * can't grab the mutex here */
  454. if (mutex_trylock(mutexp))
  455. return false;
  456. bitforce_cmd1(fdDev, data->xlink_id, pdevbuf, sizeof(pdevbuf), "ZLX");
  457. mutex_unlock(mutexp);
  458. if (unlikely(!pdevbuf[0])) {
  459. applog(LOG_ERR, "%"PRIpreprv": Error: Get temp returned empty string/timed out", bitforce->proc_repr);
  460. bitforce->hw_errors++;
  461. ++hw_errors;
  462. return false;
  463. }
  464. if ((!strncasecmp(pdevbuf, "TEMP", 4)) && (s = strchr(pdevbuf + 4, ':'))) {
  465. float temp = my_strtof(s + 1, &s);
  466. set_float_if_gt_zero(&data->temp[0], temp);
  467. for ( ; s[0]; ++s)
  468. {
  469. if (!strncasecmp(s, "TEMP", 4) && (s = strchr(&s[4], ':')))
  470. {
  471. float temp2 = my_strtof(s + 1, &s);
  472. set_float_if_gt_zero(&data->temp[1], temp2);
  473. if (temp2 > temp)
  474. temp = temp;
  475. }
  476. }
  477. set_float_if_gt_zero(&bitforce->temp, temp);
  478. } else {
  479. /* Use the temperature monitor as a kind of watchdog for when
  480. * our responses are out of sync and flush the buffer to
  481. * hopefully recover */
  482. applog(LOG_WARNING, "%"PRIpreprv": Garbled response probably throttling, clearing buffer", bitforce->proc_repr);
  483. dev_error(bitforce, REASON_DEV_THROTTLE);
  484. /* Count throttling episodes as hardware errors */
  485. bitforce->hw_errors++;
  486. ++hw_errors;
  487. bitforce_clear_buffer(bitforce);
  488. return false;
  489. }
  490. return true;
  491. }
  492. static inline
  493. void dbg_block_data(struct cgpu_info *bitforce)
  494. {
  495. if (!opt_debug)
  496. return;
  497. struct bitforce_data *data = bitforce->device_data;
  498. char *s;
  499. s = bin2hex(&data->next_work_ob[8], 44);
  500. applog(LOG_DEBUG, "%"PRIpreprv": block data: %s", bitforce->proc_repr, s);
  501. free(s);
  502. }
  503. static void bitforce_change_mode(struct cgpu_info *, enum bitforce_proto);
  504. static
  505. bool bitforce_job_prepare(struct thr_info *thr, struct work *work, __maybe_unused uint64_t max_nonce)
  506. {
  507. struct cgpu_info *bitforce = thr->cgpu;
  508. struct bitforce_data *data = bitforce->device_data;
  509. int fdDev = bitforce->device->device_fd;
  510. unsigned char *ob_ms = &data->next_work_ob[8];
  511. unsigned char *ob_dt = &ob_ms[32];
  512. // If polling job_start, cancel it
  513. if (data->poll_func == 1)
  514. {
  515. thr->tv_poll.tv_sec = -1;
  516. data->poll_func = 0;
  517. }
  518. memcpy(ob_ms, work->midstate, 32);
  519. memcpy(ob_dt, work->data + 64, 12);
  520. switch (data->proto)
  521. {
  522. case BFP_BQUEUE:
  523. quit(1, "%"PRIpreprv": Impossible BFP_BQUEUE in bitforce_job_prepare", bitforce->proc_repr);
  524. case BFP_RANGE:
  525. {
  526. uint32_t *ob_nonce = (uint32_t*)&(ob_dt[32]);
  527. ob_nonce[0] = htobe32(work->blk.nonce);
  528. ob_nonce[1] = htobe32(work->blk.nonce + bitforce->nonces);
  529. // FIXME: if nonce range fails... we didn't increment enough
  530. work->blk.nonce += bitforce->nonces + 1;
  531. break;
  532. }
  533. case BFP_QUEUE:
  534. if (thr->work)
  535. {
  536. pthread_mutex_t *mutexp = &bitforce->device->device_mutex;
  537. char pdevbuf[0x100];
  538. if (unlikely(!fdDev))
  539. return false;
  540. mutex_lock(mutexp);
  541. if (data->queued)
  542. bitforce_cmd1(fdDev, data->xlink_id, pdevbuf, sizeof(pdevbuf), "ZQX");
  543. bitforce_cmd2(fdDev, data->xlink_id, pdevbuf, sizeof(pdevbuf), data->next_work_cmd, data->next_work_obs, data->next_work_obsz);
  544. mutex_unlock(mutexp);
  545. if (unlikely(strncasecmp(pdevbuf, "OK", 2))) {
  546. applog(LOG_WARNING, "%"PRIpreprv": Does not support work queue, disabling", bitforce->proc_repr);
  547. bitforce_change_mode(bitforce, BFP_WORK);
  548. }
  549. else
  550. {
  551. dbg_block_data(bitforce);
  552. data->queued = 1;
  553. }
  554. }
  555. // fallthru...
  556. case BFP_WORK:
  557. work->blk.nonce = 0xffffffff;
  558. }
  559. return true;
  560. }
  561. static
  562. void bitforce_change_mode(struct cgpu_info *bitforce, enum bitforce_proto proto)
  563. {
  564. struct bitforce_data *data = bitforce->device_data;
  565. if (data->proto == proto)
  566. return;
  567. if (data->proto == BFP_RANGE)
  568. {
  569. bitforce->nonces = 0xffffffff;
  570. bitforce->sleep_ms *= 5;
  571. data->sleep_ms_default *= 5;
  572. switch (proto)
  573. {
  574. case BFP_WORK:
  575. data->next_work_cmd = "ZDX";
  576. break;
  577. case BFP_QUEUE:
  578. data->next_work_cmd = "ZNX";
  579. default:
  580. ;
  581. }
  582. if (data->sc)
  583. {
  584. // "S|---------- MidState ----------||-DataTail-|E"
  585. data->next_work_ob[7] = 45;
  586. data->next_work_ob[8+32+12] = '\xAA';
  587. data->next_work_obsz = 46;
  588. }
  589. else
  590. {
  591. // ">>>>>>>>|---------- MidState ----------||-DataTail-|>>>>>>>>"
  592. memset(&data->next_work_ob[8+32+12], '>', 8);
  593. data->next_work_obsz = 60;
  594. }
  595. }
  596. else
  597. if (proto == BFP_RANGE)
  598. {
  599. /* Split work up into 1/5th nonce ranges */
  600. bitforce->nonces = 0x33333332;
  601. bitforce->sleep_ms /= 5;
  602. data->sleep_ms_default /= 5;
  603. data->next_work_cmd = "ZPX";
  604. if (data->sc)
  605. {
  606. data->next_work_ob[7] = 53;
  607. data->next_work_obsz = 54;
  608. }
  609. else
  610. data->next_work_obsz = 68;
  611. }
  612. data->proto = proto;
  613. bitforce->kname = protonames[proto];
  614. }
  615. static
  616. void bitforce_job_start(struct thr_info *thr)
  617. {
  618. struct cgpu_info *bitforce = thr->cgpu;
  619. struct bitforce_data *data = bitforce->device_data;
  620. pthread_mutex_t *mutexp = &bitforce->device->device_mutex;
  621. int fdDev = bitforce->device->device_fd;
  622. unsigned char *ob = data->next_work_obs;
  623. char pdevbuf[0x100];
  624. struct timeval tv_now;
  625. data->result_busy_polled = 0;
  626. if (data->queued)
  627. {
  628. uint32_t delay;
  629. // get_results collected more accurate job start time
  630. mt_job_transition(thr);
  631. job_start_complete(thr);
  632. data->queued = 0;
  633. delay = (uint32_t)bitforce->sleep_ms * 1000;
  634. if (unlikely(data->already_have_results))
  635. delay = 0;
  636. timer_set_delay(&thr->tv_morework, &bitforce->work_start_tv, delay);
  637. return;
  638. }
  639. if (!fdDev)
  640. goto commerr;
  641. re_send:
  642. mutex_lock(mutexp);
  643. bitforce_cmd2(fdDev, data->xlink_id, pdevbuf, sizeof(pdevbuf), data->next_work_cmd, ob, data->next_work_obsz);
  644. if (!pdevbuf[0] || !strncasecmp(pdevbuf, "B", 1)) {
  645. mutex_unlock(mutexp);
  646. cgtime(&tv_now);
  647. timer_set_delay(&thr->tv_poll, &tv_now, WORK_CHECK_INTERVAL_MS * 1000);
  648. data->poll_func = 1;
  649. return;
  650. } else if (unlikely(strncasecmp(pdevbuf, "OK", 2))) {
  651. mutex_unlock(mutexp);
  652. switch (data->proto)
  653. {
  654. case BFP_RANGE:
  655. applog(LOG_WARNING, "%"PRIpreprv": Does not support nonce range, disabling", bitforce->proc_repr);
  656. bitforce_change_mode(bitforce, BFP_WORK);
  657. goto re_send;
  658. case BFP_QUEUE:
  659. applog(LOG_WARNING, "%"PRIpreprv": Does not support work queue, disabling", bitforce->proc_repr);
  660. bitforce_change_mode(bitforce, BFP_WORK);
  661. goto re_send;
  662. default:
  663. ;
  664. }
  665. applog(LOG_ERR, "%"PRIpreprv": Error: Send work reports: %s", bitforce->proc_repr, pdevbuf);
  666. goto commerr;
  667. }
  668. mt_job_transition(thr);
  669. mutex_unlock(mutexp);
  670. dbg_block_data(bitforce);
  671. cgtime(&tv_now);
  672. bitforce->work_start_tv = tv_now;
  673. timer_set_delay(&thr->tv_morework, &tv_now, bitforce->sleep_ms * 1000);
  674. job_start_complete(thr);
  675. return;
  676. commerr:
  677. bitforce_comm_error(thr);
  678. job_start_abort(thr, true);
  679. }
  680. static char _discardedbuf[0x10];
  681. static
  682. int bitforce_zox(struct thr_info *thr, const char *cmd)
  683. {
  684. struct cgpu_info *bitforce = thr->cgpu;
  685. struct bitforce_data *data = bitforce->device_data;
  686. pthread_mutex_t *mutexp = &bitforce->device->device_mutex;
  687. int fd = bitforce->device->device_fd;
  688. char *pdevbuf = &data->noncebuf[0];
  689. int count;
  690. mutex_lock(mutexp);
  691. bitforce_cmd1(fd, data->xlink_id, pdevbuf, sizeof(data->noncebuf), cmd);
  692. if (!strncasecmp(pdevbuf, "INPROCESS:", 10))
  693. BFgets(pdevbuf, sizeof(data->noncebuf), fd);
  694. if (!strncasecmp(pdevbuf, "COUNT:", 6))
  695. {
  696. count = atoi(&pdevbuf[6]);
  697. size_t cls = strlen(pdevbuf);
  698. char *pmorebuf = &pdevbuf[cls];
  699. size_t szleft = sizeof(data->noncebuf) - cls, sz;
  700. if (count && data->queued)
  701. cgtime(&bitforce->work_start_tv);
  702. while (true)
  703. {
  704. BFgets(pmorebuf, szleft, fd);
  705. if (!strncasecmp(pmorebuf, "OK", 2))
  706. {
  707. pmorebuf[0] = '\0'; // process expects only results
  708. break;
  709. }
  710. sz = strlen(pmorebuf);
  711. if (!sz)
  712. {
  713. applog(LOG_ERR, "%"PRIpreprv": Timeout during %s", bitforce->proc_repr, cmd);
  714. break;
  715. }
  716. szleft -= sz;
  717. pmorebuf += sz;
  718. if (unlikely(szleft < BITFORCE_QRESULT_LINE_LEN))
  719. {
  720. // Out of buffer space somehow :(
  721. applog(LOG_ERR, "%"PRIpreprv": Ran out of buffer space for results, discarding extra data", bitforce->proc_repr);
  722. pmorebuf = _discardedbuf;
  723. szleft = sizeof(_discardedbuf);
  724. }
  725. }
  726. }
  727. else
  728. count = -1;
  729. mutex_unlock(mutexp);
  730. return count;
  731. }
  732. static inline char *next_line(char *);
  733. static
  734. void bitforce_job_get_results(struct thr_info *thr, struct work *work)
  735. {
  736. struct cgpu_info *bitforce = thr->cgpu;
  737. struct bitforce_data *data = bitforce->device_data;
  738. int fdDev = bitforce->device->device_fd;
  739. unsigned int delay_time_ms;
  740. struct timeval elapsed;
  741. struct timeval now;
  742. char *pdevbuf = &data->noncebuf[0];
  743. bool stale;
  744. int count;
  745. cgtime(&now);
  746. timersub(&now, &bitforce->work_start_tv, &elapsed);
  747. bitforce->wait_ms = tv_to_ms(elapsed);
  748. bitforce->polling = true;
  749. if (!fdDev)
  750. goto commerr;
  751. stale = stale_work(work, true);
  752. if (unlikely(bitforce->wait_ms < bitforce->sleep_ms))
  753. {
  754. // We're likely here because of a work restart
  755. // Since Bitforce cannot stop a work without losing results, only do it if the current job is finding stale shares
  756. // BFP_QUEUE does not support stopping work at all
  757. if (data->proto == BFP_QUEUE || !stale)
  758. {
  759. delay_time_ms = bitforce->sleep_ms - bitforce->wait_ms;
  760. timer_set_delay(&thr->tv_poll, &now, delay_time_ms * 1000);
  761. data->poll_func = 2;
  762. return;
  763. }
  764. }
  765. while (1) {
  766. if (data->already_have_results)
  767. {
  768. data->already_have_results = false;
  769. strcpy(pdevbuf, "COUNT:0");
  770. count = 1;
  771. break;
  772. }
  773. const char *cmd = (data->proto == BFP_QUEUE) ? "ZOX" : "ZFX";
  774. count = bitforce_zox(thr, cmd);
  775. cgtime(&now);
  776. timersub(&now, &bitforce->work_start_tv, &elapsed);
  777. if (elapsed.tv_sec >= BITFORCE_LONG_TIMEOUT_S) {
  778. applog(LOG_ERR, "%"PRIpreprv": took %lums - longer than %lums", bitforce->proc_repr,
  779. tv_to_ms(elapsed), (unsigned long)BITFORCE_LONG_TIMEOUT_MS);
  780. goto out;
  781. }
  782. if (count > 0)
  783. {
  784. // Check that queue results match the current work
  785. // Also, if there are results from the next work, short-circuit this wait
  786. unsigned char midstate[32], datatail[12];
  787. char *p;
  788. int i;
  789. p = pdevbuf;
  790. for (i = 0; i < count; ++i)
  791. {
  792. p = next_line(p);
  793. hex2bin(midstate, p, 32);
  794. hex2bin(datatail, &p[65], 12);
  795. if (!(memcmp(work->midstate, midstate, 32) || memcmp(&work->data[64], datatail, 12)))
  796. break;
  797. }
  798. if (i == count)
  799. {
  800. // Didn't find the one we're waiting on
  801. // Must be extra stuff in the queue results
  802. char *xmid = bin2hex(work->midstate, 32);
  803. char *xdt = bin2hex(&work->data[64], 12);
  804. applog(LOG_WARNING, "%"PRIpreprv": Found extra garbage in queue results: %s",
  805. bitforce->proc_repr, pdevbuf);
  806. applog(LOG_WARNING, "%"PRIpreprv": ...while waiting on: %s,%s",
  807. bitforce->proc_repr, xmid, xdt);
  808. free(xmid);
  809. free(xdt);
  810. count = 0;
  811. }
  812. else
  813. if (i == count - 1)
  814. // Last one found is what we're looking for
  815. {}
  816. else
  817. // We finished the next job too!
  818. data->already_have_results = true;
  819. }
  820. if (!count)
  821. goto noqr;
  822. if (pdevbuf[0] && strncasecmp(pdevbuf, "B", 1)) /* BFL does not respond during throttling */
  823. break;
  824. data->result_busy_polled = bitforce->wait_ms;
  825. if (stale && data->proto != BFP_QUEUE)
  826. {
  827. applog(LOG_NOTICE, "%"PRIpreprv": Abandoning stale search to restart",
  828. bitforce->proc_repr);
  829. goto out;
  830. }
  831. noqr:
  832. data->result_busy_polled = bitforce->wait_ms;
  833. /* if BFL is throttling, no point checking so quickly */
  834. delay_time_ms = (pdevbuf[0] ? BITFORCE_CHECK_INTERVAL_MS : 2 * WORK_CHECK_INTERVAL_MS);
  835. timer_set_delay(&thr->tv_poll, &now, delay_time_ms * 1000);
  836. data->poll_func = 2;
  837. return;
  838. }
  839. if (count < 0 && pdevbuf[0] == 'N')
  840. count = strncasecmp(pdevbuf, "NONCE-FOUND", 11) ? 1 : 0;
  841. // At this point, 'count' is:
  842. // negative, in case of some kind of error
  843. // zero, if NO-NONCE (FPGA either completed with no results, or rebooted)
  844. // positive, if at least one job completed successfully
  845. if (elapsed.tv_sec > BITFORCE_TIMEOUT_S) {
  846. applog(LOG_ERR, "%"PRIpreprv": took %lums - longer than %lums", bitforce->proc_repr,
  847. tv_to_ms(elapsed), (unsigned long)BITFORCE_TIMEOUT_MS);
  848. dev_error(bitforce, REASON_DEV_OVER_HEAT);
  849. ++bitforce->hw_errors;
  850. ++hw_errors;
  851. /* If the device truly throttled, it didn't process the job and there
  852. * are no results. But check first, just in case we're wrong about it
  853. * throttling.
  854. */
  855. if (count > 0)
  856. goto out;
  857. } else if (count >= 0) {/* Hashing complete (NONCE-FOUND or NO-NONCE) */
  858. /* Simple timing adjustment. Allow a few polls to cope with
  859. * OS timer delays being variably reliable. wait_ms will
  860. * always equal sleep_ms when we've waited greater than or
  861. * equal to the result return time.*/
  862. delay_time_ms = bitforce->sleep_ms;
  863. if (!data->result_busy_polled)
  864. {
  865. // No busy polls before results received
  866. if (bitforce->wait_ms > delay_time_ms + (WORK_CHECK_INTERVAL_MS * 8))
  867. // ... due to poll being rather late; ignore it as an anomaly
  868. applog(LOG_DEBUG, "%"PRIpreprv": Got results on first poll after %ums, later than scheduled %ums (ignoring)",
  869. bitforce->proc_repr, bitforce->wait_ms, delay_time_ms);
  870. else
  871. if (bitforce->sleep_ms > data->sleep_ms_default + (BITFORCE_CHECK_INTERVAL_MS * 0x20))
  872. {
  873. applog(LOG_DEBUG, "%"PRIpreprv": Got results on first poll after %ums, on delayed schedule %ums; Wait time changed to: %ums (default sch)",
  874. bitforce->proc_repr, bitforce->wait_ms, delay_time_ms, data->sleep_ms_default);
  875. bitforce->sleep_ms = data->sleep_ms_default;
  876. }
  877. else
  878. {
  879. applog(LOG_DEBUG, "%"PRIpreprv": Got results on first poll after %ums, on default schedule %ums; Wait time changed to: %ums (check interval)",
  880. bitforce->proc_repr, bitforce->wait_ms, delay_time_ms, BITFORCE_CHECK_INTERVAL_MS);
  881. bitforce->sleep_ms = BITFORCE_CHECK_INTERVAL_MS;
  882. }
  883. }
  884. else
  885. {
  886. if (data->result_busy_polled - bitforce->sleep_ms > WORK_CHECK_INTERVAL_MS)
  887. {
  888. bitforce->sleep_ms = data->result_busy_polled - (WORK_CHECK_INTERVAL_MS / 2);
  889. applog(LOG_DEBUG, "%"PRIpreprv": Got results on Nth poll after %ums (busy poll at %ums, sch'd %ums); Wait time changed to: %ums",
  890. bitforce->proc_repr, bitforce->wait_ms, data->result_busy_polled, delay_time_ms, bitforce->sleep_ms);
  891. }
  892. else
  893. applog(LOG_DEBUG, "%"PRIpreprv": Got results on Nth poll after %ums (busy poll at %ums, sch'd %ums); Wait time unchanged",
  894. bitforce->proc_repr, bitforce->wait_ms, data->result_busy_polled, delay_time_ms);
  895. }
  896. /* Work out the average time taken. Float for calculation, uint for display */
  897. bitforce->avg_wait_f += (tv_to_ms(elapsed) - bitforce->avg_wait_f) / TIME_AVG_CONSTANT;
  898. bitforce->avg_wait_d = (unsigned int) (bitforce->avg_wait_f + 0.5);
  899. }
  900. applog(LOG_DEBUG, "%"PRIpreprv": waited %dms until %s", bitforce->proc_repr, bitforce->wait_ms, pdevbuf);
  901. if (count < 0 && strncasecmp(pdevbuf, "I", 1)) {
  902. bitforce->hw_errors++;
  903. ++hw_errors;
  904. applog(LOG_WARNING, "%"PRIpreprv": Error: Get result reports: %s", bitforce->proc_repr, pdevbuf);
  905. bitforce_clear_buffer(bitforce);
  906. }
  907. out:
  908. bitforce->polling = false;
  909. job_results_fetched(thr);
  910. return;
  911. commerr:
  912. bitforce_comm_error(thr);
  913. goto out;
  914. }
  915. static
  916. void bitforce_process_result_nonces(struct thr_info *thr, struct work *work, char *pnoncebuf)
  917. {
  918. struct cgpu_info *bitforce = thr->cgpu;
  919. struct bitforce_data *data = bitforce->device_data;
  920. uint32_t nonce;
  921. while (1) {
  922. hex2bin((void*)&nonce, pnoncebuf, 4);
  923. nonce = be32toh(nonce);
  924. if (unlikely(data->proto == BFP_RANGE && (nonce >= work->blk.nonce ||
  925. /* FIXME: blk.nonce is probably moved on quite a bit now! */
  926. (work->blk.nonce > 0 && nonce < work->blk.nonce - bitforce->nonces - 1)))) {
  927. applog(LOG_WARNING, "%"PRIpreprv": Disabling broken nonce range support", bitforce->proc_repr);
  928. bitforce_change_mode(bitforce, BFP_WORK);
  929. }
  930. submit_nonce(thr, work, nonce);
  931. if (strncmp(&pnoncebuf[8], ",", 1))
  932. break;
  933. pnoncebuf += 9;
  934. }
  935. }
  936. static
  937. bool bitforce_process_qresult_line_i(struct thr_info *thr, char *midstate, char *datatail, char *buf, struct work *work)
  938. {
  939. if (!work)
  940. return false;
  941. if (memcmp(work->midstate, midstate, 32))
  942. return false;
  943. if (memcmp(&work->data[64], datatail, 12))
  944. return false;
  945. char *end;
  946. if (strtol(&buf[90], &end, 10))
  947. bitforce_process_result_nonces(thr, work, &end[1]);
  948. return true;
  949. }
  950. static
  951. void bitforce_process_qresult_line(struct thr_info *thr, char *buf, struct work *work)
  952. {
  953. struct cgpu_info *bitforce = thr->cgpu;
  954. char midstate[32], datatail[12];
  955. hex2bin((void*)midstate, buf, 32);
  956. hex2bin((void*)datatail, &buf[65], 12);
  957. if (!( bitforce_process_qresult_line_i(thr, midstate, datatail, buf, work)
  958. || bitforce_process_qresult_line_i(thr, midstate, datatail, buf, thr->work)
  959. || bitforce_process_qresult_line_i(thr, midstate, datatail, buf, thr->prev_work)
  960. || bitforce_process_qresult_line_i(thr, midstate, datatail, buf, thr->next_work) ))
  961. {
  962. applog(LOG_ERR, "%"PRIpreprv": Failed to find work for queued results", bitforce->proc_repr);
  963. ++bitforce->hw_errors;
  964. ++hw_errors;
  965. }
  966. }
  967. static inline
  968. char *next_line(char *in)
  969. {
  970. while (in[0] && (in++)[0] != '\n')
  971. {}
  972. return in;
  973. }
  974. static
  975. int64_t bitforce_job_process_results(struct thr_info *thr, struct work *work, __maybe_unused bool stopping)
  976. {
  977. struct cgpu_info *bitforce = thr->cgpu;
  978. struct bitforce_data *data = bitforce->device_data;
  979. char *pnoncebuf = &data->noncebuf[0];
  980. int count;
  981. if (!strncasecmp(pnoncebuf, "NO-", 3))
  982. return bitforce->nonces; /* No valid nonce found */
  983. if (!strncasecmp(pnoncebuf, "NONCE-FOUND", 11))
  984. {
  985. bitforce_process_result_nonces(thr, work, &pnoncebuf[12]);
  986. count = 1;
  987. }
  988. else
  989. if (!strncasecmp(pnoncebuf, "COUNT:", 6))
  990. {
  991. count = 0;
  992. pnoncebuf = next_line(pnoncebuf);
  993. while (pnoncebuf[0])
  994. {
  995. bitforce_process_qresult_line(thr, pnoncebuf, work);
  996. ++count;
  997. pnoncebuf = next_line(pnoncebuf);
  998. }
  999. }
  1000. else
  1001. return 0;
  1002. // FIXME: This might have changed in the meantime (new job start, or broken)
  1003. return bitforce->nonces * count;
  1004. }
  1005. static void bitforce_shutdown(struct thr_info *thr)
  1006. {
  1007. struct cgpu_info *bitforce = thr->cgpu;
  1008. int *p_fdDev = &bitforce->device->device_fd;
  1009. BFclose(*p_fdDev);
  1010. *p_fdDev = 0;
  1011. }
  1012. static void biforce_thread_enable(struct thr_info *thr)
  1013. {
  1014. struct cgpu_info *bitforce = thr->cgpu;
  1015. bitforce_reinit(bitforce);
  1016. }
  1017. static bool bitforce_get_stats(struct cgpu_info *bitforce)
  1018. {
  1019. struct bitforce_proc_data *procdata = bitforce->thr[0]->cgpu_data;
  1020. if (!procdata->handles_board)
  1021. return true;
  1022. return bitforce_get_temp(bitforce);
  1023. }
  1024. static bool bitforce_identify(struct cgpu_info *bitforce)
  1025. {
  1026. bitforce->flash_led = true;
  1027. return true;
  1028. }
  1029. static bool bitforce_thread_init(struct thr_info *thr)
  1030. {
  1031. struct cgpu_info *bitforce = thr->cgpu;
  1032. unsigned int wait;
  1033. struct bitforce_data *data;
  1034. struct bitforce_proc_data *procdata;
  1035. struct bitforce_init_data *initdata = bitforce->device_data;
  1036. bool sc = initdata->sc;
  1037. int xlink_id = 0, boardno = 0;
  1038. struct bitforce_proc_data *first_on_this_board;
  1039. for ( ; bitforce; bitforce = bitforce->next_proc)
  1040. {
  1041. thr = bitforce->thr[0];
  1042. if (unlikely(xlink_id > 30))
  1043. {
  1044. applog(LOG_ERR, "%"PRIpreprv": Failed to find XLINK address", bitforce->proc_repr);
  1045. dev_error(bitforce, REASON_THREAD_FAIL_INIT);
  1046. bitforce->reinit_backoff = 1e10;
  1047. continue;
  1048. }
  1049. bitforce->sleep_ms = BITFORCE_SLEEP_MS;
  1050. bitforce->device_data = data = malloc(sizeof(*data));
  1051. *data = (struct bitforce_data){
  1052. .xlink_id = xlink_id,
  1053. .next_work_ob = ">>>>>>>>|---------- MidState ----------||-DataTail-||Nonces|>>>>>>>>",
  1054. .proto = BFP_RANGE,
  1055. .sc = sc,
  1056. .sleep_ms_default = BITFORCE_SLEEP_MS,
  1057. .parallel = initdata->parallels[boardno],
  1058. };
  1059. thr->cgpu_data = procdata = malloc(sizeof(*procdata));
  1060. *procdata = (struct bitforce_proc_data){
  1061. .handles_board = true,
  1062. .cgpu = bitforce,
  1063. };
  1064. if (sc)
  1065. {
  1066. // ".......S|---------- MidState ----------||-DataTail-||Nonces|E"
  1067. data->next_work_ob[8+32+12+8] = '\xAA';
  1068. data->next_work_obs = &data->next_work_ob[7];
  1069. if (bitforce->drv == &bitforce_queue_api)
  1070. {
  1071. bitforce_change_mode(bitforce, BFP_BQUEUE);
  1072. bitforce->sleep_ms = data->sleep_ms_default = 100;
  1073. timer_set_delay_from_now(&thr->tv_poll, 0);
  1074. data->queued_max = data->parallel * 2;
  1075. if (data->queued_max < BITFORCE_MIN_QUEUED_MAX)
  1076. data->queued_max = BITFORCE_MIN_QUEUED_MAX;
  1077. if (data->queued_max > BITFORCE_MAX_QUEUED_MAX)
  1078. data->queued_max = BITFORCE_MAX_QUEUED_MAX;
  1079. }
  1080. else
  1081. bitforce_change_mode(bitforce, BFP_QUEUE);
  1082. }
  1083. else
  1084. {
  1085. data->next_work_obs = &data->next_work_ob[0];
  1086. // Unconditionally change away from cold-initialized BFP_RANGE, to allow for setting up other variables
  1087. bitforce_change_mode(bitforce, BFP_WORK);
  1088. /* Initially enable support for nonce range and disable it later if it
  1089. * fails */
  1090. if (opt_bfl_noncerange)
  1091. bitforce_change_mode(bitforce, BFP_RANGE);
  1092. }
  1093. first_on_this_board = procdata;
  1094. for (int proc = 1; proc < data->parallel; ++proc)
  1095. {
  1096. bitforce = bitforce->next_proc;
  1097. assert(bitforce);
  1098. thr = bitforce->thr[0];
  1099. thr->queue_full = true;
  1100. thr->cgpu_data = procdata = malloc(sizeof(*procdata));
  1101. *procdata = *first_on_this_board;
  1102. procdata->handles_board = false;
  1103. procdata->cgpu = bitforce;
  1104. }
  1105. applog(LOG_DEBUG, "%s: Board %d: %"PRIpreprv"-%"PRIpreprv, bitforce->dev_repr, boardno, first_on_this_board->cgpu->proc_repr, bitforce->proc_repr);
  1106. while (xlink_id < 31 && !(initdata->devmask & (1 << ++xlink_id)))
  1107. {}
  1108. }
  1109. bitforce = thr->cgpu;
  1110. free(initdata->parallels);
  1111. free(initdata);
  1112. /* Pause each new thread at least 100ms between initialising
  1113. * so the devices aren't making calls all at the same time. */
  1114. wait = thr->id * MAX_START_DELAY_MS;
  1115. applog(LOG_DEBUG, "%s: Delaying start by %dms", bitforce->dev_repr, wait / 1000);
  1116. nmsleep(wait);
  1117. return true;
  1118. }
  1119. static struct api_data *bitforce_drv_stats(struct cgpu_info *cgpu)
  1120. {
  1121. struct bitforce_data *data = cgpu->device_data;
  1122. struct api_data *root = NULL;
  1123. // Warning, access to these is not locked - but we don't really
  1124. // care since hashing performance is way more important than
  1125. // locking access to displaying API debug 'stats'
  1126. // If locking becomes an issue for any of them, use copy_data=true also
  1127. root = api_add_uint(root, "Sleep Time", &(cgpu->sleep_ms), false);
  1128. if (data->proto != BFP_BQUEUE)
  1129. root = api_add_uint(root, "Avg Wait", &(cgpu->avg_wait_d), false);
  1130. if (data->temp[0] > 0 && data->temp[1] > 0)
  1131. {
  1132. root = api_add_temp(root, "Temperature0", &(data->temp[0]), false);
  1133. root = api_add_temp(root, "Temperature1", &(data->temp[1]), false);
  1134. }
  1135. return root;
  1136. }
  1137. void bitforce_poll(struct thr_info *thr)
  1138. {
  1139. struct cgpu_info *bitforce = thr->cgpu;
  1140. struct bitforce_data *data = bitforce->device_data;
  1141. int poll = data->poll_func;
  1142. thr->tv_poll.tv_sec = -1;
  1143. data->poll_func = 0;
  1144. switch (poll)
  1145. {
  1146. case 1:
  1147. bitforce_job_start(thr);
  1148. break;
  1149. case 2:
  1150. bitforce_job_get_results(thr, thr->work);
  1151. break;
  1152. default:
  1153. applog(LOG_ERR, "%"PRIpreprv": Unexpected poll from device API!", thr->cgpu->proc_repr);
  1154. }
  1155. }
  1156. static
  1157. char *bitforce_set_device(struct cgpu_info *proc, char *option, char *setting, char *replybuf)
  1158. {
  1159. struct bitforce_data *data = proc->device_data;
  1160. pthread_mutex_t *mutexp = &proc->device->device_mutex;
  1161. int fd;
  1162. if (!strcasecmp(option, "help"))
  1163. {
  1164. sprintf(replybuf, "fanmode: range 0-4 (low to fast) or 5 (auto)");
  1165. return replybuf;
  1166. }
  1167. if (!strcasecmp(option, "fanmode"))
  1168. {
  1169. if (!setting || !*setting)
  1170. {
  1171. sprintf(replybuf, "missing fanmode setting");
  1172. return replybuf;
  1173. }
  1174. if (setting[1] || setting[0] < '0' || setting[0] > '5')
  1175. {
  1176. sprintf(replybuf, "invalid fanmode setting");
  1177. return replybuf;
  1178. }
  1179. char cmd[4] = "Z5X";
  1180. cmd[1] = setting[0];
  1181. mutex_lock(mutexp);
  1182. fd = proc->device->device_fd;
  1183. bitforce_cmd1(fd, data->xlink_id, replybuf, 256, cmd);
  1184. mutex_unlock(mutexp);
  1185. return replybuf;
  1186. }
  1187. sprintf(replybuf, "Unknown option: %s", option);
  1188. return replybuf;
  1189. }
  1190. struct device_drv bitforce_drv = {
  1191. .dname = "bitforce",
  1192. .name = "BFL",
  1193. .drv_detect = bitforce_detect,
  1194. .get_api_stats = bitforce_drv_stats,
  1195. .minerloop = minerloop_async,
  1196. .reinit_device = bitforce_reinit,
  1197. .get_statline_before = get_bitforce_statline_before,
  1198. .get_stats = bitforce_get_stats,
  1199. .set_device = bitforce_set_device,
  1200. .identify_device = bitforce_identify,
  1201. .thread_prepare = bitforce_thread_prepare,
  1202. .thread_init = bitforce_thread_init,
  1203. .job_prepare = bitforce_job_prepare,
  1204. .job_start = bitforce_job_start,
  1205. .job_get_results = bitforce_job_get_results,
  1206. .poll = bitforce_poll,
  1207. .job_process_results = bitforce_job_process_results,
  1208. .thread_shutdown = bitforce_shutdown,
  1209. .thread_enable = biforce_thread_enable
  1210. };
  1211. static inline
  1212. void bitforce_set_queue_full(struct thr_info *thr)
  1213. {
  1214. struct cgpu_info *bitforce = thr->cgpu;
  1215. struct bitforce_data *data = bitforce->device_data;
  1216. thr->queue_full = (data->queued + data->ready_to_queue >= data->queued_max) || (data->ready_to_queue >= BITFORCE_MAX_BQUEUE_AT_ONCE);
  1217. }
  1218. static
  1219. bool bitforce_send_queue(struct thr_info *thr)
  1220. {
  1221. struct cgpu_info *bitforce = thr->cgpu;
  1222. struct bitforce_data *data = bitforce->device_data;
  1223. pthread_mutex_t *mutexp = &bitforce->device->device_mutex;
  1224. int fd = bitforce->device->device_fd;
  1225. struct work *work;
  1226. if (unlikely(!(fd && data->ready_to_queue)))
  1227. return false;
  1228. char buf[0x100];
  1229. int queued_ok;
  1230. size_t qjs_sz = (32 + 12 + 2);
  1231. size_t qjp_sz = 4 + (qjs_sz * data->ready_to_queue);
  1232. uint8_t qjp[qjp_sz], *qjs;
  1233. qjp[0] = qjp_sz - 1;
  1234. qjp[1] = 0xc1;
  1235. qjp[2] = data->ready_to_queue;
  1236. qjp[qjp_sz - 1] = 0xfe;
  1237. qjs = &qjp[qjp_sz - 1];
  1238. work = thr->work_list->prev;
  1239. for (int i = data->ready_to_queue; i > 0; --i, work = work->prev)
  1240. {
  1241. *(--qjs) = 0xaa;
  1242. memcpy(qjs -= 12, work->data + 64, 12);
  1243. memcpy(qjs -= 32, work->midstate, 32);
  1244. *(--qjs) = 45;
  1245. }
  1246. mutex_lock(mutexp);
  1247. bitforce_cmd2(fd, data->xlink_id, buf, sizeof(buf), "ZWX", qjp, qjp_sz);
  1248. mutex_unlock(mutexp);
  1249. if (!strncasecmp(buf, "ERR:QUEUE", 9))
  1250. {
  1251. // Queue full :(
  1252. applog(LOG_DEBUG, "%"PRIpreprv": Device queue full while attempting to append %d jobs (queued<=%d)",
  1253. bitforce->proc_repr,
  1254. data->ready_to_queue, data->queued);
  1255. thr->queue_full = true;
  1256. return false;
  1257. }
  1258. if (strncasecmp(buf, "OK:QUEUED", 9))
  1259. {
  1260. // TODO: ERR:UNKNOWN COMMAND
  1261. applog(LOG_DEBUG, "%"PRIpreprv": Unexpected error attempting to append %d jobs (queued<=%d): %s",
  1262. bitforce->proc_repr,
  1263. data->ready_to_queue, data->queued, buf);
  1264. return false;
  1265. }
  1266. if (!data->queued)
  1267. cgtime(&data->tv_hashmeter_start);
  1268. queued_ok = atoi(&buf[9]);
  1269. data->queued += queued_ok;
  1270. applog(LOG_DEBUG, "%"PRIpreprv": Successfully queued %d/%d jobs on device (queued<=%d)",
  1271. bitforce->proc_repr,
  1272. queued_ok, data->ready_to_queue, data->queued);
  1273. data->ready_to_queue -= queued_ok;
  1274. thr->queue_full = data->ready_to_queue;
  1275. data->just_flushed = false;
  1276. data->want_to_send_queue = false;
  1277. return true;
  1278. }
  1279. void work_list_del(struct work **head, struct work *work)
  1280. {
  1281. DL_DELETE(*head, work);
  1282. free_work(work);
  1283. }
  1284. static
  1285. bool bitforce_queue_do_results(struct thr_info *thr)
  1286. {
  1287. struct cgpu_info *bitforce = thr->cgpu;
  1288. struct bitforce_data *data = bitforce->device_data;
  1289. int fd = bitforce->device->device_fd;
  1290. int count;
  1291. char *noncebuf = &data->noncebuf[0], *buf, *end;
  1292. unsigned char midstate[32], datatail[12];
  1293. struct work *work, *tmpwork, *thiswork;
  1294. struct timeval tv_now, tv_elapsed;
  1295. long chipno = 0; // Initialized value is used for non-parallelized boards
  1296. struct cgpu_info *chip_cgpu;
  1297. struct thr_info *chip_thr;
  1298. int counts[data->parallel];
  1299. if (unlikely(!fd))
  1300. return false;
  1301. count = bitforce_zox(thr, "ZOX");
  1302. if (!count)
  1303. {
  1304. applog(LOG_DEBUG, "%"PRIpreprv": Received 0 queued results on poll", bitforce->proc_repr);
  1305. return true;
  1306. }
  1307. if (unlikely(count < 0))
  1308. {
  1309. applog(LOG_ERR, "%"PRIpreprv": Received unexpected queue result response: %s", bitforce->proc_repr, noncebuf);
  1310. ++bitforce->hw_errors;
  1311. ++hw_errors;
  1312. return false;
  1313. }
  1314. count = 0;
  1315. for (int i = 0; i < data->parallel; ++i)
  1316. counts[i] = 0;
  1317. noncebuf = next_line(noncebuf);
  1318. while ((buf = noncebuf)[0])
  1319. {
  1320. if ( (noncebuf = next_line(buf)) )
  1321. noncebuf[-1] = '\0';
  1322. if (strlen(buf) <= 90)
  1323. {
  1324. applog(LOG_ERR, "%"PRIpreprv": Gibberish within queue results: %s", bitforce->proc_repr, buf);
  1325. continue;
  1326. }
  1327. hex2bin(midstate, buf, 32);
  1328. hex2bin(datatail, &buf[65], 12);
  1329. thiswork = NULL;
  1330. DL_FOREACH(thr->work_list, work)
  1331. {
  1332. if (unlikely(memcmp(work->midstate, midstate, 32)))
  1333. continue;
  1334. if (unlikely(memcmp(&work->data[64], datatail, 12)))
  1335. continue;
  1336. thiswork = work;
  1337. break;
  1338. }
  1339. end = &buf[89];
  1340. chip_cgpu = bitforce;
  1341. if (data->parallel > 1)
  1342. {
  1343. chipno = strtol(&end[1], &end, 16);
  1344. if (chipno >= data->parallel)
  1345. {
  1346. applog(LOG_ERR, "%"PRIpreprv": Chip number out of range for queue result: %s", chip_cgpu->proc_repr, buf);
  1347. chipno = 0;
  1348. }
  1349. for (int i = 0; i < chipno; ++i)
  1350. chip_cgpu = chip_cgpu->next_proc;
  1351. if (unlikely(!end[0]))
  1352. {
  1353. applog(LOG_ERR, "%"PRIpreprv": Missing nonce count in queue results: %s", chip_cgpu->proc_repr, buf);
  1354. goto finishresult;
  1355. }
  1356. }
  1357. chip_thr = chip_cgpu->thr[0];
  1358. applog(LOG_DEBUG, "%"PRIpreprv": Queue result: %s", chip_cgpu->proc_repr, buf);
  1359. if (unlikely(!thiswork))
  1360. {
  1361. applog(LOG_ERR, "%"PRIpreprv": Failed to find work for queue results: %s", chip_cgpu->proc_repr, buf);
  1362. ++chip_cgpu->hw_errors;
  1363. ++hw_errors;
  1364. goto next_qline;
  1365. }
  1366. if (strtol(&end[1], &end, 10))
  1367. {
  1368. if (unlikely(!end[0]))
  1369. {
  1370. applog(LOG_ERR, "%"PRIpreprv": Missing nonces in queue results: %s", chip_cgpu->proc_repr, buf);
  1371. goto finishresult;
  1372. }
  1373. bitforce_process_result_nonces(chip_thr, work, &end[1]);
  1374. }
  1375. ++count;
  1376. ++counts[chipno];
  1377. finishresult:
  1378. if (data->parallel == 1)
  1379. {
  1380. // Queue results are in order, so anything queued prior this is lost
  1381. // Delete all queued work up to, and including, this one
  1382. DL_FOREACH_SAFE(thr->work_list, work, tmpwork)
  1383. {
  1384. DL_DELETE(thr->work_list, work);
  1385. --data->queued;
  1386. if (work == thiswork)
  1387. break;
  1388. }
  1389. }
  1390. else
  1391. {
  1392. // Parallel processors means the results might not be in order
  1393. // This could leak if jobs get lost, hence the sanity checks using "ZqX"
  1394. DL_DELETE(thr->work_list, thiswork);
  1395. --data->queued;
  1396. }
  1397. next_qline: (void)0;
  1398. }
  1399. bitforce_set_queue_full(thr);
  1400. if (data->parallel == 1 && (
  1401. (count < BITFORCE_GOAL_QRESULTS && bitforce->sleep_ms < BITFORCE_MAX_QRESULT_WAIT && data->queued > 1)
  1402. || (count > BITFORCE_GOAL_QRESULTS && bitforce->sleep_ms > BITFORCE_MIN_QRESULT_WAIT) ))
  1403. {
  1404. unsigned int old_sleep_ms = bitforce->sleep_ms;
  1405. bitforce->sleep_ms = (uint32_t)bitforce->sleep_ms * BITFORCE_GOAL_QRESULTS / (count ?: 1);
  1406. if (bitforce->sleep_ms > BITFORCE_MAX_QRESULT_WAIT)
  1407. bitforce->sleep_ms = BITFORCE_MAX_QRESULT_WAIT;
  1408. if (bitforce->sleep_ms < BITFORCE_MIN_QRESULT_WAIT)
  1409. bitforce->sleep_ms = BITFORCE_MIN_QRESULT_WAIT;
  1410. applog(LOG_DEBUG, "%"PRIpreprv": Received %d queue results after %ums; Wait time changed to: %ums (queued<=%d)",
  1411. bitforce->proc_repr, count, old_sleep_ms, bitforce->sleep_ms, data->queued);
  1412. }
  1413. else
  1414. applog(LOG_DEBUG, "%"PRIpreprv": Received %d queue results after %ums; Wait time unchanged (queued<=%d)",
  1415. bitforce->proc_repr, count, bitforce->sleep_ms, data->queued);
  1416. cgtime(&tv_now);
  1417. timersub(&tv_now, &data->tv_hashmeter_start, &tv_elapsed);
  1418. chip_cgpu = bitforce;
  1419. for (int i = 0; i < data->parallel; ++i, (chip_cgpu = chip_cgpu->next_proc))
  1420. {
  1421. chip_thr = chip_cgpu->thr[0];
  1422. hashes_done(chip_thr, (uint64_t)bitforce->nonces * counts[i], &tv_elapsed, NULL);
  1423. }
  1424. data->tv_hashmeter_start = tv_now;
  1425. return true;
  1426. }
  1427. static
  1428. bool bitforce_queue_append(struct thr_info *thr, struct work *work)
  1429. {
  1430. struct cgpu_info *bitforce = thr->cgpu;
  1431. struct bitforce_data *data = bitforce->device_data;
  1432. bool rv, ndq;
  1433. bitforce_set_queue_full(thr);
  1434. rv = !thr->queue_full;
  1435. if (rv)
  1436. {
  1437. DL_APPEND(thr->work_list, work);
  1438. ++data->ready_to_queue;
  1439. applog(LOG_DEBUG, "%"PRIpreprv": Appending to driver queue (max=%u, ready=%d, queued<=%d)",
  1440. bitforce->proc_repr,
  1441. (unsigned)data->queued_max, data->ready_to_queue, data->queued);
  1442. bitforce_set_queue_full(thr);
  1443. }
  1444. else
  1445. if (!data->ready_to_queue)
  1446. return rv;
  1447. ndq = !data->queued;
  1448. if ((ndq) // Device is idle
  1449. || (data->ready_to_queue >= BITFORCE_MAX_BQUEUE_AT_ONCE) // ...or 5 items ready to go
  1450. || (thr->queue_full) // ...or done filling queue
  1451. || (data->just_flushed) // ...or queue was just flushed (only remaining job is partly done already)
  1452. )
  1453. {
  1454. if (!bitforce_send_queue(thr))
  1455. {
  1456. // Problem sending queue, retry again in a few seconds
  1457. applog(LOG_ERR, "%"PRIpreprv": Failed to send queue", bitforce->proc_repr);
  1458. ++bitforce->hw_errors;
  1459. ++hw_errors;
  1460. data->want_to_send_queue = true;
  1461. }
  1462. }
  1463. return rv;
  1464. }
  1465. struct _jobinfo {
  1466. uint8_t key[32+12];
  1467. int instances;
  1468. UT_hash_handle hh;
  1469. };
  1470. static
  1471. void bitforce_queue_flush(struct thr_info *thr)
  1472. {
  1473. struct bitforce_proc_data *procdata = thr->cgpu_data;
  1474. if (!procdata->handles_board)
  1475. return;
  1476. struct cgpu_info *bitforce = thr->cgpu;
  1477. struct bitforce_data *data = bitforce->device_data;
  1478. char *buf = &data->noncebuf[0], *buf2;
  1479. const char *cmd = "ZqX";
  1480. unsigned flushed;
  1481. struct _jobinfo *processing = NULL, *item, *this;
  1482. if (data->parallel == 1)
  1483. // Pre-parallelization neither needs nor supports "ZqX"
  1484. cmd = "ZQX";
  1485. // TODO: Call "ZQX" most of the time: don't need to do sanity checks so often
  1486. bitforce_zox(thr, cmd);
  1487. if (!strncasecmp(buf, "OK:FLUSHED", 10))
  1488. {
  1489. flushed = atoi(&buf[10]);
  1490. buf2 = NULL;
  1491. }
  1492. else
  1493. if ((!strncasecmp(buf, "COUNT:", 6)) && (buf2 = strstr(buf, "FLUSHED:")) )
  1494. {
  1495. flushed = atoi(&buf2[8]);
  1496. buf2 = next_line(buf2);
  1497. }
  1498. else
  1499. {
  1500. applog(LOG_DEBUG, "%"PRIpreprv": Failed to flush device queue: %s", bitforce->proc_repr, buf);
  1501. flushed = 0;
  1502. }
  1503. data->queued -= flushed;
  1504. applog(LOG_DEBUG, "%"PRIpreprv": Flushed %u jobs from device and %d from driver (queued<=%d)",
  1505. bitforce->proc_repr, flushed, data->ready_to_queue, data->queued);
  1506. flushed += data->ready_to_queue;
  1507. data->ready_to_queue = 0;
  1508. while (flushed--)
  1509. work_list_del(&thr->work_list, thr->work_list->prev);
  1510. bitforce_set_queue_full(thr);
  1511. data->just_flushed = true;
  1512. data->want_to_send_queue = false;
  1513. // "ZqX" returns jobs in progress, allowing us to sanity check
  1514. // NOTE: Must process buffer into hash table BEFORE calling bitforce_queue_do_results, which clobbers it
  1515. // NOTE: Must do actual sanity check AFTER calling bitforce_queue_do_results, to ensure we don't delete completed jobs
  1516. if (buf2)
  1517. {
  1518. // First, turn buf2 into a hash
  1519. for ( ; buf2[0]; buf2 = next_line(buf2))
  1520. {
  1521. this = malloc(sizeof(*this));
  1522. hex2bin(&this->key[ 0], &buf2[ 0], 32);
  1523. hex2bin(&this->key[32], &buf2[65], 12);
  1524. HASH_FIND(hh, processing, &this->key[0], sizeof(this->key), item);
  1525. if (likely(!item))
  1526. {
  1527. this->instances = 1;
  1528. HASH_ADD(hh, processing, key, sizeof(this->key), this);
  1529. }
  1530. else
  1531. {
  1532. // This should really only happen in testing/benchmarking...
  1533. ++item->instances;
  1534. free(this);
  1535. }
  1536. }
  1537. }
  1538. bitforce_queue_do_results(thr);
  1539. if (buf2)
  1540. {
  1541. struct work *work, *tmp;
  1542. uint8_t key[32+12];
  1543. // Now iterate over the work_list and delete anything not in the hash
  1544. DL_FOREACH_SAFE(thr->work_list, work, tmp)
  1545. {
  1546. memcpy(&key[ 0], work->midstate, 32);
  1547. memcpy(&key[32], &work->data[64], 12);
  1548. HASH_FIND(hh, processing, &key[0], sizeof(key), item);
  1549. if (unlikely(!item))
  1550. {
  1551. char *hex = bin2hex(key, 32+12);
  1552. applog(LOG_WARNING, "%"PRIpreprv": Sanity check: Device is missing queued job! %s", bitforce->proc_repr, hex);
  1553. free(hex);
  1554. DL_DELETE(thr->work_list, work);
  1555. free_work(work);
  1556. continue;
  1557. }
  1558. if (likely(!--item->instances))
  1559. {
  1560. HASH_DEL(processing, item);
  1561. free(item);
  1562. }
  1563. }
  1564. if (unlikely( (flushed = HASH_COUNT(processing)) ))
  1565. {
  1566. //applog(LOG_WARNING, "%"PRIpreprv": Sanity check: Device is working on %d unknown jobs!", bitforce->proc_repr, flushed);
  1567. // FIXME: Probably these were jobs finished after ZqX, included in the result check we just did
  1568. // NOTE: We need to do that result check first to avoid deleting work_list items for things just solved
  1569. HASH_ITER(hh, processing, item, this)
  1570. {
  1571. HASH_DEL(processing, item);
  1572. free(item);
  1573. }
  1574. }
  1575. }
  1576. }
  1577. static
  1578. void bitforce_queue_poll(struct thr_info *thr)
  1579. {
  1580. struct cgpu_info *bitforce = thr->cgpu;
  1581. struct bitforce_data *data = bitforce->device_data;
  1582. unsigned long sleep_us;
  1583. if (data->queued)
  1584. bitforce_queue_do_results(thr);
  1585. sleep_us = (unsigned long)bitforce->sleep_ms * 1000;
  1586. if (data->want_to_send_queue)
  1587. if (!bitforce_send_queue(thr))
  1588. if (!data->queued)
  1589. {
  1590. applog(LOG_ERR, "%"PRIpreprv": Failed to send queue, and queue empty; retrying after 1 second", bitforce->proc_repr);
  1591. ++bitforce->hw_errors;
  1592. ++hw_errors;
  1593. sleep_us = 1000000;
  1594. }
  1595. timer_set_delay_from_now(&thr->tv_poll, sleep_us);
  1596. }
  1597. static void bitforce_queue_thread_deven(struct thr_info *thr)
  1598. {
  1599. struct cgpu_info *bitforce = thr->cgpu, *thisbf;
  1600. struct bitforce_data *data = bitforce->device_data;
  1601. struct thr_info *thisthr;
  1602. for (thisbf = bitforce; thisbf && thisbf->device_data == data; thisbf = thisbf->next_proc)
  1603. {
  1604. thisthr = bitforce->thr[0];
  1605. thisthr->pause = thr->pause;
  1606. thisbf->deven = bitforce->deven;
  1607. }
  1608. }
  1609. static void bitforce_queue_thread_disable(struct thr_info *thr)
  1610. {
  1611. // Disable other threads sharing the same queue
  1612. bitforce_queue_thread_deven(thr);
  1613. }
  1614. static void bitforce_queue_thread_enable(struct thr_info *thr)
  1615. {
  1616. // TODO: Maybe reinit?
  1617. // Enable other threads sharing the same queue
  1618. bitforce_queue_thread_deven(thr);
  1619. }
  1620. struct device_drv bitforce_queue_api = {
  1621. .dname = "bitforce_queue",
  1622. .name = "BFL",
  1623. .minerloop = minerloop_queue,
  1624. .reinit_device = bitforce_reinit,
  1625. .get_statline_before = get_bitforce_statline_before,
  1626. .get_api_stats = bitforce_drv_stats,
  1627. .get_stats = bitforce_get_stats,
  1628. .set_device = bitforce_set_device,
  1629. .identify_device = bitforce_identify,
  1630. .thread_prepare = bitforce_thread_prepare,
  1631. .thread_init = bitforce_thread_init,
  1632. .queue_append = bitforce_queue_append,
  1633. .queue_flush = bitforce_queue_flush,
  1634. .poll = bitforce_queue_poll,
  1635. .thread_shutdown = bitforce_shutdown,
  1636. .thread_disable = bitforce_queue_thread_disable,
  1637. .thread_enable = bitforce_queue_thread_enable,
  1638. };