Lines Matching defs:busy
282 bool busy;
284 /* Trim busy sections out of found extent */
285 busy = xfs_extent_busy_trim(args, &bno, &len, busy_gen);
311 return busy;
745 unsigned int busy_gen;/* busy state */
746 bool busy;
770 acur->busy = false;
832 bool busy;
854 busy = xfs_alloc_compute_aligned(args, bno, len, &bnoa, &lena,
856 acur->busy |= busy;
857 if (busy)
1209 xfs_agblock_t tbno; /* start block of busy extent */
1210 xfs_extlen_t tlen; /* length of busy extent */
1211 xfs_agblock_t tend; /* end block of busy extent */
1247 * Check for overlapping busy extents.
1254 * Give up if the start of the extent is busy, or the freespace isn't
1459 * If we failed to find anything due to busy extents, return empty
1460 * handed so the caller can flush and retry. If no busy extents were
1463 if (!xfs_alloc_cur_active(acur->cnt) && !acur->len && !acur->busy) {
1631 if (acur.busy) {
1670 bool busy;
1680 busy = false;
1692 * tree unless the tree is empty. In the case that there are only busy
1707 busy = xfs_alloc_compute_aligned(args, fbno, flen, &rbno,
1711 * Search for a non-busy extent that is large enough.
1722 busy = xfs_alloc_compute_aligned(args, fbno, flen,
1733 * Our only valid extents must have been busy.
1785 busy = xfs_alloc_compute_aligned(args, fbno, flen,
1822 if (busy) {