57 	RB_CLEAR_NODE(&em->rb_node);  in alloc_extent_map()
94 	struct rb_node **p = &root->rb_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()
103 		entry = rb_entry(parent, struct extent_map, rb_node);  in tree_insert()
118 		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()
128 		entry = rb_entry(parent, struct extent_map, rb_node);  in tree_insert()
134 	rb_link_node(&em->rb_node, orig_parent, p);  in tree_insert()
135 	rb_insert_color_cached(&em->rb_node, root, leftmost);  in tree_insert()
143 static struct rb_node *__tree_search(struct rb_root *root, u64 offset,  in __tree_search()
144 				     struct rb_node **prev_or_next_ret)  in __tree_search()
146 	struct rb_node *n = root->rb_node;  in __tree_search()
147 	struct rb_node *prev = NULL;  in __tree_search()
148 	struct rb_node *orig_prev = NULL;  in __tree_search()
155 		entry = rb_entry(n, struct extent_map, rb_node);  in __tree_search()
170 		prev_entry = rb_entry(prev, struct extent_map, rb_node);  in __tree_search()
183 	prev_entry = rb_entry(prev, struct extent_map, rb_node);  in __tree_search()
186 		prev_entry = rb_entry(prev, struct extent_map, rb_node);  in __tree_search()
242 	struct rb_node *rb;  in try_merge_map()
256 		rb = rb_prev(&em->rb_node);  in try_merge_map()
258 			merge = rb_entry(rb, struct extent_map, rb_node);  in try_merge_map()
270 			rb_erase_cached(&merge->rb_node, &tree->map);  in try_merge_map()
271 			RB_CLEAR_NODE(&merge->rb_node);  in try_merge_map()
276 	rb = rb_next(&em->rb_node);  in try_merge_map()
278 		merge = rb_entry(rb, struct extent_map, rb_node);  in try_merge_map()
282 		rb_erase_cached(&merge->rb_node, &tree->map);  in try_merge_map()
283 		RB_CLEAR_NODE(&merge->rb_node);  in try_merge_map()
433 	struct rb_node *rb_node;  in __lookup_extent_mapping()  local
434 	struct rb_node *prev_or_next = NULL;  in __lookup_extent_mapping()
437 	rb_node = __tree_search(&tree->map.rb_root, start, &prev_or_next);  in __lookup_extent_mapping()
438 	if (!rb_node) {  in __lookup_extent_mapping()
440 			rb_node = prev_or_next;  in __lookup_extent_mapping()
445 	em = rb_entry(rb_node, struct extent_map, rb_node);  in __lookup_extent_mapping()
501 	rb_erase_cached(&em->rb_node, &tree->map);  in remove_extent_mapping()
506 	RB_CLEAR_NODE(&em->rb_node);  in remove_extent_mapping()
520 	rb_replace_node_cached(&cur->rb_node, &new->rb_node, &tree->map);  in replace_extent_mapping()
521 	RB_CLEAR_NODE(&cur->rb_node);  in replace_extent_mapping()
528 	struct rb_node *next;  in next_extent_map()
530 	next = rb_next(&em->rb_node);  in next_extent_map()
533 	return container_of(next, struct extent_map, rb_node);  in next_extent_map()
538 	struct rb_node *prev;  in prev_extent_map()
540 	prev = rb_prev(&em->rb_node);  in prev_extent_map()
543 	return container_of(prev, struct extent_map, rb_node);  in prev_extent_map()
675 		struct rb_node *node;  in drop_all_extent_maps_fast()
678 		em = rb_entry(node, struct extent_map, rb_node);  in drop_all_extent_maps_fast()