diff options
Diffstat (limited to 'fs/ext4/extents.c')
-rw-r--r-- | fs/ext4/extents.c | 1410 |
1 files changed, 864 insertions, 546 deletions
diff --git a/fs/ext4/extents.c b/fs/ext4/extents.c index 4890d6f3ad15..5199bac7fc62 100644 --- a/fs/ext4/extents.c +++ b/fs/ext4/extents.c | |||
@@ -46,6 +46,13 @@ | |||
46 | 46 | ||
47 | #include <trace/events/ext4.h> | 47 | #include <trace/events/ext4.h> |
48 | 48 | ||
49 | static int ext4_split_extent(handle_t *handle, | ||
50 | struct inode *inode, | ||
51 | struct ext4_ext_path *path, | ||
52 | struct ext4_map_blocks *map, | ||
53 | int split_flag, | ||
54 | int flags); | ||
55 | |||
49 | static int ext4_ext_truncate_extend_restart(handle_t *handle, | 56 | static int ext4_ext_truncate_extend_restart(handle_t *handle, |
50 | struct inode *inode, | 57 | struct inode *inode, |
51 | int needed) | 58 | int needed) |
@@ -192,12 +199,13 @@ static ext4_fsblk_t ext4_ext_find_goal(struct inode *inode, | |||
192 | static ext4_fsblk_t | 199 | static ext4_fsblk_t |
193 | ext4_ext_new_meta_block(handle_t *handle, struct inode *inode, | 200 | ext4_ext_new_meta_block(handle_t *handle, struct inode *inode, |
194 | struct ext4_ext_path *path, | 201 | struct ext4_ext_path *path, |
195 | struct ext4_extent *ex, int *err) | 202 | struct ext4_extent *ex, int *err, unsigned int flags) |
196 | { | 203 | { |
197 | ext4_fsblk_t goal, newblock; | 204 | ext4_fsblk_t goal, newblock; |
198 | 205 | ||
199 | goal = ext4_ext_find_goal(inode, path, le32_to_cpu(ex->ee_block)); | 206 | goal = ext4_ext_find_goal(inode, path, le32_to_cpu(ex->ee_block)); |
200 | newblock = ext4_new_meta_blocks(handle, inode, goal, NULL, err); | 207 | newblock = ext4_new_meta_blocks(handle, inode, goal, flags, |
208 | NULL, err); | ||
201 | return newblock; | 209 | return newblock; |
202 | } | 210 | } |
203 | 211 | ||
@@ -474,9 +482,43 @@ static void ext4_ext_show_leaf(struct inode *inode, struct ext4_ext_path *path) | |||
474 | } | 482 | } |
475 | ext_debug("\n"); | 483 | ext_debug("\n"); |
476 | } | 484 | } |
485 | |||
486 | static void ext4_ext_show_move(struct inode *inode, struct ext4_ext_path *path, | ||
487 | ext4_fsblk_t newblock, int level) | ||
488 | { | ||
489 | int depth = ext_depth(inode); | ||
490 | struct ext4_extent *ex; | ||
491 | |||
492 | if (depth != level) { | ||
493 | struct ext4_extent_idx *idx; | ||
494 | idx = path[level].p_idx; | ||
495 | while (idx <= EXT_MAX_INDEX(path[level].p_hdr)) { | ||
496 | ext_debug("%d: move %d:%llu in new index %llu\n", level, | ||
497 | le32_to_cpu(idx->ei_block), | ||
498 | ext4_idx_pblock(idx), | ||
499 | newblock); | ||
500 | idx++; | ||
501 | } | ||
502 | |||
503 | return; | ||
504 | } | ||
505 | |||
506 | ex = path[depth].p_ext; | ||
507 | while (ex <= EXT_MAX_EXTENT(path[depth].p_hdr)) { | ||
508 | ext_debug("move %d:%llu:[%d]%d in new leaf %llu\n", | ||
509 | le32_to_cpu(ex->ee_block), | ||
510 | ext4_ext_pblock(ex), | ||
511 | ext4_ext_is_uninitialized(ex), | ||
512 | ext4_ext_get_actual_len(ex), | ||
513 | newblock); | ||
514 | ex++; | ||
515 | } | ||
516 | } | ||
517 | |||
477 | #else | 518 | #else |
478 | #define ext4_ext_show_path(inode, path) | 519 | #define ext4_ext_show_path(inode, path) |
479 | #define ext4_ext_show_leaf(inode, path) | 520 | #define ext4_ext_show_leaf(inode, path) |
521 | #define ext4_ext_show_move(inode, path, newblock, level) | ||
480 | #endif | 522 | #endif |
481 | 523 | ||
482 | void ext4_ext_drop_refs(struct ext4_ext_path *path) | 524 | void ext4_ext_drop_refs(struct ext4_ext_path *path) |
@@ -792,14 +834,14 @@ static int ext4_ext_insert_index(handle_t *handle, struct inode *inode, | |||
792 | * - initializes subtree | 834 | * - initializes subtree |
793 | */ | 835 | */ |
794 | static int ext4_ext_split(handle_t *handle, struct inode *inode, | 836 | static int ext4_ext_split(handle_t *handle, struct inode *inode, |
795 | struct ext4_ext_path *path, | 837 | unsigned int flags, |
796 | struct ext4_extent *newext, int at) | 838 | struct ext4_ext_path *path, |
839 | struct ext4_extent *newext, int at) | ||
797 | { | 840 | { |
798 | struct buffer_head *bh = NULL; | 841 | struct buffer_head *bh = NULL; |
799 | int depth = ext_depth(inode); | 842 | int depth = ext_depth(inode); |
800 | struct ext4_extent_header *neh; | 843 | struct ext4_extent_header *neh; |
801 | struct ext4_extent_idx *fidx; | 844 | struct ext4_extent_idx *fidx; |
802 | struct ext4_extent *ex; | ||
803 | int i = at, k, m, a; | 845 | int i = at, k, m, a; |
804 | ext4_fsblk_t newblock, oldblock; | 846 | ext4_fsblk_t newblock, oldblock; |
805 | __le32 border; | 847 | __le32 border; |
@@ -847,7 +889,7 @@ static int ext4_ext_split(handle_t *handle, struct inode *inode, | |||
847 | ext_debug("allocate %d blocks for indexes/leaf\n", depth - at); | 889 | ext_debug("allocate %d blocks for indexes/leaf\n", depth - at); |
848 | for (a = 0; a < depth - at; a++) { | 890 | for (a = 0; a < depth - at; a++) { |
849 | newblock = ext4_ext_new_meta_block(handle, inode, path, | 891 | newblock = ext4_ext_new_meta_block(handle, inode, path, |
850 | newext, &err); | 892 | newext, &err, flags); |
851 | if (newblock == 0) | 893 | if (newblock == 0) |
852 | goto cleanup; | 894 | goto cleanup; |
853 | ablocks[a] = newblock; | 895 | ablocks[a] = newblock; |
@@ -876,7 +918,6 @@ static int ext4_ext_split(handle_t *handle, struct inode *inode, | |||
876 | neh->eh_max = cpu_to_le16(ext4_ext_space_block(inode, 0)); | 918 | neh->eh_max = cpu_to_le16(ext4_ext_space_block(inode, 0)); |
877 | neh->eh_magic = EXT4_EXT_MAGIC; | 919 | neh->eh_magic = EXT4_EXT_MAGIC; |
878 | neh->eh_depth = 0; | 920 | neh->eh_depth = 0; |
879 | ex = EXT_FIRST_EXTENT(neh); | ||
880 | 921 | ||
881 | /* move remainder of path[depth] to the new leaf */ | 922 | /* move remainder of path[depth] to the new leaf */ |
882 | if (unlikely(path[depth].p_hdr->eh_entries != | 923 | if (unlikely(path[depth].p_hdr->eh_entries != |
@@ -888,25 +929,12 @@ static int ext4_ext_split(handle_t *handle, struct inode *inode, | |||
888 | goto cleanup; | 929 | goto cleanup; |
889 | } | 930 | } |
890 | /* start copy from next extent */ | 931 | /* start copy from next extent */ |
891 | /* TODO: we could do it by single memmove */ | 932 | m = EXT_MAX_EXTENT(path[depth].p_hdr) - path[depth].p_ext++; |
892 | m = 0; | 933 | ext4_ext_show_move(inode, path, newblock, depth); |
893 | path[depth].p_ext++; | ||
894 | while (path[depth].p_ext <= | ||
895 | EXT_MAX_EXTENT(path[depth].p_hdr)) { | ||
896 | ext_debug("move %d:%llu:[%d]%d in new leaf %llu\n", | ||
897 | le32_to_cpu(path[depth].p_ext->ee_block), | ||
898 | ext4_ext_pblock(path[depth].p_ext), | ||
899 | ext4_ext_is_uninitialized(path[depth].p_ext), | ||
900 | ext4_ext_get_actual_len(path[depth].p_ext), | ||
901 | newblock); | ||
902 | /*memmove(ex++, path[depth].p_ext++, | ||
903 | sizeof(struct ext4_extent)); | ||
904 | neh->eh_entries++;*/ | ||
905 | path[depth].p_ext++; | ||
906 | m++; | ||
907 | } | ||
908 | if (m) { | 934 | if (m) { |
909 | memmove(ex, path[depth].p_ext-m, sizeof(struct ext4_extent)*m); | 935 | struct ext4_extent *ex; |
936 | ex = EXT_FIRST_EXTENT(neh); | ||
937 | memmove(ex, path[depth].p_ext, sizeof(struct ext4_extent) * m); | ||
910 | le16_add_cpu(&neh->eh_entries, m); | 938 | le16_add_cpu(&neh->eh_entries, m); |
911 | } | 939 | } |
912 | 940 | ||
@@ -968,12 +996,8 @@ static int ext4_ext_split(handle_t *handle, struct inode *inode, | |||
968 | 996 | ||
969 | ext_debug("int.index at %d (block %llu): %u -> %llu\n", | 997 | ext_debug("int.index at %d (block %llu): %u -> %llu\n", |
970 | i, newblock, le32_to_cpu(border), oldblock); | 998 | i, newblock, le32_to_cpu(border), oldblock); |
971 | /* copy indexes */ | ||
972 | m = 0; | ||
973 | path[i].p_idx++; | ||
974 | 999 | ||
975 | ext_debug("cur 0x%p, last 0x%p\n", path[i].p_idx, | 1000 | /* move remainder of path[i] to the new index block */ |
976 | EXT_MAX_INDEX(path[i].p_hdr)); | ||
977 | if (unlikely(EXT_MAX_INDEX(path[i].p_hdr) != | 1001 | if (unlikely(EXT_MAX_INDEX(path[i].p_hdr) != |
978 | EXT_LAST_INDEX(path[i].p_hdr))) { | 1002 | EXT_LAST_INDEX(path[i].p_hdr))) { |
979 | EXT4_ERROR_INODE(inode, | 1003 | EXT4_ERROR_INODE(inode, |
@@ -982,20 +1006,13 @@ static int ext4_ext_split(handle_t *handle, struct inode *inode, | |||
982 | err = -EIO; | 1006 | err = -EIO; |
983 | goto cleanup; | 1007 | goto cleanup; |
984 | } | 1008 | } |
985 | while (path[i].p_idx <= EXT_MAX_INDEX(path[i].p_hdr)) { | 1009 | /* start copy indexes */ |
986 | ext_debug("%d: move %d:%llu in new index %llu\n", i, | 1010 | m = EXT_MAX_INDEX(path[i].p_hdr) - path[i].p_idx++; |
987 | le32_to_cpu(path[i].p_idx->ei_block), | 1011 | ext_debug("cur 0x%p, last 0x%p\n", path[i].p_idx, |
988 | ext4_idx_pblock(path[i].p_idx), | 1012 | EXT_MAX_INDEX(path[i].p_hdr)); |
989 | newblock); | 1013 | ext4_ext_show_move(inode, path, newblock, i); |
990 | /*memmove(++fidx, path[i].p_idx++, | ||
991 | sizeof(struct ext4_extent_idx)); | ||
992 | neh->eh_entries++; | ||
993 | BUG_ON(neh->eh_entries > neh->eh_max);*/ | ||
994 | path[i].p_idx++; | ||
995 | m++; | ||
996 | } | ||
997 | if (m) { | 1014 | if (m) { |
998 | memmove(++fidx, path[i].p_idx - m, | 1015 | memmove(++fidx, path[i].p_idx, |
999 | sizeof(struct ext4_extent_idx) * m); | 1016 | sizeof(struct ext4_extent_idx) * m); |
1000 | le16_add_cpu(&neh->eh_entries, m); | 1017 | le16_add_cpu(&neh->eh_entries, m); |
1001 | } | 1018 | } |
@@ -1056,8 +1073,9 @@ cleanup: | |||
1056 | * just created block | 1073 | * just created block |
1057 | */ | 1074 | */ |
1058 | static int ext4_ext_grow_indepth(handle_t *handle, struct inode *inode, | 1075 | static int ext4_ext_grow_indepth(handle_t *handle, struct inode *inode, |
1059 | struct ext4_ext_path *path, | 1076 | unsigned int flags, |
1060 | struct ext4_extent *newext) | 1077 | struct ext4_ext_path *path, |
1078 | struct ext4_extent *newext) | ||
1061 | { | 1079 | { |
1062 | struct ext4_ext_path *curp = path; | 1080 | struct ext4_ext_path *curp = path; |
1063 | struct ext4_extent_header *neh; | 1081 | struct ext4_extent_header *neh; |
@@ -1065,7 +1083,8 @@ static int ext4_ext_grow_indepth(handle_t *handle, struct inode *inode, | |||
1065 | ext4_fsblk_t newblock; | 1083 | ext4_fsblk_t newblock; |
1066 | int err = 0; | 1084 | int err = 0; |
1067 | 1085 | ||
1068 | newblock = ext4_ext_new_meta_block(handle, inode, path, newext, &err); | 1086 | newblock = ext4_ext_new_meta_block(handle, inode, path, |
1087 | newext, &err, flags); | ||
1069 | if (newblock == 0) | 1088 | if (newblock == 0) |
1070 | return err; | 1089 | return err; |
1071 | 1090 | ||
@@ -1140,8 +1159,9 @@ out: | |||
1140 | * if no free index is found, then it requests in-depth growing. | 1159 | * if no free index is found, then it requests in-depth growing. |
1141 | */ | 1160 | */ |
1142 | static int ext4_ext_create_new_leaf(handle_t *handle, struct inode *inode, | 1161 | static int ext4_ext_create_new_leaf(handle_t *handle, struct inode *inode, |
1143 | struct ext4_ext_path *path, | 1162 | unsigned int flags, |
1144 | struct ext4_extent *newext) | 1163 | struct ext4_ext_path *path, |
1164 | struct ext4_extent *newext) | ||
1145 | { | 1165 | { |
1146 | struct ext4_ext_path *curp; | 1166 | struct ext4_ext_path *curp; |
1147 | int depth, i, err = 0; | 1167 | int depth, i, err = 0; |
@@ -1161,7 +1181,7 @@ repeat: | |||
1161 | if (EXT_HAS_FREE_INDEX(curp)) { | 1181 | if (EXT_HAS_FREE_INDEX(curp)) { |
1162 | /* if we found index with free entry, then use that | 1182 | /* if we found index with free entry, then use that |
1163 | * entry: create all needed subtree and add new leaf */ | 1183 | * entry: create all needed subtree and add new leaf */ |
1164 | err = ext4_ext_split(handle, inode, path, newext, i); | 1184 | err = ext4_ext_split(handle, inode, flags, path, newext, i); |
1165 | if (err) | 1185 | if (err) |
1166 | goto out; | 1186 | goto out; |
1167 | 1187 | ||
@@ -1174,7 +1194,8 @@ repeat: | |||
1174 | err = PTR_ERR(path); | 1194 | err = PTR_ERR(path); |
1175 | } else { | 1195 | } else { |
1176 | /* tree is full, time to grow in depth */ | 1196 | /* tree is full, time to grow in depth */ |
1177 | err = ext4_ext_grow_indepth(handle, inode, path, newext); | 1197 | err = ext4_ext_grow_indepth(handle, inode, flags, |
1198 | path, newext); | ||
1178 | if (err) | 1199 | if (err) |
1179 | goto out; | 1200 | goto out; |
1180 | 1201 | ||
@@ -1563,7 +1584,7 @@ ext4_can_extents_be_merged(struct inode *inode, struct ext4_extent *ex1, | |||
1563 | * Returns 0 if the extents (ex and ex+1) were _not_ merged and returns | 1584 | * Returns 0 if the extents (ex and ex+1) were _not_ merged and returns |
1564 | * 1 if they got merged. | 1585 | * 1 if they got merged. |
1565 | */ | 1586 | */ |
1566 | static int ext4_ext_try_to_merge(struct inode *inode, | 1587 | static int ext4_ext_try_to_merge_right(struct inode *inode, |
1567 | struct ext4_ext_path *path, | 1588 | struct ext4_ext_path *path, |
1568 | struct ext4_extent *ex) | 1589 | struct ext4_extent *ex) |
1569 | { | 1590 | { |
@@ -1603,6 +1624,31 @@ static int ext4_ext_try_to_merge(struct inode *inode, | |||
1603 | } | 1624 | } |
1604 | 1625 | ||
1605 | /* | 1626 | /* |
1627 | * This function tries to merge the @ex extent to neighbours in the tree. | ||
1628 | * return 1 if merge left else 0. | ||
1629 | */ | ||
1630 | static int ext4_ext_try_to_merge(struct inode *inode, | ||
1631 | struct ext4_ext_path *path, | ||
1632 | struct ext4_extent *ex) { | ||
1633 | struct ext4_extent_header *eh; | ||
1634 | unsigned int depth; | ||
1635 | int merge_done = 0; | ||
1636 | int ret = 0; | ||
1637 | |||
1638 | depth = ext_depth(inode); | ||
1639 | BUG_ON(path[depth].p_hdr == NULL); | ||
1640 | eh = path[depth].p_hdr; | ||
1641 | |||
1642 | if (ex > EXT_FIRST_EXTENT(eh)) | ||
1643 | merge_done = ext4_ext_try_to_merge_right(inode, path, ex - 1); | ||
1644 | |||
1645 | if (!merge_done) | ||
1646 | ret = ext4_ext_try_to_merge_right(inode, path, ex); | ||
1647 | |||
1648 | return ret; | ||
1649 | } | ||
1650 | |||
1651 | /* | ||
1606 | * check if a portion of the "newext" extent overlaps with an | 1652 | * check if a portion of the "newext" extent overlaps with an |
1607 | * existing extent. | 1653 | * existing extent. |
1608 | * | 1654 | * |
@@ -1668,6 +1714,7 @@ int ext4_ext_insert_extent(handle_t *handle, struct inode *inode, | |||
1668 | int depth, len, err; | 1714 | int depth, len, err; |
1669 | ext4_lblk_t next; | 1715 | ext4_lblk_t next; |
1670 | unsigned uninitialized = 0; | 1716 | unsigned uninitialized = 0; |
1717 | int flags = 0; | ||
1671 | 1718 | ||
1672 | if (unlikely(ext4_ext_get_actual_len(newext) == 0)) { | 1719 | if (unlikely(ext4_ext_get_actual_len(newext) == 0)) { |
1673 | EXT4_ERROR_INODE(inode, "ext4_ext_get_actual_len(newext) == 0"); | 1720 | EXT4_ERROR_INODE(inode, "ext4_ext_get_actual_len(newext) == 0"); |
@@ -1742,7 +1789,9 @@ repeat: | |||
1742 | * There is no free space in the found leaf. | 1789 | * There is no free space in the found leaf. |
1743 | * We're gonna add a new leaf in the tree. | 1790 | * We're gonna add a new leaf in the tree. |
1744 | */ | 1791 | */ |
1745 | err = ext4_ext_create_new_leaf(handle, inode, path, newext); | 1792 | if (flag & EXT4_GET_BLOCKS_PUNCH_OUT_EXT) |
1793 | flags = EXT4_MB_USE_ROOT_BLOCKS; | ||
1794 | err = ext4_ext_create_new_leaf(handle, inode, flags, path, newext); | ||
1746 | if (err) | 1795 | if (err) |
1747 | goto cleanup; | 1796 | goto cleanup; |
1748 | depth = ext_depth(inode); | 1797 | depth = ext_depth(inode); |
@@ -2003,13 +2052,25 @@ ext4_ext_put_gap_in_cache(struct inode *inode, struct ext4_ext_path *path, | |||
2003 | } | 2052 | } |
2004 | 2053 | ||
2005 | /* | 2054 | /* |
2055 | * ext4_ext_in_cache() | ||
2056 | * Checks to see if the given block is in the cache. | ||
2057 | * If it is, the cached extent is stored in the given | ||
2058 | * cache extent pointer. If the cached extent is a hole, | ||
2059 | * this routine should be used instead of | ||
2060 | * ext4_ext_in_cache if the calling function needs to | ||
2061 | * know the size of the hole. | ||
2062 | * | ||
2063 | * @inode: The files inode | ||
2064 | * @block: The block to look for in the cache | ||
2065 | * @ex: Pointer where the cached extent will be stored | ||
2066 | * if it contains block | ||
2067 | * | ||
2006 | * Return 0 if cache is invalid; 1 if the cache is valid | 2068 | * Return 0 if cache is invalid; 1 if the cache is valid |
2007 | */ | 2069 | */ |
2008 | static int | 2070 | static int ext4_ext_check_cache(struct inode *inode, ext4_lblk_t block, |
2009 | ext4_ext_in_cache(struct inode *inode, ext4_lblk_t block, | 2071 | struct ext4_ext_cache *ex){ |
2010 | struct ext4_extent *ex) | ||
2011 | { | ||
2012 | struct ext4_ext_cache *cex; | 2072 | struct ext4_ext_cache *cex; |
2073 | struct ext4_sb_info *sbi; | ||
2013 | int ret = 0; | 2074 | int ret = 0; |
2014 | 2075 | ||
2015 | /* | 2076 | /* |
@@ -2017,26 +2078,60 @@ ext4_ext_in_cache(struct inode *inode, ext4_lblk_t block, | |||
2017 | */ | 2078 | */ |
2018 | spin_lock(&EXT4_I(inode)->i_block_reservation_lock); | 2079 | spin_lock(&EXT4_I(inode)->i_block_reservation_lock); |
2019 | cex = &EXT4_I(inode)->i_cached_extent; | 2080 | cex = &EXT4_I(inode)->i_cached_extent; |
2081 | sbi = EXT4_SB(inode->i_sb); | ||
2020 | 2082 | ||
2021 | /* has cache valid data? */ | 2083 | /* has cache valid data? */ |
2022 | if (cex->ec_len == 0) | 2084 | if (cex->ec_len == 0) |
2023 | goto errout; | 2085 | goto errout; |
2024 | 2086 | ||
2025 | if (in_range(block, cex->ec_block, cex->ec_len)) { | 2087 | if (in_range(block, cex->ec_block, cex->ec_len)) { |
2026 | ex->ee_block = cpu_to_le32(cex->ec_block); | 2088 | memcpy(ex, cex, sizeof(struct ext4_ext_cache)); |
2027 | ext4_ext_store_pblock(ex, cex->ec_start); | ||
2028 | ex->ee_len = cpu_to_le16(cex->ec_len); | ||
2029 | ext_debug("%u cached by %u:%u:%llu\n", | 2089 | ext_debug("%u cached by %u:%u:%llu\n", |
2030 | block, | 2090 | block, |
2031 | cex->ec_block, cex->ec_len, cex->ec_start); | 2091 | cex->ec_block, cex->ec_len, cex->ec_start); |
2032 | ret = 1; | 2092 | ret = 1; |
2033 | } | 2093 | } |
2034 | errout: | 2094 | errout: |
2095 | if (!ret) | ||
2096 | sbi->extent_cache_misses++; | ||
2097 | else | ||
2098 | sbi->extent_cache_hits++; | ||
2035 | spin_unlock(&EXT4_I(inode)->i_block_reservation_lock); | 2099 | spin_unlock(&EXT4_I(inode)->i_block_reservation_lock); |
2036 | return ret; | 2100 | return ret; |
2037 | } | 2101 | } |
2038 | 2102 | ||
2039 | /* | 2103 | /* |
2104 | * ext4_ext_in_cache() | ||
2105 | * Checks to see if the given block is in the cache. | ||
2106 | * If it is, the cached extent is stored in the given | ||
2107 | * extent pointer. | ||
2108 | * | ||
2109 | * @inode: The files inode | ||
2110 | * @block: The block to look for in the cache | ||
2111 | * @ex: Pointer where the cached extent will be stored | ||
2112 | * if it contains block | ||
2113 | * | ||
2114 | * Return 0 if cache is invalid; 1 if the cache is valid | ||
2115 | */ | ||
2116 | static int | ||
2117 | ext4_ext_in_cache(struct inode *inode, ext4_lblk_t block, | ||
2118 | struct ext4_extent *ex) | ||
2119 | { | ||
2120 | struct ext4_ext_cache cex; | ||
2121 | int ret = 0; | ||
2122 | |||
2123 | if (ext4_ext_check_cache(inode, block, &cex)) { | ||
2124 | ex->ee_block = cpu_to_le32(cex.ec_block); | ||
2125 | ext4_ext_store_pblock(ex, cex.ec_start); | ||
2126 | ex->ee_len = cpu_to_le16(cex.ec_len); | ||
2127 | ret = 1; | ||
2128 | } | ||
2129 | |||
2130 | return ret; | ||
2131 | } | ||
2132 | |||
2133 | |||
2134 | /* | ||
2040 | * ext4_ext_rm_idx: | 2135 | * ext4_ext_rm_idx: |
2041 | * removes index from the index block. | 2136 | * removes index from the index block. |
2042 | * It's used in truncate case only, thus all requests are for | 2137 | * It's used in truncate case only, thus all requests are for |
@@ -2163,8 +2258,16 @@ static int ext4_remove_blocks(handle_t *handle, struct inode *inode, | |||
2163 | ext4_free_blocks(handle, inode, NULL, start, num, flags); | 2258 | ext4_free_blocks(handle, inode, NULL, start, num, flags); |
2164 | } else if (from == le32_to_cpu(ex->ee_block) | 2259 | } else if (from == le32_to_cpu(ex->ee_block) |
2165 | && to <= le32_to_cpu(ex->ee_block) + ee_len - 1) { | 2260 | && to <= le32_to_cpu(ex->ee_block) + ee_len - 1) { |
2166 | printk(KERN_INFO "strange request: removal %u-%u from %u:%u\n", | 2261 | /* head removal */ |
2167 | from, to, le32_to_cpu(ex->ee_block), ee_len); | 2262 | ext4_lblk_t num; |
2263 | ext4_fsblk_t start; | ||
2264 | |||
2265 | num = to - from; | ||
2266 | start = ext4_ext_pblock(ex); | ||
2267 | |||
2268 | ext_debug("free first %u blocks starting %llu\n", num, start); | ||
2269 | ext4_free_blocks(handle, inode, 0, start, num, flags); | ||
2270 | |||
2168 | } else { | 2271 | } else { |
2169 | printk(KERN_INFO "strange request: removal(2) " | 2272 | printk(KERN_INFO "strange request: removal(2) " |
2170 | "%u-%u from %u:%u\n", | 2273 | "%u-%u from %u:%u\n", |
@@ -2173,9 +2276,22 @@ static int ext4_remove_blocks(handle_t *handle, struct inode *inode, | |||
2173 | return 0; | 2276 | return 0; |
2174 | } | 2277 | } |
2175 | 2278 | ||
2279 | |||
2280 | /* | ||
2281 | * ext4_ext_rm_leaf() Removes the extents associated with the | ||
2282 | * blocks appearing between "start" and "end", and splits the extents | ||
2283 | * if "start" and "end" appear in the same extent | ||
2284 | * | ||
2285 | * @handle: The journal handle | ||
2286 | * @inode: The files inode | ||
2287 | * @path: The path to the leaf | ||
2288 | * @start: The first block to remove | ||
2289 | * @end: The last block to remove | ||
2290 | */ | ||
2176 | static int | 2291 | static int |
2177 | ext4_ext_rm_leaf(handle_t *handle, struct inode *inode, | 2292 | ext4_ext_rm_leaf(handle_t *handle, struct inode *inode, |
2178 | struct ext4_ext_path *path, ext4_lblk_t start) | 2293 | struct ext4_ext_path *path, ext4_lblk_t start, |
2294 | ext4_lblk_t end) | ||
2179 | { | 2295 | { |
2180 | int err = 0, correct_index = 0; | 2296 | int err = 0, correct_index = 0; |
2181 | int depth = ext_depth(inode), credits; | 2297 | int depth = ext_depth(inode), credits; |
@@ -2186,6 +2302,7 @@ ext4_ext_rm_leaf(handle_t *handle, struct inode *inode, | |||
2186 | unsigned short ex_ee_len; | 2302 | unsigned short ex_ee_len; |
2187 | unsigned uninitialized = 0; | 2303 | unsigned uninitialized = 0; |
2188 | struct ext4_extent *ex; | 2304 | struct ext4_extent *ex; |
2305 | struct ext4_map_blocks map; | ||
2189 | 2306 | ||
2190 | /* the header must be checked already in ext4_ext_remove_space() */ | 2307 | /* the header must be checked already in ext4_ext_remove_space() */ |
2191 | ext_debug("truncate since %u in leaf\n", start); | 2308 | ext_debug("truncate since %u in leaf\n", start); |
@@ -2215,31 +2332,95 @@ ext4_ext_rm_leaf(handle_t *handle, struct inode *inode, | |||
2215 | path[depth].p_ext = ex; | 2332 | path[depth].p_ext = ex; |
2216 | 2333 | ||
2217 | a = ex_ee_block > start ? ex_ee_block : start; | 2334 | a = ex_ee_block > start ? ex_ee_block : start; |
2218 | b = ex_ee_block + ex_ee_len - 1 < EXT_MAX_BLOCK ? | 2335 | b = ex_ee_block+ex_ee_len - 1 < end ? |
2219 | ex_ee_block + ex_ee_len - 1 : EXT_MAX_BLOCK; | 2336 | ex_ee_block+ex_ee_len - 1 : end; |
2220 | 2337 | ||
2221 | ext_debug(" border %u:%u\n", a, b); | 2338 | ext_debug(" border %u:%u\n", a, b); |
2222 | 2339 | ||
2223 | if (a != ex_ee_block && b != ex_ee_block + ex_ee_len - 1) { | 2340 | /* If this extent is beyond the end of the hole, skip it */ |
2224 | block = 0; | 2341 | if (end <= ex_ee_block) { |
2225 | num = 0; | 2342 | ex--; |
2226 | BUG(); | 2343 | ex_ee_block = le32_to_cpu(ex->ee_block); |
2344 | ex_ee_len = ext4_ext_get_actual_len(ex); | ||
2345 | continue; | ||
2346 | } else if (a != ex_ee_block && | ||
2347 | b != ex_ee_block + ex_ee_len - 1) { | ||
2348 | /* | ||
2349 | * If this is a truncate, then this condition should | ||
2350 | * never happen because at least one of the end points | ||
2351 | * needs to be on the edge of the extent. | ||
2352 | */ | ||
2353 | if (end == EXT_MAX_BLOCK) { | ||
2354 | ext_debug(" bad truncate %u:%u\n", | ||
2355 | start, end); | ||
2356 | block = 0; | ||
2357 | num = 0; | ||
2358 | err = -EIO; | ||
2359 | goto out; | ||
2360 | } | ||
2361 | /* | ||
2362 | * else this is a hole punch, so the extent needs to | ||
2363 | * be split since neither edge of the hole is on the | ||
2364 | * extent edge | ||
2365 | */ | ||
2366 | else{ | ||
2367 | map.m_pblk = ext4_ext_pblock(ex); | ||
2368 | map.m_lblk = ex_ee_block; | ||
2369 | map.m_len = b - ex_ee_block; | ||
2370 | |||
2371 | err = ext4_split_extent(handle, | ||
2372 | inode, path, &map, 0, | ||
2373 | EXT4_GET_BLOCKS_PUNCH_OUT_EXT | | ||
2374 | EXT4_GET_BLOCKS_PRE_IO); | ||
2375 | |||
2376 | if (err < 0) | ||
2377 | goto out; | ||
2378 | |||
2379 | ex_ee_len = ext4_ext_get_actual_len(ex); | ||
2380 | |||
2381 | b = ex_ee_block+ex_ee_len - 1 < end ? | ||
2382 | ex_ee_block+ex_ee_len - 1 : end; | ||
2383 | |||
2384 | /* Then remove tail of this extent */ | ||
2385 | block = ex_ee_block; | ||
2386 | num = a - block; | ||
2387 | } | ||
2227 | } else if (a != ex_ee_block) { | 2388 | } else if (a != ex_ee_block) { |
2228 | /* remove tail of the extent */ | 2389 | /* remove tail of the extent */ |
2229 | block = ex_ee_block; | 2390 | block = ex_ee_block; |
2230 | num = a - block; | 2391 | num = a - block; |
2231 | } else if (b != ex_ee_block + ex_ee_len - 1) { | 2392 | } else if (b != ex_ee_block + ex_ee_len - 1) { |
2232 | /* remove head of the extent */ | 2393 | /* remove head of the extent */ |
2233 | block = a; | 2394 | block = b; |
2234 | num = b - a; | 2395 | num = ex_ee_block + ex_ee_len - b; |
2235 | /* there is no "make a hole" API yet */ | 2396 | |
2236 | BUG(); | 2397 | /* |
2398 | * If this is a truncate, this condition | ||
2399 | * should never happen | ||
2400 | */ | ||
2401 | if (end == EXT_MAX_BLOCK) { | ||
2402 | ext_debug(" bad truncate %u:%u\n", | ||
2403 | start, end); | ||
2404 | err = -EIO; | ||
2405 | goto out; | ||
2406 | } | ||
2237 | } else { | 2407 | } else { |
2238 | /* remove whole extent: excellent! */ | 2408 | /* remove whole extent: excellent! */ |
2239 | block = ex_ee_block; | 2409 | block = ex_ee_block; |
2240 | num = 0; | 2410 | num = 0; |
2241 | BUG_ON(a != ex_ee_block); | 2411 | if (a != ex_ee_block) { |
2242 | BUG_ON(b != ex_ee_block + ex_ee_len - 1); | 2412 | ext_debug(" bad truncate %u:%u\n", |
2413 | start, end); | ||
2414 | err = -EIO; | ||
2415 | goto out; | ||
2416 | } | ||
2417 | |||
2418 | if (b != ex_ee_block + ex_ee_len - 1) { | ||
2419 | ext_debug(" bad truncate %u:%u\n", | ||
2420 | start, end); | ||
2421 | err = -EIO; | ||
2422 | goto out; | ||
2423 | } | ||
2243 | } | 2424 | } |
2244 | 2425 | ||
2245 | /* | 2426 | /* |
@@ -2270,7 +2451,13 @@ ext4_ext_rm_leaf(handle_t *handle, struct inode *inode, | |||
2270 | if (num == 0) { | 2451 | if (num == 0) { |
2271 | /* this extent is removed; mark slot entirely unused */ | 2452 | /* this extent is removed; mark slot entirely unused */ |
2272 | ext4_ext_store_pblock(ex, 0); | 2453 | ext4_ext_store_pblock(ex, 0); |
2273 | le16_add_cpu(&eh->eh_entries, -1); | 2454 | } else if (block != ex_ee_block) { |
2455 | /* | ||
2456 | * If this was a head removal, then we need to update | ||
2457 | * the physical block since it is now at a different | ||
2458 | * location | ||
2459 | */ | ||
2460 | ext4_ext_store_pblock(ex, ext4_ext_pblock(ex) + (b-a)); | ||
2274 | } | 2461 | } |
2275 | 2462 | ||
2276 | ex->ee_block = cpu_to_le32(block); | 2463 | ex->ee_block = cpu_to_le32(block); |
@@ -2286,6 +2473,27 @@ ext4_ext_rm_leaf(handle_t *handle, struct inode *inode, | |||
2286 | if (err) | 2473 | if (err) |
2287 | goto out; | 2474 | goto out; |
2288 | 2475 | ||
2476 | /* | ||
2477 | * If the extent was completely released, | ||
2478 | * we need to remove it from the leaf | ||
2479 | */ | ||
2480 | if (num == 0) { | ||
2481 | if (end != EXT_MAX_BLOCK) { | ||
2482 | /* | ||
2483 | * For hole punching, we need to scoot all the | ||
2484 | * extents up when an extent is removed so that | ||
2485 | * we dont have blank extents in the middle | ||
2486 | */ | ||
2487 | memmove(ex, ex+1, (EXT_LAST_EXTENT(eh) - ex) * | ||
2488 | sizeof(struct ext4_extent)); | ||
2489 | |||
2490 | /* Now get rid of the one at the end */ | ||
2491 | memset(EXT_LAST_EXTENT(eh), 0, | ||
2492 | sizeof(struct ext4_extent)); | ||
2493 | } | ||
2494 | le16_add_cpu(&eh->eh_entries, -1); | ||
2495 | } | ||
2496 | |||
2289 | ext_debug("new extent: %u:%u:%llu\n", block, num, | 2497 | ext_debug("new extent: %u:%u:%llu\n", block, num, |
2290 | ext4_ext_pblock(ex)); | 2498 | ext4_ext_pblock(ex)); |
2291 | ex--; | 2499 | ex--; |
@@ -2326,7 +2534,8 @@ ext4_ext_more_to_rm(struct ext4_ext_path *path) | |||
2326 | return 1; | 2534 | return 1; |
2327 | } | 2535 | } |
2328 | 2536 | ||
2329 | static int ext4_ext_remove_space(struct inode *inode, ext4_lblk_t start) | 2537 | static int ext4_ext_remove_space(struct inode *inode, ext4_lblk_t start, |
2538 | ext4_lblk_t end) | ||
2330 | { | 2539 | { |
2331 | struct super_block *sb = inode->i_sb; | 2540 | struct super_block *sb = inode->i_sb; |
2332 | int depth = ext_depth(inode); | 2541 | int depth = ext_depth(inode); |
@@ -2365,7 +2574,8 @@ again: | |||
2365 | while (i >= 0 && err == 0) { | 2574 | while (i >= 0 && err == 0) { |
2366 | if (i == depth) { | 2575 | if (i == depth) { |
2367 | /* this is leaf block */ | 2576 | /* this is leaf block */ |
2368 | err = ext4_ext_rm_leaf(handle, inode, path, start); | 2577 | err = ext4_ext_rm_leaf(handle, inode, path, |
2578 | start, end); | ||
2369 | /* root level has p_bh == NULL, brelse() eats this */ | 2579 | /* root level has p_bh == NULL, brelse() eats this */ |
2370 | brelse(path[i].p_bh); | 2580 | brelse(path[i].p_bh); |
2371 | path[i].p_bh = NULL; | 2581 | path[i].p_bh = NULL; |
@@ -2529,6 +2739,195 @@ static int ext4_ext_zeroout(struct inode *inode, struct ext4_extent *ex) | |||
2529 | return ret; | 2739 | return ret; |
2530 | } | 2740 | } |
2531 | 2741 | ||
2742 | /* | ||
2743 | * used by extent splitting. | ||
2744 | */ | ||
2745 | #define EXT4_EXT_MAY_ZEROOUT 0x1 /* safe to zeroout if split fails \ | ||
2746 | due to ENOSPC */ | ||
2747 | #define EXT4_EXT_MARK_UNINIT1 0x2 /* mark first half uninitialized */ | ||
2748 | #define EXT4_EXT_MARK_UNINIT2 0x4 /* mark second half uninitialized */ | ||
2749 | |||
2750 | /* | ||
2751 | * ext4_split_extent_at() splits an extent at given block. | ||
2752 | * | ||
2753 | * @handle: the journal handle | ||
2754 | * @inode: the file inode | ||
2755 | * @path: the path to the extent | ||
2756 | * @split: the logical block where the extent is splitted. | ||
2757 | * @split_flags: indicates if the extent could be zeroout if split fails, and | ||
2758 | * the states(init or uninit) of new extents. | ||
2759 | * @flags: flags used to insert new extent to extent tree. | ||
2760 | * | ||
2761 | * | ||
2762 | * Splits extent [a, b] into two extents [a, @split) and [@split, b], states | ||
2763 | * of which are deterimined by split_flag. | ||
2764 | * | ||
2765 | * There are two cases: | ||
2766 | * a> the extent are splitted into two extent. | ||
2767 | * b> split is not needed, and just mark the extent. | ||
2768 | * | ||
2769 | * return 0 on success. | ||
2770 | */ | ||
2771 | static int ext4_split_extent_at(handle_t *handle, | ||
2772 | struct inode *inode, | ||
2773 | struct ext4_ext_path *path, | ||
2774 | ext4_lblk_t split, | ||
2775 | int split_flag, | ||
2776 | int flags) | ||
2777 | { | ||
2778 | ext4_fsblk_t newblock; | ||
2779 | ext4_lblk_t ee_block; | ||
2780 | struct ext4_extent *ex, newex, orig_ex; | ||
2781 | struct ext4_extent *ex2 = NULL; | ||
2782 | unsigned int ee_len, depth; | ||
2783 | int err = 0; | ||
2784 | |||
2785 | ext_debug("ext4_split_extents_at: inode %lu, logical" | ||
2786 | "block %llu\n", inode->i_ino, (unsigned long long)split); | ||
2787 | |||
2788 | ext4_ext_show_leaf(inode, path); | ||
2789 | |||
2790 | depth = ext_depth(inode); | ||
2791 | ex = path[depth].p_ext; | ||
2792 | ee_block = le32_to_cpu(ex->ee_block); | ||
2793 | ee_len = ext4_ext_get_actual_len(ex); | ||
2794 | newblock = split - ee_block + ext4_ext_pblock(ex); | ||
2795 | |||
2796 | BUG_ON(split < ee_block || split >= (ee_block + ee_len)); | ||
2797 | |||
2798 | err = ext4_ext_get_access(handle, inode, path + depth); | ||
2799 | if (err) | ||
2800 | goto out; | ||
2801 | |||
2802 | if (split == ee_block) { | ||
2803 | /* | ||
2804 | * case b: block @split is the block that the extent begins with | ||
2805 | * then we just change the state of the extent, and splitting | ||
2806 | * is not needed. | ||
2807 | */ | ||
2808 | if (split_flag & EXT4_EXT_MARK_UNINIT2) | ||
2809 | ext4_ext_mark_uninitialized(ex); | ||
2810 | else | ||
2811 | ext4_ext_mark_initialized(ex); | ||
2812 | |||
2813 | if (!(flags & EXT4_GET_BLOCKS_PRE_IO)) | ||
2814 | ext4_ext_try_to_merge(inode, path, ex); | ||
2815 | |||
2816 | err = ext4_ext_dirty(handle, inode, path + depth); | ||
2817 | goto out; | ||
2818 | } | ||
2819 | |||
2820 | /* case a */ | ||
2821 | memcpy(&orig_ex, ex, sizeof(orig_ex)); | ||
2822 | ex->ee_len = cpu_to_le16(split - ee_block); | ||
2823 | if (split_flag & EXT4_EXT_MARK_UNINIT1) | ||
2824 | ext4_ext_mark_uninitialized(ex); | ||
2825 | |||
2826 | /* | ||
2827 | * path may lead to new leaf, not to original leaf any more | ||
2828 | * after ext4_ext_insert_extent() returns, | ||
2829 | */ | ||
2830 | err = ext4_ext_dirty(handle, inode, path + depth); | ||
2831 | if (err) | ||
2832 | goto fix_extent_len; | ||
2833 | |||
2834 | ex2 = &newex; | ||
2835 | ex2->ee_block = cpu_to_le32(split); | ||
2836 | ex2->ee_len = cpu_to_le16(ee_len - (split - ee_block)); | ||
2837 | ext4_ext_store_pblock(ex2, newblock); | ||
2838 | if (split_flag & EXT4_EXT_MARK_UNINIT2) | ||
2839 | ext4_ext_mark_uninitialized(ex2); | ||
2840 | |||
2841 | err = ext4_ext_insert_extent(handle, inode, path, &newex, flags); | ||
2842 | if (err == -ENOSPC && (EXT4_EXT_MAY_ZEROOUT & split_flag)) { | ||
2843 | err = ext4_ext_zeroout(inode, &orig_ex); | ||
2844 | if (err) | ||
2845 | goto fix_extent_len; | ||
2846 | /* update the extent length and mark as initialized */ | ||
2847 | ex->ee_len = cpu_to_le32(ee_len); | ||
2848 | ext4_ext_try_to_merge(inode, path, ex); | ||
2849 | err = ext4_ext_dirty(handle, inode, path + depth); | ||
2850 | goto out; | ||
2851 | } else if (err) | ||
2852 | goto fix_extent_len; | ||
2853 | |||
2854 | out: | ||
2855 | ext4_ext_show_leaf(inode, path); | ||
2856 | return err; | ||
2857 | |||
2858 | fix_extent_len: | ||
2859 | ex->ee_len = orig_ex.ee_len; | ||
2860 | ext4_ext_dirty(handle, inode, path + depth); | ||
2861 | return err; | ||
2862 | } | ||
2863 | |||
2864 | /* | ||
2865 | * ext4_split_extents() splits an extent and mark extent which is covered | ||
2866 | * by @map as split_flags indicates | ||
2867 | * | ||
2868 | * It may result in splitting the extent into multiple extents (upto three) | ||
2869 | * There are three possibilities: | ||
2870 | * a> There is no split required | ||
2871 | * b> Splits in two extents: Split is happening at either end of the extent | ||
2872 | * c> Splits in three extents: Somone is splitting in middle of the extent | ||
2873 | * | ||
2874 | */ | ||
2875 | static int ext4_split_extent(handle_t *handle, | ||
2876 | struct inode *inode, | ||
2877 | struct ext4_ext_path *path, | ||
2878 | struct ext4_map_blocks *map, | ||
2879 | int split_flag, | ||
2880 | int flags) | ||
2881 | { | ||
2882 | ext4_lblk_t ee_block; | ||
2883 | struct ext4_extent *ex; | ||
2884 | unsigned int ee_len, depth; | ||
2885 | int err = 0; | ||
2886 | int uninitialized; | ||
2887 | int split_flag1, flags1; | ||
2888 | |||
2889 | depth = ext_depth(inode); | ||
2890 | ex = path[depth].p_ext; | ||
2891 | ee_block = le32_to_cpu(ex->ee_block); | ||
2892 | ee_len = ext4_ext_get_actual_len(ex); | ||
2893 | uninitialized = ext4_ext_is_uninitialized(ex); | ||
2894 | |||
2895 | if (map->m_lblk + map->m_len < ee_block + ee_len) { | ||
2896 | split_flag1 = split_flag & EXT4_EXT_MAY_ZEROOUT ? | ||
2897 | EXT4_EXT_MAY_ZEROOUT : 0; | ||
2898 | flags1 = flags | EXT4_GET_BLOCKS_PRE_IO; | ||
2899 | if (uninitialized) | ||
2900 | split_flag1 |= EXT4_EXT_MARK_UNINIT1 | | ||
2901 | EXT4_EXT_MARK_UNINIT2; | ||
2902 | err = ext4_split_extent_at(handle, inode, path, | ||
2903 | map->m_lblk + map->m_len, split_flag1, flags1); | ||
2904 | if (err) | ||
2905 | goto out; | ||
2906 | } | ||
2907 | |||
2908 | ext4_ext_drop_refs(path); | ||
2909 | path = ext4_ext_find_extent(inode, map->m_lblk, path); | ||
2910 | if (IS_ERR(path)) | ||
2911 | return PTR_ERR(path); | ||
2912 | |||
2913 | if (map->m_lblk >= ee_block) { | ||
2914 | split_flag1 = split_flag & EXT4_EXT_MAY_ZEROOUT ? | ||
2915 | EXT4_EXT_MAY_ZEROOUT : 0; | ||
2916 | if (uninitialized) | ||
2917 | split_flag1 |= EXT4_EXT_MARK_UNINIT1; | ||
2918 | if (split_flag & EXT4_EXT_MARK_UNINIT2) | ||
2919 | split_flag1 |= EXT4_EXT_MARK_UNINIT2; | ||
2920 | err = ext4_split_extent_at(handle, inode, path, | ||
2921 | map->m_lblk, split_flag1, flags); | ||
2922 | if (err) | ||
2923 | goto out; | ||
2924 | } | ||
2925 | |||
2926 | ext4_ext_show_leaf(inode, path); | ||
2927 | out: | ||
2928 | return err ? err : map->m_len; | ||
2929 | } | ||
2930 | |||
2532 | #define EXT4_EXT_ZERO_LEN 7 | 2931 | #define EXT4_EXT_ZERO_LEN 7 |
2533 | /* | 2932 | /* |
2534 | * This function is called by ext4_ext_map_blocks() if someone tries to write | 2933 | * This function is called by ext4_ext_map_blocks() if someone tries to write |
@@ -2545,17 +2944,13 @@ static int ext4_ext_convert_to_initialized(handle_t *handle, | |||
2545 | struct ext4_map_blocks *map, | 2944 | struct ext4_map_blocks *map, |
2546 | struct ext4_ext_path *path) | 2945 | struct ext4_ext_path *path) |
2547 | { | 2946 | { |
2548 | struct ext4_extent *ex, newex, orig_ex; | 2947 | struct ext4_map_blocks split_map; |
2549 | struct ext4_extent *ex1 = NULL; | 2948 | struct ext4_extent zero_ex; |
2550 | struct ext4_extent *ex2 = NULL; | 2949 | struct ext4_extent *ex; |
2551 | struct ext4_extent *ex3 = NULL; | ||
2552 | struct ext4_extent_header *eh; | ||
2553 | ext4_lblk_t ee_block, eof_block; | 2950 | ext4_lblk_t ee_block, eof_block; |
2554 | unsigned int allocated, ee_len, depth; | 2951 | unsigned int allocated, ee_len, depth; |
2555 | ext4_fsblk_t newblock; | ||
2556 | int err = 0; | 2952 | int err = 0; |
2557 | int ret = 0; | 2953 | int split_flag = 0; |
2558 | int may_zeroout; | ||
2559 | 2954 | ||
2560 | ext_debug("ext4_ext_convert_to_initialized: inode %lu, logical" | 2955 | ext_debug("ext4_ext_convert_to_initialized: inode %lu, logical" |
2561 | "block %llu, max_blocks %u\n", inode->i_ino, | 2956 | "block %llu, max_blocks %u\n", inode->i_ino, |
@@ -2567,280 +2962,86 @@ static int ext4_ext_convert_to_initialized(handle_t *handle, | |||
2567 | eof_block = map->m_lblk + map->m_len; | 2962 | eof_block = map->m_lblk + map->m_len; |
2568 | 2963 | ||
2569 | depth = ext_depth(inode); | 2964 | depth = ext_depth(inode); |
2570 | eh = path[depth].p_hdr; | ||
2571 | ex = path[depth].p_ext; | 2965 | ex = path[depth].p_ext; |
2572 | ee_block = le32_to_cpu(ex->ee_block); | 2966 | ee_block = le32_to_cpu(ex->ee_block); |
2573 | ee_len = ext4_ext_get_actual_len(ex); | 2967 | ee_len = ext4_ext_get_actual_len(ex); |
2574 | allocated = ee_len - (map->m_lblk - ee_block); | 2968 | allocated = ee_len - (map->m_lblk - ee_block); |
2575 | newblock = map->m_lblk - ee_block + ext4_ext_pblock(ex); | ||
2576 | |||
2577 | ex2 = ex; | ||
2578 | orig_ex.ee_block = ex->ee_block; | ||
2579 | orig_ex.ee_len = cpu_to_le16(ee_len); | ||
2580 | ext4_ext_store_pblock(&orig_ex, ext4_ext_pblock(ex)); | ||
2581 | 2969 | ||
2970 | WARN_ON(map->m_lblk < ee_block); | ||
2582 | /* | 2971 | /* |
2583 | * It is safe to convert extent to initialized via explicit | 2972 | * It is safe to convert extent to initialized via explicit |
2584 | * zeroout only if extent is fully insde i_size or new_size. | 2973 | * zeroout only if extent is fully insde i_size or new_size. |
2585 | */ | 2974 | */ |
2586 | may_zeroout = ee_block + ee_len <= eof_block; | 2975 | split_flag |= ee_block + ee_len <= eof_block ? EXT4_EXT_MAY_ZEROOUT : 0; |
2587 | 2976 | ||
2588 | err = ext4_ext_get_access(handle, inode, path + depth); | ||
2589 | if (err) | ||
2590 | goto out; | ||
2591 | /* If extent has less than 2*EXT4_EXT_ZERO_LEN zerout directly */ | 2977 | /* If extent has less than 2*EXT4_EXT_ZERO_LEN zerout directly */ |
2592 | if (ee_len <= 2*EXT4_EXT_ZERO_LEN && may_zeroout) { | 2978 | if (ee_len <= 2*EXT4_EXT_ZERO_LEN && |
2593 | err = ext4_ext_zeroout(inode, &orig_ex); | 2979 | (EXT4_EXT_MAY_ZEROOUT & split_flag)) { |
2980 | err = ext4_ext_zeroout(inode, ex); | ||
2594 | if (err) | 2981 | if (err) |
2595 | goto fix_extent_len; | ||
2596 | /* update the extent length and mark as initialized */ | ||
2597 | ex->ee_block = orig_ex.ee_block; | ||
2598 | ex->ee_len = orig_ex.ee_len; | ||
2599 | ext4_ext_store_pblock(ex, ext4_ext_pblock(&orig_ex)); | ||
2600 | ext4_ext_dirty(handle, inode, path + depth); | ||
2601 | /* zeroed the full extent */ | ||
2602 | return allocated; | ||
2603 | } | ||
2604 | |||
2605 | /* ex1: ee_block to map->m_lblk - 1 : uninitialized */ | ||
2606 | if (map->m_lblk > ee_block) { | ||
2607 | ex1 = ex; | ||
2608 | ex1->ee_len = cpu_to_le16(map->m_lblk - ee_block); | ||
2609 | ext4_ext_mark_uninitialized(ex1); | ||
2610 | ex2 = &newex; | ||
2611 | } | ||
2612 | /* | ||
2613 | * for sanity, update the length of the ex2 extent before | ||
2614 | * we insert ex3, if ex1 is NULL. This is to avoid temporary | ||
2615 | * overlap of blocks. | ||
2616 | */ | ||
2617 | if (!ex1 && allocated > map->m_len) | ||
2618 | ex2->ee_len = cpu_to_le16(map->m_len); | ||
2619 | /* ex3: to ee_block + ee_len : uninitialised */ | ||
2620 | if (allocated > map->m_len) { | ||
2621 | unsigned int newdepth; | ||
2622 | /* If extent has less than EXT4_EXT_ZERO_LEN zerout directly */ | ||
2623 | if (allocated <= EXT4_EXT_ZERO_LEN && may_zeroout) { | ||
2624 | /* | ||
2625 | * map->m_lblk == ee_block is handled by the zerouout | ||
2626 | * at the beginning. | ||
2627 | * Mark first half uninitialized. | ||
2628 | * Mark second half initialized and zero out the | ||
2629 | * initialized extent | ||
2630 | */ | ||
2631 | ex->ee_block = orig_ex.ee_block; | ||
2632 | ex->ee_len = cpu_to_le16(ee_len - allocated); | ||
2633 | ext4_ext_mark_uninitialized(ex); | ||
2634 | ext4_ext_store_pblock(ex, ext4_ext_pblock(&orig_ex)); | ||
2635 | ext4_ext_dirty(handle, inode, path + depth); | ||
2636 | |||
2637 | ex3 = &newex; | ||
2638 | ex3->ee_block = cpu_to_le32(map->m_lblk); | ||
2639 | ext4_ext_store_pblock(ex3, newblock); | ||
2640 | ex3->ee_len = cpu_to_le16(allocated); | ||
2641 | err = ext4_ext_insert_extent(handle, inode, path, | ||
2642 | ex3, 0); | ||
2643 | if (err == -ENOSPC) { | ||
2644 | err = ext4_ext_zeroout(inode, &orig_ex); | ||
2645 | if (err) | ||
2646 | goto fix_extent_len; | ||
2647 | ex->ee_block = orig_ex.ee_block; | ||
2648 | ex->ee_len = orig_ex.ee_len; | ||
2649 | ext4_ext_store_pblock(ex, | ||
2650 | ext4_ext_pblock(&orig_ex)); | ||
2651 | ext4_ext_dirty(handle, inode, path + depth); | ||
2652 | /* blocks available from map->m_lblk */ | ||
2653 | return allocated; | ||
2654 | |||
2655 | } else if (err) | ||
2656 | goto fix_extent_len; | ||
2657 | |||
2658 | /* | ||
2659 | * We need to zero out the second half because | ||
2660 | * an fallocate request can update file size and | ||
2661 | * converting the second half to initialized extent | ||
2662 | * implies that we can leak some junk data to user | ||
2663 | * space. | ||
2664 | */ | ||
2665 | err = ext4_ext_zeroout(inode, ex3); | ||
2666 | if (err) { | ||
2667 | /* | ||
2668 | * We should actually mark the | ||
2669 | * second half as uninit and return error | ||
2670 | * Insert would have changed the extent | ||
2671 | */ | ||
2672 | depth = ext_depth(inode); | ||
2673 | ext4_ext_drop_refs(path); | ||
2674 | path = ext4_ext_find_extent(inode, map->m_lblk, | ||
2675 | path); | ||
2676 | if (IS_ERR(path)) { | ||
2677 | err = PTR_ERR(path); | ||
2678 | return err; | ||
2679 | } | ||
2680 | /* get the second half extent details */ | ||
2681 | ex = path[depth].p_ext; | ||
2682 | err = ext4_ext_get_access(handle, inode, | ||
2683 | path + depth); | ||
2684 | if (err) | ||
2685 | return err; | ||
2686 | ext4_ext_mark_uninitialized(ex); | ||
2687 | ext4_ext_dirty(handle, inode, path + depth); | ||
2688 | return err; | ||
2689 | } | ||
2690 | |||
2691 | /* zeroed the second half */ | ||
2692 | return allocated; | ||
2693 | } | ||
2694 | ex3 = &newex; | ||
2695 | ex3->ee_block = cpu_to_le32(map->m_lblk + map->m_len); | ||
2696 | ext4_ext_store_pblock(ex3, newblock + map->m_len); | ||
2697 | ex3->ee_len = cpu_to_le16(allocated - map->m_len); | ||
2698 | ext4_ext_mark_uninitialized(ex3); | ||
2699 | err = ext4_ext_insert_extent(handle, inode, path, ex3, 0); | ||
2700 | if (err == -ENOSPC && may_zeroout) { | ||
2701 | err = ext4_ext_zeroout(inode, &orig_ex); | ||
2702 | if (err) | ||
2703 | goto fix_extent_len; | ||
2704 | /* update the extent length and mark as initialized */ | ||
2705 | ex->ee_block = orig_ex.ee_block; | ||
2706 | ex->ee_len = orig_ex.ee_len; | ||
2707 | ext4_ext_store_pblock(ex, ext4_ext_pblock(&orig_ex)); | ||
2708 | ext4_ext_dirty(handle, inode, path + depth); | ||
2709 | /* zeroed the full extent */ | ||
2710 | /* blocks available from map->m_lblk */ | ||
2711 | return allocated; | ||
2712 | |||
2713 | } else if (err) | ||
2714 | goto fix_extent_len; | ||
2715 | /* | ||
2716 | * The depth, and hence eh & ex might change | ||
2717 | * as part of the insert above. | ||
2718 | */ | ||
2719 | newdepth = ext_depth(inode); | ||
2720 | /* | ||
2721 | * update the extent length after successful insert of the | ||
2722 | * split extent | ||
2723 | */ | ||
2724 | ee_len -= ext4_ext_get_actual_len(ex3); | ||
2725 | orig_ex.ee_len = cpu_to_le16(ee_len); | ||
2726 | may_zeroout = ee_block + ee_len <= eof_block; | ||
2727 | |||
2728 | depth = newdepth; | ||
2729 | ext4_ext_drop_refs(path); | ||
2730 | path = ext4_ext_find_extent(inode, map->m_lblk, path); | ||
2731 | if (IS_ERR(path)) { | ||
2732 | err = PTR_ERR(path); | ||
2733 | goto out; | 2982 | goto out; |
2734 | } | ||
2735 | eh = path[depth].p_hdr; | ||
2736 | ex = path[depth].p_ext; | ||
2737 | if (ex2 != &newex) | ||
2738 | ex2 = ex; | ||
2739 | 2983 | ||
2740 | err = ext4_ext_get_access(handle, inode, path + depth); | 2984 | err = ext4_ext_get_access(handle, inode, path + depth); |
2741 | if (err) | 2985 | if (err) |
2742 | goto out; | 2986 | goto out; |
2743 | 2987 | ext4_ext_mark_initialized(ex); | |
2744 | allocated = map->m_len; | 2988 | ext4_ext_try_to_merge(inode, path, ex); |
2745 | 2989 | err = ext4_ext_dirty(handle, inode, path + depth); | |
2746 | /* If extent has less than EXT4_EXT_ZERO_LEN and we are trying | 2990 | goto out; |
2747 | * to insert a extent in the middle zerout directly | ||
2748 | * otherwise give the extent a chance to merge to left | ||
2749 | */ | ||
2750 | if (le16_to_cpu(orig_ex.ee_len) <= EXT4_EXT_ZERO_LEN && | ||
2751 | map->m_lblk != ee_block && may_zeroout) { | ||
2752 | err = ext4_ext_zeroout(inode, &orig_ex); | ||
2753 | if (err) | ||
2754 | goto fix_extent_len; | ||
2755 | /* update the extent length and mark as initialized */ | ||
2756 | ex->ee_block = orig_ex.ee_block; | ||
2757 | ex->ee_len = orig_ex.ee_len; | ||
2758 | ext4_ext_store_pblock(ex, ext4_ext_pblock(&orig_ex)); | ||
2759 | ext4_ext_dirty(handle, inode, path + depth); | ||
2760 | /* zero out the first half */ | ||
2761 | /* blocks available from map->m_lblk */ | ||
2762 | return allocated; | ||
2763 | } | ||
2764 | } | ||
2765 | /* | ||
2766 | * If there was a change of depth as part of the | ||
2767 | * insertion of ex3 above, we need to update the length | ||
2768 | * of the ex1 extent again here | ||
2769 | */ | ||
2770 | if (ex1 && ex1 != ex) { | ||
2771 | ex1 = ex; | ||
2772 | ex1->ee_len = cpu_to_le16(map->m_lblk - ee_block); | ||
2773 | ext4_ext_mark_uninitialized(ex1); | ||
2774 | ex2 = &newex; | ||
2775 | } | ||
2776 | /* ex2: map->m_lblk to map->m_lblk + maxblocks-1 : initialised */ | ||
2777 | ex2->ee_block = cpu_to_le32(map->m_lblk); | ||
2778 | ext4_ext_store_pblock(ex2, newblock); | ||
2779 | ex2->ee_len = cpu_to_le16(allocated); | ||
2780 | if (ex2 != ex) | ||
2781 | goto insert; | ||
2782 | /* | ||
2783 | * New (initialized) extent starts from the first block | ||
2784 | * in the current extent. i.e., ex2 == ex | ||
2785 | * We have to see if it can be merged with the extent | ||
2786 | * on the left. | ||
2787 | */ | ||
2788 | if (ex2 > EXT_FIRST_EXTENT(eh)) { | ||
2789 | /* | ||
2790 | * To merge left, pass "ex2 - 1" to try_to_merge(), | ||
2791 | * since it merges towards right _only_. | ||
2792 | */ | ||
2793 | ret = ext4_ext_try_to_merge(inode, path, ex2 - 1); | ||
2794 | if (ret) { | ||
2795 | err = ext4_ext_correct_indexes(handle, inode, path); | ||
2796 | if (err) | ||
2797 | goto out; | ||
2798 | depth = ext_depth(inode); | ||
2799 | ex2--; | ||
2800 | } | ||
2801 | } | 2991 | } |
2992 | |||
2802 | /* | 2993 | /* |
2803 | * Try to Merge towards right. This might be required | 2994 | * four cases: |
2804 | * only when the whole extent is being written to. | 2995 | * 1. split the extent into three extents. |
2805 | * i.e. ex2 == ex and ex3 == NULL. | 2996 | * 2. split the extent into two extents, zeroout the first half. |
2997 | * 3. split the extent into two extents, zeroout the second half. | ||
2998 | * 4. split the extent into two extents with out zeroout. | ||
2806 | */ | 2999 | */ |
2807 | if (!ex3) { | 3000 | split_map.m_lblk = map->m_lblk; |
2808 | ret = ext4_ext_try_to_merge(inode, path, ex2); | 3001 | split_map.m_len = map->m_len; |
2809 | if (ret) { | 3002 | |
2810 | err = ext4_ext_correct_indexes(handle, inode, path); | 3003 | if (allocated > map->m_len) { |
3004 | if (allocated <= EXT4_EXT_ZERO_LEN && | ||
3005 | (EXT4_EXT_MAY_ZEROOUT & split_flag)) { | ||
3006 | /* case 3 */ | ||
3007 | zero_ex.ee_block = | ||
3008 | cpu_to_le32(map->m_lblk); | ||
3009 | zero_ex.ee_len = cpu_to_le16(allocated); | ||
3010 | ext4_ext_store_pblock(&zero_ex, | ||
3011 | ext4_ext_pblock(ex) + map->m_lblk - ee_block); | ||
3012 | err = ext4_ext_zeroout(inode, &zero_ex); | ||
2811 | if (err) | 3013 | if (err) |
2812 | goto out; | 3014 | goto out; |
3015 | split_map.m_lblk = map->m_lblk; | ||
3016 | split_map.m_len = allocated; | ||
3017 | } else if ((map->m_lblk - ee_block + map->m_len < | ||
3018 | EXT4_EXT_ZERO_LEN) && | ||
3019 | (EXT4_EXT_MAY_ZEROOUT & split_flag)) { | ||
3020 | /* case 2 */ | ||
3021 | if (map->m_lblk != ee_block) { | ||
3022 | zero_ex.ee_block = ex->ee_block; | ||
3023 | zero_ex.ee_len = cpu_to_le16(map->m_lblk - | ||
3024 | ee_block); | ||
3025 | ext4_ext_store_pblock(&zero_ex, | ||
3026 | ext4_ext_pblock(ex)); | ||
3027 | err = ext4_ext_zeroout(inode, &zero_ex); | ||
3028 | if (err) | ||
3029 | goto out; | ||
3030 | } | ||
3031 | |||
3032 | split_map.m_lblk = ee_block; | ||
3033 | split_map.m_len = map->m_lblk - ee_block + map->m_len; | ||
3034 | allocated = map->m_len; | ||
2813 | } | 3035 | } |
2814 | } | 3036 | } |
2815 | /* Mark modified extent as dirty */ | 3037 | |
2816 | err = ext4_ext_dirty(handle, inode, path + depth); | 3038 | allocated = ext4_split_extent(handle, inode, path, |
2817 | goto out; | 3039 | &split_map, split_flag, 0); |
2818 | insert: | 3040 | if (allocated < 0) |
2819 | err = ext4_ext_insert_extent(handle, inode, path, &newex, 0); | 3041 | err = allocated; |
2820 | if (err == -ENOSPC && may_zeroout) { | 3042 | |
2821 | err = ext4_ext_zeroout(inode, &orig_ex); | ||
2822 | if (err) | ||
2823 | goto fix_extent_len; | ||
2824 | /* update the extent length and mark as initialized */ | ||
2825 | ex->ee_block = orig_ex.ee_block; | ||
2826 | ex->ee_len = orig_ex.ee_len; | ||
2827 | ext4_ext_store_pblock(ex, ext4_ext_pblock(&orig_ex)); | ||
2828 | ext4_ext_dirty(handle, inode, path + depth); | ||
2829 | /* zero out the first half */ | ||
2830 | return allocated; | ||
2831 | } else if (err) | ||
2832 | goto fix_extent_len; | ||
2833 | out: | 3043 | out: |
2834 | ext4_ext_show_leaf(inode, path); | ||
2835 | return err ? err : allocated; | 3044 | return err ? err : allocated; |
2836 | |||
2837 | fix_extent_len: | ||
2838 | ex->ee_block = orig_ex.ee_block; | ||
2839 | ex->ee_len = orig_ex.ee_len; | ||
2840 | ext4_ext_store_pblock(ex, ext4_ext_pblock(&orig_ex)); | ||
2841 | ext4_ext_mark_uninitialized(ex); | ||
2842 | ext4_ext_dirty(handle, inode, path + depth); | ||
2843 | return err; | ||
2844 | } | 3045 | } |
2845 | 3046 | ||
2846 | /* | 3047 | /* |
@@ -2871,15 +3072,11 @@ static int ext4_split_unwritten_extents(handle_t *handle, | |||
2871 | struct ext4_ext_path *path, | 3072 | struct ext4_ext_path *path, |
2872 | int flags) | 3073 | int flags) |
2873 | { | 3074 | { |
2874 | struct ext4_extent *ex, newex, orig_ex; | 3075 | ext4_lblk_t eof_block; |
2875 | struct ext4_extent *ex1 = NULL; | 3076 | ext4_lblk_t ee_block; |
2876 | struct ext4_extent *ex2 = NULL; | 3077 | struct ext4_extent *ex; |
2877 | struct ext4_extent *ex3 = NULL; | 3078 | unsigned int ee_len; |
2878 | ext4_lblk_t ee_block, eof_block; | 3079 | int split_flag = 0, depth; |
2879 | unsigned int allocated, ee_len, depth; | ||
2880 | ext4_fsblk_t newblock; | ||
2881 | int err = 0; | ||
2882 | int may_zeroout; | ||
2883 | 3080 | ||
2884 | ext_debug("ext4_split_unwritten_extents: inode %lu, logical" | 3081 | ext_debug("ext4_split_unwritten_extents: inode %lu, logical" |
2885 | "block %llu, max_blocks %u\n", inode->i_ino, | 3082 | "block %llu, max_blocks %u\n", inode->i_ino, |
@@ -2889,156 +3086,22 @@ static int ext4_split_unwritten_extents(handle_t *handle, | |||
2889 | inode->i_sb->s_blocksize_bits; | 3086 | inode->i_sb->s_blocksize_bits; |
2890 | if (eof_block < map->m_lblk + map->m_len) | 3087 | if (eof_block < map->m_lblk + map->m_len) |
2891 | eof_block = map->m_lblk + map->m_len; | 3088 | eof_block = map->m_lblk + map->m_len; |
2892 | |||
2893 | depth = ext_depth(inode); | ||
2894 | ex = path[depth].p_ext; | ||
2895 | ee_block = le32_to_cpu(ex->ee_block); | ||
2896 | ee_len = ext4_ext_get_actual_len(ex); | ||
2897 | allocated = ee_len - (map->m_lblk - ee_block); | ||
2898 | newblock = map->m_lblk - ee_block + ext4_ext_pblock(ex); | ||
2899 | |||
2900 | ex2 = ex; | ||
2901 | orig_ex.ee_block = ex->ee_block; | ||
2902 | orig_ex.ee_len = cpu_to_le16(ee_len); | ||
2903 | ext4_ext_store_pblock(&orig_ex, ext4_ext_pblock(ex)); | ||
2904 | |||
2905 | /* | 3089 | /* |
2906 | * It is safe to convert extent to initialized via explicit | 3090 | * It is safe to convert extent to initialized via explicit |
2907 | * zeroout only if extent is fully insde i_size or new_size. | 3091 | * zeroout only if extent is fully insde i_size or new_size. |
2908 | */ | 3092 | */ |
2909 | may_zeroout = ee_block + ee_len <= eof_block; | 3093 | depth = ext_depth(inode); |
2910 | 3094 | ex = path[depth].p_ext; | |
2911 | /* | 3095 | ee_block = le32_to_cpu(ex->ee_block); |
2912 | * If the uninitialized extent begins at the same logical | 3096 | ee_len = ext4_ext_get_actual_len(ex); |
2913 | * block where the write begins, and the write completely | ||
2914 | * covers the extent, then we don't need to split it. | ||
2915 | */ | ||
2916 | if ((map->m_lblk == ee_block) && (allocated <= map->m_len)) | ||
2917 | return allocated; | ||
2918 | |||
2919 | err = ext4_ext_get_access(handle, inode, path + depth); | ||
2920 | if (err) | ||
2921 | goto out; | ||
2922 | /* ex1: ee_block to map->m_lblk - 1 : uninitialized */ | ||
2923 | if (map->m_lblk > ee_block) { | ||
2924 | ex1 = ex; | ||
2925 | ex1->ee_len = cpu_to_le16(map->m_lblk - ee_block); | ||
2926 | ext4_ext_mark_uninitialized(ex1); | ||
2927 | ex2 = &newex; | ||
2928 | } | ||
2929 | /* | ||
2930 | * for sanity, update the length of the ex2 extent before | ||
2931 | * we insert ex3, if ex1 is NULL. This is to avoid temporary | ||
2932 | * overlap of blocks. | ||
2933 | */ | ||
2934 | if (!ex1 && allocated > map->m_len) | ||
2935 | ex2->ee_len = cpu_to_le16(map->m_len); | ||
2936 | /* ex3: to ee_block + ee_len : uninitialised */ | ||
2937 | if (allocated > map->m_len) { | ||
2938 | unsigned int newdepth; | ||
2939 | ex3 = &newex; | ||
2940 | ex3->ee_block = cpu_to_le32(map->m_lblk + map->m_len); | ||
2941 | ext4_ext_store_pblock(ex3, newblock + map->m_len); | ||
2942 | ex3->ee_len = cpu_to_le16(allocated - map->m_len); | ||
2943 | ext4_ext_mark_uninitialized(ex3); | ||
2944 | err = ext4_ext_insert_extent(handle, inode, path, ex3, flags); | ||
2945 | if (err == -ENOSPC && may_zeroout) { | ||
2946 | err = ext4_ext_zeroout(inode, &orig_ex); | ||
2947 | if (err) | ||
2948 | goto fix_extent_len; | ||
2949 | /* update the extent length and mark as initialized */ | ||
2950 | ex->ee_block = orig_ex.ee_block; | ||
2951 | ex->ee_len = orig_ex.ee_len; | ||
2952 | ext4_ext_store_pblock(ex, ext4_ext_pblock(&orig_ex)); | ||
2953 | ext4_ext_dirty(handle, inode, path + depth); | ||
2954 | /* zeroed the full extent */ | ||
2955 | /* blocks available from map->m_lblk */ | ||
2956 | return allocated; | ||
2957 | |||
2958 | } else if (err) | ||
2959 | goto fix_extent_len; | ||
2960 | /* | ||
2961 | * The depth, and hence eh & ex might change | ||
2962 | * as part of the insert above. | ||
2963 | */ | ||
2964 | newdepth = ext_depth(inode); | ||
2965 | /* | ||
2966 | * update the extent length after successful insert of the | ||
2967 | * split extent | ||
2968 | */ | ||
2969 | ee_len -= ext4_ext_get_actual_len(ex3); | ||
2970 | orig_ex.ee_len = cpu_to_le16(ee_len); | ||
2971 | may_zeroout = ee_block + ee_len <= eof_block; | ||
2972 | |||
2973 | depth = newdepth; | ||
2974 | ext4_ext_drop_refs(path); | ||
2975 | path = ext4_ext_find_extent(inode, map->m_lblk, path); | ||
2976 | if (IS_ERR(path)) { | ||
2977 | err = PTR_ERR(path); | ||
2978 | goto out; | ||
2979 | } | ||
2980 | ex = path[depth].p_ext; | ||
2981 | if (ex2 != &newex) | ||
2982 | ex2 = ex; | ||
2983 | 3097 | ||
2984 | err = ext4_ext_get_access(handle, inode, path + depth); | 3098 | split_flag |= ee_block + ee_len <= eof_block ? EXT4_EXT_MAY_ZEROOUT : 0; |
2985 | if (err) | 3099 | split_flag |= EXT4_EXT_MARK_UNINIT2; |
2986 | goto out; | ||
2987 | 3100 | ||
2988 | allocated = map->m_len; | 3101 | flags |= EXT4_GET_BLOCKS_PRE_IO; |
2989 | } | 3102 | return ext4_split_extent(handle, inode, path, map, split_flag, flags); |
2990 | /* | ||
2991 | * If there was a change of depth as part of the | ||
2992 | * insertion of ex3 above, we need to update the length | ||
2993 | * of the ex1 extent again here | ||
2994 | */ | ||
2995 | if (ex1 && ex1 != ex) { | ||
2996 | ex1 = ex; | ||
2997 | ex1->ee_len = cpu_to_le16(map->m_lblk - ee_block); | ||
2998 | ext4_ext_mark_uninitialized(ex1); | ||
2999 | ex2 = &newex; | ||
3000 | } | ||
3001 | /* | ||
3002 | * ex2: map->m_lblk to map->m_lblk + map->m_len-1 : to be written | ||
3003 | * using direct I/O, uninitialised still. | ||
3004 | */ | ||
3005 | ex2->ee_block = cpu_to_le32(map->m_lblk); | ||
3006 | ext4_ext_store_pblock(ex2, newblock); | ||
3007 | ex2->ee_len = cpu_to_le16(allocated); | ||
3008 | ext4_ext_mark_uninitialized(ex2); | ||
3009 | if (ex2 != ex) | ||
3010 | goto insert; | ||
3011 | /* Mark modified extent as dirty */ | ||
3012 | err = ext4_ext_dirty(handle, inode, path + depth); | ||
3013 | ext_debug("out here\n"); | ||
3014 | goto out; | ||
3015 | insert: | ||
3016 | err = ext4_ext_insert_extent(handle, inode, path, &newex, flags); | ||
3017 | if (err == -ENOSPC && may_zeroout) { | ||
3018 | err = ext4_ext_zeroout(inode, &orig_ex); | ||
3019 | if (err) | ||
3020 | goto fix_extent_len; | ||
3021 | /* update the extent length and mark as initialized */ | ||
3022 | ex->ee_block = orig_ex.ee_block; | ||
3023 | ex->ee_len = orig_ex.ee_len; | ||
3024 | ext4_ext_store_pblock(ex, ext4_ext_pblock(&orig_ex)); | ||
3025 | ext4_ext_dirty(handle, inode, path + depth); | ||
3026 | /* zero out the first half */ | ||
3027 | return allocated; | ||
3028 | } else if (err) | ||
3029 | goto fix_extent_len; | ||
3030 | out: | ||
3031 | ext4_ext_show_leaf(inode, path); | ||
3032 | return err ? err : allocated; | ||
3033 | |||
3034 | fix_extent_len: | ||
3035 | ex->ee_block = orig_ex.ee_block; | ||
3036 | ex->ee_len = orig_ex.ee_len; | ||
3037 | ext4_ext_store_pblock(ex, ext4_ext_pblock(&orig_ex)); | ||
3038 | ext4_ext_mark_uninitialized(ex); | ||
3039 | ext4_ext_dirty(handle, inode, path + depth); | ||
3040 | return err; | ||
3041 | } | 3103 | } |
3104 | |||
3042 | static int ext4_convert_unwritten_extents_endio(handle_t *handle, | 3105 | static int ext4_convert_unwritten_extents_endio(handle_t *handle, |
3043 | struct inode *inode, | 3106 | struct inode *inode, |
3044 | struct ext4_ext_path *path) | 3107 | struct ext4_ext_path *path) |
@@ -3047,46 +3110,27 @@ static int ext4_convert_unwritten_extents_endio(handle_t *handle, | |||
3047 | struct ext4_extent_header *eh; | 3110 | struct ext4_extent_header *eh; |
3048 | int depth; | 3111 | int depth; |
3049 | int err = 0; | 3112 | int err = 0; |
3050 | int ret = 0; | ||
3051 | 3113 | ||
3052 | depth = ext_depth(inode); | 3114 | depth = ext_depth(inode); |
3053 | eh = path[depth].p_hdr; | 3115 | eh = path[depth].p_hdr; |
3054 | ex = path[depth].p_ext; | 3116 | ex = path[depth].p_ext; |
3055 | 3117 | ||
3118 | ext_debug("ext4_convert_unwritten_extents_endio: inode %lu, logical" | ||
3119 | "block %llu, max_blocks %u\n", inode->i_ino, | ||
3120 | (unsigned long long)le32_to_cpu(ex->ee_block), | ||
3121 | ext4_ext_get_actual_len(ex)); | ||
3122 | |||
3056 | err = ext4_ext_get_access(handle, inode, path + depth); | 3123 | err = ext4_ext_get_access(handle, inode, path + depth); |
3057 | if (err) | 3124 | if (err) |
3058 | goto out; | 3125 | goto out; |
3059 | /* first mark the extent as initialized */ | 3126 | /* first mark the extent as initialized */ |
3060 | ext4_ext_mark_initialized(ex); | 3127 | ext4_ext_mark_initialized(ex); |
3061 | 3128 | ||
3062 | /* | 3129 | /* note: ext4_ext_correct_indexes() isn't needed here because |
3063 | * We have to see if it can be merged with the extent | 3130 | * borders are not changed |
3064 | * on the left. | ||
3065 | */ | ||
3066 | if (ex > EXT_FIRST_EXTENT(eh)) { | ||
3067 | /* | ||
3068 | * To merge left, pass "ex - 1" to try_to_merge(), | ||
3069 | * since it merges towards right _only_. | ||
3070 | */ | ||
3071 | ret = ext4_ext_try_to_merge(inode, path, ex - 1); | ||
3072 | if (ret) { | ||
3073 | err = ext4_ext_correct_indexes(handle, inode, path); | ||
3074 | if (err) | ||
3075 | goto out; | ||
3076 | depth = ext_depth(inode); | ||
3077 | ex--; | ||
3078 | } | ||
3079 | } | ||
3080 | /* | ||
3081 | * Try to Merge towards right. | ||
3082 | */ | 3131 | */ |
3083 | ret = ext4_ext_try_to_merge(inode, path, ex); | 3132 | ext4_ext_try_to_merge(inode, path, ex); |
3084 | if (ret) { | 3133 | |
3085 | err = ext4_ext_correct_indexes(handle, inode, path); | ||
3086 | if (err) | ||
3087 | goto out; | ||
3088 | depth = ext_depth(inode); | ||
3089 | } | ||
3090 | /* Mark modified extent as dirty */ | 3134 | /* Mark modified extent as dirty */ |
3091 | err = ext4_ext_dirty(handle, inode, path + depth); | 3135 | err = ext4_ext_dirty(handle, inode, path + depth); |
3092 | out: | 3136 | out: |
@@ -3302,15 +3346,19 @@ int ext4_ext_map_blocks(handle_t *handle, struct inode *inode, | |||
3302 | ext4_fsblk_t newblock = 0; | 3346 | ext4_fsblk_t newblock = 0; |
3303 | int err = 0, depth, ret; | 3347 | int err = 0, depth, ret; |
3304 | unsigned int allocated = 0; | 3348 | unsigned int allocated = 0; |
3349 | unsigned int punched_out = 0; | ||
3350 | unsigned int result = 0; | ||
3305 | struct ext4_allocation_request ar; | 3351 | struct ext4_allocation_request ar; |
3306 | ext4_io_end_t *io = EXT4_I(inode)->cur_aio_dio; | 3352 | ext4_io_end_t *io = EXT4_I(inode)->cur_aio_dio; |
3353 | struct ext4_map_blocks punch_map; | ||
3307 | 3354 | ||
3308 | ext_debug("blocks %u/%u requested for inode %lu\n", | 3355 | ext_debug("blocks %u/%u requested for inode %lu\n", |
3309 | map->m_lblk, map->m_len, inode->i_ino); | 3356 | map->m_lblk, map->m_len, inode->i_ino); |
3310 | trace_ext4_ext_map_blocks_enter(inode, map->m_lblk, map->m_len, flags); | 3357 | trace_ext4_ext_map_blocks_enter(inode, map->m_lblk, map->m_len, flags); |
3311 | 3358 | ||
3312 | /* check in cache */ | 3359 | /* check in cache */ |
3313 | if (ext4_ext_in_cache(inode, map->m_lblk, &newex)) { | 3360 | if (ext4_ext_in_cache(inode, map->m_lblk, &newex) && |
3361 | ((flags & EXT4_GET_BLOCKS_PUNCH_OUT_EXT) == 0)) { | ||
3314 | if (!newex.ee_start_lo && !newex.ee_start_hi) { | 3362 | if (!newex.ee_start_lo && !newex.ee_start_hi) { |
3315 | if ((flags & EXT4_GET_BLOCKS_CREATE) == 0) { | 3363 | if ((flags & EXT4_GET_BLOCKS_CREATE) == 0) { |
3316 | /* | 3364 | /* |
@@ -3375,16 +3423,84 @@ int ext4_ext_map_blocks(handle_t *handle, struct inode *inode, | |||
3375 | ext_debug("%u fit into %u:%d -> %llu\n", map->m_lblk, | 3423 | ext_debug("%u fit into %u:%d -> %llu\n", map->m_lblk, |
3376 | ee_block, ee_len, newblock); | 3424 | ee_block, ee_len, newblock); |
3377 | 3425 | ||
3378 | /* Do not put uninitialized extent in the cache */ | 3426 | if ((flags & EXT4_GET_BLOCKS_PUNCH_OUT_EXT) == 0) { |
3379 | if (!ext4_ext_is_uninitialized(ex)) { | 3427 | /* |
3380 | ext4_ext_put_in_cache(inode, ee_block, | 3428 | * Do not put uninitialized extent |
3381 | ee_len, ee_start); | 3429 | * in the cache |
3382 | goto out; | 3430 | */ |
3431 | if (!ext4_ext_is_uninitialized(ex)) { | ||
3432 | ext4_ext_put_in_cache(inode, ee_block, | ||
3433 | ee_len, ee_start); | ||
3434 | goto out; | ||
3435 | } | ||
3436 | ret = ext4_ext_handle_uninitialized_extents( | ||
3437 | handle, inode, map, path, flags, | ||
3438 | allocated, newblock); | ||
3439 | return ret; | ||
3383 | } | 3440 | } |
3384 | ret = ext4_ext_handle_uninitialized_extents(handle, | 3441 | |
3385 | inode, map, path, flags, allocated, | 3442 | /* |
3386 | newblock); | 3443 | * Punch out the map length, but only to the |
3387 | return ret; | 3444 | * end of the extent |
3445 | */ | ||
3446 | punched_out = allocated < map->m_len ? | ||
3447 | allocated : map->m_len; | ||
3448 | |||
3449 | /* | ||
3450 | * Sense extents need to be converted to | ||
3451 | * uninitialized, they must fit in an | ||
3452 | * uninitialized extent | ||
3453 | */ | ||
3454 | if (punched_out > EXT_UNINIT_MAX_LEN) | ||
3455 | punched_out = EXT_UNINIT_MAX_LEN; | ||
3456 | |||
3457 | punch_map.m_lblk = map->m_lblk; | ||
3458 | punch_map.m_pblk = newblock; | ||
3459 | punch_map.m_len = punched_out; | ||
3460 | punch_map.m_flags = 0; | ||
3461 | |||
3462 | /* Check to see if the extent needs to be split */ | ||
3463 | if (punch_map.m_len != ee_len || | ||
3464 | punch_map.m_lblk != ee_block) { | ||
3465 | |||
3466 | ret = ext4_split_extent(handle, inode, | ||
3467 | path, &punch_map, 0, | ||
3468 | EXT4_GET_BLOCKS_PUNCH_OUT_EXT | | ||
3469 | EXT4_GET_BLOCKS_PRE_IO); | ||
3470 | |||
3471 | if (ret < 0) { | ||
3472 | err = ret; | ||
3473 | goto out2; | ||
3474 | } | ||
3475 | /* | ||
3476 | * find extent for the block at | ||
3477 | * the start of the hole | ||
3478 | */ | ||
3479 | ext4_ext_drop_refs(path); | ||
3480 | kfree(path); | ||
3481 | |||
3482 | path = ext4_ext_find_extent(inode, | ||
3483 | map->m_lblk, NULL); | ||
3484 | if (IS_ERR(path)) { | ||
3485 | err = PTR_ERR(path); | ||
3486 | path = NULL; | ||
3487 | goto out2; | ||
3488 | } | ||
3489 | |||
3490 | depth = ext_depth(inode); | ||
3491 | ex = path[depth].p_ext; | ||
3492 | ee_len = ext4_ext_get_actual_len(ex); | ||
3493 | ee_block = le32_to_cpu(ex->ee_block); | ||
3494 | ee_start = ext4_ext_pblock(ex); | ||
3495 | |||
3496 | } | ||
3497 | |||
3498 | ext4_ext_mark_uninitialized(ex); | ||
3499 | |||
3500 | err = ext4_ext_remove_space(inode, map->m_lblk, | ||
3501 | map->m_lblk + punched_out); | ||
3502 | |||
3503 | goto out2; | ||
3388 | } | 3504 | } |
3389 | } | 3505 | } |
3390 | 3506 | ||
@@ -3446,6 +3562,8 @@ int ext4_ext_map_blocks(handle_t *handle, struct inode *inode, | |||
3446 | else | 3562 | else |
3447 | /* disable in-core preallocation for non-regular files */ | 3563 | /* disable in-core preallocation for non-regular files */ |
3448 | ar.flags = 0; | 3564 | ar.flags = 0; |
3565 | if (flags & EXT4_GET_BLOCKS_NO_NORMALIZE) | ||
3566 | ar.flags |= EXT4_MB_HINT_NOPREALLOC; | ||
3449 | newblock = ext4_mb_new_blocks(handle, &ar, &err); | 3567 | newblock = ext4_mb_new_blocks(handle, &ar, &err); |
3450 | if (!newblock) | 3568 | if (!newblock) |
3451 | goto out2; | 3569 | goto out2; |
@@ -3529,7 +3647,11 @@ out2: | |||
3529 | } | 3647 | } |
3530 | trace_ext4_ext_map_blocks_exit(inode, map->m_lblk, | 3648 | trace_ext4_ext_map_blocks_exit(inode, map->m_lblk, |
3531 | newblock, map->m_len, err ? err : allocated); | 3649 | newblock, map->m_len, err ? err : allocated); |
3532 | return err ? err : allocated; | 3650 | |
3651 | result = (flags & EXT4_GET_BLOCKS_PUNCH_OUT_EXT) ? | ||
3652 | punched_out : allocated; | ||
3653 | |||
3654 | return err ? err : result; | ||
3533 | } | 3655 | } |
3534 | 3656 | ||
3535 | void ext4_ext_truncate(struct inode *inode) | 3657 | void ext4_ext_truncate(struct inode *inode) |
@@ -3577,7 +3699,7 @@ void ext4_ext_truncate(struct inode *inode) | |||
3577 | 3699 | ||
3578 | last_block = (inode->i_size + sb->s_blocksize - 1) | 3700 | last_block = (inode->i_size + sb->s_blocksize - 1) |
3579 | >> EXT4_BLOCK_SIZE_BITS(sb); | 3701 | >> EXT4_BLOCK_SIZE_BITS(sb); |
3580 | err = ext4_ext_remove_space(inode, last_block); | 3702 | err = ext4_ext_remove_space(inode, last_block, EXT_MAX_BLOCK); |
3581 | 3703 | ||
3582 | /* In a multi-transaction truncate, we only make the final | 3704 | /* In a multi-transaction truncate, we only make the final |
3583 | * transaction synchronous. | 3705 | * transaction synchronous. |
@@ -3585,8 +3707,9 @@ void ext4_ext_truncate(struct inode *inode) | |||
3585 | if (IS_SYNC(inode)) | 3707 | if (IS_SYNC(inode)) |
3586 | ext4_handle_sync(handle); | 3708 | ext4_handle_sync(handle); |
3587 | 3709 | ||
3588 | out_stop: | ||
3589 | up_write(&EXT4_I(inode)->i_data_sem); | 3710 | up_write(&EXT4_I(inode)->i_data_sem); |
3711 | |||
3712 | out_stop: | ||
3590 | /* | 3713 | /* |
3591 | * If this was a simple ftruncate() and the file will remain alive, | 3714 | * If this was a simple ftruncate() and the file will remain alive, |
3592 | * then we need to clear up the orphan record which we created above. | 3715 | * then we need to clear up the orphan record which we created above. |
@@ -3651,10 +3774,6 @@ long ext4_fallocate(struct file *file, int mode, loff_t offset, loff_t len) | |||
3651 | struct ext4_map_blocks map; | 3774 | struct ext4_map_blocks map; |
3652 | unsigned int credits, blkbits = inode->i_blkbits; | 3775 | unsigned int credits, blkbits = inode->i_blkbits; |
3653 | 3776 | ||
3654 | /* We only support the FALLOC_FL_KEEP_SIZE mode */ | ||
3655 | if (mode & ~FALLOC_FL_KEEP_SIZE) | ||
3656 | return -EOPNOTSUPP; | ||
3657 | |||
3658 | /* | 3777 | /* |
3659 | * currently supporting (pre)allocate mode for extent-based | 3778 | * currently supporting (pre)allocate mode for extent-based |
3660 | * files _only_ | 3779 | * files _only_ |
@@ -3662,6 +3781,13 @@ long ext4_fallocate(struct file *file, int mode, loff_t offset, loff_t len) | |||
3662 | if (!(ext4_test_inode_flag(inode, EXT4_INODE_EXTENTS))) | 3781 | if (!(ext4_test_inode_flag(inode, EXT4_INODE_EXTENTS))) |
3663 | return -EOPNOTSUPP; | 3782 | return -EOPNOTSUPP; |
3664 | 3783 | ||
3784 | /* Return error if mode is not supported */ | ||
3785 | if (mode & ~(FALLOC_FL_KEEP_SIZE | FALLOC_FL_PUNCH_HOLE)) | ||
3786 | return -EOPNOTSUPP; | ||
3787 | |||
3788 | if (mode & FALLOC_FL_PUNCH_HOLE) | ||
3789 | return ext4_punch_hole(file, offset, len); | ||
3790 | |||
3665 | trace_ext4_fallocate_enter(inode, offset, len, mode); | 3791 | trace_ext4_fallocate_enter(inode, offset, len, mode); |
3666 | map.m_lblk = offset >> blkbits; | 3792 | map.m_lblk = offset >> blkbits; |
3667 | /* | 3793 | /* |
@@ -3691,7 +3817,8 @@ retry: | |||
3691 | break; | 3817 | break; |
3692 | } | 3818 | } |
3693 | ret = ext4_map_blocks(handle, inode, &map, | 3819 | ret = ext4_map_blocks(handle, inode, &map, |
3694 | EXT4_GET_BLOCKS_CREATE_UNINIT_EXT); | 3820 | EXT4_GET_BLOCKS_CREATE_UNINIT_EXT | |
3821 | EXT4_GET_BLOCKS_NO_NORMALIZE); | ||
3695 | if (ret <= 0) { | 3822 | if (ret <= 0) { |
3696 | #ifdef EXT4FS_DEBUG | 3823 | #ifdef EXT4FS_DEBUG |
3697 | WARN_ON(ret <= 0); | 3824 | WARN_ON(ret <= 0); |
@@ -3822,6 +3949,7 @@ static int ext4_ext_fiemap_cb(struct inode *inode, struct ext4_ext_path *path, | |||
3822 | pgoff_t last_offset; | 3949 | pgoff_t last_offset; |
3823 | pgoff_t offset; | 3950 | pgoff_t offset; |
3824 | pgoff_t index; | 3951 | pgoff_t index; |
3952 | pgoff_t start_index = 0; | ||
3825 | struct page **pages = NULL; | 3953 | struct page **pages = NULL; |
3826 | struct buffer_head *bh = NULL; | 3954 | struct buffer_head *bh = NULL; |
3827 | struct buffer_head *head = NULL; | 3955 | struct buffer_head *head = NULL; |
@@ -3848,39 +3976,57 @@ out: | |||
3848 | kfree(pages); | 3976 | kfree(pages); |
3849 | return EXT_CONTINUE; | 3977 | return EXT_CONTINUE; |
3850 | } | 3978 | } |
3979 | index = 0; | ||
3851 | 3980 | ||
3981 | next_page: | ||
3852 | /* Try to find the 1st mapped buffer. */ | 3982 | /* Try to find the 1st mapped buffer. */ |
3853 | end = ((__u64)pages[0]->index << PAGE_SHIFT) >> | 3983 | end = ((__u64)pages[index]->index << PAGE_SHIFT) >> |
3854 | blksize_bits; | 3984 | blksize_bits; |
3855 | if (!page_has_buffers(pages[0])) | 3985 | if (!page_has_buffers(pages[index])) |
3856 | goto out; | 3986 | goto out; |
3857 | head = page_buffers(pages[0]); | 3987 | head = page_buffers(pages[index]); |
3858 | if (!head) | 3988 | if (!head) |
3859 | goto out; | 3989 | goto out; |
3860 | 3990 | ||
3991 | index++; | ||
3861 | bh = head; | 3992 | bh = head; |
3862 | do { | 3993 | do { |
3863 | if (buffer_mapped(bh)) { | 3994 | if (end >= newex->ec_block + |
3995 | newex->ec_len) | ||
3996 | /* The buffer is out of | ||
3997 | * the request range. | ||
3998 | */ | ||
3999 | goto out; | ||
4000 | |||
4001 | if (buffer_mapped(bh) && | ||
4002 | end >= newex->ec_block) { | ||
4003 | start_index = index - 1; | ||
3864 | /* get the 1st mapped buffer. */ | 4004 | /* get the 1st mapped buffer. */ |
3865 | if (end > newex->ec_block + | ||
3866 | newex->ec_len) | ||
3867 | /* The buffer is out of | ||
3868 | * the request range. | ||
3869 | */ | ||
3870 | goto out; | ||
3871 | goto found_mapped_buffer; | 4005 | goto found_mapped_buffer; |
3872 | } | 4006 | } |
4007 | |||
3873 | bh = bh->b_this_page; | 4008 | bh = bh->b_this_page; |
3874 | end++; | 4009 | end++; |
3875 | } while (bh != head); | 4010 | } while (bh != head); |
3876 | 4011 | ||
3877 | /* No mapped buffer found. */ | 4012 | /* No mapped buffer in the range found in this page, |
3878 | goto out; | 4013 | * We need to look up next page. |
4014 | */ | ||
4015 | if (index >= ret) { | ||
4016 | /* There is no page left, but we need to limit | ||
4017 | * newex->ec_len. | ||
4018 | */ | ||
4019 | newex->ec_len = end - newex->ec_block; | ||
4020 | goto out; | ||
4021 | } | ||
4022 | goto next_page; | ||
3879 | } else { | 4023 | } else { |
3880 | /*Find contiguous delayed buffers. */ | 4024 | /*Find contiguous delayed buffers. */ |
3881 | if (ret > 0 && pages[0]->index == last_offset) | 4025 | if (ret > 0 && pages[0]->index == last_offset) |
3882 | head = page_buffers(pages[0]); | 4026 | head = page_buffers(pages[0]); |
3883 | bh = head; | 4027 | bh = head; |
4028 | index = 1; | ||
4029 | start_index = 0; | ||
3884 | } | 4030 | } |
3885 | 4031 | ||
3886 | found_mapped_buffer: | 4032 | found_mapped_buffer: |
@@ -3903,7 +4049,7 @@ found_mapped_buffer: | |||
3903 | end++; | 4049 | end++; |
3904 | } while (bh != head); | 4050 | } while (bh != head); |
3905 | 4051 | ||
3906 | for (index = 1; index < ret; index++) { | 4052 | for (; index < ret; index++) { |
3907 | if (!page_has_buffers(pages[index])) { | 4053 | if (!page_has_buffers(pages[index])) { |
3908 | bh = NULL; | 4054 | bh = NULL; |
3909 | break; | 4055 | break; |
@@ -3913,8 +4059,10 @@ found_mapped_buffer: | |||
3913 | bh = NULL; | 4059 | bh = NULL; |
3914 | break; | 4060 | break; |
3915 | } | 4061 | } |
4062 | |||
3916 | if (pages[index]->index != | 4063 | if (pages[index]->index != |
3917 | pages[0]->index + index) { | 4064 | pages[start_index]->index + index |
4065 | - start_index) { | ||
3918 | /* Blocks are not contiguous. */ | 4066 | /* Blocks are not contiguous. */ |
3919 | bh = NULL; | 4067 | bh = NULL; |
3920 | break; | 4068 | break; |
@@ -4006,6 +4154,177 @@ static int ext4_xattr_fiemap(struct inode *inode, | |||
4006 | return (error < 0 ? error : 0); | 4154 | return (error < 0 ? error : 0); |
4007 | } | 4155 | } |
4008 | 4156 | ||
4157 | /* | ||
4158 | * ext4_ext_punch_hole | ||
4159 | * | ||
4160 | * Punches a hole of "length" bytes in a file starting | ||
4161 | * at byte "offset" | ||
4162 | * | ||
4163 | * @inode: The inode of the file to punch a hole in | ||
4164 | * @offset: The starting byte offset of the hole | ||
4165 | * @length: The length of the hole | ||
4166 | * | ||
4167 | * Returns the number of blocks removed or negative on err | ||
4168 | */ | ||
4169 | int ext4_ext_punch_hole(struct file *file, loff_t offset, loff_t length) | ||
4170 | { | ||
4171 | struct inode *inode = file->f_path.dentry->d_inode; | ||
4172 | struct super_block *sb = inode->i_sb; | ||
4173 | struct ext4_ext_cache cache_ex; | ||
4174 | ext4_lblk_t first_block, last_block, num_blocks, iblock, max_blocks; | ||
4175 | struct address_space *mapping = inode->i_mapping; | ||
4176 | struct ext4_map_blocks map; | ||
4177 | handle_t *handle; | ||
4178 | loff_t first_block_offset, last_block_offset, block_len; | ||
4179 | loff_t first_page, last_page, first_page_offset, last_page_offset; | ||
4180 | int ret, credits, blocks_released, err = 0; | ||
4181 | |||
4182 | first_block = (offset + sb->s_blocksize - 1) >> | ||
4183 | EXT4_BLOCK_SIZE_BITS(sb); | ||
4184 | last_block = (offset + length) >> EXT4_BLOCK_SIZE_BITS(sb); | ||
4185 | |||
4186 | first_block_offset = first_block << EXT4_BLOCK_SIZE_BITS(sb); | ||
4187 | last_block_offset = last_block << EXT4_BLOCK_SIZE_BITS(sb); | ||
4188 | |||
4189 | first_page = (offset + PAGE_CACHE_SIZE - 1) >> PAGE_CACHE_SHIFT; | ||
4190 | last_page = (offset + length) >> PAGE_CACHE_SHIFT; | ||
4191 | |||
4192 | first_page_offset = first_page << PAGE_CACHE_SHIFT; | ||
4193 | last_page_offset = last_page << PAGE_CACHE_SHIFT; | ||
4194 | |||
4195 | /* | ||
4196 | * Write out all dirty pages to avoid race conditions | ||
4197 | * Then release them. | ||
4198 | */ | ||
4199 | if (mapping->nrpages && mapping_tagged(mapping, PAGECACHE_TAG_DIRTY)) { | ||
4200 | err = filemap_write_and_wait_range(mapping, | ||
4201 | first_page_offset == 0 ? 0 : first_page_offset-1, | ||
4202 | last_page_offset); | ||
4203 | |||
4204 | if (err) | ||
4205 | return err; | ||
4206 | } | ||
4207 | |||
4208 | /* Now release the pages */ | ||
4209 | if (last_page_offset > first_page_offset) { | ||
4210 | truncate_inode_pages_range(mapping, first_page_offset, | ||
4211 | last_page_offset-1); | ||
4212 | } | ||
4213 | |||
4214 | /* finish any pending end_io work */ | ||
4215 | ext4_flush_completed_IO(inode); | ||
4216 | |||
4217 | credits = ext4_writepage_trans_blocks(inode); | ||
4218 | handle = ext4_journal_start(inode, credits); | ||
4219 | if (IS_ERR(handle)) | ||
4220 | return PTR_ERR(handle); | ||
4221 | |||
4222 | err = ext4_orphan_add(handle, inode); | ||
4223 | if (err) | ||
4224 | goto out; | ||
4225 | |||
4226 | /* | ||
4227 | * Now we need to zero out the un block aligned data. | ||
4228 | * If the file is smaller than a block, just | ||
4229 | * zero out the middle | ||
4230 | */ | ||
4231 | if (first_block > last_block) | ||
4232 | ext4_block_zero_page_range(handle, mapping, offset, length); | ||
4233 | else { | ||
4234 | /* zero out the head of the hole before the first block */ | ||
4235 | block_len = first_block_offset - offset; | ||
4236 | if (block_len > 0) | ||
4237 | ext4_block_zero_page_range(handle, mapping, | ||
4238 | offset, block_len); | ||
4239 | |||
4240 | /* zero out the tail of the hole after the last block */ | ||
4241 | block_len = offset + length - last_block_offset; | ||
4242 | if (block_len > 0) { | ||
4243 | ext4_block_zero_page_range(handle, mapping, | ||
4244 | last_block_offset, block_len); | ||
4245 | } | ||
4246 | } | ||
4247 | |||
4248 | /* If there are no blocks to remove, return now */ | ||
4249 | if (first_block >= last_block) | ||
4250 | goto out; | ||
4251 | |||
4252 | down_write(&EXT4_I(inode)->i_data_sem); | ||
4253 | ext4_ext_invalidate_cache(inode); | ||
4254 | ext4_discard_preallocations(inode); | ||
4255 | |||
4256 | /* | ||
4257 | * Loop over all the blocks and identify blocks | ||
4258 | * that need to be punched out | ||
4259 | */ | ||
4260 | iblock = first_block; | ||
4261 | blocks_released = 0; | ||
4262 | while (iblock < last_block) { | ||
4263 | max_blocks = last_block - iblock; | ||
4264 | num_blocks = 1; | ||
4265 | memset(&map, 0, sizeof(map)); | ||
4266 | map.m_lblk = iblock; | ||
4267 | map.m_len = max_blocks; | ||
4268 | ret = ext4_ext_map_blocks(handle, inode, &map, | ||
4269 | EXT4_GET_BLOCKS_PUNCH_OUT_EXT); | ||
4270 | |||
4271 | if (ret > 0) { | ||
4272 | blocks_released += ret; | ||
4273 | num_blocks = ret; | ||
4274 | } else if (ret == 0) { | ||
4275 | /* | ||
4276 | * If map blocks could not find the block, | ||
4277 | * then it is in a hole. If the hole was | ||
4278 | * not already cached, then map blocks should | ||
4279 | * put it in the cache. So we can get the hole | ||
4280 | * out of the cache | ||
4281 | */ | ||
4282 | memset(&cache_ex, 0, sizeof(cache_ex)); | ||
4283 | if ((ext4_ext_check_cache(inode, iblock, &cache_ex)) && | ||
4284 | !cache_ex.ec_start) { | ||
4285 | |||
4286 | /* The hole is cached */ | ||
4287 | num_blocks = cache_ex.ec_block + | ||
4288 | cache_ex.ec_len - iblock; | ||
4289 | |||
4290 | } else { | ||
4291 | /* The block could not be identified */ | ||
4292 | err = -EIO; | ||
4293 | break; | ||
4294 | } | ||
4295 | } else { | ||
4296 | /* Map blocks error */ | ||
4297 | err = ret; | ||
4298 | break; | ||
4299 | } | ||
4300 | |||
4301 | if (num_blocks == 0) { | ||
4302 | /* This condition should never happen */ | ||
4303 | ext_debug("Block lookup failed"); | ||
4304 | err = -EIO; | ||
4305 | break; | ||
4306 | } | ||
4307 | |||
4308 | iblock += num_blocks; | ||
4309 | } | ||
4310 | |||
4311 | if (blocks_released > 0) { | ||
4312 | ext4_ext_invalidate_cache(inode); | ||
4313 | ext4_discard_preallocations(inode); | ||
4314 | } | ||
4315 | |||
4316 | if (IS_SYNC(inode)) | ||
4317 | ext4_handle_sync(handle); | ||
4318 | |||
4319 | up_write(&EXT4_I(inode)->i_data_sem); | ||
4320 | |||
4321 | out: | ||
4322 | ext4_orphan_del(handle, inode); | ||
4323 | inode->i_mtime = inode->i_ctime = ext4_current_time(inode); | ||
4324 | ext4_mark_inode_dirty(handle, inode); | ||
4325 | ext4_journal_stop(handle); | ||
4326 | return err; | ||
4327 | } | ||
4009 | int ext4_fiemap(struct inode *inode, struct fiemap_extent_info *fieinfo, | 4328 | int ext4_fiemap(struct inode *inode, struct fiemap_extent_info *fieinfo, |
4010 | __u64 start, __u64 len) | 4329 | __u64 start, __u64 len) |
4011 | { | 4330 | { |
@@ -4042,4 +4361,3 @@ int ext4_fiemap(struct inode *inode, struct fiemap_extent_info *fieinfo, | |||
4042 | 4361 | ||
4043 | return error; | 4362 | return error; |
4044 | } | 4363 | } |
4045 | |||