Branch data Line data Source code
1 : : // Copyright (c) 2014-present The Bitcoin Core developers
2 : : // Distributed under the MIT software license, see the accompanying
3 : : // file COPYING or http://www.opensource.org/licenses/mit-license.php.
4 : :
5 : : #include <addresstype.h>
6 : : #include <clientversion.h>
7 : : #include <coins.h>
8 : : #include <streams.h>
9 : : #include <test/util/poolresourcetester.h>
10 : : #include <test/util/random.h>
11 : : #include <test/util/setup_common.h>
12 : : #include <txdb.h>
13 : : #include <uint256.h>
14 : : #include <undo.h>
15 : : #include <util/strencodings.h>
16 : :
17 : : #include <map>
18 : : #include <string>
19 : : #include <variant>
20 : : #include <vector>
21 : :
22 : : #include <boost/test/unit_test.hpp>
23 : :
24 : : using namespace util::hex_literals;
25 : :
26 : : int ApplyTxInUndo(Coin&& undo, CCoinsViewCache& view, const COutPoint& out);
27 : : void UpdateCoins(const CTransaction& tx, CCoinsViewCache& inputs, CTxUndo &txundo, int nHeight);
28 : :
29 : : namespace
30 : : {
31 : : //! equality test
32 : 963909 : bool operator==(const Coin &a, const Coin &b) {
33 : : // Empty Coin objects are always equal.
34 [ + + - + ]: 963909 : if (a.IsSpent() && b.IsSpent()) return true;
35 : 537452 : return a.fCoinBase == b.fCoinBase &&
36 [ + - + - : 537452 : a.nHeight == b.nHeight &&
- + ]
37 : 268726 : a.out == b.out;
38 : : }
39 : :
40 : 3 : class CCoinsViewTest : public CCoinsView
41 : : {
42 : : FastRandomContext& m_rng;
43 : : uint256 hashBestBlock_;
44 : : std::map<COutPoint, Coin> map_;
45 : :
46 : : public:
47 : 3 : CCoinsViewTest(FastRandomContext& rng) : m_rng{rng} {}
48 : :
49 : 5074625 : std::optional<Coin> GetCoin(const COutPoint& outpoint) const override
50 : : {
51 [ + + + + ]: 5074625 : if (auto it{map_.find(outpoint)}; it != map_.end() && !it->second.IsSpent()) return it->second;
52 : 4955977 : return std::nullopt;
53 : : }
54 : :
55 : 2 : uint256 GetBestBlock() const override { return hashBestBlock_; }
56 : :
57 : 292 : void BatchWrite(CoinsViewCacheCursor& cursor, const uint256& hashBlock) override
58 : : {
59 [ + + ]: 82688 : for (auto it{cursor.Begin()}; it != cursor.End(); it = cursor.NextAndMaybeErase(*it)){
60 [ + - ]: 82396 : if (it->second.IsDirty()) {
61 : : // Same optimization used in CCoinsViewDB is to only write dirty entries.
62 : 82396 : map_[it->first] = it->second.coin;
63 [ + + + + ]: 82396 : if (it->second.coin.IsSpent() && m_rng.randrange(3) == 0) {
64 : : // Randomly delete empty entries on write.
65 : 12328 : map_.erase(it->first);
66 : : }
67 : : }
68 : : }
69 [ + + ]: 584 : if (!hashBlock.IsNull())
70 : 1 : hashBestBlock_ = hashBlock;
71 : 292 : }
72 : : };
73 : :
74 : 0 : class CCoinsViewCacheTest : public CCoinsViewCache
75 : : {
76 : : public:
77 [ + - + - : 808 : explicit CCoinsViewCacheTest(CCoinsView* _base) : CCoinsViewCache(_base) {}
+ - + - +
- ]
78 : :
79 : 335 : void SelfTest(bool sanity_check = true) const
80 : : {
81 : : // Manually recompute the dynamic usage of the whole data, and compare it.
82 : 335 : size_t ret = memusage::DynamicUsage(cacheCoins);
83 : 335 : size_t count = 0;
84 [ + + + + ]: 371649 : for (const auto& entry : cacheCoins) {
85 [ + + ]: 371314 : ret += entry.second.coin.DynamicMemoryUsage();
86 : 371314 : ++count;
87 : : }
88 [ + - ]: 335 : BOOST_CHECK_EQUAL(GetCacheSize(), count);
89 [ + - ]: 335 : BOOST_CHECK_EQUAL(DynamicMemoryUsage(), ret);
90 [ + + ]: 335 : if (sanity_check) {
91 : 226 : SanityCheck();
92 : : }
93 : 335 : }
94 : :
95 [ + - ]: 10 : CCoinsMap& map() const { return cacheCoins; }
96 [ + - ]: 176 : CoinsCachePair& sentinel() const { return m_sentinel; }
97 : 176 : size_t& usage() const { return cachedCoinsUsage; }
98 : : };
99 : :
100 : : } // namespace
101 : :
102 : : static const unsigned int NUM_SIMULATION_ITERATIONS = 40000;
103 : :
104 : 4 : struct CacheTest : BasicTestingSetup {
105 : : // This is a large randomized insert/remove simulation test on a variable-size
106 : : // stack of caches on top of CCoinsViewTest.
107 : : //
108 : : // It will randomly create/update/delete Coin entries to a tip of caches, with
109 : : // txids picked from a limited list of random 256-bit hashes. Occasionally, a
110 : : // new tip is added to the stack of caches, or the tip is flushed and removed.
111 : : //
112 : : // During the process, booleans are kept to make sure that the randomized
113 : : // operation hits all branches.
114 : : //
115 : : // If fake_best_block is true, assign a random uint256 to mock the recording
116 : : // of best block on flush. This is necessary when using CCoinsViewDB as the base,
117 : : // otherwise we'll hit an assertion in BatchWrite.
118 : : //
119 : 2 : void SimulationTest(CCoinsView* base, bool fake_best_block)
120 : : {
121 : : // Various coverage trackers.
122 : 2 : bool removed_all_caches = false;
123 : 2 : bool reached_4_caches = false;
124 : 2 : bool added_an_entry = false;
125 : 2 : bool added_an_unspendable_entry = false;
126 : 2 : bool removed_an_entry = false;
127 : 2 : bool updated_an_entry = false;
128 : 2 : bool found_an_entry = false;
129 : 2 : bool missed_an_entry = false;
130 : 2 : bool uncached_an_entry = false;
131 : 2 : bool flushed_without_erase = false;
132 : :
133 : : // A simple map to track what we expect the cache stack to represent.
134 [ + - ]: 2 : std::map<COutPoint, Coin> result;
135 : :
136 : : // The cache stack.
137 : 2 : std::vector<std::unique_ptr<CCoinsViewCacheTest>> stack; // A stack of CCoinsViewCaches on top.
138 [ + - ]: 4 : stack.push_back(std::make_unique<CCoinsViewCacheTest>(base)); // Start with one cache.
139 : :
140 : : // Use a limited set of random transaction ids, so we do test overwriting entries.
141 : 2 : std::vector<Txid> txids;
142 [ + - ]: 2 : txids.resize(NUM_SIMULATION_ITERATIONS / 8);
143 [ - + + + ]: 10002 : for (unsigned int i = 0; i < txids.size(); i++) {
144 : 10000 : txids[i] = Txid::FromUint256(m_rng.rand256());
145 : : }
146 : :
147 [ + + ]: 80002 : for (unsigned int i = 0; i < NUM_SIMULATION_ITERATIONS; i++) {
148 : : // Do a random modification.
149 : 80000 : {
150 [ - + + - ]: 80000 : auto txid = txids[m_rng.randrange(txids.size())]; // txid we're going to modify in this iteration.
151 [ + - ]: 80000 : Coin& coin = result[COutPoint(txid, 0)];
152 : :
153 : : // Determine whether to test HaveCoin before or after Access* (or both). As these functions
154 : : // can influence each other's behaviour by pulling things into the cache, all combinations
155 : : // are tested.
156 : 80000 : bool test_havecoin_before = m_rng.randbits(2) == 0;
157 : 80000 : bool test_havecoin_after = m_rng.randbits(2) == 0;
158 : :
159 [ + + + - ]: 80000 : bool result_havecoin = test_havecoin_before ? stack.back()->HaveCoin(COutPoint(txid, 0)) : false;
160 : :
161 : : // Infrequently, test usage of AccessByTxid instead of AccessCoin - the
162 : : // former just delegates to the latter and returns the first unspent in a txn.
163 [ + + ]: 80000 : const Coin& entry = (m_rng.randrange(500) == 0) ?
164 [ + - + - ]: 80000 : AccessByTxid(*stack.back(), txid) : stack.back()->AccessCoin(COutPoint(txid, 0));
165 [ + - + - : 160000 : BOOST_CHECK(coin == entry);
+ + ]
166 : :
167 [ + + ]: 80000 : if (test_havecoin_before) {
168 [ + - + - ]: 40240 : BOOST_CHECK(result_havecoin == !entry.IsSpent());
169 : : }
170 : :
171 [ + + ]: 80000 : if (test_havecoin_after) {
172 [ + - ]: 20005 : bool ret = stack.back()->HaveCoin(COutPoint(txid, 0));
173 [ + - + - ]: 40010 : BOOST_CHECK(ret == !entry.IsSpent());
174 : : }
175 : :
176 [ + + + + ]: 80000 : if (m_rng.randrange(5) == 0 || coin.IsSpent()) {
177 : 47901 : Coin newcoin;
178 : 47901 : newcoin.out.nValue = RandMoney(m_rng);
179 : 47901 : newcoin.nHeight = 1;
180 : :
181 : : // Infrequently test adding unspendable coins.
182 [ + + + + ]: 47901 : if (m_rng.randrange(16) == 0 && coin.IsSpent()) {
183 : 2483 : newcoin.out.scriptPubKey.assign(1 + m_rng.randbits(6), OP_RETURN);
184 [ + - + - ]: 4966 : BOOST_CHECK(newcoin.out.scriptPubKey.IsUnspendable());
185 : 2483 : added_an_unspendable_entry = true;
186 : : } else {
187 : : // Random sizes so we can test memory usage accounting
188 : 45418 : newcoin.out.scriptPubKey.assign(m_rng.randbits(6), 0);
189 [ + + ]: 45418 : (coin.IsSpent() ? added_an_entry : updated_an_entry) = true;
190 : 45418 : coin = newcoin;
191 : : }
192 [ + + + + ]: 47901 : bool is_overwrite = !coin.IsSpent() || m_rng.rand32() & 1;
193 [ + - ]: 47901 : stack.back()->AddCoin(COutPoint(txid, 0), std::move(newcoin), is_overwrite);
194 : 47901 : } else {
195 : : // Spend the coin.
196 : 32099 : removed_an_entry = true;
197 : 32099 : coin.Clear();
198 [ + - + - : 64198 : BOOST_CHECK(stack.back()->SpendCoin(COutPoint(txid, 0)));
+ - ]
199 : : }
200 : : }
201 : :
202 : : // Once every 10 iterations, remove a random entry from the cache
203 [ + + ]: 80000 : if (m_rng.randrange(10) == 0) {
204 [ - + ]: 8073 : COutPoint out(txids[m_rng.rand32() % txids.size()], 0);
205 [ - + ]: 8073 : int cacheid = m_rng.rand32() % stack.size();
206 [ + - ]: 8073 : stack[cacheid]->Uncache(out);
207 [ + - ]: 8073 : uncached_an_entry |= !stack[cacheid]->HaveCoinInCache(out);
208 : : }
209 : :
210 : : // Once every 1000 iterations and at the end, verify the full cache.
211 [ + + + + ]: 80000 : if (m_rng.randrange(1000) == 1 || i == NUM_SIMULATION_ITERATIONS - 1) {
212 [ + + ]: 276826 : for (const auto& entry : result) {
213 [ + - ]: 276760 : bool have = stack.back()->HaveCoin(entry.first);
214 [ + - ]: 276760 : const Coin& coin = stack.back()->AccessCoin(entry.first);
215 [ + - + - : 553520 : BOOST_CHECK(have == !coin.IsSpent());
+ - ]
216 [ + - + - : 553520 : BOOST_CHECK(coin == entry.second);
+ + ]
217 [ + + ]: 276760 : if (coin.IsSpent()) {
218 : : missed_an_entry = true;
219 : : } else {
220 [ + - + - : 323280 : BOOST_CHECK(stack.back()->HaveCoinInCache(entry.first));
+ - ]
221 : 161640 : found_an_entry = true;
222 : : }
223 : : }
224 [ + + ]: 219 : for (const auto& test : stack) {
225 [ + - ]: 153 : test->SelfTest();
226 : : }
227 : : }
228 : :
229 [ + + ]: 80000 : if (m_rng.randrange(100) == 0) {
230 : : // Every 100 iterations, flush an intermediate cache
231 [ - + + + : 823 : if (stack.size() > 1 && m_rng.randbool() == 0) {
+ + ]
232 [ - + ]: 314 : unsigned int flushIndex = m_rng.randrange(stack.size() - 1);
233 [ + + + - ]: 314 : if (fake_best_block) stack[flushIndex]->SetBestBlock(m_rng.rand256());
234 : 314 : bool should_erase = m_rng.randrange(4) < 3;
235 [ + + + - : 314 : should_erase ? stack[flushIndex]->Flush() : stack[flushIndex]->Sync();
+ - ]
236 : 314 : flushed_without_erase |= !should_erase;
237 : : }
238 : : }
239 [ + + ]: 80000 : if (m_rng.randrange(100) == 0) {
240 : : // Every 100 iterations, change the cache stack.
241 [ - + + - : 815 : if (stack.size() > 0 && m_rng.randbool() == 0) {
+ + ]
242 : : //Remove the top cache
243 [ + + + - ]: 404 : if (fake_best_block) stack.back()->SetBestBlock(m_rng.rand256());
244 : 404 : bool should_erase = m_rng.randrange(4) < 3;
245 [ + + + - : 404 : should_erase ? stack.back()->Flush() : stack.back()->Sync();
+ - ]
246 : 404 : flushed_without_erase |= !should_erase;
247 : 404 : stack.pop_back();
248 : : }
249 [ - + + + : 815 : if (stack.size() == 0 || (stack.size() < 4 && m_rng.randbool())) {
+ + + + ]
250 : : //Add a new cache
251 : 408 : CCoinsView* tip = base;
252 [ - + + + ]: 408 : if (stack.size() > 0) {
253 : 301 : tip = stack.back().get();
254 : : } else {
255 : : removed_all_caches = true;
256 : : }
257 [ + - ]: 816 : stack.push_back(std::make_unique<CCoinsViewCacheTest>(tip));
258 [ - + + + ]: 408 : if (stack.size() == 4) {
259 : 111 : reached_4_caches = true;
260 : : }
261 : : }
262 : : }
263 : : }
264 : :
265 : : // Verify coverage.
266 [ + - + - : 4 : BOOST_CHECK(removed_all_caches);
+ - ]
267 [ + - + - : 4 : BOOST_CHECK(reached_4_caches);
+ - ]
268 [ + - + - : 4 : BOOST_CHECK(added_an_entry);
+ - ]
269 [ + - + - : 4 : BOOST_CHECK(added_an_unspendable_entry);
+ - ]
270 [ + - + - : 4 : BOOST_CHECK(removed_an_entry);
+ - ]
271 [ + - + - : 4 : BOOST_CHECK(updated_an_entry);
+ - ]
272 [ + - + - : 4 : BOOST_CHECK(found_an_entry);
+ - ]
273 [ + - + - : 4 : BOOST_CHECK(missed_an_entry);
+ - ]
274 [ + - + - : 4 : BOOST_CHECK(uncached_an_entry);
+ - ]
275 [ + - + - ]: 4 : BOOST_CHECK(flushed_without_erase);
276 : 2 : }
277 : : }; // struct CacheTest
278 : :
279 : : BOOST_FIXTURE_TEST_SUITE(coins_tests_base, BasicTestingSetup)
280 : :
281 : : // Run the above simulation for multiple base types.
282 [ + - + - : 7 : BOOST_FIXTURE_TEST_CASE(coins_cache_base_simulation_test, CacheTest)
+ - + - -
+ + - + -
+ - + - +
- + - - +
+ - + - +
- + - + -
+ - - + +
- + - + -
+ - + - +
- + - - +
+ - + - +
- + - + -
+ - - + +
- ]
283 : : {
284 [ + - ]: 1 : CCoinsViewTest base{m_rng};
285 [ + - ]: 1 : SimulationTest(&base, false);
286 : 1 : }
287 : :
288 : : BOOST_AUTO_TEST_SUITE_END()
289 : :
290 : : BOOST_FIXTURE_TEST_SUITE(coins_tests_dbbase, BasicTestingSetup)
291 : :
292 [ + - + - : 7 : BOOST_FIXTURE_TEST_CASE(coins_cache_dbbase_simulation_test, CacheTest)
+ - + - -
+ + - + -
+ - + - +
- + - - +
+ - + - +
- + - + -
+ - - + +
- + - + -
+ - + - +
- + - - +
+ - + - +
- + - + -
+ - - + +
- ]
293 : : {
294 : 0 : CCoinsViewDB db_base{{.path = "test", .cache_bytes = 1 << 23, .memory_only = true}, {}};
295 [ + - ]: 1 : SimulationTest(&db_base, true);
296 [ + - ]: 2 : }
297 : :
298 : : BOOST_AUTO_TEST_SUITE_END()
299 : :
300 : : BOOST_FIXTURE_TEST_SUITE(coins_tests, BasicTestingSetup)
301 : :
302 : : struct UpdateTest : BasicTestingSetup {
303 : : // Store of all necessary tx and undo data for next test
304 : : typedef std::map<COutPoint, std::tuple<CTransaction,CTxUndo,Coin>> UtxoData;
305 : : UtxoData utxoData;
306 : :
307 : 40278 : UtxoData::iterator FindRandomFrom(const std::set<COutPoint> &utxoSet) {
308 [ - + ]: 40278 : assert(utxoSet.size());
309 : 40278 : auto utxoSetIt = utxoSet.lower_bound(COutPoint(Txid::FromUint256(m_rng.rand256()), 0));
310 [ + + ]: 40278 : if (utxoSetIt == utxoSet.end()) {
311 : 579 : utxoSetIt = utxoSet.begin();
312 : : }
313 : 40278 : auto utxoDataIt = utxoData.find(*utxoSetIt);
314 [ - + ]: 40278 : assert(utxoDataIt != utxoData.end());
315 : 40278 : return utxoDataIt;
316 : : }
317 : : }; // struct UpdateTest
318 : :
319 : :
320 : : // This test is similar to the previous test
321 : : // except the emphasis is on testing the functionality of UpdateCoins
322 : : // random txs are created and UpdateCoins is used to update the cache stack
323 : : // In particular it is tested that spending a duplicate coinbase tx
324 : : // has the expected effect (the other duplicate is overwritten at all cache levels)
325 [ + - + - : 7 : BOOST_FIXTURE_TEST_CASE(updatecoins_simulation_test, UpdateTest)
+ - + - -
+ + - + -
+ - + - +
- + - - +
+ - + - +
- + - + -
+ - - + +
- + - + -
+ - + - +
- + - - +
+ - + - +
- + - + -
+ - - + +
- ]
326 : : {
327 : 1 : SeedRandomForTest(SeedRand::ZEROS);
328 : :
329 : 1 : bool spent_a_duplicate_coinbase = false;
330 : : // A simple map to track what we expect the cache stack to represent.
331 [ + - ]: 1 : std::map<COutPoint, Coin> result;
332 : :
333 : : // The cache stack.
334 [ + - ]: 1 : CCoinsViewTest base{m_rng}; // A CCoinsViewTest at the bottom.
335 : 1 : std::vector<std::unique_ptr<CCoinsViewCacheTest>> stack; // A stack of CCoinsViewCaches on top.
336 [ + - ]: 2 : stack.push_back(std::make_unique<CCoinsViewCacheTest>(&base)); // Start with one cache.
337 : :
338 : : // Track the txids we've used in various sets
339 : 1 : std::set<COutPoint> coinbase_coins;
340 : 1 : std::set<COutPoint> disconnected_coins;
341 : 1 : std::set<COutPoint> duplicate_coins;
342 : 1 : std::set<COutPoint> utxoset;
343 : :
344 [ + + ]: 40001 : for (unsigned int i = 0; i < NUM_SIMULATION_ITERATIONS; i++) {
345 : 40000 : uint32_t randiter = m_rng.rand32();
346 : :
347 : : // 19/20 txs add a new transaction
348 [ + + ]: 40000 : if (randiter % 20 < 19) {
349 [ + - ]: 38029 : CMutableTransaction tx;
350 [ + - ]: 38029 : tx.vin.resize(1);
351 [ + - ]: 38029 : tx.vout.resize(1);
352 : 38029 : tx.vout[0].nValue = i; //Keep txs unique unless intended to duplicate
353 : 38029 : tx.vout[0].scriptPubKey.assign(m_rng.rand32() & 0x3F, 0); // Random sizes so we can test memory usage accounting
354 : 38029 : const int height{int(m_rng.rand32() >> 1)};
355 : 38029 : Coin old_coin;
356 : :
357 : : // 2/20 times create a new coinbase
358 [ + + + + ]: 38029 : if (randiter % 20 < 2 || coinbase_coins.size() < 10) {
359 : : // 1/10 of those times create a duplicate coinbase
360 [ + + - + ]: 3931 : if (m_rng.randrange(10) == 0 && coinbase_coins.size()) {
361 : 400 : auto utxod = FindRandomFrom(coinbase_coins);
362 : : // Reuse the exact same coinbase
363 [ + - ]: 400 : tx = CMutableTransaction{std::get<0>(utxod->second)};
364 : : // shouldn't be available for reconnection if it's been duplicated
365 : 400 : disconnected_coins.erase(utxod->first);
366 : :
367 [ + - ]: 400 : duplicate_coins.insert(utxod->first);
368 : : }
369 : : else {
370 [ + - + - ]: 3531 : coinbase_coins.insert(COutPoint(tx.GetHash(), 0));
371 : : }
372 [ + - - + ]: 7862 : assert(CTransaction(tx).IsCoinBase());
373 : : }
374 : :
375 : : // 17/20 times reconnect previous or add a regular tx
376 : : else {
377 : :
378 [ + + ]: 34098 : COutPoint prevout;
379 : : // 1/20 times reconnect a previously disconnected tx
380 [ + + + + ]: 34098 : if (randiter % 20 == 2 && disconnected_coins.size()) {
381 : 1943 : auto utxod = FindRandomFrom(disconnected_coins);
382 [ + - ]: 1943 : tx = CMutableTransaction{std::get<0>(utxod->second)};
383 [ + - ]: 1943 : prevout = tx.vin[0].prevout;
384 [ + - + + : 3886 : if (!CTransaction(tx).IsCoinBase() && !utxoset.contains(prevout)) {
+ + + + ]
385 : 396 : disconnected_coins.erase(utxod->first);
386 : 396 : continue;
387 : : }
388 : :
389 : : // If this tx is already IN the UTXO, then it must be a coinbase, and it must be a duplicate
390 [ - + ]: 1547 : if (utxoset.contains(utxod->first)) {
391 [ # # # # ]: 0 : assert(CTransaction(tx).IsCoinBase());
392 [ # # ]: 0 : assert(duplicate_coins.contains(utxod->first));
393 : : }
394 : 1547 : disconnected_coins.erase(utxod->first);
395 : : }
396 : :
397 : : // 16/20 times create a regular tx
398 : : else {
399 : 32155 : auto utxod = FindRandomFrom(utxoset);
400 [ + - ]: 32155 : prevout = utxod->first;
401 : :
402 : : // Construct the tx to spend the coins of prevouthash
403 [ + - ]: 32155 : tx.vin[0].prevout = prevout;
404 [ + - - + ]: 64310 : assert(!CTransaction(tx).IsCoinBase());
405 : : }
406 : : // In this simple test coins only have two states, spent or unspent, save the unspent state to restore
407 [ + - ]: 33702 : old_coin = result[prevout];
408 : : // Update the expected result of prevouthash to know these coins are spent
409 [ + - ]: 33702 : result[prevout].Clear();
410 : :
411 : 33702 : utxoset.erase(prevout);
412 : :
413 : : // The test is designed to ensure spending a duplicate coinbase will work properly
414 : : // if that ever happens and not resurrect the previously overwritten coinbase
415 [ + + ]: 33702 : if (duplicate_coins.contains(prevout)) {
416 : 376 : spent_a_duplicate_coinbase = true;
417 : : }
418 : :
419 : : }
420 : : // Update the expected result to know about the new output coins
421 [ - + - + ]: 37633 : assert(tx.vout.size() == 1);
422 [ + - ]: 37633 : const COutPoint outpoint(tx.GetHash(), 0);
423 [ + - + - ]: 37633 : result[outpoint] = Coin{tx.vout[0], height, CTransaction{tx}.IsCoinBase()};
424 : :
425 : : // Call UpdateCoins on the top cache
426 : 37633 : CTxUndo undo;
427 [ + - + - ]: 37633 : UpdateCoins(CTransaction{tx}, *(stack.back()), undo, height);
428 : :
429 : : // Update the utxo set for future spends
430 [ + - ]: 37633 : utxoset.insert(outpoint);
431 : :
432 : : // Track this tx and undo info to use later
433 [ + - + - ]: 112899 : utxoData.emplace(outpoint, std::make_tuple(tx,undo,old_coin));
434 [ + - ]: 78029 : } else if (utxoset.size()) {
435 : : //1/20 times undo a previous transaction
436 : 1971 : auto utxod = FindRandomFrom(utxoset);
437 : :
438 [ + - ]: 1971 : CTransaction &tx = std::get<0>(utxod->second);
439 : 1971 : CTxUndo &undo = std::get<1>(utxod->second);
440 [ + - ]: 1971 : Coin &orig_coin = std::get<2>(utxod->second);
441 : :
442 : : // Update the expected result
443 : : // Remove new outputs
444 [ + - ]: 1971 : result[utxod->first].Clear();
445 : : // If not coinbase restore prevout
446 [ + + ]: 1971 : if (!tx.IsCoinBase()) {
447 [ + - ]: 1757 : result[tx.vin[0].prevout] = orig_coin;
448 : : }
449 : :
450 : : // Disconnect the tx from the current UTXO
451 : : // See code in DisconnectBlock
452 : : // remove outputs
453 [ + - + - : 3942 : BOOST_CHECK(stack.back()->SpendCoin(utxod->first));
+ - + + ]
454 : : // restore inputs
455 [ + + ]: 1971 : if (!tx.IsCoinBase()) {
456 : 1757 : const COutPoint &out = tx.vin[0].prevout;
457 : 1757 : Coin coin = undo.vprevout[0];
458 [ + - ]: 1757 : ApplyTxInUndo(std::move(coin), *(stack.back()), out);
459 : 1757 : }
460 : : // Store as a candidate for reconnection
461 [ + - ]: 1971 : disconnected_coins.insert(utxod->first);
462 : :
463 : : // Update the utxoset
464 : 1971 : utxoset.erase(utxod->first);
465 [ + + ]: 1971 : if (!tx.IsCoinBase())
466 [ + - ]: 1757 : utxoset.insert(tx.vin[0].prevout);
467 : : }
468 : :
469 : : // Once every 1000 iterations and at the end, verify the full cache.
470 [ + + + + ]: 39604 : if (m_rng.randrange(1000) == 1 || i == NUM_SIMULATION_ITERATIONS - 1) {
471 [ + + ]: 607183 : for (const auto& entry : result) {
472 [ + - ]: 607146 : bool have = stack.back()->HaveCoin(entry.first);
473 [ + - ]: 607146 : const Coin& coin = stack.back()->AccessCoin(entry.first);
474 [ + - + - : 1214292 : BOOST_CHECK(have == !coin.IsSpent());
+ - ]
475 [ + - + - ]: 1214292 : BOOST_CHECK(coin == entry.second);
476 : : }
477 : : }
478 : :
479 : : // One every 10 iterations, remove a random entry from the cache
480 [ + + + + ]: 39604 : if (utxoset.size() > 1 && m_rng.randrange(30) == 0) {
481 [ - + + - ]: 1346 : stack[m_rng.rand32() % stack.size()]->Uncache(FindRandomFrom(utxoset)->first);
482 : : }
483 [ + + + + ]: 39604 : if (disconnected_coins.size() > 1 && m_rng.randrange(30) == 0) {
484 [ - + + - ]: 1135 : stack[m_rng.rand32() % stack.size()]->Uncache(FindRandomFrom(disconnected_coins)->first);
485 : : }
486 [ + + + + ]: 39604 : if (duplicate_coins.size() > 1 && m_rng.randrange(30) == 0) {
487 [ - + + - ]: 1328 : stack[m_rng.rand32() % stack.size()]->Uncache(FindRandomFrom(duplicate_coins)->first);
488 : : }
489 : :
490 [ + + ]: 39604 : if (m_rng.randrange(100) == 0) {
491 : : // Every 100 iterations, flush an intermediate cache
492 [ - + + + : 395 : if (stack.size() > 1 && m_rng.randbool() == 0) {
+ + ]
493 [ - + ]: 148 : unsigned int flushIndex = m_rng.randrange(stack.size() - 1);
494 [ + - ]: 148 : stack[flushIndex]->Flush();
495 : : }
496 : : }
497 [ + + ]: 39604 : if (m_rng.randrange(100) == 0) {
498 : : // Every 100 iterations, change the cache stack.
499 [ - + + - : 373 : if (stack.size() > 0 && m_rng.randbool() == 0) {
+ + ]
500 [ + - ]: 196 : stack.back()->Flush();
501 : 196 : stack.pop_back();
502 : : }
503 [ - + + + : 373 : if (stack.size() == 0 || (stack.size() < 4 && m_rng.randbool())) {
+ + + + ]
504 : 197 : CCoinsView* tip = &base;
505 [ - + + + ]: 197 : if (stack.size() > 0) {
506 : 148 : tip = stack.back().get();
507 : : }
508 [ + - ]: 394 : stack.push_back(std::make_unique<CCoinsViewCacheTest>(tip));
509 : : }
510 : : }
511 : : }
512 : :
513 : : // Verify coverage.
514 [ + - + - ]: 2 : BOOST_CHECK(spent_a_duplicate_coinbase);
515 : 1 : }
516 : :
517 [ + - + - : 7 : BOOST_AUTO_TEST_CASE(ccoins_serialization)
+ - + - -
+ + - + -
+ - + - +
- + - - +
+ - + - +
- + - + -
+ - - + +
- + - + -
+ - + - +
- + - - +
+ - + - +
- + - + -
+ - - + +
- ]
518 : : {
519 : : // Good example
520 : 1 : Coin cc1;
521 [ + - ]: 1 : SpanReader{"97f23c835800816115944e077fe7c803cfa57f29b36bf87c1d35"_hex} >> cc1;
522 [ + - + - ]: 1 : BOOST_CHECK_EQUAL(cc1.fCoinBase, false);
523 [ + - + - ]: 1 : BOOST_CHECK_EQUAL(cc1.nHeight, 203998U);
524 [ + - + - ]: 1 : BOOST_CHECK_EQUAL(cc1.out.nValue, CAmount{60000000000});
525 [ + - + - : 3 : BOOST_CHECK_EQUAL(HexStr(cc1.out.scriptPubKey), HexStr(GetScriptForDestination(PKHash(uint160("816115944e077fe7c803cfa57f29b36bf87c1d35"_hex_u8)))));
+ - + - +
- ]
526 : :
527 : : // Good example
528 : 1 : Coin cc2;
529 [ + - ]: 1 : SpanReader{"8ddf77bbd123008c988f1a4a4de2161e0f50aac7f17e7f9555caa4"_hex} >> cc2;
530 [ + - + - ]: 1 : BOOST_CHECK_EQUAL(cc2.fCoinBase, true);
531 [ + - + - ]: 1 : BOOST_CHECK_EQUAL(cc2.nHeight, 120891U);
532 [ + - + - ]: 1 : BOOST_CHECK_EQUAL(cc2.out.nValue, 110397);
533 [ + - + - : 3 : BOOST_CHECK_EQUAL(HexStr(cc2.out.scriptPubKey), HexStr(GetScriptForDestination(PKHash(uint160("8c988f1a4a4de2161e0f50aac7f17e7f9555caa4"_hex_u8)))));
+ - + - +
- ]
534 : :
535 : : // Smallest possible example
536 : 1 : Coin cc3;
537 [ + - ]: 1 : SpanReader{"000006"_hex} >> cc3;
538 [ + - + - ]: 1 : BOOST_CHECK_EQUAL(cc3.fCoinBase, false);
539 [ + - + - ]: 1 : BOOST_CHECK_EQUAL(cc3.nHeight, 0U);
540 [ + - + - ]: 1 : BOOST_CHECK_EQUAL(cc3.out.nValue, 0);
541 [ + - - + : 1 : BOOST_CHECK_EQUAL(cc3.out.scriptPubKey.size(), 0U);
+ - ]
542 : :
543 : : // scriptPubKey that ends beyond the end of the stream
544 : 1 : try {
545 : 1 : Coin cc4;
546 [ - + ]: 1 : SpanReader{"000007"_hex} >> cc4;
547 [ # # # # ]: 0 : BOOST_CHECK_MESSAGE(false, "We should have thrown");
548 [ - + ]: 1 : } catch (const std::ios_base::failure&) {
549 : 1 : }
550 : :
551 : : // Very large scriptPubKey (3*10^9 bytes) past the end of the stream
552 : 1 : DataStream tmp{};
553 : 1 : uint64_t x = 3000000000ULL;
554 [ + - ]: 1 : tmp << VARINT(x);
555 [ + - - + : 1 : BOOST_CHECK_EQUAL(HexStr(tmp), "8a95c0bb00");
+ - + - ]
556 : 1 : try {
557 : 1 : Coin cc5;
558 [ - + ]: 1 : SpanReader{"00008a95c0bb00"_hex} >> cc5;
559 [ # # # # ]: 0 : BOOST_CHECK_MESSAGE(false, "We should have thrown");
560 [ - + ]: 1 : } catch (const std::ios_base::failure&) {
561 : 1 : }
562 : 1 : }
563 : :
564 : : const static COutPoint OUTPOINT;
565 : : constexpr CAmount SPENT {-1};
566 : : constexpr CAmount ABSENT{-2};
567 : : constexpr CAmount VALUE1{100};
568 : : constexpr CAmount VALUE2{200};
569 : : constexpr CAmount VALUE3{300};
570 : :
571 : : struct CoinEntry {
572 : : enum class State { CLEAN, DIRTY, FRESH, DIRTY_FRESH };
573 : :
574 : 167 : const CAmount value;
575 : 167 : const State state;
576 : :
577 : 253 : constexpr CoinEntry(const CAmount v, const State s) : value{v}, state{s} {}
578 : :
579 [ + - + - : 167 : bool operator==(const CoinEntry& o) const = default;
+ - - + ]
580 : 0 : friend std::ostream& operator<<(std::ostream& os, const CoinEntry& e) { return os << e.value << ", " << e.state; }
581 : :
582 : : constexpr bool IsDirtyFresh() const { return state == State::DIRTY_FRESH; }
583 [ + + ]: 186 : constexpr bool IsDirty() const { return state == State::DIRTY || IsDirtyFresh(); }
584 [ + + ]: 258 : constexpr bool IsFresh() const { return state == State::FRESH || IsDirtyFresh(); }
585 : :
586 : 167 : static constexpr State ToState(const bool is_dirty, const bool is_fresh) {
587 [ + + ]: 167 : if (is_dirty && is_fresh) return State::DIRTY_FRESH;
588 [ + + ]: 110 : if (is_dirty) return State::DIRTY;
589 [ + + ]: 43 : if (is_fresh) return State::FRESH;
590 : : return State::CLEAN;
591 : : }
592 : : };
593 : :
594 : : using MaybeCoin = std::optional<CoinEntry>;
595 : : using CoinOrError = std::variant<MaybeCoin, std::string>;
596 : :
597 : : constexpr MaybeCoin MISSING {std::nullopt};
598 : : constexpr MaybeCoin SPENT_DIRTY {{SPENT, CoinEntry::State::DIRTY}};
599 : : constexpr MaybeCoin SPENT_DIRTY_FRESH {{SPENT, CoinEntry::State::DIRTY_FRESH}};
600 : : constexpr MaybeCoin SPENT_FRESH {{SPENT, CoinEntry::State::FRESH}};
601 : : constexpr MaybeCoin SPENT_CLEAN {{SPENT, CoinEntry::State::CLEAN}};
602 : : constexpr MaybeCoin VALUE1_DIRTY {{VALUE1, CoinEntry::State::DIRTY}};
603 : : constexpr MaybeCoin VALUE1_DIRTY_FRESH{{VALUE1, CoinEntry::State::DIRTY_FRESH}};
604 : : constexpr MaybeCoin VALUE1_FRESH {{VALUE1, CoinEntry::State::FRESH}};
605 : : constexpr MaybeCoin VALUE1_CLEAN {{VALUE1, CoinEntry::State::CLEAN}};
606 : : constexpr MaybeCoin VALUE2_DIRTY {{VALUE2, CoinEntry::State::DIRTY}};
607 : : constexpr MaybeCoin VALUE2_DIRTY_FRESH{{VALUE2, CoinEntry::State::DIRTY_FRESH}};
608 : : constexpr MaybeCoin VALUE2_FRESH {{VALUE2, CoinEntry::State::FRESH}};
609 : : constexpr MaybeCoin VALUE2_CLEAN {{VALUE2, CoinEntry::State::CLEAN}};
610 : : constexpr MaybeCoin VALUE3_DIRTY {{VALUE3, CoinEntry::State::DIRTY}};
611 : : constexpr MaybeCoin VALUE3_DIRTY_FRESH{{VALUE3, CoinEntry::State::DIRTY_FRESH}};
612 : :
613 : : constexpr auto EX_OVERWRITE_UNSPENT{"Attempted to overwrite an unspent coin (when possible_overwrite is false)"};
614 : : constexpr auto EX_FRESH_MISAPPLIED {"FRESH flag misapplied to coin that exists in parent cache"};
615 : :
616 : 320 : static void SetCoinsValue(const CAmount value, Coin& coin)
617 : : {
618 [ - + ]: 320 : assert(value != ABSENT);
619 : 320 : coin.Clear();
620 [ - + ]: 320 : assert(coin.IsSpent());
621 [ + + ]: 320 : if (value != SPENT) {
622 : 160 : coin.out.nValue = value;
623 : 160 : coin.nHeight = 1;
624 : 160 : assert(!coin.IsSpent());
625 : : }
626 : 320 : }
627 : :
628 : 320 : static size_t InsertCoinsMapEntry(CCoinsMap& map, CoinsCachePair& sentinel, const CoinEntry& cache_coin)
629 : : {
630 : 320 : CCoinsCacheEntry entry;
631 : 320 : SetCoinsValue(cache_coin.value, entry.coin);
632 [ + - - + ]: 320 : auto [iter, inserted] = map.emplace(OUTPOINT, std::move(entry));
633 [ - + ]: 320 : assert(inserted);
634 [ + + ]: 382 : if (cache_coin.IsDirty()) CCoinsCacheEntry::SetDirty(*iter, sentinel);
635 [ + + ]: 382 : if (cache_coin.IsFresh()) CCoinsCacheEntry::SetFresh(*iter, sentinel);
636 [ - + ]: 640 : return iter->second.coin.DynamicMemoryUsage();
637 : 320 : }
638 : :
639 : 202 : static MaybeCoin GetCoinsMapEntry(const CCoinsMap& map, const COutPoint& outp = OUTPOINT)
640 : : {
641 [ + + ]: 202 : if (auto it{map.find(outp)}; it != map.end()) {
642 [ + + ]: 167 : return CoinEntry{
643 [ + + ]: 167 : it->second.coin.IsSpent() ? SPENT : it->second.coin.out.nValue,
644 [ + + + + ]: 384 : CoinEntry::ToState(it->second.IsDirty(), it->second.IsFresh())};
645 : : }
646 : 35 : return MISSING;
647 : : }
648 : :
649 : 288 : static void WriteCoinsViewEntry(CCoinsView& view, const MaybeCoin& cache_coin)
650 : : {
651 : 288 : CoinsCachePair sentinel{};
652 [ + - ]: 288 : sentinel.second.SelfRef(sentinel);
653 [ + - ]: 288 : CCoinsMapMemoryResource resource;
654 [ + - + - ]: 288 : CCoinsMap map{0, CCoinsMap::hasher{}, CCoinsMap::key_equal{}, &resource};
655 [ + + + - ]: 288 : if (cache_coin) InsertCoinsMapEntry(map, sentinel, *cache_coin);
656 [ + + ]: 288 : auto cursor{CoinsViewCacheCursor(sentinel, map, /*will_erase=*/true)};
657 [ + + ]: 288 : view.BatchWrite(cursor, {});
658 : 288 : }
659 : :
660 : : class SingleEntryCacheTest
661 : : {
662 : : public:
663 : 198 : SingleEntryCacheTest(const CAmount base_value, const MaybeCoin& cache_coin)
664 [ + - + - ]: 198 : {
665 [ + + ]: 198 : auto base_cache_coin{base_value == ABSENT ? MISSING : CoinEntry{base_value, CoinEntry::State::DIRTY}};
666 [ + - ]: 198 : WriteCoinsViewEntry(base, base_cache_coin);
667 [ + + + - ]: 198 : if (cache_coin) cache.usage() += InsertCoinsMapEntry(cache.map(), cache.sentinel(), *cache_coin);
668 : 198 : }
669 : :
670 : : CCoinsView root;
671 : : CCoinsViewCacheTest base{&root};
672 : : CCoinsViewCacheTest cache{&base};
673 : : };
674 : :
675 : 27 : static void CheckAccessCoin(const CAmount base_value, const MaybeCoin& cache_coin, const MaybeCoin& expected)
676 : : {
677 : 27 : SingleEntryCacheTest test{base_value, cache_coin};
678 [ + - ]: 27 : auto& coin = test.cache.AccessCoin(OUTPOINT);
679 [ + - + - : 27 : BOOST_CHECK_EQUAL(coin.IsSpent(), !test.cache.GetCoin(OUTPOINT));
+ - ]
680 [ + - ]: 27 : test.cache.SelfTest(/*sanity_check=*/false);
681 [ + - + - ]: 27 : BOOST_CHECK_EQUAL(GetCoinsMapEntry(test.cache.map()), expected);
682 : 27 : }
683 : :
684 [ + - + - : 7 : BOOST_AUTO_TEST_CASE(ccoins_access)
+ - + - -
+ + - + -
+ - + - +
- + - - +
+ - + - +
- + - + -
+ - - + +
- + - + -
+ - + - +
- + - - +
+ - + - +
- + - + -
+ - - + +
- ]
685 : : {
686 : : /* Check AccessCoin behavior, requesting a coin from a cache view layered on
687 : : * top of a base view, and checking the resulting entry in the cache after
688 : : * the access.
689 : : * Base Cache Expected
690 : : */
691 [ + + ]: 4 : for (auto base_value : {ABSENT, SPENT, VALUE1}) {
692 [ + + ]: 5 : CheckAccessCoin(base_value, MISSING, base_value == VALUE1 ? VALUE1_CLEAN : MISSING);
693 : :
694 : 3 : CheckAccessCoin(base_value, SPENT_CLEAN, SPENT_CLEAN );
695 : 3 : CheckAccessCoin(base_value, SPENT_FRESH, SPENT_FRESH );
696 : 3 : CheckAccessCoin(base_value, SPENT_DIRTY, SPENT_DIRTY );
697 : 3 : CheckAccessCoin(base_value, SPENT_DIRTY_FRESH, SPENT_DIRTY_FRESH );
698 : :
699 : 3 : CheckAccessCoin(base_value, VALUE2_CLEAN, VALUE2_CLEAN );
700 : 3 : CheckAccessCoin(base_value, VALUE2_FRESH, VALUE2_FRESH );
701 : 3 : CheckAccessCoin(base_value, VALUE2_DIRTY, VALUE2_DIRTY );
702 : 3 : CheckAccessCoin(base_value, VALUE2_DIRTY_FRESH, VALUE2_DIRTY_FRESH);
703 : : }
704 : 1 : }
705 : :
706 : 27 : static void CheckSpendCoins(const CAmount base_value, const MaybeCoin& cache_coin, const MaybeCoin& expected)
707 : : {
708 : 27 : SingleEntryCacheTest test{base_value, cache_coin};
709 [ + - ]: 27 : test.cache.SpendCoin(OUTPOINT);
710 [ + - ]: 27 : test.cache.SelfTest();
711 [ + - + - ]: 27 : BOOST_CHECK_EQUAL(GetCoinsMapEntry(test.cache.map()), expected);
712 : 27 : }
713 : :
714 [ + - + - : 7 : BOOST_AUTO_TEST_CASE(ccoins_spend)
+ - + - -
+ + - + -
+ - + - +
- + - - +
+ - + - +
- + - + -
+ - - + +
- + - + -
+ - + - +
- + - - +
+ - + - +
- + - + -
+ - - + +
- ]
715 : : {
716 : : /* Check SpendCoin behavior, requesting a coin from a cache view layered on
717 : : * top of a base view, spending, and then checking
718 : : * the resulting entry in the cache after the modification.
719 : : * Base Cache Expected
720 : : */
721 [ + + ]: 4 : for (auto base_value : {ABSENT, SPENT, VALUE1}) {
722 [ + + ]: 5 : CheckSpendCoins(base_value, MISSING, base_value == VALUE1 ? SPENT_DIRTY : MISSING);
723 : :
724 : 3 : CheckSpendCoins(base_value, SPENT_CLEAN, SPENT_DIRTY);
725 : 3 : CheckSpendCoins(base_value, SPENT_FRESH, MISSING );
726 : 3 : CheckSpendCoins(base_value, SPENT_DIRTY, SPENT_DIRTY);
727 : 3 : CheckSpendCoins(base_value, SPENT_DIRTY_FRESH, MISSING );
728 : :
729 : 3 : CheckSpendCoins(base_value, VALUE2_CLEAN, SPENT_DIRTY);
730 : 3 : CheckSpendCoins(base_value, VALUE2_FRESH, MISSING );
731 : 3 : CheckSpendCoins(base_value, VALUE2_DIRTY, SPENT_DIRTY);
732 : 3 : CheckSpendCoins(base_value, VALUE2_DIRTY_FRESH, MISSING );
733 : : }
734 : 1 : }
735 : :
736 : 54 : static void CheckAddCoin(const CAmount base_value, const MaybeCoin& cache_coin, const CAmount modify_value, const CoinOrError& expected, const bool coinbase)
737 : : {
738 : 54 : SingleEntryCacheTest test{base_value, cache_coin};
739 : 54 : bool possible_overwrite{coinbase};
740 [ + - + + ]: 120 : auto add_coin{[&] { test.cache.AddCoin(OUTPOINT, Coin{CTxOut{modify_value, CScript{}}, 1, coinbase}, possible_overwrite); }};
741 [ + + ]: 54 : if (auto* expected_coin{std::get_if<MaybeCoin>(&expected)}) {
742 [ + - ]: 42 : add_coin();
743 [ + - ]: 42 : test.cache.SelfTest();
744 [ + - + - ]: 42 : BOOST_CHECK_EQUAL(GetCoinsMapEntry(test.cache.map()), *expected_coin);
745 : : } else {
746 [ + - - + : 24 : BOOST_CHECK_EXCEPTION(add_coin(), std::logic_error, HasReason(std::get<std::string>(expected)));
- - - - -
+ + - - +
- + + - +
- ]
747 : : }
748 : 54 : }
749 : :
750 [ + - + - : 7 : BOOST_AUTO_TEST_CASE(ccoins_add)
+ - + - -
+ + - + -
+ - + - +
- + - - +
+ - + - +
- + - + -
+ - - + +
- + - + -
+ - + - +
- + - - +
+ - + - +
- + - + -
+ - - + +
- ]
751 : : {
752 : : /* Check AddCoin behavior, requesting a new coin from a cache view,
753 : : * writing a modification to the coin, and then checking the resulting
754 : : * entry in the cache after the modification. Verify behavior with the
755 : : * AddCoin coinbase argument set to false, and to true.
756 : : * Base Cache Write Expected Coinbase
757 : : */
758 [ + + ]: 4 : for (auto base_value : {ABSENT, SPENT, VALUE1}) {
759 [ + - ]: 3 : CheckAddCoin(base_value, MISSING, VALUE3, VALUE3_DIRTY_FRESH, false);
760 [ + - ]: 3 : CheckAddCoin(base_value, MISSING, VALUE3, VALUE3_DIRTY, true );
761 : :
762 [ + - ]: 3 : CheckAddCoin(base_value, SPENT_CLEAN, VALUE3, VALUE3_DIRTY_FRESH, false);
763 [ + - ]: 3 : CheckAddCoin(base_value, SPENT_CLEAN, VALUE3, VALUE3_DIRTY, true );
764 [ + - ]: 3 : CheckAddCoin(base_value, SPENT_FRESH, VALUE3, VALUE3_DIRTY_FRESH, false);
765 [ + - ]: 3 : CheckAddCoin(base_value, SPENT_FRESH, VALUE3, VALUE3_DIRTY_FRESH, true );
766 [ + - ]: 3 : CheckAddCoin(base_value, SPENT_DIRTY, VALUE3, VALUE3_DIRTY, false);
767 [ + - ]: 3 : CheckAddCoin(base_value, SPENT_DIRTY, VALUE3, VALUE3_DIRTY, true );
768 [ + - ]: 3 : CheckAddCoin(base_value, SPENT_DIRTY_FRESH, VALUE3, VALUE3_DIRTY_FRESH, false);
769 [ + - ]: 3 : CheckAddCoin(base_value, SPENT_DIRTY_FRESH, VALUE3, VALUE3_DIRTY_FRESH, true );
770 : :
771 [ + - ]: 3 : CheckAddCoin(base_value, VALUE2_CLEAN, VALUE3, EX_OVERWRITE_UNSPENT, false);
772 [ + - ]: 3 : CheckAddCoin(base_value, VALUE2_CLEAN, VALUE3, VALUE3_DIRTY, true );
773 [ + - ]: 3 : CheckAddCoin(base_value, VALUE2_FRESH, VALUE3, EX_OVERWRITE_UNSPENT, false);
774 [ + - ]: 3 : CheckAddCoin(base_value, VALUE2_FRESH, VALUE3, VALUE3_DIRTY_FRESH, true );
775 [ + - ]: 3 : CheckAddCoin(base_value, VALUE2_DIRTY, VALUE3, EX_OVERWRITE_UNSPENT, false);
776 [ + - ]: 3 : CheckAddCoin(base_value, VALUE2_DIRTY, VALUE3, VALUE3_DIRTY, true );
777 [ + - ]: 3 : CheckAddCoin(base_value, VALUE2_DIRTY_FRESH, VALUE3, EX_OVERWRITE_UNSPENT, false);
778 [ + - ]: 6 : CheckAddCoin(base_value, VALUE2_DIRTY_FRESH, VALUE3, VALUE3_DIRTY_FRESH, true );
779 : : }
780 : 1 : }
781 : :
782 : 90 : static void CheckWriteCoins(const MaybeCoin& parent, const MaybeCoin& child, const CoinOrError& expected)
783 : : {
784 : 90 : SingleEntryCacheTest test{ABSENT, parent};
785 : 180 : auto write_coins{[&] { WriteCoinsViewEntry(test.cache, child); }};
786 [ + + ]: 90 : if (auto* expected_coin{std::get_if<MaybeCoin>(&expected)}) {
787 [ + - ]: 82 : write_coins();
788 [ + - ]: 82 : test.cache.SelfTest(/*sanity_check=*/false);
789 [ + - + - ]: 82 : BOOST_CHECK_EQUAL(GetCoinsMapEntry(test.cache.map()), *expected_coin);
790 : : } else {
791 [ + - - + : 16 : BOOST_CHECK_EXCEPTION(write_coins(), std::logic_error, HasReason(std::get<std::string>(expected)));
- - - - -
+ + - - +
- + + - +
- ]
792 : : }
793 : 90 : }
794 : :
795 [ + - + - : 7 : BOOST_AUTO_TEST_CASE(ccoins_write)
+ - + - -
+ + - + -
+ - + - +
- + - - +
+ - + - +
- + - + -
+ - - + +
- + - + -
+ - + - +
- + - - +
+ - + - +
- + - + -
+ - - + +
- ]
796 : : {
797 : : /* Check BatchWrite behavior, flushing one entry from a child cache to a
798 : : * parent cache, and checking the resulting entry in the parent cache
799 : : * after the write.
800 : : * Parent Child Expected
801 : : */
802 [ + - ]: 1 : CheckWriteCoins(MISSING, MISSING, MISSING );
803 [ + - ]: 1 : CheckWriteCoins(MISSING, SPENT_DIRTY, SPENT_DIRTY );
804 [ + - ]: 1 : CheckWriteCoins(MISSING, SPENT_DIRTY_FRESH, MISSING );
805 [ + - ]: 1 : CheckWriteCoins(MISSING, VALUE2_DIRTY, VALUE2_DIRTY );
806 [ + - ]: 1 : CheckWriteCoins(MISSING, VALUE2_DIRTY_FRESH, VALUE2_DIRTY_FRESH );
807 [ + - ]: 1 : CheckWriteCoins(SPENT_CLEAN, MISSING, SPENT_CLEAN );
808 [ + - ]: 1 : CheckWriteCoins(SPENT_FRESH, MISSING, SPENT_FRESH );
809 [ + - ]: 1 : CheckWriteCoins(SPENT_DIRTY, MISSING, SPENT_DIRTY );
810 [ + - ]: 1 : CheckWriteCoins(SPENT_DIRTY_FRESH, MISSING, SPENT_DIRTY_FRESH );
811 : :
812 [ + - ]: 1 : CheckWriteCoins(SPENT_CLEAN, SPENT_DIRTY, SPENT_DIRTY );
813 [ + - ]: 1 : CheckWriteCoins(SPENT_CLEAN, SPENT_DIRTY_FRESH, SPENT_DIRTY );
814 [ + - ]: 1 : CheckWriteCoins(SPENT_FRESH, SPENT_DIRTY, MISSING );
815 [ + - ]: 1 : CheckWriteCoins(SPENT_FRESH, SPENT_DIRTY_FRESH, MISSING );
816 [ + - ]: 1 : CheckWriteCoins(SPENT_DIRTY, SPENT_DIRTY, SPENT_DIRTY );
817 [ + - ]: 1 : CheckWriteCoins(SPENT_DIRTY, SPENT_DIRTY_FRESH, SPENT_DIRTY );
818 [ + - ]: 1 : CheckWriteCoins(SPENT_DIRTY_FRESH, SPENT_DIRTY, MISSING );
819 [ + - ]: 1 : CheckWriteCoins(SPENT_DIRTY_FRESH, SPENT_DIRTY_FRESH, MISSING );
820 : :
821 [ + - ]: 1 : CheckWriteCoins(SPENT_CLEAN, VALUE2_DIRTY, VALUE2_DIRTY );
822 [ + - ]: 1 : CheckWriteCoins(SPENT_CLEAN, VALUE2_DIRTY_FRESH, VALUE2_DIRTY );
823 [ + - ]: 1 : CheckWriteCoins(SPENT_FRESH, VALUE2_DIRTY, VALUE2_DIRTY_FRESH );
824 [ + - ]: 1 : CheckWriteCoins(SPENT_FRESH, VALUE2_DIRTY_FRESH, VALUE2_DIRTY_FRESH );
825 [ + - ]: 1 : CheckWriteCoins(SPENT_DIRTY, VALUE2_DIRTY, VALUE2_DIRTY );
826 [ + - ]: 1 : CheckWriteCoins(SPENT_DIRTY, VALUE2_DIRTY_FRESH, VALUE2_DIRTY );
827 [ + - ]: 1 : CheckWriteCoins(SPENT_DIRTY_FRESH, VALUE2_DIRTY, VALUE2_DIRTY_FRESH );
828 [ + - ]: 1 : CheckWriteCoins(SPENT_DIRTY_FRESH, VALUE2_DIRTY_FRESH, VALUE2_DIRTY_FRESH );
829 : :
830 [ + - ]: 1 : CheckWriteCoins(VALUE1_CLEAN, MISSING, VALUE1_CLEAN );
831 [ + - ]: 1 : CheckWriteCoins(VALUE1_FRESH, MISSING, VALUE1_FRESH );
832 [ + - ]: 1 : CheckWriteCoins(VALUE1_DIRTY, MISSING, VALUE1_DIRTY );
833 [ + - ]: 1 : CheckWriteCoins(VALUE1_DIRTY_FRESH, MISSING, VALUE1_DIRTY_FRESH );
834 [ + - ]: 1 : CheckWriteCoins(VALUE1_CLEAN, SPENT_DIRTY, SPENT_DIRTY );
835 [ + - ]: 1 : CheckWriteCoins(VALUE1_CLEAN, SPENT_DIRTY_FRESH, EX_FRESH_MISAPPLIED);
836 [ + - ]: 1 : CheckWriteCoins(VALUE1_FRESH, SPENT_DIRTY, MISSING );
837 [ + - ]: 1 : CheckWriteCoins(VALUE1_FRESH, SPENT_DIRTY_FRESH, EX_FRESH_MISAPPLIED);
838 [ + - ]: 1 : CheckWriteCoins(VALUE1_DIRTY, SPENT_DIRTY, SPENT_DIRTY );
839 [ + - ]: 1 : CheckWriteCoins(VALUE1_DIRTY, SPENT_DIRTY_FRESH, EX_FRESH_MISAPPLIED);
840 [ + - ]: 1 : CheckWriteCoins(VALUE1_DIRTY_FRESH, SPENT_DIRTY, MISSING );
841 [ + - ]: 1 : CheckWriteCoins(VALUE1_DIRTY_FRESH, SPENT_DIRTY_FRESH, EX_FRESH_MISAPPLIED);
842 : :
843 [ + - ]: 1 : CheckWriteCoins(VALUE1_CLEAN, VALUE2_DIRTY, VALUE2_DIRTY );
844 [ + - ]: 1 : CheckWriteCoins(VALUE1_CLEAN, VALUE2_DIRTY_FRESH, EX_FRESH_MISAPPLIED);
845 [ + - ]: 1 : CheckWriteCoins(VALUE1_FRESH, VALUE2_DIRTY, VALUE2_DIRTY_FRESH );
846 [ + - ]: 1 : CheckWriteCoins(VALUE1_FRESH, VALUE2_DIRTY_FRESH, EX_FRESH_MISAPPLIED);
847 [ + - ]: 1 : CheckWriteCoins(VALUE1_DIRTY, VALUE2_DIRTY, VALUE2_DIRTY );
848 [ + - ]: 1 : CheckWriteCoins(VALUE1_DIRTY, VALUE2_DIRTY_FRESH, EX_FRESH_MISAPPLIED);
849 [ + - ]: 1 : CheckWriteCoins(VALUE1_DIRTY_FRESH, VALUE2_DIRTY, VALUE2_DIRTY_FRESH );
850 [ + - ]: 1 : CheckWriteCoins(VALUE1_DIRTY_FRESH, VALUE2_DIRTY_FRESH, EX_FRESH_MISAPPLIED);
851 : :
852 : : // The checks above omit cases where the child state is not DIRTY, since
853 : : // they would be too repetitive (the parent cache is never updated in these
854 : : // cases). The loop below covers these cases and makes sure the parent cache
855 : : // is always left unchanged.
856 : 9 : for (const MaybeCoin& parent : {MISSING,
857 : : SPENT_CLEAN, SPENT_DIRTY, SPENT_FRESH, SPENT_DIRTY_FRESH,
858 [ + + ]: 10 : VALUE1_CLEAN, VALUE1_DIRTY, VALUE1_FRESH, VALUE1_DIRTY_FRESH}) {
859 : 99 : for (const MaybeCoin& child : {MISSING,
860 : : SPENT_CLEAN, SPENT_FRESH,
861 [ + + ]: 54 : VALUE2_CLEAN, VALUE2_FRESH}) {
862 [ + - ]: 45 : auto expected{CoinOrError{parent}}; // TODO test failure cases as well
863 [ + - ]: 45 : CheckWriteCoins(parent, child, expected);
864 : 45 : }
865 : : }
866 : 1 : }
867 : :
868 : 2 : struct FlushTest : BasicTestingSetup {
869 : 12 : Coin MakeCoin()
870 : : {
871 : 12 : Coin coin;
872 : 12 : coin.out.nValue = m_rng.rand32();
873 : 12 : coin.nHeight = m_rng.randrange(4096);
874 : 12 : coin.fCoinBase = 0;
875 : 12 : return coin;
876 : : }
877 : :
878 : :
879 : : //! For CCoinsViewCache instances backed by either another cache instance or
880 : : //! leveldb, test cache behavior and flag state (DIRTY/FRESH) by
881 : : //!
882 : : //! 1. Adding a random coin to the child-most cache,
883 : : //! 2. Flushing all caches (without erasing),
884 : : //! 3. Ensure the entry still exists in the cache and has been written to parent,
885 : : //! 4. (if `do_erasing_flush`) Flushing the caches again (with erasing),
886 : : //! 5. (if `do_erasing_flush`) Ensure the entry has been written to the parent and is no longer in the cache,
887 : : //! 6. Spend the coin, ensure it no longer exists in the parent.
888 : : //!
889 : 4 : void TestFlushBehavior(
890 : : CCoinsViewCacheTest* view,
891 : : CCoinsViewDB& base,
892 : : std::vector<std::unique_ptr<CCoinsViewCacheTest>>& all_caches,
893 : : bool do_erasing_flush)
894 : : {
895 : 4 : size_t cache_usage;
896 : 4 : size_t cache_size;
897 : :
898 : 22 : auto flush_all = [this, &all_caches](bool erase) {
899 : : // Flush in reverse order to ensure that flushes happen from children up.
900 [ + + ]: 54 : for (auto i = all_caches.rbegin(); i != all_caches.rend(); ++i) {
901 : 36 : auto& cache = *i;
902 : 36 : cache->SanityCheck();
903 : : // hashBlock must be filled before flushing to disk; value is
904 : : // unimportant here. This is normally done during connect/disconnect block.
905 : 36 : cache->SetBestBlock(m_rng.rand256());
906 [ + + ]: 36 : erase ? cache->Flush() : cache->Sync();
907 : : }
908 : 22 : };
909 : :
910 : 4 : Txid txid = Txid::FromUint256(m_rng.rand256());
911 : 4 : COutPoint outp = COutPoint(txid, 0);
912 : 4 : Coin coin = MakeCoin();
913 : : // Ensure the coins views haven't seen this coin before.
914 [ + - + - : 8 : BOOST_CHECK(!base.HaveCoin(outp));
+ - + - ]
915 [ + - + - : 8 : BOOST_CHECK(!view->HaveCoin(outp));
+ - ]
916 : :
917 : : // --- 1. Adding a random coin to the child cache
918 : : //
919 [ + - ]: 4 : view->AddCoin(outp, Coin(coin), false);
920 : :
921 [ + - ]: 4 : cache_usage = view->DynamicMemoryUsage();
922 [ + - ]: 4 : cache_size = view->map().size();
923 : :
924 : : // `base` shouldn't have coin (no flush yet) but `view` should have cached it.
925 [ + - + - : 8 : BOOST_CHECK(!base.HaveCoin(outp));
+ - + - ]
926 [ + - + - : 8 : BOOST_CHECK(view->HaveCoin(outp));
+ - + - ]
927 : :
928 [ + - + - ]: 4 : BOOST_CHECK_EQUAL(GetCoinsMapEntry(view->map(), outp), CoinEntry(coin.out.nValue, CoinEntry::State::DIRTY_FRESH));
929 : :
930 : : // --- 2. Flushing all caches (without erasing)
931 : : //
932 [ + - ]: 4 : flush_all(/*erase=*/ false);
933 : :
934 : : // CoinsMap usage should be unchanged since we didn't erase anything.
935 [ + - + - : 4 : BOOST_CHECK_EQUAL(cache_usage, view->DynamicMemoryUsage());
+ - ]
936 [ + - + - ]: 4 : BOOST_CHECK_EQUAL(cache_size, view->map().size());
937 : :
938 : : // --- 3. Ensuring the entry still exists in the cache and has been written to parent
939 : : //
940 [ + - + - ]: 4 : BOOST_CHECK_EQUAL(GetCoinsMapEntry(view->map(), outp), CoinEntry(coin.out.nValue, CoinEntry::State::CLEAN)); // State should have been wiped.
941 : :
942 : : // Both views should now have the coin.
943 [ + - + - : 8 : BOOST_CHECK(base.HaveCoin(outp));
+ - + - ]
944 [ + - + - : 8 : BOOST_CHECK(view->HaveCoin(outp));
+ - + + ]
945 : :
946 [ + + ]: 4 : if (do_erasing_flush) {
947 : : // --- 4. Flushing the caches again (with erasing)
948 : : //
949 [ + - ]: 2 : flush_all(/*erase=*/ true);
950 : :
951 : : // Memory does not necessarily go down due to the map using a memory pool
952 [ + - + - : 4 : BOOST_TEST(view->DynamicMemoryUsage() <= cache_usage);
+ - + - +
- ]
953 : : // Size of the cache must go down though
954 [ + - + - : 4 : BOOST_TEST(view->map().size() < cache_size);
+ - + - ]
955 : :
956 : : // --- 5. Ensuring the entry is no longer in the cache
957 : : //
958 [ + - + - : 4 : BOOST_CHECK(!GetCoinsMapEntry(view->map(), outp));
+ - ]
959 [ + - ]: 2 : view->AccessCoin(outp);
960 [ + - + - ]: 2 : BOOST_CHECK_EQUAL(GetCoinsMapEntry(view->map(), outp), CoinEntry(coin.out.nValue, CoinEntry::State::CLEAN));
961 : : }
962 : :
963 : : // Can't overwrite an entry without specifying that an overwrite is
964 : : // expected.
965 [ + - - + : 12 : BOOST_CHECK_THROW(
- - - - -
+ + - +
- ]
966 : : view->AddCoin(outp, Coin(coin), /*possible_overwrite=*/ false),
967 : : std::logic_error);
968 : :
969 : : // --- 6. Spend the coin.
970 : : //
971 [ + - + - : 8 : BOOST_CHECK(view->SpendCoin(outp));
+ - + - ]
972 : :
973 : : // The coin should be in the cache, but spent and marked dirty.
974 [ + - + - ]: 4 : BOOST_CHECK_EQUAL(GetCoinsMapEntry(view->map(), outp), SPENT_DIRTY);
975 [ + - + - : 8 : BOOST_CHECK(!view->HaveCoin(outp)); // Coin should be considered spent in `view`.
+ - + - ]
976 [ + - + - : 8 : BOOST_CHECK(base.HaveCoin(outp)); // But coin should still be unspent in `base`.
+ - + - ]
977 : :
978 [ + - ]: 4 : flush_all(/*erase=*/ false);
979 : :
980 : : // Coin should be considered spent in both views.
981 [ + - + - : 8 : BOOST_CHECK(!view->HaveCoin(outp));
+ - + - ]
982 [ + - + - : 8 : BOOST_CHECK(!base.HaveCoin(outp));
+ - + - ]
983 : :
984 : : // Spent coin should not be spendable.
985 [ + - + - : 8 : BOOST_CHECK(!view->SpendCoin(outp));
+ - ]
986 : :
987 : : // --- Bonus check: ensure that a coin added to the base view via one cache
988 : : // can be spent by another cache which has never seen it.
989 : : //
990 : 4 : txid = Txid::FromUint256(m_rng.rand256());
991 : 4 : outp = COutPoint(txid, 0);
992 : 4 : coin = MakeCoin();
993 [ + - + - : 8 : BOOST_CHECK(!base.HaveCoin(outp));
+ - + - ]
994 [ + - + - : 8 : BOOST_CHECK(!all_caches[0]->HaveCoin(outp));
+ - + - ]
995 [ + - + - : 8 : BOOST_CHECK(!all_caches[1]->HaveCoin(outp));
+ - + - ]
996 : :
997 [ + - ]: 4 : all_caches[0]->AddCoin(outp, std::move(coin), false);
998 [ + - ]: 4 : all_caches[0]->Sync();
999 [ + - + - : 8 : BOOST_CHECK(base.HaveCoin(outp));
+ - + - ]
1000 [ + - + - : 8 : BOOST_CHECK(all_caches[0]->HaveCoin(outp));
+ - + - ]
1001 [ + - + - : 8 : BOOST_CHECK(!all_caches[1]->HaveCoinInCache(outp));
+ - + - ]
1002 : :
1003 [ + - + - : 8 : BOOST_CHECK(all_caches[1]->SpendCoin(outp));
+ - + - ]
1004 [ + - ]: 4 : flush_all(/*erase=*/ false);
1005 [ + - + - : 8 : BOOST_CHECK(!base.HaveCoin(outp));
+ - + - ]
1006 [ + - + - : 8 : BOOST_CHECK(!all_caches[0]->HaveCoin(outp));
+ - + - ]
1007 [ + - + - : 8 : BOOST_CHECK(!all_caches[1]->HaveCoin(outp));
+ - + - ]
1008 : :
1009 [ + - ]: 4 : flush_all(/*erase=*/ true); // Erase all cache content.
1010 : :
1011 : : // --- Bonus check 2: ensure that a FRESH, spent coin is deleted by Sync()
1012 : : //
1013 : 4 : txid = Txid::FromUint256(m_rng.rand256());
1014 : 4 : outp = COutPoint(txid, 0);
1015 : 4 : coin = MakeCoin();
1016 : 4 : CAmount coin_val = coin.out.nValue;
1017 [ + - + - : 8 : BOOST_CHECK(!base.HaveCoin(outp));
+ - + - ]
1018 [ + - + - : 8 : BOOST_CHECK(!all_caches[0]->HaveCoin(outp));
+ - + - ]
1019 [ + - + - : 8 : BOOST_CHECK(!all_caches[1]->HaveCoin(outp));
+ - + - ]
1020 : :
1021 : : // Add and spend from same cache without flushing.
1022 [ + - ]: 4 : all_caches[0]->AddCoin(outp, std::move(coin), false);
1023 : :
1024 : : // Coin should be FRESH in the cache.
1025 [ + - + - ]: 4 : BOOST_CHECK_EQUAL(GetCoinsMapEntry(all_caches[0]->map(), outp), CoinEntry(coin_val, CoinEntry::State::DIRTY_FRESH));
1026 : : // Base shouldn't have seen coin.
1027 [ + - + - : 8 : BOOST_CHECK(!base.HaveCoin(outp));
+ - + - ]
1028 : :
1029 [ + - + - : 8 : BOOST_CHECK(all_caches[0]->SpendCoin(outp));
+ - + - ]
1030 [ + - ]: 4 : all_caches[0]->Sync();
1031 : :
1032 : : // Ensure there is no sign of the coin after spend/flush.
1033 [ + - + - : 8 : BOOST_CHECK(!GetCoinsMapEntry(all_caches[0]->map(), outp));
+ - ]
1034 [ + - + - : 8 : BOOST_CHECK(!all_caches[0]->HaveCoinInCache(outp));
+ - + - ]
1035 [ + - + - : 8 : BOOST_CHECK(!base.HaveCoin(outp));
+ - ]
1036 : 4 : }
1037 : : }; // struct FlushTest
1038 : :
1039 [ + - + - : 7 : BOOST_FIXTURE_TEST_CASE(ccoins_flush_behavior, FlushTest)
+ - + - -
+ + - + -
+ - + - +
- + - - +
+ - + - +
- + - + -
+ - - + +
- + - + -
+ - + - +
- + - - +
+ - + - +
- + - + -
+ - - + +
- ]
1040 : : {
1041 : : // Create two in-memory caches atop a leveldb view.
1042 : 0 : CCoinsViewDB base{{.path = "test", .cache_bytes = 1 << 23, .memory_only = true}, {}};
1043 : 1 : std::vector<std::unique_ptr<CCoinsViewCacheTest>> caches;
1044 [ + - ]: 2 : caches.push_back(std::make_unique<CCoinsViewCacheTest>(&base));
1045 [ + - ]: 2 : caches.push_back(std::make_unique<CCoinsViewCacheTest>(caches.back().get()));
1046 : :
1047 [ + + ]: 3 : for (const auto& view : caches) {
1048 [ + - ]: 2 : TestFlushBehavior(view.get(), base, caches, /*do_erasing_flush=*/false);
1049 [ + - ]: 2 : TestFlushBehavior(view.get(), base, caches, /*do_erasing_flush=*/true);
1050 : : }
1051 [ + - ]: 2 : }
1052 : :
1053 [ + - + - : 7 : BOOST_AUTO_TEST_CASE(coins_resource_is_used)
+ - + - -
+ + - + -
+ - + - +
- + - - +
+ - + - +
- + - + -
+ - - + +
- + - + -
+ - + - +
- + - - +
+ - + - +
- + - + -
+ - - + +
- ]
1054 : : {
1055 : 1 : CCoinsMapMemoryResource resource;
1056 [ + - ]: 1 : PoolResourceTester::CheckAllDataAccountedFor(resource);
1057 : :
1058 : 1 : {
1059 [ + - + - ]: 1 : CCoinsMap map{0, CCoinsMap::hasher{}, CCoinsMap::key_equal{}, &resource};
1060 [ + - + - : 2 : BOOST_TEST(memusage::DynamicUsage(map) >= resource.ChunkSizeBytes());
+ - + - ]
1061 : :
1062 [ + - ]: 1 : map.reserve(1000);
1063 : :
1064 : : // The resource has preallocated a chunk, so we should have space for at several nodes without the need to allocate anything else.
1065 : 1 : const auto usage_before = memusage::DynamicUsage(map);
1066 : :
1067 : 1 : COutPoint out_point{};
1068 [ + + ]: 1001 : for (size_t i = 0; i < 1000; ++i) {
1069 : 1000 : out_point.n = i;
1070 [ + - ]: 1000 : map[out_point];
1071 : : }
1072 [ + - + - : 2 : BOOST_TEST(usage_before == memusage::DynamicUsage(map));
+ - ]
1073 : 0 : }
1074 : :
1075 [ + - ]: 1 : PoolResourceTester::CheckAllDataAccountedFor(resource);
1076 : 1 : }
1077 : :
1078 [ + - + - : 7 : BOOST_AUTO_TEST_CASE(ccoins_addcoin_exception_keeps_usage_balanced)
+ - + - -
+ + - + -
+ - + - +
- + - - +
+ - + - +
- + - + -
+ - - + +
- + - + -
+ - + - +
- + - - +
+ - + - +
- + - + -
+ - - + +
- ]
1079 : : {
1080 : 1 : CCoinsView root;
1081 [ + - ]: 1 : CCoinsViewCacheTest cache{&root};
1082 : :
1083 : 1 : const COutPoint outpoint{Txid::FromUint256(m_rng.rand256()), m_rng.rand32()};
1084 : :
1085 [ - + + - ]: 1 : const Coin coin1{CTxOut{m_rng.randrange(10), CScript{} << m_rng.randbytes(CScriptBase::STATIC_SIZE + 1)}, 1, false};
1086 [ + - ]: 1 : cache.AddCoin(outpoint, Coin{coin1}, /*possible_overwrite=*/false);
1087 [ + - ]: 1 : cache.SelfTest();
1088 : :
1089 [ - + + - ]: 1 : const Coin coin2{CTxOut{m_rng.randrange(20), CScript{} << m_rng.randbytes(CScriptBase::STATIC_SIZE + 2)}, 2, false};
1090 [ + - - + : 3 : BOOST_CHECK_THROW(cache.AddCoin(outpoint, Coin{coin2}, /*possible_overwrite=*/false), std::logic_error);
- - - - -
+ + - +
- ]
1091 [ + - ]: 1 : cache.SelfTest();
1092 : :
1093 [ + - + - : 2 : BOOST_CHECK(cache.AccessCoin(outpoint) == coin1);
+ - ]
1094 : 1 : }
1095 : :
1096 [ + - + - : 7 : BOOST_AUTO_TEST_CASE(ccoins_emplace_duplicate_keeps_usage_balanced)
+ - + - -
+ + - + -
+ - + - +
- + - - +
+ - + - +
- + - + -
+ - - + +
- + - + -
+ - + - +
- + - - +
+ - + - +
- + - + -
+ - - + +
- ]
1097 : : {
1098 : 1 : CCoinsView root;
1099 [ + - ]: 1 : CCoinsViewCacheTest cache{&root};
1100 : :
1101 : 1 : const COutPoint outpoint{Txid::FromUint256(m_rng.rand256()), m_rng.rand32()};
1102 : :
1103 [ - + + - ]: 1 : const Coin coin1{CTxOut{m_rng.randrange(10), CScript{} << m_rng.randbytes(CScriptBase::STATIC_SIZE + 1)}, 1, false};
1104 [ + - ]: 1 : cache.EmplaceCoinInternalDANGER(COutPoint{outpoint}, Coin{coin1});
1105 [ + - ]: 1 : cache.SelfTest();
1106 : :
1107 [ - + + - ]: 1 : const Coin coin2{CTxOut{m_rng.randrange(20), CScript{} << m_rng.randbytes(CScriptBase::STATIC_SIZE + 2)}, 2, false};
1108 [ + - ]: 1 : cache.EmplaceCoinInternalDANGER(COutPoint{outpoint}, Coin{coin2});
1109 [ + - ]: 1 : cache.SelfTest();
1110 : :
1111 [ + - + - : 2 : BOOST_CHECK(cache.AccessCoin(outpoint) == coin1);
+ - ]
1112 : 1 : }
1113 : :
1114 [ + - + - : 7 : BOOST_AUTO_TEST_CASE(ccoins_reset_guard)
+ - + - -
+ + - + -
+ - + - +
- + - - +
+ - + - +
- + - + -
+ - - + +
- + - + -
+ - + - +
- + - - +
+ - + - +
- + - + -
+ - - + +
- ]
1115 : : {
1116 [ + - ]: 1 : CCoinsViewTest root{m_rng};
1117 [ + - ]: 1 : CCoinsViewCache root_cache{&root};
1118 : 1 : uint256 base_best_block{m_rng.rand256()};
1119 [ + - ]: 1 : root_cache.SetBestBlock(base_best_block);
1120 [ + - ]: 1 : root_cache.Flush();
1121 : :
1122 [ + - ]: 1 : CCoinsViewCache cache{&root};
1123 : :
1124 : 1 : const COutPoint outpoint{Txid::FromUint256(m_rng.rand256()), m_rng.rand32()};
1125 : :
1126 [ - + + - ]: 1 : const Coin coin{CTxOut{m_rng.randrange(10), CScript{} << m_rng.randbytes(CScriptBase::STATIC_SIZE + 1)}, 1, false};
1127 [ + - ]: 1 : cache.EmplaceCoinInternalDANGER(COutPoint{outpoint}, Coin{coin});
1128 : :
1129 : 1 : uint256 cache_best_block{m_rng.rand256()};
1130 [ + - ]: 1 : cache.SetBestBlock(cache_best_block);
1131 : :
1132 : 1 : {
1133 [ + - ]: 1 : const auto reset_guard{cache.CreateResetGuard()};
1134 [ + - + - : 2 : BOOST_CHECK(cache.AccessCoin(outpoint) == coin);
+ - + - ]
1135 [ + - + - : 2 : BOOST_CHECK(!cache.AccessCoin(outpoint).IsSpent());
+ - + - ]
1136 [ + - + - : 1 : BOOST_CHECK_EQUAL(cache.GetCacheSize(), 1);
+ - ]
1137 [ + - + - : 1 : BOOST_CHECK_EQUAL(cache.GetBestBlock(), cache_best_block);
+ - ]
1138 [ + - + - : 2 : BOOST_CHECK(!root_cache.HaveCoinInCache(outpoint));
+ - ]
1139 : 0 : }
1140 : :
1141 [ + - + - : 2 : BOOST_CHECK(cache.AccessCoin(outpoint).IsSpent());
+ - + - ]
1142 [ + - + - : 1 : BOOST_CHECK_EQUAL(cache.GetCacheSize(), 0);
+ - ]
1143 [ + - + - : 1 : BOOST_CHECK_EQUAL(cache.GetBestBlock(), base_best_block);
+ - ]
1144 [ + - + - : 2 : BOOST_CHECK(!root_cache.HaveCoinInCache(outpoint));
+ - ]
1145 : :
1146 : : // Using a reset guard again is idempotent
1147 : 1 : {
1148 : 1 : const auto reset_guard{cache.CreateResetGuard()};
1149 : 1 : }
1150 : :
1151 [ + - + - : 2 : BOOST_CHECK(cache.AccessCoin(outpoint).IsSpent());
+ - + - ]
1152 [ + - + - : 1 : BOOST_CHECK_EQUAL(cache.GetCacheSize(), 0);
+ - ]
1153 [ + - + - : 1 : BOOST_CHECK_EQUAL(cache.GetBestBlock(), base_best_block);
+ - ]
1154 [ + - + - : 2 : BOOST_CHECK(!root_cache.HaveCoinInCache(outpoint));
+ - ]
1155 : 1 : }
1156 : :
1157 : : BOOST_AUTO_TEST_SUITE_END()
|
