295     pub fn insert(&mut self, node: RBTreeNode<K, V>) -> Option<RBTreeNode<K, V>> {  in insert()
296         match self.raw_entry(&node.node.key) {  in insert()
297             RawEntry::Occupied(entry) => Some(entry.replace(node)),  in insert()
299                 entry.insert(node);  in insert()
332             let node = unsafe { container_of!(curr, Node<K, V>, links) };  in raw_entry()  localVariable
335             match key.cmp(unsafe { &(*node).key }) {  in raw_entry()
376         let mut node = self.root.rb_node;  in get()  localVariable
377         while !node.is_null() {  in get()
380             let this = unsafe { container_of!(node, Node<K, V>, links) };  in get()
382             node = match key.cmp(unsafe { &(*this).key }) {  in get()
384                 Ordering::Less => unsafe { (*node).rb_left },  in get()
386                 Ordering::Greater => unsafe { (*node).rb_right },  in get()
396         self.find_mut(key).map(|node| node.into_mut())  in get_mut()
422         let mut node = self.root.rb_node;  in cursor_lower_bound()  localVariable
424         while !node.is_null() {  in cursor_lower_bound()
427             let this = unsafe { container_of!(node, Node<K, V>, links) }.cast_mut();  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()
440                     node = right_child;  in cursor_lower_bound()
454                     node = left_child;  in cursor_lower_bound()
766         let node = unsafe { KBox::from_raw(this) };  in remove_current()  localVariable
767         let node = RBTreeNode { node };  in remove_current()  localVariable
776                 return (None, node);  in remove_current()
787             node,  in remove_current()
811             let node = unsafe { KBox::from_raw(this) };  in remove_neighbor()  localVariable
812             return Some(RBTreeNode { node });  in remove_neighbor()
890     unsafe fn to_key_value<'b>(node: NonNull<bindings::rb_node>) -> (&'b K, &'b V) {  in to_key_value()
892         let (k, v) = unsafe { Self::to_key_value_raw(node) };  in to_key_value()
901     unsafe fn to_key_value_mut<'b>(node: NonNull<bindings::rb_node>) -> (&'b K, &'b mut V) {  in to_key_value_mut()
903         let (k, v) = unsafe { Self::to_key_value_raw(node) };  in to_key_value_mut()
912     unsafe fn to_key_value_raw<'b>(node: NonNull<bindings::rb_node>) -> (&'b K, *mut V) {  in to_key_value_raw()
915         let this = unsafe { container_of!(node.as_ptr(), Node<K, V>, links) }.cast_mut();  in to_key_value_raw()
1040     node: KBox<MaybeUninit<Node<K, V>>>,  field
1048             node: KBox::new_uninit(flags)?,  in new()
1065         let node = KBox::write(  in into_node()  localVariable
1066             self.node,  in into_node()
1073         RBTreeNode { node }  in into_node()
1082     node: KBox<Node<K, V>>,  field
1094         let node = KBox::into_inner(self.node);  in to_key_value()  localVariable
1096         (node.key, node.value)  in to_key_value()
1118             node: KBox::drop_contents(self.node),  in into_reservation()
1168     fn insert(self, node: RBTreeNode<K, V>) -> &'a mut V {  in insert()
1169         let node = KBox::into_raw(node.node);  in insert()  localVariable
1173         let node_links = unsafe { addr_of_mut!((*node).links) };  in insert()
1184         unsafe { &mut (*node).value }  in insert()
1242             node: unsafe {  in remove_node()
1251         let node = KBox::into_inner(rb_node.node);  in remove()  localVariable
1253         node.value  in remove()
1259     fn replace(self, node: RBTreeNode<K, V>) -> RBTreeNode<K, V> {  in replace()
1260         let node = KBox::into_raw(node.node);  in replace()  localVariable
1264         let new_node_links = unsafe { addr_of_mut!((*node).links) };  in replace()
1278         RBTreeNode { node: old_node }  in replace()