forked from lucasjones/cpuminer-multi
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
+ a small change to x13/14/15 which reduce a bit executable size Signed-off-by: Tanguy Pruvot <[email protected]>
- Loading branch information
Showing
9 changed files
with
142 additions
and
9 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
|
|
@@ -29,6 +29,7 @@ minerd_SOURCES = elist.h \ | |
| ink.c \ | ||
| blake.c \ | ||
| cryptonight.c \ | ||
| fresh.c \ | ||
| x11.c \ | ||
| x13.c \ | ||
| x14.c \ | ||
|
|
||
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,116 @@ | ||
| #include "miner.h" | ||
|
|
||
| #include <stdlib.h> | ||
| #include <stdint.h> | ||
| #include <string.h> | ||
| #include <stdio.h> | ||
|
|
||
| #include "sha3/sph_shavite.h" | ||
| #include "sha3/sph_simd.h" | ||
| #include "sha3/sph_echo.h" | ||
|
|
||
| //#define DEBUG_ALGO | ||
|
|
||
| inline void freshhash(void* output, const void* input, uint32_t len) | ||
| { | ||
| unsigned char hash[128]; // uint32_t hashA[16], hashB[16]; | ||
| #define hashA hash | ||
| #define hashB hash+64 | ||
|
|
||
| memset(hash, 0, 128); | ||
| sph_shavite512_context ctx_shavite1; | ||
| sph_simd512_context ctx_simd1; | ||
| sph_echo512_context ctx_echo1; | ||
|
|
||
| sph_shavite512_init(&ctx_shavite1); | ||
| sph_shavite512(&ctx_shavite1, input, len); | ||
| sph_shavite512_close(&ctx_shavite1, hashA); | ||
|
|
||
| sph_simd512_init(&ctx_simd1); | ||
| sph_simd512(&ctx_simd1, hashA, 64); | ||
| sph_simd512_close(&ctx_simd1, hashB); | ||
|
|
||
| sph_shavite512_init(&ctx_shavite1); | ||
| sph_shavite512(&ctx_shavite1, hashB, 64); | ||
| sph_shavite512_close(&ctx_shavite1, hashA); | ||
|
|
||
| sph_simd512_init(&ctx_simd1); | ||
| sph_simd512(&ctx_simd1, hashA, 64); | ||
| sph_simd512_close(&ctx_simd1, hashB); | ||
|
|
||
| sph_echo512_init(&ctx_echo1); | ||
| sph_echo512(&ctx_echo1, hashB, 64); | ||
| sph_echo512_close(&ctx_echo1, hashA); | ||
|
|
||
| memcpy(output, hash, 32); | ||
| } | ||
|
|
||
| int scanhash_fresh(int thr_id, uint32_t *pdata, const uint32_t *ptarget, | ||
| uint32_t max_nonce, uint64_t *hashes_done) | ||
| { | ||
| uint32_t len = 80; | ||
|
|
||
| uint32_t n = pdata[19] - 1; | ||
| const uint32_t first_nonce = pdata[19]; | ||
| const uint32_t Htarg = ptarget[7]; | ||
|
|
||
| uint32_t hash64[8] __attribute__((aligned(32))); | ||
| uint32_t endiandata[32]; | ||
|
|
||
| uint64_t htmax[] = { | ||
| 0, | ||
| 0xF, | ||
| 0xFF, | ||
| 0xFFF, | ||
| 0xFFFF, | ||
| 0x10000000 | ||
| }; | ||
| uint32_t masks[] = { | ||
| 0xFFFFFFFF, | ||
| 0xFFFFFFF0, | ||
| 0xFFFFFF00, | ||
| 0xFFFFF000, | ||
| 0xFFFF0000, | ||
| 0 | ||
| }; | ||
|
|
||
| // we need bigendian data... | ||
| for (int kk=0; kk < 32; kk++) { | ||
| be32enc(&endiandata[kk], ((uint32_t*)pdata)[kk]); | ||
| }; | ||
| #ifdef DEBUG_ALGO | ||
| if (Htarg != 0) | ||
| printf("[%d] Htarg=%X\n", thr_id, Htarg); | ||
| #endif | ||
| for (int m=0; m < sizeof(masks); m++) { | ||
| if (Htarg <= htmax[m]) { | ||
| uint32_t mask = masks[m]; | ||
| do { | ||
| pdata[19] = ++n; | ||
| be32enc(&endiandata[19], n); | ||
| freshhash(hash64, &endiandata, len); | ||
| #ifndef DEBUG_ALGO | ||
| if ((!(hash64[7] & mask)) && fulltest(hash64, ptarget)) { | ||
| *hashes_done = n - first_nonce + 1; | ||
| return true; | ||
| } | ||
| #else | ||
| if (!(n % 0x1000) && !thr_id) printf("."); | ||
| if (!(hash64[7] & mask)) { | ||
| printf("[%d]",thr_id); | ||
| if (fulltest(hash64, ptarget)) { | ||
| *hashes_done = n - first_nonce + 1; | ||
| return true; | ||
| } | ||
| } | ||
| #endif | ||
| } while (n < max_nonce && !work_restart[thr_id].restart); | ||
| // see blake.c if else to understand the loop on htmax => mask | ||
| break; | ||
| } | ||
| } | ||
|
|
||
| *hashes_done = n - first_nonce + 1; | ||
| pdata[19] = n; | ||
| return 0; | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters