allocator.h

Go to the documentation of this file.

#pragma once
 
#include "fl/stl/cstddef.h"
#include "fl/stl/cstring.h"
#include "fl/stl/type_traits.h"
#include "fl/stl/compiler_control.h"
#include "fl/stl/bit_cast.h"
#include "fl/stl/stdint.h"
#include "fl/stl/bitset.h"
#include "fl/stl/malloc.h"
#include "fl/stl/align.h"
#include "fl/stl/noexcept.h"
#include "fl/stl/static_assert.h"
 
#ifndef FASTLED_DEFAULT_SLAB_SIZE
#define FASTLED_DEFAULT_SLAB_SIZE 8
#endif
 
namespace fl {
 
// Forward declaration for allocate_result
template <typename Pointer, typename SizeType>
struct allocation_result {
    Pointer ptr;
    SizeType count;  // Actual allocated count (may be > requested)
};
 
// Allocator traits for compile-time capability detection
// Allows containers to use optimized code paths if allocators support them
template <typename Allocator>
struct allocator_traits {
    using allocator_type = Allocator;
    using value_type = typename Allocator::value_type;
    using pointer = typename Allocator::pointer;
    using size_type = typename Allocator::size_type;
 
    // Detect if allocator has reallocate() method
    // Allows in-place memory resizing for POD types without copy
    template <typename A = Allocator, typename = void>
    struct has_reallocate : fl::false_type {};
 
    template <typename A>
    struct has_reallocate<A, decltype((void)fl::declval<A>().reallocate(
        fl::declval<typename A::pointer>(),
        fl::declval<typename A::size_type>(),
        fl::declval<typename A::size_type>()
    ))> : fl::true_type {};
 
    static constexpr bool has_reallocate_v = has_reallocate<Allocator>::value;
 
    // Detect if allocator has allocate_at_least() method
    // Allows allocator to return more memory than requested to reduce reallocations
    template <typename A = Allocator, typename = void>
    struct has_allocate_at_least : fl::false_type {};
 
    template <typename A>
    struct has_allocate_at_least<A, decltype((void)fl::declval<A>().allocate_at_least(
        fl::declval<typename A::size_type>()
    ))> : fl::true_type {};
 
