Lines Matching defs:busyp
31 struct xfs_extent_busy *busyp;
51 busyp = rb_entry(parent, struct xfs_extent_busy, rb_node);
53 if (new->bno < busyp->bno) {
55 ASSERT(new->bno + new->length <= busyp->bno);
56 } else if (new->bno > busyp->bno) {
58 ASSERT(bno >= busyp->bno + busyp->length);
90 struct xfs_extent_busy *busyp;
100 busyp = rb_entry(rbp, struct xfs_extent_busy, rb_node);
101 if (bno < busyp->bno) {
103 if (bno + len > busyp->bno)
106 } else if (bno > busyp->bno) {
108 if (bno < busyp->bno + busyp->length)
112 /* bno matches busyp, length determines exact match */
113 match = (busyp->length == len) ? 1 : -1;
137 struct xfs_extent_busy *busyp,
144 xfs_agblock_t bbno = busyp->bno;
145 xfs_agblock_t bend = bbno + busyp->length;
152 if (busyp->flags & XFS_EXTENT_BUSY_DISCARDED) {
228 rb_erase(&busyp->rb_node, &pag->pagb_tree);
229 busyp->length = 0;
246 busyp->bno = fend;
261 busyp->length = fbno - busyp->bno;
299 struct xfs_extent_busy *busyp =
301 xfs_agblock_t bbno = busyp->bno;
302 xfs_agblock_t bend = bbno + busyp->length;
312 if (!xfs_extent_busy_update_extent(mp, pag, busyp, fbno, flen,
351 struct xfs_extent_busy *busyp =
354 xfs_agblock_t bbno = busyp->bno;
355 xfs_agblock_t bend = bbno + busyp->length;
512 struct xfs_extent_busy *busyp)
514 if (busyp->length) {
515 trace_xfs_extent_busy_clear(mp, busyp->agno, busyp->bno,
516 busyp->length);
517 rb_erase(&busyp->rb_node, &pag->pagb_tree);
520 list_del_init(&busyp->list);
521 kmem_free(busyp);
550 struct xfs_extent_busy *busyp, *n;
555 list_for_each_entry_safe(busyp, n, list, list) {
556 if (busyp->agno != agno) {
559 agno = busyp->agno;
565 if (do_discard && busyp->length &&
566 !(busyp->flags & XFS_EXTENT_BUSY_SKIP_DISCARD)) {
567 busyp->flags = XFS_EXTENT_BUSY_DISCARDED;
569 xfs_extent_busy_clear_one(mp, pag, busyp);