Skip to main content

kernel/
alloc.rs

1// SPDX-License-Identifier: GPL-2.0
2
3//! Implementation of the kernel's memory allocation infrastructure.
4
5pub mod allocator;
6pub mod arrayvec;
7pub mod kbox;
8pub mod kvec;
9pub mod layout;
10
11pub use self::arrayvec::ArrayVec;
12
13pub use self::kbox::Box;
14pub use self::kbox::KBox;
15pub use self::kbox::KVBox;
16pub use self::kbox::VBox;
17
18pub use self::kvec::IntoIter;
19pub use self::kvec::KVVec;
20pub use self::kvec::KVec;
21pub use self::kvec::VVec;
22pub use self::kvec::Vec;
23
24/// Indicates an allocation error.
25#[derive(Copy, Clone, PartialEq, Eq, Debug)]
26pub struct AllocError;
27
28use crate::prelude::*;
29
30use core::{
31    alloc::Layout,
32    ptr::NonNull, //
33};
34
35/// Flags to be used when allocating memory.
36///
37/// They can be combined with the operators `|`, `&`, and `!`.
38///
39/// Values can be used from the [`flags`] module.
40#[derive(Clone, Copy, PartialEq)]
41pub struct Flags(u32);
42
43impl Flags {
44    /// Get the raw representation of this flag.
45    pub(crate) fn as_raw(self) -> u32 {
46        self.0
47    }
48
49    /// Check whether `flags` is contained in `self`.
50    pub fn contains(self, flags: Flags) -> bool {
51        (self & flags) == flags
52    }
53}
54
55impl core::ops::BitOr for Flags {
56    type Output = Self;
57    fn bitor(self, rhs: Self) -> Self::Output {
58        Self(self.0 | rhs.0)
59    }
60}
61
62impl core::ops::BitAnd for Flags {
63    type Output = Self;
64    fn bitand(self, rhs: Self) -> Self::Output {
65        Self(self.0 & rhs.0)
66    }
67}
68
69impl core::ops::Not for Flags {
70    type Output = Self;
71    fn not(self) -> Self::Output {
72        Self(!self.0)
73    }
74}
75
76/// Allocation flags.
77///
78/// These are meant to be used in functions that can allocate memory.
79pub mod flags {
80    use super::Flags;
81
82    /// Zeroes out the allocated memory.
83    ///
84    /// This is normally or'd with other flags.
85    pub const __GFP_ZERO: Flags = Flags(bindings::__GFP_ZERO);
86
87    /// Allow the allocation to be in high memory.
88    ///
89    /// Allocations in high memory may not be mapped into the kernel's address space, so this can't
90    /// be used with `kmalloc` and other similar methods.
91    ///
92    /// This is normally or'd with other flags.
93    pub const __GFP_HIGHMEM: Flags = Flags(bindings::__GFP_HIGHMEM);
94
95    /// Users can not sleep and need the allocation to succeed.
96    ///
97    /// A lower watermark is applied to allow access to "atomic reserves". The current
98    /// implementation doesn't support NMI and few other strict non-preemptive contexts (e.g.
99    /// `raw_spin_lock`). The same applies to [`GFP_NOWAIT`].
100    pub const GFP_ATOMIC: Flags = Flags(bindings::GFP_ATOMIC);
101
102    /// Typical for kernel-internal allocations. The caller requires `ZONE_NORMAL` or a lower zone
103    /// for direct access but can direct reclaim.
104    pub const GFP_KERNEL: Flags = Flags(bindings::GFP_KERNEL);
105
106    /// The same as [`GFP_KERNEL`], except the allocation is accounted to kmemcg.
107    pub const GFP_KERNEL_ACCOUNT: Flags = Flags(bindings::GFP_KERNEL_ACCOUNT);
108
109    /// For kernel allocations that should not stall for direct reclaim, start physical IO or
110    /// use any filesystem callback.  It is very likely to fail to allocate memory, even for very
111    /// small allocations.
112    pub const GFP_NOWAIT: Flags = Flags(bindings::GFP_NOWAIT);
113
114    /// Suppresses allocation failure reports.
115    ///
116    /// This is normally or'd with other flags.
117    pub const __GFP_NOWARN: Flags = Flags(bindings::__GFP_NOWARN);
118}
119
120/// Non Uniform Memory Access (NUMA) node identifier.
121#[derive(Clone, Copy, PartialEq)]
122pub struct NumaNode(i32);
123
124impl NumaNode {
125    /// Create a new NUMA node identifier (non-negative integer).
126    ///
127    /// Returns [`EINVAL`] if a negative id or an id exceeding [`bindings::MAX_NUMNODES`] is
128    /// specified.
129    pub fn new(node: i32) -> Result<Self> {
130        // MAX_NUMNODES never exceeds 2**10 because NODES_SHIFT is 0..10.
131        if node < 0 || node >= bindings::MAX_NUMNODES as i32 {
132            return Err(EINVAL);
133        }
134        Ok(Self(node))
135    }
136
137    /// Returns the raw NUMA node identifier as an `i32`.
138    #[inline]
139    pub fn id(&self) -> i32 {
140        self.0
141    }
142}
143
144/// Specify necessary constant to pass the information to Allocator that the caller doesn't care
145/// about the NUMA node to allocate memory from.
146impl NumaNode {
147    /// No node preference.
148    pub const NO_NODE: NumaNode = NumaNode(bindings::NUMA_NO_NODE);
149}
150
151/// The kernel's [`Allocator`] trait.
152///
153/// An implementation of [`Allocator`] can allocate, re-allocate and free memory buffers described
154/// via [`Layout`].
155///
156/// [`Allocator`] is designed to be implemented as a ZST; [`Allocator`] functions do not operate on
157/// an object instance.
158///
159/// In order to be able to support `#[derive(CoercePointee)]` later on, we need to avoid a design
160/// that requires an `Allocator` to be instantiated, hence its functions must not contain any kind
161/// of `self` parameter.
162///
163/// # Safety
164///
165/// - A memory allocation returned from an allocator must remain valid until it is explicitly freed.
166///
167/// - Any pointer to a valid memory allocation must be valid to be passed to any other [`Allocator`]
168///   function of the same type.
169///
170/// - Implementers must ensure that all trait functions abide by the guarantees documented in the
171///   `# Guarantees` sections.
172pub unsafe trait Allocator {
173    /// The minimum alignment satisfied by all allocations from this allocator.
174    ///
175    /// # Guarantees
176    ///
177    /// Any pointer allocated by this allocator is guaranteed to be aligned to `MIN_ALIGN` even if
178    /// the requested layout has a smaller alignment.
179    const MIN_ALIGN: usize;
180
181    /// Allocate memory based on `layout`, `flags` and `nid`.
182    ///
183    /// On success, returns a buffer represented as `NonNull<[u8]>` that satisfies the layout
184    /// constraints (i.e. minimum size and alignment as specified by `layout`).
185    ///
186    /// This function is equivalent to `realloc` when called with `None`.
187    ///
188    /// # Guarantees
189    ///
190    /// When the return value is `Ok(ptr)`, then `ptr` is
191    /// - valid for reads and writes for `layout.size()` bytes, until it is passed to
192    ///   [`Allocator::free`] or [`Allocator::realloc`],
193    /// - aligned to `layout.align()`,
194    ///
195    /// Additionally, `Flags` are honored as documented in
196    /// <https://docs.kernel.org/core-api/mm-api.html#mm-api-gfp-flags>.
197    fn alloc(layout: Layout, flags: Flags, nid: NumaNode) -> Result<NonNull<[u8]>, AllocError> {
198        // SAFETY: Passing `None` to `realloc` is valid by its safety requirements and asks for a
199        // new memory allocation.
200        unsafe { Self::realloc(None, layout, Layout::new::<()>(), flags, nid) }
201    }
202
203    /// Re-allocate an existing memory allocation to satisfy the requested `layout` and
204    /// a specific NUMA node request to allocate the memory for.
205    ///
206    /// Systems employing a Non Uniform Memory Access (NUMA) architecture contain collections of
207    /// hardware resources including processors, memory, and I/O buses, that comprise what is
208    /// commonly known as a NUMA node.
209    ///
210    /// `nid` stands for NUMA id, i. e. NUMA node identifier, which is a non-negative integer
211    /// if a node needs to be specified, or [`NumaNode::NO_NODE`] if the caller doesn't care.
212    ///
213    /// If the requested size is zero, `realloc` behaves equivalent to `free`.
214    ///
215    /// If the requested size is larger than the size of the existing allocation, a successful call
216    /// to `realloc` guarantees that the new or grown buffer has at least `Layout::size` bytes, but
217    /// may also be larger.
218    ///
219    /// If the requested size is smaller than the size of the existing allocation, `realloc` may or
220    /// may not shrink the buffer; this is implementation specific to the allocator.
221    ///
222    /// On allocation failure, the existing buffer, if any, remains valid.
223    ///
224    /// The buffer is represented as `NonNull<[u8]>`.
225    ///
226    /// # Safety
227    ///
228    /// - If `ptr == Some(p)`, then `p` must point to an existing and valid memory allocation
229    ///   created by this [`Allocator`]; if `old_layout` is zero-sized `p` does not need to be a
230    ///   pointer returned by this [`Allocator`].
231    /// - `ptr` is allowed to be `None`; in this case a new memory allocation is created and
232    ///   `old_layout` is ignored.
233    /// - `old_layout` must match the `Layout` the allocation has been created with.
234    ///
235    /// # Guarantees
236    ///
237    /// This function has the same guarantees as [`Allocator::alloc`]. When `ptr == Some(p)`, then
238    /// it additionally guarantees that:
239    /// - the contents of the memory pointed to by `p` are preserved up to the lesser of the new
240    ///   and old size, i.e. `ret_ptr[0..min(layout.size(), old_layout.size())] ==
241    ///   p[0..min(layout.size(), old_layout.size())]`.
242    /// - when the return value is `Err(AllocError)`, then `ptr` is still valid.
243    unsafe fn realloc(
244        ptr: Option<NonNull<u8>>,
245        layout: Layout,
246        old_layout: Layout,
247        flags: Flags,
248        nid: NumaNode,
249    ) -> Result<NonNull<[u8]>, AllocError>;
250
251    /// Free an existing memory allocation.
252    ///
253    /// # Safety
254    ///
255    /// - `ptr` must point to an existing and valid memory allocation created by this [`Allocator`];
256    ///   if `old_layout` is zero-sized `p` does not need to be a pointer returned by this
257    ///   [`Allocator`].
258    /// - `layout` must match the `Layout` the allocation has been created with.
259    /// - The memory allocation at `ptr` must never again be read from or written to.
260    unsafe fn free(ptr: NonNull<u8>, layout: Layout) {
261        // SAFETY: The caller guarantees that `ptr` points at a valid allocation created by this
262        // allocator. We are passing a `Layout` with the smallest possible alignment, so it is
263        // smaller than or equal to the alignment previously used with this allocation.
264        let _ = unsafe {
265            Self::realloc(
266                Some(ptr),
267                Layout::new::<()>(),
268                layout,
269                Flags(0),
270                NumaNode::NO_NODE,
271            )
272        };
273    }
274}
275
276/// Returns a properly aligned dangling pointer from the given `layout`.
277pub(crate) fn dangling_from_layout(layout: Layout) -> NonNull<u8> {
278    let ptr = layout.align() as *mut u8;
279
280    // SAFETY: `layout.align()` (and hence `ptr`) is guaranteed to be non-zero.
281    unsafe { NonNull::new_unchecked(ptr) }
282}