    static constexpr bool has_allocate_at_least_v = has_allocate_at_least<Allocator>::value;
};
 
// Test hooks for malloc/free operations
#if defined(FASTLED_TESTING)
// Interface class for malloc/free test hooks
class MallocFreeHook {
public:
    virtual ~MallocFreeHook() FL_NOEXCEPT = default;
    virtual void onMalloc(void* ptr, fl::size size) FL_NOEXCEPT = 0;
    virtual void onFree(void* ptr) FL_NOEXCEPT = 0;
};
 
// Set test hooks for malloc and free operations
void SetMallocFreeHook(MallocFreeHook* hook) FL_NOEXCEPT;
 
// Clear test hooks (set to nullptr)
void ClearMallocFreeHook() FL_NOEXCEPT;
#endif
 
void SetPSRamAllocator(void *(*alloc)(fl::size), void (*free)(void *)) FL_NOEXCEPT;
void *PSRamAllocate(fl::size size, bool zero = true) FL_NOEXCEPT;
void PSRamDeallocate(void *ptr) FL_NOEXCEPT;
 
// Deleter for memory allocated via fl::PSRamAllocator (uses fl::PSRamDeallocate)
template <typename T> struct PSRamDeleter {
    PSRamDeleter() FL_NOEXCEPT = default;
    void operator()(T *ptr) FL_NOEXCEPT {
        if (ptr) {
            PSRamDeallocate(ptr);
        }
    }
};
 
void* Malloc(fl::size size) FL_NOEXCEPT;
void Free(void *ptr) FL_NOEXCEPT;
 
// SlabAllocator registry for cross-DLL shared slab allocators.
// On Windows DLLs, inline functions with static locals create per-DLL copies.
// This registry ensures all DLLs in a process share the same SlabAllocator
// for a given (block_size, slab_size) pair, preventing cross-DLL slab
// deallocation errors (freeing a pointer inside another DLL's slab).
namespace detail {
    void* slab_allocator_registry_get(fl::size block_size, fl::size slab_size) FL_NOEXCEPT;
    void  slab_allocator_registry_set(fl::size block_size, fl::size slab_size, void* allocator) FL_NOEXCEPT;
} // namespace detail
 
#ifdef FL_IS_ESP32
// ESP32-specific memory allocation functions for RMT buffer pooling
void* InternalAlloc(fl::size size);      // MALLOC_CAP_INTERNAL - fast DRAM
void* InternalRealloc(void* ptr, fl::size size);  // Realloc for DRAM
void InternalFree(void* ptr);
void* DMAAlloc(fl::size size);           // MALLOC_CAP_DMA - DMA-capable memory
void DMAFree(void* ptr);
#endif
 
template <typename T> class PSRamAllocator {
  public:
    static T *Alloc(fl::size n) FL_NOEXCEPT {
        void *ptr = PSRamAllocate(sizeof(T) * n, true);
        return fl::bit_cast_ptr<T>(ptr);
    }
 
    static void Free(T *p) FL_NOEXCEPT {
        if (p == nullptr) {
            return;
        }
        PSRamDeallocate(p);
    }
};
 
// std compatible allocator.
template <typename T> class allocator {
  public:
    // Type definitions required by STL
    using value_type = T;
    using pointer = T*;
    using const_pointer = const T*;
    using reference = T&;
    using const_reference = const T&;
    using size_type = fl::size;
    using difference_type = fl::ptrdiff_t;
 
    // Rebind allocator to type U
    template <typename U>
    struct rebind {
        using other = allocator<U>;
    };
 
    // Default constructor
    allocator() FL_NOEXCEPT {}
 
    // Copy constructor
    template <typename U>
    allocator(const allocator<U>&) FL_NOEXCEPT {}
 
    // Destructor
    ~allocator() FL_NOEXCEPT {}
 
    // Optional: allocate_at_least() for optimized resizing
    // Allows allocator to return more memory than requested to reduce reallocations
    // Returns allocation_result with actual allocated count (may be > requested)
    allocation_result<pointer, size_type> allocate_at_least(fl::size n) FL_NOEXCEPT {
        if (n == 0) {
            return {nullptr, 0};
        }
        // Default implementation: just allocate exactly what's requested
        // Specialized allocators may override to return more for efficiency
        return {allocate(n), n};
    }
 
    // Optional: reallocate() for in-place resizing
    // Automatically uses fl::realloc() for trivially copyable types
    // Returns nullptr on failure or if type is not trivially copyable
    pointer reallocate(pointer ptr, fl::size old_count, fl::size new_count) FL_NOEXCEPT {
        return reallocate_impl(ptr, old_count, new_count,
            fl::integral_constant<bool, fl::is_trivially_copyable<T>::value>{});
    }
 
private:
    // SFINAE: Use fl::realloc() for trivially copyable types
    pointer reallocate_impl(pointer ptr, fl::size old_count, fl::size new_count, fl::true_type) FL_NOEXCEPT {
        if (new_count == 0) {
            if (ptr) {
                deallocate(ptr, old_count);
            }
            return nullptr;
        }
 
        // Safe to use realloc() - type is trivially copyable
        void* result = fl::realloc(ptr, new_count * sizeof(T));
        if (!result) {
            return nullptr;  // Realloc failed
        }
 
        T* new_ptr = static_cast<T*>(result);
 
        // Zero-initialize any newly allocated memory
        if (new_count > old_count) {
            fl::memset(new_ptr + old_count, 0, (new_count - old_count) * sizeof(T));
        }
 
        return new_ptr;
    }
 
    // SFINAE: Don't use realloc() for non-trivially-copyable types
    pointer reallocate_impl(pointer ptr, fl::size old_count, fl::size new_count, fl::false_type) FL_NOEXCEPT {
        FASTLED_UNUSED(ptr);
        FASTLED_UNUSED(old_count);
        FASTLED_UNUSED(new_count);
        return nullptr;  // Signal: not supported, use standard allocate-copy-deallocate
    }
 
public:
 
    // Use this to allocate large blocks of memory for T.
    // This is useful for large arrays or objects that need to be allocated
    // in a single block.
    T* allocate(fl::size n) FL_NOEXCEPT {
        if (n == 0) {
            return nullptr; // Handle zero allocation
        }
        fl::size size = sizeof(T) * n;
        void *ptr = Malloc(size);
        if (ptr == nullptr) {
            return nullptr; // Handle allocation failure
        }
        fl::memset(ptr, 0, sizeof(T) * n); // Zero-initialize the memory
        return static_cast<T*>(ptr);
    }
 
    void deallocate(T* p, fl::size n) FL_NOEXCEPT {
        FASTLED_UNUSED(n);
        if (p == nullptr) {
            return; // Handle null pointer
        }
        Free(p); // Free the allocated memory
    }
    
    // Construct an object at the specified address
        template <typename U, typename... Args>
        void construct(U* p, Args&&... args) FL_NOEXCEPT {
            if (p == nullptr) return;
            new(static_cast<void*>(p)) U(fl::forward<Args>(args)...);
        }
        
        // Destroy an object at the specified address
        template <typename U>
        void destroy(U* p) FL_NOEXCEPT {
            if (p == nullptr) return;
            p->~U();
        }
};
 
// DEPRECATED: allocator_realloc is now REDUNDANT
//
// ℹ️  The default fl::allocator<T> now automatically uses realloc() for trivially
//    copyable types, making this specialized allocator unnecessary.
//
// ✅ NEW RECOMMENDED USAGE:
//    fl::vector<int> vec;              // Automatically uses realloc() optimization
//    fl::vector<CRGB> leds;            // Automatically uses realloc() optimization
//    fl::vector<fl::string> strs;      // Automatically uses safe allocate-copy-deallocate
//
// This class is kept for backwards compatibility but provides no additional benefit.
// The compile-time safety check below ensures this allocator is only used with
// trivially copyable types (same restriction as fl::allocator now has).
//
template <typename T>
class allocator_realloc {
private:
    // SAFETY CHECK: Compile-time verification that T is trivially copyable
    // This prevents undefined behavior from using realloc() with non-trivially-copyable types
    FL_STATIC_ASSERT(fl::is_trivially_copyable<T>::value,
        "allocator_realloc<T> requires T to be trivially copyable. "
        "NOTE: This allocator is now redundant - fl::allocator<T> automatically "
        "optimizes trivially copyable types. Just use fl::vector<T> instead.");
 
public:
    // Type definitions required by STL
    using value_type = T;
    using pointer = T*;
    using const_pointer = const T*;
    using reference = T&;
    using const_reference = const T&;
    using size_type = fl::size;
    using difference_type = fl::ptrdiff_t;
 
