busyp 31 fs/xfs/xfs_extent_busy.c struct xfs_extent_busy *busyp; busyp 51 fs/xfs/xfs_extent_busy.c busyp = rb_entry(parent, struct xfs_extent_busy, rb_node); busyp 53 fs/xfs/xfs_extent_busy.c if (new->bno < busyp->bno) { busyp 55 fs/xfs/xfs_extent_busy.c ASSERT(new->bno + new->length <= busyp->bno); busyp 56 fs/xfs/xfs_extent_busy.c } else if (new->bno > busyp->bno) { busyp 58 fs/xfs/xfs_extent_busy.c ASSERT(bno >= busyp->bno + busyp->length); busyp 90 fs/xfs/xfs_extent_busy.c struct xfs_extent_busy *busyp; busyp 100 fs/xfs/xfs_extent_busy.c busyp = rb_entry(rbp, struct xfs_extent_busy, rb_node); busyp 101 fs/xfs/xfs_extent_busy.c if (bno < busyp->bno) { busyp 103 fs/xfs/xfs_extent_busy.c if (bno + len > busyp->bno) busyp 106 fs/xfs/xfs_extent_busy.c } else if (bno > busyp->bno) { busyp 108 fs/xfs/xfs_extent_busy.c if (bno < busyp->bno + busyp->length) busyp 113 fs/xfs/xfs_extent_busy.c match = (busyp->length == len) ? 1 : -1; busyp 137 fs/xfs/xfs_extent_busy.c struct xfs_extent_busy *busyp, busyp 144 fs/xfs/xfs_extent_busy.c xfs_agblock_t bbno = busyp->bno; busyp 145 fs/xfs/xfs_extent_busy.c xfs_agblock_t bend = bbno + busyp->length; busyp 152 fs/xfs/xfs_extent_busy.c if (busyp->flags & XFS_EXTENT_BUSY_DISCARDED) { busyp 228 fs/xfs/xfs_extent_busy.c rb_erase(&busyp->rb_node, &pag->pagb_tree); busyp 229 fs/xfs/xfs_extent_busy.c busyp->length = 0; busyp 246 fs/xfs/xfs_extent_busy.c busyp->bno = fend; busyp 261 fs/xfs/xfs_extent_busy.c busyp->length = fbno - busyp->bno; busyp 299 fs/xfs/xfs_extent_busy.c struct xfs_extent_busy *busyp = busyp 301 fs/xfs/xfs_extent_busy.c xfs_agblock_t bbno = busyp->bno; busyp 302 fs/xfs/xfs_extent_busy.c xfs_agblock_t bend = bbno + busyp->length; busyp 312 fs/xfs/xfs_extent_busy.c if (!xfs_extent_busy_update_extent(mp, pag, busyp, fbno, flen, busyp 352 fs/xfs/xfs_extent_busy.c struct xfs_extent_busy *busyp = busyp 355 fs/xfs/xfs_extent_busy.c xfs_agblock_t bbno = busyp->bno; busyp 356 fs/xfs/xfs_extent_busy.c xfs_agblock_t bend = bbno + busyp->length; busyp 371 fs/xfs/xfs_extent_busy.c !(busyp->flags & XFS_EXTENT_BUSY_DISCARDED)) { busyp 373 fs/xfs/xfs_extent_busy.c busyp, fbno, flen, busyp 526 fs/xfs/xfs_extent_busy.c struct xfs_extent_busy *busyp) busyp 528 fs/xfs/xfs_extent_busy.c if (busyp->length) { busyp 529 fs/xfs/xfs_extent_busy.c trace_xfs_extent_busy_clear(mp, busyp->agno, busyp->bno, busyp 530 fs/xfs/xfs_extent_busy.c busyp->length); busyp 531 fs/xfs/xfs_extent_busy.c rb_erase(&busyp->rb_node, &pag->pagb_tree); busyp 534 fs/xfs/xfs_extent_busy.c list_del_init(&busyp->list); busyp 535 fs/xfs/xfs_extent_busy.c kmem_free(busyp); busyp 564 fs/xfs/xfs_extent_busy.c struct xfs_extent_busy *busyp, *n; busyp 569 fs/xfs/xfs_extent_busy.c list_for_each_entry_safe(busyp, n, list, list) { busyp 570 fs/xfs/xfs_extent_busy.c if (busyp->agno != agno) { busyp 573 fs/xfs/xfs_extent_busy.c agno = busyp->agno; busyp 579 fs/xfs/xfs_extent_busy.c if (do_discard && busyp->length && busyp 580 fs/xfs/xfs_extent_busy.c !(busyp->flags & XFS_EXTENT_BUSY_SKIP_DISCARD)) { busyp 581 fs/xfs/xfs_extent_busy.c busyp->flags = XFS_EXTENT_BUSY_DISCARDED; busyp 583 fs/xfs/xfs_extent_busy.c xfs_extent_busy_clear_one(mp, pag, busyp); busyp 534 fs/xfs/xfs_log_cil.c struct xfs_extent_busy *busyp; busyp 542 fs/xfs/xfs_log_cil.c list_for_each_entry(busyp, list, list) { busyp 543 fs/xfs/xfs_log_cil.c trace_xfs_discard_extent(mp, busyp->agno, busyp->bno, busyp 544 fs/xfs/xfs_log_cil.c busyp->length); busyp 547 fs/xfs/xfs_log_cil.c XFS_AGB_TO_DADDR(mp, busyp->agno, busyp->bno), busyp 548 fs/xfs/xfs_log_cil.c XFS_FSB_TO_BB(mp, busyp->length), busyp 553 fs/xfs/xfs_log_cil.c (unsigned long long)busyp->bno, busyp 554 fs/xfs/xfs_log_cil.c busyp->length,