190 static int mergable_maps(struct extent_map *prev, struct extent_map *next)  in mergable_maps()  argument
203 	    test_bit(EXTENT_FLAG_LOGGING, &next->flags))  in mergable_maps()
211 	if (!list_empty(&prev->list) || !list_empty(&next->list))  in mergable_maps()
214 	ASSERT(next->block_start != EXTENT_MAP_DELALLOC &&  in mergable_maps()
217 	if (prev->map_lookup || next->map_lookup)  in mergable_maps()
219 		       test_bit(EXTENT_FLAG_FS_MAPPING, &next->flags));  in mergable_maps()
221 	if (extent_map_end(prev) == next->start &&  in mergable_maps()
222 	    prev->flags == next->flags &&  in mergable_maps()
223 	    prev->map_lookup == next->map_lookup &&  in mergable_maps()
224 	    ((next->block_start == EXTENT_MAP_HOLE &&  in mergable_maps()
226 	     (next->block_start == EXTENT_MAP_INLINE &&  in mergable_maps()
228 	     (next->block_start < EXTENT_MAP_LAST_BYTE - 1 &&  in mergable_maps()
229 	      next->block_start == extent_map_block_end(prev)))) {  in mergable_maps()
424 	struct rb_node *next = NULL;  in __lookup_extent_mapping()  local
427 	rb_node = __tree_search(&tree->map.rb_root, start, &prev, &next);  in __lookup_extent_mapping()
431 		else if (next)  in __lookup_extent_mapping()
432 			rb_node = next;  in __lookup_extent_mapping()
516 	struct rb_node *next;  in next_extent_map()  local
518 	next = rb_next(&em->rb_node);  in next_extent_map()
519 	if (!next)  in next_extent_map()
521 	return container_of(next, struct extent_map, rb_node);  in next_extent_map()
546 	struct extent_map *next;  in merge_extent_mapping()  local
554 		next = existing;  in merge_extent_mapping()
555 		prev = prev_extent_map(next);  in merge_extent_mapping()
558 		next = next_extent_map(prev);  in merge_extent_mapping()
563 	end = next ? next->start : extent_map_end(em);  in merge_extent_mapping()