Lines Matching defs:merge
157 /* check to see if two extent_map structs are adjacent and safe to merge */
164 * don't merge compressed extents, we need to know their
189 struct extent_map *merge = NULL;
206 merge = rb_entry(rb, struct extent_map, rb_node);
207 if (rb && mergable_maps(merge, em)) {
208 em->start = merge->start;
209 em->len += merge->len;
210 em->block_len += merge->block_len;
211 em->block_start = merge->block_start;
212 merge->in_tree = 0;
213 rb_erase(&merge->rb_node, &tree->map);
214 free_extent_map(merge);
220 merge = rb_entry(rb, struct extent_map, rb_node);
221 if (rb && mergable_maps(em, merge)) {
222 em->len += merge->len;
223 em->block_len += merge->len;
224 rb_erase(&merge->rb_node, &tree->map);
225 merge->in_tree = 0;
226 free_extent_map(merge);
241 * Insert @em into @tree or perform a simple forward/backward merge with
244 * reference dropped if the merge attempt was successfull.
250 struct extent_map *merge = NULL;
269 merge = rb_entry(rb, struct extent_map, rb_node);
270 if (rb && mergable_maps(merge, em)) {
271 em->start = merge->start;
272 em->len += merge->len;
273 em->block_len += merge->block_len;
274 em->block_start = merge->block_start;
275 merge->in_tree = 0;
276 rb_erase(&merge->rb_node, &tree->map);
277 free_extent_map(merge);
282 merge = rb_entry(rb, struct extent_map, rb_node);
283 if (rb && mergable_maps(em, merge)) {
284 em->len += merge->len;
285 em->block_len += merge->len;
286 rb_erase(&merge->rb_node, &tree->map);
287 merge->in_tree = 0;
288 free_extent_map(merge);