145 	struct rb_node *prev = NULL;  in __tree_search()  local
152 		prev = n;  in __tree_search()
164 		orig_prev = prev;  in __tree_search()
165 		while (prev && offset >= extent_map_end(prev_entry)) {  in __tree_search()
166 			prev = rb_next(prev);  in __tree_search()
167 			prev_entry = rb_entry(prev, struct extent_map, rb_node);  in __tree_search()
169 		*prev_ret = prev;  in __tree_search()
170 		prev = orig_prev;  in __tree_search()
174 		prev_entry = rb_entry(prev, struct extent_map, rb_node);  in __tree_search()
175 		while (prev && offset < prev_entry->start) {  in __tree_search()
176 			prev = rb_prev(prev);  in __tree_search()
177 			prev_entry = rb_entry(prev, struct extent_map, rb_node);  in __tree_search()
179 		*next_ret = prev;  in __tree_search()
185 static int mergable_maps(struct extent_map *prev, struct extent_map *next)  in mergable_maps()  argument
187 	if (test_bit(EXTENT_FLAG_PINNED, &prev->flags))  in mergable_maps()
194 	if (test_bit(EXTENT_FLAG_COMPRESSED, &prev->flags))  in mergable_maps()
197 	if (test_bit(EXTENT_FLAG_LOGGING, &prev->flags) ||  in mergable_maps()
206 	if (!list_empty(&prev->list) || !list_empty(&next->list))  in mergable_maps()
209 	if (extent_map_end(prev) == next->start &&  in mergable_maps()
210 	    prev->flags == next->flags &&  in mergable_maps()
211 	    prev->bdev == next->bdev &&  in mergable_maps()
213 	      prev->block_start == EXTENT_MAP_HOLE) ||  in mergable_maps()
215 	      prev->block_start == EXTENT_MAP_INLINE) ||  in mergable_maps()
217 	      prev->block_start == EXTENT_MAP_DELALLOC) ||  in mergable_maps()
219 	      next->block_start == extent_map_block_end(prev)))) {  in mergable_maps()
365 	struct rb_node *prev = NULL;  in __lookup_extent_mapping()  local
369 	rb_node = __tree_search(&tree->map, start, &prev, &next);  in __lookup_extent_mapping()
371 		if (prev)  in __lookup_extent_mapping()
372 			rb_node = prev;  in __lookup_extent_mapping()