add SHA256 benchmark (Unix, self-contained C, and Merkle root over linear chunks in multithreaded C)

This commit is contained in:
Balazs Komuves 2023-10-14 19:34:04 +02:00
parent 4b8a5554b1
commit aa8c37ff0b
9 changed files with 1528 additions and 0 deletions

Binary file not shown.

View File

@ -0,0 +1,72 @@
// linear hashing of fake data
#include <stdio.h>
#include <stdlib.h>
#include "sha2.h"
/*
void SHA256_Init(SHA256_CTX *);
void SHA256_Update(SHA256_CTX*, const uint8_t*, size_t);
void SHA256_Final(uint8_t[SHA256_DIGEST_LENGTH], SHA256_CTX*);
*/
//------------------------------------------------------------------------------
void print_hash(uint8_t *hash) {
for(int i=0;i<SHA256_DIGEST_LENGTH;i++) {
printf("%02x",hash[i]);
}
printf("\n");
}
//------------------------------------------------------------------------------
#define BUF_SIZE 2048
void generate_and_hash(int megabytes) {
SHA256_CTX ctx;
SHA256_Init(&ctx);
unsigned char buffer[BUF_SIZE];
for(int i=0;i<BUF_SIZE;i++) {
// to be compatible with the unix fakedata thingy
buffer[i] = 1+((i%256)%255);
}
int chunks_per_megabyte = (1024*1024)/BUF_SIZE;
for(int i=0;i<megabytes;i++) {
for(int j=0;j<chunks_per_megabyte;j++) {
SHA256_Update(&ctx, buffer, BUF_SIZE );
}
}
uint8_t hash[SHA256_DIGEST_LENGTH];
SHA256_Final( hash, &ctx );
print_hash(hash);
}
//------------------------------------------------------------------------------
int main( int argc, char *argv[] ) {
int megabytes = 1;
switch(argc) {
case 2:
megabytes = atoi(argv[1]);
printf("SHA256 hashing %d megabytes of fake data\n",megabytes);
generate_and_hash(megabytes);
break;
default:
printf("usage:\n");
printf("$ bench_linear <amount_in_megabytes>:\n");
exit(-1);
break;
}
}

Binary file not shown.

View File

