3 use crate::bkey::BkeySC;
5 use crate::errcode::{bch_errcode, errptr_to_result_c};
6 use crate::printbuf_to_formatter;
8 use std::marker::PhantomData;
9 use std::mem::MaybeUninit;
11 use bitflags::bitflags;
13 pub struct BtreeTrans<'f> {
15 fs: PhantomData<&'f Fs>
18 impl<'f> BtreeTrans<'f> {
19 pub fn new(fs: &'f Fs) -> BtreeTrans {
21 let mut trans: MaybeUninit<c::btree_trans> = MaybeUninit::uninit();
23 c::__bch2_trans_init(&mut (*trans.as_mut_ptr()), fs.raw, 0);
24 BtreeTrans { raw: trans.assume_init(), fs: PhantomData }
29 impl<'f> Drop for BtreeTrans<'f> {
31 unsafe { c::bch2_trans_exit(&mut self.raw) }
36 pub struct BtreeIterFlags: u16 {
37 const SLOTS = c::BTREE_ITER_SLOTS as u16;
38 const ALL_LEVELS = c::BTREE_ITER_ALL_LEVELS as u16;
39 const INTENT = c::BTREE_ITER_INTENT as u16;
40 const PREFETCH = c::BTREE_ITER_PREFETCH as u16;
41 const IS_EXTENTS = c::BTREE_ITER_IS_EXTENTS as u16;
42 const NOT_EXTENTS = c::BTREE_ITER_NOT_EXTENTS as u16;
43 const CACHED = c::BTREE_ITER_CACHED as u16;
44 const KEY_CACHED = c::BTREE_ITER_WITH_KEY_CACHE as u16;
45 const WITH_UPDATES = c::BTREE_ITER_WITH_UPDATES as u16;
46 const WITH_JOURNAL = c::BTREE_ITER_WITH_JOURNAL as u16;
47 const __ALL_SNAPSHOTS = c::__BTREE_ITER_ALL_SNAPSHOTS as u16;
48 const ALL_SNAPSHOTS = c::BTREE_ITER_ALL_SNAPSHOTS as u16;
49 const FILTER_SNAPSHOTS = c::BTREE_ITER_FILTER_SNAPSHOTS as u16;
50 const NOPRESERVE = c::BTREE_ITER_NOPRESERVE as u16;
51 const CACHED_NOFILL = c::BTREE_ITER_CACHED_NOFILL as u16;
52 const KEY_CACHE_FILL = c::BTREE_ITER_KEY_CACHE_FILL as u16;
56 pub struct BtreeIter<'t> {
58 trans: PhantomData<&'t BtreeTrans<'t>>,
61 impl<'t> BtreeIter<'t> {
62 pub fn new(trans: &'t BtreeTrans<'t>, btree: c::btree_id, pos: c::bpos, flags: BtreeIterFlags) -> BtreeIter<'t> {
64 let mut iter: MaybeUninit<c::btree_iter> = MaybeUninit::uninit();
66 c::bch2_trans_iter_init_outlined(
67 ptr::addr_of!(trans.raw).cast_mut(),
73 BtreeIter { raw: iter.assume_init(), trans: PhantomData }
77 pub fn peek_upto<'i>(&'i mut self, end: c::bpos) -> Result<Option<BkeySC>, bch_errcode> {
79 let k = c::bch2_btree_iter_peek_upto(&mut self.raw, end);
80 errptr_to_result_c(k.k)
81 .map(|_| if !k.k.is_null() { Some(BkeySC { k: &*k.k, v: &*k.v, iter: PhantomData }) } else { None } )
85 pub fn peek(&mut self) -> Result<Option<BkeySC>, bch_errcode> {
86 self.peek_upto(SPOS_MAX)
89 pub fn peek_and_restart(&mut self) -> Result<Option<BkeySC>, bch_errcode> {
91 let k = c::bch2_btree_iter_peek_and_restart_outlined(&mut self.raw);
93 errptr_to_result_c(k.k)
94 .map(|_| if !k.k.is_null() { Some(BkeySC{ k: &*k.k, v: &*k.v, iter: PhantomData }) } else { None } )
98 pub fn advance(&mut self) {
100 c::bch2_btree_iter_advance(&mut self.raw);
105 impl<'t> Drop for BtreeIter<'t> {
107 unsafe { c::bch2_trans_iter_exit(self.raw.trans, &mut self.raw) }
111 pub struct BtreeNodeIter<'t> {
113 trans: PhantomData<&'t BtreeTrans<'t>>,
116 impl<'t> BtreeNodeIter<'t> {
117 pub fn new(trans: &'t BtreeTrans<'t>,
122 flags: BtreeIterFlags) -> BtreeNodeIter {
124 let mut iter: MaybeUninit<c::btree_iter> = MaybeUninit::uninit();
125 c::bch2_trans_node_iter_init(
126 ptr::addr_of!(trans.raw).cast_mut(),
134 BtreeNodeIter { raw: iter.assume_init(), trans: PhantomData }
138 pub fn peek<'i>(&'i mut self) -> Result<Option<&'i c::btree>, bch_errcode> {
140 let b = c::bch2_btree_iter_peek_node(&mut self.raw);
141 errptr_to_result_c(b).map(|b| if !b.is_null() { Some(&*b) } else { None })
145 pub fn peek_and_restart<'i>(&'i mut self) -> Result<Option<&'i c::btree>, bch_errcode> {
147 let b = c::bch2_btree_iter_peek_node_and_restart(&mut self.raw);
148 errptr_to_result_c(b).map(|b| if !b.is_null() { Some(&*b) } else { None })
152 pub fn advance<'i>(&'i mut self) {
154 c::bch2_btree_iter_next_node(&mut self.raw);
158 pub fn next<'i>(&'i mut self) -> Result<Option<&'i c::btree>, bch_errcode> {
160 let b = c::bch2_btree_iter_next_node(&mut self.raw);
161 errptr_to_result_c(b).map(|b| if !b.is_null() { Some(&*b) } else { None })
166 impl<'t> Drop for BtreeNodeIter<'t> {
168 unsafe { c::bch2_trans_iter_exit(self.raw.trans, &mut self.raw) }
172 impl<'b, 'f> c::btree {
173 pub fn to_text(&'b self, fs: &'f Fs) -> BtreeNodeToText<'b, 'f> {
174 BtreeNodeToText { b: &self, fs }
177 pub fn ondisk_to_text(&'b self, fs: &'f Fs) -> BtreeNodeOndiskToText<'b, 'f> {
178 BtreeNodeOndiskToText { b: &self, fs }
182 pub struct BtreeNodeToText<'b, 'f> {
187 impl<'b, 'f> fmt::Display for BtreeNodeToText<'b, 'f> {
188 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
189 printbuf_to_formatter(f, |buf| unsafe { c::bch2_btree_node_to_text(buf, self.fs.raw, self.b) })
193 pub struct BtreeNodeOndiskToText<'b, 'f> {
198 impl<'b, 'f> fmt::Display for BtreeNodeOndiskToText<'b, 'f> {
199 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
200 printbuf_to_formatter(f, |buf| unsafe { c::bch2_btree_node_ondisk_to_text(buf, self.fs.raw, self.b) })