fastarena

A zero-dependency bump-pointer arena allocator with RAII transactions, nested savepoints, optional destructor tracking, and ArenaVec — built for compilers, storage engines, and high-throughput request-scoped workloads.

Why FastArena?

Quick Start

Basic Allocation

use fastarena::Arena;

let mut arena = Arena::new();

let x: &mut u64 = arena.alloc(42);
let squares: &mut [u32] = arena.alloc_slice(0u32..8);
let s: &str = arena.alloc_str("hello");

// Zero-cost reset — pages stay warm, no OS calls
arena.reset();

Transactions — Auto-Rollback on Failure

No other arena allocator gives you RAII transactions. Allocations succeed or roll back as a unit — no leaks, no manual cleanup.

use fastarena::Arena;

let mut arena = Arena::new();

// Ok commits, Err rolls back — all allocations are atomic
let result: Result<u32, &str> = arena.with_transaction(|txn| {
    let name = txn.alloc_str("fastarena");
    let score = txn.alloc(100u32);
    Ok(*score)
});
assert_eq!(result, Ok(100));

// Failed transaction — everything allocated inside is gone
arena.with_transaction(|txn| {
    txn.alloc(1u32);
    txn.alloc(2u32);
    Err("abort")  // both u32s rolled back automatically
});

// Infallible variant — commits even through panic
let val = arena.with_transaction_infallible(|txn| {
    *txn.alloc(7u32) * 6
});
assert_eq!(val, 42);

Nested Savepoints

Transactions nest to arbitrary depth. Each savepoint is independently committable — roll back an inner scope without losing outer work.

use fastarena::Arena;

let mut arena = Arena::new();
let mut outer = arena.transaction();
let parser_ast = outer.alloc_str("top-level");

{
    let mut inner = outer.savepoint();
    inner.alloc_str("speculative-opt");
    inner.alloc(999u32);
    // dropped without commit — inner work discarded, outer untouched
}

let final_ast = outer.alloc_str("confirmed");
outer.commit();  // parser_ast + final_ast survive

ArenaVec with finish() — Transfer Ownership to the Arena

ArenaVec is a growable vector backed by arena memory. Call finish() to hand ownership to the arena — no destructor run, no copy. The slice lives as long as the arena.

use fastarena::Arena;
use fastarena::ArenaVec;

let mut arena = Arena::new();

let items: &mut [u32] = {
    let mut v = ArenaVec::new(&mut arena);
    for i in 0..1024 {
        v.push(i);
    }
    v.finish()  // ArenaVec consumed, slice now arena-owned
};

assert_eq!(items.len(), 1024);
assert_eq!(items[512], 512);

Transaction Budgets — Cap Memory per Request

Set a byte budget on any transaction. Exceed it and alloc panics (or try_alloc returns None). Zero-cost when unlimited.

use fastarena::Arena;

let mut arena = Arena::new();
let mut txn = arena.transaction();
txn.set_limit(4096);  // hard cap

txn.alloc(vec![0u8; 2048]);  // ok
// txn.alloc(vec![0u8; 4096]);  // panics: budget exceeded
let remaining = txn.budget_remaining();  // introspect at any time
txn.commit();

Drop-Tracking — Opt-In Destructor Execution

By default, fastarena never runs destructors (zero overhead). Enable drop-tracking to run them in LIFO order on reset() / rewind().

[dependencies]
fastarena = { version = "0.1", features = ["drop-tracking"] }

use fastarena::Arena;

let mut arena = Arena::new();
let cp = arena.checkpoint();

arena.alloc(String::from("hello"));
arena.alloc(String::from("world"));

// With drop-tracking: drops fire in LIFO order ("world", then "hello")
// Without drop-tracking: no destructors, memory reclaimed instantly
arena.rewind(cp);

Use Cases

• Compiler AST / parsers — allocate all nodes per pass, reset in bulk
• Graphs and cyclic structures — same-lifetime references enable safe cycles without Rc/RefCell
• Trees with parent pointers — back-references trivially supported
• Heterogeneous types — allocate Node, Edge, Token in a single arena
• Phase-oriented bulk alloc/free — many objects created, bulk-freed via reset() or rewind()
• Request-scoped memory — thread-local arena per HTTP request, zero-cost recycle
• Transactional batch processing — commit on success, auto-rollback on failure, nested savepoints
• Dynamic collections — ArenaVec with O(1) push, arena-backed lifetime

See USAGE.md for full examples.

Performance

Head-to-head: fastarena vs bumpalo vs typed-arena

† typed-arena drops and re-creates the arena each iteration; not directly comparable.

Fast path benchmarks (vs std Box/Vec)

Why fastarena excels

• 4-8x faster slice allocation than bumpalo (batch write in tight loop)
• 2.5x faster ArenaVec than bumpalo/typed-arena for bulk collection building
• Tied on alloc — on par with bumpalo for single-item allocation
• 12x faster than Box for bulk alloc + reclaim cycles
• Zero dependencies: No external crates required

Feature Flags

[dependencies]
fastarena = { version = "0.1", features = ["drop-tracking"] }

When NOT to Use an Arena

• Objects with independent lifetimes — use Box<T> or Rc<T>
• Frequent arbitrary-order removal — use a slab allocator
• Thread-shared allocation — wrap in a Mutex or use thread-local arenas

Documentation

See USAGE.md for complete API reference.