driver-bitforce.c 53 KB

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