55 	RB_CLEAR_NODE(&em->rb_node);  in alloc_extent_map()
95 	struct rb_node **p = &root->rb_node;  in tree_insert()
96 	struct rb_node *parent = NULL;  in tree_insert()
98 	struct rb_node *orig_parent = NULL;  in tree_insert()
103 		entry = rb_entry(parent, struct extent_map, rb_node);  in tree_insert()
116 		entry = rb_entry(parent, struct extent_map, rb_node);  in tree_insert()
123 	entry = rb_entry(parent, struct extent_map, rb_node);  in tree_insert()
126 		entry = rb_entry(parent, struct extent_map, rb_node);  in tree_insert()
132 	rb_link_node(&em->rb_node, orig_parent, p);  in tree_insert()
133 	rb_insert_color(&em->rb_node, root);  in tree_insert()
141 static struct rb_node *__tree_search(struct rb_root *root, u64 offset,  in __tree_search()
142 				     struct rb_node **prev_ret,  in __tree_search()
143 				     struct rb_node **next_ret)  in __tree_search()
145 	struct rb_node *n = root->rb_node;  in __tree_search()
146 	struct rb_node *prev = NULL;  in __tree_search()
147 	struct rb_node *orig_prev = NULL;  in __tree_search()
152 		entry = rb_entry(n, struct extent_map, rb_node);  in __tree_search()
168 			prev_entry = rb_entry(prev, struct extent_map, rb_node);  in __tree_search()
175 		prev_entry = rb_entry(prev, struct extent_map, rb_node);  in __tree_search()
178 			prev_entry = rb_entry(prev, struct extent_map, rb_node);  in __tree_search()
229 	struct rb_node *rb;  in try_merge_map()
232 		rb = rb_prev(&em->rb_node);  in try_merge_map()
234 			merge = rb_entry(rb, struct extent_map, rb_node);  in try_merge_map()
245 			rb_erase(&merge->rb_node, &tree->map);  in try_merge_map()
246 			RB_CLEAR_NODE(&merge->rb_node);  in try_merge_map()
251 	rb = rb_next(&em->rb_node);  in try_merge_map()
253 		merge = rb_entry(rb, struct extent_map, rb_node);  in try_merge_map()
257 		rb_erase(&merge->rb_node, &tree->map);  in try_merge_map()
258 		RB_CLEAR_NODE(&merge->rb_node);  in try_merge_map()
365 	struct rb_node *rb_node;  in __lookup_extent_mapping()  local
366 	struct rb_node *prev = NULL;  in __lookup_extent_mapping()
367 	struct rb_node *next = NULL;  in __lookup_extent_mapping()
370 	rb_node = __tree_search(&tree->map, start, &prev, &next);  in __lookup_extent_mapping()
371 	if (!rb_node) {  in __lookup_extent_mapping()
373 			rb_node = prev;  in __lookup_extent_mapping()
375 			rb_node = next;  in __lookup_extent_mapping()
380 	em = rb_entry(rb_node, struct extent_map, rb_node);  in __lookup_extent_mapping()
436 	rb_erase(&em->rb_node, &tree->map);  in remove_extent_mapping()
439 	RB_CLEAR_NODE(&em->rb_node);  in remove_extent_mapping()
452 	rb_replace_node(&cur->rb_node, &new->rb_node, &tree->map);  in replace_extent_mapping()
453 	RB_CLEAR_NODE(&cur->rb_node);  in replace_extent_mapping()
460 	struct rb_node *next;  in next_extent_map()
462 	next = rb_next(&em->rb_node);  in next_extent_map()
465 	return container_of(next, struct extent_map, rb_node);  in next_extent_map()
470 	struct rb_node *prev;  in prev_extent_map()
472 	prev = rb_prev(&em->rb_node);  in prev_extent_map()
475 	return container_of(prev, struct extent_map, rb_node);  in prev_extent_map()