You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
101 lines
2.6 KiB
101 lines
2.6 KiB
/* |
|
* whirlpool routine (djm) |
|
* whirlpoolx routine (provos alexis, tpruvot) |
|
*/ |
|
extern "C" { |
|
#include "sph/sph_whirlpool.h" |
|
} |
|
|
|
#include "miner.h" |
|
#include "cuda_helper.h" |
|
|
|
static uint32_t *d_hash[MAX_GPUS]; |
|
|
|
extern void whirlpoolx_cpu_init(int thr_id, uint32_t threads); |
|
extern void whirlpoolx_setBlock_80(void *pdata, const void *ptarget); |
|
extern uint32_t whirlpoolx_cpu_hash(int thr_id, uint32_t threads, uint32_t startNounce); |
|
extern void whirlpoolx_precompute(int thr_id); |
|
|
|
// CPU Hash function |
|
extern "C" void whirlxHash(void *state, const void *input) |
|
{ |
|
sph_whirlpool_context ctx_whirlpool; |
|
|
|
unsigned char hash[64]; |
|
unsigned char hash_xored[32]; |
|
|
|
sph_whirlpool_init(&ctx_whirlpool); |
|
sph_whirlpool(&ctx_whirlpool, input, 80); |
|
sph_whirlpool_close(&ctx_whirlpool, hash); |
|
|
|
// compress the 48 first bytes of the hash to 32 |
|
for (int i = 0; i < 32; i++) { |
|
hash_xored[i] = hash[i] ^ hash[i + 16]; |
|
} |
|
memcpy(state, hash_xored, 32); |
|
} |
|
|
|
static bool init[MAX_GPUS] = { 0 }; |
|
|
|
extern "C" int scanhash_whirlpoolx(int thr_id, uint32_t *pdata, const uint32_t *ptarget, |
|
uint32_t max_nonce, unsigned long *hashes_done) |
|
{ |
|
const uint32_t first_nonce = pdata[19]; |
|
uint32_t endiandata[20]; |
|
int intensity = is_windows() ? 20 : 22; |
|
uint32_t throughput = device_intensity(thr_id, __func__, 1U << intensity); |
|
throughput = min(throughput, max_nonce - first_nonce); |
|
|
|
if (opt_benchmark) |
|
((uint32_t*)ptarget)[7] = 0x0000ff; |
|
|
|
if (!init[thr_id]) { |
|
cudaSetDevice(device_map[thr_id]); |
|
|
|
CUDA_CALL_OR_RET_X(cudaMalloc(&d_hash[thr_id], 64 * throughput), 0); |
|
|
|
whirlpoolx_cpu_init(thr_id, throughput); |
|
|
|
init[thr_id] = true; |
|
} |
|
|
|
for (int k=0; k < 20; k++) { |
|
be32enc(&endiandata[k], pdata[k]); |
|
} |
|
|
|
whirlpoolx_setBlock_80((void*)endiandata, ptarget); |
|
whirlpoolx_precompute(thr_id); |
|
do { |
|
uint32_t foundNonce = whirlpoolx_cpu_hash(thr_id, throughput, pdata[19]); |
|
if (foundNonce != UINT32_MAX) |
|
{ |
|
const uint32_t Htarg = ptarget[7]; |
|
uint32_t vhash64[8]; |
|
be32enc(&endiandata[19], foundNonce); |
|
whirlxHash(vhash64, endiandata); |
|
|
|
if (vhash64[7] <= Htarg && fulltest(vhash64, ptarget)) { |
|
*hashes_done = pdata[19] - first_nonce + throughput; |
|
pdata[19] = foundNonce; |
|
return 1; |
|
} |
|
else if (vhash64[7] > Htarg) { |
|
applog(LOG_INFO, "GPU #%d: result for %08x is not in range: %x > %x", thr_id, foundNonce, vhash64[7], Htarg); |
|
} |
|
else { |
|
applog(LOG_INFO, "GPU #%d: result for %08x does not validate on CPU!", thr_id, foundNonce); |
|
} |
|
} |
|
|
|
pdata[19] += throughput; |
|
|
|
if (((uint64_t)pdata[19]+throughput) >= max_nonce) { |
|
break; |
|
} |
|
|
|
} while (!work_restart[thr_id].restart); |
|
|
|
*(hashes_done) = pdata[19] - first_nonce + 1; |
|
|
|
return 0; |
|
}
|
|
|