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> {
14 raw: *mut c::btree_trans,
15 fs: PhantomData<&'f Fs>
18 impl<'f> BtreeTrans<'f> {
19 pub fn new(fs: &'f Fs) -> BtreeTrans {
21 BtreeTrans { raw: &mut *c::__bch2_trans_get(fs.raw, 0), fs: PhantomData }
26 impl<'f> Drop for BtreeTrans<'f> {
28 unsafe { c::bch2_trans_put(&mut *self.raw) }
33 pub struct BtreeIterFlags: u16 {
34 const SLOTS = c::BTREE_ITER_SLOTS as u16;
35 const ALL_LEVELS = c::BTREE_ITER_ALL_LEVELS as u16;
36 const INTENT = c::BTREE_ITER_INTENT as u16;
37 const PREFETCH = c::BTREE_ITER_PREFETCH as u16;
38 const IS_EXTENTS = c::BTREE_ITER_IS_EXTENTS as u16;
39 const NOT_EXTENTS = c::BTREE_ITER_NOT_EXTENTS as u16;
40 const CACHED = c::BTREE_ITER_CACHED as u16;
41 const KEY_CACHED = c::BTREE_ITER_WITH_KEY_CACHE as u16;
42 const WITH_UPDATES = c::BTREE_ITER_WITH_UPDATES as u16;
43 const WITH_JOURNAL = c::BTREE_ITER_WITH_JOURNAL as u16;
44 const __ALL_SNAPSHOTS = c::__BTREE_ITER_ALL_SNAPSHOTS as u16;
45 const ALL_SNAPSHOTS = c::BTREE_ITER_ALL_SNAPSHOTS as u16;
46 const FILTER_SNAPSHOTS = c::BTREE_ITER_FILTER_SNAPSHOTS as u16;
47 const NOPRESERVE = c::BTREE_ITER_NOPRESERVE as u16;
48 const CACHED_NOFILL = c::BTREE_ITER_CACHED_NOFILL as u16;
49 const KEY_CACHE_FILL = c::BTREE_ITER_KEY_CACHE_FILL as u16;
53 pub struct BtreeIter<'t> {
55 trans: PhantomData<&'t BtreeTrans<'t>>,
58 impl<'t> BtreeIter<'t> {
59 pub fn new(trans: &'t BtreeTrans<'t>, btree: c::btree_id, pos: c::bpos, flags: BtreeIterFlags) -> BtreeIter<'t> {
61 let mut iter: MaybeUninit<c::btree_iter> = MaybeUninit::uninit();
63 c::bch2_trans_iter_init_outlined(
70 BtreeIter { raw: iter.assume_init(), trans: PhantomData }
74 pub fn peek_upto<'i>(&'i mut self, end: c::bpos) -> Result<Option<BkeySC>, bch_errcode> {
76 let k = c::bch2_btree_iter_peek_upto(&mut self.raw, end);
77 errptr_to_result_c(k.k)
78 .map(|_| if !k.k.is_null() { Some(BkeySC { k: &*k.k, v: &*k.v, iter: PhantomData }) } else { None } )
82 pub fn peek(&mut self) -> Result<Option<BkeySC>, bch_errcode> {
83 self.peek_upto(SPOS_MAX)
86 pub fn peek_and_restart(&mut self) -> Result<Option<BkeySC>, bch_errcode> {
88 let k = c::bch2_btree_iter_peek_and_restart_outlined(&mut self.raw);
90 errptr_to_result_c(k.k)
91 .map(|_| if !k.k.is_null() { Some(BkeySC{ k: &*k.k, v: &*k.v, iter: PhantomData }) } else { None } )
95 pub fn advance(&mut self) {
97 c::bch2_btree_iter_advance(&mut self.raw);
102 impl<'t> Drop for BtreeIter<'t> {
104 unsafe { c::bch2_trans_iter_exit(self.raw.trans, &mut self.raw) }
108 pub struct BtreeNodeIter<'t> {
110 trans: PhantomData<&'t BtreeTrans<'t>>,
113 impl<'t> BtreeNodeIter<'t> {
114 pub fn new(trans: &'t BtreeTrans<'t>,
119 flags: BtreeIterFlags) -> BtreeNodeIter {
121 let mut iter: MaybeUninit<c::btree_iter> = MaybeUninit::uninit();
122 c::bch2_trans_node_iter_init(
131 BtreeNodeIter { raw: iter.assume_init(), trans: PhantomData }
135 pub fn peek<'i>(&'i mut self) -> Result<Option<&'i c::btree>, bch_errcode> {
137 let b = c::bch2_btree_iter_peek_node(&mut self.raw);
138 errptr_to_result_c(b).map(|b| if !b.is_null() { Some(&*b) } else { None })
142 pub fn peek_and_restart<'i>(&'i mut self) -> Result<Option<&'i c::btree>, bch_errcode> {
144 let b = c::bch2_btree_iter_peek_node_and_restart(&mut self.raw);
145 errptr_to_result_c(b).map(|b| if !b.is_null() { Some(&*b) } else { None })
149 pub fn advance<'i>(&'i mut self) {
151 c::bch2_btree_iter_next_node(&mut self.raw);
155 pub fn next<'i>(&'i mut self) -> Result<Option<&'i c::btree>, bch_errcode> {
157 let b = c::bch2_btree_iter_next_node(&mut self.raw);
158 errptr_to_result_c(b).map(|b| if !b.is_null() { Some(&*b) } else { None })
163 impl<'t> Drop for BtreeNodeIter<'t> {
165 unsafe { c::bch2_trans_iter_exit(self.raw.trans, &mut self.raw) }
169 impl<'b, 'f> c::btree {
170 pub fn to_text(&'b self, fs: &'f Fs) -> BtreeNodeToText<'b, 'f> {
171 BtreeNodeToText { b: &self, fs }
174 pub fn ondisk_to_text(&'b self, fs: &'f Fs) -> BtreeNodeOndiskToText<'b, 'f> {
175 BtreeNodeOndiskToText { b: &self, fs }
179 pub struct BtreeNodeToText<'b, 'f> {
184 impl<'b, 'f> fmt::Display for BtreeNodeToText<'b, 'f> {
185 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
186 printbuf_to_formatter(f, |buf| unsafe { c::bch2_btree_node_to_text(buf, self.fs.raw, self.b) })
190 pub struct BtreeNodeOndiskToText<'b, 'f> {
195 impl<'b, 'f> fmt::Display for BtreeNodeOndiskToText<'b, 'f> {
196 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
197 printbuf_to_formatter(f, |buf| unsafe { c::bch2_btree_node_ondisk_to_text(buf, self.fs.raw, self.b) })