95 	struct rb_node *parent = NULL;  in tree_insert()  local
101 		parent = *p;  in tree_insert()
102 		entry = rb_entry(parent, struct extent_map, rb_node);  in tree_insert()
112 	orig_parent = parent;  in tree_insert()
113 	while (parent && em->start >= extent_map_end(entry)) {  in tree_insert()
114 		parent = rb_next(parent);  in tree_insert()
115 		entry = rb_entry(parent, struct extent_map, rb_node);  in tree_insert()
117 	if (parent)  in tree_insert()
121 	parent = orig_parent;  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()
124 		parent = rb_prev(parent);  in tree_insert()
125 		entry = rb_entry(parent, struct extent_map, rb_node);  in tree_insert()
127 	if (parent)  in tree_insert()