Bitcoin
Classes | Functions
memusage Namespace Reference

Classes

struct  stl_shared_counter
 
struct  stl_tree_node
 
struct  unordered_node
 

Functions

static size_t MallocUsage (size_t alloc)
 
static size_t DynamicUsage (const int8_t &v)
 
static size_t DynamicUsage (const uint8_t &v)
 
static size_t DynamicUsage (const int16_t &v)
 
static size_t DynamicUsage (const uint16_t &v)
 
static size_t DynamicUsage (const int32_t &v)
 
static size_t DynamicUsage (const uint32_t &v)
 
static size_t DynamicUsage (const int64_t &v)
 
static size_t DynamicUsage (const uint64_t &v)
 
static size_t DynamicUsage (const float &v)
 
static size_t DynamicUsage (const double &v)
 
template<typename X >
static size_t DynamicUsage (X *const &v)
 
template<typename X >
static size_t DynamicUsage (const X *const &v)
 
template<typename X >
static size_t DynamicUsage (const std::vector< X > &v)
 
template<unsigned int N, typename X , typename S , typename D >
static size_t DynamicUsage (const prevector< N, X, S, D > &v)
 
template<typename X , typename Y >
static size_t DynamicUsage (const std::set< X, Y > &s)
 
template<typename X , typename Y >
static size_t IncrementalDynamicUsage (const std::set< X, Y > &s)
 
template<typename X , typename Y , typename Z >
static size_t DynamicUsage (const std::map< X, Y, Z > &m)
 
template<typename X , typename Y , typename Z >
static size_t IncrementalDynamicUsage (const std::map< X, Y, Z > &m)
 
template<typename X , typename Y >
static size_t DynamicUsage (const indirectmap< X, Y > &m)
 
template<typename X , typename Y >
static size_t IncrementalDynamicUsage (const indirectmap< X, Y > &m)
 
template<typename X >
static size_t DynamicUsage (const std::unique_ptr< X > &p)
 
template<typename X >
static size_t DynamicUsage (const std::shared_ptr< X > &p)
 
template<typename X , typename Y >
static size_t DynamicUsage (const std::unordered_set< X, Y > &s)
 
template<typename X , typename Y , typename Z >
static size_t DynamicUsage (const std::unordered_map< X, Y, Z > &m)
 

Function Documentation

◆ DynamicUsage() [1/21]

static size_t memusage::DynamicUsage ( const int8_t v)
inlinestatic

Dynamic memory usage for built-in types is zero.

◆ DynamicUsage() [2/21]

static size_t memusage::DynamicUsage ( const uint8_t v)
inlinestatic

◆ DynamicUsage() [3/21]

static size_t memusage::DynamicUsage ( const int16_t v)
inlinestatic

◆ DynamicUsage() [4/21]

static size_t memusage::DynamicUsage ( const uint16_t v)
inlinestatic

◆ DynamicUsage() [5/21]

static size_t memusage::DynamicUsage ( const int32_t v)
inlinestatic

◆ DynamicUsage() [6/21]

static size_t memusage::DynamicUsage ( const uint32_t v)
inlinestatic

◆ DynamicUsage() [7/21]

static size_t memusage::DynamicUsage ( const int64_t v)
inlinestatic

◆ DynamicUsage() [8/21]

static size_t memusage::DynamicUsage ( const uint64_t v)
inlinestatic

◆ DynamicUsage() [9/21]

static size_t memusage::DynamicUsage ( const float &  v)
inlinestatic

◆ DynamicUsage() [10/21]

static size_t memusage::DynamicUsage ( const double &  v)
inlinestatic

◆ DynamicUsage() [11/21]

template<typename X >
static size_t memusage::DynamicUsage ( X *const &  v)
inlinestatic

◆ DynamicUsage() [12/21]

template<typename X >
static size_t memusage::DynamicUsage ( const X *const &  v)
inlinestatic

◆ DynamicUsage() [13/21]

template<typename X >
static size_t memusage::DynamicUsage ( const std::vector< X > &  v)
inlinestatic

◆ DynamicUsage() [14/21]

template<unsigned int N, typename X , typename S , typename D >
static size_t memusage::DynamicUsage ( const prevector< N, X, S, D > &  v)
inlinestatic

◆ DynamicUsage() [15/21]

template<typename X , typename Y >
static size_t memusage::DynamicUsage ( const std::set< X, Y > &  s)
inlinestatic

◆ DynamicUsage() [16/21]

template<typename X , typename Y , typename Z >
static size_t memusage::DynamicUsage ( const std::map< X, Y, Z > &  m)
inlinestatic

◆ DynamicUsage() [17/21]

template<typename X , typename Y >
static size_t memusage::DynamicUsage ( const indirectmap< X, Y > &  m)
inlinestatic

◆ DynamicUsage() [18/21]

template<typename X >
static size_t memusage::DynamicUsage ( const std::unique_ptr< X > &  p)
inlinestatic

◆ DynamicUsage() [19/21]

template<typename X >
static size_t memusage::DynamicUsage ( const std::shared_ptr< X > &  p)
inlinestatic

◆ DynamicUsage() [20/21]

template<typename X , typename Y >
static size_t memusage::DynamicUsage ( const std::unordered_set< X, Y > &  s)
inlinestatic

◆ DynamicUsage() [21/21]

template<typename X , typename Y , typename Z >
static size_t memusage::DynamicUsage ( const std::unordered_map< X, Y, Z > &  m)
inlinestatic

◆ IncrementalDynamicUsage() [1/3]

template<typename X , typename Y >
static size_t memusage::IncrementalDynamicUsage ( const std::set< X, Y > &  s)
inlinestatic

◆ IncrementalDynamicUsage() [2/3]

template<typename X , typename Y , typename Z >
static size_t memusage::IncrementalDynamicUsage ( const std::map< X, Y, Z > &  m)
inlinestatic

◆ IncrementalDynamicUsage() [3/3]

template<typename X , typename Y >
static size_t memusage::IncrementalDynamicUsage ( const indirectmap< X, Y > &  m)
inlinestatic

◆ MallocUsage()

static size_t memusage::MallocUsage ( size_t  alloc)
inlinestatic

Compute the total memory used by allocating alloc bytes.

Compute the memory used for dynamically allocated but owned data structures. For generic data types, this is not recursive. DynamicUsage(vector<vector<int> >) will compute the memory used for the vector<int>'s, but not for the ints inside. This is for efficiency reasons, as these functions are intended to be fast. If application data structures require more accurate inner accounting, they should iterate themselves, or use more efficient caching + updating on modification.