@ -0,0 +1,187 @@
// linear hashing 2048 byte chunks then building a Merkle tree on the top of them
// using `nThreads` parallel threads
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include <pthread.h>
#include "sha2.h"
/*
void SHA256_Init(SHA256_CTX *);
void SHA256_Update(SHA256_CTX*, const uint8_t*, size_t);
void SHA256_Final(uint8_t[SHA256_DIGEST_LENGTH], SHA256_CTX*);
*/
//------------------------------------------------------------------------------
void print_hash(uint8_t *hash) {
for(int i=0;i<SHA256_DIGEST_LENGTH;i++) {
printf("%02x",hash[i]);
}
printf("\n");
}
int integerLog2(int a) {
int log = -1;
while(a>0) { log++; a=a>>1; }
return log;
}
//------------------------------------------------------------------------------
#define CHUNK_SIZE 2048
#define CHUNKS_PER_MEGABYTE ((1024*1024)/(CHUNK_SIZE))
void hash_chunk(int idx, uint8_t *chunk_data, uint8_t *tgt) {
SHA256_CTX ctx;
SHA256_Init(&ctx);
SHA256_Update(&ctx, chunk_data, CHUNK_SIZE );
SHA256_Final( tgt, &ctx );
}
//------------------------------------------------------------------------------
void sha256_compression( const uint8_t *src, uint8_t *tgt ) {
SHA256_CTX ctx;
SHA256_Init(&ctx);
SHA256_Update(&ctx, src, 2*SHA256_DIGEST_LENGTH );
SHA256_Final( tgt, &ctx );
}
void calc_merkle_root( int logN, uint8_t *data, uint8_t *tgt ) {
int N = (1<<logN);
uint8_t *layers = malloc( (N-1)*SHA256_DIGEST_LENGTH );
assert( layers != 0 );
const uint8_t *p = data;
uint8_t *q = layers;
for(int k=0; k<logN; k++) {
int M = (1<<(logN-1-k));
for(int j=0; j<M; j++) {
sha256_compression( p + 2*j*SHA256_DIGEST_LENGTH , q + j*SHA256_DIGEST_LENGTH );
}
p = q;
q += M*SHA256_DIGEST_LENGTH;
}
memcpy( tgt, p, SHA256_DIGEST_LENGTH );
free(layers);
}
//------------------------------------------------------------------------------
typedef struct {
int tidx;
int linear_idx;
int nChunks;
uint8_t *tgt;
} ThreadData;
void *my_thread_fun(void *ptr) {
ThreadData *thread_data = (ThreadData*)ptr;
uint8_t *leaves = malloc( SHA256_DIGEST_LENGTH * thread_data->nChunks );
// cretae fake data
unsigned char buffer[CHUNK_SIZE];
for(int i=0;i<CHUNK_SIZE;i++) {
// to be compatible with the unix fakedata thingy
buffer[i] = 1+((i%256)%255);
}
// calculate the leaf hashes
for(int i=0; i<thread_data->nChunks; i++) {
hash_chunk(i, buffer, leaves + i*SHA256_DIGEST_LENGTH );
}
// calculate the merkle root of the subtree
int logNChunks = integerLog2(thread_data->nChunks);
calc_merkle_root( logNChunks , leaves, thread_data->tgt );
free(leaves);
pthread_exit(NULL);
}
// -----------------------------------------------------------------------------
// we assume nThreads is a power of two
// and that the number of chunks per thread is also a power of two
void merkle_root_multithread(int megabytes, int nThreads) {
int logNThreads = integerLog2(nThreads);
printf("nThreads = %d; logNThreads = %d\n",nThreads,logNThreads);
assert( nThreads == (1<<logNThreads) );
int64_t chunks_per_thread = (1024*1024*megabytes) / nThreads / CHUNK_SIZE;
int logNChunks = integerLog2(chunks_per_thread);
printf("chunks per thread = %lld | log of that = %d\n", chunks_per_thread, logNChunks );
assert( chunks_per_thread == (1<<logNChunks) );
// create the worker threads
uint8_t *subtree_roots = malloc( SHA256_DIGEST_LENGTH *nThreads );
pthread_t *thread_ids = malloc( sizeof(pthread_t ) *nThreads );
ThreadData *thread_data = malloc( sizeof(ThreadData) *nThreads );
for(int t=0; t<nThreads; t++) {
thread_data[t].tidx = t;
thread_data[t].nChunks = chunks_per_thread;
thread_data[t].tgt = subtree_roots + t*SHA256_DIGEST_LENGTH;
thread_data[t].linear_idx = t * chunks_per_thread;
pthread_create(thread_ids+t, NULL, my_thread_fun, thread_data+t);
}
// wait for the threads to finish
for(int t=0; t<nThreads; t++) {
pthread_join( thread_ids[t], NULL );
}
// calculate the final root
uint8_t root[SHA256_DIGEST_LENGTH];
calc_merkle_root( logNThreads, subtree_roots, root );
printf("\nMerkle root of the linear SHA256 hashes of the chunks:\n");
print_hash(root);
free(thread_data);
free(subtree_roots);
}
// -----------------------------------------------------------------------------
int main( int argc, char *argv[] ) {
int nThreads = 1;
int megabytes = 1;
switch(argc) {
case 2:
megabytes = atoi(argv[1]);
break;
case 3:
megabytes = atoi(argv[1]);
nThreads = atoi(argv[2]);
break;
default:
printf("usage:\n");
printf("$ ./bench_merkle <megabytes>:\n");
printf("$ ./bench_merkle <megabytes> <nthreads>:\n");
exit(-1);
break;
}
printf("calculating SHA2 chunked Merkle root for %d Mb of data on %d threads...\n",megabytes,nThreads);
merkle_root_multithread(megabytes, nThreads);
printf("\n");
}

