Lines Matching refs:em
48 struct extent_map *em;
49 em = kmem_cache_zalloc(extent_map_cache, GFP_NOFS);
50 if (!em)
52 RB_CLEAR_NODE(&em->rb_node);
53 em->compress_type = BTRFS_COMPRESS_NONE;
54 refcount_set(&em->refs, 1);
55 INIT_LIST_HEAD(&em->list);
56 return em;
60 * Drop the reference out on @em by one and free the structure if the reference
63 void free_extent_map(struct extent_map *em)
65 if (!em)
67 if (refcount_dec_and_test(&em->refs)) {
68 WARN_ON(extent_map_in_tree(em));
69 WARN_ON(!list_empty(&em->list));
70 if (test_bit(EXTENT_FLAG_FS_MAPPING, &em->flags))
71 kfree(em->map_lookup);
72 kmem_cache_free(extent_map_cache, em);
84 static int tree_insert(struct rb_root_cached *root, struct extent_map *em)
90 u64 end = range_end(em->start, em->len);
97 if (em->start < entry->start) {
99 } else if (em->start >= extent_map_end(entry)) {
108 while (parent && em->start >= extent_map_end(entry)) {
113 if (end > entry->start && em->start < extent_map_end(entry))
118 while (parent && em->start < entry->start) {
123 if (end > entry->start && em->start < extent_map_end(entry))
126 rb_link_node(&em->rb_node, orig_parent, p);
127 rb_insert_color_cached(&em->rb_node, root, leftmost);
231 static void try_merge_map(struct extent_map_tree *tree, struct extent_map *em)
244 if (refcount_read(&em->refs) > 2)
247 if (em->start != 0) {
248 rb = rb_prev(&em->rb_node);
251 if (rb && mergable_maps(merge, em)) {
252 em->start = merge->start;
253 em->orig_start = merge->orig_start;
254 em->len += merge->len;
255 em->block_len += merge->block_len;
256 em->block_start = merge->block_start;
257 em->mod_len = (em->mod_len + em->mod_start) - merge->mod_start;
258 em->mod_start = merge->mod_start;
259 em->generation = max(em->generation, merge->generation);
260 set_bit(EXTENT_FLAG_MERGED, &em->flags);
268 rb = rb_next(&em->rb_node);
271 if (rb && mergable_maps(em, merge)) {
272 em->len += merge->len;
273 em->block_len += merge->block_len;
276 em->mod_len = (merge->mod_start + merge->mod_len) - em->mod_start;
277 em->generation = max(em->generation, merge->generation);
278 set_bit(EXTENT_FLAG_MERGED, &em->flags);
299 struct extent_map *em;
303 em = lookup_extent_mapping(tree, start, len);
305 WARN_ON(!em || em->start != start);
307 if (!em)
310 em->generation = gen;
311 clear_bit(EXTENT_FLAG_PINNED, &em->flags);
312 em->mod_start = em->start;
313 em->mod_len = em->len;
315 if (test_bit(EXTENT_FLAG_FILLING, &em->flags)) {
317 clear_bit(EXTENT_FLAG_FILLING, &em->flags);
320 try_merge_map(tree, em);
323 em->mod_start = em->start;
324 em->mod_len = em->len;
327 free_extent_map(em);
334 void clear_em_logging(struct extent_map_tree *tree, struct extent_map *em)
338 clear_bit(EXTENT_FLAG_LOGGING, &em->flags);
339 if (extent_map_in_tree(em))
340 try_merge_map(tree, em);
344 struct extent_map *em,
347 refcount_inc(&em->refs);
348 em->mod_start = em->start;
349 em->mod_len = em->len;
352 list_move(&em->list, &tree->modified_extents);
354 try_merge_map(tree, em);
357 static void extent_map_device_set_bits(struct extent_map *em, unsigned bits)
359 struct map_lookup *map = em->map_lookup;
360 u64 stripe_size = em->orig_block_len;
373 static void extent_map_device_clear_bits(struct extent_map *em, unsigned bits)
375 struct map_lookup *map = em->map_lookup;
376 u64 stripe_size = em->orig_block_len;
394 * @em: map to insert
395 * @modified: indicate whether the given @em should be added to the
398 * Insert @em into @tree or perform a simple forward/backward merge with
404 struct extent_map *em, int modified)
410 ret = tree_insert(&tree->map, em);
414 setup_extent_mapping(tree, em, modified);
415 if (test_bit(EXTENT_FLAG_FS_MAPPING, &em->flags)) {
416 extent_map_device_set_bits(em, CHUNK_ALLOCATED);
417 extent_map_device_clear_bits(em, CHUNK_TRIMMED);
427 struct extent_map *em;
440 em = rb_entry(rb_node, struct extent_map, rb_node);
442 if (strict && !(end > em->start && start < extent_map_end(em)))
445 refcount_inc(&em->refs);
446 return em;
489 * @em: extent map being removed
491 * Remove @em from @tree. No reference counts are dropped, and no checks
494 void remove_extent_mapping(struct extent_map_tree *tree, struct extent_map *em)
498 WARN_ON(test_bit(EXTENT_FLAG_PINNED, &em->flags));
499 rb_erase_cached(&em->rb_node, &tree->map);
500 if (!test_bit(EXTENT_FLAG_LOGGING, &em->flags))
501 list_del_init(&em->list);
502 if (test_bit(EXTENT_FLAG_FS_MAPPING, &em->flags))
503 extent_map_device_clear_bits(em, CHUNK_ALLOCATED);
504 RB_CLEAR_NODE(&em->rb_node);
524 static struct extent_map *next_extent_map(const struct extent_map *em)
528 next = rb_next(&em->rb_node);
534 static struct extent_map *prev_extent_map(struct extent_map *em)
538 prev = rb_prev(&em->rb_node);
552 struct extent_map *em,
561 BUG_ON(map_start < em->start || map_start >= extent_map_end(em));
571 start = prev ? extent_map_end(prev) : em->start;
572 start = max_t(u64, start, em->start);
573 end = next ? next->start : extent_map_end(em);
574 end = min_t(u64, end, extent_map_end(em));
575 start_diff = start - em->start;
576 em->start = start;
577 em->len = end - start;
578 if (em->block_start < EXTENT_MAP_LAST_BYTE &&
579 !test_bit(EXTENT_FLAG_COMPRESSED, &em->flags)) {
580 em->block_start += start_diff;
581 em->block_len = em->len;
583 return add_extent_mapping(em_tree, em, 0);
601 * existing em.
612 struct extent_map *em = *em_in;
618 if (em->block_start == EXTENT_MAP_INLINE)
619 ASSERT(em->start == 0);
621 ret = add_extent_mapping(em_tree, em, 0);
633 trace_btrfs_handle_em_exist(fs_info, existing, em, start, len);
641 free_extent_map(em);
645 u64 orig_start = em->start;
646 u64 orig_len = em->len;
653 em, start);
655 free_extent_map(em);
658 "unexpected error %d: merge existing(start %llu len %llu) with em(start %llu len %llu)\n",
679 struct extent_map *em;
683 em = rb_entry(node, struct extent_map, rb_node);
684 clear_bit(EXTENT_FLAG_PINNED, &em->flags);
685 clear_bit(EXTENT_FLAG_LOGGING, &em->flags);
686 remove_extent_mapping(tree, em);
687 free_extent_map(em);
712 struct extent_map *em;
740 em = lookup_extent_mapping(em_tree, start, len);
742 while (em) {
744 const u64 em_end = extent_map_end(em);
752 next_em = next_extent_map(em);
761 if (skip_pinned && test_bit(EXTENT_FLAG_PINNED, &em->flags)) {
766 flags = em->flags;
767 clear_bit(EXTENT_FLAG_PINNED, &em->flags);
774 modified = !list_empty(&em->list);
780 if (em->start >= start && em_end <= end)
783 gen = em->generation;
784 compressed = test_bit(EXTENT_FLAG_COMPRESSED, &em->flags);
786 if (em->start < start) {
793 split->start = em->start;
794 split->len = start - em->start;
796 if (em->block_start < EXTENT_MAP_LAST_BYTE) {
797 split->orig_start = em->orig_start;
798 split->block_start = em->block_start;
801 split->block_len = em->block_len;
805 em->orig_block_len);
806 split->ram_bytes = em->ram_bytes;
810 split->block_start = em->block_start;
817 split->compress_type = em->compress_type;
818 replace_extent_mapping(em_tree, em, split, modified);
832 split->block_start = em->block_start;
834 split->compress_type = em->compress_type;
837 if (em->block_start < EXTENT_MAP_LAST_BYTE) {
838 split->orig_block_len = max(em->block_len,
839 em->orig_block_len);
841 split->ram_bytes = em->ram_bytes;
843 split->block_len = em->block_len;
844 split->orig_start = em->orig_start;
846 const u64 diff = start + len - em->start;
850 split->orig_start = em->orig_start;
859 if (extent_map_in_tree(em)) {
860 replace_extent_mapping(em_tree, em, split,
876 if (extent_map_in_tree(em)) {
897 if ((em->start < start || em_end > end) && modified) {
901 remove_extent_mapping(em_tree, em);
908 free_extent_map(em);
911 free_extent_map(em);
913 em = next_em;
973 struct extent_map *em;
993 em = lookup_extent_mapping(em_tree, start, len);
994 if (!em) {
999 ASSERT(em->len == len);
1000 ASSERT(!test_bit(EXTENT_FLAG_COMPRESSED, &em->flags));
1001 ASSERT(em->block_start < EXTENT_MAP_LAST_BYTE);
1002 ASSERT(test_bit(EXTENT_FLAG_PINNED, &em->flags));
1003 ASSERT(!test_bit(EXTENT_FLAG_LOGGING, &em->flags));
1004 ASSERT(!list_empty(&em->list));
1006 flags = em->flags;
1007 clear_bit(EXTENT_FLAG_PINNED, &em->flags);
1009 /* First, replace the em with a new extent_map starting from * em->start */
1010 split_pre->start = em->start;
1018 split_pre->compress_type = em->compress_type;
1019 split_pre->generation = em->generation;
1021 replace_extent_mapping(em_tree, em, split_pre, 1);
1025 * [em->start, em->start + pre]
1029 split_mid->start = em->start + pre;
1030 split_mid->len = em->len - pre;
1032 split_mid->block_start = em->block_start + pre;
1037 split_mid->compress_type = em->compress_type;
1038 split_mid->generation = em->generation;
1042 free_extent_map(em);
1044 free_extent_map(em);