#arena-allocator #memory-allocator #arena #memory-map

no-std rarena-allocator

Lock-free ARENA allocator which can be used in both memory and on-disk

5 releases (3 breaking)

new 0.4.20 Nov 25, 2024
0.4.15 Oct 31, 2024
0.1.7 Jun 30, 2024

#48 in Memory management

Download history 559/week @ 2024-08-07 281/week @ 2024-08-14 7/week @ 2024-08-21 944/week @ 2024-08-28 824/week @ 2024-09-04 1339/week @ 2024-09-11 3899/week @ 2024-09-18 4456/week @ 2024-09-25 3473/week @ 2024-10-02 880/week @ 2024-10-09 1077/week @ 2024-10-16 1858/week @ 2024-10-23 1738/week @ 2024-10-30 1963/week @ 2024-11-06 373/week @ 2024-11-13 439/week @ 2024-11-20

4,727 downloads per month
Used in 6 crates (5 directly)

MIT/Apache

350KB
7K SLoC

rarena-allocator

Lock-free ARENA allocator which can be used in both memory and on-disk.

github LoC Build codecov

docs.rs crates.io crates.io license

Introduction

rarena-allocator is a lock-free concurrent-safe ARENA implementation, the underlying memory can from either an allocation or memory map, which means that the allocator can be restored.

There are 3 kinds of main memory:

  1. AlignedVec
  2. file backed memory map
  3. anon memory map

There are 3 kinds of freelist:

  1. None

    Disable freelist, once main memory is consumed out, then this ARENA cannot allocate anymore.

  2. Optimistic

    A lock-free linked list which ordered by segment size (descending), when allocating, pop the head segment.

    e.g.

    freelist: 100 -> 96 -> 50.

    The head segment size is 100, we want 20, then the head will be removed from the linked list, give out 20, the remaining 80 will be inserted back to the freelist if it is larger than Options::minimum_segment_size().

    After this allocation, the freelist will be 96 -> 80 -> 50.

  3. Pessimistic

    A lock-free linked list which ordered by segment size (ascending), when allocating, find the most suitable segment.

    e.g.

    freelist: 42 -> 84 -> 100.

    If we want 50, then the second segment will be removed from the linked list, give out 50, the remaining 34 will be inserted back to the freelist if it is larger than Options::minimum_segment_size().

    After this allocation, the freelist will be 34 -> 42 -> 100.

The allocation policy used in the implementation is that, first try to allocate from main memory, main memory is increase-only, so it is blazing fast if main memory has enough space, at the same time, ARENA will collect dropped segments to construct a freelist (lock-free linked list). When the main memory does not have space, the ARENA will try to allocate from the freelist.

This crate contains many unsafe code, although the main functionalities of this crate are well tested by miri, loom and sanitizer, please use it at your own risk.

Memory Layout

  • Pure memory layout, only Vec and anon memory map backed main memory support this layout, this layout cannot be recovered.

    --------------------------------------
    |           1 byte          | ...... |
    --------------------------------------
    | reserved as null pointer  |  data  |
    --------------------------------------
    
  • Unify memory layout, all 3 backed memroy will use the same memory layout. Controlled by Options::with_unify(true)

    --------------------------------------------------------------------------------------------------------------
    |           1 byte          |    1 byte     |   2 bytes    |      2 bytes     | 2 bytes |  32 bytes | ...... |
    --------------------------------------------------------------------------------------------------------------
    | reserved as null pointer  | freelist kind |  magic text  | external version | version |   header  |  data  |
    --------------------------------------------------------------------------------------------------------------
    

Installation

[dependencies]
rarena-allocator = "0.3"
  • no_std

    [dependencies]
    rarena-allocator = { version = "0.3", default-features = false, features = ["alloc"] }
    
  • Enable memory map backed main memory

    [dependencies]
    rarena-allocator = { version = "0.3", features = ["memmap"] }
    

License

rarena-allocator is under the terms of both the MIT license and the Apache License (Version 2.0).

See LICENSE-APACHE, LICENSE-MIT for details.

Copyright (c) 2024 Al Liu.

Dependencies

~0.4–29MB
~427K SLoC