Lines Matching full:pub

83 pub(crate) struct FreedRange {
84     pub(crate) start_page_idx: usize,
85     pub(crate) end_page_idx: usize,
111 pub(crate) struct RangeAllocator<T> {
122     pub(crate) fn new(size: usize) -> Self {  in new()
128     pub(crate) fn free_oneway_space(&self) -> usize {  in free_oneway_space()
136     pub(crate) fn count_buffers(&self) -> usize {  in count_buffers()
144     pub(crate) fn debug_print(&self, m: &SeqFile) -> Result<()> {  in debug_print()
153     pub(crate) fn reserve_new(&mut self, mut args: ReserveNewArgs<T>) -> Result<ReserveNew<T>> {  in reserve_new()
227     pub(crate) fn reservation_abort(&mut self, offset: usize) -> Result<FreedRange> {  in reservation_abort()
245     pub(crate) fn reservation_commit(&mut self, offset: usize, data: &mut Option<T>) -> Result {  in reservation_commit()
256     pub(crate) fn reserve_existing(&mut self, offset: usize) -> Result<(usize, usize, Option<T>)> {  in reserve_existing()
267     pub(crate) fn take_for_each<F: Fn(usize, usize, usize, Option<T>)>(&mut self, callback: F) {  in take_for_each()
278 pub(crate) struct ReserveNewArgs<T> {
279     pub(crate) size: usize,
280     pub(crate) is_oneway: bool,
281     pub(crate) debug_id: usize,
282     pub(crate) pid: Pid,
283     pub(crate) empty_array_alloc: Option<EmptyArrayAlloc<T>>,
284     pub(crate) new_tree_alloc: Option<FromArrayAllocs<T>>,
285     pub(crate) tree_alloc: Option<ReserveNewTreeAlloc<T>>,
289 pub(crate) enum ReserveNew<T> {
295 pub(crate) struct ReserveNewSuccess<T> {
296     pub(crate) offset: usize,
297     pub(crate) oneway_spam_detected: bool,
308 pub(crate) struct ReserveNewNeedAlloc<T> {
317     pub(crate) fn make_alloc(mut self) -> Result<ReserveNewArgs<T>> {  in make_alloc()