View File

@ -0,0 +1,4 @@
#!/bin/bash
gcc -O3 sha2.c bench_linear.c -o bench_linear
gcc -O3 sha2.c bench_merkle.c -o bench_merkle

View File

@ -0,0 +1,2 @@
#!/bin/bash
echo "setup"

1064
hash/cpu/bench/SHA256/C/sha2.c Executable file

File diff suppressed because it is too large Load Diff

197
hash/cpu/bench/SHA256/C/sha2.h Executable file
View File

@ -0,0 +1,197 @@
/*
* FILE: sha2.h
* AUTHOR: Aaron D. Gifford - http://www.aarongifford.com/
*
* Copyright (c) 2000-2001, Aaron D. Gifford
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the copyright holder nor the names of contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTOR(S) ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTOR(S) BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
* $Id: sha2.h,v 1.1 2001/11/08 00:02:01 adg Exp adg $
*/
#ifndef __SHA2_H__
#define __SHA2_H__
#ifdef __cplusplus
extern "C" {
#endif
/*
* Import u_intXX_t size_t type definitions from system headers. You
* may need to change this, or define these things yourself in this
* file.
*/
#include <sys/types.h>
#ifdef SHA2_USE_INTTYPES_H
#include <inttypes.h>
#endif /* SHA2_USE_INTTYPES_H */
/*** SHA-256/384/512 Various Length Definitions ***********************/
#define SHA256_BLOCK_LENGTH 64
#define SHA256_DIGEST_LENGTH 32
#define SHA256_DIGEST_STRING_LENGTH (SHA256_DIGEST_LENGTH * 2 + 1)
#define SHA384_BLOCK_LENGTH 128
#define SHA384_DIGEST_LENGTH 48
#define SHA384_DIGEST_STRING_LENGTH (SHA384_DIGEST_LENGTH * 2 + 1)
#define SHA512_BLOCK_LENGTH 128
#define SHA512_DIGEST_LENGTH 64
#define SHA512_DIGEST_STRING_LENGTH (SHA512_DIGEST_LENGTH * 2 + 1)
/*** SHA-256/384/512 Context Structures *******************************/
/* NOTE: If your architecture does not define either u_intXX_t types or
* uintXX_t (from inttypes.h), you may need to define things by hand
* for your system:
*/
#if 0
typedef unsigned char u_int8_t; /* 1-byte (8-bits) */
typedef unsigned int u_int32_t; /* 4-bytes (32-bits) */
typedef unsigned long long u_int64_t; /* 8-bytes (64-bits) */
#endif
/*
* Most BSD systems already define u_intXX_t types, as does Linux.
* Some systems, however, like Compaq's Tru64 Unix instead can use
* uintXX_t types defined by very recent ANSI C standards and included
* in the file:
*
* #include <inttypes.h>
*
* If you choose to use <inttypes.h> then please define:
*
* #define SHA2_USE_INTTYPES_H
*
* Or on the command line during compile:
*
* cc -DSHA2_USE_INTTYPES_H ...
*/
#ifdef SHA2_USE_INTTYPES_H
typedef struct _SHA256_CTX {
uint32_t state[8];
uint64_t bitcount;
uint8_t buffer[SHA256_BLOCK_LENGTH];
} SHA256_CTX;
typedef struct _SHA512_CTX {
uint64_t state[8];
uint64_t bitcount[2];
uint8_t buffer[SHA512_BLOCK_LENGTH];
} SHA512_CTX;
#else /* SHA2_USE_INTTYPES_H */
typedef struct _SHA256_CTX {
u_int32_t state[8];
u_int64_t bitcount;
u_int8_t buffer[SHA256_BLOCK_LENGTH];
} SHA256_CTX;
typedef struct _SHA512_CTX {
u_int64_t state[8];
u_int64_t bitcount[2];
u_int8_t buffer[SHA512_BLOCK_LENGTH];
} SHA512_CTX;
#endif /* SHA2_USE_INTTYPES_H */
typedef SHA512_CTX SHA384_CTX;
/*** SHA-256/384/512 Function Prototypes ******************************/
#ifndef NOPROTO
#ifdef SHA2_USE_INTTYPES_H
void SHA256_Init(SHA256_CTX *);
void SHA256_Update(SHA256_CTX*, const uint8_t*, size_t);
void SHA256_Final(uint8_t[SHA256_DIGEST_LENGTH], SHA256_CTX*);
char* SHA256_End(SHA256_CTX*, char[SHA256_DIGEST_STRING_LENGTH]);
char* SHA256_Data(const uint8_t*, size_t, char[SHA256_DIGEST_STRING_LENGTH]);
void SHA384_Init(SHA384_CTX*);
void SHA384_Update(SHA384_CTX*, const uint8_t*, size_t);
void SHA384_Final(uint8_t[SHA384_DIGEST_LENGTH], SHA384_CTX*);
char* SHA384_End(SHA384_CTX*, char[SHA384_DIGEST_STRING_LENGTH]);
char* SHA384_Data(const uint8_t*, size_t, char[SHA384_DIGEST_STRING_LENGTH]);
void SHA512_Init(SHA512_CTX*);
void SHA512_Update(SHA512_CTX*, const uint8_t*, size_t);
void SHA512_Final(uint8_t[SHA512_DIGEST_LENGTH], SHA512_CTX*);
char* SHA512_End(SHA512_CTX*, char[SHA512_DIGEST_STRING_LENGTH]);
char* SHA512_Data(const uint8_t*, size_t, char[SHA512_DIGEST_STRING_LENGTH]);
#else /* SHA2_USE_INTTYPES_H */
void SHA256_Init(SHA256_CTX *);
void SHA256_Update(SHA256_CTX*, const u_int8_t*, size_t);
void SHA256_Final(u_int8_t[SHA256_DIGEST_LENGTH], SHA256_CTX*);
char* SHA256_End(SHA256_CTX*, char[SHA256_DIGEST_STRING_LENGTH]);
char* SHA256_Data(const u_int8_t*, size_t, char[SHA256_DIGEST_STRING_LENGTH]);
void SHA384_Init(SHA384_CTX*);
void SHA384_Update(SHA384_CTX*, const u_int8_t*, size_t);
void SHA384_Final(u_int8_t[SHA384_DIGEST_LENGTH], SHA384_CTX*);
char* SHA384_End(SHA384_CTX*, char[SHA384_DIGEST_STRING_LENGTH]);
char* SHA384_Data(const u_int8_t*, size_t, char[SHA384_DIGEST_STRING_LENGTH]);
void SHA512_Init(SHA512_CTX*);
void SHA512_Update(SHA512_CTX*, const u_int8_t*, size_t);
void SHA512_Final(u_int8_t[SHA512_DIGEST_LENGTH], SHA512_CTX*);
char* SHA512_End(SHA512_CTX*, char[SHA512_DIGEST_STRING_LENGTH]);
char* SHA512_Data(const u_int8_t*, size_t, char[SHA512_DIGEST_STRING_LENGTH]);
#endif /* SHA2_USE_INTTYPES_H */
#else /* NOPROTO */
void SHA256_Init();
void SHA256_Update();
void SHA256_Final();
char* SHA256_End();
char* SHA256_Data();
void SHA384_Init();
void SHA384_Update();
void SHA384_Final();
char* SHA384_End();
char* SHA384_Data();
void SHA512_Init();
void SHA512_Update();
void SHA512_Final();
char* SHA512_End();
char* SHA512_Data();
#endif /* NOPROTO */
#ifdef __cplusplus
}
#endif /* __cplusplus */
#endif /* __SHA2_H__ */

View File

@ -0,0 +1,2 @@
#!/bin/bash
echo "setup"