Struct mnemos_alloc::node::Recycle

#[repr(C)]
pub(crate) struct Recycle {
    pub(crate) links: Links<Recycle>,
    pub(crate) node_layout: Layout,
}

A Recycle node type

Recycle is the “terminal state” of all allocations. After the actual heap allocated data has been dropped, all active allocations become a Recycle node. Allocations remain in this state until they have been freed by the underlying allocator.

In the fast path, a Recycle node is dropped directly by the allocator. In the slow path, the intrusive linked list header contained within a Recycle node is used to “send” the allocation to a lock-free, intrusive MpscQueue, where it will live until the allocator cleans up the pending freelist items.

Fields

links: Links<Recycle>

node_layout: Layout

Trait Implementations

impl Linked<Links<Recycle>> for Recycle

type Handle = NodeRef

The handle owning nodes in the linked list.

fn into_ptr(r: Self::Handle) -> NonNull<Self>

Convert a [Self::Handle] to a raw pointer to Self, taking ownership of it in the process.

unsafe fn from_ptr(ptr: NonNull<Self>) -> Self::Handle

Convert a raw pointer to Self into an owning [Self::Handle].

unsafe fn links(ptr: NonNull<Self>) -> NonNull<Links<Recycle>>

Return the links of the node pointed to by ptr.