Home
last modified time | relevance | path

Searched refs:offset_index (Results 1 – 3 of 3) sorted by relevance

/linux/fs/btrfs/
H A Dfree-space-cache.c71 info = rb_entry(node, struct btrfs_free_space, offset_index); in __btrfs_remove_free_space_cache()
907 info = rb_entry(n, struct btrfs_free_space, offset_index); in copy_free_space_cache()
1099 e = rb_entry(node, struct btrfs_free_space, offset_index); in write_cache_extent_entries()
1606 info = rb_entry(parent, struct btrfs_free_space, offset_index); in tree_insert_offset()
1642 rb_link_node(&new_entry->offset_index, parent, p); in tree_insert_offset()
1643 rb_insert_color(&new_entry->offset_index, root); in tree_insert_offset()
1710 entry = rb_entry(n, struct btrfs_free_space, offset_index); in tree_search_offset()
1736 entry = rb_entry(n, struct btrfs_free_space, offset_index); in tree_search_offset()
1748 n = rb_prev(&entry->offset_index); in tree_search_offset()
1751 offset_index); in tree_search_offset()
[all …]
H A Dfree-space-cache.h38 struct rb_node offset_index; member
/linux/rust/kernel/
H A Duaccess.rs321 let Ok(offset_index) = (*offset).try_into() else { in read_slice_file()
325 let read = self.read_slice_partial(out, offset_index)?; in read_slice_file()
514 let Ok(offset_index) = (*offset).try_into() else { in write_slice_file()
518 let written = self.write_slice_partial(data, offset_index)?; in write_slice_file()