96 	struct extent_map *entry = NULL;  in tree_insert()  local
102 		entry = rb_entry(parent, struct extent_map, rb_node);  in tree_insert()
104 		if (em->start < entry->start)  in tree_insert()
106 		else if (em->start >= extent_map_end(entry))  in tree_insert()
113 	while (parent && em->start >= extent_map_end(entry)) {  in tree_insert()
115 		entry = rb_entry(parent, struct extent_map, rb_node);  in tree_insert()
118 		if (end > entry->start && em->start < extent_map_end(entry))  in tree_insert()
122 	entry = rb_entry(parent, struct extent_map, rb_node);  in tree_insert()
123 	while (parent && em->start < entry->start) {  in tree_insert()
125 		entry = rb_entry(parent, struct extent_map, rb_node);  in tree_insert()
128 		if (end > entry->start && em->start < extent_map_end(entry))  in tree_insert()
147 	struct extent_map *entry;  in __tree_search()  local
151 		entry = rb_entry(n, struct extent_map, rb_node);  in __tree_search()
153 		prev_entry = entry;  in __tree_search()
155 		if (offset < entry->start)  in __tree_search()
157 		else if (offset >= extent_map_end(entry))  in __tree_search()