    // Rebind allocator to type U
    template <typename U>
    struct rebind {
        using other = allocator_realloc<U>;
    };
 
    // Default constructor
    allocator_realloc() FL_NOEXCEPT {}
 
    // Copy constructor
    template <typename U>
    allocator_realloc(const allocator_realloc<U>&) FL_NOEXCEPT {}
 
    // Destructor
    ~allocator_realloc() FL_NOEXCEPT {}
 
    // Standard allocate() - allocates new memory
    T* allocate(fl::size n) FL_NOEXCEPT {
        if (n == 0) {
            return nullptr;
        }
        fl::size size = sizeof(T) * n;
        void *ptr = Malloc(size);
        if (ptr == nullptr) {
            return nullptr;
        }
        fl::memset(ptr, 0, sizeof(T) * n);
        return static_cast<T*>(ptr);
    }
 
    // Standard deallocate()
    void deallocate(T* p, fl::size n) FL_NOEXCEPT {
        FASTLED_UNUSED(n);
        if (p == nullptr) {
            return;
        }
        Free(p);
    }
 
    // Standard construct()
    template <typename U, typename... Args>
    void construct(U* p, Args&&... args) FL_NOEXCEPT {
        if (p == nullptr) return;
        new(static_cast<void*>(p)) U(fl::forward<Args>(args)...);
    }
 
    // Standard destroy()
    template <typename U>
    void destroy(U* p) FL_NOEXCEPT {
        if (p == nullptr) return;
        p->~U();
    }
 
    // OPTIMIZED: allocate_at_least() - can return more than requested
    // This gives the vector a hint to allocate extra space and reduce future reallocations
    allocation_result<pointer, size_type> allocate_at_least(fl::size n) FL_NOEXCEPT {
        if (n == 0) {
            return {nullptr, 0};
        }
        // Ask for 1.5x to reduce future reallocations
        fl::size requested = (3 * n) / 2;
        T* ptr = allocate(requested);
        if (ptr) {
            return {ptr, requested};
        }
        // Fallback: try exact size if 1.5x failed
        ptr = allocate(n);
        return {ptr, ptr ? n : 0};
    }
 
