Lines Matching refs:range
123 * Used to advise which range is to be written back.
187 * in the range start - end. hint_block is filled in with a block number
190 * If an extent intersects the range but is not entirely inside the range
191 * it is either truncated or split. Anything entirely inside the range
196 * with the number of allocated bytes found in the target range, so that the
198 * replacing extents in a range to avoid races with stat(2).
337 * | - range to drop - |
397 * | ---- range to drop ----- |
422 * | ---- range to drop ----- |
445 * | ---- range to drop ----- |
588 * Mark extent in the range start - end as written.
1034 * all pages in the range.
1043 * Check if we can do nocow write into the range [@pos, @pos + @write_bytes)
1047 * range.
1049 * This function will flush ordered extents in the range to ensure proper
1142 * later check if we can really COW into the target range (using
1384 * If we have not locked the extent range, because the range's
1386 * cached extent state, acquired while marking the extent range
1521 * The iov_iter can be mapped to the same file range we are writing to.
1526 * pages code (starting at btrfs_readahead()), which will lock the range,
1531 * memory mapped to the same file range, since the iomap DIO code always
1532 * invalidates pages in the target file range (after starting and waiting
1566 * Also, in case the iov refers to pages in the file range of the
1569 * iomap will invalidate any pages in the range early on, before
1796 * Always set the range to a full range, otherwise we can get into
1800 * extents outside the range, to missing checksums due to ordered extents
1808 * We write the dirty pages in the range and wait until they complete
1823 * have dirtied more pages in the target range. We need to make sure
2197 * For subpage case, if the range is not at page boundary, we could
2198 * have pages at the leading/tailing part of the range.
2213 * We can't have ordered extents in the range, nor dirty/writeback
2216 * we have flushed all delalloc in the range and we have waited
2217 * for any ordered extents in the range to complete.
2218 * We can race with anyone reading pages from this range, so after
2219 * locking the range check if we have pages in the range, and if
2220 * we do, unlock the range and retry.
2319 * The respective range must have been previously locked, as well as the inode.
2320 * The end offset is inclusive (last byte of the range).
2322 * the file range with an extent.
2358 * 1 - removing the extents in the range
2360 * replacing the range with a new extent
2538 * Don't insert file hole extent item if it's for a range beyond eof
2539 * (because it's useless) or if it represents a 0 bytes range (when
2754 /* Helper structure to record which range is already reserved */
2762 * Helper function to add falloc range
2764 * Caller should have locked the larger range of extent containing
2769 struct falloc_range *range = NULL;
2774 * the last range.
2776 range = list_last_entry(head, struct falloc_range, list);
2777 if (range->start + range->len == start) {
2778 range->len += len;
2783 range = kmalloc(sizeof(*range), GFP_KERNEL);
2784 if (!range)
2786 range->start = start;
2787 range->len = len;
2788 list_add_tail(&range->list, head);
2873 * range contains one or more prealloc extents together with regular
2883 * The whole range is already a prealloc extent,
2893 * Part of the range is already a prealloc extent, so operate
2894 * only on the remaining part of the range.
2941 * they might map to a hole, in which case we need our allocation range
3028 struct falloc_range *range;
3099 * locking the file range, flush all dealloc in the range and wait for
3100 * all ordered extents in the range to complete. After this we can lock
3101 * the file range and, due to the previous locking we did, we know there
3102 * can't be more delalloc or ordered extents in the range.
3158 * in the range, see above.
3170 list_for_each_entry_safe(range, tmp, &reserve_list, list) {
3173 range->start,
3174 range->len, i_blocksize(inode),
3180 data_space_reserved -= range->len;
3181 qgroup_reserved -= range->len;
3184 data_reserved, range->start,
3185 range->len);
3186 data_space_reserved -= range->len;
3187 qgroup_reserved -= range->len;
3190 range->start, range->len, NULL);
3191 qgroup_reserved -= range->len;
3193 list_del(&range->list);
3194 kfree(range);
3214 * Helper for btrfs_find_delalloc_in_range(). Find a subrange in a given range
3257 /* Delalloc for the whole range, nothing more to do. */
3260 /* Else trim our search range for ordered extents. */
3270 * Now also check if there's any ordered extent in the range.
3273 * 1) When delalloc is flushed, the file range is locked, we clear the
3294 /* The ordered extent may span beyond our search range. */
3300 /* Don't have unflushed delalloc, return the ordered extent range. */
3309 * If the ranges are adjacent returned a combined range, otherwise
3310 * return the leftmost range.
3324 * Check if there's delalloc in a given range.
3327 * @start: The start offset of the range. It does not need to be
3329 * @end: The end offset (inclusive value) of the search range.
3339 * Returns true if a subrange with delalloc is found within the given range, and
3386 * Check if there's a hole or delalloc range in a range representing a hole (or
3428 * Delalloc range starts at our start offset.
3429 * If the delalloc range's length is smaller than our range,
3438 /* There's delalloc for the whole range. */
3448 * No delalloc in the range and we are seeking for data. The caller has
3589 * implicit hole range, so need to analyze the extent.
3630 * implicit hole range, so need to analyze the next
3765 * to lock the extent range in the inode's tree during he page reads
3768 * btrfs_dio_iomap_begin() returns with the extent range locked, which
3788 * range. This is just to avoid any possibility of looping
3847 * with the entire range locked but with nobody actually marked with