Lines Matching refs:rbp
45 struct rb_node **rbp; in xfs_extent_busy_insert() local
71 rbp = &pag->pagb_tree.rb_node; in xfs_extent_busy_insert()
72 while (*rbp) { in xfs_extent_busy_insert()
73 parent = *rbp; in xfs_extent_busy_insert()
77 rbp = &(*rbp)->rb_left; in xfs_extent_busy_insert()
80 rbp = &(*rbp)->rb_right; in xfs_extent_busy_insert()
87 rb_link_node(&new->rb_node, parent, rbp); in xfs_extent_busy_insert()
112 struct rb_node *rbp; in xfs_extent_busy_search() local
119 rbp = pag->pagb_tree.rb_node; in xfs_extent_busy_search()
122 while (rbp) { in xfs_extent_busy_search()
123 busyp = rb_entry(rbp, struct xfs_extent_busy, rb_node); in xfs_extent_busy_search()
128 rbp = rbp->rb_left; in xfs_extent_busy_search()
133 rbp = rbp->rb_right; in xfs_extent_busy_search()
312 struct rb_node *rbp; in xfs_extent_busy_reuse() local
319 rbp = pag->pagb_tree.rb_node; in xfs_extent_busy_reuse()
320 while (rbp) { in xfs_extent_busy_reuse()
322 rb_entry(rbp, struct xfs_extent_busy, rb_node); in xfs_extent_busy_reuse()
327 rbp = rbp->rb_left; in xfs_extent_busy_reuse()
330 rbp = rbp->rb_right; in xfs_extent_busy_reuse()
358 struct rb_node *rbp; in xfs_extent_busy_trim() local
366 rbp = args->pag->pagb_tree.rb_node; in xfs_extent_busy_trim()
367 while (rbp && flen >= args->minlen) { in xfs_extent_busy_trim()
369 rb_entry(rbp, struct xfs_extent_busy, rb_node); in xfs_extent_busy_trim()
375 rbp = rbp->rb_left; in xfs_extent_busy_trim()
378 rbp = rbp->rb_right; in xfs_extent_busy_trim()