fs/btrfs/file.c

983 				u64 *lockstart, u64 *lockend, bool nowait,
1032 		*lockend = last_pos;
1071 	u64 lockstart, lockend;
1082 	lockend = round_up(pos + *write_bytes,
1084 	num_bytes = lockend - lockstart + 1;
1087 		if (!btrfs_try_lock_ordered_range(inode, lockstart, lockend,
1093 		btrfs_lock_and_flush_ordered_range(inode, lockstart, lockend,
1103 	unlock_extent(&inode->io_tree, lockstart, lockend, &cached_state);
1191 	u64 lockend;
1328 				&lockend, nowait, &cached_state);
1397 				      lockend, &cached_state);
2208 					const u64 lockend,
2220 	const u64 page_lockend = round_down(lockend + 1, PAGE_SIZE) - 1;
2223 		truncate_pagecache_range(inode, lockstart, lockend);
2225 		lock_extent(&BTRFS_I(inode)->io_tree, lockstart, lockend,
2241 		unlock_extent(&BTRFS_I(inode)->io_tree, lockstart, lockend,
2245 	btrfs_assert_inode_range_clean(BTRFS_I(inode), lockstart, lockend);
2543 	 * hole that overlaps a part of the region [lockstart, lockend] and
2544 	 * ends at (or beyond) lockend. Since we have no file extent items to
2545 	 * represent holes, drop_end can be less than lockend and so we must
2550 	 * [existing_hole_start, lockend].
2612 	u64 lockend;
2643 	lockend = round_down(offset + len, fs_info->sectorsize) - 1;
2694 	tail_start = lockend + 1;
2713 	if (lockend < lockstart) {
2718 	btrfs_punch_hole_lock_range(inode, lockstart, lockend, &cached_state);
2727 					 lockend, NULL, &trans);
2740 	unlock_extent(&BTRFS_I(inode)->io_tree, lockstart, lockend,
2998 		const u64 lockend = alloc_end - 1;
3006 		btrfs_punch_hole_lock_range(inode, lockstart, lockend,
3012 				      lockend, &cached_state);
3019 		unlock_extent(&BTRFS_I(inode)->io_tree, lockstart, lockend,
3483 	u64 lockend;
3523 	lockend = round_up(i_size, fs_info->sectorsize);
3524 	if (lockend <= lockstart)
3525 		lockend = lockstart + fs_info->sectorsize;
3526 	lockend--;
3539 	lock_extent(&inode->io_tree, lockstart, lockend, &cached_state);
3685 	unlock_extent(&inode->io_tree, lockstart, lockend, &cached_state);