/* It's only necessary to look at the rightmost record of the left leaf because the logic that calls us should ensure that the theoretical ranges in the path components above the leaves are correct.  */
static int ocfs2_rotate_requires_path_adjustment(struct ocfs2_path *left_path, u32 insert_cpos)
/* It's only necessary to look at the rightmost record of the left leaf because the logic that calls us should ensure that the theoretical ranges in the path components above the leaves are correct.  */
static int ocfs2_rotate_requires_path_adjustment(struct ocfs2_path *left_path, u32 insert_cpos)
{
	struct ocfs2_extent_list *left_el;
	struct ocfs2_extent_rec *rec;
	int next_free;
	left_el = path_leaf_el(left_path);
	next_free = le16_to_cpu(left_el->l_next_free_rec);
	rec = &left_el->l_recs[next_free - 1];
	if (insert_cpos > le32_to_cpu(rec->e_cpos))
		return 1;
	return 0;
}