    // OPTIMIZED: reallocate() - in-place resize using fl::realloc()
    // Returns the new pointer if successful, nullptr if not supported/failed
    // The caller (fl::vector) handles fallback to allocate-copy-deallocate
    pointer reallocate(pointer ptr, fl::size old_count, fl::size new_count) FL_NOEXCEPT {
        if (new_count == 0) {
            if (ptr) {
                deallocate(ptr, old_count);
            }
            return nullptr;
        }
 
        // Use fl::realloc() for in-place resize
        void* result = fl::realloc(ptr, new_count * sizeof(T));
        if (!result) {
            return nullptr;  // Realloc failed
        }
 
        T* new_ptr = static_cast<T*>(result);
 
        // Zero-initialize any newly allocated memory
        if (new_count > old_count) {
            fl::memset(new_ptr + old_count, 0, (new_count - old_count) * sizeof(T));
        }
 
        return new_ptr;
    }
};
 
template <typename T> class allocator_psram {
    public:
        // Type definitions required by STL
        using value_type = T;
        using pointer = T*;
        using const_pointer = const T*;
        using reference = T&;
        using const_reference = const T&;
        using size_type = fl::size;
        using difference_type = fl::ptrdiff_t;
 
        // Rebind allocator to type U
        template <typename U>
        struct rebind {
            using other = allocator_psram<U>;
        };
 
        // Default constructor
        allocator_psram() FL_NOEXCEPT {}
 
        // Copy constructor
        template <typename U>
        allocator_psram(const allocator_psram<U>&) FL_NOEXCEPT {}
 
        // Destructor
        ~allocator_psram() FL_NOEXCEPT {}
 
        // Allocate memory for n objects of type T
        T* allocate(fl::size n) FL_NOEXCEPT {
            return PSRamAllocator<T>::Alloc(n);
        }
 
        // Deallocate memory for n objects of type T
        void deallocate(T* p, fl::size n) FL_NOEXCEPT {
            PSRamAllocator<T>::Free(p);
            FASTLED_UNUSED(n);
        }
 
        // Construct an object at the specified address
        template <typename U, typename... Args>
        void construct(U* p, Args&&... args) FL_NOEXCEPT {
            if (p == nullptr) return;
            new(static_cast<void*>(p)) U(fl::forward<Args>(args)...);
        }
 
        // Destroy an object at the specified address
        template <typename U>
        void destroy(U* p) FL_NOEXCEPT {
            if (p == nullptr) return;
            p->~U();
        }
 
        // Optional: allocate_at_least() with default implementation
        allocation_result<pointer, size_type> allocate_at_least(fl::size n) FL_NOEXCEPT {
            if (n == 0) {
                return {nullptr, 0};
            }
            // Default: just allocate exactly what's requested
            return {allocate(n), n};
        }
 
        // Optional: reallocate() - no-op for PSRAM
        pointer reallocate(pointer ptr, fl::size old_count, fl::size new_count) FL_NOEXCEPT {
            FASTLED_UNUSED(ptr);
            FASTLED_UNUSED(old_count);
            FASTLED_UNUSED(new_count);
            return nullptr;  // Signal: not supported
        }
};
 
// Slab allocator for fixed-size objects
// Optimized for frequent allocation/deallocation of objects of the same size
// Uses pre-allocated memory slabs with free lists to reduce fragmentation
template <typename T, fl::size SLAB_SIZE = FASTLED_DEFAULT_SLAB_SIZE>
class SlabAllocator {
private:
 
    static constexpr fl::size SLAB_BLOCK_SIZE = sizeof(T) > sizeof(void*) ? sizeof(T) : sizeof(void*);
    static constexpr fl::size BLOCKS_PER_SLAB = SLAB_SIZE;
    static constexpr fl::size SLAB_MEMORY_SIZE = SLAB_BLOCK_SIZE * BLOCKS_PER_SLAB;
 
    struct Slab {
        Slab* next;
        u8* memory;
        fl::size allocated_count;
        fl::bitset_fixed<BLOCKS_PER_SLAB> allocated_blocks;  // Track which blocks are allocated
        
        Slab() FL_NOEXCEPT : next(nullptr), memory(nullptr), allocated_count(0) {}
        
        ~Slab() FL_NOEXCEPT {
            if (memory) {
                Free(memory);
            }
        }
    };
 
    Slab* mSlabs;
    fl::size mTotalAllocated;
    fl::size mTotalDeallocated;
 
    Slab* createSlab() FL_NOEXCEPT {
        Slab* slab = static_cast<Slab*>(Malloc(sizeof(Slab)));
        if (!slab) {
            return nullptr;
        }
 
        // Use placement new to properly initialize the Slab
        new(slab) Slab();
 
        slab->memory = static_cast<u8*>(Malloc(SLAB_MEMORY_SIZE));
        if (!slab->memory) {
            slab->~Slab();
            Free(slab);
            return nullptr;
        }
        
        // Initialize all blocks in the slab as free
        slab->allocated_blocks.reset(); // All blocks start as free
        
        // Add slab to the slab list
        slab->next = mSlabs;
        mSlabs = slab;
        
        return slab;
    }
 
