driver-bitforce.c 57 KB

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