kernel/
rbtree.rs

1// SPDX-License-Identifier: GPL-2.0
2
3//! Red-black trees.
4//!
5//! C header: [`include/linux/rbtree.h`](srctree/include/linux/rbtree.h)
6//!
7//! Reference: <https://docs.kernel.org/core-api/rbtree.html>
8
9use crate::{alloc::Flags, bindings, container_of, error::Result, prelude::*};
10use core::{
11    cmp::{Ord, Ordering},
12    marker::PhantomData,
13    mem::MaybeUninit,
14    ptr::{addr_of_mut, from_mut, NonNull},
15};
16
17/// A red-black tree with owned nodes.
18///
19/// It is backed by the kernel C red-black trees.
20///
21/// # Examples
22///
23/// In the example below we do several operations on a tree. We note that insertions may fail if
24/// the system is out of memory.
25///
26/// ```
27/// use kernel::{alloc::flags, rbtree::{RBTree, RBTreeNode, RBTreeNodeReservation}};
28///
29/// // Create a new tree.
30/// let mut tree = RBTree::new();
31///
32/// // Insert three elements.
33/// tree.try_create_and_insert(20, 200, flags::GFP_KERNEL)?;
34/// tree.try_create_and_insert(10, 100, flags::GFP_KERNEL)?;
35/// tree.try_create_and_insert(30, 300, flags::GFP_KERNEL)?;
36///
37/// // Check the nodes we just inserted.
38/// {
39///     assert_eq!(tree.get(&10), Some(&100));
40///     assert_eq!(tree.get(&20), Some(&200));
41///     assert_eq!(tree.get(&30), Some(&300));
42/// }
43///
44/// // Iterate over the nodes we just inserted.
45/// {
46///     let mut iter = tree.iter();
47///     assert_eq!(iter.next(), Some((&10, &100)));
48///     assert_eq!(iter.next(), Some((&20, &200)));
49///     assert_eq!(iter.next(), Some((&30, &300)));
50///     assert!(iter.next().is_none());
51/// }
52///
53/// // Print all elements.
54/// for (key, value) in &tree {
55///     pr_info!("{} = {}\n", key, value);
56/// }
57///
58/// // Replace one of the elements.
59/// tree.try_create_and_insert(10, 1000, flags::GFP_KERNEL)?;
60///
61/// // Check that the tree reflects the replacement.
62/// {
63///     let mut iter = tree.iter();
64///     assert_eq!(iter.next(), Some((&10, &1000)));
65///     assert_eq!(iter.next(), Some((&20, &200)));
66///     assert_eq!(iter.next(), Some((&30, &300)));
67///     assert!(iter.next().is_none());
68/// }
69///
70/// // Change the value of one of the elements.
71/// *tree.get_mut(&30).unwrap() = 3000;
72///
73/// // Check that the tree reflects the update.
74/// {
75///     let mut iter = tree.iter();
76///     assert_eq!(iter.next(), Some((&10, &1000)));
77///     assert_eq!(iter.next(), Some((&20, &200)));
78///     assert_eq!(iter.next(), Some((&30, &3000)));
79///     assert!(iter.next().is_none());
80/// }
81///
82/// // Remove an element.
83/// tree.remove(&10);
84///
85/// // Check that the tree reflects the removal.
86/// {
87///     let mut iter = tree.iter();
88///     assert_eq!(iter.next(), Some((&20, &200)));
89///     assert_eq!(iter.next(), Some((&30, &3000)));
90///     assert!(iter.next().is_none());
91/// }
92///
93/// # Ok::<(), Error>(())
94/// ```
95///
96/// In the example below, we first allocate a node, acquire a spinlock, then insert the node into
97/// the tree. This is useful when the insertion context does not allow sleeping, for example, when
98/// holding a spinlock.
99///
100/// ```
101/// use kernel::{alloc::flags, rbtree::{RBTree, RBTreeNode}, sync::SpinLock};
102///
103/// fn insert_test(tree: &SpinLock<RBTree<u32, u32>>) -> Result {
104///     // Pre-allocate node. This may fail (as it allocates memory).
105///     let node = RBTreeNode::new(10, 100, flags::GFP_KERNEL)?;
106///
107///     // Insert node while holding the lock. It is guaranteed to succeed with no allocation
108///     // attempts.
109///     let mut guard = tree.lock();
110///     guard.insert(node);
111///     Ok(())
112/// }
113/// ```
114///
115/// In the example below, we reuse an existing node allocation from an element we removed.
116///
117/// ```
118/// use kernel::{alloc::flags, rbtree::{RBTree, RBTreeNodeReservation}};
119///
120/// // Create a new tree.
121/// let mut tree = RBTree::new();
122///
123/// // Insert three elements.
124/// tree.try_create_and_insert(20, 200, flags::GFP_KERNEL)?;
125/// tree.try_create_and_insert(10, 100, flags::GFP_KERNEL)?;
126/// tree.try_create_and_insert(30, 300, flags::GFP_KERNEL)?;
127///
128/// // Check the nodes we just inserted.
129/// {
130///     let mut iter = tree.iter();
131///     assert_eq!(iter.next(), Some((&10, &100)));
132///     assert_eq!(iter.next(), Some((&20, &200)));
133///     assert_eq!(iter.next(), Some((&30, &300)));
134///     assert!(iter.next().is_none());
135/// }
136///
137/// // Remove a node, getting back ownership of it.
138/// let existing = tree.remove(&30);
139///
140/// // Check that the tree reflects the removal.
141/// {
142///     let mut iter = tree.iter();
143///     assert_eq!(iter.next(), Some((&10, &100)));
144///     assert_eq!(iter.next(), Some((&20, &200)));
145///     assert!(iter.next().is_none());
146/// }
147///
148/// // Create a preallocated reservation that we can re-use later.
149/// let reservation = RBTreeNodeReservation::new(flags::GFP_KERNEL)?;
150///
151/// // Insert a new node into the tree, reusing the previous allocation. This is guaranteed to
152/// // succeed (no memory allocations).
153/// tree.insert(reservation.into_node(15, 150));
154///
155/// // Check that the tree reflect the new insertion.
156/// {
157///     let mut iter = tree.iter();
158///     assert_eq!(iter.next(), Some((&10, &100)));
159///     assert_eq!(iter.next(), Some((&15, &150)));
160///     assert_eq!(iter.next(), Some((&20, &200)));
161///     assert!(iter.next().is_none());
162/// }
163///
164/// # Ok::<(), Error>(())
165/// ```
166///
167/// # Invariants
168///
169/// Non-null parent/children pointers stored in instances of the `rb_node` C struct are always
170/// valid, and pointing to a field of our internal representation of a node.
171pub struct RBTree<K, V> {
172    root: bindings::rb_root,
173    _p: PhantomData<Node<K, V>>,
174}
175
176// SAFETY: An [`RBTree`] allows the same kinds of access to its values that a struct allows to its
177// fields, so we use the same Send condition as would be used for a struct with K and V fields.
178unsafe impl<K: Send, V: Send> Send for RBTree<K, V> {}
179
180// SAFETY: An [`RBTree`] allows the same kinds of access to its values that a struct allows to its
181// fields, so we use the same Sync condition as would be used for a struct with K and V fields.
182unsafe impl<K: Sync, V: Sync> Sync for RBTree<K, V> {}
183
184impl<K, V> RBTree<K, V> {
185    /// Creates a new and empty tree.
186    pub fn new() -> Self {
187        Self {
188            // INVARIANT: There are no nodes in the tree, so the invariant holds vacuously.
189            root: bindings::rb_root::default(),
190            _p: PhantomData,
191        }
192    }
193
194    /// Returns true if this tree is empty.
195    #[inline]
196    pub fn is_empty(&self) -> bool {
197        self.root.rb_node.is_null()
198    }
199
200    /// Returns an iterator over the tree nodes, sorted by key.
201    pub fn iter(&self) -> Iter<'_, K, V> {
202        Iter {
203            _tree: PhantomData,
204            // INVARIANT:
205            //   - `self.root` is a valid pointer to a tree root.
206            //   - `bindings::rb_first` produces a valid pointer to a node given `root` is valid.
207            iter_raw: IterRaw {
208                // SAFETY: by the invariants, all pointers are valid.
209                next: unsafe { bindings::rb_first(&self.root) },
210                _phantom: PhantomData,
211            },
212        }
213    }
214
215    /// Returns a mutable iterator over the tree nodes, sorted by key.
216    pub fn iter_mut(&mut self) -> IterMut<'_, K, V> {
217        IterMut {
218            _tree: PhantomData,
219            // INVARIANT:
220            //   - `self.root` is a valid pointer to a tree root.
221            //   - `bindings::rb_first` produces a valid pointer to a node given `root` is valid.
222            iter_raw: IterRaw {
223                // SAFETY: by the invariants, all pointers are valid.
224                next: unsafe { bindings::rb_first(from_mut(&mut self.root)) },
225                _phantom: PhantomData,
226            },
227        }
228    }
229
230    /// Returns an iterator over the keys of the nodes in the tree, in sorted order.
231    pub fn keys(&self) -> impl Iterator<Item = &'_ K> {
232        self.iter().map(|(k, _)| k)
233    }
234
235    /// Returns an iterator over the values of the nodes in the tree, sorted by key.
236    pub fn values(&self) -> impl Iterator<Item = &'_ V> {
237        self.iter().map(|(_, v)| v)
238    }
239
240    /// Returns a mutable iterator over the values of the nodes in the tree, sorted by key.
241    pub fn values_mut(&mut self) -> impl Iterator<Item = &'_ mut V> {
242        self.iter_mut().map(|(_, v)| v)
243    }
244
245    /// Returns a cursor over the tree nodes, starting with the smallest key.
246    pub fn cursor_front(&mut self) -> Option<Cursor<'_, K, V>> {
247        let root = addr_of_mut!(self.root);
248        // SAFETY: `self.root` is always a valid root node
249        let current = unsafe { bindings::rb_first(root) };
250        NonNull::new(current).map(|current| {
251            // INVARIANT:
252            // - `current` is a valid node in the [`RBTree`] pointed to by `self`.
253            Cursor {
254                current,
255                tree: self,
256            }
257        })
258    }
259
260    /// Returns a cursor over the tree nodes, starting with the largest key.
261    pub fn cursor_back(&mut self) -> Option<Cursor<'_, K, V>> {
262        let root = addr_of_mut!(self.root);
263        // SAFETY: `self.root` is always a valid root node
264        let current = unsafe { bindings::rb_last(root) };
265        NonNull::new(current).map(|current| {
266            // INVARIANT:
267            // - `current` is a valid node in the [`RBTree`] pointed to by `self`.
268            Cursor {
269                current,
270                tree: self,
271            }
272        })
273    }
274}
275
276impl<K, V> RBTree<K, V>
277where
278    K: Ord,
279{
280    /// Tries to insert a new value into the tree.
281    ///
282    /// It overwrites a node if one already exists with the same key and returns it (containing the
283    /// key/value pair). Returns [`None`] if a node with the same key didn't already exist.
284    ///
285    /// Returns an error if it cannot allocate memory for the new node.
286    pub fn try_create_and_insert(
287        &mut self,
288        key: K,
289        value: V,
290        flags: Flags,
291    ) -> Result<Option<RBTreeNode<K, V>>> {
292        Ok(self.insert(RBTreeNode::new(key, value, flags)?))
293    }
294
295    /// Inserts a new node into the tree.
296    ///
297    /// It overwrites a node if one already exists with the same key and returns it (containing the
298    /// key/value pair). Returns [`None`] if a node with the same key didn't already exist.
299    ///
300    /// This function always succeeds.
301    pub fn insert(&mut self, node: RBTreeNode<K, V>) -> Option<RBTreeNode<K, V>> {
302        match self.raw_entry(&node.node.key) {
303            RawEntry::Occupied(entry) => Some(entry.replace(node)),
304            RawEntry::Vacant(entry) => {
305                entry.insert(node);
306                None
307            }
308        }
309    }
310
311    fn raw_entry(&mut self, key: &K) -> RawEntry<'_, K, V> {
312        let raw_self: *mut RBTree<K, V> = self;
313        // The returned `RawEntry` is used to call either `rb_link_node` or `rb_replace_node`.
314        // The parameters of `bindings::rb_link_node` are as follows:
315        // - `node`: A pointer to an uninitialized node being inserted.
316        // - `parent`: A pointer to an existing node in the tree. One of its child pointers must be
317        //          null, and `node` will become a child of `parent` by replacing that child pointer
318        //          with a pointer to `node`.
319        // - `rb_link`: A pointer to either the left-child or right-child field of `parent`. This
320        //          specifies which child of `parent` should hold `node` after this call. The
321        //          value of `*rb_link` must be null before the call to `rb_link_node`. If the
322        //          red/black tree is empty, then it’s also possible for `parent` to be null. In
323        //          this case, `rb_link` is a pointer to the `root` field of the red/black tree.
324        //
325        // We will traverse the tree looking for a node that has a null pointer as its child,
326        // representing an empty subtree where we can insert our new node. We need to make sure
327        // that we preserve the ordering of the nodes in the tree. In each iteration of the loop
328        // we store `parent` and `child_field_of_parent`, and the new `node` will go somewhere
329        // in the subtree of `parent` that `child_field_of_parent` points at. Once
330        // we find an empty subtree, we can insert the new node using `rb_link_node`.
331        let mut parent = core::ptr::null_mut();
332        let mut child_field_of_parent: &mut *mut bindings::rb_node =
333            // SAFETY: `raw_self` is a valid pointer to the `RBTree` (created from `self` above).
334            unsafe { &mut (*raw_self).root.rb_node };
335        while !(*child_field_of_parent).is_null() {
336            let curr = *child_field_of_parent;
337            // SAFETY: All links fields we create are in a `Node<K, V>`.
338            let node = unsafe { container_of!(curr, Node<K, V>, links) };
339
340            // SAFETY: `node` is a non-null node so it is valid by the type invariants.
341            match key.cmp(unsafe { &(*node).key }) {
342                // SAFETY: `curr` is a non-null node so it is valid by the type invariants.
343                Ordering::Less => child_field_of_parent = unsafe { &mut (*curr).rb_left },
344                // SAFETY: `curr` is a non-null node so it is valid by the type invariants.
345                Ordering::Greater => child_field_of_parent = unsafe { &mut (*curr).rb_right },
346                Ordering::Equal => {
347                    return RawEntry::Occupied(OccupiedEntry {
348                        rbtree: self,
349                        node_links: curr,
350                    })
351                }
352            }
353            parent = curr;
354        }
355
356        RawEntry::Vacant(RawVacantEntry {
357            rbtree: raw_self,
358            parent,
359            child_field_of_parent,
360            _phantom: PhantomData,
361        })
362    }
363
364    /// Gets the given key's corresponding entry in the map for in-place manipulation.
365    pub fn entry(&mut self, key: K) -> Entry<'_, K, V> {
366        match self.raw_entry(&key) {
367            RawEntry::Occupied(entry) => Entry::Occupied(entry),
368            RawEntry::Vacant(entry) => Entry::Vacant(VacantEntry { raw: entry, key }),
369        }
370    }
371
372    /// Used for accessing the given node, if it exists.
373    pub fn find_mut(&mut self, key: &K) -> Option<OccupiedEntry<'_, K, V>> {
374        match self.raw_entry(key) {
375            RawEntry::Occupied(entry) => Some(entry),
376            RawEntry::Vacant(_entry) => None,
377        }
378    }
379
380    /// Returns a reference to the value corresponding to the key.
381    pub fn get(&self, key: &K) -> Option<&V> {
382        let mut node = self.root.rb_node;
383        while !node.is_null() {
384            // SAFETY: By the type invariant of `Self`, all non-null `rb_node` pointers stored in `self`
385            // point to the links field of `Node<K, V>` objects.
386            let this = unsafe { container_of!(node, Node<K, V>, links) };
387            // SAFETY: `this` is a non-null node so it is valid by the type invariants.
388            node = match key.cmp(unsafe { &(*this).key }) {
389                // SAFETY: `node` is a non-null node so it is valid by the type invariants.
390                Ordering::Less => unsafe { (*node).rb_left },
391                // SAFETY: `node` is a non-null node so it is valid by the type invariants.
392                Ordering::Greater => unsafe { (*node).rb_right },
393                // SAFETY: `node` is a non-null node so it is valid by the type invariants.
394                Ordering::Equal => return Some(unsafe { &(*this).value }),
395            }
396        }
397        None
398    }
399
400    /// Returns a mutable reference to the value corresponding to the key.
401    pub fn get_mut(&mut self, key: &K) -> Option<&mut V> {
402        self.find_mut(key).map(|node| node.into_mut())
403    }
404
405    /// Removes the node with the given key from the tree.
406    ///
407    /// It returns the node that was removed if one exists, or [`None`] otherwise.
408    pub fn remove_node(&mut self, key: &K) -> Option<RBTreeNode<K, V>> {
409        self.find_mut(key).map(OccupiedEntry::remove_node)
410    }
411
412    /// Removes the node with the given key from the tree.
413    ///
414    /// It returns the value that was removed if one exists, or [`None`] otherwise.
415    pub fn remove(&mut self, key: &K) -> Option<V> {
416        self.find_mut(key).map(OccupiedEntry::remove)
417    }
418
419    /// Returns a cursor over the tree nodes based on the given key.
420    ///
421    /// If the given key exists, the cursor starts there.
422    /// Otherwise it starts with the first larger key in sort order.
423    /// If there is no larger key, it returns [`None`].
424    pub fn cursor_lower_bound(&mut self, key: &K) -> Option<Cursor<'_, K, V>>
425    where
426        K: Ord,
427    {
428        let mut node = self.root.rb_node;
429        let mut best_match: Option<NonNull<Node<K, V>>> = None;
430        while !node.is_null() {
431            // SAFETY: By the type invariant of `Self`, all non-null `rb_node` pointers stored in `self`
432            // point to the links field of `Node<K, V>` objects.
433            let this = unsafe { container_of!(node, Node<K, V>, links) };
434            // SAFETY: `this` is a non-null node so it is valid by the type invariants.
435            let this_key = unsafe { &(*this).key };
436            // SAFETY: `node` is a non-null node so it is valid by the type invariants.
437            let left_child = unsafe { (*node).rb_left };
438            // SAFETY: `node` is a non-null node so it is valid by the type invariants.
439            let right_child = unsafe { (*node).rb_right };
440            match key.cmp(this_key) {
441                Ordering::Equal => {
442                    best_match = NonNull::new(this);
443                    break;
444                }
445                Ordering::Greater => {
446                    node = right_child;
447                }
448                Ordering::Less => {
449                    let is_better_match = match best_match {
450                        None => true,
451                        Some(best) => {
452                            // SAFETY: `best` is a non-null node so it is valid by the type invariants.
453                            let best_key = unsafe { &(*best.as_ptr()).key };
454                            best_key > this_key
455                        }
456                    };
457                    if is_better_match {
458                        best_match = NonNull::new(this);
459                    }
460                    node = left_child;
461                }
462            };
463        }
464
465        let best = best_match?;
466
467        // SAFETY: `best` is a non-null node so it is valid by the type invariants.
468        let links = unsafe { addr_of_mut!((*best.as_ptr()).links) };
469
470        NonNull::new(links).map(|current| {
471            // INVARIANT:
472            // - `current` is a valid node in the [`RBTree`] pointed to by `self`.
473            Cursor {
474                current,
475                tree: self,
476            }
477        })
478    }
479}
480
481impl<K, V> Default for RBTree<K, V> {
482    fn default() -> Self {
483        Self::new()
484    }
485}
486
487impl<K, V> Drop for RBTree<K, V> {
488    fn drop(&mut self) {
489        // SAFETY: `root` is valid as it's embedded in `self` and we have a valid `self`.
490        let mut next = unsafe { bindings::rb_first_postorder(&self.root) };
491
492        // INVARIANT: The loop invariant is that all tree nodes from `next` in postorder are valid.
493        while !next.is_null() {
494            // SAFETY: All links fields we create are in a `Node<K, V>`.
495            let this = unsafe { container_of!(next, Node<K, V>, links) };
496
497            // Find out what the next node is before disposing of the current one.
498            // SAFETY: `next` and all nodes in postorder are still valid.
499            next = unsafe { bindings::rb_next_postorder(next) };
500
501            // INVARIANT: This is the destructor, so we break the type invariant during clean-up,
502            // but it is not observable. The loop invariant is still maintained.
503
504            // SAFETY: `this` is valid per the loop invariant.
505            unsafe { drop(KBox::from_raw(this)) };
506        }
507    }
508}
509
510/// A bidirectional cursor over the tree nodes, sorted by key.
511///
512/// # Examples
513///
514/// In the following example, we obtain a cursor to the first element in the tree.
515/// The cursor allows us to iterate bidirectionally over key/value pairs in the tree.
516///
517/// ```
518/// use kernel::{alloc::flags, rbtree::RBTree};
519///
520/// // Create a new tree.
521/// let mut tree = RBTree::new();
522///
523/// // Insert three elements.
524/// tree.try_create_and_insert(10, 100, flags::GFP_KERNEL)?;
525/// tree.try_create_and_insert(20, 200, flags::GFP_KERNEL)?;
526/// tree.try_create_and_insert(30, 300, flags::GFP_KERNEL)?;
527///
528/// // Get a cursor to the first element.
529/// let mut cursor = tree.cursor_front().unwrap();
530/// let mut current = cursor.current();
531/// assert_eq!(current, (&10, &100));
532///
533/// // Move the cursor, updating it to the 2nd element.
534/// cursor = cursor.move_next().unwrap();
535/// current = cursor.current();
536/// assert_eq!(current, (&20, &200));
537///
538/// // Peek at the next element without impacting the cursor.
539/// let next = cursor.peek_next().unwrap();
540/// assert_eq!(next, (&30, &300));
541/// current = cursor.current();
542/// assert_eq!(current, (&20, &200));
543///
544/// // Moving past the last element causes the cursor to return [`None`].
545/// cursor = cursor.move_next().unwrap();
546/// current = cursor.current();
547/// assert_eq!(current, (&30, &300));
548/// let cursor = cursor.move_next();
549/// assert!(cursor.is_none());
550///
551/// # Ok::<(), Error>(())
552/// ```
553///
554/// A cursor can also be obtained at the last element in the tree.
555///
556/// ```
557/// use kernel::{alloc::flags, rbtree::RBTree};
558///
559/// // Create a new tree.
560/// let mut tree = RBTree::new();
561///
562/// // Insert three elements.
563/// tree.try_create_and_insert(10, 100, flags::GFP_KERNEL)?;
564/// tree.try_create_and_insert(20, 200, flags::GFP_KERNEL)?;
565/// tree.try_create_and_insert(30, 300, flags::GFP_KERNEL)?;
566///
567/// let mut cursor = tree.cursor_back().unwrap();
568/// let current = cursor.current();
569/// assert_eq!(current, (&30, &300));
570///
571/// # Ok::<(), Error>(())
572/// ```
573///
574/// Obtaining a cursor returns [`None`] if the tree is empty.
575///
576/// ```
577/// use kernel::rbtree::RBTree;
578///
579/// let mut tree: RBTree<u16, u16> = RBTree::new();
580/// assert!(tree.cursor_front().is_none());
581///
582/// # Ok::<(), Error>(())
583/// ```
584///
585/// [`RBTree::cursor_lower_bound`] can be used to start at an arbitrary node in the tree.
586///
587/// ```
588/// use kernel::{alloc::flags, rbtree::RBTree};
589///
590/// // Create a new tree.
591/// let mut tree = RBTree::new();
592///
593/// // Insert five elements.
594/// tree.try_create_and_insert(10, 100, flags::GFP_KERNEL)?;
595/// tree.try_create_and_insert(20, 200, flags::GFP_KERNEL)?;
596/// tree.try_create_and_insert(30, 300, flags::GFP_KERNEL)?;
597/// tree.try_create_and_insert(40, 400, flags::GFP_KERNEL)?;
598/// tree.try_create_and_insert(50, 500, flags::GFP_KERNEL)?;
599///
600/// // If the provided key exists, a cursor to that key is returned.
601/// let cursor = tree.cursor_lower_bound(&20).unwrap();
602/// let current = cursor.current();
603/// assert_eq!(current, (&20, &200));
604///
605/// // If the provided key doesn't exist, a cursor to the first larger element in sort order is returned.
606/// let cursor = tree.cursor_lower_bound(&25).unwrap();
607/// let current = cursor.current();
608/// assert_eq!(current, (&30, &300));
609///
610/// // If there is no larger key, [`None`] is returned.
611/// let cursor = tree.cursor_lower_bound(&55);
612/// assert!(cursor.is_none());
613///
614/// # Ok::<(), Error>(())
615/// ```
616///
617/// The cursor allows mutation of values in the tree.
618///
619/// ```
620/// use kernel::{alloc::flags, rbtree::RBTree};
621///
622/// // Create a new tree.
623/// let mut tree = RBTree::new();
624///
625/// // Insert three elements.
626/// tree.try_create_and_insert(10, 100, flags::GFP_KERNEL)?;
627/// tree.try_create_and_insert(20, 200, flags::GFP_KERNEL)?;
628/// tree.try_create_and_insert(30, 300, flags::GFP_KERNEL)?;
629///
630/// // Retrieve a cursor.
631/// let mut cursor = tree.cursor_front().unwrap();
632///
633/// // Get a mutable reference to the current value.
634/// let (k, v) = cursor.current_mut();
635/// *v = 1000;
636///
637/// // The updated value is reflected in the tree.
638/// let updated = tree.get(&10).unwrap();
639/// assert_eq!(updated, &1000);
640///
641/// # Ok::<(), Error>(())
642/// ```
643///
644/// It also allows node removal. The following examples demonstrate the behavior of removing the current node.
645///
646/// ```
647/// use kernel::{alloc::flags, rbtree::RBTree};
648///
649/// // Create a new tree.
650/// let mut tree = RBTree::new();
651///
652/// // Insert three elements.
653/// tree.try_create_and_insert(10, 100, flags::GFP_KERNEL)?;
654/// tree.try_create_and_insert(20, 200, flags::GFP_KERNEL)?;
655/// tree.try_create_and_insert(30, 300, flags::GFP_KERNEL)?;
656///
657/// // Remove the first element.
658/// let mut cursor = tree.cursor_front().unwrap();
659/// let mut current = cursor.current();
660/// assert_eq!(current, (&10, &100));
661/// cursor = cursor.remove_current().0.unwrap();
662///
663/// // If a node exists after the current element, it is returned.
664/// current = cursor.current();
665/// assert_eq!(current, (&20, &200));
666///
667/// // Get a cursor to the last element, and remove it.
668/// cursor = tree.cursor_back().unwrap();
669/// current = cursor.current();
670/// assert_eq!(current, (&30, &300));
671///
672/// // Since there is no next node, the previous node is returned.
673/// cursor = cursor.remove_current().0.unwrap();
674/// current = cursor.current();
675/// assert_eq!(current, (&20, &200));
676///
677/// // Removing the last element in the tree returns [`None`].
678/// assert!(cursor.remove_current().0.is_none());
679///
680/// # Ok::<(), Error>(())
681/// ```
682///
683/// Nodes adjacent to the current node can also be removed.
684///
685/// ```
686/// use kernel::{alloc::flags, rbtree::RBTree};
687///
688/// // Create a new tree.
689/// let mut tree = RBTree::new();
690///
691/// // Insert three elements.
692/// tree.try_create_and_insert(10, 100, flags::GFP_KERNEL)?;
693/// tree.try_create_and_insert(20, 200, flags::GFP_KERNEL)?;
694/// tree.try_create_and_insert(30, 300, flags::GFP_KERNEL)?;
695///
696/// // Get a cursor to the first element.
697/// let mut cursor = tree.cursor_front().unwrap();
698/// let mut current = cursor.current();
699/// assert_eq!(current, (&10, &100));
700///
701/// // Calling `remove_prev` from the first element returns [`None`].
702/// assert!(cursor.remove_prev().is_none());
703///
704/// // Get a cursor to the last element.
705/// cursor = tree.cursor_back().unwrap();
706/// current = cursor.current();
707/// assert_eq!(current, (&30, &300));
708///
709/// // Calling `remove_prev` removes and returns the middle element.
710/// assert_eq!(cursor.remove_prev().unwrap().to_key_value(), (20, 200));
711///
712/// // Calling `remove_next` from the last element returns [`None`].
713/// assert!(cursor.remove_next().is_none());
714///
715/// // Move to the first element
716/// cursor = cursor.move_prev().unwrap();
717/// current = cursor.current();
718/// assert_eq!(current, (&10, &100));
719///
720/// // Calling `remove_next` removes and returns the last element.
721/// assert_eq!(cursor.remove_next().unwrap().to_key_value(), (30, 300));
722///
723/// # Ok::<(), Error>(())
724///
725/// ```
726///
727/// # Invariants
728/// - `current` points to a node that is in the same [`RBTree`] as `tree`.
729pub struct Cursor<'a, K, V> {
730    tree: &'a mut RBTree<K, V>,
731    current: NonNull<bindings::rb_node>,
732}
733
734// SAFETY: The [`Cursor`] has exclusive access to both `K` and `V`, so it is sufficient to require them to be `Send`.
735// The cursor only gives out immutable references to the keys, but since it has excusive access to those same
736// keys, `Send` is sufficient. `Sync` would be okay, but it is more restrictive to the user.
737unsafe impl<'a, K: Send, V: Send> Send for Cursor<'a, K, V> {}
738
739// SAFETY: The [`Cursor`] gives out immutable references to K and mutable references to V,
740// so it has the same thread safety requirements as mutable references.
741unsafe impl<'a, K: Sync, V: Sync> Sync for Cursor<'a, K, V> {}
742
743impl<'a, K, V> Cursor<'a, K, V> {
744    /// The current node
745    pub fn current(&self) -> (&K, &V) {
746        // SAFETY:
747        // - `self.current` is a valid node by the type invariants.
748        // - We have an immutable reference by the function signature.
749        unsafe { Self::to_key_value(self.current) }
750    }
751
752    /// The current node, with a mutable value
753    pub fn current_mut(&mut self) -> (&K, &mut V) {
754        // SAFETY:
755        // - `self.current` is a valid node by the type invariants.
756        // - We have an mutable reference by the function signature.
757        unsafe { Self::to_key_value_mut(self.current) }
758    }
759
760    /// Remove the current node from the tree.
761    ///
762    /// Returns a tuple where the first element is a cursor to the next node, if it exists,
763    /// else the previous node, else [`None`] (if the tree becomes empty). The second element
764    /// is the removed node.
765    pub fn remove_current(self) -> (Option<Self>, RBTreeNode<K, V>) {
766        let prev = self.get_neighbor_raw(Direction::Prev);
767        let next = self.get_neighbor_raw(Direction::Next);
768        // SAFETY: By the type invariant of `Self`, all non-null `rb_node` pointers stored in `self`
769        // point to the links field of `Node<K, V>` objects.
770        let this = unsafe { container_of!(self.current.as_ptr(), Node<K, V>, links) };
771        // SAFETY: `this` is valid by the type invariants as described above.
772        let node = unsafe { KBox::from_raw(this) };
773        let node = RBTreeNode { node };
774        // SAFETY: The reference to the tree used to create the cursor outlives the cursor, so
775        // the tree cannot change. By the tree invariant, all nodes are valid.
776        unsafe { bindings::rb_erase(&mut (*this).links, addr_of_mut!(self.tree.root)) };
777
778        // INVARIANT:
779        // - `current` is a valid node in the [`RBTree`] pointed to by `self.tree`.
780        let cursor = next.or(prev).map(|current| Self {
781            current,
782            tree: self.tree,
783        });
784
785        (cursor, node)
786    }
787
788    /// Remove the previous node, returning it if it exists.
789    pub fn remove_prev(&mut self) -> Option<RBTreeNode<K, V>> {
790        self.remove_neighbor(Direction::Prev)
791    }
792
793    /// Remove the next node, returning it if it exists.
794    pub fn remove_next(&mut self) -> Option<RBTreeNode<K, V>> {
795        self.remove_neighbor(Direction::Next)
796    }
797
798    fn remove_neighbor(&mut self, direction: Direction) -> Option<RBTreeNode<K, V>> {
799        if let Some(neighbor) = self.get_neighbor_raw(direction) {
800            let neighbor = neighbor.as_ptr();
801            // SAFETY: The reference to the tree used to create the cursor outlives the cursor, so
802            // the tree cannot change. By the tree invariant, all nodes are valid.
803            unsafe { bindings::rb_erase(neighbor, addr_of_mut!(self.tree.root)) };
804            // SAFETY: By the type invariant of `Self`, all non-null `rb_node` pointers stored in `self`
805            // point to the links field of `Node<K, V>` objects.
806            let this = unsafe { container_of!(neighbor, Node<K, V>, links) };
807            // SAFETY: `this` is valid by the type invariants as described above.
808            let node = unsafe { KBox::from_raw(this) };
809            return Some(RBTreeNode { node });
810        }
811        None
812    }
813
814    /// Move the cursor to the previous node, returning [`None`] if it doesn't exist.
815    pub fn move_prev(self) -> Option<Self> {
816        self.mv(Direction::Prev)
817    }
818
819    /// Move the cursor to the next node, returning [`None`] if it doesn't exist.
820    pub fn move_next(self) -> Option<Self> {
821        self.mv(Direction::Next)
822    }
823
824    fn mv(self, direction: Direction) -> Option<Self> {
825        // INVARIANT:
826        // - `neighbor` is a valid node in the [`RBTree`] pointed to by `self.tree`.
827        self.get_neighbor_raw(direction).map(|neighbor| Self {
828            tree: self.tree,
829            current: neighbor,
830        })
831    }
832
833    /// Access the previous node without moving the cursor.
834    pub fn peek_prev(&self) -> Option<(&K, &V)> {
835        self.peek(Direction::Prev)
836    }
837
838    /// Access the previous node without moving the cursor.
839    pub fn peek_next(&self) -> Option<(&K, &V)> {
840        self.peek(Direction::Next)
841    }
842
843    fn peek(&self, direction: Direction) -> Option<(&K, &V)> {
844        self.get_neighbor_raw(direction).map(|neighbor| {
845            // SAFETY:
846            // - `neighbor` is a valid tree node.
847            // - By the function signature, we have an immutable reference to `self`.
848            unsafe { Self::to_key_value(neighbor) }
849        })
850    }
851
852    /// Access the previous node mutably without moving the cursor.
853    pub fn peek_prev_mut(&mut self) -> Option<(&K, &mut V)> {
854        self.peek_mut(Direction::Prev)
855    }
856
857    /// Access the next node mutably without moving the cursor.
858    pub fn peek_next_mut(&mut self) -> Option<(&K, &mut V)> {
859        self.peek_mut(Direction::Next)
860    }
861
862    fn peek_mut(&mut self, direction: Direction) -> Option<(&K, &mut V)> {
863        self.get_neighbor_raw(direction).map(|neighbor| {
864            // SAFETY:
865            // - `neighbor` is a valid tree node.
866            // - By the function signature, we have a mutable reference to `self`.
867            unsafe { Self::to_key_value_mut(neighbor) }
868        })
869    }
870
871    fn get_neighbor_raw(&self, direction: Direction) -> Option<NonNull<bindings::rb_node>> {
872        // SAFETY: `self.current` is valid by the type invariants.
873        let neighbor = unsafe {
874            match direction {
875                Direction::Prev => bindings::rb_prev(self.current.as_ptr()),
876                Direction::Next => bindings::rb_next(self.current.as_ptr()),
877            }
878        };
879
880        NonNull::new(neighbor)
881    }
882
883    /// # Safety
884    ///
885    /// - `node` must be a valid pointer to a node in an [`RBTree`].
886    /// - The caller has immutable access to `node` for the duration of `'b`.
887    unsafe fn to_key_value<'b>(node: NonNull<bindings::rb_node>) -> (&'b K, &'b V) {
888        // SAFETY: the caller guarantees that `node` is a valid pointer in an `RBTree`.
889        let (k, v) = unsafe { Self::to_key_value_raw(node) };
890        // SAFETY: the caller guarantees immutable access to `node`.
891        (k, unsafe { &*v })
892    }
893
894    /// # Safety
895    ///
896    /// - `node` must be a valid pointer to a node in an [`RBTree`].
897    /// - The caller has mutable access to `node` for the duration of `'b`.
898    unsafe fn to_key_value_mut<'b>(node: NonNull<bindings::rb_node>) -> (&'b K, &'b mut V) {
899        // SAFETY: the caller guarantees that `node` is a valid pointer in an `RBTree`.
900        let (k, v) = unsafe { Self::to_key_value_raw(node) };
901        // SAFETY: the caller guarantees mutable access to `node`.
902        (k, unsafe { &mut *v })
903    }
904
905    /// # Safety
906    ///
907    /// - `node` must be a valid pointer to a node in an [`RBTree`].
908    /// - The caller has immutable access to the key for the duration of `'b`.
909    unsafe fn to_key_value_raw<'b>(node: NonNull<bindings::rb_node>) -> (&'b K, *mut V) {
910        // SAFETY: By the type invariant of `Self`, all non-null `rb_node` pointers stored in `self`
911        // point to the links field of `Node<K, V>` objects.
912        let this = unsafe { container_of!(node.as_ptr(), Node<K, V>, links) };
913        // SAFETY: The passed `node` is the current node or a non-null neighbor,
914        // thus `this` is valid by the type invariants.
915        let k = unsafe { &(*this).key };
916        // SAFETY: The passed `node` is the current node or a non-null neighbor,
917        // thus `this` is valid by the type invariants.
918        let v = unsafe { addr_of_mut!((*this).value) };
919        (k, v)
920    }
921}
922
923/// Direction for [`Cursor`] operations.
924enum Direction {
925    /// the node immediately before, in sort order
926    Prev,
927    /// the node immediately after, in sort order
928    Next,
929}
930
931impl<'a, K, V> IntoIterator for &'a RBTree<K, V> {
932    type Item = (&'a K, &'a V);
933    type IntoIter = Iter<'a, K, V>;
934
935    fn into_iter(self) -> Self::IntoIter {
936        self.iter()
937    }
938}
939
940/// An iterator over the nodes of a [`RBTree`].
941///
942/// Instances are created by calling [`RBTree::iter`].
943pub struct Iter<'a, K, V> {
944    _tree: PhantomData<&'a RBTree<K, V>>,
945    iter_raw: IterRaw<K, V>,
946}
947
948// SAFETY: The [`Iter`] gives out immutable references to K and V, so it has the same
949// thread safety requirements as immutable references.
950unsafe impl<'a, K: Sync, V: Sync> Send for Iter<'a, K, V> {}
951
952// SAFETY: The [`Iter`] gives out immutable references to K and V, so it has the same
953// thread safety requirements as immutable references.
954unsafe impl<'a, K: Sync, V: Sync> Sync for Iter<'a, K, V> {}
955
956impl<'a, K, V> Iterator for Iter<'a, K, V> {
957    type Item = (&'a K, &'a V);
958
959    fn next(&mut self) -> Option<Self::Item> {
960        // SAFETY: Due to `self._tree`, `k` and `v` are valid for the lifetime of `'a`.
961        self.iter_raw.next().map(|(k, v)| unsafe { (&*k, &*v) })
962    }
963}
964
965impl<'a, K, V> IntoIterator for &'a mut RBTree<K, V> {
966    type Item = (&'a K, &'a mut V);
967    type IntoIter = IterMut<'a, K, V>;
968
969    fn into_iter(self) -> Self::IntoIter {
970        self.iter_mut()
971    }
972}
973
974/// A mutable iterator over the nodes of a [`RBTree`].
975///
976/// Instances are created by calling [`RBTree::iter_mut`].
977pub struct IterMut<'a, K, V> {
978    _tree: PhantomData<&'a mut RBTree<K, V>>,
979    iter_raw: IterRaw<K, V>,
980}
981
982// SAFETY: The [`IterMut`] has exclusive access to both `K` and `V`, so it is sufficient to require them to be `Send`.
983// The iterator only gives out immutable references to the keys, but since the iterator has excusive access to those same
984// keys, `Send` is sufficient. `Sync` would be okay, but it is more restrictive to the user.
985unsafe impl<'a, K: Send, V: Send> Send for IterMut<'a, K, V> {}
986
987// SAFETY: The [`IterMut`] gives out immutable references to K and mutable references to V, so it has the same
988// thread safety requirements as mutable references.
989unsafe impl<'a, K: Sync, V: Sync> Sync for IterMut<'a, K, V> {}
990
991impl<'a, K, V> Iterator for IterMut<'a, K, V> {
992    type Item = (&'a K, &'a mut V);
993
994    fn next(&mut self) -> Option<Self::Item> {
995        self.iter_raw.next().map(|(k, v)|
996            // SAFETY: Due to `&mut self`, we have exclusive access to `k` and `v`, for the lifetime of `'a`.
997            unsafe { (&*k, &mut *v) })
998    }
999}
1000
1001/// A raw iterator over the nodes of a [`RBTree`].
1002///
1003/// # Invariants
1004/// - `self.next` is a valid pointer.
1005/// - `self.next` points to a node stored inside of a valid `RBTree`.
1006struct IterRaw<K, V> {
1007    next: *mut bindings::rb_node,
1008    _phantom: PhantomData<fn() -> (K, V)>,
1009}
1010
1011impl<K, V> Iterator for IterRaw<K, V> {
1012    type Item = (*mut K, *mut V);
1013
1014    fn next(&mut self) -> Option<Self::Item> {
1015        if self.next.is_null() {
1016            return None;
1017        }
1018
1019        // SAFETY: By the type invariant of `IterRaw`, `self.next` is a valid node in an `RBTree`,
1020        // and by the type invariant of `RBTree`, all nodes point to the links field of `Node<K, V>` objects.
1021        let cur = unsafe { container_of!(self.next, Node<K, V>, links) };
1022
1023        // SAFETY: `self.next` is a valid tree node by the type invariants.
1024        self.next = unsafe { bindings::rb_next(self.next) };
1025
1026        // SAFETY: By the same reasoning above, it is safe to dereference the node.
1027        Some(unsafe { (addr_of_mut!((*cur).key), addr_of_mut!((*cur).value)) })
1028    }
1029}
1030
1031/// A memory reservation for a red-black tree node.
1032///
1033///
1034/// It contains the memory needed to hold a node that can be inserted into a red-black tree. One
1035/// can be obtained by directly allocating it ([`RBTreeNodeReservation::new`]).
1036pub struct RBTreeNodeReservation<K, V> {
1037    node: KBox<MaybeUninit<Node<K, V>>>,
1038}
1039
1040impl<K, V> RBTreeNodeReservation<K, V> {
1041    /// Allocates memory for a node to be eventually initialised and inserted into the tree via a
1042    /// call to [`RBTree::insert`].
1043    pub fn new(flags: Flags) -> Result<RBTreeNodeReservation<K, V>> {
1044        Ok(RBTreeNodeReservation {
1045            node: KBox::new_uninit(flags)?,
1046        })
1047    }
1048}
1049
1050// SAFETY: This doesn't actually contain K or V, and is just a memory allocation. Those can always
1051// be moved across threads.
1052unsafe impl<K, V> Send for RBTreeNodeReservation<K, V> {}
1053
1054// SAFETY: This doesn't actually contain K or V, and is just a memory allocation.
1055unsafe impl<K, V> Sync for RBTreeNodeReservation<K, V> {}
1056
1057impl<K, V> RBTreeNodeReservation<K, V> {
1058    /// Initialises a node reservation.
1059    ///
1060    /// It then becomes an [`RBTreeNode`] that can be inserted into a tree.
1061    pub fn into_node(self, key: K, value: V) -> RBTreeNode<K, V> {
1062        let node = KBox::write(
1063            self.node,
1064            Node {
1065                key,
1066                value,
1067                links: bindings::rb_node::default(),
1068            },
1069        );
1070        RBTreeNode { node }
1071    }
1072}
1073
1074/// A red-black tree node.
1075///
1076/// The node is fully initialised (with key and value) and can be inserted into a tree without any
1077/// extra allocations or failure paths.
1078pub struct RBTreeNode<K, V> {
1079    node: KBox<Node<K, V>>,
1080}
1081
1082impl<K, V> RBTreeNode<K, V> {
1083    /// Allocates and initialises a node that can be inserted into the tree via
1084    /// [`RBTree::insert`].
1085    pub fn new(key: K, value: V, flags: Flags) -> Result<RBTreeNode<K, V>> {
1086        Ok(RBTreeNodeReservation::new(flags)?.into_node(key, value))
1087    }
1088
1089    /// Get the key and value from inside the node.
1090    pub fn to_key_value(self) -> (K, V) {
1091        let node = KBox::into_inner(self.node);
1092
1093        (node.key, node.value)
1094    }
1095}
1096
1097// SAFETY: If K and V can be sent across threads, then it's also okay to send [`RBTreeNode`] across
1098// threads.
1099unsafe impl<K: Send, V: Send> Send for RBTreeNode<K, V> {}
1100
1101// SAFETY: If K and V can be accessed without synchronization, then it's also okay to access
1102// [`RBTreeNode`] without synchronization.
1103unsafe impl<K: Sync, V: Sync> Sync for RBTreeNode<K, V> {}
1104
1105impl<K, V> RBTreeNode<K, V> {
1106    /// Drop the key and value, but keep the allocation.
1107    ///
1108    /// It then becomes a reservation that can be re-initialised into a different node (i.e., with
1109    /// a different key and/or value).
1110    ///
1111    /// The existing key and value are dropped in-place as part of this operation, that is, memory
1112    /// may be freed (but only for the key/value; memory for the node itself is kept for reuse).
1113    pub fn into_reservation(self) -> RBTreeNodeReservation<K, V> {
1114        RBTreeNodeReservation {
1115            node: KBox::drop_contents(self.node),
1116        }
1117    }
1118}
1119
1120/// A view into a single entry in a map, which may either be vacant or occupied.
1121///
1122/// This enum is constructed from the [`RBTree::entry`].
1123///
1124/// [`entry`]: fn@RBTree::entry
1125pub enum Entry<'a, K, V> {
1126    /// This [`RBTree`] does not have a node with this key.
1127    Vacant(VacantEntry<'a, K, V>),
1128    /// This [`RBTree`] already has a node with this key.
1129    Occupied(OccupiedEntry<'a, K, V>),
1130}
1131
1132/// Like [`Entry`], except that it doesn't have ownership of the key.
1133enum RawEntry<'a, K, V> {
1134    Vacant(RawVacantEntry<'a, K, V>),
1135    Occupied(OccupiedEntry<'a, K, V>),
1136}
1137
1138/// A view into a vacant entry in a [`RBTree`]. It is part of the [`Entry`] enum.
1139pub struct VacantEntry<'a, K, V> {
1140    key: K,
1141    raw: RawVacantEntry<'a, K, V>,
1142}
1143
1144/// Like [`VacantEntry`], but doesn't hold on to the key.
1145///
1146/// # Invariants
1147/// - `parent` may be null if the new node becomes the root.
1148/// - `child_field_of_parent` is a valid pointer to the left-child or right-child of `parent`. If `parent` is
1149///   null, it is a pointer to the root of the [`RBTree`].
1150struct RawVacantEntry<'a, K, V> {
1151    rbtree: *mut RBTree<K, V>,
1152    /// The node that will become the parent of the new node if we insert one.
1153    parent: *mut bindings::rb_node,
1154    /// This points to the left-child or right-child field of `parent`, or `root` if `parent` is
1155    /// null.
1156    child_field_of_parent: *mut *mut bindings::rb_node,
1157    _phantom: PhantomData<&'a mut RBTree<K, V>>,
1158}
1159
1160impl<'a, K, V> RawVacantEntry<'a, K, V> {
1161    /// Inserts the given node into the [`RBTree`] at this entry.
1162    ///
1163    /// The `node` must have a key such that inserting it here does not break the ordering of this
1164    /// [`RBTree`].
1165    fn insert(self, node: RBTreeNode<K, V>) -> &'a mut V {
1166        let node = KBox::into_raw(node.node);
1167
1168        // SAFETY: `node` is valid at least until we call `KBox::from_raw`, which only happens when
1169        // the node is removed or replaced.
1170        let node_links = unsafe { addr_of_mut!((*node).links) };
1171
1172        // INVARIANT: We are linking in a new node, which is valid. It remains valid because we
1173        // "forgot" it with `KBox::into_raw`.
1174        // SAFETY: The type invariants of `RawVacantEntry` are exactly the safety requirements of `rb_link_node`.
1175        unsafe { bindings::rb_link_node(node_links, self.parent, self.child_field_of_parent) };
1176
1177        // SAFETY: All pointers are valid. `node` has just been inserted into the tree.
1178        unsafe { bindings::rb_insert_color(node_links, addr_of_mut!((*self.rbtree).root)) };
1179
1180        // SAFETY: The node is valid until we remove it from the tree.
1181        unsafe { &mut (*node).value }
1182    }
1183}
1184
1185impl<'a, K, V> VacantEntry<'a, K, V> {
1186    /// Inserts the given node into the [`RBTree`] at this entry.
1187    pub fn insert(self, value: V, reservation: RBTreeNodeReservation<K, V>) -> &'a mut V {
1188        self.raw.insert(reservation.into_node(self.key, value))
1189    }
1190}
1191
1192/// A view into an occupied entry in a [`RBTree`]. It is part of the [`Entry`] enum.
1193///
1194/// # Invariants
1195/// - `node_links` is a valid, non-null pointer to a tree node in `self.rbtree`
1196pub struct OccupiedEntry<'a, K, V> {
1197    rbtree: &'a mut RBTree<K, V>,
1198    /// The node that this entry corresponds to.
1199    node_links: *mut bindings::rb_node,
1200}
1201
1202impl<'a, K, V> OccupiedEntry<'a, K, V> {
1203    /// Gets a reference to the value in the entry.
1204    pub fn get(&self) -> &V {
1205        // SAFETY:
1206        // - `self.node_links` is a valid pointer to a node in the tree.
1207        // - We have shared access to the underlying tree, and can thus give out a shared reference.
1208        unsafe { &(*container_of!(self.node_links, Node<K, V>, links)).value }
1209    }
1210
1211    /// Gets a mutable reference to the value in the entry.
1212    pub fn get_mut(&mut self) -> &mut V {
1213        // SAFETY:
1214        // - `self.node_links` is a valid pointer to a node in the tree.
1215        // - We have exclusive access to the underlying tree, and can thus give out a mutable reference.
1216        unsafe { &mut (*(container_of!(self.node_links, Node<K, V>, links))).value }
1217    }
1218
1219    /// Converts the entry into a mutable reference to its value.
1220    ///
1221    /// If you need multiple references to the `OccupiedEntry`, see [`self#get_mut`].
1222    pub fn into_mut(self) -> &'a mut V {
1223        // SAFETY:
1224        // - `self.node_links` is a valid pointer to a node in the tree.
1225        // - This consumes the `&'a mut RBTree<K, V>`, therefore it can give out a mutable reference that lives for `'a`.
1226        unsafe { &mut (*(container_of!(self.node_links, Node<K, V>, links))).value }
1227    }
1228
1229    /// Remove this entry from the [`RBTree`].
1230    pub fn remove_node(self) -> RBTreeNode<K, V> {
1231        // SAFETY: The node is a node in the tree, so it is valid.
1232        unsafe { bindings::rb_erase(self.node_links, &mut self.rbtree.root) };
1233
1234        // INVARIANT: The node is being returned and the caller may free it, however, it was
1235        // removed from the tree. So the invariants still hold.
1236        RBTreeNode {
1237            // SAFETY: The node was a node in the tree, but we removed it, so we can convert it
1238            // back into a box.
1239            node: unsafe { KBox::from_raw(container_of!(self.node_links, Node<K, V>, links)) },
1240        }
1241    }
1242
1243    /// Takes the value of the entry out of the map, and returns it.
1244    pub fn remove(self) -> V {
1245        let rb_node = self.remove_node();
1246        let node = KBox::into_inner(rb_node.node);
1247
1248        node.value
1249    }
1250
1251    /// Swap the current node for the provided node.
1252    ///
1253    /// The key of both nodes must be equal.
1254    fn replace(self, node: RBTreeNode<K, V>) -> RBTreeNode<K, V> {
1255        let node = KBox::into_raw(node.node);
1256
1257        // SAFETY: `node` is valid at least until we call `KBox::from_raw`, which only happens when
1258        // the node is removed or replaced.
1259        let new_node_links = unsafe { addr_of_mut!((*node).links) };
1260
1261        // SAFETY: This updates the pointers so that `new_node_links` is in the tree where
1262        // `self.node_links` used to be.
1263        unsafe {
1264            bindings::rb_replace_node(self.node_links, new_node_links, &mut self.rbtree.root)
1265        };
1266
1267        // SAFETY:
1268        // - `self.node_ptr` produces a valid pointer to a node in the tree.
1269        // - Now that we removed this entry from the tree, we can convert the node to a box.
1270        let old_node = unsafe { KBox::from_raw(container_of!(self.node_links, Node<K, V>, links)) };
1271
1272        RBTreeNode { node: old_node }
1273    }
1274}
1275
1276struct Node<K, V> {
1277    links: bindings::rb_node,
1278    key: K,
1279    value: V,
1280}