Mercurial > hg > bitcoin
view src/test/allocator_tests.cpp @ 3649:eb986f1e2e93 draft
Ultraprune
This switches bitcoin's transaction/block verification logic to use a
"coin database", which contains all unredeemed transaction output scripts,
amounts and heights.
The name ultraprune comes from the fact that instead of a full transaction
index, we only (need to) keep an index with unspent outputs. For now, the
blocks themselves are kept as usual, although they are only necessary for
serving, rescanning and reorganizing.
The basic datastructures are CCoins (representing the coins of a single
transaction), and CCoinsView (representing a state of the coins database).
There are several implementations for CCoinsView. A dummy, one backed by
the coins database (coins.dat), one backed by the memory pool, and one
that adds a cache on top of it. FetchInputs, ConnectInputs, ConnectBlock,
DisconnectBlock, ... now operate on a generic CCoinsView.
The block switching logic now builds a single cached CCoinsView with
changes to be committed to the database before any changes are made.
This means no uncommitted changes are ever read from the database, and
should ease the transition to another database layer which does not
support transactions (but does support atomic writes), like LevelDB.
For the getrawtransaction() RPC call, access to a txid-to-disk index
would be preferable. As this index is not necessary or even useful
for any other part of the implementation, it is not provided. Instead,
getrawtransaction() uses the coin database to find the block height,
and then scans that block to find the requested transaction. This is
slow, but should suffice for debug purposes.
author | Pieter Wuille <pieter.wuille@gmail.com> |
---|---|
date | Sun, 01 Jul 2012 18:54:00 +0200 |
parents | 84a7ce8a2d62 |
children |
line wrap: on
line source
#include <boost/test/unit_test.hpp> #include "init.h" #include "main.h" #include "util.h" BOOST_AUTO_TEST_SUITE(allocator_tests) // Dummy memory page locker for platform independent tests static const void *last_lock_addr, *last_unlock_addr; static size_t last_lock_len, last_unlock_len; class TestLocker { public: bool Lock(const void *addr, size_t len) { last_lock_addr = addr; last_lock_len = len; return true; } bool Unlock(const void *addr, size_t len) { last_unlock_addr = addr; last_unlock_len = len; return true; } }; BOOST_AUTO_TEST_CASE(test_LockedPageManagerBase) { const size_t test_page_size = 4096; LockedPageManagerBase<TestLocker> lpm(test_page_size); size_t addr; last_lock_addr = last_unlock_addr = 0; last_lock_len = last_unlock_len = 0; /* Try large number of small objects */ addr = 0; for(int i=0; i<1000; ++i) { lpm.LockRange(reinterpret_cast<void*>(addr), 33); addr += 33; } /* Try small number of page-sized objects, straddling two pages */ addr = test_page_size*100 + 53; for(int i=0; i<100; ++i) { lpm.LockRange(reinterpret_cast<void*>(addr), test_page_size); addr += test_page_size; } /* Try small number of page-sized objects aligned to exactly one page */ addr = test_page_size*300; for(int i=0; i<100; ++i) { lpm.LockRange(reinterpret_cast<void*>(addr), test_page_size); addr += test_page_size; } /* one very large object, straddling pages */ lpm.LockRange(reinterpret_cast<void*>(test_page_size*600+1), test_page_size*500); BOOST_CHECK(last_lock_addr == reinterpret_cast<void*>(test_page_size*(600+500))); /* one very large object, page aligned */ lpm.LockRange(reinterpret_cast<void*>(test_page_size*1200), test_page_size*500-1); BOOST_CHECK(last_lock_addr == reinterpret_cast<void*>(test_page_size*(1200+500-1))); BOOST_CHECK(lpm.GetLockedPageCount() == ( (1000*33+test_page_size-1)/test_page_size + // small objects 101 + 100 + // page-sized objects 501 + 500)); // large objects BOOST_CHECK((last_lock_len & (test_page_size-1)) == 0); // always lock entire pages BOOST_CHECK(last_unlock_len == 0); // nothing unlocked yet /* And unlock again */ addr = 0; for(int i=0; i<1000; ++i) { lpm.UnlockRange(reinterpret_cast<void*>(addr), 33); addr += 33; } addr = test_page_size*100 + 53; for(int i=0; i<100; ++i) { lpm.UnlockRange(reinterpret_cast<void*>(addr), test_page_size); addr += test_page_size; } addr = test_page_size*300; for(int i=0; i<100; ++i) { lpm.UnlockRange(reinterpret_cast<void*>(addr), test_page_size); addr += test_page_size; } lpm.UnlockRange(reinterpret_cast<void*>(test_page_size*600+1), test_page_size*500); lpm.UnlockRange(reinterpret_cast<void*>(test_page_size*1200), test_page_size*500-1); /* Check that everything is released */ BOOST_CHECK(lpm.GetLockedPageCount() == 0); /* A few and unlocks of size zero (should have no effect) */ addr = 0; for(int i=0; i<1000; ++i) { lpm.LockRange(reinterpret_cast<void*>(addr), 0); addr += 1; } BOOST_CHECK(lpm.GetLockedPageCount() == 0); addr = 0; for(int i=0; i<1000; ++i) { lpm.UnlockRange(reinterpret_cast<void*>(addr), 0); addr += 1; } BOOST_CHECK(lpm.GetLockedPageCount() == 0); BOOST_CHECK((last_unlock_len & (test_page_size-1)) == 0); // always unlock entire pages } BOOST_AUTO_TEST_SUITE_END()