Lines Matching refs:left
808 static int ocfs2_extents_adjacent(struct ocfs2_extent_rec *left,
813 left_range = le32_to_cpu(left->e_cpos) +
814 le16_to_cpu(left->e_leaf_clusters);
1435 * Should only be called when there is no space left in any of the
1750 struct ocfs2_path *left,
1758 BUG_ON(path_root_bh(left) != path_root_bh(right));
1766 mlog_bug_on_msg(i > left->p_tree_depth,
1767 "Owner %llu, left depth %u, right depth %u\n"
1768 "left leaf blk %llu, right leaf blk %llu\n",
1770 left->p_tree_depth, right->p_tree_depth,
1771 (unsigned long long)path_leaf_bh(left)->b_blocknr,
1773 } while (left->p_node[i].bh->b_blocknr ==
1951 * left_rec: the record on the left.
2029 * - When we've moved an extent record from the left path leaf to the right
2030 * path leaf to make room for an empty extent in the left path leaf.
2032 * and requires an update of the path immediately to it's left. This
2034 * - When we've adjusted the last extent record in the left path leaf and the
2068 * left node record.
2185 * over, leaving an empty extent in the left leaf.
2206 * containing the leaf immediately to the left of the current one.
2299 * the _actual_ left leaf range. Otherwise, we'll rotate a record
2302 * It's only necessary to look at the rightmost record of the left
2398 * 2) Determine a path to the leaf block directly to the left
2406 * 5) Find the next subtree by considering the left path to be
2411 * value to get us the left path - insert_cpos might very well
2434 "(left path cpos %u) results in two identical "
2450 * situation by returning the left path.
2488 * A rotate moves the rightmost left leaf
2504 * as we know that it'll be our current left
2778 * Removal of the extent in the left leaf was skipped
3046 * We have a path to the left of this one - it needs
3135 * path by rotating records to the left in every subtree.
3175 * records left. Two cases of this:
3176 * a) There are branches to the left.
3180 * 2a) we need the left branch so that we can update it with the unlink
3734 /* The merge left us with an empty extent, remove it. */
3774 * Merge a record to the left or right.
3778 * the record on the left (hence the left merge).
3810 * The merge may have left an empty extent in
3837 * Region is on the left edge of the existing
3882 * Contiguous insert - either left or right.
4095 * started in the left path but moved to the
4097 * move the existing record to the left, or we
4100 * In this case, the left path should always
4107 * It's a left split. Since we know
4109 * empty extent in the left path, we
4116 * existing record over to the left
4292 * Both might pass back a path immediate to the left of the
4608 * there is room left in our allocation tree for another
4656 * left contiguousness. Specifically, if it's an insert into
4659 * left. For now, just catch that case and fool the layers
4963 * first and then make a second pass as a left split.
5090 * left in this allocation tree, so we pass the
5396 * by this leaf and the one to it's left.
5554 * For case 1 we remove the extent rec and left rotate to
6448 /* Premature exit may have left some dangling items. */
6523 /* Premature exit may have left some dangling items. */