bitcoin-mem 0.1.19

traits for tracking dynamic and recursive memory usage
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148

// ---------------- [ File: bitcoin-mem/src/dynamic_usage.rs ]
crate::ix!();

pub trait DynamicUsage {
    fn dynamic_usage(&self) -> usize;
}

impl DynamicUsage for i8  { #[inline] fn dynamic_usage(&self) -> usize { trace!("DynamicUsage<i8>"); 0 } }
impl DynamicUsage for u8  { #[inline] fn dynamic_usage(&self) -> usize { trace!("DynamicUsage<u8>"); 0 } }
impl DynamicUsage for i16 { #[inline] fn dynamic_usage(&self) -> usize { trace!("DynamicUsage<i16>"); 0 } }
impl DynamicUsage for u16 { #[inline] fn dynamic_usage(&self) -> usize { trace!("DynamicUsage<u16>"); 0 } }
impl DynamicUsage for i32 { #[inline] fn dynamic_usage(&self) -> usize { trace!("DynamicUsage<i32>"); 0 } }
impl DynamicUsage for u32 { #[inline] fn dynamic_usage(&self) -> usize { trace!("DynamicUsage<u32>"); 0 } }
impl DynamicUsage for i64 { #[inline] fn dynamic_usage(&self) -> usize { trace!("DynamicUsage<i64>"); 0 } }
impl DynamicUsage for u64 { #[inline] fn dynamic_usage(&self) -> usize { trace!("DynamicUsage<u64>"); 0 } }
impl DynamicUsage for f32 { #[inline] fn dynamic_usage(&self) -> usize { trace!("DynamicUsage<f32>"); 0 } }
impl DynamicUsage for f64 { #[inline] fn dynamic_usage(&self) -> usize { trace!("DynamicUsage<f64>"); 0 } }

impl<X> DynamicUsage for *mut X  { #[inline] fn dynamic_usage(&self) -> usize { trace!("DynamicUsage<*mut _>"); 0 } }
impl<X> DynamicUsage for *const X { #[inline] fn dynamic_usage(&self) -> usize { trace!("DynamicUsage<*const _>"); 0 } }

impl<X> DynamicUsage for Vec<X> {
    #[inline]
    fn dynamic_usage(&self) -> usize {
        let bytes = self.capacity() * core::mem::size_of::<X>();
        trace!(
            "DynamicUsage<Vec<{}>> capacity={} bytes={}",
            core::any::type_name::<X>(),
            self.capacity(),
            bytes
        );
        malloc_usage(bytes)
    }
}

impl<T: Default, const N: usize> DynamicUsage for PreVector<T, N> {
    #[inline]
    fn dynamic_usage(&self) -> usize {
        // ❶ `PreVector` keeps up to `N` elements inline; anything beyond that is heap‑allocated.
        let inline_cap = N;
        let heap_cap   = self.capacity();

        if heap_cap <= inline_cap {
            trace!(
                "DynamicUsage<PreVector<{}, {}>> inline_cap={} ‑‑ no heap allocation",
                core::any::type_name::<T>(),
                N,
                inline_cap
            );
            0
        } else {
            let bytes = heap_cap * core::mem::size_of::<T>();
            trace!(
                "DynamicUsage<PreVector<{}, {}>> heap_cap={} elem_size={} bytes={}",
                core::any::type_name::<T>(),
                N,
                heap_cap,
                core::mem::size_of::<T>(),
                bytes
            );
            malloc_usage(bytes)
        }
    }
}

impl<T, S> DynamicUsage for HashSet<T, S>
where
    S: BuildHasher,
{
    #[inline]
    fn dynamic_usage(&self) -> usize {
        let node_sz = core::mem::size_of::<StlTreeNode<T>>();
        let bytes   = self.len() * node_sz;
        trace!(
            "DynamicUsage<HashSet<{}>> len={} node_sz={} bytes={}",
            core::any::type_name::<T>(),
            self.len(),
            node_sz,
            bytes
        );
        malloc_usage(bytes)
    }
}

// ---- HashMap<K, V, S> -------------------------------------------------------

impl<K, V, S> DynamicUsage for HashMap<K, V, S>
where
    S: BuildHasher,
{
    #[inline]
    fn dynamic_usage(&self) -> usize {
        let node_sz = core::mem::size_of::<StlTreeNode<(K, V)>>();
        let bytes   = self.len() * node_sz;
        trace!(
            "DynamicUsage<HashMap<{}, {}>> len={} node_sz={} bytes={}",
            core::any::type_name::<K>(),
            core::any::type_name::<V>(),
            self.len(),
            node_sz,
            bytes
        );
        malloc_usage(bytes)
    }
}

impl<X> DynamicUsage for Box<X> {
    #[inline]
    fn dynamic_usage(&self) -> usize {
        let bytes = core::mem::size_of::<X>();
        trace!("DynamicUsage<Box<{}>> bytes={}", core::any::type_name::<X>(), bytes);
        malloc_usage(bytes)
    }
}

impl<X> DynamicUsage for Arc<X> {
    #[inline]
    fn dynamic_usage(&self) -> usize {
        // Arc allocates a single block containing a header (2×usize) and the payload.
        let header_bytes = 2 * core::mem::size_of::<usize>();
        let total = header_bytes + core::mem::size_of::<X>();
        trace!(
            "DynamicUsage<Arc<{}>> header={} payload={} total={}",
            core::any::type_name::<X>(),
            header_bytes,
            core::mem::size_of::<X>(),
            total
        );
        malloc_usage(total)
    }
}

// -----------------------------------------------------------------------------
// COMPLETELY NEW impl: DynamicUsage for `Option<T>`
// (an `Option` itself never allocates).
// -----------------------------------------------------------------------------
impl<T> DynamicUsage for Option<T> {
    #[inline]
    fn dynamic_usage(&self) -> usize {
        trace!("DynamicUsage<Option<{}>> -> 0", core::any::type_name::<T>());
        0
    }
}

pub struct UnorderedNode<X> {
    base: X,
    ptr:  *mut c_void,
}