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;
10 use bitflags::bitflags;
12 pub struct BtreeTrans<'f> {
13 raw: *mut c::btree_trans,
14 fs: PhantomData<&'f Fs>
17 impl<'f> BtreeTrans<'f> {
18 pub fn new(fs: &'f Fs) -> BtreeTrans {
20 BtreeTrans { raw: &mut *c::__bch2_trans_get(fs.raw, 0), fs: PhantomData }
25 impl<'f> Drop for BtreeTrans<'f> {
27 unsafe { c::bch2_trans_put(&mut *self.raw) }
32 pub struct BtreeIterFlags: u16 {
33 const SLOTS = c::BTREE_ITER_SLOTS 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<'t> {
53 trans: PhantomData<&'t BtreeTrans<'t>>,
56 impl<'t> BtreeIter<'t> {
57 pub fn new(trans: &'t BtreeTrans<'t>, btree: c::btree_id, pos: c::bpos, flags: BtreeIterFlags) -> BtreeIter<'t> {
59 let mut iter: MaybeUninit<c::btree_iter> = MaybeUninit::uninit();
61 c::bch2_trans_iter_init_outlined(
68 BtreeIter { raw: iter.assume_init(), trans: PhantomData }
72 pub fn peek_upto<'i>(&'i mut self, end: c::bpos) -> Result<Option<BkeySC>, bch_errcode> {
74 let k = c::bch2_btree_iter_peek_upto(&mut self.raw, end);
75 errptr_to_result_c(k.k)
76 .map(|_| if !k.k.is_null() { Some(BkeySC { k: &*k.k, v: &*k.v, iter: PhantomData }) } else { None } )
80 pub fn peek(&mut self) -> Result<Option<BkeySC>, bch_errcode> {
81 self.peek_upto(SPOS_MAX)
84 pub fn peek_and_restart(&mut self) -> Result<Option<BkeySC>, bch_errcode> {
86 let k = c::bch2_btree_iter_peek_and_restart_outlined(&mut self.raw);
88 errptr_to_result_c(k.k)
89 .map(|_| if !k.k.is_null() { Some(BkeySC{ k: &*k.k, v: &*k.v, iter: PhantomData }) } else { None } )
93 pub fn advance(&mut self) {
95 c::bch2_btree_iter_advance(&mut self.raw);
100 impl<'t> Drop for BtreeIter<'t> {
102 unsafe { c::bch2_trans_iter_exit(self.raw.trans, &mut self.raw) }
106 pub struct BtreeNodeIter<'t> {
108 trans: PhantomData<&'t BtreeTrans<'t>>,
111 impl<'t> BtreeNodeIter<'t> {
112 pub fn new(trans: &'t BtreeTrans<'t>,
117 flags: BtreeIterFlags) -> BtreeNodeIter {
119 let mut iter: MaybeUninit<c::btree_iter> = MaybeUninit::uninit();
120 c::bch2_trans_node_iter_init(
129 BtreeNodeIter { raw: iter.assume_init(), trans: PhantomData }
133 pub fn peek<'i>(&'i mut self) -> Result<Option<&'i c::btree>, bch_errcode> {
135 let b = c::bch2_btree_iter_peek_node(&mut self.raw);
136 errptr_to_result_c(b).map(|b| if !b.is_null() { Some(&*b) } else { None })
140 pub fn peek_and_restart<'i>(&'i mut self) -> Result<Option<&'i c::btree>, bch_errcode> {
142 let b = c::bch2_btree_iter_peek_node_and_restart(&mut self.raw);
143 errptr_to_result_c(b).map(|b| if !b.is_null() { Some(&*b) } else { None })
147 pub fn advance<'i>(&'i mut self) {
149 c::bch2_btree_iter_next_node(&mut self.raw);
153 pub fn next<'i>(&'i mut self) -> Result<Option<&'i c::btree>, bch_errcode> {
155 let b = c::bch2_btree_iter_next_node(&mut self.raw);
156 errptr_to_result_c(b).map(|b| if !b.is_null() { Some(&*b) } else { None })
161 impl<'t> Drop for BtreeNodeIter<'t> {
163 unsafe { c::bch2_trans_iter_exit(self.raw.trans, &mut self.raw) }
167 impl<'b, 'f> c::btree {
168 pub fn to_text(&'b self, fs: &'f Fs) -> BtreeNodeToText<'b, 'f> {
169 BtreeNodeToText { b: &self, fs }
172 pub fn ondisk_to_text(&'b self, fs: &'f Fs) -> BtreeNodeOndiskToText<'b, 'f> {
173 BtreeNodeOndiskToText { b: &self, fs }
177 pub struct BtreeNodeToText<'b, 'f> {
182 impl<'b, 'f> fmt::Display for BtreeNodeToText<'b, 'f> {
183 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
184 printbuf_to_formatter(f, |buf| unsafe { c::bch2_btree_node_to_text(buf, self.fs.raw, self.b) })
188 pub struct BtreeNodeOndiskToText<'b, 'f> {
193 impl<'b, 'f> fmt::Display for BtreeNodeOndiskToText<'b, 'f> {
194 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
195 printbuf_to_formatter(f, |buf| unsafe { c::bch2_btree_node_ondisk_to_text(buf, self.fs.raw, self.b) })