57     let first = match range.start_bound() {  in to_maple_range()
63     let last = match range.end_bound() {  in to_maple_range()
103     /// let tree = KBox::pin_init(MapleTree::<KBox<i32>>::new(), GFP_KERNEL)?;
105     /// let ten = KBox::new(10, GFP_KERNEL)?;
106     /// let twenty = KBox::new(20, GFP_KERNEL)?;
107     /// let the_answer = KBox::new(42, GFP_KERNEL)?;
142     /// let tree = KBox::pin_init(MapleTree::<KBox<i32>>::new(), GFP_KERNEL)?;
144     /// let ten = KBox::new(10, GFP_KERNEL)?;
145     /// let twenty = KBox::new(20, GFP_KERNEL)?;
146     /// let the_answer = KBox::new(42, GFP_KERNEL)?;
147     /// let hundred = KBox::new(100, GFP_KERNEL)?;
173         let Some((first, last)) = to_maple_range(range) else {  in insert_range()
180         let ptr = T::into_foreign(value);  in insert_range()
183         let res = to_result(unsafe {  in insert_range()
187         if let Err(err) = res {  in insert_range()
189             let value = unsafe { T::from_foreign(ptr) };  in insert_range()
191             let cause = if err == ENOMEM {  in insert_range()
211     /// let tree = KBox::pin_init(MapleTree::<KBox<i32>>::new(), GFP_KERNEL)?;
213     /// let ten = KBox::new(10, GFP_KERNEL)?;
214     /// let twenty = KBox::new(20, GFP_KERNEL)?;
229         let ret = unsafe { bindings::mtree_erase(self.tree.get(), index) };  in erase()
249         let lock_ptr = unsafe { &raw mut (*self.tree.get()).__bindgen_anon_1.ma_lock };  in ma_lock()
263         let mut ma_state = unsafe { MaState::new_raw(self.into_ref().get_ref(), 0, usize::MAX) };  in free_all_entries()
274             let ptr = {  in free_all_entries()
275                 let _rcu = kernel::sync::rcu::Guard::new();  in free_all_entries()
338     /// let tree = KBox::pin_init(MapleTree::<KBox<i32>>::new(), GFP_KERNEL)?;
340     /// let ten = KBox::new(10, GFP_KERNEL)?;
341     /// let twenty = KBox::new(20, GFP_KERNEL)?;
345     /// let mut lock = tree.lock();
358     /// let tree = KBox::pin_init(MapleTree::<Arc<i32>>::new(), GFP_KERNEL)?;
360     /// let ten = Arc::new(10, GFP_KERNEL)?;
361     /// let twenty = Arc::new(20, GFP_KERNEL)?;
366     /// let value = tree.lock().load(100).map(Arc::from);
378         let ret = unsafe { bindings::mtree_load(self.0.tree.get(), index) };  in load()
393         let tree = pin_init!(MapleTree {  in new()
417     /// let tree = KBox::pin_init(MapleTreeAlloc::<KBox<i32>>::new(), GFP_KERNEL)?;
419     /// let ten = KBox::new(10, GFP_KERNEL)?;
420     /// let twenty = KBox::new(20, GFP_KERNEL)?;
421     /// let thirty = KBox::new(30, GFP_KERNEL)?;
422     /// let hundred = KBox::new(100, GFP_KERNEL)?;
425     /// let idx1 = tree.alloc_range(100, ten, ..1000, GFP_KERNEL)?;
426     /// let idx2 = tree.alloc_range(100, twenty, ..1000, GFP_KERNEL)?;
427     /// let idx3 = tree.alloc_range(100, thirty, ..1000, GFP_KERNEL)?;
450         let Some((min, max)) = to_maple_range(range) else {  in alloc_range()
457         let ptr = T::into_foreign(value);  in alloc_range()
458         let mut index = 0;  in alloc_range()
461         let res = to_result(unsafe {  in alloc_range()
473         if let Err(err) = res {  in alloc_range()
475             let value = unsafe { T::from_foreign(ptr) };  in alloc_range()
477             let cause = if err == ENOMEM {  in alloc_range()
555     /// let tree = KBox::pin_init(MapleTree::<Arc<i32>>::new(), GFP_KERNEL)?;
557     /// let ten = Arc::new(10, GFP_KERNEL)?;
558     /// let twenty = Arc::new(20, GFP_KERNEL)?;
562     /// let mut ma_lock = tree.lock();
563     /// let mut iter = ma_lock.ma_state(0, usize::MAX);
572         let ret = self.mas_find_raw(max);  in find()