Lines Matching refs:left
1421 /* left is 0, right is 1, prev is 2 */
1463 * Check and set flags if this segment has a left neighbor.
1513 * The left and right neighbors are both contiguous with new.
1557 * The left neighbor is contiguous, the right is not.
1586 * The right neighbor is contiguous, the left is not. Take care
1619 * Neither the left nor right neighbors are contiguous with
1651 * The left neighbor is contiguous.
1688 * The left neighbor is not contiguous.
1972 /* left is 0, right is 1, prev is 2 */
2011 * Check and set flags if this segment has a left neighbor.
2060 * The left and right neighbors are both contiguous with new.
2113 * The left neighbor is contiguous, the right is not.
2153 * The right neighbor is contiguous, the left is not.
2196 * Neither the left nor right neighbors are contiguous with
2222 * The left neighbor is contiguous.
2261 * The left neighbor is not contiguous.
2415 /* new left extent - oldext */
2499 xfs_bmbt_irec_t left; /* left neighbor extent entry */
2510 * Check and set flags if this segment has a left neighbor
2512 if (xfs_iext_peek_prev_extent(ifp, icur, &left)) {
2514 if (isnullstartblock(left.br_startblock))
2529 * Set contiguity flags on the left and right neighbors.
2533 left.br_startoff + left.br_blockcount == new->br_startoff &&
2534 left.br_blockcount + new->br_blockcount <= XFS_MAX_BMBT_EXTLEN)
2541 (left.br_blockcount + new->br_blockcount +
2552 * on the left and on the right.
2555 temp = left.br_blockcount + new->br_blockcount +
2558 oldlen = startblockval(left.br_startblock) +
2563 left.br_startblock = nullstartblock(newlen);
2564 left.br_blockcount = temp;
2568 xfs_iext_update_extent(ip, state, icur, &left);
2574 * on the left.
2575 * Merge the new allocation with the left neighbor.
2577 temp = left.br_blockcount + new->br_blockcount;
2579 oldlen = startblockval(left.br_startblock) +
2583 left.br_blockcount = temp;
2584 left.br_startblock = nullstartblock(newlen);
2587 xfs_iext_update_extent(ip, state, icur, &left);
2647 xfs_bmbt_irec_t left; /* left neighbor extent entry */
2659 * Check and set flags if this segment has a left neighbor.
2661 if (xfs_iext_peek_prev_extent(ifp, icur, &left)) {
2663 if (isnullstartblock(left.br_startblock))
2678 * We're inserting a real allocation between "left" and "right".
2682 left.br_startoff + left.br_blockcount == new->br_startoff &&
2683 left.br_startblock + left.br_blockcount == new->br_startblock &&
2684 left.br_state == new->br_state &&
2685 left.br_blockcount + new->br_blockcount <= XFS_MAX_BMBT_EXTLEN)
2694 left.br_blockcount + new->br_blockcount +
2706 * left and on the right.
2709 left.br_blockcount += new->br_blockcount + right.br_blockcount;
2713 xfs_iext_update_extent(ip, state, icur, &left);
2741 error = xfs_bmbt_update(cur, &left);
2750 * on the left.
2751 * Merge the new allocation with the left neighbor.
2753 old = left;
2754 left.br_blockcount += new->br_blockcount;
2757 xfs_iext_update_extent(ip, state, icur, &left);
2770 error = xfs_bmbt_update(cur, &left);
3091 xfs_fsblock_t prevbno; /* left side block number */
3092 xfs_fsblock_t prevdiff=0; /* left side difference */
3095 * If there's a previous (left) block, select a requested
4716 * indlen reservation must be shared across the two new extents that are left
4756 * of the two extents is left with nothing when extents are repeatedly
5456 * It must have a written left neighbor.
5588 struct xfs_bmbt_irec *left, /* preceding extent */
5600 if ((left->br_startoff + left->br_blockcount != startoff) ||
5601 (left->br_startblock + left->br_blockcount != got->br_startblock) ||
5602 (left->br_state != got->br_state) ||
5603 (left->br_blockcount + got->br_blockcount > XFS_MAX_BMBT_EXTLEN))
5626 struct xfs_bmbt_irec *left, /* preceding extent */
5636 blockcount = left->br_blockcount + got->br_blockcount;
5640 ASSERT(xfs_bmse_can_merge(left, got, shift));
5642 new = *left;
5670 error = xfs_bmbt_lookup_eq(cur, left, &i);
5694 new.br_startoff = left->br_startoff + left->br_blockcount;
5924 * Unlike a left shift (which involves a hole punch), a right