39         let mut tree = TreeRangeAllocator {  in from_array()
46         let mut free_offset = 0;  in from_array()
48             let free_size = range.offset - free_offset;  in from_array()
50                 let free_node = alloc.free_tree.pop().unwrap();  in from_array()
53                 let tree_node = alloc.tree.pop().unwrap();  in from_array()
64             let free_res = alloc.free_tree.pop().unwrap();  in from_array()
65             let tree_node = alloc.tree.pop().unwrap();  in from_array()
66             let mut desc = Descriptor::new(range.offset, range.size);  in from_array()
73             let free_size = size - free_offset;  in from_array()
74             let free_node = alloc.free_tree.pop().unwrap();  in from_array()
77             let tree_node = alloc.tree.pop().unwrap();  in from_array()
86         let mut tree_iter = self.tree.values();  in is_empty()
89         let first_value = tree_iter.next().unwrap();  in is_empty()
116             let state = match &desc.state {  in debug_print()
143         let free_cursor = self.free_tree.cursor_lower_bound(&(size, 0))?;  in find_best_match()
144         let ((_, offset), ()) = free_cursor.current();  in find_best_match()
158         let new_oneway_space = if is_oneway {  in reserve_new()
173         let oneway_spam_detected =  in reserve_new()
176         let (found_size, found_off, tree_node, free_tree_node) = match self.find_best_match(size) {  in reserve_new()
182                 let found_size = desc.size;  in reserve_new()
183                 let found_offset = desc.offset;  in reserve_new()
186                 let new_desc = Descriptor::new(found_offset + size, found_size - size);  in reserve_new()
187                 let (tree_node, free_tree_node, desc_node_res) = alloc.initialize(new_desc);  in reserve_new()
210         let mut cursor = self.tree.cursor_lower_bound_mut(&offset).ok_or_else(|| {  in reservation_abort()
218         let (_, desc) = cursor.current_mut();  in reservation_abort()
228         let (reservation, free_node_res) = desc.try_change_state(|state| match state {  in reservation_abort()
248         let mut size = desc.size;  in reservation_abort()
249         let mut offset = desc.offset;  in reservation_abort()
250         let free_oneway_space_add = if reservation.is_oneway { size } else { 0 };  in reservation_abort()
254         let mut freed_range = FreedRange::interior_pages(offset, size);  in reservation_abort()
257         let add_next_page_needed = match (offset + size) % PAGE_SIZE {  in reservation_abort()
263         let add_prev_page_needed = match offset % PAGE_SIZE {  in reservation_abort()
269         let remove_next = match cursor.peek_next() {  in reservation_abort()
282             let (_, desc) = cursor.current_mut();  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()
337         let (debug_id, data) = desc.try_change_state(|state| match state {  in reserve_existing()
339                 let (reservation, data) = allocation.deallocate();  in reserve_existing()
340                 let debug_id = reservation.debug_id;  in reserve_existing()
363             if let Some((DescriptorState::Allocated(allocation), _)) = &mut desc.state {  in take_for_each()
381         let mut total_alloc_size = 0;  in low_oneway_space()
382         let mut num_buffers = 0;  in low_oneway_space()
384             if let Some((state, _)) = &desc.state {  in low_oneway_space()
419         let (new_state, result) = f(self.state.take());  in try_change_state()
438         let tree_node_res = RBTreeNodeReservation::new(GFP_KERNEL)?;  in try_new()
439         let free_tree_node_res = RBTreeNodeReservation::new(GFP_KERNEL)?;  in try_new()
440         let desc_node_res = RBTreeNodeReservation::new(GFP_KERNEL)?;  in try_new()
456         let size = desc.size;  in initialize()
457         let offset = desc.offset;  in initialize()
474         let num_descriptors = 2 * len + 1;  in try_new()
476         let mut tree = KVec::with_capacity(num_descriptors, GFP_KERNEL)?;  in try_new()
481         let mut free_tree = KVec::with_capacity(num_descriptors, GFP_KERNEL)?;  in try_new()