4 use crate::errcode::{bch_errcode, errptr_to_result_c};
5 use std::mem::MaybeUninit;
7 use bitflags::bitflags;
9 pub struct BtreeTrans {
14 pub fn new<'a>(fs: &'a Fs) -> BtreeTrans {
16 let mut trans: MaybeUninit<BtreeTrans> = MaybeUninit::uninit();
18 c::__bch2_trans_init(&mut (*trans.as_mut_ptr()).raw, fs.raw, 0);
24 impl Drop for BtreeTrans {
26 unsafe { c::bch2_trans_exit(&mut self.raw) }
31 pub struct BtreeIterFlags: u16 {
32 const SLOTS = c::BTREE_ITER_SLOTS as u16;
33 const ALL_LEVELS = c::BTREE_ITER_ALL_LEVELS as u16;
34 const INTENT = c::BTREE_ITER_INTENT as u16;
35 const PREFETCH = c::BTREE_ITER_PREFETCH as u16;
36 const IS_EXTENTS = c::BTREE_ITER_IS_EXTENTS as u16;
37 const NOT_EXTENTS = c::BTREE_ITER_NOT_EXTENTS as u16;
38 const CACHED = c::BTREE_ITER_CACHED as u16;
39 const KEY_CACHED = c::BTREE_ITER_WITH_KEY_CACHE as u16;
40 const WITH_UPDATES = c::BTREE_ITER_WITH_UPDATES as u16;
41 const WITH_JOURNAL = c::BTREE_ITER_WITH_JOURNAL as u16;
42 const __ALL_SNAPSHOTS = c::__BTREE_ITER_ALL_SNAPSHOTS as u16;
43 const ALL_SNAPSHOTS = c::BTREE_ITER_ALL_SNAPSHOTS as u16;
44 const FILTER_SNAPSHOTS = c::BTREE_ITER_FILTER_SNAPSHOTS as u16;
45 const NOPRESERVE = c::BTREE_ITER_NOPRESERVE as u16;
46 const CACHED_NOFILL = c::BTREE_ITER_CACHED_NOFILL as u16;
47 const KEY_CACHE_FILL = c::BTREE_ITER_KEY_CACHE_FILL as u16;
51 pub struct BtreeIter {
56 pub fn new<'a>(trans: &'a BtreeTrans, btree: c::btree_id, pos: c::bpos, flags: BtreeIterFlags) -> BtreeIter {
58 let mut iter: MaybeUninit<BtreeIter> = MaybeUninit::uninit();
60 c::bch2_trans_iter_init_outlined(
61 ptr::addr_of!(trans.raw).cast_mut(),
62 &mut (*iter.as_mut_ptr()).raw,
70 pub fn peek_upto(&mut self, end: c::bpos) -> Result<c::bkey_s_c, bch_errcode> {
72 let k = c::bch2_btree_iter_peek_upto(&mut self.raw, end);
73 errptr_to_result_c(k.k).map(|_| k)
77 pub fn peek(&mut self) -> Result<c::bkey_s_c, bch_errcode> {
78 self.peek_upto(SPOS_MAX)
81 pub fn peek_and_restart(&mut self) -> Result<Option<c::bkey_s_c>, bch_errcode> {
83 let k = c::bch2_btree_iter_peek_and_restart_outlined(&mut self.raw);
85 errptr_to_result_c(k.k)
86 .map(|_| if !k.k.is_null() { Some(k) } else { None } )
90 pub fn advance(&mut self) {
92 c::bch2_btree_iter_advance(&mut self.raw);
97 impl Drop for BtreeIter {
99 unsafe { c::bch2_trans_iter_exit(self.raw.trans, &mut self.raw) }