driver-bitforce.c 52 KB

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