28     free_tree: RBTree<FreeKey, ()>,  field
41             free_tree: RBTree::new(),  in from_array()
50                 let free_node = alloc.free_tree.pop().unwrap();  in from_array()
51                 tree.free_tree  in from_array()
64             let free_res = alloc.free_tree.pop().unwrap();  in from_array()
74             let free_node = alloc.free_tree.pop().unwrap();  in from_array()
75             tree.free_tree  in from_array()
143         let free_cursor = self.free_tree.cursor_lower_bound(&(size, 0))?;  in find_best_match()
190         self.free_tree.remove(&(found_size, found_off));  in reserve_new()
194             self.free_tree.insert(free_tree_node);  in reserve_new()
274                 self.free_tree.remove(&(next.size, next.offset));  in reservation_abort()
294                 self.free_tree.remove(&(prev.size, prev.offset));  in reservation_abort()
303         self.free_tree  in reservation_abort()
469     free_tree: KVec<RBTreeNodeReservation<FreeKey, ()>>,  field
481         let mut free_tree = KVec::with_capacity(num_descriptors, GFP_KERNEL)?;  in try_new()  localVariable
483             free_tree.push(RBTreeNodeReservation::new(GFP_KERNEL)?, GFP_KERNEL)?;  in try_new()
486         Ok(Self { tree, free_tree })  in try_new()