Lines Matching defs:bytenr
309 * @start: The original start bytenr to search.
310 * Will store the extent range start bytenr.
311 * @end: The original end bytenr of the search range
312 * Will store the extent range end bytenr.
541 * - bio can be merged as long as on-disk bytenr is contiguous
735 * For compression, all IO should have its logical bytenr set
736 * to the starting bytenr of the compressed extent.
747 * 2) The range has adjacent logical bytenr
796 * @disk_bytenr: logical bytenr where the write will be
1826 * The caller should pass each page in their bytenr order, and here we use
3661 * don't try to insert two ebs for the same bytenr. So here we always
4382 "access to eb bytenr %llu len %u out of range start %lu len %lu",
4746 static u8 *extent_buffer_get_byte(const struct extent_buffer *eb, unsigned long bytenr)
4748 unsigned long index = get_eb_folio_index(eb, bytenr);
4750 if (check_eb_range(eb, bytenr, 1))
4752 return folio_address(eb->folios[index]) + get_eb_offset_in_folio(eb, bytenr);
4923 struct btrfs_fs_info *fs_info, struct page *page, u64 bytenr)
4930 ASSERT(in_range(bytenr, page_start, PAGE_SIZE));
4948 if (gang[i]->start >= bytenr) {
5079 * @bytenr: bytenr to read
5084 * Attempt to readahead a tree block at @bytenr. If @gen is 0 then we do a
5089 u64 bytenr, u64 owner_root, u64 gen, int level)
5099 eb = btrfs_find_create_tree_block(fs_info, bytenr, owner_root, level);
5121 * A helper for btrfs_readahead_tree_block, we simply read the bytenr pointed at