    void* allocateFromSlab(fl::size n = 1) FL_NOEXCEPT {
        // Try to find n contiguous free blocks in existing slabs
        for (Slab* slab = mSlabs; slab; slab = slab->next) {
            void* ptr = findContiguousBlocks(slab, n);
            if (ptr) {
                return ptr;
            }
        }
        
        // No contiguous blocks found, create new slab if n fits
        if (n <= BLOCKS_PER_SLAB) {
            if (!createSlab()) {
                return nullptr; // Out of memory
            }
            
            // Try again with the new slab
            return findContiguousBlocks(mSlabs, n);
        }
        
        // Request too large for slab, fall back to malloc
        return nullptr;
    }
    
    void* findContiguousBlocks(Slab* slab, fl::size n) FL_NOEXCEPT {
        // Check if allocation is too large for this slab
        if (n > BLOCKS_PER_SLAB) {
            return nullptr;
        }
        
        // Use bitset's find_run to find n contiguous free blocks (false = free)
        fl::i32 start = slab->allocated_blocks.find_run(false, static_cast<fl::u32>(n));
        if (start >= 0) {
            // Mark blocks as allocated
            for (fl::size i = 0; i < n; ++i) {
                slab->allocated_blocks.set(static_cast<fl::u32>(start + i), true);
            }
            slab->allocated_count += n;
            mTotalAllocated += n;
            
            // Return pointer to the first block
            return slab->memory + static_cast<fl::size>(start) * SLAB_BLOCK_SIZE;
        }
        
        return nullptr;
    }
 
    void deallocateToSlab(void* ptr, fl::size n = 1) FL_NOEXCEPT {
        if (!ptr) {
            return;
        }
        
        // Find which slab this block belongs to
        for (Slab* slab = mSlabs; slab; slab = slab->next) {
            u8* slab_start = slab->memory;
            u8* slab_end = slab_start + SLAB_MEMORY_SIZE;
            u8* block_ptr = fl::bit_cast_ptr<u8>(ptr);
            
            if (block_ptr >= slab_start && block_ptr < slab_end) {
                fl::size block_index = (block_ptr - slab_start) / SLAB_BLOCK_SIZE;
                
                // Mark blocks as free in the bitset
                for (fl::size i = 0; i < n; ++i) {
                    if (block_index + i < BLOCKS_PER_SLAB) {
                        slab->allocated_blocks.set(block_index + i, false);
                    }
                }
                
                slab->allocated_count -= n;
                mTotalDeallocated += n;
                break;
            }
        }
    }
 
public:
    // Constructor
    SlabAllocator() FL_NOEXCEPT : mSlabs(nullptr), mTotalAllocated(0), mTotalDeallocated(0) {}
    
    // Destructor
    ~SlabAllocator() FL_NOEXCEPT {
        cleanup();
    }
    
    // Non-copyable
    SlabAllocator(const SlabAllocator&) FL_NOEXCEPT = delete;
    SlabAllocator& operator=(const SlabAllocator&) FL_NOEXCEPT = delete;
    
    // Movable
    SlabAllocator(SlabAllocator&& other) FL_NOEXCEPT 
        : mSlabs(other.mSlabs), mTotalAllocated(other.mTotalAllocated), mTotalDeallocated(other.mTotalDeallocated) {
        other.mSlabs = nullptr;
        other.mTotalAllocated = 0;
        other.mTotalDeallocated = 0;
    }
    
    SlabAllocator& operator=(SlabAllocator&& other) FL_NOEXCEPT {
        if (this != &other) {
            cleanup();
            mSlabs = other.mSlabs;
            mTotalAllocated = other.mTotalAllocated;
            mTotalDeallocated = other.mTotalDeallocated;
            other.mSlabs = nullptr;
            other.mTotalAllocated = 0;
            other.mTotalDeallocated = 0;
        }
        return *this;
    }
 
    T* allocate(fl::size n = 1) FL_NOEXCEPT {
        if (n == 0) {
            return nullptr;
        }
        
        // Try to allocate from slab first
        void* ptr = allocateFromSlab(n);
        if (ptr) {
            fl::memset(ptr, 0, sizeof(T) * n);
            return static_cast<T*>(ptr);
        }
        
        // Fall back to regular malloc for large allocations
        ptr = Malloc(sizeof(T) * n);
        if (ptr) {
            fl::memset(ptr, 0, sizeof(T) * n);
        }
        return static_cast<T*>(ptr);
    }
 
