Lines Matching defs:offset
43 * [ inode objectid, BTRFS_VERITY_DESC_ITEM_KEY, offset ]
45 * At offset 0, we store a btrfs_verity_descriptor_item which tracks the
47 * Starting at offset 1, these hold the generic fs verity descriptor.
52 * [ inode objectid, BTRFS_VERITY_MERKLE_ITEM_KEY, offset ]
54 * These also start at offset 0, and correspond to the merkle tree bytes.
56 * starting at offset 0 for this key type. These are also opaque to btrfs,
72 * Compute the logical file offset where we cache the Merkle tree.
78 * offset, rather than in terms of page indices.
84 * Returns the file offset on success, negative error code on failure.
136 key.offset = (u64)-1;
203 * Insert and write inode items with a given key type and offset.
207 * @offset: item offset to insert at
212 * The inserted items will have key (ino, key_type, offset + off) where off is
213 * consecutively increasing from 0 up to the last item ending at offset + len.
217 static int write_key_bytes(struct btrfs_inode *inode, u8 key_type, u64 offset,
244 key.offset = offset;
263 offset += copy_bytes;
276 * Read inode items of the given key type and offset from the btree.
280 * @offset: item offset to read from
297 static int read_key_bytes(struct btrfs_inode *inode, u8 key_type, u64 offset,
323 key.offset = offset;
342 item_end = btrfs_item_size(leaf, path->slots[0]) + key.offset;
349 if (key.offset != offset)
353 * Our initial offset might be in the middle of an
356 if (key.offset > offset)
358 if (item_end <= offset)
366 copy_end = min(offset + len, item_end);
369 copy_bytes = copy_end - offset;
372 copy_offset = offset - key.offset;
387 offset += copy_bytes;
763 * [ inode objectid, BTRFS_MERKLE_ITEM_KEY, offset in bytes ]