Lines Matching refs:rbp
33 struct rb_node **rbp; in xfs_extent_busy_insert() local
48 rbp = &pag->pagb_tree.rb_node; in xfs_extent_busy_insert()
49 while (*rbp) { in xfs_extent_busy_insert()
50 parent = *rbp; in xfs_extent_busy_insert()
54 rbp = &(*rbp)->rb_left; in xfs_extent_busy_insert()
57 rbp = &(*rbp)->rb_right; in xfs_extent_busy_insert()
64 rb_link_node(&new->rb_node, parent, rbp); in xfs_extent_busy_insert()
89 struct rb_node *rbp; in xfs_extent_busy_search() local
96 rbp = pag->pagb_tree.rb_node; in xfs_extent_busy_search()
99 while (rbp) { in xfs_extent_busy_search()
100 busyp = rb_entry(rbp, struct xfs_extent_busy, rb_node); in xfs_extent_busy_search()
105 rbp = rbp->rb_left; in xfs_extent_busy_search()
110 rbp = rbp->rb_right; in xfs_extent_busy_search()
290 struct rb_node *rbp; in xfs_extent_busy_reuse() local
297 rbp = pag->pagb_tree.rb_node; in xfs_extent_busy_reuse()
298 while (rbp) { in xfs_extent_busy_reuse()
300 rb_entry(rbp, struct xfs_extent_busy, rb_node); in xfs_extent_busy_reuse()
305 rbp = rbp->rb_left; in xfs_extent_busy_reuse()
308 rbp = rbp->rb_right; in xfs_extent_busy_reuse()
341 struct rb_node *rbp; in xfs_extent_busy_trim() local
349 rbp = args->pag->pagb_tree.rb_node; in xfs_extent_busy_trim()
350 while (rbp && flen >= args->minlen) { in xfs_extent_busy_trim()
352 rb_entry(rbp, struct xfs_extent_busy, rb_node); in xfs_extent_busy_trim()
358 rbp = rbp->rb_left; in xfs_extent_busy_trim()
361 rbp = rbp->rb_right; in xfs_extent_busy_trim()