Searched refs:bend (Results 1 – 5 of 5) sorted by relevance
145 xfs_agblock_t bend = bbno + busyp->length; in xfs_extent_busy_update_extent() local170 if (bbno < fbno && bend > fend) { in xfs_extent_busy_update_extent()189 } else if (bbno >= fbno && bend <= fend) { in xfs_extent_busy_update_extent()231 } else if (fend < bend) { in xfs_extent_busy_update_extent()302 xfs_agblock_t bend = bbno + busyp->length; in xfs_extent_busy_reuse() local307 } else if (fbno >= bend) { in xfs_extent_busy_reuse()356 xfs_agblock_t bend = bbno + busyp->length; in xfs_extent_busy_trim() local361 } else if (fbno >= bend) { in xfs_extent_busy_trim()409 if (fend <= bend) in xfs_extent_busy_trim()429 fbno = bend; in xfs_extent_busy_trim()[all …]
1736 size_t bend; in xfs_buf_zero() local1738 bend = boff + bsize; in xfs_buf_zero()1739 while (boff < bend) { in xfs_buf_zero()
154 int bend;172 bend = (int) ((((f2 - f1) * mantissa) >> 13) + f1);174 bend = 1048576L / bend;175 return bend;
725 unsigned long *bpos, *bend; in ntfs_write_block() local730 bend = (unsigned long *)((u8*)bpos + blocksize); in ntfs_write_block()734 } while (likely(++bpos < bend)); in ntfs_write_block()736 if (bpos == bend) { in ntfs_write_block()
515 bend their backs to cope with this incoherence (to which I would be