    void deallocate(T* ptr, fl::size n = 1) FL_NOEXCEPT {
        if (!ptr) {
            return;
        }
        
        // Try to deallocate from slab first
        bool found_in_slab = false;
        for (Slab* slab = mSlabs; slab; slab = slab->next) {
            u8* slab_start = slab->memory;
            u8* slab_end = slab_start + SLAB_MEMORY_SIZE;
            u8* block_ptr = fl::bit_cast_ptr<u8>(static_cast<void*>(ptr));
            
            if (block_ptr >= slab_start && block_ptr < slab_end) {
                deallocateToSlab(ptr, n);
                found_in_slab = true;
                break;
            }
        }
        
        if (!found_in_slab) {
            // This was allocated with regular malloc
            Free(ptr);
        }
    }
 
    // Get allocation statistics
    fl::size getTotalAllocated() const FL_NOEXCEPT { return mTotalAllocated; }
    fl::size getTotalDeallocated() const FL_NOEXCEPT { return mTotalDeallocated; }
    fl::size getActiveAllocations() const FL_NOEXCEPT { return mTotalAllocated - mTotalDeallocated; }
    
    // Get number of slabs
    fl::size getSlabCount() const FL_NOEXCEPT {
        fl::size count = 0;
        for (Slab* slab = mSlabs; slab; slab = slab->next) {
            ++count;
        }
        return count;
    }
 
    // Cleanup all slabs
    void cleanup() FL_NOEXCEPT {
        while (mSlabs) {
            Slab* next = mSlabs->next;
            mSlabs->~Slab();
            Free(mSlabs);
            mSlabs = next;
        }
        mTotalAllocated = 0;
        mTotalDeallocated = 0;
    }
};
 
// STL-compatible slab allocator
template <typename T, fl::size SLAB_SIZE = FASTLED_DEFAULT_SLAB_SIZE>
class allocator_slab {
public:
    // Type definitions required by STL
    using value_type = T;
    using pointer = T*;
    using const_pointer = const T*;
    using reference = T&;
    using const_reference = const T&;
    using size_type = fl::size;
    using difference_type = fl::ptrdiff_t;
 
    // Rebind allocator to type U
    template <typename U>
    struct rebind {
        using other = typename fl::conditional<
            fl::is_same<U, void>::value,
            allocator_slab<char, SLAB_SIZE>,
            allocator_slab<U, SLAB_SIZE>
        >::type;
    };
 
    // Default constructor
    allocator_slab() FL_NOEXCEPT {}
 
    // Copy constructor
    allocator_slab(const allocator_slab& other) FL_NOEXCEPT {
        FASTLED_UNUSED(other);
    }
 
    // Copy assignment
    allocator_slab& operator=(const allocator_slab& other) FL_NOEXCEPT {
        FASTLED_UNUSED(other);
        return *this;
    }
 
    // Template copy constructor
    template <typename U>
    allocator_slab(const allocator_slab<U, SLAB_SIZE>& other) FL_NOEXCEPT {
        FASTLED_UNUSED(other);
    }
 
    // Destructor
    ~allocator_slab() FL_NOEXCEPT {}
 
private:
    // Get the shared process-wide allocator instance.
    // Uses a DLL-exported registry to ensure all DLLs in the process share
    // the same SlabAllocator for a given (block_size, slab_size) pair.
    static SlabAllocator<T, SLAB_SIZE>& get_allocator() FL_NOEXCEPT {
        constexpr fl::size block_size = sizeof(T) > sizeof(void*) ? sizeof(T) : sizeof(void*);
        void* ptr = detail::slab_allocator_registry_get(block_size, SLAB_SIZE);
        if (ptr) {
            return *static_cast<SlabAllocator<T, SLAB_SIZE>*>(ptr);
        }
        // First time for this (block_size, slab_size) pair - create and register
        static SlabAllocator<T, SLAB_SIZE> allocator;
        detail::slab_allocator_registry_set(block_size, SLAB_SIZE, &allocator);
        return allocator;
    }
 
public:
    // Allocate memory for n objects of type T
    T* allocate(fl::size n) FL_NOEXCEPT {
        // Use a static allocator instance per type/size combination
        SlabAllocator<T, SLAB_SIZE>& allocator = get_allocator();
        return allocator.allocate(n);
    }
 
    // Deallocate memory for n objects of type T
    void deallocate(T* p, fl::size n) FL_NOEXCEPT {
        // Use the same static allocator instance
        SlabAllocator<T, SLAB_SIZE>& allocator = get_allocator();
        allocator.deallocate(p, n);
    }
 
    // Construct an object at the specified address
    template <typename U, typename... Args>
    void construct(U* p, Args&&... args) FL_NOEXCEPT {
        if (p == nullptr) return;
        new(static_cast<void*>(p)) U(fl::forward<Args>(args)...);
    }
 
