driver-bitforce.c 54 KB

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