stalloc/

lib.rs

#![no_std]
#![deny(missing_docs)]
#![cfg_attr(feature = "allocator-api", feature(allocator_api))]
#![warn(clippy::nursery, clippy::pedantic)]

//! Stalloc (Stack + alloc) is a fast first-fit memory allocator. From my benchmarking,
//! it can be over 3x as fast as the default OS allocator! This is because all memory
//! is allocated from the stack, which allows it to avoid all OS overhead. Since it
//! doesn't rely on the OS (aside from `SyncStalloc`), this library is `no_std` compatible.
//!
//! ```
//! use stalloc::SyncStalloc;
//!
//! // Create a global allocator with 1000 blocks, each 4 bytes in length.
//! #[global_allocator]
//! static GLOBAL: SyncStalloc<1000, 4> = SyncStalloc::new();
//!
//! fn main() {
//!     // All of these allocations are being handled by the global `SyncStalloc` instance.
//!     let s1 = String::from("Hello");
//!     let s2 = String::from("world");
//!     let msg = format!("{s1}, {s2}!");
//!
//!     assert!(!GLOBAL.is_oom());
//!     println!("Allocator state: {GLOBAL:?}");
//! }
//! ```
//!
//! To avoid the risk of OOM, you can "chain" your allocator to the system allocator, using it as a fallback.
//! ```
//! use stalloc::{AllocChain, SyncStalloc};
//! use std::alloc::System;
//!
//! #[global_allocator]
//! static GLOBAL: AllocChain<SyncStalloc<1000, 8>, System> = SyncStalloc::new().chain(&System);
//! ```
//!
//! # Feature flags
//! - `std` (on by default) — used in the implementation of `SyncStalloc`
//! - `allocator-api` (requires nightly)
//! - `allocator-api2` (pulls in the `allocator-api2` crate)

use core::cell::UnsafeCell;
use core::fmt::{self, Debug, Formatter};
use core::hint::assert_unchecked;
use core::mem::MaybeUninit;
use core::ptr::NonNull;

mod align;
pub use align::*;
mod unsafestalloc;
pub use unsafestalloc::*;
mod chain;
pub use chain::*;

mod alloc;
#[allow(clippy::wildcard_imports)]
use alloc::*;

#[cfg(feature = "std")]
mod syncstalloc;
#[cfg(feature = "std")]
pub use syncstalloc::*;

#[cfg(test)]
#[cfg(feature = "allocator-api")]
mod tests;

#[derive(Clone, Copy)]
#[repr(C)]
struct Header {
	next: u16,
	length: u16,
}

#[derive(Clone, Copy)]
#[repr(C)]
union Block<const B: usize>
where
	Align<B>: Alignment,
{
	header: Header,
	bytes: [MaybeUninit<u8>; B],
	_align: Align<B>,
}

/// This function is always safe to call, as `ptr` is not dereferenced.
fn header_in_block<const B: usize>(ptr: *mut Block<B>) -> *mut Header
where
	Align<B>: Alignment,
{
	unsafe { &raw mut (*ptr).header }
}

/// Converts from `usize` to `u16` assuming that no truncation occurs.
/// Safety precondition: `val` must be less than or equal to `0xffff`.
#[allow(clippy::cast_possible_truncation)]
const unsafe fn as_u16(val: usize) -> u16 {
	unsafe {
		assert_unchecked(val <= 0xffff);
	}

	val as u16
}

// The `base` Header has a unique meaning here. Because `base.length` is useless (always 0),
// we use it as a special flag to check whether `data` is completely filled. Every call to
// `allocate()` and related functions must verify that base.length != OOM_MARKER.
const OOM_MARKER: u16 = u16::MAX;