    // Destroy an object at the specified address
    template <typename U>
    void destroy(U* p) FL_NOEXCEPT {
        if (p == nullptr) return;
        p->~U();
    }
 
    // Cleanup method to clean up the static slab allocator
    void cleanup() FL_NOEXCEPT {
        // Access the same static allocator instance and clean it up
        static SlabAllocator<T, SLAB_SIZE> allocator;
        allocator.cleanup();
    }
 
    // Equality comparison
    bool operator==(const allocator_slab& other) const FL_NOEXCEPT {
        FASTLED_UNUSED(other);
        return true; // All instances are equivalent
    }
 
    bool operator!=(const allocator_slab& other) const FL_NOEXCEPT {
        return !(*this == other);
    }
};
 
// Inlined allocator that stores the first N elements inline
// Falls back to the base allocator for additional elements
template <typename T, fl::size N, typename BaseAllocator = fl::allocator<T>>
class allocator_inlined {
private:
 
    // Inlined storage block
    struct InlinedStorage {
        FL_ALIGN_AS(T) u8 data[N * sizeof(T)];
        
        InlinedStorage() FL_NOEXCEPT {
            fl::memset(data, 0, sizeof(data));
        }
    };
    
    InlinedStorage mInlinedStorage;
    BaseAllocator mBaseAllocator;
    fl::size mInlinedUsed = 0;
    fl::bitset_fixed<N> mFreeBits;  // Track free slots for inlined memory only
    fl::size mActiveAllocations = 0;  // Track current active allocations
 
public:
    // Type definitions required by STL
    using value_type = T;
    using pointer = T*;
    using const_pointer = const T*;
    using reference = T&;
    using const_reference = const T&;
    using size_type = fl::size;
    using difference_type = fl::ptrdiff_t;
 
    // Rebind allocator to type U
    template <typename U>
    struct rebind {
        using other = allocator_inlined<U, N, typename BaseAllocator::template rebind<U>::other>;
    };
 
    // Default constructor
    allocator_inlined() FL_NOEXCEPT = default;
 
    // Copy constructor
    allocator_inlined(const allocator_inlined& other) FL_NOEXCEPT {
        // Copy inlined data
        mInlinedUsed = other.mInlinedUsed;
        for (fl::size i = 0; i < mInlinedUsed; ++i) {
            new (&get_inlined_ptr()[i]) T(other.get_inlined_ptr()[i]);
        }
        
        // Copy free bits
        mFreeBits = other.mFreeBits;
        
        // Note: Heap allocations are not copied, only inlined data
        
        // Copy active allocations count
        mActiveAllocations = other.mActiveAllocations;
    }
 
    // Copy assignment
    allocator_inlined& operator=(const allocator_inlined& other) FL_NOEXCEPT {
        if (this != &other) {
            clear();
            
            // Copy inlined data
            mInlinedUsed = other.mInlinedUsed;
            for (fl::size i = 0; i < mInlinedUsed; ++i) {
                new (&get_inlined_ptr()[i]) T(other.get_inlined_ptr()[i]);
            }
            
            // Copy free bits
            mFreeBits = other.mFreeBits;
            
            // Note: Heap allocations are not copied, only inlined data
            
            // Copy active allocations count
            mActiveAllocations = other.mActiveAllocations;
        }
        return *this;
    }
 
    // Template copy constructor
    template <typename U>
    allocator_inlined(const allocator_inlined<U, N, typename BaseAllocator::template rebind<U>::other>& other) FL_NOEXCEPT {
        FASTLED_UNUSED(other);
    }
 
    // Destructor
    ~allocator_inlined() FL_NOEXCEPT {
        clear();
    }
 
    // Allocate memory for n objects of type T
    T* allocate(fl::size n) FL_NOEXCEPT {
        if (n == 0) {
            return nullptr;
        }
        
        // For large allocations (n > 1), use base allocator directly
        if (n > 1) {
            T* ptr = mBaseAllocator.allocate(n);
            if (ptr) {
                mActiveAllocations += n;
            }
            return ptr;
        }
        
        // For single allocations, first try inlined memory
        // Find first free inlined slot
        fl::i32 free_slot = mFreeBits.find_first(false);
        if (free_slot >= 0 && static_cast<fl::size>(free_slot) < N) {
            // Mark the inlined slot as used
            mFreeBits.set(static_cast<fl::u32>(free_slot), true);
            
            // Update inlined usage tracking
            if (static_cast<fl::size>(free_slot) + 1 > mInlinedUsed) {
                mInlinedUsed = static_cast<fl::size>(free_slot) + 1;
            }
            mActiveAllocations++;
            return &get_inlined_ptr()[static_cast<fl::size>(free_slot)];
        }
        
        // No inlined slots available, use heap allocation
        T* ptr = mBaseAllocator.allocate(1);
        if (ptr) {
            mActiveAllocations++;
        }
        return ptr;
    }
 
