nfs/blocklayout/extent_tree.c

19 ext_tree_first(struct rb_root *root)
21 	struct rb_node *node = rb_first(root);
46 __ext_tree_search(struct rb_root *root, sector_t start)
48 	struct rb_node *node = root->rb_node;
95 ext_try_to_merge_left(struct rb_root *root, struct pnfs_block_extent *be)
101 		rb_erase(&be->be_node, root);
111 ext_try_to_merge_right(struct rb_root *root, struct pnfs_block_extent *be)
117 		rb_erase(&right->be_node, root);
136 __ext_tree_insert(struct rb_root *root,
139 	struct rb_node **p = &root->rb_node, *parent = NULL;
152 				be = ext_try_to_merge_left(root, be);
159 				be = ext_try_to_merge_right(root, be);
169 	rb_insert_color(&new->be_node, root);
177 __ext_tree_remove(struct rb_root *root,
185 	be = __ext_tree_search(root, start);
219 			__ext_tree_insert(root, new, true);
237 			rb_erase(&be->be_node, root);
258 	struct rb_root *root;
264 		root = &bl->bl_ext_rw;
268 		root = &bl->bl_ext_ro;
277 	be = __ext_tree_search(root, new->be_f_offset);
279 		__ext_tree_insert(root, new, true);
295 		__ext_tree_insert(root, new, true);
309 		__ext_tree_insert(root, split, true);
322 __ext_tree_lookup(struct rb_root *root, sector_t isect,
328 	node = root->rb_node;
380 ext_tree_split(struct rb_root *root, struct pnfs_block_extent *be,
400 	__ext_tree_insert(root, new, false);
408 	struct rb_root *root = &bl->bl_ext_rw;
425 	for (be = __ext_tree_search(root, start); be; be = ext_tree_next(be)) {
444 				err = ext_tree_split(root, be, start);
462 				err = ext_tree_split(root, be, end);
470 			be = ext_try_to_merge_left(root, be);
471 			be = ext_try_to_merge_right(root, be);
618 	struct rb_root *root = &bl->bl_ext_rw;
626 	for (be = ext_tree_first(root); be; be = ext_tree_next(be)) {
643 		be = ext_try_to_merge_left(root, be);
644 		be = ext_try_to_merge_right(root, be);