/// A fast first-fit memory allocator.
///
/// When you create an instance of this allocator, you pass in a value for `L` and `B`.
/// `L` is the number of blocks, and `B` is the size of each block in bytes. The total size of this type
/// comes out to `L * B + 4` bytes, of which `L * B` can be used (4 bytes are needed to hold some metadata).
/// `B` must be a power of two from 4 and 2^29, and `L` must be a number in the range `1..65536`.
///
/// `B` represents the smallest unit of memory that the allocator can manage. If `B == 16`, then asking
/// for 17 bytes will give you a 32 byte allocation (the amount is rounded up).
/// The alignment of the allocator is always equal to `B`. For maximum efficiency, it is recommended
/// to set `B` equal to the alignment of the type you expect to store the most of. For example, if you're storing
/// a lot of `u64`s, you should set `B == 8`.
///
/// Note that `Stalloc` cannot be used as a global allocator because it is not thread-safe. To switch out the global
/// allocator, use `SyncStalloc` or `UnsafeStalloc`, which can be used concurrently.
#[repr(C)]
pub struct Stalloc<const L: usize, const B: usize>
where
	Align<B>: Alignment,
{
	data: UnsafeCell<[Block<B>; L]>,
	base: UnsafeCell<Header>,
}

impl<const L: usize, const B: usize> Stalloc<L, B>
where
	Align<B>: Alignment,
{
	/// Initializes a new empty `Stalloc` instance.
	///
	/// # Examples
	/// ```
	/// use stalloc::Stalloc;
	///
	/// let alloc = Stalloc::<200, 8>::new();
	/// ```
	#[must_use]
	#[inline]
	pub const fn new() -> Self {
		const {
			assert!(L >= 1 && L <= 0xffff, "block count must be in 1..65536");
			assert!(B >= 4, "block size must be at least 4 bytes");
		}

		let mut blocks = [Block {
			bytes: const { [MaybeUninit::uninit(); B] },
		}; L];

		// Write the first header. SAFETY: we have already checked that `L <= 0xffff`.
		blocks[0].header = Header {
			next: 0,
			length: unsafe { as_u16(L) },
		};

		Self {
			base: UnsafeCell::new(Header { next: 0, length: 0 }),
			data: UnsafeCell::new(blocks),
		}
	}

	/// Checks if the allocator is completely out of memory.
	/// If this is false, then you are guaranteed to be able to allocate
	/// a layout with a size and alignment of `B` bytes.
	/// This runs in O(1).
	///
	/// # Examples
	/// ```
	/// use stalloc::Stalloc;
	///
	/// let alloc = Stalloc::<200, 8>::new();
	/// assert!(!alloc.is_oom());
	/// let ptr = unsafe { alloc.allocate_blocks(200, 1).unwrap() };
	/// assert!(alloc.is_oom());
	/// ```
	pub const fn is_oom(&self) -> bool {
		unsafe { *self.base.get() }.length == OOM_MARKER
	}

	/// Checks if the allocator is empty.
	/// If this is true, then you are guaranteed to be able to allocate
	/// a layout with a size of `B * L` bytes and an alignment of `B` bytes.
	/// If this is false, then this is guaranteed to be impossible.
	/// This runs in O(1).
	///
	/// # Examples
	/// ```
	/// use stalloc::Stalloc;
	///
	/// let alloc = Stalloc::<60, 4>::new();
	/// assert!(alloc.is_empty());
	///
	/// let ptr = unsafe { alloc.allocate_blocks(60, 1).unwrap() };
	/// assert!(!alloc.is_empty());
	///
	/// unsafe { alloc.deallocate_blocks(ptr, 60) };
	/// assert!(alloc.is_empty());
	/// ```
	pub fn is_empty(&self) -> bool {
		!self.is_oom() && unsafe { *self.base.get() }.next == 0
	}

	/// # Safety
	///
	/// Calling this function immediately invalidates all pointers into the allocator. Calling
	/// `deallocate_blocks()` with an invalidated pointer will result in the free list being corrupted.
	///
	/// # Examples
	/// ```
	/// use stalloc::Stalloc;
	///
	/// let alloc = Stalloc::<60, 4>::new();
	///
	/// let ptr1 = unsafe { alloc.allocate_blocks(20, 1) }.unwrap();
	/// let ptr2 = unsafe { alloc.allocate_blocks(20, 1) }.unwrap();
	/// let ptr3 = unsafe { alloc.allocate_blocks(20, 1) }.unwrap();
	///
	/// unsafe { alloc.clear() }; // invalidate all allocated pointers
	///
	/// assert!(alloc.is_empty());
	/// ```
	pub unsafe fn clear(&self) {
		unsafe {
			(*self.base.get()).next = 0;
			(*self.base.get()).length = 0;
			(*self.header_at(0)).next = 0;
			(*self.header_at(0)).length = as_u16(L);
		}
	}

	/// Tries to allocate `count` blocks. If the allocation succeeds, a pointer is returned. This function
	/// never allocates more than necessary. Note that `align` is measured in units of `B`.
	///
	/// # Safety
	///
	/// `size` must be nonzero, and `align` must be a power of 2 in the range `1..=2^29 / B`.
	///
	/// # Errors
	///
	/// Will return `AllocError` if the allocation was unsuccessful, in which case this function was a no-op.
	///
	/// # Examples
	/// ```
	/// use stalloc::Stalloc;
	///
	/// const BLOCK_SIZE: usize = 4;
	/// let alloc = Stalloc::<10, BLOCK_SIZE>::new();
	///
	/// let ptr = unsafe { alloc.allocate_blocks(10, 1) }.unwrap();
	/// unsafe { ptr.write_bytes(42, 10 * BLOCK_SIZE) };
	///
	/// assert!(alloc.is_oom());
	/// ```
	pub unsafe fn allocate_blocks(
		&self,
		size: usize,
		align: usize,
	) -> Result<NonNull<u8>, AllocError> {
		// Assert unsafe preconditions.
		unsafe {
			assert_unchecked(size >= 1 && align.is_power_of_two() && align <= 2usize.pow(29) / B);
		}

		if self.is_oom() {
			return Err(AllocError);
		}

		// Loop through the free list, and find the first header whose length satisfies the layout.
		unsafe {
			// `prev` and `curr` are pointers that run through the free list.
			let base = self.base.get();
			let mut prev = base;
			let mut curr = self.header_at((*base).next.into());

			loop {
				let curr_idx = usize::from((*prev).next);
				let next_idx = (*curr).next.into();

				// Check if the current free chunk satisfies the layout.
				let curr_chunk_len = (*curr).length.into();

				// If the alignment is more than 1, there might be spare blocks in front.
				// If it is extremely large, there might have to be more spare blocks than are available.
				let spare_front = (curr.addr() / B).wrapping_neg() % align;

				if spare_front + size <= curr_chunk_len {
					let avail_blocks = curr_chunk_len - spare_front;
					let avail_blocks_ptr = self.block_at(curr_idx + spare_front);
					let spare_back = avail_blocks - size;

					// If there are spare blocks, add them to the free list.
					if spare_back > 0 {
						let spare_back_idx = curr_idx + spare_front + size;
						let spare_back_ptr = self.header_at(spare_back_idx);
						(*spare_back_ptr).next = as_u16(next_idx);
						(*spare_back_ptr).length = as_u16(spare_back);

						if spare_front > 0 {
							(*curr).next = as_u16(spare_back_idx);
							(*curr).length = as_u16(spare_front);
						} else {
							(*prev).next = as_u16(spare_back_idx);
						}
					} else if spare_front > 0 {
						(*curr).next = as_u16(curr_idx + spare_front + size);
						(*curr).length = as_u16(spare_front);
						(*prev).next = as_u16(next_idx);
					} else {
						(*prev).next = as_u16(next_idx);
						// If this is the last block of memory, set the OOM marker.
						if next_idx == 0 {
							(*base).length = OOM_MARKER;
						}
					}

					return Ok(NonNull::new_unchecked(avail_blocks_ptr.cast()));
				}

				// Check if we've already made a whole loop around without finding anything.
				if next_idx == 0 {
					return Err(AllocError);
				}

				prev = curr;
				curr = self.header_at(next_idx);
			}
		}
	}

	/// Deallocates a pointer. This function always succeeds.
	///
	/// # Safety
	///
	/// `ptr` must point to an allocation, and `size` must be the number of blocks
	/// in the allocation. That is, `size` is always in `1..=L`.
	///
	/// # Examples
	/// ```
	/// use stalloc::Stalloc;
	///
	/// let alloc = Stalloc::<100, 16>::new();
	///
	/// let ptr = unsafe { alloc.allocate_blocks(100, 1) }.unwrap();
	/// assert!(alloc.is_oom());
	///
	/// unsafe { alloc.deallocate_blocks(ptr, 100) };
	/// assert!(alloc.is_empty());
	/// ```
	pub unsafe fn deallocate_blocks(&self, ptr: NonNull<u8>, size: usize) {
		// Assert unsafe precondition.
		unsafe {
			assert_unchecked(size >= 1 && size <= L);
		}

		let freed_ptr = header_in_block(ptr.as_ptr().cast());
		let freed_idx = self.index_of(freed_ptr);
		let base = self.base.get();
		let before = self.header_before(freed_idx);

		unsafe {
			let prev_next = (*before).next.into();
			(*freed_ptr).next = as_u16(prev_next);
			(*freed_ptr).length = as_u16(size);

			// Try to merge with the next free block.
			if freed_idx + size == prev_next {
				let header_to_merge = self.header_at(prev_next);
				(*freed_ptr).next = (*header_to_merge).next;
				(*freed_ptr).length += (*header_to_merge).length;
			}

			// Try to merge with the previous free block.
			if before.eq(&base) {
				(*base).next = as_u16(freed_idx);
				(*base).length = 0;
			} else if self.index_of(before) + usize::from((*before).length) == freed_idx {
				(*before).next = (*freed_ptr).next;
				(*before).length += (*freed_ptr).length;
			} else {
				// No merge is possible.
				(*before).next = as_u16(freed_idx);
			}
		}
	}

	/// Shrinks the allocation. This function always succeeds and never reallocates.
	///
	/// # Safety
	///
	/// `ptr` must point to a valid allocation of `old_size` blocks, and `new_size` must be in `1..old_size`.
	///
	/// # Examples
	/// ```
	/// use stalloc::Stalloc;
	///
	/// let alloc = Stalloc::<100, 16>::new();
	///
	/// let ptr = unsafe { alloc.allocate_blocks(100, 1) }.unwrap();
	/// assert!(alloc.is_oom());
	///
	/// // shrink the allocation from 100 to 90 blocks
	/// unsafe { alloc.shrink_in_place(ptr, 100, 90) };
	/// assert!(!alloc.is_oom());
	/// ```
	pub unsafe fn shrink_in_place(&self, ptr: NonNull<u8>, old_size: usize, new_size: usize) {
		// Assert unsafe preconditions.
		unsafe {
			assert_unchecked(new_size > 0 && new_size < old_size);
		}

		let curr_block: *mut Block<B> = ptr.as_ptr().cast();
		let curr_idx = (curr_block.addr() - self.data.get().addr()) / B;

		// A new chunk will be created in the gap.
		let new_idx = curr_idx + new_size;
		let spare_blocks = old_size - new_size;

		unsafe {
			// Check if we can merge the block with a chunk immediately after.
			let prev_free_chunk = self.header_before(curr_idx);

			let next_free_idx = (*prev_free_chunk).next.into(); // possibly zero
			let new_chunk = header_in_block(curr_block.add(new_size));

			(*prev_free_chunk).next = as_u16(new_idx);

			if new_idx + spare_blocks == next_free_idx {
				let next_free_chunk = self.header_at(next_free_idx);
				(*new_chunk).next = (*next_free_chunk).next;
				(*new_chunk).length = as_u16(spare_blocks) + (*next_free_chunk).length;
			} else {
				(*new_chunk).next = as_u16(next_free_idx);
				(*new_chunk).length = as_u16(spare_blocks);
			}

			// We are definitely no longer OOM.
			(*self.base.get()).length = 0;
		}
	}

	/// Tries to grow the current allocation in-place. If that isn't possible, this function is a no-op.
	///
	/// # Safety
	///
	/// `ptr` must point to a valid allocation of `old_size` blocks. Also, `new_size > old_size`.
	///
	/// # Errors
	///
	/// Will return `AllocError` if the grow was unsuccessful, in which case this function was a no-op.
	///
	/// # Examples
	/// ```
	/// use stalloc::Stalloc;
	///
	/// let alloc = Stalloc::<100, 16>::new();
	///
	/// let ptr = unsafe { alloc.allocate_blocks(25, 1) }.unwrap();
	/// assert!(!alloc.is_oom());
	///
	/// // grow the allocation from 25 to 100 blocks
	/// unsafe { alloc.grow_in_place(ptr, 25, 100) }.unwrap();
	/// assert!(alloc.is_oom());
	/// ```
	pub unsafe fn grow_in_place(
		&self,
		ptr: NonNull<u8>,
		old_size: usize,
		new_size: usize,
	) -> Result<(), AllocError> {
		// Assert unsafe preconditions.
		unsafe {
			assert_unchecked(old_size >= 1 && old_size <= L && new_size > old_size);
		}

		let curr_block: *mut Block<B> = ptr.as_ptr().cast();
		let curr_idx = (curr_block.addr() - self.data.get().addr()) / B;
		let prev_free_chunk = self.header_before(curr_idx);

		unsafe {
			let next_free_idx = (*prev_free_chunk).next.into();

			// The next free chunk must be directly adjacent to the current allocation.
			if curr_idx + old_size != next_free_idx {
				return Err(AllocError);
			}

			let next_free_chunk = self.header_at(next_free_idx);
			let room_to_grow = (*next_free_chunk).length.into();

			// There must be enough room to grow.
			let needed_blocks = new_size - old_size;
			if needed_blocks > room_to_grow {
				return Err(AllocError);
			}

			// Check if there would be any blocks left over after growing into the next chunk.
			let blocks_left_over = room_to_grow - needed_blocks;

			if blocks_left_over > 0 {
				let new_chunk_idx = next_free_idx + needed_blocks;
				let new_chunk_head = self.header_at(new_chunk_idx);

				// Insert the new chunk into the free list.
				(*prev_free_chunk).next = as_u16(new_chunk_idx);
				(*new_chunk_head).next = (*next_free_chunk).next;
				(*new_chunk_head).length = as_u16(blocks_left_over);
			} else {
				// The free chunk is completely consumed.
				(*prev_free_chunk).next = (*next_free_chunk).next;

				// If `prev_free_chunk` is the base pointer and we just set it to 0, we are OOM.
				let base = self.base.get();
				if prev_free_chunk.eq(&base) && (*next_free_chunk).next == 0 {
					(*base).length = OOM_MARKER;
				}
			}

			Ok(())
		}
	}

	/// Tries to grow the current allocation in-place. If that isn't possible, the allocator grows by as much
	/// as it is able to, and the new length of the allocation is returned. The new length is guaranteed to be
	/// in the range `old_size..=new_size`.
	/// # Safety
	///
	/// `ptr` must point to a valid allocation of `old_size` blocks. Also, `new_size > old_size`.
	///
	/// # Examples
	/// ```
	/// use stalloc::Stalloc;
	///
	/// let alloc1 = Stalloc::<7, 4>::new();
	/// unsafe {
	///     let ptr = alloc1.allocate_blocks(3, 1).unwrap(); // allocate 3 blocks
	///     let new_size = alloc1.grow_up_to(ptr, 3, 9999); // try to grow to a ridiculous amount
	///     assert_eq!(new_size, 7); // can only grow up to 7
	/// }
	///
	/// let alloc2 = Stalloc::<21, 16>::new();
	/// unsafe {
	///     let ptr = alloc2.allocate_blocks(9, 1).unwrap(); // allocate 9 blocks
	///     let new_size = alloc2.grow_up_to(ptr, 9, 21);
	///     assert_eq!(new_size, 21); // grow was successful
	/// }
	/// ```
	pub unsafe fn grow_up_to(&self, ptr: NonNull<u8>, old_size: usize, new_size: usize) -> usize {
		// Assert unsafe preconditions.
		unsafe {
			assert_unchecked(old_size >= 1 && old_size <= L && new_size > old_size);
		}

		let curr_block: *mut Block<B> = ptr.as_ptr().cast();
		let curr_idx = (curr_block.addr() - self.data.get().addr()) / B;
		let prev_free_chunk = self.header_before(curr_idx);

		unsafe {
			let next_free_idx = (*prev_free_chunk).next.into();

			// The next free chunk must be directly adjacent to the current allocation.
			if curr_idx + old_size != next_free_idx {
				return old_size;
			}

			let next_free_chunk = self.header_at(next_free_idx);
			let room_to_grow = (*next_free_chunk).length.into();

			// If there isn't enough room to grow, grow as much as possible.
			let needed_blocks = (new_size - old_size).min(room_to_grow);

			// Check if there would be any blocks left over after growing into the next chunk.
			let blocks_left_over = room_to_grow - needed_blocks;

			if blocks_left_over > 0 {
				let new_chunk_idx = next_free_idx + needed_blocks;
				let new_chunk_head = self.header_at(new_chunk_idx);

				// Insert the new chunk into the free list.
				(*prev_free_chunk).next = as_u16(new_chunk_idx);
				(*new_chunk_head).next = (*next_free_chunk).next;
				(*new_chunk_head).length = as_u16(blocks_left_over);
			} else {
				// The free chunk is completely consumed.
				(*prev_free_chunk).next = (*next_free_chunk).next;

				// If `prev_free_chunk` is the base pointer and we just set it to 0, we are OOM.
				let base = self.base.get();
				if prev_free_chunk.eq(&base) && (*next_free_chunk).next == 0 {
					(*base).length = OOM_MARKER;
				}
			}

			old_size + needed_blocks
		}
	}
}

