Skip to content
Fetching contributors…
Cannot retrieve contributors at this time
86 lines (69 sloc) 2.09 KB
#include "driver-cpu.h"
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <sys/time.h>
#include "miner.h"
#ifdef WANT_VIA_PADLOCK
static void via_sha256(void *hash, void *buf, unsigned len)
{
unsigned stat = 0;
asm volatile(".byte 0xf3, 0x0f, 0xa6, 0xd0"
:"+S"(buf), "+a"(stat)
:"c"(len), "D" (hash)
:"memory");
}
bool scanhash_via(struct thr_info*thr, const unsigned char *pmidstate,
unsigned char *data_inout,
unsigned char *phash1, unsigned char *phash,
const unsigned char *target,
uint32_t max_nonce, uint32_t *last_nonce,
uint32_t n)
{
unsigned char data[128] __attribute__((aligned(128)));
unsigned char tmp_hash[32] __attribute__((aligned(128)));
unsigned char tmp_hash1[32] __attribute__((aligned(128)));
uint32_t *data32 = (uint32_t *) data;
uint32_t *hash32 = (uint32_t *) tmp_hash;
uint32_t *nonce = (uint32_t *)(data + 64 + 12);
unsigned long stat_ctr = 0;
int i;
/* bitcoin gives us big endian input, but via wants LE,
* so we reverse the swapping bitcoin has already done (extra work)
* in order to permit the hardware to swap everything
* back to BE again (extra work).
*/
for (i = 0; i < 128/4; i++)
data32[i] = swab32(((uint32_t *)data_inout)[i]);
while (1) {
n++;
*nonce = n;
/* first SHA256 transform */
memcpy(tmp_hash1, sha256_init_state, 32);
via_sha256(tmp_hash1, data, 80); /* or maybe 128? */
for (i = 0; i < 32/4; i++)
((uint32_t *)tmp_hash1)[i] =
swab32(((uint32_t *)tmp_hash1)[i]);
/* second SHA256 transform */
memcpy(tmp_hash, sha256_init_state, 32);
via_sha256(tmp_hash, tmp_hash1, 32);
stat_ctr++;
if (unlikely((hash32[7] == 0) && fulltest(tmp_hash, target))) {
/* swap nonce'd data back into original storage area;
* TODO: only swap back the nonce, rather than all data
*/
for (i = 0; i < 128/4; i++) {
uint32_t *dout32 = (uint32_t *) data_inout;
dout32[i] = swab32(data32[i]);
}
*last_nonce = n;
return true;
}
if ((n >= max_nonce) || thr->work_restart) {
*last_nonce = n;
return false;
}
}
}
#endif /* WANT_VIA_PADLOCK */
Jump to Line
Something went wrong with that request. Please try again.