54 	RB_CLEAR_NODE(&em->rb_node);  in alloc_extent_map()
94 	struct rb_node **p = &root->rb_node;  in tree_insert()
95 	struct rb_node *parent = NULL;  in tree_insert()
97 	struct rb_node *orig_parent = NULL;  in tree_insert()
102 		entry = rb_entry(parent, struct extent_map, rb_node);  in tree_insert()
115 		entry = rb_entry(parent, struct extent_map, rb_node);  in tree_insert()
122 	entry = rb_entry(parent, struct extent_map, rb_node);  in tree_insert()
125 		entry = rb_entry(parent, struct extent_map, rb_node);  in tree_insert()
131 	rb_link_node(&em->rb_node, orig_parent, p);  in tree_insert()
132 	rb_insert_color(&em->rb_node, root);  in tree_insert()
140 static struct rb_node *__tree_search(struct rb_root *root, u64 offset,  in __tree_search()
141 				     struct rb_node **prev_ret,  in __tree_search()
142 				     struct rb_node **next_ret)  in __tree_search()
144 	struct rb_node *n = root->rb_node;  in __tree_search()
145 	struct rb_node *prev = NULL;  in __tree_search()
146 	struct rb_node *orig_prev = NULL;  in __tree_search()
151 		entry = rb_entry(n, struct extent_map, rb_node);  in __tree_search()
167 			prev_entry = rb_entry(prev, struct extent_map, rb_node);  in __tree_search()
174 		prev_entry = rb_entry(prev, struct extent_map, rb_node);  in __tree_search()
177 			prev_entry = rb_entry(prev, struct extent_map, rb_node);  in __tree_search()
228 	struct rb_node *rb;  in try_merge_map()
231 		rb = rb_prev(&em->rb_node);  in try_merge_map()
233 			merge = rb_entry(rb, struct extent_map, rb_node);  in try_merge_map()
244 			rb_erase(&merge->rb_node, &tree->map);  in try_merge_map()
245 			RB_CLEAR_NODE(&merge->rb_node);  in try_merge_map()
250 	rb = rb_next(&em->rb_node);  in try_merge_map()
252 		merge = rb_entry(rb, struct extent_map, rb_node);  in try_merge_map()
256 		rb_erase(&merge->rb_node, &tree->map);  in try_merge_map()
257 		RB_CLEAR_NODE(&merge->rb_node);  in try_merge_map()
364 	struct rb_node *rb_node;  in __lookup_extent_mapping()  local
365 	struct rb_node *prev = NULL;  in __lookup_extent_mapping()
366 	struct rb_node *next = NULL;  in __lookup_extent_mapping()
369 	rb_node = __tree_search(&tree->map, start, &prev, &next);  in __lookup_extent_mapping()
370 	if (!rb_node) {  in __lookup_extent_mapping()
372 			rb_node = prev;  in __lookup_extent_mapping()
374 			rb_node = next;  in __lookup_extent_mapping()
379 	em = rb_entry(rb_node, struct extent_map, rb_node);  in __lookup_extent_mapping()
435 	rb_erase(&em->rb_node, &tree->map);  in remove_extent_mapping()
438 	RB_CLEAR_NODE(&em->rb_node);  in remove_extent_mapping()
451 	rb_replace_node(&cur->rb_node, &new->rb_node, &tree->map);  in replace_extent_mapping()
452 	RB_CLEAR_NODE(&cur->rb_node);  in replace_extent_mapping()