// Internal functions.
impl<const L: usize, const B: usize> Stalloc<L, B>
where
	Align<B>: Alignment,
{
	/// Get the index of a pointer to `data`. This function is always safe
	/// to call, but the result may not be meaningful.
	/// Even if the header is not at the start of the block (compiler's choice),
	/// dividing by B rounds down and produces the correct result.
	fn index_of(&self, ptr: *mut Header) -> usize {
		(ptr.addr() - self.data.get().addr()) / B
	}

	/// Safety precondition: idx must be in `0..L`.
	const unsafe fn block_at(&self, idx: usize) -> *mut Block<B> {
		let root: *mut Block<B> = self.data.get().cast();
		unsafe { root.add(idx) }
	}

	/// Safety precondition: idx must be in `0..L`.
	unsafe fn header_at(&self, idx: usize) -> *mut Header {
		header_in_block(unsafe { self.block_at(idx) })
	}

	/// This function always is safe to call. If `idx` is very large,
	/// the returned value will simply be the last header in the free list.
	/// Note: this function may return a pointer to `base`.
	fn header_before(&self, idx: usize) -> *mut Header {
		let mut ptr = self.base.get();

		unsafe {
			if (*ptr).length == OOM_MARKER || usize::from((*ptr).next) >= idx {
				return ptr;
			}

			loop {
				ptr = self.header_at((*ptr).next.into());
				let next_idx = usize::from((*ptr).next);
				if next_idx == 0 || next_idx >= idx {
					return ptr;
				}
			}
		}
	}
}

