Lines Matching refs:left
806 static int ocfs2_extents_adjacent(struct ocfs2_extent_rec *left,
811 left_range = le32_to_cpu(left->e_cpos) +
812 le16_to_cpu(left->e_leaf_clusters);
1433 * Should only be called when there is no space left in any of the
1748 struct ocfs2_path *left,
1756 BUG_ON(path_root_bh(left) != path_root_bh(right));
1764 mlog_bug_on_msg(i > left->p_tree_depth,
1765 "Owner %llu, left depth %u, right depth %u\n"
1766 "left leaf blk %llu, right leaf blk %llu\n",
1768 left->p_tree_depth, right->p_tree_depth,
1769 (unsigned long long)path_leaf_bh(left)->b_blocknr,
1771 } while (left->p_node[i].bh->b_blocknr ==
1949 * left_rec: the record on the left.
2027 * - When we've moved an extent record from the left path leaf to the right
2028 * path leaf to make room for an empty extent in the left path leaf.
2030 * and requires an update of the path immediately to it's left. This
2032 * - When we've adjusted the last extent record in the left path leaf and the
2066 * left node record.
2183 * over, leaving an empty extent in the left leaf.
2204 * containing the leaf immediately to the left of the current one.
2297 * the _actual_ left leaf range. Otherwise, we'll rotate a record
2300 * It's only necessary to look at the rightmost record of the left
2396 * 2) Determine a path to the leaf block directly to the left
2404 * 5) Find the next subtree by considering the left path to be
2409 * value to get us the left path - insert_cpos might very well
2432 "(left path cpos %u) results in two identical "
2448 * situation by returning the left path.
2486 * A rotate moves the rightmost left leaf
2502 * as we know that it'll be our current left
2776 * Removal of the extent in the left leaf was skipped
3044 * We have a path to the left of this one - it needs
3133 * path by rotating records to the left in every subtree.
3173 * records left. Two cases of this:
3174 * a) There are branches to the left.
3178 * 2a) we need the left branch so that we can update it with the unlink
3732 /* The merge left us with an empty extent, remove it. */
3772 * Merge a record to the left or right.
3776 * the record on the left (hence the left merge).
3808 * The merge may have left an empty extent in
3835 * Region is on the left edge of the existing
3880 * Contiguous insert - either left or right.
4093 * started in the left path but moved to the
4095 * move the existing record to the left, or we
4098 * In this case, the left path should always
4105 * It's a left split. Since we know
4107 * empty extent in the left path, we
4114 * existing record over to the left
4290 * Both might pass back a path immediate to the left of the
4606 * there is room left in our allocation tree for another
4654 * left contiguousness. Specifically, if it's an insert into
4657 * left. For now, just catch that case and fool the layers
4961 * first and then make a second pass as a left split.
5088 * left in this allocation tree, so we pass the
5394 * by this leaf and the one to it's left.
5552 * 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. */