Lines Matching refs:data
43 #include "ordered-data.h"
246 btrfs_warn_rl(fs_info, "has data reloc tree but no running relocation");
325 /* For data reloc tree, it's better to do a backref lookup instead. */
609 * does the checks required to make sure the data is small enough
629 * compressed) data fits in a leaf and the configured maximum inline
686 * it won't count as data extent, free them directly here.
1248 * allocate extents on disk for the range, and create ordered data structs
1307 * writeback for the dirty sectors of page, that means data writeback
1359 * size as the original extents. Normally writeback for relocation data
1535 * extent's size from the data space_info's bytes_may_use counter and
1538 * to decrement again the data space_info's bytes_may_use counter,
1552 * clear_bits above, we add EXTENT_CLEAR_DATA_RESV to release the data
1759 * made we had not enough available data space and therefore we did not
1760 * reserve data space for it, since we though we could do NOCOW for the
1768 * 1) We increment the bytes_may_use counter of the data space info.
1769 * If COW succeeds, it allocates a new data extent and after doing
1779 * data space info, which we incremented in the step above.
1782 * space cache inode or an inode of the data relocation tree, we must
1783 * also increment bytes_may_use of the data space_info for the same
1784 * reason. Space caches and relocated data extents always get a prealloc
2810 * properly happens and the data=ordered rules are followed.
3008 * As ordered data IO finishes, this gets called so we can finish
3271 * Verify the checksum of a single data sector.
3278 * Check if the checksum on a data block is valid. When a checksum mismatch is
3301 /* Skip the range without csum for data reloc inode */
4021 * The data relocation inode should also be directly updated
4704 /* For nocow case, no need to reserve data space */
4884 * expose stale data.
5021 * We're truncating a file that used to have good data down to
6689 * of the uncompressed data and the end of max_size in case the decompressed
6690 * data ends up shorter than ram_bytes. That doesn't cover the hole between
6733 * @page: page to read extent data into if the extent is inline
6743 * data directly into the page and marks the extent up to date in the io_tree.
7183 * get stale data.
7382 * If we could not allocate data space before locking the file
7391 * We have to COW and we have already reserved data space before,
7478 * compression on the data, while keeping the pages locked, so by the
7508 * We always try to allocate data space and must do it before locking
7512 * allocate data space here we continue and later, after locking the
7564 * space - this happens if we were able to read some data from
7586 * iomap_dio_rw(), we can end up returning less data then what the caller
7798 struct btrfs_dio_data data = { 0 };
7801 IOMAP_DIO_PARTIAL, &data, done_before);
7807 struct btrfs_dio_data data = { 0 };
7810 IOMAP_DIO_PARTIAL, &data, done_before);
7826 * in the compression of data (in an async thread) and will return
8070 * reserved data space.
8208 * reserve data&meta space before lock_page() (see above comments).
9556 * We have released qgroup data range at the beginning of the function,
9560 * or we leak qgroup data reservation.
10256 * The compressed data must be smaller than the decompressed data.
10258 * It's of course possible for data to compress to larger or the same
10260 * data, and we don't want to break any assumptions by creating these
10264 * compressed data must be at least one sector smaller than the
10265 * decompressed data. We only want to enforce the weaker requirement
10285 /* Finally, the offset in the unencoded data must be sector-aligned. */
10294 * If the extent cannot be inline, the compressed data on disk must be
10730 "swapfile must have single data profile");