Home
last modified time | relevance | path

Searched refs:RBTreeNode (Results 1 – 3 of 3) sorted by relevance

/linux/rust/kernel/
H A Drbtree.rs321 ) -> Result<Option<RBTreeNode<K, V>>> { in try_create_and_insert()
322 Ok(self.insert(RBTreeNode::new(key, value, flags)?)) in try_create_and_insert()
331 pub fn insert(&mut self, node: RBTreeNode<K, V>) -> Option<RBTreeNode<K, V>> { in insert()
441 pub fn remove_node(&mut self, key: &K) -> Option<RBTreeNode<K, V>> { in remove_node()
918 pub fn remove_current(self) -> (Option<Self>, RBTreeNode<K, V>) { in remove_current()
926 let node = RBTreeNode { node }; in remove_current()
942 pub fn remove_prev(&mut self) -> Option<RBTreeNode<K, V>> { in remove_prev()
947 pub fn remove_next(&mut self) -> Option<RBTreeNode<K, V>> { in remove_next()
951 fn remove_neighbor(&mut self, direction: Direction) -> Option<RBTreeNode<K, V>> { in remove_neighbor()
962 return Some(RBTreeNode { node }); in remove_neighbor()
[all …]
/linux/drivers/android/binder/range_alloc/
H A Dtree.rs8 rbtree::{RBTree, RBTreeNode, RBTreeNodeReservation},
452 RBTreeNode<usize, Descriptor<T>>, in initialize()
453 RBTreeNode<FreeKey, ()>, in initialize()
/linux/drivers/android/binder/
H A Dprocess.rs26 rbtree::{self, RBTree, RBTreeNode, RBTreeNodeReservation},
773 let rbnode = RBTreeNode::new(ptr, node.clone(), GFP_KERNEL)?; in get_node_inner()