Simple allocator usable for no_std systems. It builds a linked list from the freed blocks and thus needs no additional data structures.
Collect CPU callstack samples from a windows process
Collect CPU call stack samples from a windows process
A simple `no_std` allocator written in Rust that manages memory in fixed-size chunks/blocks. Useful for basic `no_std` binaries where you want to manage a heap of a few megabytes without complex features such as paging/page table management. Instead, this allocator gets a fixed/static memory region and allocates memory from there. This memory region can be contained inside the executable file that uses this allocator.
A blazingly fast and memory efficient memory allocator to be used in `no_std` environments.
portable linked-list allocator for baremetal systems
A collection of allocators for the Polished project
A bare metal allocator that uses buddy system.
An efficient, zero-allocation circular intrusive doubly linked list in Rust. Features safe, lifetime-bounded iterators, unified ownership validation using a link_state flag to prevent node reuse bugs across multiple lists, and idiomatically optimized low-level pointer mechanics without any external heap allocation overhead.
MOROS: Obscure Rust Operating System
LinkedList on Vec
Persistent block lists (fixed & dynamic) with reclamation and checksums, built on top of bstack