/// use kernel::alloc::{flags, box_ext::BoxExt};
/// let value = Box::new([0; 32], flags::GFP_KERNEL)?;
/// assert_eq!(*value, [0; 32]);
- /// let value = Box::drop_contents(value);
+ /// let mut value = Box::drop_contents(value);
/// // Now we can re-use `value`:
- /// let value = Box::write(value, [1; 32]);
+ /// value.write([1; 32]);
+ /// // SAFETY: We just wrote to it.
+ /// let value = unsafe { value.assume_init() };
/// assert_eq!(*value, [1; 32]);
/// # Ok::<(), Error>(())
/// ```
/// Initialises a node reservation.
///
/// It then becomes an [`RBTreeNode`] that can be inserted into a tree.
- pub fn into_node(self, key: K, value: V) -> RBTreeNode<K, V> {
- let node = Box::write(
- self.node,
- Node {
- key,
- value,
- links: bindings::rb_node::default(),
- },
- );
+ pub fn into_node(mut self, key: K, value: V) -> RBTreeNode<K, V> {
+ self.node.write(Node {
+ key,
+ value,
+ links: bindings::rb_node::default(),
+ });
+ // SAFETY: We just wrote to it.
+ let node = unsafe { self.node.assume_init() };
RBTreeNode { node }
}
}