fastarena 0.1.3

A zero-dependency, bump-pointer arena allocator with RAII transactions, nested savepoints, optional LIFO destructor tracking, and ArenaVec — built for compilers, storage engines, and high-throughput request-scoped workloads.
Documentation
use std::alloc::{alloc, dealloc, Layout};
use std::ptr::NonNull;

/// A single memory block in the arena.
///
/// Blocks are allocated from the OS and managed in a bump-pointer fashion.
/// Fields are ordered by access frequency: `offset` (written every alloc),
/// `capacity` (read every alloc), `base` (read every alloc), then `ptr`
/// (only used in Drop).
#[repr(C)]
pub(crate) struct Block {
    /// Current offset within the block — the next free position.
    pub(crate) offset: usize,
    /// Total capacity of this block in bytes.
    pub(crate) capacity: usize,
    /// Base address of the allocated memory.
    pub(crate) base: *mut u8,
    /// Owning pointer for deallocation on drop.
    ptr: NonNull<u8>,
    /// Alignment used when this block was allocated (needed for dealloc and block scan).
    pub(crate) align: usize,
}

/// Minimum alignment guaranteed by every block.
pub(crate) const MIN_BLOCK_ALIGN: usize = 64;

impl Block {
    /// Creates a new block with the given capacity and alignment.
    ///
    /// Panics if allocation fails.
    pub(crate) fn new(capacity: usize, align: usize) -> Self {
        Self::try_new(capacity, align).expect("arena: out of memory")
    }

    /// Creates a new block, returning `None` if capacity is 0 or allocation fails.
    ///
    /// `align` must be a power of two and is clamped to at least [`MIN_BLOCK_ALIGN`].
    pub(crate) fn try_new(capacity: usize, align: usize) -> Option<Self> {
        if capacity == 0 {
            return None;
        }
        let align = align.max(MIN_BLOCK_ALIGN);
        let layout = Layout::from_size_align(capacity, align).ok()?;
        let ptr = NonNull::new(unsafe { alloc(layout) })?;
        Some(Block {
            ptr,
            base: ptr.as_ptr(),
            capacity,
            offset: 0,
            align,
        })
    }

    /// Tries to allocate `size` bytes at `align` alignment.
    ///
    /// Returns `Some((ptr, delta))` on success where:
    /// - `ptr`: the aligned pointer to the allocated memory
    /// - `delta`: the increase in `self.offset` including alignment padding
    ///
    /// Returns `None` if the block doesn't have enough space.
    #[inline(always)]
    pub(crate) fn try_alloc(&mut self, size: usize, align: usize) -> Option<(NonNull<u8>, usize)> {
        let base_usize = self.base as usize;
        let aligned = align_up(base_usize + self.offset, align);
        let new_offset = (aligned - base_usize).checked_add(size)?;
        if new_offset > self.capacity {
            return None;
        }
        let delta = new_offset - self.offset;
        self.offset = new_offset;
        let ptr = unsafe { self.base.add(aligned - base_usize) };
        Some((unsafe { NonNull::new_unchecked(ptr) }, delta))
    }

    /// Returns the number of bytes remaining in this block for allocation.
    #[allow(dead_code)]
    #[inline]
    pub(crate) fn remaining(&self) -> usize {
        self.capacity - self.offset
    }
}

impl Drop for Block {
    fn drop(&mut self) {
        let layout = unsafe { Layout::from_size_align_unchecked(self.capacity, self.align) };
        unsafe { dealloc(self.ptr.as_ptr(), layout) };
    }
}

/// Round `addr` up to the next multiple of `align` (must be a power of two).
#[inline(always)]
pub(crate) fn align_up(addr: usize, align: usize) -> usize {
    (addr + align - 1) & !(align - 1)
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn try_new_zero() {
        assert!(Block::try_new(0, 8).is_none());
    }

    #[test]
    fn try_alloc_ok() {
        let mut b = Block::new(256, 8);
        let (ptr, delta) = b.try_alloc(8, 8).unwrap();
        assert_eq!(ptr.as_ptr() as usize % 8, 0);
        assert_eq!(delta, 8);
    }

    #[test]
    fn alloc_padding_in_delta() {
        let mut b = Block::new(256, 8);
        b.try_alloc(1, 1).unwrap();
        let (_, d) = b.try_alloc(8, 8).unwrap();
        assert_eq!(d, 15); // 7 padding + 8 payload
    }

    #[test]
    fn alloc_none_when_full() {
        let mut b = Block::new(16, 8);
        b.try_alloc(16, 1).unwrap();
        assert!(b.try_alloc(1, 1).is_none());
    }

    #[test]
    fn reset_reuse() {
        let mut b = Block::new(64, 8);
        let (p1, _) = b.try_alloc(32, 8).unwrap();
        b.offset = 0;
        let (p2, _) = b.try_alloc(32, 8).unwrap();
        assert_eq!(p1.as_ptr(), p2.as_ptr());
    }

    #[test]
    fn align_up_cases() {
        assert_eq!(align_up(0, 8), 0);
        assert_eq!(align_up(1, 8), 8);
        assert_eq!(align_up(9, 8), 16);
        assert_eq!(align_up(65, 64), 128);
    }
}