Expand description
A simple dynamic allocator implementation for our embedded devices.
Based on a First-Fit algorithm as described by:
R. P. Brent. 1989. Efficient implementation of the first-fit strategy for dynamic storage allocation. ACM Trans. Program. Lang. Syst. 11, 3 (July 1989), 388–403. DOI:https://doi.org/10.1145/65979.65981
Modules§
- The
Box<T>
type for heap allocation. - Single-threaded reference-counting pointers. ‘Rc’ stands for ‘Reference Counted’.
- A contiguous growable array type with heap-allocated contents, written
Vec<T>
.
Macros§
- Creates a
Vec
containing the arguments.
Functions§
- Allocate memory using the AVRoxide global allocator implementation
- Deallocate memory allocated using the AVRoxide global allocator implementation