Lines Matching defs:busyp
31 struct xfs_extent_busy *busyp;
49 busyp = rb_entry(parent, struct xfs_extent_busy, rb_node);
51 if (new->bno < busyp->bno) {
53 ASSERT(new->bno + new->length <= busyp->bno);
54 } else if (new->bno > busyp->bno) {
56 ASSERT(bno >= busyp->bno + busyp->length);
109 struct xfs_extent_busy *busyp;
116 busyp = rb_entry(rbp, struct xfs_extent_busy, rb_node);
117 if (bno < busyp->bno) {
119 if (bno + len > busyp->bno)
122 } else if (bno > busyp->bno) {
124 if (bno < busyp->bno + busyp->length)
128 /* bno matches busyp, length determines exact match */
129 match = (busyp->length == len) ? 1 : -1;
152 struct xfs_extent_busy *busyp,
159 xfs_agblock_t bbno = busyp->bno;
160 xfs_agblock_t bend = bbno + busyp->length;
167 if (busyp->flags & XFS_EXTENT_BUSY_DISCARDED) {
243 rb_erase(&busyp->rb_node, &pag->pagb_tree);
244 busyp->length = 0;
261 busyp->bno = fend;
262 busyp->length = bend - fend;
277 busyp->length = fbno - busyp->bno;
312 struct xfs_extent_busy *busyp =
314 xfs_agblock_t bbno = busyp->bno;
315 xfs_agblock_t bend = bbno + busyp->length;
325 if (!xfs_extent_busy_update_extent(mp, pag, busyp, fbno, flen,
363 struct xfs_extent_busy *busyp =
366 xfs_agblock_t bbno = busyp->bno;
367 xfs_agblock_t bend = bbno + busyp->length;
524 struct xfs_extent_busy *busyp)
526 if (busyp->length) {
527 trace_xfs_extent_busy_clear(mp, busyp->agno, busyp->bno,
528 busyp->length);
529 rb_erase(&busyp->rb_node, &pag->pagb_tree);
532 list_del_init(&busyp->list);
533 kmem_free(busyp);
562 struct xfs_extent_busy *busyp, *n;
567 list_for_each_entry_safe(busyp, n, list, list) {
568 if (busyp->agno != agno) {
571 agno = busyp->agno;
577 if (do_discard && busyp->length &&
578 !(busyp->flags & XFS_EXTENT_BUSY_SKIP_DISCARD)) {
579 busyp->flags = XFS_EXTENT_BUSY_DISCARDED;
581 xfs_extent_busy_clear_one(mp, pag, busyp);