Lines Matching full:existing
378 * existing mappings. The extent_map struct passed in will be inserted
518 * Helper for btrfs_get_extent. Given an existing extent in the tree,
519 * the existing extent is the nearest extent to map_start,
524 struct extent_map *existing, in merge_extent_mapping() argument
536 if (existing->start > map_start) { in merge_extent_mapping()
537 next = existing; in merge_extent_mapping()
540 prev = existing; in merge_extent_mapping()
573 * a) Returning the existing extent in @em_in if @start is within the
574 * existing em.
575 * b) Merge the existing extent with @em_in passed in.
600 struct extent_map *existing; in btrfs_add_extent_mapping() local
602 existing = search_extent_mapping(em_tree, start, len); in btrfs_add_extent_mapping()
604 trace_btrfs_handle_em_exist(fs_info, existing, em, start, len); in btrfs_add_extent_mapping()
607 * existing will always be non-NULL, since there must be in btrfs_add_extent_mapping()
610 if (start >= existing->start && in btrfs_add_extent_mapping()
611 start < extent_map_end(existing)) { in btrfs_add_extent_mapping()
613 *em_in = existing; in btrfs_add_extent_mapping()
620 * The existing extent map is the one nearest to in btrfs_add_extent_mapping()
623 ret = merge_extent_mapping(em_tree, existing, in btrfs_add_extent_mapping()
629 "unexpected error %d: merge existing(start %llu len %llu) with em(start %llu len %llu)\n", in btrfs_add_extent_mapping()
630 ret, existing->start, existing->len, in btrfs_add_extent_mapping()
633 free_extent_map(existing); in btrfs_add_extent_mapping()