125 	struct rb_node *prev = NULL;  in __tree_search()  local
132 		prev = n;  in __tree_search()
146 		orig_prev = prev;  in __tree_search()
147 		while (prev && offset >= extent_map_end(prev_entry)) {  in __tree_search()
148 			prev = rb_next(prev);  in __tree_search()
149 			prev_entry = rb_entry(prev, struct extent_map, rb_node);  in __tree_search()
151 		*prev_ret = prev;  in __tree_search()
152 		prev = orig_prev;  in __tree_search()
156 		prev_entry = rb_entry(prev, struct extent_map, rb_node);  in __tree_search()
157 		while (prev && offset < prev_entry->start) {  in __tree_search()
158 			prev = rb_prev(prev);  in __tree_search()
159 			prev_entry = rb_entry(prev, struct extent_map, rb_node);  in __tree_search()
161 		*next_ret = prev;  in __tree_search()
172 	struct rb_node *prev;  in tree_search()  local
174 	ret = __tree_search(root, offset, &prev, NULL);  in tree_search()
176 		return prev;  in tree_search()
181 static int mergable_maps(struct extent_map *prev, struct extent_map *next)  in mergable_maps()  argument
183 	if (test_bit(EXTENT_FLAG_PINNED, &prev->flags))  in mergable_maps()
190 	if (test_bit(EXTENT_FLAG_COMPRESSED, &prev->flags))  in mergable_maps()
193 	if (extent_map_end(prev) == next->start &&  in mergable_maps()
194 	    prev->flags == next->flags &&  in mergable_maps()
195 	    prev->bdev == next->bdev &&  in mergable_maps()
197 	      prev->block_start == EXTENT_MAP_HOLE) ||  in mergable_maps()
199 	      prev->block_start == EXTENT_MAP_INLINE) ||  in mergable_maps()
201 	      prev->block_start == EXTENT_MAP_DELALLOC) ||  in mergable_maps()
203 	      next->block_start == extent_map_block_end(prev)))) {  in mergable_maps()
294 	struct rb_node *prev = NULL;  in lookup_extent_mapping()  local
299 	rb_node = __tree_search(&tree->map, start, &prev, &next);  in lookup_extent_mapping()
300 	if (!rb_node && prev) {  in lookup_extent_mapping()
301 		em = rb_entry(prev, struct extent_map, rb_node);  in lookup_extent_mapping()