mirror of
https://github.com/dashpay/dash.git
synced 2024-12-27 04:52:59 +01:00
391dff16fe
Assume that when a wallet transaction has a valid block hash and transaction position in it, the transaction is actually there. We're already trusting wallet data in a much more fundamental way anyway. To prevent backward compatibility issues, a new record is used for storing the block locator in the wallet. Old wallets will see a wallet file synchronized up to the genesis block, and rescan automatically.
63 lines
2.2 KiB
C++
63 lines
2.2 KiB
C++
// Copyright (c) 2015 The Bitcoin Core developers
|
|
// Distributed under the MIT software license, see the accompanying
|
|
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
|
|
|
|
#ifndef BITCOIN_CORE_MEMUSAGE_H
|
|
#define BITCOIN_CORE_MEMUSAGE_H
|
|
|
|
#include "primitives/transaction.h"
|
|
#include "primitives/block.h"
|
|
#include "memusage.h"
|
|
|
|
static inline size_t RecursiveDynamicUsage(const CScript& script) {
|
|
return memusage::DynamicUsage(*static_cast<const std::vector<unsigned char>*>(&script));
|
|
}
|
|
|
|
static inline size_t RecursiveDynamicUsage(const COutPoint& out) {
|
|
return 0;
|
|
}
|
|
|
|
static inline size_t RecursiveDynamicUsage(const CTxIn& in) {
|
|
return RecursiveDynamicUsage(in.scriptSig) + RecursiveDynamicUsage(in.prevout);
|
|
}
|
|
|
|
static inline size_t RecursiveDynamicUsage(const CTxOut& out) {
|
|
return RecursiveDynamicUsage(out.scriptPubKey);
|
|
}
|
|
|
|
static inline size_t RecursiveDynamicUsage(const CTransaction& tx) {
|
|
size_t mem = memusage::DynamicUsage(tx.vin) + memusage::DynamicUsage(tx.vout);
|
|
for (std::vector<CTxIn>::const_iterator it = tx.vin.begin(); it != tx.vin.end(); it++) {
|
|
mem += RecursiveDynamicUsage(*it);
|
|
}
|
|
for (std::vector<CTxOut>::const_iterator it = tx.vout.begin(); it != tx.vout.end(); it++) {
|
|
mem += RecursiveDynamicUsage(*it);
|
|
}
|
|
return mem;
|
|
}
|
|
|
|
static inline size_t RecursiveDynamicUsage(const CMutableTransaction& tx) {
|
|
size_t mem = memusage::DynamicUsage(tx.vin) + memusage::DynamicUsage(tx.vout);
|
|
for (std::vector<CTxIn>::const_iterator it = tx.vin.begin(); it != tx.vin.end(); it++) {
|
|
mem += RecursiveDynamicUsage(*it);
|
|
}
|
|
for (std::vector<CTxOut>::const_iterator it = tx.vout.begin(); it != tx.vout.end(); it++) {
|
|
mem += RecursiveDynamicUsage(*it);
|
|
}
|
|
return mem;
|
|
}
|
|
|
|
static inline size_t RecursiveDynamicUsage(const CBlock& block) {
|
|
size_t mem = memusage::DynamicUsage(block.vtx);
|
|
for (std::vector<CTransaction>::const_iterator it = block.vtx.begin(); it != block.vtx.end(); it++) {
|
|
mem += RecursiveDynamicUsage(*it);
|
|
}
|
|
return mem;
|
|
}
|
|
|
|
static inline size_t RecursiveDynamicUsage(const CBlockLocator& locator) {
|
|
return memusage::DynamicUsage(locator.vHave);
|
|
}
|
|
|
|
#endif // BITCOIN_CORE_MEMUSAGE_H
|