Crates.io | rarena-allocator |
lib.rs | rarena-allocator |
version | |
source | src |
created_at | 2024-06-04 18:24:45.973118 |
updated_at | 2024-11-10 17:30:30.44211 |
description | Lock-free ARENA allocator which can be used in both memory and on-disk. |
homepage | https://github.com/al8n/rarena/tree/main/rarena-allocator |
repository | https://github.com/al8n/rarena |
max_upload_size | |
id | 1261900 |
Cargo.toml error: | TOML parse error at line 18, column 1 | 18 | autolib = false | ^^^^^^^ unknown field `autolib`, expected one of `name`, `version`, `edition`, `authors`, `description`, `readme`, `license`, `repository`, `homepage`, `documentation`, `build`, `resolver`, `links`, `default-run`, `default_dash_run`, `rust-version`, `rust_dash_version`, `rust_version`, `license-file`, `license_dash_file`, `license_file`, `licenseFile`, `license_capital_file`, `forced-target`, `forced_dash_target`, `autobins`, `autotests`, `autoexamples`, `autobenches`, `publish`, `metadata`, `keywords`, `categories`, `exclude`, `include` |
size | 0 |
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:
AlignedVec
There are 3 kinds of freelist:
None
Disable freelist, once main memory is consumed out, then this ARENA cannot allocate anymore.
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
.
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.
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 |
--------------------------------------------------------------------------------------------------------------
[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"] }
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.