memory.hpp

Go to the documentation of this file.

// SPDX-License-Identifier: Apache-2.0
// Copyright 2026 Chris Leishman
 
#pragma once
 
#include <idfxx/error.hpp>
#include <idfxx/flags.hpp>
 
#include <cstddef>
#include <cstdint>
#include <esp_heap_caps.h>
#include <limits>
#include <type_traits>
 
namespace idfxx {
 
enum class memory_caps : uint32_t {
    exec = MALLOC_CAP_EXEC,                   
    access_32bit = MALLOC_CAP_32BIT,          
    access_8bit = MALLOC_CAP_8BIT,            
    dma = MALLOC_CAP_DMA,                     
    spiram = MALLOC_CAP_SPIRAM,               
    internal = MALLOC_CAP_INTERNAL,           
    default_heap = MALLOC_CAP_DEFAULT,        
    iram = MALLOC_CAP_IRAM_8BIT,              
    retention = MALLOC_CAP_RETENTION,         
    rtc = MALLOC_CAP_RTCRAM,                  
    dma_desc_ahb = MALLOC_CAP_DMA_DESC_AHB,   
    dma_desc_axi = MALLOC_CAP_DMA_DESC_AXI,   
    cache_aligned = MALLOC_CAP_CACHE_ALIGNED, 
 
    dram = internal | access_8bit, 
};
 
template<>
inline constexpr bool enable_flags_operators<memory_caps> = true;
 
struct heap_info {
    size_t total_free_bytes;      
    size_t total_allocated_bytes; 
    size_t largest_free_block;    
    size_t minimum_free_bytes;    
    size_t allocated_blocks;      
    size_t free_blocks;           
    size_t total_blocks;          
};
 
[[nodiscard]] inline size_t heap_total_size(flags<memory_caps> caps) noexcept {
    return heap_caps_get_total_size(to_underlying(caps));
}
 
[[nodiscard]] inline size_t heap_free_size(flags<memory_caps> caps) noexcept {
    return heap_caps_get_free_size(to_underlying(caps));
}
 
[[nodiscard]] inline size_t heap_largest_free_block(flags<memory_caps> caps) noexcept {
    return heap_caps_get_largest_free_block(to_underlying(caps));
}
 
[[nodiscard]] inline size_t heap_minimum_free_size(flags<memory_caps> caps) noexcept {
    return heap_caps_get_minimum_free_size(to_underlying(caps));
}
 
[[nodiscard]] inline heap_info get_heap_info(flags<memory_caps> caps) noexcept {
    multi_heap_info_t info{};
    heap_caps_get_info(&info, to_underlying(caps));
    return {
        .total_free_bytes = info.total_free_bytes,
        .total_allocated_bytes = info.total_allocated_bytes,
        .largest_free_block = info.largest_free_block,
        .minimum_free_bytes = info.minimum_free_bytes,
        .allocated_blocks = info.allocated_blocks,
        .free_blocks = info.free_blocks,
        .total_blocks = info.total_blocks,
    };
}
 
// ---- Heap allocation --------------------------------------------------------
 
[[nodiscard]] inline void* heap_malloc(size_t size, flags<memory_caps> caps) noexcept {
    return heap_caps_malloc(size, to_underlying(caps));
}
 
[[nodiscard]] inline void* heap_calloc(size_t n, size_t size, flags<memory_caps> caps) noexcept {
    return heap_caps_calloc(n, size, to_underlying(caps));
}
 
[[nodiscard]] inline void* heap_realloc(void* ptr, size_t size, flags<memory_caps> caps) noexcept {
    return heap_caps_realloc(ptr, size, to_underlying(caps));
}
 
inline void heap_free(void* ptr) noexcept {
    heap_caps_free(ptr);
}
 
[[nodiscard]] inline void* heap_aligned_alloc(size_t alignment, size_t size, flags<memory_caps> caps) noexcept {
    return heap_caps_aligned_alloc(alignment, size, to_underlying(caps));
}
 
[[nodiscard]] inline void*
heap_aligned_calloc(size_t alignment, size_t n, size_t size, flags<memory_caps> caps) noexcept {
    return heap_caps_aligned_calloc(alignment, n, size, to_underlying(caps));
}
 
template<typename T, flags<memory_caps> Caps, size_t Alignment = 0>
struct caps_allocator {
    using value_type = T; 
    template<typename U>
    struct rebind {
        using other = caps_allocator<U, Caps, Alignment>; 
    };
 
