A heap allocator for embedded systems.
Note that using this as your global allocator requires Rust 1.68 or later.
(With earlier versions, you need the unstable feature #![feature(default_alloc_error_handler)]
)
This project is developed and maintained by the libs team.
Starting with Rust 1.68, this crate can be used as a global allocator on stable Rust:
#![no_std]
#![no_main]
extern crate alloc;
use cortex_m_rt::entry;
use embedded_alloc::LlffHeap as Heap;
#[global_allocator]
static HEAP: Heap = Heap::empty();
#[entry]
fn main() -> ! {
// Initialize the allocator BEFORE you use it
{
use core::mem::MaybeUninit;
const HEAP_SIZE: usize = 1024;
static mut HEAP_MEM: [MaybeUninit<u8>; HEAP_SIZE] = [MaybeUninit::uninit(); HEAP_SIZE];
unsafe { HEAP.init(HEAP_MEM.as_ptr() as usize, HEAP_SIZE) }
}
// now the allocator is ready types like Box, Vec can be used.
loop { /* .. */ }
}
For a full usage example, see examples/global_alloc.rs
.
For this to work, an implementation of critical-section
must be provided.
For simple use cases with Cortex-M CPUs you may enable the critical-section-single-core
feature in the cortex-m crate.
Please refer to the documentation of critical-section
for further guidance.
There are two heaps available to use:
llff
: ProvidesLlffHeap
, a Linked List First Fit heap.tlsf
: ProvidesTlsfHeap
, a Two-Level Segregated Fit heap.
The best heap to use will depend on your application, see #78 for more discussion.
Licensed under either of
- Apache License, Version 2.0 (LICENSE-APACHE or http://www.apache.org/licenses/LICENSE-2.0)
- MIT license (LICENSE-MIT or http://opensource.org/licenses/MIT)
at your option.
Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.
Contribution to this crate is organized under the terms of the Rust Code of Conduct, the maintainer of this crate, the libs team, promises to intervene to uphold that code of conduct.