impl<const L: usize, const B: usize> Debug for Stalloc<L, B>
where
	Align<B>: Alignment,
{
	fn fmt(&self, f: &mut Formatter) -> fmt::Result {
		write!(f, "Stallocator with {L} blocks of {B} bytes each")?;

		let mut ptr = self.base.get();
		if unsafe { (*ptr).length } == OOM_MARKER {
			return write!(f, "\n\tNo free blocks (OOM)");
		}

		loop {
			unsafe {
				let idx = (*ptr).next.into();
				ptr = self.header_at(idx);

				let length = (*ptr).length;
				if length == 1 {
					write!(f, "\n\tindex {idx}: {length} free block")?;
				} else {
					write!(f, "\n\tindex {idx}: {length} free blocks")?;
				}

				if (*ptr).next == 0 {
					return Ok(());
				}
			}
		}
	}
}

impl<const L: usize, const B: usize> Default for Stalloc<L, B>
where
	Align<B>: Alignment,
{
	fn default() -> Self {
		Self::new()
	}
}

#[cfg(any(feature = "allocator-api", feature = "allocator-api2"))]
unsafe impl<const L: usize, const B: usize> Allocator for &Stalloc<L, B>
where
	Align<B>: Alignment,
{
	#[inline]
	fn allocate(&self, layout: Layout) -> Result<NonNull<[u8]>, AllocError> {
		// We can only allocate memory in units of `B`, so round up.
		let size = layout.size().div_ceil(B);
		let align = layout.align().div_ceil(B);

		// If `size` is zero, give away a dangling pointer.
		if size == 0 {
			let addr = layout.align().try_into().unwrap();
			let dangling = NonNull::without_provenance(addr);
			return Ok(NonNull::slice_from_raw_parts(dangling, 0));
		}

		// SAFETY: We have made sure that `size` and `align` are valid.
		unsafe { self.allocate_blocks(size, align) }
			.map(|p| NonNull::slice_from_raw_parts(p, size * B))
	}

	fn allocate_zeroed(&self, layout: Layout) -> Result<NonNull<[u8]>, AllocError> {
		let ptr = self.allocate(layout)?;

		// We intentionally shorten the length of the allocated pointer and hence write fewer zeros.
		let ptr = NonNull::slice_from_raw_parts(ptr.cast(), layout.size());

		// SAFETY: We are filling in the entire allocated range with zeros.
		unsafe { ptr.cast::<u8>().write_bytes(0, ptr.len()) }
		Ok(ptr)
	}

	unsafe fn deallocate(&self, ptr: NonNull<u8>, layout: Layout) {
		let size = layout.size().div_ceil(B);

		if size == 0 {
			return;
		}

		// SAFETY: We just made sure that size != 0. Everything else is upheld by the caller.
		unsafe { self.deallocate_blocks(ptr, size) };
	}

	unsafe fn grow(
		&self,
		ptr: NonNull<u8>,
		old_layout: Layout,
		new_layout: Layout,
	) -> Result<NonNull<[u8]>, AllocError> {
		let old_size = old_layout.size().div_ceil(B);
		let new_size = new_layout.size().div_ceil(B);
		let align = new_layout.align().div_ceil(B);

		// If the size hasn't changed, do nothing.
		if new_size == old_size {
			return Ok(NonNull::slice_from_raw_parts(ptr, new_size * B));
		}

		// If the old size was 0, the pointer was dangling, so just allocate.
		if old_size == 0 {
			// SAFETY: we know that `new_size` is non-zero, because we just made sure
			// that `new_size != old_size`, and we know that `align` has a valid value.
			return unsafe {
				self.allocate_blocks(new_size, align)
					.map(|p| NonNull::slice_from_raw_parts(p, new_size * B))
			};
		}

		unsafe {
			// Try to grow in place.
			// SAFETY: `ptr` and `old_size` are upheld by the caller. As for `new_size`,
			// we have already made sure that `old_size != new_size`, and the fact that
			// new_size >= old_size is upheld by the caller.
			if self.grow_in_place(ptr, old_size, new_size).is_ok() {
				Ok(NonNull::slice_from_raw_parts(ptr, new_size * B))
			} else {
				// Otherwise just reallocate and copy.
				// SAFETY: We have made sure that `new_size > 0` and that `align` is valid.
				let new = self.allocate_blocks(new_size, align)?;

				// SAFETY: We are copying all the necessary bytes from `ptr` into `new`.
				// `ptr` and `new` both point to an allocation of at least `old_layout.size()` bytes.
				ptr.copy_to_nonoverlapping(new, old_layout.size());

				// SAFETY: We already made sure that old_size > 0.
				self.deallocate_blocks(ptr, old_size);

				Ok(NonNull::slice_from_raw_parts(new, new_size * B))
			}
		}
	}

	unsafe fn grow_zeroed(
		&self,
		ptr: NonNull<u8>,
		old_layout: Layout,
		new_layout: Layout,
	) -> Result<NonNull<[u8]>, AllocError> {
		unsafe {
			// SAFETY: Upheld by the caller.
			let new_ptr = self.grow(ptr, old_layout, new_layout)?;
			let count = new_ptr.len() - old_layout.size();

			// SAFETY: We are filling in the extra capacity with zeros.
			new_ptr
				.cast::<u8>()
				.add(old_layout.size())
				.write_bytes(0, count);

			Ok(new_ptr)
		}
	}

	unsafe fn shrink(
		&self,
		ptr: NonNull<u8>,
		old_layout: Layout,
		new_layout: Layout,
	) -> Result<NonNull<[u8]>, AllocError> {
		let old_size = old_layout.size().div_ceil(B);
		let new_size = new_layout.size().div_ceil(B);

		// Check if the old size is zero, in which case we can just return a dangling pointer.
		if new_size == 0 {
			unsafe {
				// SAFETY: If `old_size` isn't zero, we need to free it. The caller
				// upholds that `ptr` and `old_size` are valid.
				if old_size != 0 {
					self.deallocate_blocks(ptr, old_size);
				}

				let addr = new_layout.align().try_into().unwrap();
				let dangling = NonNull::without_provenance(addr);
				return Ok(NonNull::slice_from_raw_parts(dangling, 0));
			}
		}

		// We have to reallocate only if the alignment isn't good enough anymore.
		if !ptr.as_ptr().addr().is_multiple_of(new_layout.align()) {
			// Since the address of `ptr` must be a multiple of `B` (upheld by the caller),
			// entering this branch means that `new_layout.align() > B`.
			let align = new_layout.align() / B;

			unsafe {
				// SAFETY: We just made sure that `new_size > 0`, and `align` is always valid.
				let new = self.allocate_blocks(new_size, align)?;

				// SAFETY: We are copying all the necessary bytes from `ptr` into `new`.
				// `ptr` and `new` both point to an allocation of at least `old_layout.size()` bytes.
				ptr.copy_to_nonoverlapping(new, old_layout.size());

				// SAFETY: We already made sure that old_size > 0.
				self.deallocate_blocks(ptr, old_size);

				return Ok(NonNull::slice_from_raw_parts(new, new_size * B));
			}
		}

		// Check if the size hasn't changed.
		if old_size == new_size {
			return Ok(NonNull::slice_from_raw_parts(ptr, old_size * B));
		}

		// SAFETY: We just made sure that new_size > 0 and old_size > new_size,
		// and `ptr` and `old_size` are valid (upheld by the caller).
		unsafe {
			self.shrink_in_place(ptr, old_size, new_size);
		}

		Ok(NonNull::slice_from_raw_parts(ptr, new_size * B))
	}
}

/// SAFETY: Since zero-sized allocations unconditionally succeed, it can be assumed
/// that a zero-sized allocation was allocated by this Stalloc. Otherwise, check whether
/// the pointer is contained within this Stalloc's buffer.
unsafe impl<const L: usize, const B: usize> ChainableAlloc for Stalloc<L, B>
where
	Align<B>: Alignment,
{
	#[inline]
	fn claims(&self, ptr: *mut u8, layout: Layout) -> bool {
		let base_addr = self.data.get().addr();
		layout.size() == 0 || (ptr.addr() >= base_addr && ptr.addr() < base_addr + B * L)
	}
}

// Note: `chain` should be part of `ChainableAlloc` if const trait methods get stabilized
impl<const L: usize, const B: usize> Stalloc<L, B>
where
	Align<B>: Alignment,
{
	/// Creates a new `AllocChain` containing this allocator and `next`.
	pub const fn chain<T>(self, next: &T) -> AllocChain<'_, Self, T>
	where
		Self: Sized,
	{
		AllocChain::new(self, next)
	}
}