101 	struct rb_root rb_root;  member
133 	struct rb_root rb_root;  member
203 	tree->rb_root = RB_ROOT;  in mapping_tree_init()
210 	cache->rb_root = RB_ROOT;  in backref_cache_init()
241 	BUG_ON(!RB_EMPTY_ROOT(&cache->rb_root));  in backref_cache_cleanup()
289 static struct rb_node *tree_insert(struct rb_root *root, u64 bytenr,  in tree_insert()
313 static struct rb_node *tree_search(struct rb_root *root, u64 bytenr)  in tree_search()
417 		rb_erase(&node->rb_node, &tree->rb_root);  in drop_backref_node()
466 	rb_erase(&node->rb_node, &cache->rb_root);  in update_backref_node()
468 	rb_node = tree_insert(&cache->rb_root, node->bytenr, &node->rb_node);  in update_backref_node()
560 	rb_node = tree_search(&rc->reloc_root_tree.rb_root, bytenr);  in find_reloc_root()
854 			rb_node = tree_search(&cache->rb_root, key.offset);
947 			rb_node = tree_search(&cache->rb_root, eb->start);
1036 		rb_node = tree_insert(&cache->rb_root, node->bytenr,
1085 			rb_node = tree_insert(&cache->rb_root, upper->bytenr,
1129 			rb_erase(&upper->rb_node, &cache->rb_root);
1202 	rb_node = tree_search(&cache->rb_root, src->commit_root->start);
1212 		rb_node = tree_search(&cache->rb_root,
1249 	rb_node = tree_insert(&cache->rb_root, new_node->bytenr,
1289 	rb_node = tree_insert(&rc->reloc_root_tree.rb_root,
1315 	rb_node = tree_search(&rc->reloc_root_tree.rb_root,
1319 		rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root);
1344 	rb_node = tree_search(&rc->reloc_root_tree.rb_root,
1348 		rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root);
1358 	rb_node = tree_insert(&rc->reloc_root_tree.rb_root,
2429 	BUG_ON(!RB_EMPTY_ROOT(&rc->reloc_root_tree.rb_root));
2432 static void free_block_list(struct rb_root *blocks)
2950 			 struct reloc_control *rc, struct rb_root *blocks)
3278 			  struct rb_root *blocks)
3348 			    struct rb_root *blocks)
3485 				struct rb_root *blocks)
3653 			struct rb_root *blocks)
3901 	struct rb_root blocks = RB_ROOT;