|
|
|
// Copyright (c) 2011-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 <test/test_bitcoin.h>
|
|
|
|
|
|
|
|
#include <chainparams.h>
|
|
|
|
#include <consensus/consensus.h>
|
|
|
|
#include <consensus/validation.h>
|
|
|
|
#include <crypto/sha256.h>
|
|
|
|
#include <validation.h>
|
|
|
|
#include <miner.h>
|
|
|
|
#include <net_processing.h>
|
|
|
|
#include <ui_interface.h>
|
|
|
|
#include <streams.h>
|
|
|
|
#include <rpc/server.h>
|
|
|
|
#include <rpc/register.h>
|
|
|
|
#include <script/sigcache.h>
|
|
|
|
|
|
|
|
#include <memory>
|
|
|
|
|
|
|
|
void CConnmanTest::AddNode(CNode& node)
|
|
|
|
{
|
|
|
|
LOCK(g_connman->cs_vNodes);
|
|
|
|
g_connman->vNodes.push_back(&node);
|
|
|
|
}
|
|
|
|
|
|
|
|
void CConnmanTest::ClearNodes()
|
|
|
|
{
|
|
|
|
LOCK(g_connman->cs_vNodes);
|
|
|
|
g_connman->vNodes.clear();
|
|
|
|
}
|
|
|
|
|
|
|
|
uint256 insecure_rand_seed = GetRandHash();
|
|
|
|
FastRandomContext insecure_rand_ctx(insecure_rand_seed);
|
|
|
|
|
|
|
|
extern bool fPrintToConsole;
|
|
|
|
extern void noui_connect();
|
|
|
|
|
|
|
|
BasicTestingSetup::BasicTestingSetup(const std::string& chainName)
|
|
|
|
{
|
|
|
|
SHA256AutoDetect();
|
|
|
|
RandomInit();
|
Update key.cpp to use new libsecp256k1
libsecp256k1's API changed, so update key.cpp to use it.
Libsecp256k1 now has explicit context objects, which makes it completely thread-safe.
In turn, keep an explicit context object in key.cpp, which is explicitly initialized
destroyed. This is not really pretty now, but it's more efficient than the static
initialized object in key.cpp (which made for example bitcoin-tx slow, as for most of
its calls, libsecp256k1 wasn't actually needed).
This also brings in the new blinding support in libsecp256k1. By passing in a random
seed, temporary variables during the elliptic curve computations are altered, in such
a way that if an attacker does not know the blind, observing the internal operations
leaks less information about the keys used. This was implemented by Greg Maxwell.
10 years ago
|
|
|
ECC_Start();
|
|
|
|
SetupEnvironment();
|
|
|
|
SetupNetworking();
|
|
|
|
InitSignatureCache();
|
Cache full script execution results in addition to signatures
This adds a new CuckooCache in validation, caching whether all of a
transaction's scripts were valid with a given set of script flags.
Unlike previous attempts at caching an entire transaction's
validity, which have nearly universally introduced consensus
failures, this only caches the validity of a transaction's
scriptSigs. As these are pure functions of the transaction and
data it commits to, this should be much safer.
This is somewhat duplicative with the sigcache, as entries in the
new cache will also have several entries in the sigcache. However,
the sigcache is kept both as ATMP relies on it and because it
prevents malleability-based DoS attacks on the new higher-level
cache. Instead, the -sigcachesize option is re-used - cutting the
sigcache size in half and using the newly freed memory for the
script execution cache.
Transactions which match the script execution cache never even have
entries in the script check thread's workqueue created.
Note that the cache is indexed only on the script execution flags
and the transaction's witness hash. While this is sufficient to
make the CScriptCheck() calls pure functions, this introduces
dependancies on the mempool calculating things such as the
PrecomputedTransactionData object, filling the CCoinsViewCache, etc
in the exact same way as ConnectBlock. I belive this is a reasonable
assumption, but should be noted carefully.
In a rather naive benchmark (reindex-chainstate up to block 284k
with cuckoocache always returning true for contains(),
-assumevalid=0 and a very large dbcache), this connected blocks
~1.7x faster.
8 years ago
|
|
|
InitScriptExecutionCache();
|
|
|
|
fPrintToDebugLog = false; // don't want to write to debug.log file
|
|
|
|
fCheckBlockIndex = true;
|
|
|
|
SelectParams(chainName);
|
|
|
|
noui_connect();
|
|
|
|
}
|
|
|
|
|
|
|
|
BasicTestingSetup::~BasicTestingSetup()
|
|
|
|
{
|
Update key.cpp to use new libsecp256k1
libsecp256k1's API changed, so update key.cpp to use it.
Libsecp256k1 now has explicit context objects, which makes it completely thread-safe.
In turn, keep an explicit context object in key.cpp, which is explicitly initialized
destroyed. This is not really pretty now, but it's more efficient than the static
initialized object in key.cpp (which made for example bitcoin-tx slow, as for most of
its calls, libsecp256k1 wasn't actually needed).
This also brings in the new blinding support in libsecp256k1. By passing in a random
seed, temporary variables during the elliptic curve computations are altered, in such
a way that if an attacker does not know the blind, observing the internal operations
leaks less information about the keys used. This was implemented by Greg Maxwell.
10 years ago
|
|
|
ECC_Stop();
|
|
|
|
}
|
|
|
|
|
|
|
|
TestingSetup::TestingSetup(const std::string& chainName) : BasicTestingSetup(chainName)
|
|
|
|
{
|
|
|
|
const CChainParams& chainparams = Params();
|
|
|
|
// Ideally we'd move all the RPC tests to the functional testing framework
|
|
|
|
// instead of unit tests, but for now we need these here.
|
|
|
|
|
|
|
|
RegisterAllCoreRPCCommands(tableRPC);
|
|
|
|
ClearDatadirCache();
|
|
|
|
pathTemp = fs::temp_directory_path() / strprintf("test_bitcoin_%lu_%i", (unsigned long)GetTime(), (int)(InsecureRandRange(100000)));
|
|
|
|
fs::create_directories(pathTemp);
|
|
|
|
gArgs.ForceSetArg("-datadir", pathTemp.string());
|
|
|
|
|
|
|
|
// Note that because we don't bother running a scheduler thread here,
|
|
|
|
// callbacks via CValidationInterface are unreliable, but that's OK,
|
|
|
|
// our unit tests aren't testing multiple parts of the code at once.
|
|
|
|
GetMainSignals().RegisterBackgroundSignalScheduler(scheduler);
|
|
|
|
|
|
|
|
mempool.setSanityCheck(1.0);
|
|
|
|
pblocktree.reset(new CBlockTreeDB(1 << 20, true));
|
|
|
|
pcoinsdbview.reset(new CCoinsViewDB(1 << 23, true));
|
|
|
|
pcoinsTip.reset(new CCoinsViewCache(pcoinsdbview.get()));
|
|
|
|
if (!LoadGenesisBlock(chainparams)) {
|
|
|
|
throw std::runtime_error("LoadGenesisBlock failed.");
|
|
|
|
}
|
|
|
|
{
|
|
|
|
CValidationState state;
|
|
|
|
if (!ActivateBestChain(state, chainparams)) {
|
|
|
|
throw std::runtime_error("ActivateBestChain failed.");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
nScriptCheckThreads = 3;
|
|
|
|
for (int i=0; i < nScriptCheckThreads-1; i++)
|
|
|
|
threadGroup.create_thread(&ThreadScriptCheck);
|
|
|
|
g_connman = std::unique_ptr<CConnman>(new CConnman(0x1337, 0x1337)); // Deterministic randomness for tests.
|
|
|
|
connman = g_connman.get();
|
|
|
|
peerLogic.reset(new PeerLogicValidation(connman, scheduler));
|
|
|
|
}
|
|
|
|
|
|
|
|
TestingSetup::~TestingSetup()
|
|
|
|
{
|
|
|
|
threadGroup.interrupt_all();
|
|
|
|
threadGroup.join_all();
|
|
|
|
GetMainSignals().FlushBackgroundCallbacks();
|
|
|
|
GetMainSignals().UnregisterBackgroundSignalScheduler();
|
|
|
|
g_connman.reset();
|
|
|
|
peerLogic.reset();
|
|
|
|
UnloadBlockIndex();
|
|
|
|
pcoinsTip.reset();
|
|
|
|
pcoinsdbview.reset();
|
|
|
|
pblocktree.reset();
|
|
|
|
fs::remove_all(pathTemp);
|
|
|
|
}
|
|
|
|
|
|
|
|
TestChain100Setup::TestChain100Setup() : TestingSetup(CBaseChainParams::REGTEST)
|
|
|
|
{
|
|
|
|
// CreateAndProcessBlock() does not support building SegWit blocks, so don't activate in these tests.
|
|
|
|
// TODO: fix the code to support SegWit blocks.
|
|
|
|
UpdateVersionBitsParameters(Consensus::DEPLOYMENT_SEGWIT, 0, Consensus::BIP9Deployment::NO_TIMEOUT);
|
|
|
|
// Generate a 100-block chain:
|
|
|
|
coinbaseKey.MakeNewKey(true);
|
|
|
|
CScript scriptPubKey = CScript() << ToByteVector(coinbaseKey.GetPubKey()) << OP_CHECKSIG;
|
|
|
|
for (int i = 0; i < COINBASE_MATURITY; i++)
|
|
|
|
{
|
|
|
|
std::vector<CMutableTransaction> noTxns;
|
|
|
|
CBlock b = CreateAndProcessBlock(noTxns, scriptPubKey);
|
|
|
|
coinbaseTxns.push_back(*b.vtx[0]);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
//
|
|
|
|
// Create a new block with just given transactions, coinbase paying to
|
|
|
|
// scriptPubKey, and try to add it to the current chain.
|
|
|
|
//
|
|
|
|
CBlock
|
|
|
|
TestChain100Setup::CreateAndProcessBlock(const std::vector<CMutableTransaction>& txns, const CScript& scriptPubKey)
|
|
|
|
{
|
|
|
|
const CChainParams& chainparams = Params();
|
|
|
|
std::unique_ptr<CBlockTemplate> pblocktemplate = BlockAssembler(chainparams).CreateNewBlock(scriptPubKey);
|
|
|
|
CBlock& block = pblocktemplate->block;
|
|
|
|
|
|
|
|
// Replace mempool-selected txns with just coinbase plus passed-in txns:
|
|
|
|
block.vtx.resize(1);
|
|
|
|
for (const CMutableTransaction& tx : txns)
|
|
|
|
block.vtx.push_back(MakeTransactionRef(tx));
|
|
|
|
// IncrementExtraNonce creates a valid coinbase and merkleRoot
|
|
|
|
unsigned int extraNonce = 0;
|
|
|
|
{
|
|
|
|
LOCK(cs_main);
|
|
|
|
IncrementExtraNonce(&block, chainActive.Tip(), extraNonce);
|
|
|
|
}
|
|
|
|
|
|
|
|
while (!CheckProofOfWork(block.GetHash(), block.nBits, chainparams.GetConsensus())) ++block.nNonce;
|
|
|
|
|
|
|
|
std::shared_ptr<const CBlock> shared_pblock = std::make_shared<const CBlock>(block);
|
|
|
|
ProcessNewBlock(chainparams, shared_pblock, true, nullptr);
|
|
|
|
|
|
|
|
CBlock result = block;
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
TestChain100Setup::~TestChain100Setup()
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
CTxMemPoolEntry TestMemPoolEntryHelper::FromTx(const CMutableTransaction &tx) {
|
|
|
|
CTransaction txn(tx);
|
|
|
|
return FromTx(txn);
|
|
|
|
}
|
|
|
|
|
|
|
|
CTxMemPoolEntry TestMemPoolEntryHelper::FromTx(const CTransaction &txn) {
|
|
|
|
return CTxMemPoolEntry(MakeTransactionRef(txn), nFee, nTime, nHeight,
|
|
|
|
spendsCoinbase, sigOpCost, lp);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* @returns a real block (0000000000013b8ab2cd513b0261a14096412195a72a0c4827d229dcc7e0f7af)
|
|
|
|
* with 9 txs.
|
|
|
|
*/
|
|
|
|
CBlock getBlock13b8a()
|
|
|
|
{
|
|
|
|
CBlock block;
|
|
|
|
CDataStream stream(ParseHex("0100000090f0a9f110702f808219ebea1173056042a714bad51b916cb6800000000000005275289558f51c9966699404ae2294730c3c9f9bda53523ce50e9b95e558da2fdb261b4d4c86041b1ab1bf930901000000010000000000000000000000000000000000000000000000000000000000000000ffffffff07044c86041b0146ffffffff0100f2052a01000000434104e18f7afbe4721580e81e8414fc8c24d7cfacf254bb5c7b949450c3e997c2dc1242487a8169507b631eb3771f2b425483fb13102c4eb5d858eef260fe70fbfae0ac00000000010000000196608ccbafa16abada902780da4dc35dafd7af05fa0da08cf833575f8cf9e836000000004a493046022100dab24889213caf43ae6adc41cf1c9396c08240c199f5225acf45416330fd7dbd022100fe37900e0644bf574493a07fc5edba06dbc07c311b947520c2d514bc5725dcb401ffffffff0100f2052a010000001976a914f15d1921f52e4007b146dfa60f369ed2fc393ce288ac000000000100000001fb766c1288458c2bafcfec81e48b24d98ec706de6b8af7c4e3c29419bfacb56d000000008c493046022100f268ba165ce0ad2e6d93f089cfcd3785de5c963bb5ea6b8c1b23f1ce3e517b9f022100da7c0f21adc6c401887f2bfd1922f11d76159cbc597fbd756a23dcbb00f4d7290141042b4e8625a96127826915a5b109852636ad0da753c9e1d5606a50480cd0c40f1f8b8d898235e571fe9357d9ec842bc4bba1827daaf4de06d71844d0057707966affffffff0280969800000000001976a9146963907531db72d0ed1a0cfb471ccb63923446f388ac80d6e34c000000001976a914f0688ba1c0d1ce182c7af6741e02658c7d4dfcd388ac000000000100000002c40297f730dd7b5a99567eb8d27b78758f607507c52292d02d4031895b52f2ff010000008b483045022100f7edfd4b0aac404e5bab4fd3889e0c6c41aa8d0e6fa122316f68eddd0a65013902205b09cc8b2d56e1cd1f7f2fafd60a129ed94504c4ac7bdc67b56fe67512658b3e014104732012cb962afa90d31b25d8fb0e32c94e513ab7a17805c14ca4c3423e18b4fb5d0e676841733cb83abaf975845c9f6f2a8097b7d04f4908b18368d6fc2d68ecffffffffca5065ff9617cbcba45eb23726df6498a9b9cafed4f54cbab9d227b0035ddefb000000008a473044022068010362a13c7f9919fa832b2dee4e788f61f6f5d344a7c2a0da6ae740605658022006d1af525b9a14a35c003b78b72bd59738cd676f845d1ff3fc25049e01003614014104732012cb962afa90d31b25d8fb0e32c94e513ab7a17805c14ca4c3423e18b4fb5d0e676841733cb83abaf975845c9f6f2a8097b7d04f4908b18368d6fc2d68ecffffffff01001ec4110200000043410469ab4181eceb28985b9b4e895c13fa5e68d85761b7eee311db5addef76fa8621865134a221bd01f28ec9999ee3e021e60766e9d1f3458c115fb28650605f11c9ac000000000100000001cdaf2f758e91c514655e2dc50633d1e4c84989f8aa90a0dbc883f0d23ed5c2fa010000008b48304502207ab51be6f12a1962ba0aaaf24a20e0b69b27a94fac5adf45aa7d2d18ffd9236102210086ae728b370e5329eead9accd880d0cb070aea0c96255fae6c4f1ddcce1fd56e014104462e76fd4067b3a0aa42070082dcb0bf2f388b6495cf33d789904f07d0f55c40fbd4b82963c69b3dc31895d0c772c812b1d5fbcade15312ef1c0e8ebbb12dcd4ffffffff02404b4c00000000001976a9142b6ba7c9d796b75eef7942fc9288edd37c32f5c388ac002d3101000000001976a9141befba0cdc1ad56529371864d9f6cb042faa06b588ac000000000100000001b4a47603e71b61bc3326efd90111bf02d2f549b067f4c4a8fa183b57a0f800cb010000008a4730440220177c37f9a505c3f1a1f0ce2da777c339bd8339ffa02c7cb41f0a5804f473c9230220585b25a2ee80eb59292e52b987dad92acb0c64eced92ed9ee105ad153cdb12d001410443bd44f683467e549dae7d20d1d79cbdb6df985c6e9c029c8d0c6cb46cc1a4d3cf7923c5021b27f7a0b562ada113bc85d5fda5a1b41e87fe6e8802817cf69996ffffffff0280651406000000001976a9145505614859643ab7b547cd7f1f5e7e2a12322d3788ac00aa0271000000001976a914ea4720a7a52fc166c55ff2298e07baf70ae67e1b88ac00000000010000000586c62cd602d219bb60edb14a3e204de0705176f9022fe49a538054fb14abb49e010000008c493046022100f2bc2aba2534becbdf062eb993853a42bbbc282083d0daf9b4b585bd401aa8c9022100b1d7fd7ee0b95600db8535bbf331b19eed8d961f7a8e54159c53675d5f69df8c014104462e76fd4067b3a0aa42070082dcb0bf2f388b6495cf33d789904f07d0f55c40fbd4b82963c69b3dc31895d0c772c812b1d5fbcade15312ef1c0e8ebbb12dcd4ffffffff03ad0e58ccdac3df9dc28a218bcf6f1997b0a93306faaa4b3a28ae83447b2179010000008b483045022100be12b2937179da88599e27bb31c3525097a07cdb52422d165b3ca2f2020ffcf702200971b51f853a53d644ebae9ec8f3512e442b1bcb6c315a5b491d119d10624c83014104462e76fd4067b3a0aa42070082dcb0bf2f388b6495cf33d789904f07d0f55c40fbd4b82963c69b3dc31895d0c772c812b1d5fbcade15312ef1c0e8ebbb12dcd4ffffffff2acfcab629bbc8685792603762c921580030ba144af553d271716a95089e107b010000008b483045022100fa579a840ac258871365dd48cd7552f96c8eea69bd00d84f05b283a0da
|
|
|
|
stream >> block;
|
|
|
|
return block;
|
|
|
|
}
|