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 #![cfg_attr(test, feature(test))]
20 use rustc_data_structures::sync;
21 use smallvec::SmallVec;
23 use std::alloc::Layout;
24 use std::cell::{Cell, RefCell};
26 use std::marker::{PhantomData, Send};
27 use std::mem::{self, MaybeUninit};
33 fn cold_path<F: FnOnce() -> R, R>(f: F) -> R {
37 /// An arena that can hold objects of only one type.
38 pub struct TypedArena<T> {
39 /// A pointer to the next object to be allocated.
42 /// A pointer to the end of the allocated area. When this pointer is
43 /// reached, a new chunk is allocated.
46 /// A vector of arena chunks.
47 chunks: RefCell<Vec<TypedArenaChunk<T>>>,
49 /// Marker indicating that dropping the arena causes its owned
50 /// instances of `T` to be dropped.
54 struct TypedArenaChunk<T> {
55 /// The raw storage for the arena chunk.
56 storage: Box<[MaybeUninit<T>]>,
57 /// The number of valid entries in the chunk.
61 impl<T> TypedArenaChunk<T> {
63 unsafe fn new(capacity: usize) -> TypedArenaChunk<T> {
64 TypedArenaChunk { storage: Box::new_uninit_slice(capacity), entries: 0 }
67 /// Destroys this arena chunk.
69 unsafe fn destroy(&mut self, len: usize) {
70 // The branch on needs_drop() is an -O1 performance optimization.
71 // Without the branch, dropping TypedArena<u8> takes linear time.
72 if mem::needs_drop::<T>() {
73 ptr::drop_in_place(MaybeUninit::slice_assume_init_mut(&mut self.storage[..len]));
77 // Returns a pointer to the first allocated object.
79 fn start(&mut self) -> *mut T {
80 MaybeUninit::slice_as_mut_ptr(&mut self.storage)
83 // Returns a pointer to the end of the allocated space.
85 fn end(&mut self) -> *mut T {
87 if mem::size_of::<T>() == 0 {
88 // A pointer as large as possible for zero-sized elements.
91 self.start().add(self.storage.len())
97 // The arenas start with PAGE-sized chunks, and then each new chunk is twice as
98 // big as its predecessor, up until we reach HUGE_PAGE-sized chunks, whereupon
99 // we stop growing. This scales well, from arenas that are barely used up to
100 // arenas that are used for 100s of MiBs. Note also that the chosen sizes match
101 // the usual sizes of pages and huge pages on Linux.
102 const PAGE: usize = 4096;
103 const HUGE_PAGE: usize = 2 * 1024 * 1024;
105 impl<T> Default for TypedArena<T> {
106 /// Creates a new `TypedArena`.
107 fn default() -> TypedArena<T> {
109 // We set both `ptr` and `end` to 0 so that the first call to
110 // alloc() will trigger a grow().
111 ptr: Cell::new(ptr::null_mut()),
112 end: Cell::new(ptr::null_mut()),
113 chunks: RefCell::new(vec![]),
120 fn alloc_from_iter(self, arena: &TypedArena<T>) -> &mut [T];
123 impl<I, T> IterExt<T> for I
125 I: IntoIterator<Item = T>,
128 default fn alloc_from_iter(self, arena: &TypedArena<T>) -> &mut [T] {
129 let vec: SmallVec<[_; 8]> = self.into_iter().collect();
130 vec.alloc_from_iter(arena)
134 impl<T, const N: usize> IterExt<T> for std::array::IntoIter<T, N> {
136 fn alloc_from_iter(self, arena: &TypedArena<T>) -> &mut [T] {
137 let len = self.len();
141 // Move the content to the arena by copying and then forgetting it
143 let start_ptr = arena.alloc_raw_slice(len);
144 self.as_slice().as_ptr().copy_to_nonoverlapping(start_ptr, len);
146 slice::from_raw_parts_mut(start_ptr, len)
151 impl<T> IterExt<T> for Vec<T> {
153 fn alloc_from_iter(mut self, arena: &TypedArena<T>) -> &mut [T] {
154 let len = self.len();
158 // Move the content to the arena by copying and then forgetting it
160 let start_ptr = arena.alloc_raw_slice(len);
161 self.as_ptr().copy_to_nonoverlapping(start_ptr, len);
163 slice::from_raw_parts_mut(start_ptr, len)
168 impl<A: smallvec::Array> IterExt<A::Item> for SmallVec<A> {
170 fn alloc_from_iter(mut self, arena: &TypedArena<A::Item>) -> &mut [A::Item] {
171 let len = self.len();
175 // Move the content to the arena by copying and then forgetting it
177 let start_ptr = arena.alloc_raw_slice(len);
178 self.as_ptr().copy_to_nonoverlapping(start_ptr, len);
180 slice::from_raw_parts_mut(start_ptr, len)
185 impl<T> TypedArena<T> {
186 /// Allocates an object in the `TypedArena`, returning a reference to it.
188 pub fn alloc(&self, object: T) -> &mut T {
189 if self.ptr == self.end {
194 if mem::size_of::<T>() == 0 {
195 self.ptr.set((self.ptr.get() as *mut u8).wrapping_offset(1) as *mut T);
196 let ptr = mem::align_of::<T>() as *mut T;
197 // Don't drop the object. This `write` is equivalent to `forget`.
198 ptr::write(ptr, object);
201 let ptr = self.ptr.get();
202 // Advance the pointer.
203 self.ptr.set(self.ptr.get().offset(1));
204 // Write into uninitialized memory.
205 ptr::write(ptr, object);
212 fn can_allocate(&self, additional: usize) -> bool {
213 let available_bytes = self.end.get() as usize - self.ptr.get() as usize;
214 let additional_bytes = additional.checked_mul(mem::size_of::<T>()).unwrap();
215 available_bytes >= additional_bytes
218 /// Ensures there's enough space in the current chunk to fit `len` objects.
220 fn ensure_capacity(&self, additional: usize) {
221 if !self.can_allocate(additional) {
222 self.grow(additional);
223 debug_assert!(self.can_allocate(additional));
228 unsafe fn alloc_raw_slice(&self, len: usize) -> *mut T {
229 assert!(mem::size_of::<T>() != 0);
232 self.ensure_capacity(len);
234 let start_ptr = self.ptr.get();
235 self.ptr.set(start_ptr.add(len));
239 /// Allocates a slice of objects that are copied into the `TypedArena`, returning a mutable
240 /// reference to it. Will panic if passed a zero-sized types.
244 /// - Zero-sized types
245 /// - Zero-length slices
247 pub fn alloc_slice(&self, slice: &[T]) -> &mut [T]
252 let len = slice.len();
253 let start_ptr = self.alloc_raw_slice(len);
254 slice.as_ptr().copy_to_nonoverlapping(start_ptr, len);
255 slice::from_raw_parts_mut(start_ptr, len)
260 pub fn alloc_from_iter<I: IntoIterator<Item = T>>(&self, iter: I) -> &mut [T] {
261 assert!(mem::size_of::<T>() != 0);
262 iter.alloc_from_iter(self)
268 fn grow(&self, additional: usize) {
270 // We need the element size to convert chunk sizes (ranging from
271 // PAGE to HUGE_PAGE bytes) to element counts.
272 let elem_size = cmp::max(1, mem::size_of::<T>());
273 let mut chunks = self.chunks.borrow_mut();
275 if let Some(last_chunk) = chunks.last_mut() {
276 // If a type is `!needs_drop`, we don't need to keep track of how many elements
277 // the chunk stores - the field will be ignored anyway.
278 if mem::needs_drop::<T>() {
279 let used_bytes = self.ptr.get() as usize - last_chunk.start() as usize;
280 last_chunk.entries = used_bytes / mem::size_of::<T>();
283 // If the previous chunk's len is less than HUGE_PAGE
284 // bytes, then this chunk will be least double the previous
286 new_cap = last_chunk.storage.len().min(HUGE_PAGE / elem_size / 2);
289 new_cap = PAGE / elem_size;
291 // Also ensure that this chunk can fit `additional`.
292 new_cap = cmp::max(additional, new_cap);
294 let mut chunk = TypedArenaChunk::<T>::new(new_cap);
295 self.ptr.set(chunk.start());
296 self.end.set(chunk.end());
301 /// Clears the arena. Deallocates all but the longest chunk which may be reused.
302 pub fn clear(&mut self) {
304 // Clear the last chunk, which is partially filled.
305 let mut chunks_borrow = self.chunks.borrow_mut();
306 if let Some(mut last_chunk) = chunks_borrow.last_mut() {
307 self.clear_last_chunk(&mut last_chunk);
308 let len = chunks_borrow.len();
309 // If `T` is ZST, code below has no effect.
310 for mut chunk in chunks_borrow.drain(..len - 1) {
311 chunk.destroy(chunk.entries);
317 // Drops the contents of the last chunk. The last chunk is partially empty, unlike all other
319 fn clear_last_chunk(&self, last_chunk: &mut TypedArenaChunk<T>) {
320 // Determine how much was filled.
321 let start = last_chunk.start() as usize;
322 // We obtain the value of the pointer to the first uninitialized element.
323 let end = self.ptr.get() as usize;
324 // We then calculate the number of elements to be dropped in the last chunk,
325 // which is the filled area's length.
326 let diff = if mem::size_of::<T>() == 0 {
327 // `T` is ZST. It can't have a drop flag, so the value here doesn't matter. We get
328 // the number of zero-sized values in the last and only chunk, just out of caution.
329 // Recall that `end` was incremented for each allocated value.
332 (end - start) / mem::size_of::<T>()
334 // Pass that to the `destroy` method.
336 last_chunk.destroy(diff);
339 self.ptr.set(last_chunk.start());
343 unsafe impl<#[may_dangle] T> Drop for TypedArena<T> {
346 // Determine how much was filled.
347 let mut chunks_borrow = self.chunks.borrow_mut();
348 if let Some(mut last_chunk) = chunks_borrow.pop() {
349 // Drop the contents of the last chunk.
350 self.clear_last_chunk(&mut last_chunk);
351 // The last chunk will be dropped. Destroy all other chunks.
352 for chunk in chunks_borrow.iter_mut() {
353 chunk.destroy(chunk.entries);
356 // Box handles deallocation of `last_chunk` and `self.chunks`.
361 unsafe impl<T: Send> Send for TypedArena<T> {}
363 pub struct DroplessArena {
364 /// A pointer to the start of the free space.
365 start: Cell<*mut u8>,
367 /// A pointer to the end of free space.
369 /// The allocation proceeds from the end of the chunk towards the start.
370 /// When this pointer crosses the start pointer, a new chunk is allocated.
373 /// A vector of arena chunks.
374 chunks: RefCell<Vec<TypedArenaChunk<u8>>>,
377 unsafe impl Send for DroplessArena {}
379 impl Default for DroplessArena {
381 fn default() -> DroplessArena {
383 start: Cell::new(ptr::null_mut()),
384 end: Cell::new(ptr::null_mut()),
385 chunks: Default::default(),
393 fn grow(&self, additional: usize) {
395 let mut chunks = self.chunks.borrow_mut();
397 if let Some(last_chunk) = chunks.last_mut() {
398 // There is no need to update `last_chunk.entries` because that
399 // field isn't used by `DroplessArena`.
401 // If the previous chunk's len is less than HUGE_PAGE
402 // bytes, then this chunk will be least double the previous
404 new_cap = last_chunk.storage.len().min(HUGE_PAGE / 2);
409 // Also ensure that this chunk can fit `additional`.
410 new_cap = cmp::max(additional, new_cap);
412 let mut chunk = TypedArenaChunk::<u8>::new(new_cap);
413 self.start.set(chunk.start());
414 self.end.set(chunk.end());
419 /// Allocates a byte slice with specified layout from the current memory
420 /// chunk. Returns `None` if there is no free space left to satisfy the
423 fn alloc_raw_without_grow(&self, layout: Layout) -> Option<*mut u8> {
424 let start = self.start.get() as usize;
425 let end = self.end.get() as usize;
427 let align = layout.align();
428 let bytes = layout.size();
430 let new_end = end.checked_sub(bytes)? & !(align - 1);
431 if start <= new_end {
432 let new_end = new_end as *mut u8;
433 self.end.set(new_end);
441 pub fn alloc_raw(&self, layout: Layout) -> *mut u8 {
442 assert!(layout.size() != 0);
444 if let Some(a) = self.alloc_raw_without_grow(layout) {
447 // No free space left. Allocate a new chunk to satisfy the request.
448 // On failure the grow will panic or abort.
449 self.grow(layout.size());
454 pub fn alloc<T>(&self, object: T) -> &mut T {
455 assert!(!mem::needs_drop::<T>());
457 let mem = self.alloc_raw(Layout::for_value::<T>(&object)) as *mut T;
460 // Write into uninitialized memory.
461 ptr::write(mem, object);
466 /// Allocates a slice of objects that are copied into the `DroplessArena`, returning a mutable
467 /// reference to it. Will panic if passed a zero-sized type.
471 /// - Zero-sized types
472 /// - Zero-length slices
474 pub fn alloc_slice<T>(&self, slice: &[T]) -> &mut [T]
478 assert!(!mem::needs_drop::<T>());
479 assert!(mem::size_of::<T>() != 0);
480 assert!(!slice.is_empty());
482 let mem = self.alloc_raw(Layout::for_value::<[T]>(slice)) as *mut T;
485 mem.copy_from_nonoverlapping(slice.as_ptr(), slice.len());
486 slice::from_raw_parts_mut(mem, slice.len())
491 unsafe fn write_from_iter<T, I: Iterator<Item = T>>(
498 // Use a manual loop since LLVM manages to optimize it better for
501 let value = iter.next();
502 if i >= len || value.is_none() {
503 // We only return as many items as the iterator gave us, even
504 // though it was supposed to give us `len`
505 return slice::from_raw_parts_mut(mem, i);
507 ptr::write(mem.add(i), value.unwrap());
513 pub fn alloc_from_iter<T, I: IntoIterator<Item = T>>(&self, iter: I) -> &mut [T] {
514 let iter = iter.into_iter();
515 assert!(mem::size_of::<T>() != 0);
516 assert!(!mem::needs_drop::<T>());
518 let size_hint = iter.size_hint();
521 (min, Some(max)) if min == max => {
522 // We know the exact number of elements the iterator will produce here
529 let mem = self.alloc_raw(Layout::array::<T>(len).unwrap()) as *mut T;
530 unsafe { self.write_from_iter(iter, len, mem) }
533 cold_path(move || -> &mut [T] {
534 let mut vec: SmallVec<[_; 8]> = iter.collect();
538 // Move the content to the arena by copying it and then forgetting
539 // the content of the SmallVec
543 self.alloc_raw(Layout::for_value::<[T]>(vec.as_slice())) as *mut T;
544 vec.as_ptr().copy_to_nonoverlapping(start_ptr, len);
546 slice::from_raw_parts_mut(start_ptr, len)
554 /// Calls the destructor for an object when dropped.
556 drop_fn: unsafe fn(*mut u8),
560 // SAFETY: we require `T: Send` before type-erasing into `DropType`.
561 #[cfg(parallel_compiler)]
562 unsafe impl sync::Send for DropType {}
566 unsafe fn new<T: sync::Send>(obj: *mut T) -> Self {
567 unsafe fn drop_for_type<T>(to_drop: *mut u8) {
568 std::ptr::drop_in_place(to_drop as *mut T)
571 DropType { drop_fn: drop_for_type::<T>, obj: obj as *mut u8 }
575 impl Drop for DropType {
577 unsafe { (self.drop_fn)(self.obj) }
581 /// An arena which can be used to allocate any type.
585 /// Allocating in this arena is unsafe since the type system
586 /// doesn't know which types it contains. In order to
587 /// allocate safely, you must store a `PhantomData<T>`
588 /// alongside this arena for each type `T` you allocate.
590 pub struct DropArena {
591 /// A list of destructors to run when the arena drops.
592 /// Ordered so `destructors` gets dropped before the arena
593 /// since its destructor can reference memory in the arena.
594 destructors: RefCell<Vec<DropType>>,
595 arena: DroplessArena,
600 pub unsafe fn alloc<T>(&self, object: T) -> &mut T
604 let mem = self.arena.alloc_raw(Layout::new::<T>()) as *mut T;
605 // Write into uninitialized memory.
606 ptr::write(mem, object);
607 let result = &mut *mem;
608 // Record the destructor after doing the allocation as that may panic
609 // and would cause `object`'s destructor to run twice if it was recorded before.
610 self.destructors.borrow_mut().push(DropType::new(result));
615 pub unsafe fn alloc_from_iter<T, I>(&self, iter: I) -> &mut [T]
618 I: IntoIterator<Item = T>,
620 let mut vec: SmallVec<[_; 8]> = iter.into_iter().collect();
626 let start_ptr = self.arena.alloc_raw(Layout::array::<T>(len).unwrap()) as *mut T;
628 let mut destructors = self.destructors.borrow_mut();
629 // Reserve space for the destructors so we can't panic while adding them.
630 destructors.reserve(len);
632 // Move the content to the arena by copying it and then forgetting
633 // the content of the SmallVec.
634 vec.as_ptr().copy_to_nonoverlapping(start_ptr, len);
635 mem::forget(vec.drain(..));
637 // Record the destructors after doing the allocation as that may panic
638 // and would cause `object`'s destructor to run twice if it was recorded before.
640 destructors.push(DropType::new(start_ptr.add(i)));
643 slice::from_raw_parts_mut(start_ptr, len)
648 macro_rules! arena_for_type {
650 $crate::TypedArena<$ty>
652 ([few $(, $attrs:ident)*][$ty:ty]) => {
653 ::std::marker::PhantomData<$ty>
655 ([$ignore:ident $(, $attrs:ident)*]$args:tt) => {
656 $crate::arena_for_type!([$($attrs),*]$args)
661 macro_rules! which_arena_for_type {
662 ([][$arena:expr]) => {
663 ::std::option::Option::Some($arena)
665 ([few$(, $attrs:ident)*][$arena:expr]) => {
666 ::std::option::Option::None
668 ([$ignore:ident$(, $attrs:ident)*]$args:tt) => {
669 $crate::which_arena_for_type!([$($attrs),*]$args)
674 macro_rules! declare_arena {
675 ([], [$($a:tt $name:ident: $ty:ty,)*], $tcx:lifetime) => {
677 pub struct Arena<$tcx> {
678 pub dropless: $crate::DroplessArena,
679 drop: $crate::DropArena,
680 $($name: $crate::arena_for_type!($a[$ty]),)*
683 pub trait ArenaAllocatable<'tcx, T = Self>: Sized {
684 fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut Self;
685 fn allocate_from_iter<'a>(
686 arena: &'a Arena<'tcx>,
687 iter: impl ::std::iter::IntoIterator<Item = Self>,
691 impl<'tcx, T: Copy> ArenaAllocatable<'tcx, ()> for T {
693 fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut Self {
694 arena.dropless.alloc(self)
697 fn allocate_from_iter<'a>(
698 arena: &'a Arena<'tcx>,
699 iter: impl ::std::iter::IntoIterator<Item = Self>,
700 ) -> &'a mut [Self] {
701 arena.dropless.alloc_from_iter(iter)
706 impl<$tcx> ArenaAllocatable<$tcx, $ty> for $ty {
708 fn allocate_on<'a>(self, arena: &'a Arena<$tcx>) -> &'a mut Self {
709 if !::std::mem::needs_drop::<Self>() {
710 return arena.dropless.alloc(self);
712 match $crate::which_arena_for_type!($a[&arena.$name]) {
713 ::std::option::Option::<&$crate::TypedArena<Self>>::Some(ty_arena) => {
716 ::std::option::Option::None => unsafe { arena.drop.alloc(self) },
721 fn allocate_from_iter<'a>(
722 arena: &'a Arena<$tcx>,
723 iter: impl ::std::iter::IntoIterator<Item = Self>,
724 ) -> &'a mut [Self] {
725 if !::std::mem::needs_drop::<Self>() {
726 return arena.dropless.alloc_from_iter(iter);
728 match $crate::which_arena_for_type!($a[&arena.$name]) {
729 ::std::option::Option::<&$crate::TypedArena<Self>>::Some(ty_arena) => {
730 ty_arena.alloc_from_iter(iter)
732 ::std::option::Option::None => unsafe { arena.drop.alloc_from_iter(iter) },
738 impl<'tcx> Arena<'tcx> {
740 pub fn alloc<T: ArenaAllocatable<'tcx, U>, U>(&self, value: T) -> &mut T {
741 value.allocate_on(self)
745 pub fn alloc_slice<T: ::std::marker::Copy>(&self, value: &[T]) -> &mut [T] {
746 if value.is_empty() {
749 self.dropless.alloc_slice(value)
752 pub fn alloc_from_iter<'a, T: ArenaAllocatable<'tcx, U>, U>(
754 iter: impl ::std::iter::IntoIterator<Item = T>,
756 T::allocate_from_iter(self, iter)