    // Deallocate memory for n objects of type T
    void deallocate(T* p, fl::size n) FL_NOEXCEPT {
        if (!p || n == 0) {
            return;
        }
        
        // Check if this is inlined memory
        T* inlined_start = get_inlined_ptr();
        T* inlined_end = inlined_start + N;
        
        if (p >= inlined_start && p < inlined_end) {
            // This is inlined memory, mark slots as free
            fl::size slot_index = (p - inlined_start);
            for (fl::size i = 0; i < n; ++i) {
                if (slot_index + i < N) {
                    mFreeBits.set(slot_index + i, false); // Mark as free
                }
            }
            mActiveAllocations -= n;
            return;
        }
        
        // Fallback to base allocator for heap allocations
        mBaseAllocator.deallocate(p, n);
        mActiveAllocations -= n;
    }
 
    // Construct an object at the specified address
    template <typename U, typename... Args>
    void construct(U* p, Args&&... args) FL_NOEXCEPT {
        if (p == nullptr) return;
        new(static_cast<void*>(p)) U(fl::forward<Args>(args)...);
    }
 
    // Destroy an object at the specified address
    template <typename U>
    void destroy(U* p) FL_NOEXCEPT {
        if (p == nullptr) return;
        p->~U();
    }
 
    // Clear all allocated memory
    void clear() FL_NOEXCEPT {
        // Destroy inlined objects
        for (fl::size i = 0; i < mInlinedUsed; ++i) {
            get_inlined_ptr()[i].~T();
        }
        mInlinedUsed = 0;
        mFreeBits.reset();
        mActiveAllocations = 0;
        
        // Clean up the base allocator (for SlabAllocator, this clears slabs and free lists)
        cleanup_base_allocator();
    }
 
    // Get total allocated size
    fl::size total_size() const FL_NOEXCEPT {
        return mActiveAllocations;
    }
 
    // Get inlined capacity
    fl::size inlined_capacity() const FL_NOEXCEPT {
        return N;
    }
 
    // Check if using inlined storage
    bool is_using_inlined() const FL_NOEXCEPT {
        return mActiveAllocations == mInlinedUsed;
    }
 
private:
    T* get_inlined_ptr() FL_NOEXCEPT {
        return fl::bit_cast_ptr<T>(mInlinedStorage.data);
    }
 
    const T* get_inlined_ptr() const FL_NOEXCEPT {
        return fl::bit_cast_ptr<const T>(mInlinedStorage.data);
    }
    
    // SFINAE helper to detect if base allocator has cleanup() method
    template<typename U>
    static auto has_cleanup_impl(int) FL_NOEXCEPT -> decltype(fl::declval<U>().cleanup(), fl::true_type{});
    
    template<typename U>
    static fl::false_type has_cleanup_impl(...) FL_NOEXCEPT;
    
    using has_cleanup = decltype(has_cleanup_impl<BaseAllocator>(0));
    
    // Call cleanup on base allocator if it has the method
    void cleanup_base_allocator() FL_NOEXCEPT {
        cleanup_base_allocator_impl(has_cleanup{});
    }
    
    void cleanup_base_allocator_impl(fl::true_type) FL_NOEXCEPT {
        mBaseAllocator.cleanup();
    }
    
    void cleanup_base_allocator_impl(fl::false_type) FL_NOEXCEPT {
        // Base allocator doesn't have cleanup method, do nothing
    }
    
    // Equality comparison
    bool operator==(const allocator_inlined& other) const FL_NOEXCEPT {
        FASTLED_UNUSED(other);
        return true; // All instances are equivalent for now
    }
 
    bool operator!=(const allocator_inlined& other) const FL_NOEXCEPT {
        return !(*this == other);
    }
};
 
// Inlined allocator that uses PSRam for heap allocation
template <typename T, fl::size N>
using allocator_inlined_psram = allocator_inlined<T, N, fl::allocator_psram<T>>;
 
// Inlined allocator that uses slab allocator for heap allocation
template <typename T, fl::size N, fl::size SLAB_SIZE = 8>
using allocator_inlined_slab_psram = allocator_inlined<T, N, fl::allocator_slab<T, SLAB_SIZE>>;
 
template <typename T, fl::size N>
using allocator_inlined_slab = allocator_inlined<T, N, fl::allocator_slab<T>>;
 
} // namespace fl