Lines Matching defs:prev
150 struct rb_node *prev = NULL;
157 prev = n;
169 orig_prev = prev;
170 while (prev && offset >= extent_map_end(prev_entry)) {
171 prev = rb_next(prev);
172 prev_entry = rb_entry(prev, struct extent_map, rb_node);
174 *prev_ret = prev;
175 prev = orig_prev;
179 prev_entry = rb_entry(prev, struct extent_map, rb_node);
180 while (prev && offset < prev_entry->start) {
181 prev = rb_prev(prev);
182 prev_entry = rb_entry(prev, struct extent_map, rb_node);
184 *next_ret = prev;
190 static int mergable_maps(struct extent_map *prev, struct extent_map *next)
192 if (test_bit(EXTENT_FLAG_PINNED, &prev->flags))
199 if (test_bit(EXTENT_FLAG_COMPRESSED, &prev->flags))
202 if (test_bit(EXTENT_FLAG_LOGGING, &prev->flags) ||
211 if (!list_empty(&prev->list) || !list_empty(&next->list))
215 prev->block_start != EXTENT_MAP_DELALLOC);
217 if (prev->map_lookup || next->map_lookup)
218 ASSERT(test_bit(EXTENT_FLAG_FS_MAPPING, &prev->flags) &&
221 if (extent_map_end(prev) == next->start &&
222 prev->flags == next->flags &&
223 prev->map_lookup == next->map_lookup &&
225 prev->block_start == EXTENT_MAP_HOLE) ||
227 prev->block_start == EXTENT_MAP_INLINE) ||
229 next->block_start == extent_map_block_end(prev)))) {
423 struct rb_node *prev = NULL;
427 rb_node = __tree_search(&tree->map.rb_root, start, &prev, &next);
429 if (prev)
430 rb_node = prev;
526 struct rb_node *prev;
528 prev = rb_prev(&em->rb_node);
529 if (!prev)
531 return container_of(prev, struct extent_map, rb_node);
545 struct extent_map *prev;
555 prev = prev_extent_map(next);
557 prev = existing;
558 next = next_extent_map(prev);
561 start = prev ? extent_map_end(prev) : em->start;