1 //! The arena, a fast but limited type of allocator.
3 //! Arenas are a type of allocator that destroy the objects within, all at
4 //! once, once the arena itself is destroyed. They do not support deallocation
5 //! of individual objects while the arena itself is still alive. The benefit
6 //! of an arena is very fast allocation; just a pointer bump.
8 //! This crate implements several kinds of arena.
11 html_root_url = "https://doc.rust-lang.org/nightly/nightly-rustc/",
12 test(no_crate_inject, attr(deny(warnings)))
14 #![feature(dropck_eyepatch)]
15 #![feature(new_uninit)]
16 #![feature(maybe_uninit_slice)]
17 #![feature(min_specialization)]
18 #![feature(decl_macro)]
19 #![feature(rustc_attrs)]
20 #![cfg_attr(test, feature(test))]
22 use rustc_data_structures::sync;
23 use smallvec::SmallVec;
25 use std::alloc::Layout;
26 use std::cell::{Cell, RefCell};
28 use std::marker::{PhantomData, Send};
29 use std::mem::{self, MaybeUninit};
35 fn cold_path<F: FnOnce() -> R, R>(f: F) -> R {
39 /// An arena that can hold objects of only one type.
40 pub struct TypedArena<T> {
41 /// A pointer to the next object to be allocated.
44 /// A pointer to the end of the allocated area. When this pointer is
45 /// reached, a new chunk is allocated.
48 /// A vector of arena chunks.
49 chunks: RefCell<Vec<TypedArenaChunk<T>>>,
51 /// Marker indicating that dropping the arena causes its owned
52 /// instances of `T` to be dropped.
56 struct TypedArenaChunk<T> {
57 /// The raw storage for the arena chunk.
58 storage: Box<[MaybeUninit<T>]>,
59 /// The number of valid entries in the chunk.
63 impl<T> TypedArenaChunk<T> {
65 unsafe fn new(capacity: usize) -> TypedArenaChunk<T> {
66 TypedArenaChunk { storage: Box::new_uninit_slice(capacity), entries: 0 }
69 /// Destroys this arena chunk.
71 unsafe fn destroy(&mut self, len: usize) {
72 // The branch on needs_drop() is an -O1 performance optimization.
73 // Without the branch, dropping TypedArena<u8> takes linear time.
74 if mem::needs_drop::<T>() {
75 ptr::drop_in_place(MaybeUninit::slice_assume_init_mut(&mut self.storage[..len]));
79 // Returns a pointer to the first allocated object.
81 fn start(&mut self) -> *mut T {
82 MaybeUninit::slice_as_mut_ptr(&mut self.storage)
85 // Returns a pointer to the end of the allocated space.
87 fn end(&mut self) -> *mut T {
89 if mem::size_of::<T>() == 0 {
90 // A pointer as large as possible for zero-sized elements.
93 self.start().add(self.storage.len())
99 // The arenas start with PAGE-sized chunks, and then each new chunk is twice as
100 // big as its predecessor, up until we reach HUGE_PAGE-sized chunks, whereupon
101 // we stop growing. This scales well, from arenas that are barely used up to
102 // arenas that are used for 100s of MiBs. Note also that the chosen sizes match
103 // the usual sizes of pages and huge pages on Linux.
104 const PAGE: usize = 4096;
105 const HUGE_PAGE: usize = 2 * 1024 * 1024;
107 impl<T> Default for TypedArena<T> {
108 /// Creates a new `TypedArena`.
109 fn default() -> TypedArena<T> {
111 // We set both `ptr` and `end` to 0 so that the first call to
112 // alloc() will trigger a grow().
113 ptr: Cell::new(ptr::null_mut()),
114 end: Cell::new(ptr::null_mut()),
115 chunks: RefCell::new(vec![]),
122 fn alloc_from_iter(self, arena: &TypedArena<T>) -> &mut [T];
125 impl<I, T> IterExt<T> for I
127 I: IntoIterator<Item = T>,
130 default fn alloc_from_iter(self, arena: &TypedArena<T>) -> &mut [T] {
131 let vec: SmallVec<[_; 8]> = self.into_iter().collect();
132 vec.alloc_from_iter(arena)
136 impl<T, const N: usize> IterExt<T> for std::array::IntoIter<T, N> {
138 fn alloc_from_iter(self, arena: &TypedArena<T>) -> &mut [T] {
139 let len = self.len();
143 // Move the content to the arena by copying and then forgetting it
145 let start_ptr = arena.alloc_raw_slice(len);
146 self.as_slice().as_ptr().copy_to_nonoverlapping(start_ptr, len);
148 slice::from_raw_parts_mut(start_ptr, len)
153 impl<T> IterExt<T> for Vec<T> {
155 fn alloc_from_iter(mut self, arena: &TypedArena<T>) -> &mut [T] {
156 let len = self.len();
160 // Move the content to the arena by copying and then forgetting it
162 let start_ptr = arena.alloc_raw_slice(len);
163 self.as_ptr().copy_to_nonoverlapping(start_ptr, len);
165 slice::from_raw_parts_mut(start_ptr, len)
170 impl<A: smallvec::Array> IterExt<A::Item> for SmallVec<A> {
172 fn alloc_from_iter(mut self, arena: &TypedArena<A::Item>) -> &mut [A::Item] {
173 let len = self.len();
177 // Move the content to the arena by copying and then forgetting it
179 let start_ptr = arena.alloc_raw_slice(len);
180 self.as_ptr().copy_to_nonoverlapping(start_ptr, len);
182 slice::from_raw_parts_mut(start_ptr, len)
187 impl<T> TypedArena<T> {
188 /// Allocates an object in the `TypedArena`, returning a reference to it.
190 pub fn alloc(&self, object: T) -> &mut T {
191 if self.ptr == self.end {
196 if mem::size_of::<T>() == 0 {
197 self.ptr.set((self.ptr.get() as *mut u8).wrapping_offset(1) as *mut T);
198 let ptr = mem::align_of::<T>() as *mut T;
199 // Don't drop the object. This `write` is equivalent to `forget`.
200 ptr::write(ptr, object);
203 let ptr = self.ptr.get();
204 // Advance the pointer.
205 self.ptr.set(self.ptr.get().offset(1));
206 // Write into uninitialized memory.
207 ptr::write(ptr, object);
214 fn can_allocate(&self, additional: usize) -> bool {
215 let available_bytes = self.end.get() as usize - self.ptr.get() as usize;
216 let additional_bytes = additional.checked_mul(mem::size_of::<T>()).unwrap();
217 available_bytes >= additional_bytes
220 /// Ensures there's enough space in the current chunk to fit `len` objects.
222 fn ensure_capacity(&self, additional: usize) {
223 if !self.can_allocate(additional) {
224 self.grow(additional);
225 debug_assert!(self.can_allocate(additional));
230 unsafe fn alloc_raw_slice(&self, len: usize) -> *mut T {
231 assert!(mem::size_of::<T>() != 0);
234 self.ensure_capacity(len);
236 let start_ptr = self.ptr.get();
237 self.ptr.set(start_ptr.add(len));
242 pub fn alloc_from_iter<I: IntoIterator<Item = T>>(&self, iter: I) -> &mut [T] {
243 assert!(mem::size_of::<T>() != 0);
244 iter.alloc_from_iter(self)
250 fn grow(&self, additional: usize) {
252 // We need the element size to convert chunk sizes (ranging from
253 // PAGE to HUGE_PAGE bytes) to element counts.
254 let elem_size = cmp::max(1, mem::size_of::<T>());
255 let mut chunks = self.chunks.borrow_mut();
257 if let Some(last_chunk) = chunks.last_mut() {
258 // If a type is `!needs_drop`, we don't need to keep track of how many elements
259 // the chunk stores - the field will be ignored anyway.
260 if mem::needs_drop::<T>() {
261 let used_bytes = self.ptr.get() as usize - last_chunk.start() as usize;
262 last_chunk.entries = used_bytes / mem::size_of::<T>();
265 // If the previous chunk's len is less than HUGE_PAGE
266 // bytes, then this chunk will be least double the previous
268 new_cap = last_chunk.storage.len().min(HUGE_PAGE / elem_size / 2);
271 new_cap = PAGE / elem_size;
273 // Also ensure that this chunk can fit `additional`.
274 new_cap = cmp::max(additional, new_cap);
276 let mut chunk = TypedArenaChunk::<T>::new(new_cap);
277 self.ptr.set(chunk.start());
278 self.end.set(chunk.end());
283 // Drops the contents of the last chunk. The last chunk is partially empty, unlike all other
285 fn clear_last_chunk(&self, last_chunk: &mut TypedArenaChunk<T>) {
286 // Determine how much was filled.
287 let start = last_chunk.start() as usize;
288 // We obtain the value of the pointer to the first uninitialized element.
289 let end = self.ptr.get() as usize;
290 // We then calculate the number of elements to be dropped in the last chunk,
291 // which is the filled area's length.
292 let diff = if mem::size_of::<T>() == 0 {
293 // `T` is ZST. It can't have a drop flag, so the value here doesn't matter. We get
294 // the number of zero-sized values in the last and only chunk, just out of caution.
295 // Recall that `end` was incremented for each allocated value.
298 (end - start) / mem::size_of::<T>()
300 // Pass that to the `destroy` method.
302 last_chunk.destroy(diff);
305 self.ptr.set(last_chunk.start());
309 unsafe impl<#[may_dangle] T> Drop for TypedArena<T> {
312 // Determine how much was filled.
313 let mut chunks_borrow = self.chunks.borrow_mut();
314 if let Some(mut last_chunk) = chunks_borrow.pop() {
315 // Drop the contents of the last chunk.
316 self.clear_last_chunk(&mut last_chunk);
317 // The last chunk will be dropped. Destroy all other chunks.
318 for chunk in chunks_borrow.iter_mut() {
319 chunk.destroy(chunk.entries);
322 // Box handles deallocation of `last_chunk` and `self.chunks`.
327 unsafe impl<T: Send> Send for TypedArena<T> {}
329 pub struct DroplessArena {
330 /// A pointer to the start of the free space.
331 start: Cell<*mut u8>,
333 /// A pointer to the end of free space.
335 /// The allocation proceeds from the end of the chunk towards the start.
336 /// When this pointer crosses the start pointer, a new chunk is allocated.
339 /// A vector of arena chunks.
340 chunks: RefCell<Vec<TypedArenaChunk<u8>>>,
343 unsafe impl Send for DroplessArena {}
345 impl Default for DroplessArena {
347 fn default() -> DroplessArena {
349 start: Cell::new(ptr::null_mut()),
350 end: Cell::new(ptr::null_mut()),
351 chunks: Default::default(),
359 fn grow(&self, additional: usize) {
361 let mut chunks = self.chunks.borrow_mut();
363 if let Some(last_chunk) = chunks.last_mut() {
364 // There is no need to update `last_chunk.entries` because that
365 // field isn't used by `DroplessArena`.
367 // If the previous chunk's len is less than HUGE_PAGE
368 // bytes, then this chunk will be least double the previous
370 new_cap = last_chunk.storage.len().min(HUGE_PAGE / 2);
375 // Also ensure that this chunk can fit `additional`.
376 new_cap = cmp::max(additional, new_cap);
378 let mut chunk = TypedArenaChunk::<u8>::new(new_cap);
379 self.start.set(chunk.start());
380 self.end.set(chunk.end());
385 /// Allocates a byte slice with specified layout from the current memory
386 /// chunk. Returns `None` if there is no free space left to satisfy the
389 fn alloc_raw_without_grow(&self, layout: Layout) -> Option<*mut u8> {
390 let start = self.start.get() as usize;
391 let end = self.end.get() as usize;
393 let align = layout.align();
394 let bytes = layout.size();
396 let new_end = end.checked_sub(bytes)? & !(align - 1);
397 if start <= new_end {
398 let new_end = new_end as *mut u8;
399 self.end.set(new_end);
407 pub fn alloc_raw(&self, layout: Layout) -> *mut u8 {
408 assert!(layout.size() != 0);
410 if let Some(a) = self.alloc_raw_without_grow(layout) {
413 // No free space left. Allocate a new chunk to satisfy the request.
414 // On failure the grow will panic or abort.
415 self.grow(layout.size());
420 pub fn alloc<T>(&self, object: T) -> &mut T {
421 assert!(!mem::needs_drop::<T>());
423 let mem = self.alloc_raw(Layout::for_value::<T>(&object)) as *mut T;
426 // Write into uninitialized memory.
427 ptr::write(mem, object);
432 /// Allocates a slice of objects that are copied into the `DroplessArena`, returning a mutable
433 /// reference to it. Will panic if passed a zero-sized type.
437 /// - Zero-sized types
438 /// - Zero-length slices
440 pub fn alloc_slice<T>(&self, slice: &[T]) -> &mut [T]
444 assert!(!mem::needs_drop::<T>());
445 assert!(mem::size_of::<T>() != 0);
446 assert!(!slice.is_empty());
448 let mem = self.alloc_raw(Layout::for_value::<[T]>(slice)) as *mut T;
451 mem.copy_from_nonoverlapping(slice.as_ptr(), slice.len());
452 slice::from_raw_parts_mut(mem, slice.len())
457 unsafe fn write_from_iter<T, I: Iterator<Item = T>>(
464 // Use a manual loop since LLVM manages to optimize it better for
467 let value = iter.next();
468 if i >= len || value.is_none() {
469 // We only return as many items as the iterator gave us, even
470 // though it was supposed to give us `len`
471 return slice::from_raw_parts_mut(mem, i);
473 ptr::write(mem.add(i), value.unwrap());
479 pub fn alloc_from_iter<T, I: IntoIterator<Item = T>>(&self, iter: I) -> &mut [T] {
480 let iter = iter.into_iter();
481 assert!(mem::size_of::<T>() != 0);
482 assert!(!mem::needs_drop::<T>());
484 let size_hint = iter.size_hint();
487 (min, Some(max)) if min == max => {
488 // We know the exact number of elements the iterator will produce here
495 let mem = self.alloc_raw(Layout::array::<T>(len).unwrap()) as *mut T;
496 unsafe { self.write_from_iter(iter, len, mem) }
499 cold_path(move || -> &mut [T] {
500 let mut vec: SmallVec<[_; 8]> = iter.collect();
504 // Move the content to the arena by copying it and then forgetting
505 // the content of the SmallVec
509 self.alloc_raw(Layout::for_value::<[T]>(vec.as_slice())) as *mut T;
510 vec.as_ptr().copy_to_nonoverlapping(start_ptr, len);
512 slice::from_raw_parts_mut(start_ptr, len)
520 /// Calls the destructor for an object when dropped.
522 drop_fn: unsafe fn(*mut u8),
526 // SAFETY: we require `T: Send` before type-erasing into `DropType`.
527 #[cfg(parallel_compiler)]
528 unsafe impl sync::Send for DropType {}
532 unsafe fn new<T: sync::Send>(obj: *mut T) -> Self {
533 unsafe fn drop_for_type<T>(to_drop: *mut u8) {
534 std::ptr::drop_in_place(to_drop as *mut T)
537 DropType { drop_fn: drop_for_type::<T>, obj: obj as *mut u8 }
541 impl Drop for DropType {
543 unsafe { (self.drop_fn)(self.obj) }
547 /// An arena which can be used to allocate any type.
551 /// Allocating in this arena is unsafe since the type system
552 /// doesn't know which types it contains. In order to
553 /// allocate safely, you must store a `PhantomData<T>`
554 /// alongside this arena for each type `T` you allocate.
556 pub struct DropArena {
557 /// A list of destructors to run when the arena drops.
558 /// Ordered so `destructors` gets dropped before the arena
559 /// since its destructor can reference memory in the arena.
560 destructors: RefCell<Vec<DropType>>,
561 arena: DroplessArena,
566 pub unsafe fn alloc<T>(&self, object: T) -> &mut T
570 let mem = self.arena.alloc_raw(Layout::new::<T>()) as *mut T;
571 // Write into uninitialized memory.
572 ptr::write(mem, object);
573 let result = &mut *mem;
574 // Record the destructor after doing the allocation as that may panic
575 // and would cause `object`'s destructor to run twice if it was recorded before.
576 self.destructors.borrow_mut().push(DropType::new(result));
581 pub unsafe fn alloc_from_iter<T, I>(&self, iter: I) -> &mut [T]
584 I: IntoIterator<Item = T>,
586 let mut vec: SmallVec<[_; 8]> = iter.into_iter().collect();
592 let start_ptr = self.arena.alloc_raw(Layout::array::<T>(len).unwrap()) as *mut T;
594 let mut destructors = self.destructors.borrow_mut();
595 // Reserve space for the destructors so we can't panic while adding them.
596 destructors.reserve(len);
598 // Move the content to the arena by copying it and then forgetting
599 // the content of the SmallVec.
600 vec.as_ptr().copy_to_nonoverlapping(start_ptr, len);
601 mem::forget(vec.drain(..));
603 // Record the destructors after doing the allocation as that may panic
604 // and would cause `object`'s destructor to run twice if it was recorded before.
606 destructors.push(DropType::new(start_ptr.add(i)));
609 slice::from_raw_parts_mut(start_ptr, len)
613 pub macro arena_for_type {
615 $crate::TypedArena<$ty>
617 ([few $(, $attrs:ident)*][$ty:ty]) => {
618 ::std::marker::PhantomData<$ty>
620 ([$ignore:ident $(, $attrs:ident)*]$args:tt) => {
621 $crate::arena_for_type!([$($attrs),*]$args)
625 pub macro which_arena_for_type {
626 ([][$arena:expr]) => {
627 ::std::option::Option::Some($arena)
629 ([few$(, $attrs:ident)*][$arena:expr]) => {
630 ::std::option::Option::None
632 ([$ignore:ident$(, $attrs:ident)*]$args:tt) => {
633 $crate::which_arena_for_type!([$($attrs),*]$args)
637 #[rustc_macro_transparency = "semitransparent"]
638 pub macro declare_arena([$($a:tt $name:ident: $ty:ty,)*], $tcx:lifetime) {
640 pub struct Arena<$tcx> {
641 pub dropless: $crate::DroplessArena,
642 drop: $crate::DropArena,
643 $($name: $crate::arena_for_type!($a[$ty]),)*
646 pub trait ArenaAllocatable<'tcx, T = Self>: Sized {
647 fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut Self;
648 fn allocate_from_iter<'a>(
649 arena: &'a Arena<'tcx>,
650 iter: impl ::std::iter::IntoIterator<Item = Self>,
654 impl<'tcx, T: Copy> ArenaAllocatable<'tcx, ()> for T {
656 fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut Self {
657 arena.dropless.alloc(self)
660 fn allocate_from_iter<'a>(
661 arena: &'a Arena<'tcx>,
662 iter: impl ::std::iter::IntoIterator<Item = Self>,
663 ) -> &'a mut [Self] {
664 arena.dropless.alloc_from_iter(iter)
669 impl<$tcx> ArenaAllocatable<$tcx, $ty> for $ty {
671 fn allocate_on<'a>(self, arena: &'a Arena<$tcx>) -> &'a mut Self {
672 if !::std::mem::needs_drop::<Self>() {
673 return arena.dropless.alloc(self);
675 match $crate::which_arena_for_type!($a[&arena.$name]) {
676 ::std::option::Option::<&$crate::TypedArena<Self>>::Some(ty_arena) => {
679 ::std::option::Option::None => unsafe { arena.drop.alloc(self) },
684 fn allocate_from_iter<'a>(
685 arena: &'a Arena<$tcx>,
686 iter: impl ::std::iter::IntoIterator<Item = Self>,
687 ) -> &'a mut [Self] {
688 if !::std::mem::needs_drop::<Self>() {
689 return arena.dropless.alloc_from_iter(iter);
691 match $crate::which_arena_for_type!($a[&arena.$name]) {
692 ::std::option::Option::<&$crate::TypedArena<Self>>::Some(ty_arena) => {
693 ty_arena.alloc_from_iter(iter)
695 ::std::option::Option::None => unsafe { arena.drop.alloc_from_iter(iter) },
701 impl<'tcx> Arena<'tcx> {
703 pub fn alloc<T: ArenaAllocatable<'tcx, U>, U>(&self, value: T) -> &mut T {
704 value.allocate_on(self)
708 pub fn alloc_slice<T: ::std::marker::Copy>(&self, value: &[T]) -> &mut [T] {
709 if value.is_empty() {
712 self.dropless.alloc_slice(value)
715 pub fn alloc_from_iter<'a, T: ArenaAllocatable<'tcx, U>, U>(
717 iter: impl ::std::iter::IntoIterator<Item = T>,
719 T::allocate_from_iter(self, iter)