Bitcoin ABC 0.30.7
P2P Digital Currency
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)
 Compute the total memory used by allocating alloc bytes. More...
 
static size_t DynamicUsage (const int8_t &v)
 Dynamic memory usage for built-in types is zero. More...
 
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)
 
template<class Key , class T , class Hash , class Pred , std::size_t MAX_BLOCK_SIZE_BYTES, std::size_t ALIGN_BYTES>
static size_t DynamicUsage (const std::unordered_map< Key, T, Hash, Pred, PoolAllocator< std::pair< const Key, T >, MAX_BLOCK_SIZE_BYTES, ALIGN_BYTES > > &m)
 

Function Documentation

◆ DynamicUsage() [1/22]

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

Definition at line 54 of file memusage.h.

◆ DynamicUsage() [2/22]

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

Definition at line 51 of file memusage.h.

◆ DynamicUsage() [3/22]

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

Definition at line 140 of file memusage.h.

Here is the call graph for this function:

◆ DynamicUsage() [4/22]

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

Definition at line 33 of file memusage.h.

◆ DynamicUsage() [5/22]

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

Definition at line 39 of file memusage.h.

◆ DynamicUsage() [6/22]

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

Definition at line 45 of file memusage.h.

◆ DynamicUsage() [7/22]

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

Dynamic memory usage for built-in types is zero.

Definition at line 27 of file memusage.h.

Here is the caller graph for this function:

◆ DynamicUsage() [8/22]

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

Definition at line 113 of file memusage.h.

Here is the call graph for this function:

◆ DynamicUsage() [9/22]

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

Definition at line 128 of file memusage.h.

Here is the call graph for this function:

◆ DynamicUsage() [10/22]

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

Definition at line 118 of file memusage.h.

Here is the call graph for this function:

◆ DynamicUsage() [11/22]

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

Definition at line 156 of file memusage.h.

Here is the call graph for this function:

◆ DynamicUsage() [12/22]

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

Definition at line 151 of file memusage.h.

Here is the call graph for this function:

◆ DynamicUsage() [13/22]

template<class Key , class T , class Hash , class Pred , std::size_t MAX_BLOCK_SIZE_BYTES, std::size_t ALIGN_BYTES>
static size_t memusage::DynamicUsage ( const std::unordered_map< Key, T, Hash, Pred, PoolAllocator< std::pair< const Key, T >, MAX_BLOCK_SIZE_BYTES, ALIGN_BYTES > > &  m)
inlinestatic

Definition at line 186 of file memusage.h.

Here is the call graph for this function:

◆ DynamicUsage() [14/22]

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

Definition at line 178 of file memusage.h.

Here is the call graph for this function:

◆ DynamicUsage() [15/22]

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

Definition at line 172 of file memusage.h.

Here is the call graph for this function:

◆ DynamicUsage() [16/22]

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

Definition at line 108 of file memusage.h.

Here is the call graph for this function:

◆ DynamicUsage() [17/22]

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

Definition at line 36 of file memusage.h.

◆ DynamicUsage() [18/22]

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

Definition at line 42 of file memusage.h.

◆ DynamicUsage() [19/22]

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

Definition at line 48 of file memusage.h.

◆ DynamicUsage() [20/22]

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

Definition at line 30 of file memusage.h.

◆ DynamicUsage() [21/22]

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

Definition at line 60 of file memusage.h.

◆ DynamicUsage() [22/22]

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

Definition at line 57 of file memusage.h.

◆ IncrementalDynamicUsage() [1/3]

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

Definition at line 146 of file memusage.h.

Here is the call graph for this function:

◆ IncrementalDynamicUsage() [2/3]

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

Definition at line 133 of file memusage.h.

Here is the call graph for this function:

◆ IncrementalDynamicUsage() [3/3]

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

Definition at line 123 of file memusage.h.

Here is the call graph for this function:
Here is the caller graph for this function:

◆ 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.

Definition at line 73 of file memusage.h.

Here is the call graph for this function:
Here is the caller graph for this function: