Searched refs:bend (Results 1 – 6 of 6) sorted by relevance
137 xfs_agblock_t bend = bbno + busyp->length; in xfs_extent_busy_update_extent() local162 if (bbno < fbno && bend > fend) { in xfs_extent_busy_update_extent()181 } else if (bbno >= fbno && bend <= fend) { in xfs_extent_busy_update_extent()223 } else if (fend < bend) { in xfs_extent_busy_update_extent()291 xfs_agblock_t bend = bbno + busyp->length; in xfs_extent_busy_reuse() local296 } else if (fbno >= bend) { in xfs_extent_busy_reuse()343 xfs_agblock_t bend = bbno + busyp->length; in xfs_extent_busy_trim() local348 } else if (fbno >= bend) { in xfs_extent_busy_trim()383 if (fend <= bend) in xfs_extent_busy_trim()403 fbno = bend; in xfs_extent_busy_trim()[all …]
1722 size_t bend; in xfs_buf_zero() local1724 bend = boff + bsize; in xfs_buf_zero()1725 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;
727 unsigned long *bpos, *bend; in ntfs_write_block() local732 bend = (unsigned long *)((u8*)bpos + blocksize); in ntfs_write_block()736 } while (likely(++bpos < bend)); in ntfs_write_block()738 if (bpos == bend) { in ntfs_write_block()
319 but sometimes bend it to make progress. That's for example why some users had to
505 bend their backs to cope with this incoherence (to which I would be
