146 	struct rb_node *prev = NULL;  in __tree_search()  local
153 		prev = n;  in __tree_search()
165 		orig_prev = prev;  in __tree_search()
166 		while (prev && offset >= extent_map_end(prev_entry)) {  in __tree_search()
167 			prev = rb_next(prev);  in __tree_search()
168 			prev_entry = rb_entry(prev, struct extent_map, rb_node);  in __tree_search()
170 		*prev_ret = prev;  in __tree_search()
171 		prev = orig_prev;  in __tree_search()
175 		prev_entry = rb_entry(prev, struct extent_map, rb_node);  in __tree_search()
176 		while (prev && offset < prev_entry->start) {  in __tree_search()
177 			prev = rb_prev(prev);  in __tree_search()
178 			prev_entry = rb_entry(prev, struct extent_map, rb_node);  in __tree_search()
180 		*next_ret = prev;  in __tree_search()
186 static int mergable_maps(struct extent_map *prev, struct extent_map *next)  in mergable_maps()  argument
188 	if (test_bit(EXTENT_FLAG_PINNED, &prev->flags))  in mergable_maps()
195 	if (test_bit(EXTENT_FLAG_COMPRESSED, &prev->flags))  in mergable_maps()
198 	if (test_bit(EXTENT_FLAG_LOGGING, &prev->flags) ||  in mergable_maps()
207 	if (!list_empty(&prev->list) || !list_empty(&next->list))  in mergable_maps()
210 	if (extent_map_end(prev) == next->start &&  in mergable_maps()
211 	    prev->flags == next->flags &&  in mergable_maps()
212 	    prev->bdev == next->bdev &&  in mergable_maps()
214 	      prev->block_start == EXTENT_MAP_HOLE) ||  in mergable_maps()
216 	      prev->block_start == EXTENT_MAP_INLINE) ||  in mergable_maps()
218 	      prev->block_start == EXTENT_MAP_DELALLOC) ||  in mergable_maps()
220 	      next->block_start == extent_map_block_end(prev)))) {  in mergable_maps()
366 	struct rb_node *prev = NULL;  in __lookup_extent_mapping()  local
370 	rb_node = __tree_search(&tree->map, start, &prev, &next);  in __lookup_extent_mapping()
372 		if (prev)  in __lookup_extent_mapping()
373 			rb_node = prev;  in __lookup_extent_mapping()
470 	struct rb_node *prev;  in prev_extent_map()  local
472 	prev = rb_prev(&em->rb_node);  in prev_extent_map()
473 	if (!prev)  in prev_extent_map()
475 	return container_of(prev, struct extent_map, rb_node);  in prev_extent_map()
488 	struct extent_map *prev;  in merge_extent_mapping()  local
498 		prev = prev_extent_map(next);  in merge_extent_mapping()
500 		prev = existing;  in merge_extent_mapping()
501 		next = next_extent_map(prev);  in merge_extent_mapping()
504 	start = prev ? extent_map_end(prev) : em->start;  in merge_extent_mapping()