You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
82 lines
3.0 KiB
82 lines
3.0 KiB
// 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 CScriptBase*>(&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 CScriptWitness& scriptWit) { |
|
size_t mem = memusage::DynamicUsage(scriptWit.stack); |
|
for (std::vector<std::vector<unsigned char> >::const_iterator it = scriptWit.stack.begin(); it != scriptWit.stack.end(); it++) { |
|
mem += memusage::DynamicUsage(*it); |
|
} |
|
return mem; |
|
} |
|
|
|
static inline size_t RecursiveDynamicUsage(const CTxInWitness& txinwit) { |
|
return RecursiveDynamicUsage(txinwit.scriptWitness); |
|
} |
|
|
|
static inline size_t RecursiveDynamicUsage(const CTxWitness& txwit) { |
|
size_t mem = memusage::DynamicUsage(txwit.vtxinwit); |
|
for (std::vector<CTxInWitness>::const_iterator it = txwit.vtxinwit.begin(); it != txwit.vtxinwit.end(); it++) { |
|
mem += RecursiveDynamicUsage(*it); |
|
} |
|
return mem; |
|
} |
|
|
|
static inline size_t RecursiveDynamicUsage(const CTransaction& tx) { |
|
size_t mem = memusage::DynamicUsage(tx.vin) + memusage::DynamicUsage(tx.vout) + RecursiveDynamicUsage(tx.wit); |
|
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) + RecursiveDynamicUsage(tx.wit); |
|
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
|
|
|