#heap #linked-list #allocator

no-std linked_list_allocator

Simple allocator usable for no_std systems. It builds a linked list from the freed blocks and thus needs no additional data structures.

44 releases

Uses old Rust 2015

0.10.5 Mar 4, 2023
0.10.4 Oct 10, 2022
0.10.3 Sep 6, 2022
0.10.1 Jul 7, 2022
0.1.2 Mar 5, 2016

#25 in Memory management

Download history 10040/week @ 2024-06-07 12391/week @ 2024-06-14 13483/week @ 2024-06-21 11921/week @ 2024-06-28 9772/week @ 2024-07-05 12888/week @ 2024-07-12 12404/week @ 2024-07-19 12863/week @ 2024-07-26 13015/week @ 2024-08-02 16041/week @ 2024-08-09 13770/week @ 2024-08-16 16597/week @ 2024-08-23 18100/week @ 2024-08-30 16226/week @ 2024-09-06 14654/week @ 2024-09-13 14418/week @ 2024-09-20

66,300 downloads per month
Used in 77 crates (38 directly)

Apache-2.0/MIT

69KB
1K SLoC

linked-list-allocator

Crates.io Build Status docs.rs

Usage

Create a static allocator in your root module:

use linked_list_allocator::LockedHeap;

#[global_allocator]
static ALLOCATOR: LockedHeap = LockedHeap::empty();

Before using this allocator, you need to init it:

pub fn init_heap() {
    let heap_start =;
    let heap_end =;
    let heap_size = heap_end - heap_start;
    unsafe {
        ALLOCATOR.lock().init(heap_start, heap_size);
    }
}

Features

  • use_spin (default): Provide a LockedHeap type that implements the GlobalAlloc trait by using a spinlock.
  • alloc_ref: Provide an implementation of the unstable AllocRef trait; requires nightly Rust.
    • Warning: The AllocRef trait is still regularly changed on the Rust side, so expect some regular breakage when using this feature.

License

This crate is dual-licensed under MIT or the Apache License (Version 2.0). See LICENSE-APACHE and LICENSE-MIT for details.

Dependencies

~37KB