4 use crate::num::NonZeroUsize;
5 use crate::ptr::NonNull;
7 const fn size_align<T>() -> (usize, usize) {
8 (mem::size_of::<T>(), mem::align_of::<T>())
11 /// Layout of a block of memory.
13 /// An instance of `Layout` describes a particular layout of memory.
14 /// You build a `Layout` up as an input to give to an allocator.
16 /// All layouts have an associated size and a power-of-two alignment.
18 /// (Note that layouts are *not* required to have non-zero size,
19 /// even though `GlobalAlloc` requires that all memory requests
20 /// be non-zero in size. A caller must either ensure that conditions
21 /// like this are met, use specific allocators with looser
22 /// requirements, or use the more lenient `AllocRef` interface.)
23 #[stable(feature = "alloc_layout", since = "1.28.0")]
24 #[derive(Copy, Clone, Debug, PartialEq, Eq)]
25 #[lang = "alloc_layout"]
27 // size of the requested block of memory, measured in bytes.
30 // alignment of the requested block of memory, measured in bytes.
31 // we ensure that this is always a power-of-two, because API's
32 // like `posix_memalign` require it and it is a reasonable
33 // constraint to impose on Layout constructors.
35 // (However, we do not analogously require `align >= sizeof(void*)`,
36 // even though that is *also* a requirement of `posix_memalign`.)
41 /// Constructs a `Layout` from a given `size` and `align`,
42 /// or returns `LayoutErr` if any of the following conditions
45 /// * `align` must not be zero,
47 /// * `align` must be a power of two,
49 /// * `size`, when rounded up to the nearest multiple of `align`,
50 /// must not overflow (i.e., the rounded value must be less than
51 /// or equal to `usize::MAX`).
52 #[stable(feature = "alloc_layout", since = "1.28.0")]
53 #[rustc_const_unstable(feature = "const_alloc_layout", issue = "67521")]
55 pub const fn from_size_align(size: usize, align: usize) -> Result<Self, LayoutErr> {
56 if !align.is_power_of_two() {
57 return Err(LayoutErr { private: () });
60 // (power-of-two implies align != 0.)
62 // Rounded up size is:
63 // size_rounded_up = (size + align - 1) & !(align - 1);
65 // We know from above that align != 0. If adding (align - 1)
66 // does not overflow, then rounding up will be fine.
68 // Conversely, &-masking with !(align - 1) will subtract off
69 // only low-order-bits. Thus if overflow occurs with the sum,
70 // the &-mask cannot subtract enough to undo that overflow.
72 // Above implies that checking for summation overflow is both
73 // necessary and sufficient.
74 if size > usize::MAX - (align - 1) {
75 return Err(LayoutErr { private: () });
78 // SAFETY: the conditions for `from_size_align_unchecked` have been
80 unsafe { Ok(Layout::from_size_align_unchecked(size, align)) }
83 /// Creates a layout, bypassing all checks.
87 /// This function is unsafe as it does not verify the preconditions from
88 /// [`Layout::from_size_align`].
89 #[stable(feature = "alloc_layout", since = "1.28.0")]
90 #[rustc_const_stable(feature = "alloc_layout", since = "1.28.0")]
92 pub const unsafe fn from_size_align_unchecked(size: usize, align: usize) -> Self {
93 // SAFETY: the caller must ensure that `align` is greater than zero.
94 Layout { size_: size, align_: unsafe { NonZeroUsize::new_unchecked(align) } }
97 /// The minimum size in bytes for a memory block of this layout.
98 #[stable(feature = "alloc_layout", since = "1.28.0")]
99 #[rustc_const_unstable(feature = "const_alloc_layout", issue = "67521")]
101 pub const fn size(&self) -> usize {
105 /// The minimum byte alignment for a memory block of this layout.
106 #[stable(feature = "alloc_layout", since = "1.28.0")]
107 #[rustc_const_unstable(feature = "const_alloc_layout", issue = "67521")]
109 pub const fn align(&self) -> usize {
113 /// Constructs a `Layout` suitable for holding a value of type `T`.
114 #[stable(feature = "alloc_layout", since = "1.28.0")]
115 #[rustc_const_stable(feature = "alloc_layout_const_new", since = "1.42.0")]
117 pub const fn new<T>() -> Self {
118 let (size, align) = size_align::<T>();
119 // SAFETY: the align is guaranteed by Rust to be a power of two and
120 // the size+align combo is guaranteed to fit in our address space. As a
121 // result use the unchecked constructor here to avoid inserting code
122 // that panics if it isn't optimized well enough.
123 unsafe { Layout::from_size_align_unchecked(size, align) }
126 /// Produces layout describing a record that could be used to
127 /// allocate backing structure for `T` (which could be a trait
128 /// or other unsized type like a slice).
129 #[stable(feature = "alloc_layout", since = "1.28.0")]
131 pub fn for_value<T: ?Sized>(t: &T) -> Self {
132 let (size, align) = (mem::size_of_val(t), mem::align_of_val(t));
133 debug_assert!(Layout::from_size_align(size, align).is_ok());
134 // SAFETY: see rationale in `new` for why this is using the unsafe variant
135 unsafe { Layout::from_size_align_unchecked(size, align) }
138 /// Produces layout describing a record that could be used to
139 /// allocate backing structure for `T` (which could be a trait
140 /// or other unsized type like a slice).
144 /// This function is only safe to call if the following conditions hold:
146 /// - If `T` is `Sized`, this function is always safe to call.
147 /// - If the unsized tail of `T` is:
148 /// - a [slice], then the length of the slice tail must be an intialized
149 /// integer, and the size of the *entire value*
150 /// (dynamic tail length + statically sized prefix) must fit in `isize`.
151 /// - a [trait object], then the vtable part of the pointer must point
152 /// to a valid vtable for the type `T` acquired by an unsizing coersion,
153 /// and the size of the *entire value*
154 /// (dynamic tail length + statically sized prefix) must fit in `isize`.
155 /// - an (unstable) [extern type], then this function is always safe to
156 /// call, but may panic or otherwise return the wrong value, as the
157 /// extern type's layout is not known. This is the same behavior as
158 /// [`Layout::for_value`] on a reference to an extern type tail.
159 /// - otherwise, it is conservatively not allowed to call this function.
161 /// [slice]: ../../std/primitive.slice.html
162 /// [trait object]: ../../book/ch17-02-trait-objects.html
163 /// [extern type]: ../../unstable-book/language-features/extern-types.html
164 #[unstable(feature = "layout_for_ptr", issue = "69835")]
165 pub unsafe fn for_value_raw<T: ?Sized>(t: *const T) -> Self {
166 // SAFETY: we pass along the prerequisites of these functions to the caller
167 let (size, align) = unsafe { (mem::size_of_val_raw(t), mem::align_of_val_raw(t)) };
168 debug_assert!(Layout::from_size_align(size, align).is_ok());
169 // SAFETY: see rationale in `new` for why this is using the unsafe variant
170 unsafe { Layout::from_size_align_unchecked(size, align) }
173 /// Creates a `NonNull` that is dangling, but well-aligned for this Layout.
175 /// Note that the pointer value may potentially represent a valid pointer,
176 /// which means this must not be used as a "not yet initialized"
177 /// sentinel value. Types that lazily allocate must track initialization by
178 /// some other means.
179 #[unstable(feature = "alloc_layout_extra", issue = "55724")]
181 pub const fn dangling(&self) -> NonNull<u8> {
182 // SAFETY: align is guaranteed to be non-zero
183 unsafe { NonNull::new_unchecked(self.align() as *mut u8) }
186 /// Creates a layout describing the record that can hold a value
187 /// of the same layout as `self`, but that also is aligned to
188 /// alignment `align` (measured in bytes).
190 /// If `self` already meets the prescribed alignment, then returns
193 /// Note that this method does not add any padding to the overall
194 /// size, regardless of whether the returned layout has a different
195 /// alignment. In other words, if `K` has size 16, `K.align_to(32)`
196 /// will *still* have size 16.
198 /// Returns an error if the combination of `self.size()` and the given
199 /// `align` violates the conditions listed in [`Layout::from_size_align`].
200 #[stable(feature = "alloc_layout_manipulation", since = "1.44.0")]
202 pub fn align_to(&self, align: usize) -> Result<Self, LayoutErr> {
203 Layout::from_size_align(self.size(), cmp::max(self.align(), align))
206 /// Returns the amount of padding we must insert after `self`
207 /// to ensure that the following address will satisfy `align`
208 /// (measured in bytes).
210 /// e.g., if `self.size()` is 9, then `self.padding_needed_for(4)`
211 /// returns 3, because that is the minimum number of bytes of
212 /// padding required to get a 4-aligned address (assuming that the
213 /// corresponding memory block starts at a 4-aligned address).
215 /// The return value of this function has no meaning if `align` is
216 /// not a power-of-two.
218 /// Note that the utility of the returned value requires `align`
219 /// to be less than or equal to the alignment of the starting
220 /// address for the whole allocated block of memory. One way to
221 /// satisfy this constraint is to ensure `align <= self.align()`.
222 #[unstable(feature = "alloc_layout_extra", issue = "55724")]
223 #[rustc_const_unstable(feature = "const_alloc_layout", issue = "67521")]
225 pub const fn padding_needed_for(&self, align: usize) -> usize {
226 let len = self.size();
228 // Rounded up value is:
229 // len_rounded_up = (len + align - 1) & !(align - 1);
230 // and then we return the padding difference: `len_rounded_up - len`.
232 // We use modular arithmetic throughout:
234 // 1. align is guaranteed to be > 0, so align - 1 is always
237 // 2. `len + align - 1` can overflow by at most `align - 1`,
238 // so the &-mask with `!(align - 1)` will ensure that in the
239 // case of overflow, `len_rounded_up` will itself be 0.
240 // Thus the returned padding, when added to `len`, yields 0,
241 // which trivially satisfies the alignment `align`.
243 // (Of course, attempts to allocate blocks of memory whose
244 // size and padding overflow in the above manner should cause
245 // the allocator to yield an error anyway.)
247 let len_rounded_up = len.wrapping_add(align).wrapping_sub(1) & !align.wrapping_sub(1);
248 len_rounded_up.wrapping_sub(len)
251 /// Creates a layout by rounding the size of this layout up to a multiple
252 /// of the layout's alignment.
254 /// This is equivalent to adding the result of `padding_needed_for`
255 /// to the layout's current size.
256 #[stable(feature = "alloc_layout_manipulation", since = "1.44.0")]
258 pub fn pad_to_align(&self) -> Layout {
259 let pad = self.padding_needed_for(self.align());
260 // This cannot overflow. Quoting from the invariant of Layout:
261 // > `size`, when rounded up to the nearest multiple of `align`,
262 // > must not overflow (i.e., the rounded value must be less than
264 let new_size = self.size() + pad;
266 Layout::from_size_align(new_size, self.align()).unwrap()
269 /// Creates a layout describing the record for `n` instances of
270 /// `self`, with a suitable amount of padding between each to
271 /// ensure that each instance is given its requested size and
272 /// alignment. On success, returns `(k, offs)` where `k` is the
273 /// layout of the array and `offs` is the distance between the start
274 /// of each element in the array.
276 /// On arithmetic overflow, returns `LayoutErr`.
277 #[unstable(feature = "alloc_layout_extra", issue = "55724")]
279 pub fn repeat(&self, n: usize) -> Result<(Self, usize), LayoutErr> {
280 // This cannot overflow. Quoting from the invariant of Layout:
281 // > `size`, when rounded up to the nearest multiple of `align`,
282 // > must not overflow (i.e., the rounded value must be less than
284 let padded_size = self.size() + self.padding_needed_for(self.align());
285 let alloc_size = padded_size.checked_mul(n).ok_or(LayoutErr { private: () })?;
287 // SAFETY: self.align is already known to be valid and alloc_size has been
289 unsafe { Ok((Layout::from_size_align_unchecked(alloc_size, self.align()), padded_size)) }
292 /// Creates a layout describing the record for `self` followed by
293 /// `next`, including any necessary padding to ensure that `next`
294 /// will be properly aligned, but *no trailing padding*.
296 /// In order to match C representation layout `repr(C)`, you should
297 /// call `pad_to_align` after extending the layout with all fields.
298 /// (There is no way to match the default Rust representation
299 /// layout `repr(Rust)`, as it is unspecified.)
301 /// Note that the alignment of the resulting layout will be the maximum of
302 /// those of `self` and `next`, in order to ensure alignment of both parts.
304 /// Returns `Ok((k, offset))`, where `k` is layout of the concatenated
305 /// record and `offset` is the relative location, in bytes, of the
306 /// start of the `next` embedded within the concatenated record
307 /// (assuming that the record itself starts at offset 0).
309 /// On arithmetic overflow, returns `LayoutErr`.
313 /// To calculate the layout of a `#[repr(C)]` structure and the offsets of
314 /// the fields from its fields' layouts:
317 /// # use std::alloc::{Layout, LayoutErr};
318 /// pub fn repr_c(fields: &[Layout]) -> Result<(Layout, Vec<usize>), LayoutErr> {
319 /// let mut offsets = Vec::new();
320 /// let mut layout = Layout::from_size_align(0, 1)?;
321 /// for &field in fields {
322 /// let (new_layout, offset) = layout.extend(field)?;
323 /// layout = new_layout;
324 /// offsets.push(offset);
326 /// // Remember to finalize with `pad_to_align`!
327 /// Ok((layout.pad_to_align(), offsets))
329 /// # // test that it works
330 /// # #[repr(C)] struct S { a: u64, b: u32, c: u16, d: u32 }
331 /// # let s = Layout::new::<S>();
332 /// # let u16 = Layout::new::<u16>();
333 /// # let u32 = Layout::new::<u32>();
334 /// # let u64 = Layout::new::<u64>();
335 /// # assert_eq!(repr_c(&[u64, u32, u16, u32]), Ok((s, vec![0, 8, 12, 16])));
337 #[stable(feature = "alloc_layout_manipulation", since = "1.44.0")]
339 pub fn extend(&self, next: Self) -> Result<(Self, usize), LayoutErr> {
340 let new_align = cmp::max(self.align(), next.align());
341 let pad = self.padding_needed_for(next.align());
343 let offset = self.size().checked_add(pad).ok_or(LayoutErr { private: () })?;
344 let new_size = offset.checked_add(next.size()).ok_or(LayoutErr { private: () })?;
346 let layout = Layout::from_size_align(new_size, new_align)?;
350 /// Creates a layout describing the record for `n` instances of
351 /// `self`, with no padding between each instance.
353 /// Note that, unlike `repeat`, `repeat_packed` does not guarantee
354 /// that the repeated instances of `self` will be properly
355 /// aligned, even if a given instance of `self` is properly
356 /// aligned. In other words, if the layout returned by
357 /// `repeat_packed` is used to allocate an array, it is not
358 /// guaranteed that all elements in the array will be properly
361 /// On arithmetic overflow, returns `LayoutErr`.
362 #[unstable(feature = "alloc_layout_extra", issue = "55724")]
364 pub fn repeat_packed(&self, n: usize) -> Result<Self, LayoutErr> {
365 let size = self.size().checked_mul(n).ok_or(LayoutErr { private: () })?;
366 Layout::from_size_align(size, self.align())
369 /// Creates a layout describing the record for `self` followed by
370 /// `next` with no additional padding between the two. Since no
371 /// padding is inserted, the alignment of `next` is irrelevant,
372 /// and is not incorporated *at all* into the resulting layout.
374 /// On arithmetic overflow, returns `LayoutErr`.
375 #[unstable(feature = "alloc_layout_extra", issue = "55724")]
377 pub fn extend_packed(&self, next: Self) -> Result<Self, LayoutErr> {
378 let new_size = self.size().checked_add(next.size()).ok_or(LayoutErr { private: () })?;
379 Layout::from_size_align(new_size, self.align())
382 /// Creates a layout describing the record for a `[T; n]`.
384 /// On arithmetic overflow, returns `LayoutErr`.
385 #[stable(feature = "alloc_layout_manipulation", since = "1.44.0")]
387 pub fn array<T>(n: usize) -> Result<Self, LayoutErr> {
388 let (layout, offset) = Layout::new::<T>().repeat(n)?;
389 debug_assert_eq!(offset, mem::size_of::<T>());
390 Ok(layout.pad_to_align())
394 /// The parameters given to `Layout::from_size_align`
395 /// or some other `Layout` constructor
396 /// do not satisfy its documented constraints.
397 #[stable(feature = "alloc_layout", since = "1.28.0")]
398 #[derive(Clone, PartialEq, Eq, Debug)]
399 pub struct LayoutErr {
403 // (we need this for downstream impl of trait Error)
404 #[stable(feature = "alloc_layout", since = "1.28.0")]
405 impl fmt::Display for LayoutErr {
406 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
407 f.write_str("invalid parameters to Layout::from_size_align")