be16f80abc
Any projects which want to use Hush code from now on will need to be licensed as GPLv3 or we will send the lawyers: https://www.softwarefreedom.org/ Notably, Komodo (KMD) is licensed as GPLv2 and is no longer compatible to receive code changes, without causing legal issues. MIT projects, such as Zcash, also cannot pull in changes from the Hush Full Node without permission from The Hush Developers, which may in some circumstances grant an MIT license on a case-by-case basis.
63 lines
2.2 KiB
C++
63 lines
2.2 KiB
C++
// Copyright (c) 2015 The Bitcoin Core developers
|
|
// Distributed under the GPLv3 software license, see the accompanying
|
|
// file COPYING or https://www.gnu.org/licenses/gpl-3.0.en.html
|
|
|
|
#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 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) + memusage::DynamicUsage(block.vMerkleTree);
|
|
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
|