59 #define for_each_xbitmap_extent(bn, bitmap) \  in INTERVAL_TREE_DEFINE()  argument
60 	for ((bn) = rb_entry_safe(rb_first(&(bitmap)->xb_root.rb_root), \  in INTERVAL_TREE_DEFINE()
69 	struct xbitmap		*bitmap,
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);
118 	struct xbitmap		*bitmap,  in xbitmap_set()  argument
128 	left = xbitmap_tree_iter_first(&bitmap->xb_root, start, last);  in xbitmap_set()
133 	error = xbitmap_clear(bitmap, start, len);  in xbitmap_set()
138 	left = xbitmap_tree_iter_first(&bitmap->xb_root, start - 1, start - 1);  in xbitmap_set()
142 	right = xbitmap_tree_iter_first(&bitmap->xb_root, last + 1, last + 1);  in xbitmap_set()
147 		xbitmap_tree_remove(left, &bitmap->xb_root);  in xbitmap_set()
148 		xbitmap_tree_remove(right, &bitmap->xb_root);  in xbitmap_set()
150 		xbitmap_tree_insert(left, &bitmap->xb_root);  in xbitmap_set()
154 		xbitmap_tree_remove(left, &bitmap->xb_root);  in xbitmap_set()
156 		xbitmap_tree_insert(left, &bitmap->xb_root);  in xbitmap_set()
159 		xbitmap_tree_remove(right, &bitmap->xb_root);  in xbitmap_set()
161 		xbitmap_tree_insert(right, &bitmap->xb_root);  in xbitmap_set()
169 		xbitmap_tree_insert(left, &bitmap->xb_root);  in xbitmap_set()
178 	struct xbitmap		*bitmap)  in xbitmap_destroy()  argument
182 	while ((bn = xbitmap_tree_iter_first(&bitmap->xb_root, 0, -1ULL))) {  in xbitmap_destroy()
183 		xbitmap_tree_remove(bn, &bitmap->xb_root);  in xbitmap_destroy()
191 	struct xbitmap		*bitmap)  in xbitmap_init()  argument
193 	bitmap->xb_root = RB_ROOT_CACHED;  in xbitmap_init()
212 	struct xbitmap		*bitmap,  in xbitmap_disunion()  argument
218 	if (xbitmap_empty(bitmap) || xbitmap_empty(sub))  in xbitmap_disunion()
222 		error = xbitmap_clear(bitmap, bn->bn_start,  in xbitmap_disunion()
273 	struct xagb_bitmap	*bitmap = priv;  in xagb_bitmap_visit_btblock()  local
285 	return xagb_bitmap_set(bitmap, agbno, 1);  in xagb_bitmap_visit_btblock()
291 	struct xagb_bitmap	*bitmap,  in xagb_bitmap_set_btblocks()  argument
295 			XFS_BTREE_VISIT_ALL, bitmap);  in xagb_bitmap_set_btblocks()
305 	struct xagb_bitmap	*bitmap,  in xagb_bitmap_set_btcur_path()  argument
312 		error = xagb_bitmap_visit_btblock(cur, i, bitmap);  in xagb_bitmap_set_btcur_path()
323 	struct xbitmap		*bitmap)  in xbitmap_hweight()  argument
328 	for_each_xbitmap_extent(bn, bitmap)  in xbitmap_hweight()
337 	struct xbitmap		*bitmap,  in xbitmap_walk()  argument
344 	for_each_xbitmap_extent(bn, bitmap) {  in xbitmap_walk()
356 	struct xbitmap		*bitmap)  in xbitmap_empty()  argument
358 	return bitmap->xb_root.rb_root.rb_node == NULL;  in xbitmap_empty()
364 	struct xbitmap		*bitmap,  in xbitmap_test()  argument
371 	bn = xbitmap_tree_iter_first(&bitmap->xb_root, start, last);  in xbitmap_test()