Home
last modified time | relevance | path

Searched refs:busyp (Results 1 – 2 of 2) sorted by relevance

/linux/fs/xfs/
H A Dxfs_extent_busy.c40 struct xfs_extent_busy *busyp; in xfs_extent_busy_insert_list() local
59 busyp = rb_entry(parent, struct xfs_extent_busy, rb_node); in xfs_extent_busy_insert_list()
61 if (new->bno < busyp->bno) { in xfs_extent_busy_insert_list()
63 ASSERT(new->bno + new->length <= busyp->bno); in xfs_extent_busy_insert_list()
64 } else if (new->bno > busyp->bno) { in xfs_extent_busy_insert_list()
66 ASSERT(bno >= busyp->bno + busyp->length); in xfs_extent_busy_insert_list()
119 struct xfs_extent_busy *busyp; in xfs_extent_busy_search() local
126 busyp = rb_entry(rbp, struct xfs_extent_busy, rb_node); in xfs_extent_busy_search()
127 if (bno < busyp->bno) { in xfs_extent_busy_search()
129 if (bno + len > busyp->bno) in xfs_extent_busy_search()
[all …]
H A Dxfs_discard.c116 struct xfs_extent_busy *busyp; in xfs_discard_extents() local
121 list_for_each_entry(busyp, &extents->extent_list, list) { in xfs_discard_extents()
122 struct xfs_group *xg = busyp->group; in xfs_discard_extents()
126 trace_xfs_discard_extent(xg, busyp->bno, busyp->length); in xfs_discard_extents()
129 xfs_gbno_to_daddr(xg, busyp->bno), in xfs_discard_extents()
130 XFS_FSB_TO_BB(mp, busyp->length), in xfs_discard_extents()
453 struct xfs_rtx_busy *busyp, *n; in xfs_discard_free_rtdev_extents() local
455 list_for_each_entry_safe(busyp, n, &tr->extent_list, list) { in xfs_discard_free_rtdev_extents()
456 list_del_init(&busyp->list); in xfs_discard_free_rtdev_extents()
457 kfree(busyp); in xfs_discard_free_rtdev_extents()
[all …]