Lines Matching refs:xb_root
60 for ((bn) = rb_entry_safe(rb_first(&(bitmap)->xb_root.rb_root), \
77 while ((bn = xbitmap_tree_iter_first(&bitmap->xb_root, start, last))) {
82 xbitmap_tree_remove(bn, &bitmap->xb_root);
84 xbitmap_tree_insert(bn, &bitmap->xb_root);
93 xbitmap_tree_insert(new_bn, &bitmap->xb_root);
96 xbitmap_tree_remove(bn, &bitmap->xb_root);
98 xbitmap_tree_insert(bn, &bitmap->xb_root);
101 xbitmap_tree_remove(bn, &bitmap->xb_root);
103 xbitmap_tree_insert(bn, &bitmap->xb_root);
107 xbitmap_tree_remove(bn, &bitmap->xb_root);
128 left = xbitmap_tree_iter_first(&bitmap->xb_root, start, last);
138 left = xbitmap_tree_iter_first(&bitmap->xb_root, start - 1, start - 1);
142 right = xbitmap_tree_iter_first(&bitmap->xb_root, last + 1, last + 1);
147 xbitmap_tree_remove(left, &bitmap->xb_root);
148 xbitmap_tree_remove(right, &bitmap->xb_root);
150 xbitmap_tree_insert(left, &bitmap->xb_root);
154 xbitmap_tree_remove(left, &bitmap->xb_root);
156 xbitmap_tree_insert(left, &bitmap->xb_root);
159 xbitmap_tree_remove(right, &bitmap->xb_root);
161 xbitmap_tree_insert(right, &bitmap->xb_root);
169 xbitmap_tree_insert(left, &bitmap->xb_root);
182 while ((bn = xbitmap_tree_iter_first(&bitmap->xb_root, 0, -1ULL))) {
183 xbitmap_tree_remove(bn, &bitmap->xb_root);
193 bitmap->xb_root = RB_ROOT_CACHED;
358 return bitmap->xb_root.rb_root.rb_node == NULL;
371 bn = xbitmap_tree_iter_first(&bitmap->xb_root, start, last);