#include "dbz_strings.h"
nessie_hash_ctx_t nessie_hash_ctx;
+uint8_t nessie_hash_quick=0;
#define HASHSIZE_B ((nessie_hash_ctx.hashsize_b+7)/8)
#define BLOCKSIZE_B (nessie_hash_ctx.blocksize_B)
NESSIE_PUTC('0' + nessie_hash_ctx.hashsize_b%10);
NESSIE_PUTSTR_P(PSTR(" zero bits"));
- memset(block, 0, 256/8);
+ memset(block, 0, nessie_hash_ctx.hashsize_b/8);
nessie_hash_ctx.hash_init(ctx);
while(n>=nessie_hash_ctx.blocksize_B*8){
nessie_hash_ctx.hash_last(ctx, block, n);
nessie_hash_ctx.hash_conv(hash, ctx);
nessie_print_item("hash", hash, (nessie_hash_ctx.hashsize_b+7)/8);
+ if(nessie_hash_quick)
+ return;
for(i=1; i<100000L; ++i){ /* this assumes BLOCKSIZE >= HASHSIZE */
nessie_hash_ctx.hash_init(ctx);
nessie_hash_ctx.hash_last(ctx, hash, nessie_hash_ctx.hashsize_b);
nessie_print_header(nessie_hash_ctx.name, 0, 0, nessie_hash_ctx.hashsize_b, 0, 0);
/* test set 1 */
- char* challange_dbz= PSTR(
+ const char* challange_dbz= PSTR(
"\0"
"\"\" (empty string)\0"
"a\0"
ascii_hash_P(challange[2*i], challange[2*i+1]);
}
nessie_print_set_vector(set, i);
- amillion_hash();
+ if(!nessie_hash_quick)
+ amillion_hash();
/* test set 2 */
set=2;
nessie_print_setheader(set);