libbitfury.c 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692
  1. /**
  2. * libbitfury.c - library for Bitfury chip/board
  3. *
  4. * Copyright (c) 2013 bitfury
  5. * Copyright (c) 2013 legkodymov
  6. *
  7. * Permission is hereby granted, free of charge, to any person obtaining a copy
  8. * of this software and associated documentation files (the "Software"), to deal
  9. * in the Software without restriction, including without limitation the rights
  10. * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  11. * copies of the Software, and to permit persons to whom the Software is
  12. * furnished to do so, subject to the following conditions:
  13. *
  14. * The above copyright notice and this permission notice shall be included in
  15. * all copies or substantial portions of the Software.
  16. *
  17. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  18. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  19. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  20. * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  21. * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  22. * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
  23. * THE SOFTWARE.
  24. *
  25. **/
  26. #include "config.h"
  27. #include <stdio.h>
  28. #include <unistd.h>
  29. #include <string.h>
  30. #include "miner.h"
  31. #include "tm_i2c.h"
  32. #include "libbitfury.h"
  33. #include "spidevc.h"
  34. #include "sha2.h"
  35. #include <time.h>
  36. #define BITFURY_REFRESH_DELAY 100
  37. #define BITFURY_DETECT_TRIES 3000 / BITFURY_REFRESH_DELAY
  38. // 0 .... 31 bit
  39. // 1000 0011 0101 0110 1001 1010 1100 0111
  40. // 1100 0001 0110 1010 0101 1001 1110 0011
  41. // C16A59E3
  42. unsigned char enaconf[4] = { 0xc1, 0x6a, 0x59, 0xe3 };
  43. unsigned char disconf[4] = { 0, 0, 0, 0 };
  44. unsigned decnonce(unsigned in);
  45. /* Configuration registers - control oscillators and such stuff. PROGRAMMED when magic number is matches, UNPROGRAMMED (default) otherwise */
  46. void config_reg(int cfgreg, int ena)
  47. {
  48. if (ena) spi_emit_data(0x7000+cfgreg*32, (void*)enaconf, 4);
  49. else spi_emit_data(0x7000+cfgreg*32, (void*)disconf, 4);
  50. }
  51. #define FIRST_BASE 61
  52. #define SECOND_BASE 4
  53. char counters[16] = { 64, 64,
  54. SECOND_BASE, SECOND_BASE+4, SECOND_BASE+2, SECOND_BASE+2+16, SECOND_BASE, SECOND_BASE+1,
  55. (FIRST_BASE)%65, (FIRST_BASE+1)%65, (FIRST_BASE+3)%65, (FIRST_BASE+3+16)%65, (FIRST_BASE+4)%65, (FIRST_BASE+4+4)%65, (FIRST_BASE+3+3)%65, (FIRST_BASE+3+1+3)%65};
  56. //char counters[16] = { 64, 64,
  57. // SECOND_BASE, SECOND_BASE+4, SECOND_BASE+2, SECOND_BASE+2+16, SECOND_BASE, SECOND_BASE+1,
  58. // (FIRST_BASE)%65, (FIRST_BASE+1)%65, (FIRST_BASE+3)%65, (FIRST_BASE+3+16)%65, (FIRST_BASE+4)%65, (FIRST_BASE+4+4)%65, (FIRST_BASE+3+3)%65, (FIRST_BASE+3+1+3)%65};
  59. char *buf = "Hello, World!\x55\xaa";
  60. char outbuf[16];
  61. /* Oscillator setup variants (maybe more), values inside of chip ANDed to not allow by programming errors work it at higher speeds */
  62. /* WARNING! no chip temperature control limits, etc. It may self-fry and make fried chips with great ease :-) So if trying to overclock */
  63. /* Do not place chip near flammable objects, provide adequate power protection and better wear eye protection ! */
  64. /* Thermal runaway in this case could produce nice flames of chippy fries */
  65. // Thermometer code from left to right - more ones ==> faster clock!
  66. /* Test vectors to calculate (using address-translated loads) */
  67. unsigned atrvec[] = {
  68. 0xb0e72d8e, 0x1dc5b862, 0xe9e7c4a6, 0x3050f1f5, 0x8a1a6b7e, 0x7ec384e8, 0x42c1c3fc, 0x8ed158a1, /* MIDSTATE */
  69. 0,0,0,0,0,0,0,0,
  70. 0x8a0bb7b7, 0x33af304f, 0x0b290c1a, 0xf0c4e61f, /* WDATA: hashMerleRoot[7], nTime, nBits, nNonce */
  71. 0x9c4dfdc0, 0xf055c9e1, 0xe60f079d, 0xeeada6da, 0xd459883d, 0xd8049a9d, 0xd49f9a96, 0x15972fed, /* MIDSTATE */
  72. 0,0,0,0,0,0,0,0,
  73. 0x048b2528, 0x7acb2d4f, 0x0b290c1a, 0xbe00084a, /* WDATA: hashMerleRoot[7], nTime, nBits, nNonce */
  74. 0x0317b3ea, 0x1d227d06, 0x3cca281e, 0xa6d0b9da, 0x1a359fe2, 0xa7287e27, 0x8b79c296, 0xc4d88274, /* MIDSTATE */
  75. 0,0,0,0,0,0,0,0,
  76. 0x328bcd4f, 0x75462d4f, 0x0b290c1a, 0x002c6dbc, /* WDATA: hashMerleRoot[7], nTime, nBits, nNonce */
  77. 0xac4e38b6, 0xba0e3b3b, 0x649ad6f8, 0xf72e4c02, 0x93be06fb, 0x366d1126, 0xf4aae554, 0x4ff19c5b, /* MIDSTATE */
  78. 0,0,0,0,0,0,0,0,
  79. 0x72698140, 0x3bd62b4f, 0x3fd40c1a, 0x801e43e9, /* WDATA: hashMerleRoot[7], nTime, nBits, nNonce */
  80. 0x9dbf91c9, 0x12e5066c, 0xf4184b87, 0x8060bc4d, 0x18f9c115, 0xf589d551, 0x0f7f18ae, 0x885aca59, /* MIDSTATE */
  81. 0,0,0,0,0,0,0,0,
  82. 0x6f3806c3, 0x41f82a4f, 0x3fd40c1a, 0x00334b39, /* WDATA: hashMerleRoot[7], nTime, nBits, nNonce */
  83. };
  84. #define rotrFixed(x,y) (((x) >> (y)) | ((x) << (32-(y))))
  85. #define s0(x) (rotrFixed(x,7)^rotrFixed(x,18)^(x>>3))
  86. #define s1(x) (rotrFixed(x,17)^rotrFixed(x,19)^(x>>10))
  87. #define Ch(x,y,z) (z^(x&(y^z)))
  88. #define Maj(x,y,z) (y^((x^y)&(y^z)))
  89. #define S0(x) (rotrFixed(x,2)^rotrFixed(x,13)^rotrFixed(x,22))
  90. #define S1(x) (rotrFixed(x,6)^rotrFixed(x,11)^rotrFixed(x,25))
  91. /* SHA256 CONSTANTS */
  92. static const unsigned SHA_K[64] = {
  93. 0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,
  94. 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,
  95. 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,
  96. 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,
  97. 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,
  98. 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,
  99. 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,
  100. 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2
  101. };
  102. void t_print(struct timespec d_time) {
  103. printf(" %ds %.2fms\n", (int)d_time.tv_sec, (double)d_time.tv_nsec / 1000000.0);
  104. }
  105. struct timespec t_add(struct timespec time1, struct timespec time2) {
  106. struct timespec result ;
  107. result.tv_sec = time1.tv_sec + time2.tv_sec ;
  108. result.tv_nsec = time1.tv_nsec + time2.tv_nsec ;
  109. if (result.tv_nsec >= 1000000000L) {
  110. result.tv_sec++ ; result.tv_nsec = result.tv_nsec - 1000000000L ;
  111. }
  112. return (result) ;
  113. }
  114. struct timespec t_diff(struct timespec start, struct timespec end)
  115. {
  116. struct timespec temp;
  117. if (end.tv_nsec < start.tv_nsec) {
  118. temp.tv_sec = end.tv_sec-start.tv_sec-1;
  119. temp.tv_nsec = 1000000000LU;
  120. temp.tv_nsec -= start.tv_nsec;
  121. temp.tv_nsec += end.tv_nsec;
  122. } else {
  123. temp.tv_sec = end.tv_sec-start.tv_sec;
  124. temp.tv_nsec = end.tv_nsec-start.tv_nsec;
  125. }
  126. return temp;
  127. }
  128. void ms3_compute(unsigned *p)
  129. {
  130. unsigned a,b,c,d,e,f,g,h, ne, na, i;
  131. a = p[0]; b = p[1]; c = p[2]; d = p[3]; e = p[4]; f = p[5]; g = p[6]; h = p[7];
  132. for (i = 0; i < 3; i++) {
  133. ne = p[i+16] + SHA_K[i] + h + Ch(e,f,g) + S1(e) + d;
  134. na = p[i+16] + SHA_K[i] + h + Ch(e,f,g) + S1(e) + S0(a) + Maj(a,b,c);
  135. d = c; c = b; b = a; a = na;
  136. h = g; g = f; f = e; e = ne;
  137. }
  138. p[15] = a; p[14] = b; p[13] = c; p[12] = d; p[11] = e; p[10] = f; p[9] = g; p[8] = h;
  139. }
  140. void send_conf() {
  141. config_reg(7,0); config_reg(8,0); config_reg(9,0); config_reg(10,0); config_reg(11,0);
  142. config_reg(6,0); /* disable OUTSLK */
  143. config_reg(4,1); /* Enable slow oscillator */
  144. config_reg(1,0); config_reg(2,0); config_reg(3,0);
  145. spi_emit_data(0x0100, (void*)counters, 16); /* Program counters correctly for rounds processing, here baby should start consuming power */
  146. }
  147. void send_init() {
  148. /* Prepare internal buffers */
  149. /* PREPARE BUFFERS (INITIAL PROGRAMMING) */
  150. unsigned w[16];
  151. unsigned atrvec[] = {
  152. 0xb0e72d8e, 0x1dc5b862, 0xe9e7c4a6, 0x3050f1f5, 0x8a1a6b7e, 0x7ec384e8, 0x42c1c3fc, 0x8ed158a1, /* MIDSTATE */
  153. 0,0,0,0,0,0,0,0,
  154. 0x8a0bb7b7, 0x33af304f, 0x0b290c1a, 0xf0c4e61f, /* WDATA: hashMerleRoot[7], nTime, nBits, nNonce */
  155. };
  156. ms3_compute(&atrvec[0]);
  157. memset(&w, 0, sizeof(w)); w[3] = 0xffffffff; w[4] = 0x80000000; w[15] = 0x00000280;
  158. spi_emit_data(0x1000, (void*)w, 16*4);
  159. spi_emit_data(0x1400, (void*)w, 8*4);
  160. memset(w, 0, sizeof(w)); w[0] = 0x80000000; w[7] = 0x100;
  161. spi_emit_data(0x1900, (void*)&w[0],8*4); /* Prepare MS and W buffers! */
  162. spi_emit_data(0x3000, (void*)&atrvec[0], 19*4);
  163. }
  164. void set_freq(int bits) {
  165. uint64_t freq;
  166. unsigned char *osc6;
  167. int i;
  168. osc6 = (unsigned char *)&freq;
  169. freq = (1ULL << bits) - 1ULL;
  170. spi_emit_data(0x6000, (void*)osc6, 8); /* Program internal on-die slow oscillator frequency */
  171. config_reg(4,1); /* Enable slow oscillator */
  172. }
  173. void send_reinit(int slot, int chip_n, int n) {
  174. spi_clear_buf();
  175. spi_emit_break();
  176. spi_emit_fasync(chip_n);
  177. set_freq(n);
  178. send_conf();
  179. send_init();
  180. tm_i2c_set_oe(slot);
  181. spi_txrx(spi_gettxbuf(), spi_getrxbuf(), spi_getbufsz());
  182. tm_i2c_clear_oe(slot);
  183. }
  184. void send_shutdown(int slot, int chip_n) {
  185. spi_clear_buf();
  186. spi_emit_break();
  187. spi_emit_fasync(chip_n);
  188. config_reg(4,0); /* Disable slow oscillator */
  189. tm_i2c_set_oe(slot);
  190. spi_txrx(spi_gettxbuf(), spi_getrxbuf(), spi_getbufsz());
  191. tm_i2c_clear_oe(slot);
  192. }
  193. void send_freq(int slot, int chip_n, int bits) {
  194. spi_clear_buf();
  195. spi_emit_break();
  196. spi_emit_fasync(chip_n);
  197. set_freq(bits);
  198. tm_i2c_set_oe(slot);
  199. spi_txrx(spi_gettxbuf(), spi_getrxbuf(), spi_getbufsz());
  200. tm_i2c_clear_oe(slot);
  201. }
  202. unsigned int c_diff(unsigned ocounter, unsigned counter) {
  203. return counter > ocounter ? counter - ocounter : (0x003FFFFF - ocounter) + counter;
  204. }
  205. int get_counter(unsigned int *newbuf, unsigned int *oldbuf) {
  206. int j;
  207. unsigned counter;
  208. for(j = 0; j < 16; j++) {
  209. if (newbuf[j] != oldbuf[j]) {
  210. int counter = decnonce(newbuf[j]);
  211. if ((counter & 0xFFC00000) == 0xdf800000) {
  212. counter -= 0xdf800000;
  213. return counter;
  214. }
  215. }
  216. }
  217. return 0;
  218. }
  219. int detect_chip(int chip_n) {
  220. int i;
  221. unsigned newbuf[17], oldbuf[17];
  222. unsigned ocounter;
  223. int odiff;
  224. struct timespec t1, t2, td;
  225. memset(newbuf, 0, 17 * 4);
  226. memset(oldbuf, 0, 17 * 4);
  227. ms3_compute(&atrvec[0]);
  228. ms3_compute(&atrvec[20]);
  229. ms3_compute(&atrvec[40]);
  230. spi_init();
  231. spi_clear_buf();
  232. spi_emit_break(); /* First we want to break chain! Otherwise we'll get all of traffic bounced to output */
  233. spi_emit_fasync(chip_n);
  234. set_freq(52); //54 - 3F, 53 - 1F
  235. send_conf();
  236. send_init();
  237. spi_txrx(spi_gettxbuf(), spi_getrxbuf(), spi_getbufsz());
  238. ocounter = 0;
  239. for (i = 0; i < BITFURY_DETECT_TRIES; i++) {
  240. int j;
  241. int counter;
  242. spi_clear_buf();
  243. spi_emit_break();
  244. spi_emit_fasync(chip_n);
  245. spi_emit_data(0x3000, (void*)&atrvec[0], 19*4);
  246. spi_txrx(spi_gettxbuf(), spi_getrxbuf(), spi_getbufsz());
  247. memcpy(newbuf, spi_getrxbuf() + 4 + chip_n, 17*4);
  248. clock_gettime(CLOCK_PROCESS_CPUTIME_ID, &t1);
  249. counter = get_counter(newbuf, oldbuf);
  250. if (ocounter) {
  251. unsigned int cdiff = c_diff(ocounter, counter);
  252. unsigned per_ms;
  253. td = t_diff(t2, t1);
  254. per_ms = cdiff / (td.tv_nsec / 1000);
  255. if (cdiff > 5000 && cdiff < 100000 && odiff > 5000 && odiff < 100000)
  256. return 1;
  257. odiff = cdiff;
  258. }
  259. ocounter = counter;
  260. t2 = t1;
  261. if (newbuf[16] != 0 && newbuf[16] != 0xFFFFFFFF) {
  262. return 0;
  263. }
  264. nmsleep(BITFURY_REFRESH_DELAY / 10);
  265. memcpy(oldbuf, newbuf, 17 * 4);
  266. }
  267. return 0;
  268. }
  269. int libbitfury_detectChips(struct bitfury_device *devices) {
  270. int n = 0;
  271. int i;
  272. static slot_on[32];
  273. struct timespec t1, t2;
  274. if (tm_i2c_init() < 0) {
  275. printf("I2C init error\n");
  276. return(1);
  277. }
  278. for (i = 0; i < 32; i++) {
  279. slot_on[i] = 0;
  280. }
  281. clock_gettime(CLOCK_PROCESS_CPUTIME_ID, &t1);
  282. for (i = 0; i < 32; i++) {
  283. int slot_detected = tm_i2c_detect(i) != -1;
  284. slot_on[i] = slot_detected;
  285. tm_i2c_clear_oe(i);
  286. nmsleep(1);
  287. }
  288. for (i = 0; i < 32; i++) {
  289. if (slot_on[i]) {
  290. int chip_n = 0;
  291. int chip_detected;
  292. tm_i2c_set_oe(i);
  293. do {
  294. chip_detected = detect_chip(chip_n);
  295. if (chip_detected) {
  296. applog(LOG_WARNING, "BITFURY slot: %d, chip #%d detected", i, n);
  297. devices[n].slot = i;
  298. devices[n].fasync = chip_n;
  299. n++;
  300. chip_n++;
  301. }
  302. } while (chip_detected);
  303. tm_i2c_clear_oe(i);
  304. }
  305. }
  306. clock_gettime(CLOCK_PROCESS_CPUTIME_ID, &t2);
  307. return n; //!!!
  308. //return 1;
  309. }
  310. int libbitfury_shutdownChips(struct bitfury_device *devices, int chip_n) {
  311. int i;
  312. for (i = 0; i < chip_n; i++) {
  313. send_shutdown(devices[i].slot, devices[i].fasync);
  314. }
  315. tm_i2c_close();
  316. }
  317. unsigned decnonce(unsigned in)
  318. {
  319. unsigned out;
  320. /* First part load */
  321. out = (in & 0xFF) << 24; in >>= 8;
  322. /* Byte reversal */
  323. in = (((in & 0xaaaaaaaa) >> 1) | ((in & 0x55555555) << 1));
  324. in = (((in & 0xcccccccc) >> 2) | ((in & 0x33333333) << 2));
  325. in = (((in & 0xf0f0f0f0) >> 4) | ((in & 0x0f0f0f0f) << 4));
  326. out |= (in >> 2)&0x3FFFFF;
  327. /* Extraction */
  328. if (in & 1) out |= (1 << 23);
  329. if (in & 2) out |= (1 << 22);
  330. out -= 0x800004;
  331. return out;
  332. }
  333. int rehash(unsigned char *midstate, unsigned m7,
  334. unsigned ntime, unsigned nbits, unsigned nnonce) {
  335. unsigned char in[16];
  336. unsigned char hash1[32];
  337. unsigned int *in32 = (unsigned int *)in;
  338. unsigned char *hex;
  339. unsigned int *mid32 = (unsigned int *)midstate;
  340. unsigned out32[8];
  341. unsigned char *out = (unsigned char *) out32;
  342. static unsigned history[512];
  343. static unsigned history_p;
  344. int i;
  345. sha2_context ctx;
  346. memset( &ctx, 0, sizeof( sha2_context ) );
  347. memcpy(ctx.state, mid32, 8*4);
  348. ctx.total[0] = 64;
  349. ctx.total[1] = 0;
  350. nnonce = bswap_32(nnonce);
  351. in32[0] = bswap_32(m7);
  352. in32[1] = bswap_32(ntime);
  353. in32[2] = bswap_32(nbits);
  354. in32[3] = nnonce;
  355. sha2_update(&ctx, in, 16);
  356. sha2_finish(&ctx, out);
  357. sha2(out, 32, out);
  358. if (out32[7] == 0) {
  359. hex = bin2hex(midstate, 32);
  360. hex = bin2hex(out, 32);
  361. // applog(LOG_INFO, "! MS0: %08x, m7: %08x, ntime: %08x, nbits: %08x, nnonce: %08x\n\t\t\t out: %s\n", mid32[0], m7, ntime, nbits, nnonce, hex);
  362. // history[history_p] = nnonce;
  363. // history_p++; history_p &= 512 - 1;
  364. return 1;
  365. }
  366. return 0;
  367. }
  368. void work_to_payload(struct bitfury_payload *p, struct work *w) {
  369. unsigned char flipped_data[80];
  370. memset(p, 0, sizeof(struct bitfury_payload));
  371. flip80(flipped_data, w->data);
  372. memcpy(p->midstate, w->midstate, 32);
  373. p->m7 = bswap_32(*(unsigned *)(flipped_data + 64));
  374. p->ntime = bswap_32(*(unsigned *)(flipped_data + 68));
  375. p->nbits = bswap_32(*(unsigned *)(flipped_data + 72));
  376. }
  377. int libbitfury_sendHashData(struct bitfury_device *bf, int chip_n) {
  378. int chip_id;
  379. static unsigned second_run;
  380. for (chip_id = 0; chip_id < chip_n; chip_id++) {
  381. unsigned char *hexstr;
  382. struct bitfury_device *d = bf + chip_id;
  383. unsigned *newbuf = d->newbuf;
  384. unsigned *oldbuf = d->oldbuf;
  385. struct bitfury_payload *p = &(d->payload);
  386. struct bitfury_payload *op = &(d->opayload);
  387. struct bitfury_payload *o2p = &(d->o2payload);
  388. struct timespec d_time;
  389. struct timespec time;
  390. int smart = 0;
  391. int i;
  392. int chip = d->fasync;
  393. int slot = d->slot;
  394. memcpy(atrvec, p, 20*4);
  395. ms3_compute(atrvec);
  396. clock_gettime(CLOCK_REALTIME, &(time));
  397. if (!second_run) {
  398. d->predict2 = d->predict1 = time;
  399. d->counter1 = d->counter2 = 0;
  400. d->req2_done = 0;
  401. };
  402. d_time = t_diff(time, d->predict1);
  403. if (d_time.tv_sec < 0 && (d->req2_done || !smart)) {
  404. d->otimer1 = d->timer1;
  405. d->timer1 = time;
  406. /* Programming next value */
  407. spi_clear_buf(); spi_emit_break();
  408. spi_emit_fasync(chip);
  409. spi_emit_data(0x3000, (void*)&atrvec[0], 19*4);
  410. if (smart) {
  411. config_reg(3,0);
  412. }
  413. tm_i2c_set_oe(slot);
  414. clock_gettime(CLOCK_REALTIME, &(time));
  415. d_time = t_diff(time, d->predict1);
  416. spi_txrx(spi_gettxbuf(), spi_getrxbuf(), spi_getbufsz());
  417. tm_i2c_clear_oe(slot);
  418. memcpy(newbuf, spi_getrxbuf()+4 + chip, 17*4);
  419. d->job_switched = newbuf[16] != oldbuf[16];
  420. int i;
  421. int results_num = 0;
  422. int found = 0;
  423. unsigned * results = d->results;
  424. d->old_nonce = 0;
  425. d->future_nonce = 0;
  426. for (i = 0; i < 16; i++) {
  427. if (oldbuf[i] != newbuf[i] && op && o2p) {
  428. unsigned pn; //possible nonce
  429. unsigned int s = 0; //TODO zero may be solution
  430. unsigned int old_f = 0;
  431. if ((newbuf[i] & 0xFF) == 0xE0)
  432. continue;
  433. pn = decnonce(newbuf[i]);
  434. s |= rehash(op->midstate, op->m7, op->ntime, op->nbits, pn) ? pn : 0;
  435. s |= rehash(op->midstate, op->m7, op->ntime, op->nbits, pn-0x00400000) ? pn - 0x00400000 : 0;
  436. s |= rehash(op->midstate, op->m7, op->ntime, op->nbits, pn-0x00800000) ? pn - 0x00800000 : 0;
  437. s |= rehash(op->midstate, op->m7, op->ntime, op->nbits, pn+0x02800000) ? pn + 0x02800000 : 0;
  438. s |= rehash(op->midstate, op->m7, op->ntime, op->nbits, pn+0x02C00000) ? pn + 0x02C00000 : 0;
  439. s |= rehash(op->midstate, op->m7, op->ntime, op->nbits, pn+0x00400000) ? pn + 0x00400000 : 0;
  440. if (s) {
  441. int k;
  442. int dup = 0;
  443. for (k = 0; k < results_num; k++) {
  444. if (results[k] == bswap_32(s)) {
  445. dup = 1;
  446. }
  447. }
  448. if (!dup) {
  449. results[results_num++] = bswap_32(s);
  450. found++;
  451. }
  452. }
  453. s = 0;
  454. pn = decnonce(newbuf[i]);
  455. s |= rehash(o2p->midstate, o2p->m7, o2p->ntime, o2p->nbits, pn) ? pn : 0;
  456. s |= rehash(o2p->midstate, o2p->m7, o2p->ntime, o2p->nbits, pn-0x400000) ? pn - 0x400000 : 0;
  457. s |= rehash(o2p->midstate, o2p->m7, o2p->ntime, o2p->nbits, pn-0x800000) ? pn - 0x800000 : 0;
  458. s |= rehash(o2p->midstate, o2p->m7, o2p->ntime, o2p->nbits, pn+0x2800000)? pn + 0x2800000 : 0;
  459. s |= rehash(o2p->midstate, o2p->m7, o2p->ntime, o2p->nbits, pn+0x2C00000)? pn + 0x2C00000 : 0;
  460. s |= rehash(o2p->midstate, o2p->m7, o2p->ntime, o2p->nbits, pn+0x400000) ? pn + 0x400000 : 0;
  461. if (s) {
  462. d->old_nonce = bswap_32(s);
  463. found++;
  464. }
  465. s = 0;
  466. pn = decnonce(newbuf[i]);
  467. s |= rehash(p->midstate, p->m7, p->ntime, p->nbits, pn) ? pn : 0;
  468. s |= rehash(p->midstate, p->m7, p->ntime, p->nbits, pn-0x400000) ? pn - 0x400000 : 0;
  469. s |= rehash(p->midstate, p->m7, p->ntime, p->nbits, pn-0x800000) ? pn - 0x800000 : 0;
  470. s |= rehash(p->midstate, p->m7, p->ntime, p->nbits, pn+0x2800000)? pn + 0x2800000 : 0;
  471. s |= rehash(p->midstate, p->m7, p->ntime, p->nbits, pn+0x2C00000)? pn + 0x2C00000 : 0;
  472. s |= rehash(p->midstate, p->m7, p->ntime, p->nbits, pn+0x400000) ? pn + 0x400000 : 0;
  473. if (s) {
  474. d->future_nonce = bswap_32(s);
  475. found++;
  476. }
  477. if (!found) {
  478. //printf("AAA Strange: %08x, chip_id: %d\n", pn, chip_id);
  479. d->strange_counter++;
  480. }
  481. }
  482. }
  483. d->results_n = results_num;
  484. if (smart) {
  485. d_time = t_diff(d->timer2, d->timer1);
  486. } else {
  487. d_time = t_diff(d->otimer1, d->timer1);
  488. }
  489. d->ocounter1 = d->counter1;
  490. d->counter1 = get_counter(newbuf, oldbuf);
  491. if (d->counter2 || !smart) {
  492. int shift;
  493. int cycles;
  494. int req1_cycles;
  495. long long unsigned int period;
  496. double ns;
  497. unsigned full_cycles, half_cycles;
  498. double full_delay, half_delay;
  499. long long unsigned delta;
  500. struct timespec t_delta;
  501. double mhz;
  502. int ccase;
  503. shift = 800000;
  504. if (smart) {
  505. cycles = d->counter1 < d->counter2 ? 0x00400000 - d->counter2 + d->counter1 : d->counter1 - d->counter2; // + 0x003FFFFF;
  506. } else {
  507. if (d->counter1 > (0x00400000 - shift * 2) && d->ocounter1 > (0x00400000 - shift)) {
  508. cycles = 0x00400000 - d->ocounter1 + d->counter1; // + 0x003FFFFF;
  509. ccase = 1;
  510. } else {
  511. cycles = d->counter1 > d->ocounter1 ? d->counter1 - d->ocounter1 : 0x00400000 - d->ocounter1 + d->counter1;
  512. ccase = 2;
  513. }
  514. }
  515. req1_cycles = 0x003FFFFF - d->counter1;
  516. period = (long long unsigned int)d_time.tv_sec * 1000000000ULL + (long long unsigned int)d_time.tv_nsec;
  517. ns = (double)period / (double)(cycles);
  518. mhz = 1.0 / ns * 65.0 * 1000.0;
  519. if (d->counter1 > 0 && d->counter1 < 0x001FFFFF) {
  520. //printf("//AAA chip_id %2d: %llu ms, req1_cycles: %08u, counter1: %08d, ocounter1: %08d, counter2: %08d, cycles: %08d, ns: %.2f, mhz: %.2f \n", chip_id, period / 1000000ULL, req1_cycles, d->counter1, d->ocounter1, d->counter2, cycles, ns, mhz);
  521. }
  522. if (ns > 2000.0 || ns < 20) {
  523. //printf("AAA %d!Stupid ns chip_id %2d: %llu ms, req1_cycles: %08u, counter1: %08d, ocounter1: %08d, counter2: %08d, cycles: %08d, ns: %.2f, mhz: %.2f \n", ccase, chip_id, period / 1000000ULL, req1_cycles, d->counter1, d->ocounter1, d->counter2, cycles, ns, mhz);
  524. ns = 200.0;
  525. } else {
  526. d->ns = ns;
  527. d->mhz = mhz;
  528. }
  529. if (smart) {
  530. half_cycles = req1_cycles + shift;
  531. full_cycles = 0x003FFFFF - 2 * shift;
  532. } else {
  533. half_cycles = 0;
  534. full_cycles = req1_cycles > shift ? req1_cycles - shift : req1_cycles + 0x00400000 - shift;
  535. }
  536. half_delay = (double)half_cycles * ns * (1 +0.92);
  537. full_delay = (double)full_cycles * ns;
  538. delta = (long long unsigned)(full_delay + half_delay);
  539. t_delta.tv_sec = delta / 1000000000ULL;
  540. t_delta.tv_nsec = delta - t_delta.tv_sec * 1000000000ULL;
  541. d->predict1 = t_add(time, t_delta);
  542. if (smart) {
  543. half_cycles = req1_cycles + shift;
  544. full_cycles = 0;
  545. } else {
  546. full_cycles = req1_cycles + shift;
  547. }
  548. half_delay = (double)half_cycles * ns * (1 + 0.92);
  549. full_delay = (double)full_cycles * ns;
  550. delta = (long long unsigned)(full_delay + half_delay);
  551. t_delta.tv_sec = delta / 1000000000ULL;
  552. t_delta.tv_nsec = delta - t_delta.tv_sec * 1000000000ULL;
  553. d->predict2 = t_add(time, t_delta);
  554. d->req2_done = 0; d->req1_done = 0;
  555. }
  556. if (d->job_switched) {
  557. memcpy(o2p, op, sizeof(struct bitfury_payload));
  558. memcpy(op, p, sizeof(struct bitfury_payload));
  559. memcpy(oldbuf, newbuf, 17 * 4);
  560. }
  561. }
  562. clock_gettime(CLOCK_REALTIME, &(time));
  563. d_time = t_diff(time, d->predict2);
  564. if (d_time.tv_sec < 0 && !d->req2_done) {
  565. if(smart) {
  566. d->otimer2 = d->timer2;
  567. d->timer2 = time;
  568. spi_clear_buf();
  569. spi_emit_break();
  570. spi_emit_fasync(chip);
  571. spi_emit_data(0x3000, (void*)&atrvec[0], 19*4);
  572. if (smart) {
  573. config_reg(3,1);
  574. }
  575. tm_i2c_set_oe(slot);
  576. spi_txrx(spi_gettxbuf(), spi_getrxbuf(), spi_getbufsz());
  577. tm_i2c_clear_oe(slot);
  578. memcpy(newbuf, spi_getrxbuf()+4 + chip, 17*4);
  579. d->counter2 = get_counter(newbuf, oldbuf);
  580. d->req2_done = 1;
  581. } else {
  582. d->req2_done = 1;
  583. }
  584. }
  585. }
  586. second_run = 1;
  587. return;
  588. }
  589. int libbitfury_readHashData(unsigned int *res) {
  590. return 0;
  591. }