30 /// let mut tree = RBTree::new();
46 ///     let mut iter = tree.iter();
63 ///     let mut iter = tree.iter();
75 ///     let mut iter = tree.iter();
87 ///     let mut iter = tree.iter();
105 ///     let node = RBTreeNode::new(10, 100, flags::GFP_KERNEL)?;
109 ///     let mut guard = tree.lock();
121 /// let mut tree = RBTree::new();
130 ///     let mut iter = tree.iter();
138 /// let existing = tree.remove(&30);
142 ///     let mut iter = tree.iter();
149 /// let reservation = RBTreeNodeReservation::new(flags::GFP_KERNEL)?;
157 ///     let mut iter = tree.iter();
241         let root = addr_of_mut!(self.root);  in cursor_front()
243         let current = unsafe { bindings::rb_first(root) };  in cursor_front()
256         let root = addr_of_mut!(self.root);  in cursor_back()
258         let current = unsafe { bindings::rb_last(root) };  in cursor_back()
306         let raw_self: *mut RBTree<K, V> = self;  in raw_entry()
325         let mut parent = core::ptr::null_mut();  in raw_entry()
326         let mut child_field_of_parent: &mut *mut bindings::rb_node =  in raw_entry()
330             let curr = *child_field_of_parent;  in raw_entry()
332             let node = unsafe { container_of!(curr, Node<K, V>, links) };  in raw_entry()
376         let mut node = self.root.rb_node;  in get()
380             let this = unsafe { container_of!(node, Node<K, V>, links) };  in get()
422         let mut node = self.root.rb_node;  in cursor_lower_bound()
423         let mut best_match: Option<NonNull<Node<K, V>>> = None;  in cursor_lower_bound()
427             let this = unsafe { container_of!(node, Node<K, V>, links) }.cast_mut();  in cursor_lower_bound()
429             let this_key = unsafe { &(*this).key };  in cursor_lower_bound()
431             let left_child = unsafe { (*node).rb_left };  in cursor_lower_bound()
433             let right_child = unsafe { (*node).rb_right };  in cursor_lower_bound()
443                     let is_better_match = match best_match {  in cursor_lower_bound()
447                             let best_key = unsafe { &(*best.as_ptr()).key };  in cursor_lower_bound()
459         let best = best_match?;  in cursor_lower_bound()
462         let links = unsafe { addr_of_mut!((*best.as_ptr()).links) };  in cursor_lower_bound()
484         let mut next = unsafe { bindings::rb_first_postorder(&self.root) };  in drop()
489             let this = unsafe { container_of!(next, Node<K, V>, links) };  in drop()
515 /// let mut tree = RBTree::new();
523 /// let mut cursor = tree.cursor_front().unwrap();
524 /// let mut current = cursor.current();
533 /// let next = cursor.peek_next().unwrap();
542 /// let cursor = cursor.move_next();
554 /// let mut tree = RBTree::new();
561 /// let mut cursor = tree.cursor_back().unwrap();
562 /// let current = cursor.current();
573 /// let mut tree: RBTree<u16, u16> = RBTree::new();
585 /// let mut tree = RBTree::new();
595 /// let cursor = tree.cursor_lower_bound(&20).unwrap();
596 /// let current = cursor.current();
600 /// let cursor = tree.cursor_lower_bound(&25).unwrap();
601 /// let current = cursor.current();
605 /// let cursor = tree.cursor_lower_bound(&55);
617 /// let mut tree = RBTree::new();
625 /// let mut cursor = tree.cursor_front().unwrap();
628 /// let (k, v) = cursor.current_mut();
632 /// let updated = tree.get(&10).unwrap();
644 /// let mut tree = RBTree::new();
652 /// let mut cursor = tree.cursor_front().unwrap();
653 /// let mut current = cursor.current();
683 /// let mut tree = RBTree::new();
691 /// let mut cursor = tree.cursor_front().unwrap();
692 /// let mut current = cursor.current();
760         let prev = self.get_neighbor_raw(Direction::Prev);  in remove_current()
761         let next = self.get_neighbor_raw(Direction::Next);  in remove_current()
764         let this = unsafe { container_of!(self.current.as_ptr(), Node<K, V>, links) }.cast_mut();  in remove_current()
766         let node = unsafe { KBox::from_raw(this) };  in remove_current()
767         let node = RBTreeNode { node };  in remove_current()
772         let current = match (prev, next) {  in remove_current()
802         if let Some(neighbor) = self.get_neighbor_raw(direction) {  in remove_neighbor()
803             let neighbor = neighbor.as_ptr();  in remove_neighbor()
809             let this = unsafe { container_of!(neighbor, Node<K, V>, links) }.cast_mut();  in remove_neighbor()
811             let node = unsafe { KBox::from_raw(this) };  in remove_neighbor()
876         let neighbor = unsafe {  in get_neighbor_raw()
892         let (k, v) = unsafe { Self::to_key_value_raw(node) };  in to_key_value()
903         let (k, v) = unsafe { Self::to_key_value_raw(node) };  in to_key_value_mut()
915         let this = unsafe { container_of!(node.as_ptr(), Node<K, V>, links) }.cast_mut();  in to_key_value_raw()
918         let k = unsafe { &(*this).key };  in to_key_value_raw()
921         let v = unsafe { addr_of_mut!((*this).value) };  in to_key_value_raw()
1024         let cur = unsafe { container_of!(self.next, Node<K, V>, links) }.cast_mut();  in next()
1065         let node = KBox::write(  in into_node()
1094         let node = KBox::into_inner(self.node);  in to_key_value()
1169         let node = KBox::into_raw(node.node);  in insert()
1173         let node_links = unsafe { addr_of_mut!((*node).links) };  in insert()
1250         let rb_node = self.remove_node();  in remove()
1251         let node = KBox::into_inner(rb_node.node);  in remove()
1260         let node = KBox::into_raw(node.node);  in replace()
1264         let new_node_links = unsafe { addr_of_mut!((*node).links) };  in replace()
1275         let old_node =  in replace()