25     tree: RBTree<usize, Descriptor<T>>,  field
39         let mut tree = TreeRangeAllocator {  in from_array()  localVariable
40             tree: RBTree::new(),  in from_array()
51                 tree.free_tree  in from_array()
53                 let tree_node = alloc.tree.pop().unwrap();  in from_array()
54                 tree.tree.insert(  in from_array()
61                 tree.free_oneway_space = tree.free_oneway_space.saturating_sub(range.size);  in from_array()
65             let tree_node = alloc.tree.pop().unwrap();  in from_array()
68             tree.tree.insert(tree_node.into_node(range.offset, desc));  in from_array()
75             tree.free_tree  in from_array()
77             let tree_node = alloc.tree.pop().unwrap();  in from_array()
78             tree.tree  in from_array()
82         tree  in from_array()
86         let mut tree_iter = self.tree.values();  in is_empty()
108         self.tree  in count_buffers()
115         for desc in self.tree.values() {  in debug_print()
145         self.tree.get_mut(offset)  in find_best_match()
202             self.tree.insert(tree_node);  in reserve_new()
210         let mut cursor = self.tree.cursor_lower_bound_mut(&offset).ok_or_else(|| {  in reservation_abort()
310         let desc = self.tree.get_mut(&offset).ok_or(ENOENT)?;  in reservation_commit()
329         let desc = self.tree.get_mut(&offset).ok_or_else(|| {  in reserve_existing()
362         for (_, desc) in self.tree.iter_mut() {  in take_for_each()
383         for (_, desc) in self.tree.iter() {  in low_oneway_space()
468     tree: KVec<RBTreeNodeReservation<usize, Descriptor<T>>>,  field
476         let mut tree = KVec::with_capacity(num_descriptors, GFP_KERNEL)?;  in try_new()  localVariable
478             tree.push(RBTreeNodeReservation::new(GFP_KERNEL)?, GFP_KERNEL)?;  in try_new()
486         Ok(Self { tree, free_tree })  in try_new()