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 INTENT = c::BTREE_ITER_INTENT as u16;
36 const PREFETCH = c::BTREE_ITER_PREFETCH as u16;
37 const IS_EXTENTS = c::BTREE_ITER_IS_EXTENTS as u16;
38 const NOT_EXTENTS = c::BTREE_ITER_NOT_EXTENTS as u16;
39 const CACHED = c::BTREE_ITER_CACHED as u16;
40 const KEY_CACHED = c::BTREE_ITER_WITH_KEY_CACHE as u16;
41 const WITH_UPDATES = c::BTREE_ITER_WITH_UPDATES as u16;
42 const WITH_JOURNAL = c::BTREE_ITER_WITH_JOURNAL as u16;
43 const __ALL_SNAPSHOTS = c::__BTREE_ITER_ALL_SNAPSHOTS as u16;
44 const ALL_SNAPSHOTS = c::BTREE_ITER_ALL_SNAPSHOTS as u16;
45 const FILTER_SNAPSHOTS = c::BTREE_ITER_FILTER_SNAPSHOTS as u16;
46 const NOPRESERVE = c::BTREE_ITER_NOPRESERVE as u16;
47 const CACHED_NOFILL = c::BTREE_ITER_CACHED_NOFILL as u16;
48 const KEY_CACHE_FILL = c::BTREE_ITER_KEY_CACHE_FILL as u16;
52 pub struct BtreeIter<'t> {
54 trans: PhantomData<&'t BtreeTrans<'t>>,
57 impl<'t> BtreeIter<'t> {
58 pub fn new(trans: &'t BtreeTrans<'t>, btree: c::btree_id, pos: c::bpos, flags: BtreeIterFlags) -> BtreeIter<'t> {
60 let mut iter: MaybeUninit<c::btree_iter> = MaybeUninit::uninit();
62 c::bch2_trans_iter_init_outlined(
69 BtreeIter { raw: iter.assume_init(), trans: PhantomData }
73 pub fn peek_upto<'i>(&'i mut self, end: c::bpos) -> Result<Option<BkeySC>, bch_errcode> {
75 let k = c::bch2_btree_iter_peek_upto(&mut self.raw, end);
76 errptr_to_result_c(k.k)
77 .map(|_| if !k.k.is_null() { Some(BkeySC { k: &*k.k, v: &*k.v, iter: PhantomData }) } else { None } )
81 pub fn peek(&mut self) -> Result<Option<BkeySC>, bch_errcode> {
82 self.peek_upto(SPOS_MAX)
85 pub fn peek_and_restart(&mut self) -> Result<Option<BkeySC>, bch_errcode> {
87 let k = c::bch2_btree_iter_peek_and_restart_outlined(&mut self.raw);
89 errptr_to_result_c(k.k)
90 .map(|_| if !k.k.is_null() { Some(BkeySC{ k: &*k.k, v: &*k.v, iter: PhantomData }) } else { None } )
94 pub fn advance(&mut self) {
96 c::bch2_btree_iter_advance(&mut self.raw);
101 impl<'t> Drop for BtreeIter<'t> {
103 unsafe { c::bch2_trans_iter_exit(self.raw.trans, &mut self.raw) }
107 pub struct BtreeNodeIter<'t> {
109 trans: PhantomData<&'t BtreeTrans<'t>>,
112 impl<'t> BtreeNodeIter<'t> {
113 pub fn new(trans: &'t BtreeTrans<'t>,
118 flags: BtreeIterFlags) -> BtreeNodeIter {
120 let mut iter: MaybeUninit<c::btree_iter> = MaybeUninit::uninit();
121 c::bch2_trans_node_iter_init(
130 BtreeNodeIter { raw: iter.assume_init(), trans: PhantomData }
134 pub fn peek<'i>(&'i mut self) -> Result<Option<&'i c::btree>, bch_errcode> {
136 let b = c::bch2_btree_iter_peek_node(&mut self.raw);
137 errptr_to_result_c(b).map(|b| if !b.is_null() { Some(&*b) } else { None })
141 pub fn peek_and_restart<'i>(&'i mut self) -> Result<Option<&'i c::btree>, bch_errcode> {
143 let b = c::bch2_btree_iter_peek_node_and_restart(&mut self.raw);
144 errptr_to_result_c(b).map(|b| if !b.is_null() { Some(&*b) } else { None })
148 pub fn advance<'i>(&'i mut self) {
150 c::bch2_btree_iter_next_node(&mut self.raw);
154 pub fn next<'i>(&'i mut self) -> Result<Option<&'i c::btree>, bch_errcode> {
156 let b = c::bch2_btree_iter_next_node(&mut self.raw);
157 errptr_to_result_c(b).map(|b| if !b.is_null() { Some(&*b) } else { None })
162 impl<'t> Drop for BtreeNodeIter<'t> {
164 unsafe { c::bch2_trans_iter_exit(self.raw.trans, &mut self.raw) }
168 impl<'b, 'f> c::btree {
169 pub fn to_text(&'b self, fs: &'f Fs) -> BtreeNodeToText<'b, 'f> {
170 BtreeNodeToText { b: &self, fs }
173 pub fn ondisk_to_text(&'b self, fs: &'f Fs) -> BtreeNodeOndiskToText<'b, 'f> {
174 BtreeNodeOndiskToText { b: &self, fs }
178 pub struct BtreeNodeToText<'b, 'f> {
183 impl<'b, 'f> fmt::Display for BtreeNodeToText<'b, 'f> {
184 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
185 printbuf_to_formatter(f, |buf| unsafe { c::bch2_btree_node_to_text(buf, self.fs.raw, self.b) })
189 pub struct BtreeNodeOndiskToText<'b, 'f> {
194 impl<'b, 'f> fmt::Display for BtreeNodeOndiskToText<'b, 'f> {
195 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
196 printbuf_to_formatter(f, |buf| unsafe { c::bch2_btree_node_ondisk_to_text(buf, self.fs.raw, self.b) })