Lines Matching refs:end
71 /* Do the math around the end of an extent, handling wrapping. */
85 u64 end = range_end(em->start, em->len);
108 if (end > entry->start && em->start < extent_map_end(entry))
118 if (end > entry->start && em->start < extent_map_end(entry))
411 u64 end = range_end(start, len);
423 if (strict && !(end > em->start && start < extent_map_end(em)))
537 u64 end;
553 end = next ? next->start : extent_map_end(em);
554 end = min_t(u64, end, extent_map_end(em));
557 em->len = end - start;
675 * @end: End offset of the range (inclusive value).
678 * This drops all the extent maps that intersect the given range [@start, @end].
684 void btrfs_drop_extent_map_range(struct btrfs_inode *inode, u64 start, u64 end,
691 u64 len = end - start + 1;
693 WARN_ON(end < start);
694 if (end == (u64)-1) {
701 /* Make end offset exclusive for use in the loop below. */
702 end++;
728 if (em_end < end) {
731 if (next_em->start < end)
756 if (em->start >= start && em_end <= end)
798 if (em_end > end) {
805 split->start = end;
806 split->len = em_end - end;
820 const u64 diff = end - em->start;
855 * 1) It fits entirely in our range (doesn't end beyond
871 if ((em->start < start || em_end > end) && modified) {
913 const u64 end = new_em->start + new_em->len - 1;
928 btrfs_drop_extent_map_range(inode, new_em->start, end, false);