    caps_allocator() = default;
 
    template<typename U>
    constexpr caps_allocator(const caps_allocator<U, Caps, Alignment>&) noexcept {}
 
    [[nodiscard]] T* allocate(size_t n) {
        if (n > std::numeric_limits<size_t>::max() / sizeof(T)) {
            raise_no_mem();
        }
        void* p;
        if constexpr (Alignment == 0) {
            p = heap_caps_malloc(n * sizeof(T), to_underlying(Caps));
        } else {
            static_assert((Alignment & (Alignment - 1)) == 0, "Alignment must be a power of two");
            p = heap_caps_aligned_alloc(Alignment, n * sizeof(T), to_underlying(Caps));
        }
        if (!p) {
            raise_no_mem();
        }
        return static_cast<T*>(p);
    }
 
    void deallocate(T* p, size_t) noexcept { heap_caps_free(p); }
};
 
template<typename T, typename U, flags<memory_caps> Caps, size_t Alignment>
constexpr bool
operator==(const caps_allocator<T, Caps, Alignment>&, const caps_allocator<U, Caps, Alignment>&) noexcept {
    return true;
}
 
template<typename T>
using dram_allocator = caps_allocator<T, memory_caps::dram>;
 
template<typename T>
using spiram_allocator = caps_allocator<T, memory_caps::spiram>;
 
template<typename T>
using dma_allocator = caps_allocator<T, memory_caps::dma>;
 
template<typename T, size_t Alignment>
using aligned_dram_allocator = caps_allocator<T, memory_caps::dram, Alignment>;
 
template<typename T, size_t Alignment>
using aligned_spiram_allocator = caps_allocator<T, memory_caps::spiram, Alignment>;
 
template<typename T, size_t Alignment>
using aligned_dma_allocator = caps_allocator<T, memory_caps::dma, Alignment>;
 
// ---- Heap walking -----------------------------------------------------------
 
struct heap_region {
    intptr_t start; 
    intptr_t end;   
};
 
struct heap_block {
    void* ptr;   
    size_t size; 
    bool used;   
};
 
template<typename F>
void heap_walk(flags<memory_caps> caps, F&& walker) {
    auto cb = [](walker_heap_into_t heap_info, walker_block_info_t block_info, void* user_data) -> bool {
        auto& fn = *static_cast<std::remove_reference_t<F>*>(user_data);
        return fn(
            heap_region{heap_info.start, heap_info.end}, heap_block{block_info.ptr, block_info.size, block_info.used}
        );
    };
    heap_caps_walk(to_underlying(caps), cb, &walker);
}
 
template<typename F>
void heap_walk_all(F&& walker) {
    auto cb = [](walker_heap_into_t heap_info, walker_block_info_t block_info, void* user_data) -> bool {
        auto& fn = *static_cast<std::remove_reference_t<F>*>(user_data);
        return fn(
            heap_region{heap_info.start, heap_info.end}, heap_block{block_info.ptr, block_info.size, block_info.used}
        );
    };
    heap_caps_walk_all(cb, &walker);
}
 
// ---- Heap integrity checking ------------------------------------------------
 
[[nodiscard]] inline bool heap_check_integrity(flags<memory_caps> caps, bool print_errors = false) noexcept {
    return heap_caps_check_integrity(to_underlying(caps), print_errors);
}
 
[[nodiscard]] inline bool heap_check_integrity_all(bool print_errors = false) noexcept {
    return heap_caps_check_integrity_all(print_errors);
}
 
// ---- Heap dump --------------------------------------------------------------
 
inline void heap_dump(flags<memory_caps> caps) noexcept {
    heap_caps_dump(to_underlying(caps));
}
 
inline void heap_dump_all() noexcept {
    heap_caps_dump_all();
}
 
 
} // namespace idfxx