mirror of
https://github.com/bitcoin/bitcoin.git
synced 2025-03-01 14:05:01 +01:00
1a445343f6
-BEGIN VERIFY SCRIPT-
for f in \
src/*.cpp \
src/*.h \
src/bench/*.cpp \
src/bench/*.h \
src/compat/*.cpp \
src/compat/*.h \
src/consensus/*.cpp \
src/consensus/*.h \
src/crypto/*.cpp \
src/crypto/*.h \
src/crypto/ctaes/*.h \
src/policy/*.cpp \
src/policy/*.h \
src/primitives/*.cpp \
src/primitives/*.h \
src/qt/*.cpp \
src/qt/*.h \
src/qt/test/*.cpp \
src/qt/test/*.h \
src/rpc/*.cpp \
src/rpc/*.h \
src/script/*.cpp \
src/script/*.h \
src/support/*.cpp \
src/support/*.h \
src/support/allocators/*.h \
src/test/*.cpp \
src/test/*.h \
src/wallet/*.cpp \
src/wallet/*.h \
src/wallet/test/*.cpp \
src/wallet/test/*.h \
src/zmq/*.cpp \
src/zmq/*.h
do
base=${f%/*}/ relbase=${base#src/} sed -i "s:#include \"\(.*\)\"\(.*\):if test -e \$base'\\1'; then echo \"#include <\"\$relbase\"\\1>\\2\"; else echo \"#include <\\1>\\2\"; fi:e" $f
done
-END VERIFY SCRIPT-
103 lines
2.5 KiB
C++
103 lines
2.5 KiB
C++
// Copyright (c) 2016 The Bitcoin Core developers
|
|
// Distributed under the MIT software license, see the accompanying
|
|
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
|
|
|
|
#include <iostream>
|
|
|
|
#include <bench/bench.h>
|
|
#include <bloom.h>
|
|
#include <hash.h>
|
|
#include <random.h>
|
|
#include <uint256.h>
|
|
#include <utiltime.h>
|
|
#include <crypto/ripemd160.h>
|
|
#include <crypto/sha1.h>
|
|
#include <crypto/sha256.h>
|
|
#include <crypto/sha512.h>
|
|
|
|
/* Number of bytes to hash per iteration */
|
|
static const uint64_t BUFFER_SIZE = 1000*1000;
|
|
|
|
static void RIPEMD160(benchmark::State& state)
|
|
{
|
|
uint8_t hash[CRIPEMD160::OUTPUT_SIZE];
|
|
std::vector<uint8_t> in(BUFFER_SIZE,0);
|
|
while (state.KeepRunning())
|
|
CRIPEMD160().Write(in.data(), in.size()).Finalize(hash);
|
|
}
|
|
|
|
static void SHA1(benchmark::State& state)
|
|
{
|
|
uint8_t hash[CSHA1::OUTPUT_SIZE];
|
|
std::vector<uint8_t> in(BUFFER_SIZE,0);
|
|
while (state.KeepRunning())
|
|
CSHA1().Write(in.data(), in.size()).Finalize(hash);
|
|
}
|
|
|
|
static void SHA256(benchmark::State& state)
|
|
{
|
|
uint8_t hash[CSHA256::OUTPUT_SIZE];
|
|
std::vector<uint8_t> in(BUFFER_SIZE,0);
|
|
while (state.KeepRunning())
|
|
CSHA256().Write(in.data(), in.size()).Finalize(hash);
|
|
}
|
|
|
|
static void SHA256_32b(benchmark::State& state)
|
|
{
|
|
std::vector<uint8_t> in(32,0);
|
|
while (state.KeepRunning()) {
|
|
for (int i = 0; i < 1000000; i++) {
|
|
CSHA256().Write(in.data(), in.size()).Finalize(in.data());
|
|
}
|
|
}
|
|
}
|
|
|
|
static void SHA512(benchmark::State& state)
|
|
{
|
|
uint8_t hash[CSHA512::OUTPUT_SIZE];
|
|
std::vector<uint8_t> in(BUFFER_SIZE,0);
|
|
while (state.KeepRunning())
|
|
CSHA512().Write(in.data(), in.size()).Finalize(hash);
|
|
}
|
|
|
|
static void SipHash_32b(benchmark::State& state)
|
|
{
|
|
uint256 x;
|
|
while (state.KeepRunning()) {
|
|
for (int i = 0; i < 1000000; i++) {
|
|
*((uint64_t*)x.begin()) = SipHashUint256(0, i, x);
|
|
}
|
|
}
|
|
}
|
|
|
|
static void FastRandom_32bit(benchmark::State& state)
|
|
{
|
|
FastRandomContext rng(true);
|
|
uint32_t x = 0;
|
|
while (state.KeepRunning()) {
|
|
for (int i = 0; i < 1000000; i++) {
|
|
x += rng.rand32();
|
|
}
|
|
}
|
|
}
|
|
|
|
static void FastRandom_1bit(benchmark::State& state)
|
|
{
|
|
FastRandomContext rng(true);
|
|
uint32_t x = 0;
|
|
while (state.KeepRunning()) {
|
|
for (int i = 0; i < 1000000; i++) {
|
|
x += rng.randbool();
|
|
}
|
|
}
|
|
}
|
|
|
|
BENCHMARK(RIPEMD160);
|
|
BENCHMARK(SHA1);
|
|
BENCHMARK(SHA256);
|
|
BENCHMARK(SHA512);
|
|
|
|
BENCHMARK(SHA256_32b);
|
|
BENCHMARK(SipHash_32b);
|
|
BENCHMARK(FastRandom_32bit);
|
|
BENCHMARK(FastRandom_1bit);
|