Lines Matching refs:left
1501 /* left is 0, right is 1, prev is 2 */
1543 * Check and set flags if this segment has a left neighbor.
1593 * The left and right neighbors are both contiguous with new.
1637 * The left neighbor is contiguous, the right is not.
1666 * The right neighbor is contiguous, the left is not. Take care
1699 * Neither the left nor right neighbors are contiguous with
1731 * The left neighbor is contiguous.
1768 * The left neighbor is not contiguous.
2052 /* left is 0, right is 1, prev is 2 */
2091 * Check and set flags if this segment has a left neighbor.
2140 * The left and right neighbors are both contiguous with new.
2193 * The left neighbor is contiguous, the right is not.
2233 * The right neighbor is contiguous, the left is not.
2276 * Neither the left nor right neighbors are contiguous with
2302 * The left neighbor is contiguous.
2341 * The left neighbor is not contiguous.
2495 /* new left extent - oldext */
2579 xfs_bmbt_irec_t left; /* left neighbor extent entry */
2590 * Check and set flags if this segment has a left neighbor
2592 if (xfs_iext_peek_prev_extent(ifp, icur, &left)) {
2594 if (isnullstartblock(left.br_startblock))
2609 * Set contiguity flags on the left and right neighbors.
2613 left.br_startoff + left.br_blockcount == new->br_startoff &&
2614 left.br_blockcount + new->br_blockcount <= MAXEXTLEN)
2621 (left.br_blockcount + new->br_blockcount +
2632 * on the left and on the right.
2635 temp = left.br_blockcount + new->br_blockcount +
2638 oldlen = startblockval(left.br_startblock) +
2643 left.br_startblock = nullstartblock(newlen);
2644 left.br_blockcount = temp;
2648 xfs_iext_update_extent(ip, state, icur, &left);
2654 * on the left.
2655 * Merge the new allocation with the left neighbor.
2657 temp = left.br_blockcount + new->br_blockcount;
2659 oldlen = startblockval(left.br_startblock) +
2663 left.br_blockcount = temp;
2664 left.br_startblock = nullstartblock(newlen);
2667 xfs_iext_update_extent(ip, state, icur, &left);
2727 xfs_bmbt_irec_t left; /* left neighbor extent entry */
2739 * Check and set flags if this segment has a left neighbor.
2741 if (xfs_iext_peek_prev_extent(ifp, icur, &left)) {
2743 if (isnullstartblock(left.br_startblock))
2758 * We're inserting a real allocation between "left" and "right".
2762 left.br_startoff + left.br_blockcount == new->br_startoff &&
2763 left.br_startblock + left.br_blockcount == new->br_startblock &&
2764 left.br_state == new->br_state &&
2765 left.br_blockcount + new->br_blockcount <= MAXEXTLEN)
2774 left.br_blockcount + new->br_blockcount +
2786 * left and on the right.
2789 left.br_blockcount += new->br_blockcount + right.br_blockcount;
2793 xfs_iext_update_extent(ip, state, icur, &left);
2821 error = xfs_bmbt_update(cur, &left);
2830 * on the left.
2831 * Merge the new allocation with the left neighbor.
2833 old = left;
2834 left.br_blockcount += new->br_blockcount;
2837 xfs_iext_update_extent(ip, state, icur, &left);
2850 error = xfs_bmbt_update(cur, &left);
3176 xfs_fsblock_t prevbno; /* left side block number */
3177 xfs_fsblock_t prevdiff=0; /* left side difference */
3180 * If there's a previous (left) block, select a requested
4704 * indlen reservation must be shared across the two new extents that are left
4744 * of the two extents is left with nothing when extents are repeatedly
5483 * It must have a written left neighbor.
5616 struct xfs_bmbt_irec *left, /* preceding extent */
5628 if ((left->br_startoff + left->br_blockcount != startoff) ||
5629 (left->br_startblock + left->br_blockcount != got->br_startblock) ||
5630 (left->br_state != got->br_state) ||
5631 (left->br_blockcount + got->br_blockcount > MAXEXTLEN))
5654 struct xfs_bmbt_irec *left, /* preceding extent */
5664 blockcount = left->br_blockcount + got->br_blockcount;
5668 ASSERT(xfs_bmse_can_merge(left, got, shift));
5670 new = *left;
5698 error = xfs_bmbt_lookup_eq(cur, left, &i);
5722 new.br_startoff = left->br_startoff + left->br_blockcount;
5956 * Unlike a left shift (which involves a hole punch), a right