2 * Copyright (c) 2003-2006, Cluster File Systems, Inc, info@clusterfs.com
3 * Written by Alex Tomas <alex@clusterfs.com>
5 * Architecture independence:
6 * Copyright (c) 2005, Bull S.A.
7 * Written by Pierre Peiffer <pierre.peiffer@bull.net>
9 * This program is free software; you can redistribute it and/or modify
10 * it under the terms of the GNU General Public License version 2 as
11 * published by the Free Software Foundation.
13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details.
18 * You should have received a copy of the GNU General Public Licens
19 * along with this program; if not, write to the Free Software
20 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-
24 * Extents support for EXT4
27 * - ext4*_error() should be used in some situations
28 * - analyze all BUG()/BUG_ON(), use -EIO where appropriate
29 * - smart tree reduction
33 #include <linux/time.h>
34 #include <linux/jbd2.h>
35 #include <linux/highuid.h>
36 #include <linux/pagemap.h>
37 #include <linux/quotaops.h>
38 #include <linux/string.h>
39 #include <linux/slab.h>
40 #include <linux/falloc.h>
41 #include <asm/uaccess.h>
42 #include <linux/fiemap.h>
43 #include "ext4_jbd2.h"
44 #include "ext4_extents.h"
47 #include <trace/events/ext4.h>
50 * used by extent splitting.
52 #define EXT4_EXT_MAY_ZEROOUT 0x1 /* safe to zeroout if split fails \
54 #define EXT4_EXT_MARK_UNINIT1 0x2 /* mark first half uninitialized */
55 #define EXT4_EXT_MARK_UNINIT2 0x4 /* mark second half uninitialized */
57 #define EXT4_EXT_DATA_VALID1 0x8 /* first half contains valid data */
58 #define EXT4_EXT_DATA_VALID2 0x10 /* second half contains valid data */
60 static __le32 ext4_extent_block_csum(struct inode *inode,
61 struct ext4_extent_header *eh)
63 struct ext4_inode_info *ei = EXT4_I(inode);
64 struct ext4_sb_info *sbi = EXT4_SB(inode->i_sb);
67 csum = ext4_chksum(sbi, ei->i_csum_seed, (__u8 *)eh,
68 EXT4_EXTENT_TAIL_OFFSET(eh));
69 return cpu_to_le32(csum);
72 static int ext4_extent_block_csum_verify(struct inode *inode,
73 struct ext4_extent_header *eh)
75 struct ext4_extent_tail *et;
77 if (!EXT4_HAS_RO_COMPAT_FEATURE(inode->i_sb,
78 EXT4_FEATURE_RO_COMPAT_METADATA_CSUM))
81 et = find_ext4_extent_tail(eh);
82 if (et->et_checksum != ext4_extent_block_csum(inode, eh))
87 static void ext4_extent_block_csum_set(struct inode *inode,
88 struct ext4_extent_header *eh)
90 struct ext4_extent_tail *et;
92 if (!EXT4_HAS_RO_COMPAT_FEATURE(inode->i_sb,
93 EXT4_FEATURE_RO_COMPAT_METADATA_CSUM))
96 et = find_ext4_extent_tail(eh);
97 et->et_checksum = ext4_extent_block_csum(inode, eh);
100 static int ext4_split_extent(handle_t *handle,
102 struct ext4_ext_path *path,
103 struct ext4_map_blocks *map,
107 static int ext4_split_extent_at(handle_t *handle,
109 struct ext4_ext_path *path,
114 static int ext4_find_delayed_extent(struct inode *inode,
115 struct extent_status *newes);
117 static int ext4_ext_truncate_extend_restart(handle_t *handle,
123 if (!ext4_handle_valid(handle))
125 if (handle->h_buffer_credits > needed)
127 err = ext4_journal_extend(handle, needed);
130 err = ext4_truncate_restart_trans(handle, inode, needed);
142 static int ext4_ext_get_access(handle_t *handle, struct inode *inode,
143 struct ext4_ext_path *path)
146 /* path points to block */
147 return ext4_journal_get_write_access(handle, path->p_bh);
149 /* path points to leaf/index in inode body */
150 /* we use in-core data, no need to protect them */
160 int __ext4_ext_dirty(const char *where, unsigned int line, handle_t *handle,
161 struct inode *inode, struct ext4_ext_path *path)
165 ext4_extent_block_csum_set(inode, ext_block_hdr(path->p_bh));
166 /* path points to block */
167 err = __ext4_handle_dirty_metadata(where, line, handle,
170 /* path points to leaf/index in inode body */
171 err = ext4_mark_inode_dirty(handle, inode);
176 static ext4_fsblk_t ext4_ext_find_goal(struct inode *inode,
177 struct ext4_ext_path *path,
181 int depth = path->p_depth;
182 struct ext4_extent *ex;
185 * Try to predict block placement assuming that we are
186 * filling in a file which will eventually be
187 * non-sparse --- i.e., in the case of libbfd writing
188 * an ELF object sections out-of-order but in a way
189 * the eventually results in a contiguous object or
190 * executable file, or some database extending a table
191 * space file. However, this is actually somewhat
192 * non-ideal if we are writing a sparse file such as
193 * qemu or KVM writing a raw image file that is going
194 * to stay fairly sparse, since it will end up
195 * fragmenting the file system's free space. Maybe we
196 * should have some hueristics or some way to allow
197 * userspace to pass a hint to file system,
198 * especially if the latter case turns out to be
201 ex = path[depth].p_ext;
203 ext4_fsblk_t ext_pblk = ext4_ext_pblock(ex);
204 ext4_lblk_t ext_block = le32_to_cpu(ex->ee_block);
206 if (block > ext_block)
207 return ext_pblk + (block - ext_block);
209 return ext_pblk - (ext_block - block);
212 /* it looks like index is empty;
213 * try to find starting block from index itself */
214 if (path[depth].p_bh)
215 return path[depth].p_bh->b_blocknr;
218 /* OK. use inode's group */
219 return ext4_inode_to_goal_block(inode);
223 * Allocation for a meta data block
226 ext4_ext_new_meta_block(handle_t *handle, struct inode *inode,
227 struct ext4_ext_path *path,
228 struct ext4_extent *ex, int *err, unsigned int flags)
230 ext4_fsblk_t goal, newblock;
232 goal = ext4_ext_find_goal(inode, path, le32_to_cpu(ex->ee_block));
233 newblock = ext4_new_meta_blocks(handle, inode, goal, flags,
238 static inline int ext4_ext_space_block(struct inode *inode, int check)
242 size = (inode->i_sb->s_blocksize - sizeof(struct ext4_extent_header))
243 / sizeof(struct ext4_extent);
244 #ifdef AGGRESSIVE_TEST
245 if (!check && size > 6)
251 static inline int ext4_ext_space_block_idx(struct inode *inode, int check)
255 size = (inode->i_sb->s_blocksize - sizeof(struct ext4_extent_header))
256 / sizeof(struct ext4_extent_idx);
257 #ifdef AGGRESSIVE_TEST
258 if (!check && size > 5)
264 static inline int ext4_ext_space_root(struct inode *inode, int check)
268 size = sizeof(EXT4_I(inode)->i_data);
269 size -= sizeof(struct ext4_extent_header);
270 size /= sizeof(struct ext4_extent);
271 #ifdef AGGRESSIVE_TEST
272 if (!check && size > 3)
278 static inline int ext4_ext_space_root_idx(struct inode *inode, int check)
282 size = sizeof(EXT4_I(inode)->i_data);
283 size -= sizeof(struct ext4_extent_header);
284 size /= sizeof(struct ext4_extent_idx);
285 #ifdef AGGRESSIVE_TEST
286 if (!check && size > 4)
293 * Calculate the number of metadata blocks needed
294 * to allocate @blocks
295 * Worse case is one block per extent
297 int ext4_ext_calc_metadata_amount(struct inode *inode, ext4_lblk_t lblock)
299 struct ext4_inode_info *ei = EXT4_I(inode);
302 idxs = ((inode->i_sb->s_blocksize - sizeof(struct ext4_extent_header))
303 / sizeof(struct ext4_extent_idx));
306 * If the new delayed allocation block is contiguous with the
307 * previous da block, it can share index blocks with the
308 * previous block, so we only need to allocate a new index
309 * block every idxs leaf blocks. At ldxs**2 blocks, we need
310 * an additional index block, and at ldxs**3 blocks, yet
311 * another index blocks.
313 if (ei->i_da_metadata_calc_len &&
314 ei->i_da_metadata_calc_last_lblock+1 == lblock) {
317 if ((ei->i_da_metadata_calc_len % idxs) == 0)
319 if ((ei->i_da_metadata_calc_len % (idxs*idxs)) == 0)
321 if ((ei->i_da_metadata_calc_len % (idxs*idxs*idxs)) == 0) {
323 ei->i_da_metadata_calc_len = 0;
325 ei->i_da_metadata_calc_len++;
326 ei->i_da_metadata_calc_last_lblock++;
331 * In the worst case we need a new set of index blocks at
332 * every level of the inode's extent tree.
334 ei->i_da_metadata_calc_len = 1;
335 ei->i_da_metadata_calc_last_lblock = lblock;
336 return ext_depth(inode) + 1;
340 ext4_ext_max_entries(struct inode *inode, int depth)
344 if (depth == ext_depth(inode)) {
346 max = ext4_ext_space_root(inode, 1);
348 max = ext4_ext_space_root_idx(inode, 1);
351 max = ext4_ext_space_block(inode, 1);
353 max = ext4_ext_space_block_idx(inode, 1);
359 static int ext4_valid_extent(struct inode *inode, struct ext4_extent *ext)
361 ext4_fsblk_t block = ext4_ext_pblock(ext);
362 int len = ext4_ext_get_actual_len(ext);
363 ext4_lblk_t lblock = le32_to_cpu(ext->ee_block);
364 ext4_lblk_t last = lblock + len - 1;
368 return ext4_data_block_valid(EXT4_SB(inode->i_sb), block, len);
371 static int ext4_valid_extent_idx(struct inode *inode,
372 struct ext4_extent_idx *ext_idx)
374 ext4_fsblk_t block = ext4_idx_pblock(ext_idx);
376 return ext4_data_block_valid(EXT4_SB(inode->i_sb), block, 1);
379 static int ext4_valid_extent_entries(struct inode *inode,
380 struct ext4_extent_header *eh,
383 unsigned short entries;
384 if (eh->eh_entries == 0)
387 entries = le16_to_cpu(eh->eh_entries);
391 struct ext4_extent *ext = EXT_FIRST_EXTENT(eh);
392 struct ext4_super_block *es = EXT4_SB(inode->i_sb)->s_es;
393 ext4_fsblk_t pblock = 0;
394 ext4_lblk_t lblock = 0;
395 ext4_lblk_t prev = 0;
398 if (!ext4_valid_extent(inode, ext))
401 /* Check for overlapping extents */
402 lblock = le32_to_cpu(ext->ee_block);
403 len = ext4_ext_get_actual_len(ext);
404 if ((lblock <= prev) && prev) {
405 pblock = ext4_ext_pblock(ext);
406 es->s_last_error_block = cpu_to_le64(pblock);
411 prev = lblock + len - 1;
414 struct ext4_extent_idx *ext_idx = EXT_FIRST_INDEX(eh);
416 if (!ext4_valid_extent_idx(inode, ext_idx))
425 static int __ext4_ext_check(const char *function, unsigned int line,
426 struct inode *inode, struct ext4_extent_header *eh,
429 const char *error_msg;
432 if (unlikely(eh->eh_magic != EXT4_EXT_MAGIC)) {
433 error_msg = "invalid magic";
436 if (unlikely(le16_to_cpu(eh->eh_depth) != depth)) {
437 error_msg = "unexpected eh_depth";
440 if (unlikely(eh->eh_max == 0)) {
441 error_msg = "invalid eh_max";
444 max = ext4_ext_max_entries(inode, depth);
445 if (unlikely(le16_to_cpu(eh->eh_max) > max)) {
446 error_msg = "too large eh_max";
449 if (unlikely(le16_to_cpu(eh->eh_entries) > le16_to_cpu(eh->eh_max))) {
450 error_msg = "invalid eh_entries";
453 if (!ext4_valid_extent_entries(inode, eh, depth)) {
454 error_msg = "invalid extent entries";
457 /* Verify checksum on non-root extent tree nodes */
458 if (ext_depth(inode) != depth &&
459 !ext4_extent_block_csum_verify(inode, eh)) {
460 error_msg = "extent tree corrupted";
466 ext4_error_inode(inode, function, line, 0,
467 "bad header/extent: %s - magic %x, "
468 "entries %u, max %u(%u), depth %u(%u)",
469 error_msg, le16_to_cpu(eh->eh_magic),
470 le16_to_cpu(eh->eh_entries), le16_to_cpu(eh->eh_max),
471 max, le16_to_cpu(eh->eh_depth), depth);
476 #define ext4_ext_check(inode, eh, depth) \
477 __ext4_ext_check(__func__, __LINE__, inode, eh, depth)
479 int ext4_ext_check_inode(struct inode *inode)
481 return ext4_ext_check(inode, ext_inode_hdr(inode), ext_depth(inode));
484 static int __ext4_ext_check_block(const char *function, unsigned int line,
486 struct ext4_extent_header *eh,
488 struct buffer_head *bh)
492 if (buffer_verified(bh))
494 ret = ext4_ext_check(inode, eh, depth);
497 set_buffer_verified(bh);
501 #define ext4_ext_check_block(inode, eh, depth, bh) \
502 __ext4_ext_check_block(__func__, __LINE__, inode, eh, depth, bh)
505 static void ext4_ext_show_path(struct inode *inode, struct ext4_ext_path *path)
507 int k, l = path->p_depth;
510 for (k = 0; k <= l; k++, path++) {
512 ext_debug(" %d->%llu", le32_to_cpu(path->p_idx->ei_block),
513 ext4_idx_pblock(path->p_idx));
514 } else if (path->p_ext) {
515 ext_debug(" %d:[%d]%d:%llu ",
516 le32_to_cpu(path->p_ext->ee_block),
517 ext4_ext_is_uninitialized(path->p_ext),
518 ext4_ext_get_actual_len(path->p_ext),
519 ext4_ext_pblock(path->p_ext));
526 static void ext4_ext_show_leaf(struct inode *inode, struct ext4_ext_path *path)
528 int depth = ext_depth(inode);
529 struct ext4_extent_header *eh;
530 struct ext4_extent *ex;
536 eh = path[depth].p_hdr;
537 ex = EXT_FIRST_EXTENT(eh);
539 ext_debug("Displaying leaf extents for inode %lu\n", inode->i_ino);
541 for (i = 0; i < le16_to_cpu(eh->eh_entries); i++, ex++) {
542 ext_debug("%d:[%d]%d:%llu ", le32_to_cpu(ex->ee_block),
543 ext4_ext_is_uninitialized(ex),
544 ext4_ext_get_actual_len(ex), ext4_ext_pblock(ex));
549 static void ext4_ext_show_move(struct inode *inode, struct ext4_ext_path *path,
550 ext4_fsblk_t newblock, int level)
552 int depth = ext_depth(inode);
553 struct ext4_extent *ex;
555 if (depth != level) {
556 struct ext4_extent_idx *idx;
557 idx = path[level].p_idx;
558 while (idx <= EXT_MAX_INDEX(path[level].p_hdr)) {
559 ext_debug("%d: move %d:%llu in new index %llu\n", level,
560 le32_to_cpu(idx->ei_block),
561 ext4_idx_pblock(idx),
569 ex = path[depth].p_ext;
570 while (ex <= EXT_MAX_EXTENT(path[depth].p_hdr)) {
571 ext_debug("move %d:%llu:[%d]%d in new leaf %llu\n",
572 le32_to_cpu(ex->ee_block),
574 ext4_ext_is_uninitialized(ex),
575 ext4_ext_get_actual_len(ex),
582 #define ext4_ext_show_path(inode, path)
583 #define ext4_ext_show_leaf(inode, path)
584 #define ext4_ext_show_move(inode, path, newblock, level)
587 void ext4_ext_drop_refs(struct ext4_ext_path *path)
589 int depth = path->p_depth;
592 for (i = 0; i <= depth; i++, path++)
600 * ext4_ext_binsearch_idx:
601 * binary search for the closest index of the given block
602 * the header must be checked before calling this
605 ext4_ext_binsearch_idx(struct inode *inode,
606 struct ext4_ext_path *path, ext4_lblk_t block)
608 struct ext4_extent_header *eh = path->p_hdr;
609 struct ext4_extent_idx *r, *l, *m;
612 ext_debug("binsearch for %u(idx): ", block);
614 l = EXT_FIRST_INDEX(eh) + 1;
615 r = EXT_LAST_INDEX(eh);
618 if (block < le32_to_cpu(m->ei_block))
622 ext_debug("%p(%u):%p(%u):%p(%u) ", l, le32_to_cpu(l->ei_block),
623 m, le32_to_cpu(m->ei_block),
624 r, le32_to_cpu(r->ei_block));
628 ext_debug(" -> %u->%lld ", le32_to_cpu(path->p_idx->ei_block),
629 ext4_idx_pblock(path->p_idx));
631 #ifdef CHECK_BINSEARCH
633 struct ext4_extent_idx *chix, *ix;
636 chix = ix = EXT_FIRST_INDEX(eh);
637 for (k = 0; k < le16_to_cpu(eh->eh_entries); k++, ix++) {
639 le32_to_cpu(ix->ei_block) <= le32_to_cpu(ix[-1].ei_block)) {
640 printk(KERN_DEBUG "k=%d, ix=0x%p, "
642 ix, EXT_FIRST_INDEX(eh));
643 printk(KERN_DEBUG "%u <= %u\n",
644 le32_to_cpu(ix->ei_block),
645 le32_to_cpu(ix[-1].ei_block));
647 BUG_ON(k && le32_to_cpu(ix->ei_block)
648 <= le32_to_cpu(ix[-1].ei_block));
649 if (block < le32_to_cpu(ix->ei_block))
653 BUG_ON(chix != path->p_idx);
660 * ext4_ext_binsearch:
661 * binary search for closest extent of the given block
662 * the header must be checked before calling this
665 ext4_ext_binsearch(struct inode *inode,
666 struct ext4_ext_path *path, ext4_lblk_t block)
668 struct ext4_extent_header *eh = path->p_hdr;
669 struct ext4_extent *r, *l, *m;
671 if (eh->eh_entries == 0) {
673 * this leaf is empty:
674 * we get such a leaf in split/add case
679 ext_debug("binsearch for %u: ", block);
681 l = EXT_FIRST_EXTENT(eh) + 1;
682 r = EXT_LAST_EXTENT(eh);
686 if (block < le32_to_cpu(m->ee_block))
690 ext_debug("%p(%u):%p(%u):%p(%u) ", l, le32_to_cpu(l->ee_block),
691 m, le32_to_cpu(m->ee_block),
692 r, le32_to_cpu(r->ee_block));
696 ext_debug(" -> %d:%llu:[%d]%d ",
697 le32_to_cpu(path->p_ext->ee_block),
698 ext4_ext_pblock(path->p_ext),
699 ext4_ext_is_uninitialized(path->p_ext),
700 ext4_ext_get_actual_len(path->p_ext));
702 #ifdef CHECK_BINSEARCH
704 struct ext4_extent *chex, *ex;
707 chex = ex = EXT_FIRST_EXTENT(eh);
708 for (k = 0; k < le16_to_cpu(eh->eh_entries); k++, ex++) {
709 BUG_ON(k && le32_to_cpu(ex->ee_block)
710 <= le32_to_cpu(ex[-1].ee_block));
711 if (block < le32_to_cpu(ex->ee_block))
715 BUG_ON(chex != path->p_ext);
721 int ext4_ext_tree_init(handle_t *handle, struct inode *inode)
723 struct ext4_extent_header *eh;
725 eh = ext_inode_hdr(inode);
728 eh->eh_magic = EXT4_EXT_MAGIC;
729 eh->eh_max = cpu_to_le16(ext4_ext_space_root(inode, 0));
730 ext4_mark_inode_dirty(handle, inode);
734 struct ext4_ext_path *
735 ext4_ext_find_extent(struct inode *inode, ext4_lblk_t block,
736 struct ext4_ext_path *path)
738 struct ext4_extent_header *eh;
739 struct buffer_head *bh;
740 short int depth, i, ppos = 0, alloc = 0;
743 eh = ext_inode_hdr(inode);
744 depth = ext_depth(inode);
746 /* account possible depth increase */
748 path = kzalloc(sizeof(struct ext4_ext_path) * (depth + 2),
751 return ERR_PTR(-ENOMEM);
758 /* walk through the tree */
760 ext_debug("depth %d: num %d, max %d\n",
761 ppos, le16_to_cpu(eh->eh_entries), le16_to_cpu(eh->eh_max));
763 ext4_ext_binsearch_idx(inode, path + ppos, block);
764 path[ppos].p_block = ext4_idx_pblock(path[ppos].p_idx);
765 path[ppos].p_depth = i;
766 path[ppos].p_ext = NULL;
768 bh = sb_getblk(inode->i_sb, path[ppos].p_block);
773 if (!bh_uptodate_or_lock(bh)) {
774 trace_ext4_ext_load_extent(inode, block,
776 ret = bh_submit_read(bh);
782 eh = ext_block_hdr(bh);
784 if (unlikely(ppos > depth)) {
786 EXT4_ERROR_INODE(inode,
787 "ppos %d > depth %d", ppos, depth);
791 path[ppos].p_bh = bh;
792 path[ppos].p_hdr = eh;
795 ret = ext4_ext_check_block(inode, eh, i, bh);
800 path[ppos].p_depth = i;
801 path[ppos].p_ext = NULL;
802 path[ppos].p_idx = NULL;
805 ext4_ext_binsearch(inode, path + ppos, block);
806 /* if not an empty leaf */
807 if (path[ppos].p_ext)
808 path[ppos].p_block = ext4_ext_pblock(path[ppos].p_ext);
810 ext4_ext_show_path(inode, path);
815 ext4_ext_drop_refs(path);
822 * ext4_ext_insert_index:
823 * insert new index [@logical;@ptr] into the block at @curp;
824 * check where to insert: before @curp or after @curp
826 static int ext4_ext_insert_index(handle_t *handle, struct inode *inode,
827 struct ext4_ext_path *curp,
828 int logical, ext4_fsblk_t ptr)
830 struct ext4_extent_idx *ix;
833 err = ext4_ext_get_access(handle, inode, curp);
837 if (unlikely(logical == le32_to_cpu(curp->p_idx->ei_block))) {
838 EXT4_ERROR_INODE(inode,
839 "logical %d == ei_block %d!",
840 logical, le32_to_cpu(curp->p_idx->ei_block));
844 if (unlikely(le16_to_cpu(curp->p_hdr->eh_entries)
845 >= le16_to_cpu(curp->p_hdr->eh_max))) {
846 EXT4_ERROR_INODE(inode,
847 "eh_entries %d >= eh_max %d!",
848 le16_to_cpu(curp->p_hdr->eh_entries),
849 le16_to_cpu(curp->p_hdr->eh_max));
853 if (logical > le32_to_cpu(curp->p_idx->ei_block)) {
855 ext_debug("insert new index %d after: %llu\n", logical, ptr);
856 ix = curp->p_idx + 1;
859 ext_debug("insert new index %d before: %llu\n", logical, ptr);
863 len = EXT_LAST_INDEX(curp->p_hdr) - ix + 1;
866 ext_debug("insert new index %d: "
867 "move %d indices from 0x%p to 0x%p\n",
868 logical, len, ix, ix + 1);
869 memmove(ix + 1, ix, len * sizeof(struct ext4_extent_idx));
872 if (unlikely(ix > EXT_MAX_INDEX(curp->p_hdr))) {
873 EXT4_ERROR_INODE(inode, "ix > EXT_MAX_INDEX!");
877 ix->ei_block = cpu_to_le32(logical);
878 ext4_idx_store_pblock(ix, ptr);
879 le16_add_cpu(&curp->p_hdr->eh_entries, 1);
881 if (unlikely(ix > EXT_LAST_INDEX(curp->p_hdr))) {
882 EXT4_ERROR_INODE(inode, "ix > EXT_LAST_INDEX!");
886 err = ext4_ext_dirty(handle, inode, curp);
887 ext4_std_error(inode->i_sb, err);
894 * inserts new subtree into the path, using free index entry
896 * - allocates all needed blocks (new leaf and all intermediate index blocks)
897 * - makes decision where to split
898 * - moves remaining extents and index entries (right to the split point)
899 * into the newly allocated blocks
900 * - initializes subtree
902 static int ext4_ext_split(handle_t *handle, struct inode *inode,
904 struct ext4_ext_path *path,
905 struct ext4_extent *newext, int at)
907 struct buffer_head *bh = NULL;
908 int depth = ext_depth(inode);
909 struct ext4_extent_header *neh;
910 struct ext4_extent_idx *fidx;
912 ext4_fsblk_t newblock, oldblock;
914 ext4_fsblk_t *ablocks = NULL; /* array of allocated blocks */
917 /* make decision: where to split? */
918 /* FIXME: now decision is simplest: at current extent */
920 /* if current leaf will be split, then we should use
921 * border from split point */
922 if (unlikely(path[depth].p_ext > EXT_MAX_EXTENT(path[depth].p_hdr))) {
923 EXT4_ERROR_INODE(inode, "p_ext > EXT_MAX_EXTENT!");
926 if (path[depth].p_ext != EXT_MAX_EXTENT(path[depth].p_hdr)) {
927 border = path[depth].p_ext[1].ee_block;
928 ext_debug("leaf will be split."
929 " next leaf starts at %d\n",
930 le32_to_cpu(border));
932 border = newext->ee_block;
933 ext_debug("leaf will be added."
934 " next leaf starts at %d\n",
935 le32_to_cpu(border));
939 * If error occurs, then we break processing
940 * and mark filesystem read-only. index won't
941 * be inserted and tree will be in consistent
942 * state. Next mount will repair buffers too.
946 * Get array to track all allocated blocks.
947 * We need this to handle errors and free blocks
950 ablocks = kzalloc(sizeof(ext4_fsblk_t) * depth, GFP_NOFS);
954 /* allocate all needed blocks */
955 ext_debug("allocate %d blocks for indexes/leaf\n", depth - at);
956 for (a = 0; a < depth - at; a++) {
957 newblock = ext4_ext_new_meta_block(handle, inode, path,
958 newext, &err, flags);
961 ablocks[a] = newblock;
964 /* initialize new leaf */
965 newblock = ablocks[--a];
966 if (unlikely(newblock == 0)) {
967 EXT4_ERROR_INODE(inode, "newblock == 0!");
971 bh = sb_getblk(inode->i_sb, newblock);
978 err = ext4_journal_get_create_access(handle, bh);
982 neh = ext_block_hdr(bh);
984 neh->eh_max = cpu_to_le16(ext4_ext_space_block(inode, 0));
985 neh->eh_magic = EXT4_EXT_MAGIC;
988 /* move remainder of path[depth] to the new leaf */
989 if (unlikely(path[depth].p_hdr->eh_entries !=
990 path[depth].p_hdr->eh_max)) {
991 EXT4_ERROR_INODE(inode, "eh_entries %d != eh_max %d!",
992 path[depth].p_hdr->eh_entries,
993 path[depth].p_hdr->eh_max);
997 /* start copy from next extent */
998 m = EXT_MAX_EXTENT(path[depth].p_hdr) - path[depth].p_ext++;
999 ext4_ext_show_move(inode, path, newblock, depth);
1001 struct ext4_extent *ex;
1002 ex = EXT_FIRST_EXTENT(neh);
1003 memmove(ex, path[depth].p_ext, sizeof(struct ext4_extent) * m);
1004 le16_add_cpu(&neh->eh_entries, m);
1007 ext4_extent_block_csum_set(inode, neh);
1008 set_buffer_uptodate(bh);
1011 err = ext4_handle_dirty_metadata(handle, inode, bh);
1017 /* correct old leaf */
1019 err = ext4_ext_get_access(handle, inode, path + depth);
1022 le16_add_cpu(&path[depth].p_hdr->eh_entries, -m);
1023 err = ext4_ext_dirty(handle, inode, path + depth);
1029 /* create intermediate indexes */
1031 if (unlikely(k < 0)) {
1032 EXT4_ERROR_INODE(inode, "k %d < 0!", k);
1037 ext_debug("create %d intermediate indices\n", k);
1038 /* insert new index into current index block */
1039 /* current depth stored in i var */
1042 oldblock = newblock;
1043 newblock = ablocks[--a];
1044 bh = sb_getblk(inode->i_sb, newblock);
1045 if (unlikely(!bh)) {
1051 err = ext4_journal_get_create_access(handle, bh);
1055 neh = ext_block_hdr(bh);
1056 neh->eh_entries = cpu_to_le16(1);
1057 neh->eh_magic = EXT4_EXT_MAGIC;
1058 neh->eh_max = cpu_to_le16(ext4_ext_space_block_idx(inode, 0));
1059 neh->eh_depth = cpu_to_le16(depth - i);
1060 fidx = EXT_FIRST_INDEX(neh);
1061 fidx->ei_block = border;
1062 ext4_idx_store_pblock(fidx, oldblock);
1064 ext_debug("int.index at %d (block %llu): %u -> %llu\n",
1065 i, newblock, le32_to_cpu(border), oldblock);
1067 /* move remainder of path[i] to the new index block */
1068 if (unlikely(EXT_MAX_INDEX(path[i].p_hdr) !=
1069 EXT_LAST_INDEX(path[i].p_hdr))) {
1070 EXT4_ERROR_INODE(inode,
1071 "EXT_MAX_INDEX != EXT_LAST_INDEX ee_block %d!",
1072 le32_to_cpu(path[i].p_ext->ee_block));
1076 /* start copy indexes */
1077 m = EXT_MAX_INDEX(path[i].p_hdr) - path[i].p_idx++;
1078 ext_debug("cur 0x%p, last 0x%p\n", path[i].p_idx,
1079 EXT_MAX_INDEX(path[i].p_hdr));
1080 ext4_ext_show_move(inode, path, newblock, i);
1082 memmove(++fidx, path[i].p_idx,
1083 sizeof(struct ext4_extent_idx) * m);
1084 le16_add_cpu(&neh->eh_entries, m);
1086 ext4_extent_block_csum_set(inode, neh);
1087 set_buffer_uptodate(bh);
1090 err = ext4_handle_dirty_metadata(handle, inode, bh);
1096 /* correct old index */
1098 err = ext4_ext_get_access(handle, inode, path + i);
1101 le16_add_cpu(&path[i].p_hdr->eh_entries, -m);
1102 err = ext4_ext_dirty(handle, inode, path + i);
1110 /* insert new index */
1111 err = ext4_ext_insert_index(handle, inode, path + at,
1112 le32_to_cpu(border), newblock);
1116 if (buffer_locked(bh))
1122 /* free all allocated blocks in error case */
1123 for (i = 0; i < depth; i++) {
1126 ext4_free_blocks(handle, inode, NULL, ablocks[i], 1,
1127 EXT4_FREE_BLOCKS_METADATA);
1136 * ext4_ext_grow_indepth:
1137 * implements tree growing procedure:
1138 * - allocates new block
1139 * - moves top-level data (index block or leaf) into the new block
1140 * - initializes new top-level, creating index that points to the
1141 * just created block
1143 static int ext4_ext_grow_indepth(handle_t *handle, struct inode *inode,
1145 struct ext4_extent *newext)
1147 struct ext4_extent_header *neh;
1148 struct buffer_head *bh;
1149 ext4_fsblk_t newblock;
1152 newblock = ext4_ext_new_meta_block(handle, inode, NULL,
1153 newext, &err, flags);
1157 bh = sb_getblk(inode->i_sb, newblock);
1162 err = ext4_journal_get_create_access(handle, bh);
1168 /* move top-level index/leaf into new block */
1169 memmove(bh->b_data, EXT4_I(inode)->i_data,
1170 sizeof(EXT4_I(inode)->i_data));
1172 /* set size of new block */
1173 neh = ext_block_hdr(bh);
1174 /* old root could have indexes or leaves
1175 * so calculate e_max right way */
1176 if (ext_depth(inode))
1177 neh->eh_max = cpu_to_le16(ext4_ext_space_block_idx(inode, 0));
1179 neh->eh_max = cpu_to_le16(ext4_ext_space_block(inode, 0));
1180 neh->eh_magic = EXT4_EXT_MAGIC;
1181 ext4_extent_block_csum_set(inode, neh);
1182 set_buffer_uptodate(bh);
1185 err = ext4_handle_dirty_metadata(handle, inode, bh);
1189 /* Update top-level index: num,max,pointer */
1190 neh = ext_inode_hdr(inode);
1191 neh->eh_entries = cpu_to_le16(1);
1192 ext4_idx_store_pblock(EXT_FIRST_INDEX(neh), newblock);
1193 if (neh->eh_depth == 0) {
1194 /* Root extent block becomes index block */
1195 neh->eh_max = cpu_to_le16(ext4_ext_space_root_idx(inode, 0));
1196 EXT_FIRST_INDEX(neh)->ei_block =
1197 EXT_FIRST_EXTENT(neh)->ee_block;
1199 ext_debug("new root: num %d(%d), lblock %d, ptr %llu\n",
1200 le16_to_cpu(neh->eh_entries), le16_to_cpu(neh->eh_max),
1201 le32_to_cpu(EXT_FIRST_INDEX(neh)->ei_block),
1202 ext4_idx_pblock(EXT_FIRST_INDEX(neh)));
1204 le16_add_cpu(&neh->eh_depth, 1);
1205 ext4_mark_inode_dirty(handle, inode);
1213 * ext4_ext_create_new_leaf:
1214 * finds empty index and adds new leaf.
1215 * if no free index is found, then it requests in-depth growing.
1217 static int ext4_ext_create_new_leaf(handle_t *handle, struct inode *inode,
1219 struct ext4_ext_path *path,
1220 struct ext4_extent *newext)
1222 struct ext4_ext_path *curp;
1223 int depth, i, err = 0;
1226 i = depth = ext_depth(inode);
1228 /* walk up to the tree and look for free index entry */
1229 curp = path + depth;
1230 while (i > 0 && !EXT_HAS_FREE_INDEX(curp)) {
1235 /* we use already allocated block for index block,
1236 * so subsequent data blocks should be contiguous */
1237 if (EXT_HAS_FREE_INDEX(curp)) {
1238 /* if we found index with free entry, then use that
1239 * entry: create all needed subtree and add new leaf */
1240 err = ext4_ext_split(handle, inode, flags, path, newext, i);
1245 ext4_ext_drop_refs(path);
1246 path = ext4_ext_find_extent(inode,
1247 (ext4_lblk_t)le32_to_cpu(newext->ee_block),
1250 err = PTR_ERR(path);
1252 /* tree is full, time to grow in depth */
1253 err = ext4_ext_grow_indepth(handle, inode, flags, newext);
1258 ext4_ext_drop_refs(path);
1259 path = ext4_ext_find_extent(inode,
1260 (ext4_lblk_t)le32_to_cpu(newext->ee_block),
1263 err = PTR_ERR(path);
1268 * only first (depth 0 -> 1) produces free space;
1269 * in all other cases we have to split the grown tree
1271 depth = ext_depth(inode);
1272 if (path[depth].p_hdr->eh_entries == path[depth].p_hdr->eh_max) {
1273 /* now we need to split */
1283 * search the closest allocated block to the left for *logical
1284 * and returns it at @logical + it's physical address at @phys
1285 * if *logical is the smallest allocated block, the function
1286 * returns 0 at @phys
1287 * return value contains 0 (success) or error code
1289 static int ext4_ext_search_left(struct inode *inode,
1290 struct ext4_ext_path *path,
1291 ext4_lblk_t *logical, ext4_fsblk_t *phys)
1293 struct ext4_extent_idx *ix;
1294 struct ext4_extent *ex;
1297 if (unlikely(path == NULL)) {
1298 EXT4_ERROR_INODE(inode, "path == NULL *logical %d!", *logical);
1301 depth = path->p_depth;
1304 if (depth == 0 && path->p_ext == NULL)
1307 /* usually extent in the path covers blocks smaller
1308 * then *logical, but it can be that extent is the
1309 * first one in the file */
1311 ex = path[depth].p_ext;
1312 ee_len = ext4_ext_get_actual_len(ex);
1313 if (*logical < le32_to_cpu(ex->ee_block)) {
1314 if (unlikely(EXT_FIRST_EXTENT(path[depth].p_hdr) != ex)) {
1315 EXT4_ERROR_INODE(inode,
1316 "EXT_FIRST_EXTENT != ex *logical %d ee_block %d!",
1317 *logical, le32_to_cpu(ex->ee_block));
1320 while (--depth >= 0) {
1321 ix = path[depth].p_idx;
1322 if (unlikely(ix != EXT_FIRST_INDEX(path[depth].p_hdr))) {
1323 EXT4_ERROR_INODE(inode,
1324 "ix (%d) != EXT_FIRST_INDEX (%d) (depth %d)!",
1325 ix != NULL ? le32_to_cpu(ix->ei_block) : 0,
1326 EXT_FIRST_INDEX(path[depth].p_hdr) != NULL ?
1327 le32_to_cpu(EXT_FIRST_INDEX(path[depth].p_hdr)->ei_block) : 0,
1335 if (unlikely(*logical < (le32_to_cpu(ex->ee_block) + ee_len))) {
1336 EXT4_ERROR_INODE(inode,
1337 "logical %d < ee_block %d + ee_len %d!",
1338 *logical, le32_to_cpu(ex->ee_block), ee_len);
1342 *logical = le32_to_cpu(ex->ee_block) + ee_len - 1;
1343 *phys = ext4_ext_pblock(ex) + ee_len - 1;
1348 * search the closest allocated block to the right for *logical
1349 * and returns it at @logical + it's physical address at @phys
1350 * if *logical is the largest allocated block, the function
1351 * returns 0 at @phys
1352 * return value contains 0 (success) or error code
1354 static int ext4_ext_search_right(struct inode *inode,
1355 struct ext4_ext_path *path,
1356 ext4_lblk_t *logical, ext4_fsblk_t *phys,
1357 struct ext4_extent **ret_ex)
1359 struct buffer_head *bh = NULL;
1360 struct ext4_extent_header *eh;
1361 struct ext4_extent_idx *ix;
1362 struct ext4_extent *ex;
1364 int depth; /* Note, NOT eh_depth; depth from top of tree */
1367 if (unlikely(path == NULL)) {
1368 EXT4_ERROR_INODE(inode, "path == NULL *logical %d!", *logical);
1371 depth = path->p_depth;
1374 if (depth == 0 && path->p_ext == NULL)
1377 /* usually extent in the path covers blocks smaller
1378 * then *logical, but it can be that extent is the
1379 * first one in the file */
1381 ex = path[depth].p_ext;
1382 ee_len = ext4_ext_get_actual_len(ex);
1383 if (*logical < le32_to_cpu(ex->ee_block)) {
1384 if (unlikely(EXT_FIRST_EXTENT(path[depth].p_hdr) != ex)) {
1385 EXT4_ERROR_INODE(inode,
1386 "first_extent(path[%d].p_hdr) != ex",
1390 while (--depth >= 0) {
1391 ix = path[depth].p_idx;
1392 if (unlikely(ix != EXT_FIRST_INDEX(path[depth].p_hdr))) {
1393 EXT4_ERROR_INODE(inode,
1394 "ix != EXT_FIRST_INDEX *logical %d!",
1402 if (unlikely(*logical < (le32_to_cpu(ex->ee_block) + ee_len))) {
1403 EXT4_ERROR_INODE(inode,
1404 "logical %d < ee_block %d + ee_len %d!",
1405 *logical, le32_to_cpu(ex->ee_block), ee_len);
1409 if (ex != EXT_LAST_EXTENT(path[depth].p_hdr)) {
1410 /* next allocated block in this leaf */
1415 /* go up and search for index to the right */
1416 while (--depth >= 0) {
1417 ix = path[depth].p_idx;
1418 if (ix != EXT_LAST_INDEX(path[depth].p_hdr))
1422 /* we've gone up to the root and found no index to the right */
1426 /* we've found index to the right, let's
1427 * follow it and find the closest allocated
1428 * block to the right */
1430 block = ext4_idx_pblock(ix);
1431 while (++depth < path->p_depth) {
1432 bh = sb_bread(inode->i_sb, block);
1435 eh = ext_block_hdr(bh);
1436 /* subtract from p_depth to get proper eh_depth */
1437 if (ext4_ext_check_block(inode, eh,
1438 path->p_depth - depth, bh)) {
1442 ix = EXT_FIRST_INDEX(eh);
1443 block = ext4_idx_pblock(ix);
1447 bh = sb_bread(inode->i_sb, block);
1450 eh = ext_block_hdr(bh);
1451 if (ext4_ext_check_block(inode, eh, path->p_depth - depth, bh)) {
1455 ex = EXT_FIRST_EXTENT(eh);
1457 *logical = le32_to_cpu(ex->ee_block);
1458 *phys = ext4_ext_pblock(ex);
1466 * ext4_ext_next_allocated_block:
1467 * returns allocated block in subsequent extent or EXT_MAX_BLOCKS.
1468 * NOTE: it considers block number from index entry as
1469 * allocated block. Thus, index entries have to be consistent
1473 ext4_ext_next_allocated_block(struct ext4_ext_path *path)
1477 BUG_ON(path == NULL);
1478 depth = path->p_depth;
1480 if (depth == 0 && path->p_ext == NULL)
1481 return EXT_MAX_BLOCKS;
1483 while (depth >= 0) {
1484 if (depth == path->p_depth) {
1486 if (path[depth].p_ext &&
1487 path[depth].p_ext !=
1488 EXT_LAST_EXTENT(path[depth].p_hdr))
1489 return le32_to_cpu(path[depth].p_ext[1].ee_block);
1492 if (path[depth].p_idx !=
1493 EXT_LAST_INDEX(path[depth].p_hdr))
1494 return le32_to_cpu(path[depth].p_idx[1].ei_block);
1499 return EXT_MAX_BLOCKS;
1503 * ext4_ext_next_leaf_block:
1504 * returns first allocated block from next leaf or EXT_MAX_BLOCKS
1506 static ext4_lblk_t ext4_ext_next_leaf_block(struct ext4_ext_path *path)
1510 BUG_ON(path == NULL);
1511 depth = path->p_depth;
1513 /* zero-tree has no leaf blocks at all */
1515 return EXT_MAX_BLOCKS;
1517 /* go to index block */
1520 while (depth >= 0) {
1521 if (path[depth].p_idx !=
1522 EXT_LAST_INDEX(path[depth].p_hdr))
1523 return (ext4_lblk_t)
1524 le32_to_cpu(path[depth].p_idx[1].ei_block);
1528 return EXT_MAX_BLOCKS;
1532 * ext4_ext_correct_indexes:
1533 * if leaf gets modified and modified extent is first in the leaf,
1534 * then we have to correct all indexes above.
1535 * TODO: do we need to correct tree in all cases?
1537 static int ext4_ext_correct_indexes(handle_t *handle, struct inode *inode,
1538 struct ext4_ext_path *path)
1540 struct ext4_extent_header *eh;
1541 int depth = ext_depth(inode);
1542 struct ext4_extent *ex;
1546 eh = path[depth].p_hdr;
1547 ex = path[depth].p_ext;
1549 if (unlikely(ex == NULL || eh == NULL)) {
1550 EXT4_ERROR_INODE(inode,
1551 "ex %p == NULL or eh %p == NULL", ex, eh);
1556 /* there is no tree at all */
1560 if (ex != EXT_FIRST_EXTENT(eh)) {
1561 /* we correct tree if first leaf got modified only */
1566 * TODO: we need correction if border is smaller than current one
1569 border = path[depth].p_ext->ee_block;
1570 err = ext4_ext_get_access(handle, inode, path + k);
1573 path[k].p_idx->ei_block = border;
1574 err = ext4_ext_dirty(handle, inode, path + k);
1579 /* change all left-side indexes */
1580 if (path[k+1].p_idx != EXT_FIRST_INDEX(path[k+1].p_hdr))
1582 err = ext4_ext_get_access(handle, inode, path + k);
1585 path[k].p_idx->ei_block = border;
1586 err = ext4_ext_dirty(handle, inode, path + k);
1595 ext4_can_extents_be_merged(struct inode *inode, struct ext4_extent *ex1,
1596 struct ext4_extent *ex2)
1598 unsigned short ext1_ee_len, ext2_ee_len, max_len;
1601 * Make sure that both extents are initialized. We don't merge
1602 * uninitialized extents so that we can be sure that end_io code has
1603 * the extent that was written properly split out and conversion to
1604 * initialized is trivial.
1606 if (ext4_ext_is_uninitialized(ex1) || ext4_ext_is_uninitialized(ex2))
1609 if (ext4_ext_is_uninitialized(ex1))
1610 max_len = EXT_UNINIT_MAX_LEN;
1612 max_len = EXT_INIT_MAX_LEN;
1614 ext1_ee_len = ext4_ext_get_actual_len(ex1);
1615 ext2_ee_len = ext4_ext_get_actual_len(ex2);
1617 if (le32_to_cpu(ex1->ee_block) + ext1_ee_len !=
1618 le32_to_cpu(ex2->ee_block))
1622 * To allow future support for preallocated extents to be added
1623 * as an RO_COMPAT feature, refuse to merge to extents if
1624 * this can result in the top bit of ee_len being set.
1626 if (ext1_ee_len + ext2_ee_len > max_len)
1628 #ifdef AGGRESSIVE_TEST
1629 if (ext1_ee_len >= 4)
1633 if (ext4_ext_pblock(ex1) + ext1_ee_len == ext4_ext_pblock(ex2))
1639 * This function tries to merge the "ex" extent to the next extent in the tree.
1640 * It always tries to merge towards right. If you want to merge towards
1641 * left, pass "ex - 1" as argument instead of "ex".
1642 * Returns 0 if the extents (ex and ex+1) were _not_ merged and returns
1643 * 1 if they got merged.
1645 static int ext4_ext_try_to_merge_right(struct inode *inode,
1646 struct ext4_ext_path *path,
1647 struct ext4_extent *ex)
1649 struct ext4_extent_header *eh;
1650 unsigned int depth, len;
1652 int uninitialized = 0;
1654 depth = ext_depth(inode);
1655 BUG_ON(path[depth].p_hdr == NULL);
1656 eh = path[depth].p_hdr;
1658 while (ex < EXT_LAST_EXTENT(eh)) {
1659 if (!ext4_can_extents_be_merged(inode, ex, ex + 1))
1661 /* merge with next extent! */
1662 if (ext4_ext_is_uninitialized(ex))
1664 ex->ee_len = cpu_to_le16(ext4_ext_get_actual_len(ex)
1665 + ext4_ext_get_actual_len(ex + 1));
1667 ext4_ext_mark_uninitialized(ex);
1669 if (ex + 1 < EXT_LAST_EXTENT(eh)) {
1670 len = (EXT_LAST_EXTENT(eh) - ex - 1)
1671 * sizeof(struct ext4_extent);
1672 memmove(ex + 1, ex + 2, len);
1674 le16_add_cpu(&eh->eh_entries, -1);
1676 WARN_ON(eh->eh_entries == 0);
1677 if (!eh->eh_entries)
1678 EXT4_ERROR_INODE(inode, "eh->eh_entries = 0!");
1685 * This function does a very simple check to see if we can collapse
1686 * an extent tree with a single extent tree leaf block into the inode.
1688 static void ext4_ext_try_to_merge_up(handle_t *handle,
1689 struct inode *inode,
1690 struct ext4_ext_path *path)
1693 unsigned max_root = ext4_ext_space_root(inode, 0);
1696 if ((path[0].p_depth != 1) ||
1697 (le16_to_cpu(path[0].p_hdr->eh_entries) != 1) ||
1698 (le16_to_cpu(path[1].p_hdr->eh_entries) > max_root))
1702 * We need to modify the block allocation bitmap and the block
1703 * group descriptor to release the extent tree block. If we
1704 * can't get the journal credits, give up.
1706 if (ext4_journal_extend(handle, 2))
1710 * Copy the extent data up to the inode
1712 blk = ext4_idx_pblock(path[0].p_idx);
1713 s = le16_to_cpu(path[1].p_hdr->eh_entries) *
1714 sizeof(struct ext4_extent_idx);
1715 s += sizeof(struct ext4_extent_header);
1717 memcpy(path[0].p_hdr, path[1].p_hdr, s);
1718 path[0].p_depth = 0;
1719 path[0].p_ext = EXT_FIRST_EXTENT(path[0].p_hdr) +
1720 (path[1].p_ext - EXT_FIRST_EXTENT(path[1].p_hdr));
1721 path[0].p_hdr->eh_max = cpu_to_le16(max_root);
1723 brelse(path[1].p_bh);
1724 ext4_free_blocks(handle, inode, NULL, blk, 1,
1725 EXT4_FREE_BLOCKS_METADATA | EXT4_FREE_BLOCKS_FORGET);
1729 * This function tries to merge the @ex extent to neighbours in the tree.
1730 * return 1 if merge left else 0.
1732 static void ext4_ext_try_to_merge(handle_t *handle,
1733 struct inode *inode,
1734 struct ext4_ext_path *path,
1735 struct ext4_extent *ex) {
1736 struct ext4_extent_header *eh;
1740 depth = ext_depth(inode);
1741 BUG_ON(path[depth].p_hdr == NULL);
1742 eh = path[depth].p_hdr;
1744 if (ex > EXT_FIRST_EXTENT(eh))
1745 merge_done = ext4_ext_try_to_merge_right(inode, path, ex - 1);
1748 (void) ext4_ext_try_to_merge_right(inode, path, ex);
1750 ext4_ext_try_to_merge_up(handle, inode, path);
1754 * check if a portion of the "newext" extent overlaps with an
1757 * If there is an overlap discovered, it updates the length of the newext
1758 * such that there will be no overlap, and then returns 1.
1759 * If there is no overlap found, it returns 0.
1761 static unsigned int ext4_ext_check_overlap(struct ext4_sb_info *sbi,
1762 struct inode *inode,
1763 struct ext4_extent *newext,
1764 struct ext4_ext_path *path)
1767 unsigned int depth, len1;
1768 unsigned int ret = 0;
1770 b1 = le32_to_cpu(newext->ee_block);
1771 len1 = ext4_ext_get_actual_len(newext);
1772 depth = ext_depth(inode);
1773 if (!path[depth].p_ext)
1775 b2 = le32_to_cpu(path[depth].p_ext->ee_block);
1776 b2 &= ~(sbi->s_cluster_ratio - 1);
1779 * get the next allocated block if the extent in the path
1780 * is before the requested block(s)
1783 b2 = ext4_ext_next_allocated_block(path);
1784 if (b2 == EXT_MAX_BLOCKS)
1786 b2 &= ~(sbi->s_cluster_ratio - 1);
1789 /* check for wrap through zero on extent logical start block*/
1790 if (b1 + len1 < b1) {
1791 len1 = EXT_MAX_BLOCKS - b1;
1792 newext->ee_len = cpu_to_le16(len1);
1796 /* check for overlap */
1797 if (b1 + len1 > b2) {
1798 newext->ee_len = cpu_to_le16(b2 - b1);
1806 * ext4_ext_insert_extent:
1807 * tries to merge requsted extent into the existing extent or
1808 * inserts requested extent as new one into the tree,
1809 * creating new leaf in the no-space case.
1811 int ext4_ext_insert_extent(handle_t *handle, struct inode *inode,
1812 struct ext4_ext_path *path,
1813 struct ext4_extent *newext, int flag)
1815 struct ext4_extent_header *eh;
1816 struct ext4_extent *ex, *fex;
1817 struct ext4_extent *nearex; /* nearest extent */
1818 struct ext4_ext_path *npath = NULL;
1819 int depth, len, err;
1821 unsigned uninitialized = 0;
1824 if (unlikely(ext4_ext_get_actual_len(newext) == 0)) {
1825 EXT4_ERROR_INODE(inode, "ext4_ext_get_actual_len(newext) == 0");
1828 depth = ext_depth(inode);
1829 ex = path[depth].p_ext;
1830 eh = path[depth].p_hdr;
1831 if (unlikely(path[depth].p_hdr == NULL)) {
1832 EXT4_ERROR_INODE(inode, "path[%d].p_hdr == NULL", depth);
1836 /* try to insert block into found extent and return */
1837 if (ex && !(flag & EXT4_GET_BLOCKS_PRE_IO)) {
1840 * Try to see whether we should rather test the extent on
1841 * right from ex, or from the left of ex. This is because
1842 * ext4_ext_find_extent() can return either extent on the
1843 * left, or on the right from the searched position. This
1844 * will make merging more effective.
1846 if (ex < EXT_LAST_EXTENT(eh) &&
1847 (le32_to_cpu(ex->ee_block) +
1848 ext4_ext_get_actual_len(ex) <
1849 le32_to_cpu(newext->ee_block))) {
1852 } else if ((ex > EXT_FIRST_EXTENT(eh)) &&
1853 (le32_to_cpu(newext->ee_block) +
1854 ext4_ext_get_actual_len(newext) <
1855 le32_to_cpu(ex->ee_block)))
1858 /* Try to append newex to the ex */
1859 if (ext4_can_extents_be_merged(inode, ex, newext)) {
1860 ext_debug("append [%d]%d block to %u:[%d]%d"
1862 ext4_ext_is_uninitialized(newext),
1863 ext4_ext_get_actual_len(newext),
1864 le32_to_cpu(ex->ee_block),
1865 ext4_ext_is_uninitialized(ex),
1866 ext4_ext_get_actual_len(ex),
1867 ext4_ext_pblock(ex));
1868 err = ext4_ext_get_access(handle, inode,
1874 * ext4_can_extents_be_merged should have checked
1875 * that either both extents are uninitialized, or
1876 * both aren't. Thus we need to check only one of
1879 if (ext4_ext_is_uninitialized(ex))
1881 ex->ee_len = cpu_to_le16(ext4_ext_get_actual_len(ex)
1882 + ext4_ext_get_actual_len(newext));
1884 ext4_ext_mark_uninitialized(ex);
1885 eh = path[depth].p_hdr;
1891 /* Try to prepend newex to the ex */
1892 if (ext4_can_extents_be_merged(inode, newext, ex)) {
1893 ext_debug("prepend %u[%d]%d block to %u:[%d]%d"
1895 le32_to_cpu(newext->ee_block),
1896 ext4_ext_is_uninitialized(newext),
1897 ext4_ext_get_actual_len(newext),
1898 le32_to_cpu(ex->ee_block),
1899 ext4_ext_is_uninitialized(ex),
1900 ext4_ext_get_actual_len(ex),
1901 ext4_ext_pblock(ex));
1902 err = ext4_ext_get_access(handle, inode,
1908 * ext4_can_extents_be_merged should have checked
1909 * that either both extents are uninitialized, or
1910 * both aren't. Thus we need to check only one of
1913 if (ext4_ext_is_uninitialized(ex))
1915 ex->ee_block = newext->ee_block;
1916 ext4_ext_store_pblock(ex, ext4_ext_pblock(newext));
1917 ex->ee_len = cpu_to_le16(ext4_ext_get_actual_len(ex)
1918 + ext4_ext_get_actual_len(newext));
1920 ext4_ext_mark_uninitialized(ex);
1921 eh = path[depth].p_hdr;
1927 depth = ext_depth(inode);
1928 eh = path[depth].p_hdr;
1929 if (le16_to_cpu(eh->eh_entries) < le16_to_cpu(eh->eh_max))
1932 /* probably next leaf has space for us? */
1933 fex = EXT_LAST_EXTENT(eh);
1934 next = EXT_MAX_BLOCKS;
1935 if (le32_to_cpu(newext->ee_block) > le32_to_cpu(fex->ee_block))
1936 next = ext4_ext_next_leaf_block(path);
1937 if (next != EXT_MAX_BLOCKS) {
1938 ext_debug("next leaf block - %u\n", next);
1939 BUG_ON(npath != NULL);
1940 npath = ext4_ext_find_extent(inode, next, NULL);
1942 return PTR_ERR(npath);
1943 BUG_ON(npath->p_depth != path->p_depth);
1944 eh = npath[depth].p_hdr;
1945 if (le16_to_cpu(eh->eh_entries) < le16_to_cpu(eh->eh_max)) {
1946 ext_debug("next leaf isn't full(%d)\n",
1947 le16_to_cpu(eh->eh_entries));
1951 ext_debug("next leaf has no free space(%d,%d)\n",
1952 le16_to_cpu(eh->eh_entries), le16_to_cpu(eh->eh_max));
1956 * There is no free space in the found leaf.
1957 * We're gonna add a new leaf in the tree.
1959 if (flag & EXT4_GET_BLOCKS_METADATA_NOFAIL)
1960 flags = EXT4_MB_USE_RESERVED;
1961 err = ext4_ext_create_new_leaf(handle, inode, flags, path, newext);
1964 depth = ext_depth(inode);
1965 eh = path[depth].p_hdr;
1968 nearex = path[depth].p_ext;
1970 err = ext4_ext_get_access(handle, inode, path + depth);
1975 /* there is no extent in this leaf, create first one */
1976 ext_debug("first extent in the leaf: %u:%llu:[%d]%d\n",
1977 le32_to_cpu(newext->ee_block),
1978 ext4_ext_pblock(newext),
1979 ext4_ext_is_uninitialized(newext),
1980 ext4_ext_get_actual_len(newext));
1981 nearex = EXT_FIRST_EXTENT(eh);
1983 if (le32_to_cpu(newext->ee_block)
1984 > le32_to_cpu(nearex->ee_block)) {
1986 ext_debug("insert %u:%llu:[%d]%d before: "
1988 le32_to_cpu(newext->ee_block),
1989 ext4_ext_pblock(newext),
1990 ext4_ext_is_uninitialized(newext),
1991 ext4_ext_get_actual_len(newext),
1996 BUG_ON(newext->ee_block == nearex->ee_block);
1997 ext_debug("insert %u:%llu:[%d]%d after: "
1999 le32_to_cpu(newext->ee_block),
2000 ext4_ext_pblock(newext),
2001 ext4_ext_is_uninitialized(newext),
2002 ext4_ext_get_actual_len(newext),
2005 len = EXT_LAST_EXTENT(eh) - nearex + 1;
2007 ext_debug("insert %u:%llu:[%d]%d: "
2008 "move %d extents from 0x%p to 0x%p\n",
2009 le32_to_cpu(newext->ee_block),
2010 ext4_ext_pblock(newext),
2011 ext4_ext_is_uninitialized(newext),
2012 ext4_ext_get_actual_len(newext),
2013 len, nearex, nearex + 1);
2014 memmove(nearex + 1, nearex,
2015 len * sizeof(struct ext4_extent));
2019 le16_add_cpu(&eh->eh_entries, 1);
2020 path[depth].p_ext = nearex;
2021 nearex->ee_block = newext->ee_block;
2022 ext4_ext_store_pblock(nearex, ext4_ext_pblock(newext));
2023 nearex->ee_len = newext->ee_len;
2026 /* try to merge extents */
2027 if (!(flag & EXT4_GET_BLOCKS_PRE_IO))
2028 ext4_ext_try_to_merge(handle, inode, path, nearex);
2031 /* time to correct all indexes above */
2032 err = ext4_ext_correct_indexes(handle, inode, path);
2036 err = ext4_ext_dirty(handle, inode, path + path->p_depth);
2040 ext4_ext_drop_refs(npath);
2046 static int ext4_fill_fiemap_extents(struct inode *inode,
2047 ext4_lblk_t block, ext4_lblk_t num,
2048 struct fiemap_extent_info *fieinfo)
2050 struct ext4_ext_path *path = NULL;
2051 struct ext4_extent *ex;
2052 struct extent_status es;
2053 ext4_lblk_t next, next_del, start = 0, end = 0;
2054 ext4_lblk_t last = block + num;
2055 int exists, depth = 0, err = 0;
2056 unsigned int flags = 0;
2057 unsigned char blksize_bits = inode->i_sb->s_blocksize_bits;
2059 while (block < last && block != EXT_MAX_BLOCKS) {
2061 /* find extent for this block */
2062 down_read(&EXT4_I(inode)->i_data_sem);
2064 if (path && ext_depth(inode) != depth) {
2065 /* depth was changed. we have to realloc path */
2070 path = ext4_ext_find_extent(inode, block, path);
2072 up_read(&EXT4_I(inode)->i_data_sem);
2073 err = PTR_ERR(path);
2078 depth = ext_depth(inode);
2079 if (unlikely(path[depth].p_hdr == NULL)) {
2080 up_read(&EXT4_I(inode)->i_data_sem);
2081 EXT4_ERROR_INODE(inode, "path[%d].p_hdr == NULL", depth);
2085 ex = path[depth].p_ext;
2086 next = ext4_ext_next_allocated_block(path);
2087 ext4_ext_drop_refs(path);
2092 /* there is no extent yet, so try to allocate
2093 * all requested space */
2096 } else if (le32_to_cpu(ex->ee_block) > block) {
2097 /* need to allocate space before found extent */
2099 end = le32_to_cpu(ex->ee_block);
2100 if (block + num < end)
2102 } else if (block >= le32_to_cpu(ex->ee_block)
2103 + ext4_ext_get_actual_len(ex)) {
2104 /* need to allocate space after found extent */
2109 } else if (block >= le32_to_cpu(ex->ee_block)) {
2111 * some part of requested space is covered
2115 end = le32_to_cpu(ex->ee_block)
2116 + ext4_ext_get_actual_len(ex);
2117 if (block + num < end)
2123 BUG_ON(end <= start);
2127 es.es_len = end - start;
2130 es.es_lblk = le32_to_cpu(ex->ee_block);
2131 es.es_len = ext4_ext_get_actual_len(ex);
2132 es.es_pblk = ext4_ext_pblock(ex);
2133 if (ext4_ext_is_uninitialized(ex))
2134 flags |= FIEMAP_EXTENT_UNWRITTEN;
2138 * Find delayed extent and update es accordingly. We call
2139 * it even in !exists case to find out whether es is the
2140 * last existing extent or not.
2142 next_del = ext4_find_delayed_extent(inode, &es);
2143 if (!exists && next_del) {
2145 flags |= FIEMAP_EXTENT_DELALLOC;
2147 up_read(&EXT4_I(inode)->i_data_sem);
2149 if (unlikely(es.es_len == 0)) {
2150 EXT4_ERROR_INODE(inode, "es.es_len == 0");
2156 * This is possible iff next == next_del == EXT_MAX_BLOCKS.
2157 * we need to check next == EXT_MAX_BLOCKS because it is
2158 * possible that an extent is with unwritten and delayed
2159 * status due to when an extent is delayed allocated and
2160 * is allocated by fallocate status tree will track both of
2163 * So we could return a unwritten and delayed extent, and
2164 * its block is equal to 'next'.
2166 if (next == next_del && next == EXT_MAX_BLOCKS) {
2167 flags |= FIEMAP_EXTENT_LAST;
2168 if (unlikely(next_del != EXT_MAX_BLOCKS ||
2169 next != EXT_MAX_BLOCKS)) {
2170 EXT4_ERROR_INODE(inode,
2171 "next extent == %u, next "
2172 "delalloc extent = %u",
2180 err = fiemap_fill_next_extent(fieinfo,
2181 (__u64)es.es_lblk << blksize_bits,
2182 (__u64)es.es_pblk << blksize_bits,
2183 (__u64)es.es_len << blksize_bits,
2193 block = es.es_lblk + es.es_len;
2197 ext4_ext_drop_refs(path);
2205 * ext4_ext_put_gap_in_cache:
2206 * calculate boundaries of the gap that the requested block fits into
2207 * and cache this gap
2210 ext4_ext_put_gap_in_cache(struct inode *inode, struct ext4_ext_path *path,
2213 int depth = ext_depth(inode);
2216 struct ext4_extent *ex;
2218 ex = path[depth].p_ext;
2221 * there is no extent yet, so gap is [0;-] and we
2224 ext_debug("cache gap(whole file):");
2225 } else if (block < le32_to_cpu(ex->ee_block)) {
2227 len = le32_to_cpu(ex->ee_block) - block;
2228 ext_debug("cache gap(before): %u [%u:%u]",
2230 le32_to_cpu(ex->ee_block),
2231 ext4_ext_get_actual_len(ex));
2232 if (!ext4_find_delalloc_range(inode, lblock, lblock + len - 1))
2233 ext4_es_insert_extent(inode, lblock, len, ~0,
2234 EXTENT_STATUS_HOLE);
2235 } else if (block >= le32_to_cpu(ex->ee_block)
2236 + ext4_ext_get_actual_len(ex)) {
2238 lblock = le32_to_cpu(ex->ee_block)
2239 + ext4_ext_get_actual_len(ex);
2241 next = ext4_ext_next_allocated_block(path);
2242 ext_debug("cache gap(after): [%u:%u] %u",
2243 le32_to_cpu(ex->ee_block),
2244 ext4_ext_get_actual_len(ex),
2246 BUG_ON(next == lblock);
2247 len = next - lblock;
2248 if (!ext4_find_delalloc_range(inode, lblock, lblock + len - 1))
2249 ext4_es_insert_extent(inode, lblock, len, ~0,
2250 EXTENT_STATUS_HOLE);
2256 ext_debug(" -> %u:%lu\n", lblock, len);
2261 * removes index from the index block.
2263 static int ext4_ext_rm_idx(handle_t *handle, struct inode *inode,
2264 struct ext4_ext_path *path, int depth)
2269 /* free index block */
2271 path = path + depth;
2272 leaf = ext4_idx_pblock(path->p_idx);
2273 if (unlikely(path->p_hdr->eh_entries == 0)) {
2274 EXT4_ERROR_INODE(inode, "path->p_hdr->eh_entries == 0");
2277 err = ext4_ext_get_access(handle, inode, path);
2281 if (path->p_idx != EXT_LAST_INDEX(path->p_hdr)) {
2282 int len = EXT_LAST_INDEX(path->p_hdr) - path->p_idx;
2283 len *= sizeof(struct ext4_extent_idx);
2284 memmove(path->p_idx, path->p_idx + 1, len);
2287 le16_add_cpu(&path->p_hdr->eh_entries, -1);
2288 err = ext4_ext_dirty(handle, inode, path);
2291 ext_debug("index is empty, remove it, free block %llu\n", leaf);
2292 trace_ext4_ext_rm_idx(inode, leaf);
2294 ext4_free_blocks(handle, inode, NULL, leaf, 1,
2295 EXT4_FREE_BLOCKS_METADATA | EXT4_FREE_BLOCKS_FORGET);
2297 while (--depth >= 0) {
2298 if (path->p_idx != EXT_FIRST_INDEX(path->p_hdr))
2301 err = ext4_ext_get_access(handle, inode, path);
2304 path->p_idx->ei_block = (path+1)->p_idx->ei_block;
2305 err = ext4_ext_dirty(handle, inode, path);
2313 * ext4_ext_calc_credits_for_single_extent:
2314 * This routine returns max. credits that needed to insert an extent
2315 * to the extent tree.
2316 * When pass the actual path, the caller should calculate credits
2319 int ext4_ext_calc_credits_for_single_extent(struct inode *inode, int nrblocks,
2320 struct ext4_ext_path *path)
2323 int depth = ext_depth(inode);
2326 /* probably there is space in leaf? */
2327 if (le16_to_cpu(path[depth].p_hdr->eh_entries)
2328 < le16_to_cpu(path[depth].p_hdr->eh_max)) {
2331 * There are some space in the leaf tree, no
2332 * need to account for leaf block credit
2334 * bitmaps and block group descriptor blocks
2335 * and other metadata blocks still need to be
2338 /* 1 bitmap, 1 block group descriptor */
2339 ret = 2 + EXT4_META_TRANS_BLOCKS(inode->i_sb);
2344 return ext4_chunk_trans_blocks(inode, nrblocks);
2348 * How many index/leaf blocks need to change/allocate to modify nrblocks?
2350 * if nrblocks are fit in a single extent (chunk flag is 1), then
2351 * in the worse case, each tree level index/leaf need to be changed
2352 * if the tree split due to insert a new extent, then the old tree
2353 * index/leaf need to be updated too
2355 * If the nrblocks are discontiguous, they could cause
2356 * the whole tree split more than once, but this is really rare.
2358 int ext4_ext_index_trans_blocks(struct inode *inode, int nrblocks, int chunk)
2363 /* If we are converting the inline data, only one is needed here. */
2364 if (ext4_has_inline_data(inode))
2367 depth = ext_depth(inode);
2377 static int ext4_remove_blocks(handle_t *handle, struct inode *inode,
2378 struct ext4_extent *ex,
2379 ext4_fsblk_t *partial_cluster,
2380 ext4_lblk_t from, ext4_lblk_t to)
2382 struct ext4_sb_info *sbi = EXT4_SB(inode->i_sb);
2383 unsigned short ee_len = ext4_ext_get_actual_len(ex);
2387 if (S_ISDIR(inode->i_mode) || S_ISLNK(inode->i_mode))
2388 flags |= EXT4_FREE_BLOCKS_METADATA | EXT4_FREE_BLOCKS_FORGET;
2389 else if (ext4_should_journal_data(inode))
2390 flags |= EXT4_FREE_BLOCKS_FORGET;
2393 * For bigalloc file systems, we never free a partial cluster
2394 * at the beginning of the extent. Instead, we make a note
2395 * that we tried freeing the cluster, and check to see if we
2396 * need to free it on a subsequent call to ext4_remove_blocks,
2397 * or at the end of the ext4_truncate() operation.
2399 flags |= EXT4_FREE_BLOCKS_NOFREE_FIRST_CLUSTER;
2401 trace_ext4_remove_blocks(inode, ex, from, to, *partial_cluster);
2403 * If we have a partial cluster, and it's different from the
2404 * cluster of the last block, we need to explicitly free the
2405 * partial cluster here.
2407 pblk = ext4_ext_pblock(ex) + ee_len - 1;
2408 if (*partial_cluster && (EXT4_B2C(sbi, pblk) != *partial_cluster)) {
2409 ext4_free_blocks(handle, inode, NULL,
2410 EXT4_C2B(sbi, *partial_cluster),
2411 sbi->s_cluster_ratio, flags);
2412 *partial_cluster = 0;
2415 #ifdef EXTENTS_STATS
2417 struct ext4_sb_info *sbi = EXT4_SB(inode->i_sb);
2418 spin_lock(&sbi->s_ext_stats_lock);
2419 sbi->s_ext_blocks += ee_len;
2420 sbi->s_ext_extents++;
2421 if (ee_len < sbi->s_ext_min)
2422 sbi->s_ext_min = ee_len;
2423 if (ee_len > sbi->s_ext_max)
2424 sbi->s_ext_max = ee_len;
2425 if (ext_depth(inode) > sbi->s_depth_max)
2426 sbi->s_depth_max = ext_depth(inode);
2427 spin_unlock(&sbi->s_ext_stats_lock);
2430 if (from >= le32_to_cpu(ex->ee_block)
2431 && to == le32_to_cpu(ex->ee_block) + ee_len - 1) {
2435 num = le32_to_cpu(ex->ee_block) + ee_len - from;
2436 pblk = ext4_ext_pblock(ex) + ee_len - num;
2437 ext_debug("free last %u blocks starting %llu\n", num, pblk);
2438 ext4_free_blocks(handle, inode, NULL, pblk, num, flags);
2440 * If the block range to be freed didn't start at the
2441 * beginning of a cluster, and we removed the entire
2442 * extent, save the partial cluster here, since we
2443 * might need to delete if we determine that the
2444 * truncate operation has removed all of the blocks in
2447 if (pblk & (sbi->s_cluster_ratio - 1) &&
2449 *partial_cluster = EXT4_B2C(sbi, pblk);
2451 *partial_cluster = 0;
2452 } else if (from == le32_to_cpu(ex->ee_block)
2453 && to <= le32_to_cpu(ex->ee_block) + ee_len - 1) {
2459 start = ext4_ext_pblock(ex);
2461 ext_debug("free first %u blocks starting %llu\n", num, start);
2462 ext4_free_blocks(handle, inode, NULL, start, num, flags);
2465 printk(KERN_INFO "strange request: removal(2) "
2466 "%u-%u from %u:%u\n",
2467 from, to, le32_to_cpu(ex->ee_block), ee_len);
2474 * ext4_ext_rm_leaf() Removes the extents associated with the
2475 * blocks appearing between "start" and "end", and splits the extents
2476 * if "start" and "end" appear in the same extent
2478 * @handle: The journal handle
2479 * @inode: The files inode
2480 * @path: The path to the leaf
2481 * @start: The first block to remove
2482 * @end: The last block to remove
2485 ext4_ext_rm_leaf(handle_t *handle, struct inode *inode,
2486 struct ext4_ext_path *path, ext4_fsblk_t *partial_cluster,
2487 ext4_lblk_t start, ext4_lblk_t end)
2489 struct ext4_sb_info *sbi = EXT4_SB(inode->i_sb);
2490 int err = 0, correct_index = 0;
2491 int depth = ext_depth(inode), credits;
2492 struct ext4_extent_header *eh;
2495 ext4_lblk_t ex_ee_block;
2496 unsigned short ex_ee_len;
2497 unsigned uninitialized = 0;
2498 struct ext4_extent *ex;
2500 /* the header must be checked already in ext4_ext_remove_space() */
2501 ext_debug("truncate since %u in leaf to %u\n", start, end);
2502 if (!path[depth].p_hdr)
2503 path[depth].p_hdr = ext_block_hdr(path[depth].p_bh);
2504 eh = path[depth].p_hdr;
2505 if (unlikely(path[depth].p_hdr == NULL)) {
2506 EXT4_ERROR_INODE(inode, "path[%d].p_hdr == NULL", depth);
2509 /* find where to start removing */
2510 ex = EXT_LAST_EXTENT(eh);
2512 ex_ee_block = le32_to_cpu(ex->ee_block);
2513 ex_ee_len = ext4_ext_get_actual_len(ex);
2515 trace_ext4_ext_rm_leaf(inode, start, ex, *partial_cluster);
2517 while (ex >= EXT_FIRST_EXTENT(eh) &&
2518 ex_ee_block + ex_ee_len > start) {
2520 if (ext4_ext_is_uninitialized(ex))
2525 ext_debug("remove ext %u:[%d]%d\n", ex_ee_block,
2526 uninitialized, ex_ee_len);
2527 path[depth].p_ext = ex;
2529 a = ex_ee_block > start ? ex_ee_block : start;
2530 b = ex_ee_block+ex_ee_len - 1 < end ?
2531 ex_ee_block+ex_ee_len - 1 : end;
2533 ext_debug(" border %u:%u\n", a, b);
2535 /* If this extent is beyond the end of the hole, skip it */
2536 if (end < ex_ee_block) {
2538 ex_ee_block = le32_to_cpu(ex->ee_block);
2539 ex_ee_len = ext4_ext_get_actual_len(ex);
2541 } else if (b != ex_ee_block + ex_ee_len - 1) {
2542 EXT4_ERROR_INODE(inode,
2543 "can not handle truncate %u:%u "
2545 start, end, ex_ee_block,
2546 ex_ee_block + ex_ee_len - 1);
2549 } else if (a != ex_ee_block) {
2550 /* remove tail of the extent */
2551 num = a - ex_ee_block;
2553 /* remove whole extent: excellent! */
2557 * 3 for leaf, sb, and inode plus 2 (bmap and group
2558 * descriptor) for each block group; assume two block
2559 * groups plus ex_ee_len/blocks_per_block_group for
2562 credits = 7 + 2*(ex_ee_len/EXT4_BLOCKS_PER_GROUP(inode->i_sb));
2563 if (ex == EXT_FIRST_EXTENT(eh)) {
2565 credits += (ext_depth(inode)) + 1;
2567 credits += EXT4_MAXQUOTAS_TRANS_BLOCKS(inode->i_sb);
2569 err = ext4_ext_truncate_extend_restart(handle, inode, credits);
2573 err = ext4_ext_get_access(handle, inode, path + depth);
2577 err = ext4_remove_blocks(handle, inode, ex, partial_cluster,
2583 /* this extent is removed; mark slot entirely unused */
2584 ext4_ext_store_pblock(ex, 0);
2586 ex->ee_len = cpu_to_le16(num);
2588 * Do not mark uninitialized if all the blocks in the
2589 * extent have been removed.
2591 if (uninitialized && num)
2592 ext4_ext_mark_uninitialized(ex);
2594 * If the extent was completely released,
2595 * we need to remove it from the leaf
2598 if (end != EXT_MAX_BLOCKS - 1) {
2600 * For hole punching, we need to scoot all the
2601 * extents up when an extent is removed so that
2602 * we dont have blank extents in the middle
2604 memmove(ex, ex+1, (EXT_LAST_EXTENT(eh) - ex) *
2605 sizeof(struct ext4_extent));
2607 /* Now get rid of the one at the end */
2608 memset(EXT_LAST_EXTENT(eh), 0,
2609 sizeof(struct ext4_extent));
2611 le16_add_cpu(&eh->eh_entries, -1);
2613 *partial_cluster = 0;
2615 err = ext4_ext_dirty(handle, inode, path + depth);
2619 ext_debug("new extent: %u:%u:%llu\n", ex_ee_block, num,
2620 ext4_ext_pblock(ex));
2622 ex_ee_block = le32_to_cpu(ex->ee_block);
2623 ex_ee_len = ext4_ext_get_actual_len(ex);
2626 if (correct_index && eh->eh_entries)
2627 err = ext4_ext_correct_indexes(handle, inode, path);
2630 * If there is still a entry in the leaf node, check to see if
2631 * it references the partial cluster. This is the only place
2632 * where it could; if it doesn't, we can free the cluster.
2634 if (*partial_cluster && ex >= EXT_FIRST_EXTENT(eh) &&
2635 (EXT4_B2C(sbi, ext4_ext_pblock(ex) + ex_ee_len - 1) !=
2636 *partial_cluster)) {
2637 int flags = EXT4_FREE_BLOCKS_FORGET;
2639 if (S_ISDIR(inode->i_mode) || S_ISLNK(inode->i_mode))
2640 flags |= EXT4_FREE_BLOCKS_METADATA;
2642 ext4_free_blocks(handle, inode, NULL,
2643 EXT4_C2B(sbi, *partial_cluster),
2644 sbi->s_cluster_ratio, flags);
2645 *partial_cluster = 0;
2648 /* if this leaf is free, then we should
2649 * remove it from index block above */
2650 if (err == 0 && eh->eh_entries == 0 && path[depth].p_bh != NULL)
2651 err = ext4_ext_rm_idx(handle, inode, path, depth);
2658 * ext4_ext_more_to_rm:
2659 * returns 1 if current index has to be freed (even partial)
2662 ext4_ext_more_to_rm(struct ext4_ext_path *path)
2664 BUG_ON(path->p_idx == NULL);
2666 if (path->p_idx < EXT_FIRST_INDEX(path->p_hdr))
2670 * if truncate on deeper level happened, it wasn't partial,
2671 * so we have to consider current index for truncation
2673 if (le16_to_cpu(path->p_hdr->eh_entries) == path->p_block)
2678 int ext4_ext_remove_space(struct inode *inode, ext4_lblk_t start,
2681 struct super_block *sb = inode->i_sb;
2682 int depth = ext_depth(inode);
2683 struct ext4_ext_path *path = NULL;
2684 ext4_fsblk_t partial_cluster = 0;
2688 ext_debug("truncate since %u to %u\n", start, end);
2690 /* probably first extent we're gonna free will be last in block */
2691 handle = ext4_journal_start(inode, EXT4_HT_TRUNCATE, depth + 1);
2693 return PTR_ERR(handle);
2696 trace_ext4_ext_remove_space(inode, start, depth);
2699 * Check if we are removing extents inside the extent tree. If that
2700 * is the case, we are going to punch a hole inside the extent tree
2701 * so we have to check whether we need to split the extent covering
2702 * the last block to remove so we can easily remove the part of it
2703 * in ext4_ext_rm_leaf().
2705 if (end < EXT_MAX_BLOCKS - 1) {
2706 struct ext4_extent *ex;
2707 ext4_lblk_t ee_block;
2709 /* find extent for this block */
2710 path = ext4_ext_find_extent(inode, end, NULL);
2712 ext4_journal_stop(handle);
2713 return PTR_ERR(path);
2715 depth = ext_depth(inode);
2716 /* Leaf not may not exist only if inode has no blocks at all */
2717 ex = path[depth].p_ext;
2720 EXT4_ERROR_INODE(inode,
2721 "path[%d].p_hdr == NULL",
2728 ee_block = le32_to_cpu(ex->ee_block);
2731 * See if the last block is inside the extent, if so split
2732 * the extent at 'end' block so we can easily remove the
2733 * tail of the first part of the split extent in
2734 * ext4_ext_rm_leaf().
2736 if (end >= ee_block &&
2737 end < ee_block + ext4_ext_get_actual_len(ex) - 1) {
2740 if (ext4_ext_is_uninitialized(ex))
2741 split_flag = EXT4_EXT_MARK_UNINIT1 |
2742 EXT4_EXT_MARK_UNINIT2;
2745 * Split the extent in two so that 'end' is the last
2746 * block in the first new extent. Also we should not
2747 * fail removing space due to ENOSPC so try to use
2748 * reserved block if that happens.
2750 err = ext4_split_extent_at(handle, inode, path,
2751 end + 1, split_flag,
2752 EXT4_GET_BLOCKS_PRE_IO |
2753 EXT4_GET_BLOCKS_METADATA_NOFAIL);
2760 * We start scanning from right side, freeing all the blocks
2761 * after i_size and walking into the tree depth-wise.
2763 depth = ext_depth(inode);
2768 le16_to_cpu(path[k].p_hdr->eh_entries)+1;
2770 path = kzalloc(sizeof(struct ext4_ext_path) * (depth + 1),
2773 ext4_journal_stop(handle);
2776 path[0].p_depth = depth;
2777 path[0].p_hdr = ext_inode_hdr(inode);
2780 if (ext4_ext_check(inode, path[0].p_hdr, depth)) {
2787 while (i >= 0 && err == 0) {
2789 /* this is leaf block */
2790 err = ext4_ext_rm_leaf(handle, inode, path,
2791 &partial_cluster, start,
2793 /* root level has p_bh == NULL, brelse() eats this */
2794 brelse(path[i].p_bh);
2795 path[i].p_bh = NULL;
2800 /* this is index block */
2801 if (!path[i].p_hdr) {
2802 ext_debug("initialize header\n");
2803 path[i].p_hdr = ext_block_hdr(path[i].p_bh);
2806 if (!path[i].p_idx) {
2807 /* this level hasn't been touched yet */
2808 path[i].p_idx = EXT_LAST_INDEX(path[i].p_hdr);
2809 path[i].p_block = le16_to_cpu(path[i].p_hdr->eh_entries)+1;
2810 ext_debug("init index ptr: hdr 0x%p, num %d\n",
2812 le16_to_cpu(path[i].p_hdr->eh_entries));
2814 /* we were already here, see at next index */
2818 ext_debug("level %d - index, first 0x%p, cur 0x%p\n",
2819 i, EXT_FIRST_INDEX(path[i].p_hdr),
2821 if (ext4_ext_more_to_rm(path + i)) {
2822 struct buffer_head *bh;
2823 /* go to the next level */
2824 ext_debug("move to level %d (block %llu)\n",
2825 i + 1, ext4_idx_pblock(path[i].p_idx));
2826 memset(path + i + 1, 0, sizeof(*path));
2827 bh = sb_bread(sb, ext4_idx_pblock(path[i].p_idx));
2829 /* should we reset i_size? */
2833 if (WARN_ON(i + 1 > depth)) {
2837 if (ext4_ext_check_block(inode, ext_block_hdr(bh),
2838 depth - i - 1, bh)) {
2842 path[i + 1].p_bh = bh;
2844 /* save actual number of indexes since this
2845 * number is changed at the next iteration */
2846 path[i].p_block = le16_to_cpu(path[i].p_hdr->eh_entries);
2849 /* we finished processing this index, go up */
2850 if (path[i].p_hdr->eh_entries == 0 && i > 0) {
2851 /* index is empty, remove it;
2852 * handle must be already prepared by the
2853 * truncatei_leaf() */
2854 err = ext4_ext_rm_idx(handle, inode, path, i);
2856 /* root level has p_bh == NULL, brelse() eats this */
2857 brelse(path[i].p_bh);
2858 path[i].p_bh = NULL;
2860 ext_debug("return to level %d\n", i);
2864 trace_ext4_ext_remove_space_done(inode, start, depth, partial_cluster,
2865 path->p_hdr->eh_entries);
2867 /* If we still have something in the partial cluster and we have removed
2868 * even the first extent, then we should free the blocks in the partial
2869 * cluster as well. */
2870 if (partial_cluster && path->p_hdr->eh_entries == 0) {
2871 int flags = EXT4_FREE_BLOCKS_FORGET;
2873 if (S_ISDIR(inode->i_mode) || S_ISLNK(inode->i_mode))
2874 flags |= EXT4_FREE_BLOCKS_METADATA;
2876 ext4_free_blocks(handle, inode, NULL,
2877 EXT4_C2B(EXT4_SB(sb), partial_cluster),
2878 EXT4_SB(sb)->s_cluster_ratio, flags);
2879 partial_cluster = 0;
2882 /* TODO: flexible tree reduction should be here */
2883 if (path->p_hdr->eh_entries == 0) {
2885 * truncate to zero freed all the tree,
2886 * so we need to correct eh_depth
2888 err = ext4_ext_get_access(handle, inode, path);
2890 ext_inode_hdr(inode)->eh_depth = 0;
2891 ext_inode_hdr(inode)->eh_max =
2892 cpu_to_le16(ext4_ext_space_root(inode, 0));
2893 err = ext4_ext_dirty(handle, inode, path);
2897 ext4_ext_drop_refs(path);
2899 if (err == -EAGAIN) {
2903 ext4_journal_stop(handle);
2909 * called at mount time
2911 void ext4_ext_init(struct super_block *sb)
2914 * possible initialization would be here
2917 if (EXT4_HAS_INCOMPAT_FEATURE(sb, EXT4_FEATURE_INCOMPAT_EXTENTS)) {
2918 #if defined(AGGRESSIVE_TEST) || defined(CHECK_BINSEARCH) || defined(EXTENTS_STATS)
2919 printk(KERN_INFO "EXT4-fs: file extents enabled"
2920 #ifdef AGGRESSIVE_TEST
2921 ", aggressive tests"
2923 #ifdef CHECK_BINSEARCH
2926 #ifdef EXTENTS_STATS
2931 #ifdef EXTENTS_STATS
2932 spin_lock_init(&EXT4_SB(sb)->s_ext_stats_lock);
2933 EXT4_SB(sb)->s_ext_min = 1 << 30;
2934 EXT4_SB(sb)->s_ext_max = 0;
2940 * called at umount time
2942 void ext4_ext_release(struct super_block *sb)
2944 if (!EXT4_HAS_INCOMPAT_FEATURE(sb, EXT4_FEATURE_INCOMPAT_EXTENTS))
2947 #ifdef EXTENTS_STATS
2948 if (EXT4_SB(sb)->s_ext_blocks && EXT4_SB(sb)->s_ext_extents) {
2949 struct ext4_sb_info *sbi = EXT4_SB(sb);
2950 printk(KERN_ERR "EXT4-fs: %lu blocks in %lu extents (%lu ave)\n",
2951 sbi->s_ext_blocks, sbi->s_ext_extents,
2952 sbi->s_ext_blocks / sbi->s_ext_extents);
2953 printk(KERN_ERR "EXT4-fs: extents: %lu min, %lu max, max depth %lu\n",
2954 sbi->s_ext_min, sbi->s_ext_max, sbi->s_depth_max);
2959 /* FIXME!! we need to try to merge to left or right after zero-out */
2960 static int ext4_ext_zeroout(struct inode *inode, struct ext4_extent *ex)
2962 ext4_fsblk_t ee_pblock;
2963 unsigned int ee_len;
2966 ee_len = ext4_ext_get_actual_len(ex);
2967 ee_pblock = ext4_ext_pblock(ex);
2969 ret = sb_issue_zeroout(inode->i_sb, ee_pblock, ee_len, GFP_NOFS);
2977 * ext4_split_extent_at() splits an extent at given block.
2979 * @handle: the journal handle
2980 * @inode: the file inode
2981 * @path: the path to the extent
2982 * @split: the logical block where the extent is splitted.
2983 * @split_flags: indicates if the extent could be zeroout if split fails, and
2984 * the states(init or uninit) of new extents.
2985 * @flags: flags used to insert new extent to extent tree.
2988 * Splits extent [a, b] into two extents [a, @split) and [@split, b], states
2989 * of which are deterimined by split_flag.
2991 * There are two cases:
2992 * a> the extent are splitted into two extent.
2993 * b> split is not needed, and just mark the extent.
2995 * return 0 on success.
2997 static int ext4_split_extent_at(handle_t *handle,
2998 struct inode *inode,
2999 struct ext4_ext_path *path,
3004 ext4_fsblk_t newblock;
3005 ext4_lblk_t ee_block;
3006 struct ext4_extent *ex, newex, orig_ex, zero_ex;
3007 struct ext4_extent *ex2 = NULL;
3008 unsigned int ee_len, depth;
3011 BUG_ON((split_flag & (EXT4_EXT_DATA_VALID1 | EXT4_EXT_DATA_VALID2)) ==
3012 (EXT4_EXT_DATA_VALID1 | EXT4_EXT_DATA_VALID2));
3014 ext_debug("ext4_split_extents_at: inode %lu, logical"
3015 "block %llu\n", inode->i_ino, (unsigned long long)split);
3017 ext4_ext_show_leaf(inode, path);
3019 depth = ext_depth(inode);
3020 ex = path[depth].p_ext;
3021 ee_block = le32_to_cpu(ex->ee_block);
3022 ee_len = ext4_ext_get_actual_len(ex);
3023 newblock = split - ee_block + ext4_ext_pblock(ex);
3025 BUG_ON(split < ee_block || split >= (ee_block + ee_len));
3026 BUG_ON(!ext4_ext_is_uninitialized(ex) &&
3027 split_flag & (EXT4_EXT_MAY_ZEROOUT |
3028 EXT4_EXT_MARK_UNINIT1 |
3029 EXT4_EXT_MARK_UNINIT2));
3031 err = ext4_ext_get_access(handle, inode, path + depth);
3035 if (split == ee_block) {
3037 * case b: block @split is the block that the extent begins with
3038 * then we just change the state of the extent, and splitting
3041 if (split_flag & EXT4_EXT_MARK_UNINIT2)
3042 ext4_ext_mark_uninitialized(ex);
3044 ext4_ext_mark_initialized(ex);
3046 if (!(flags & EXT4_GET_BLOCKS_PRE_IO))
3047 ext4_ext_try_to_merge(handle, inode, path, ex);
3049 err = ext4_ext_dirty(handle, inode, path + path->p_depth);
3054 memcpy(&orig_ex, ex, sizeof(orig_ex));
3055 ex->ee_len = cpu_to_le16(split - ee_block);
3056 if (split_flag & EXT4_EXT_MARK_UNINIT1)
3057 ext4_ext_mark_uninitialized(ex);
3060 * path may lead to new leaf, not to original leaf any more
3061 * after ext4_ext_insert_extent() returns,
3063 err = ext4_ext_dirty(handle, inode, path + depth);
3065 goto fix_extent_len;
3068 ex2->ee_block = cpu_to_le32(split);
3069 ex2->ee_len = cpu_to_le16(ee_len - (split - ee_block));
3070 ext4_ext_store_pblock(ex2, newblock);
3071 if (split_flag & EXT4_EXT_MARK_UNINIT2)
3072 ext4_ext_mark_uninitialized(ex2);
3074 err = ext4_ext_insert_extent(handle, inode, path, &newex, flags);
3075 if (err == -ENOSPC && (EXT4_EXT_MAY_ZEROOUT & split_flag)) {
3076 if (split_flag & (EXT4_EXT_DATA_VALID1|EXT4_EXT_DATA_VALID2)) {
3077 if (split_flag & EXT4_EXT_DATA_VALID1) {
3078 err = ext4_ext_zeroout(inode, ex2);
3079 zero_ex.ee_block = ex2->ee_block;
3080 zero_ex.ee_len = cpu_to_le16(
3081 ext4_ext_get_actual_len(ex2));
3082 ext4_ext_store_pblock(&zero_ex,
3083 ext4_ext_pblock(ex2));
3085 err = ext4_ext_zeroout(inode, ex);
3086 zero_ex.ee_block = ex->ee_block;
3087 zero_ex.ee_len = cpu_to_le16(
3088 ext4_ext_get_actual_len(ex));
3089 ext4_ext_store_pblock(&zero_ex,
3090 ext4_ext_pblock(ex));
3093 err = ext4_ext_zeroout(inode, &orig_ex);
3094 zero_ex.ee_block = orig_ex.ee_block;
3095 zero_ex.ee_len = cpu_to_le16(
3096 ext4_ext_get_actual_len(&orig_ex));
3097 ext4_ext_store_pblock(&zero_ex,
3098 ext4_ext_pblock(&orig_ex));
3102 goto fix_extent_len;
3103 /* update the extent length and mark as initialized */
3104 ex->ee_len = cpu_to_le16(ee_len);
3105 ext4_ext_try_to_merge(handle, inode, path, ex);
3106 err = ext4_ext_dirty(handle, inode, path + path->p_depth);
3108 goto fix_extent_len;
3110 /* update extent status tree */
3111 err = ext4_es_zeroout(inode, &zero_ex);
3115 goto fix_extent_len;
3118 ext4_ext_show_leaf(inode, path);
3122 ex->ee_len = orig_ex.ee_len;
3123 ext4_ext_dirty(handle, inode, path + depth);
3128 * ext4_split_extents() splits an extent and mark extent which is covered
3129 * by @map as split_flags indicates
3131 * It may result in splitting the extent into multiple extents (upto three)
3132 * There are three possibilities:
3133 * a> There is no split required
3134 * b> Splits in two extents: Split is happening at either end of the extent
3135 * c> Splits in three extents: Somone is splitting in middle of the extent
3138 static int ext4_split_extent(handle_t *handle,
3139 struct inode *inode,
3140 struct ext4_ext_path *path,
3141 struct ext4_map_blocks *map,
3145 ext4_lblk_t ee_block;
3146 struct ext4_extent *ex;
3147 unsigned int ee_len, depth;
3150 int split_flag1, flags1;
3151 int allocated = map->m_len;
3153 depth = ext_depth(inode);
3154 ex = path[depth].p_ext;
3155 ee_block = le32_to_cpu(ex->ee_block);
3156 ee_len = ext4_ext_get_actual_len(ex);
3157 uninitialized = ext4_ext_is_uninitialized(ex);
3159 if (map->m_lblk + map->m_len < ee_block + ee_len) {
3160 split_flag1 = split_flag & EXT4_EXT_MAY_ZEROOUT;
3161 flags1 = flags | EXT4_GET_BLOCKS_PRE_IO;
3163 split_flag1 |= EXT4_EXT_MARK_UNINIT1 |
3164 EXT4_EXT_MARK_UNINIT2;
3165 if (split_flag & EXT4_EXT_DATA_VALID2)
3166 split_flag1 |= EXT4_EXT_DATA_VALID1;
3167 err = ext4_split_extent_at(handle, inode, path,
3168 map->m_lblk + map->m_len, split_flag1, flags1);
3172 allocated = ee_len - (map->m_lblk - ee_block);
3175 * Update path is required because previous ext4_split_extent_at() may
3176 * result in split of original leaf or extent zeroout.
3178 ext4_ext_drop_refs(path);
3179 path = ext4_ext_find_extent(inode, map->m_lblk, path);
3181 return PTR_ERR(path);
3182 depth = ext_depth(inode);
3183 ex = path[depth].p_ext;
3184 uninitialized = ext4_ext_is_uninitialized(ex);
3187 if (map->m_lblk >= ee_block) {
3188 split_flag1 = split_flag & EXT4_EXT_DATA_VALID2;
3189 if (uninitialized) {
3190 split_flag1 |= EXT4_EXT_MARK_UNINIT1;
3191 split_flag1 |= split_flag & (EXT4_EXT_MAY_ZEROOUT |
3192 EXT4_EXT_MARK_UNINIT2);
3194 err = ext4_split_extent_at(handle, inode, path,
3195 map->m_lblk, split_flag1, flags);
3200 ext4_ext_show_leaf(inode, path);
3202 return err ? err : allocated;
3206 * This function is called by ext4_ext_map_blocks() if someone tries to write
3207 * to an uninitialized extent. It may result in splitting the uninitialized
3208 * extent into multiple extents (up to three - one initialized and two
3210 * There are three possibilities:
3211 * a> There is no split required: Entire extent should be initialized
3212 * b> Splits in two extents: Write is happening at either end of the extent
3213 * c> Splits in three extents: Somone is writing in middle of the extent
3216 * - The extent pointed to by 'path' is uninitialized.
3217 * - The extent pointed to by 'path' contains a superset
3218 * of the logical span [map->m_lblk, map->m_lblk + map->m_len).
3220 * Post-conditions on success:
3221 * - the returned value is the number of blocks beyond map->l_lblk
3222 * that are allocated and initialized.
3223 * It is guaranteed to be >= map->m_len.
3225 static int ext4_ext_convert_to_initialized(handle_t *handle,
3226 struct inode *inode,
3227 struct ext4_map_blocks *map,
3228 struct ext4_ext_path *path,
3231 struct ext4_sb_info *sbi;
3232 struct ext4_extent_header *eh;
3233 struct ext4_map_blocks split_map;
3234 struct ext4_extent zero_ex;
3235 struct ext4_extent *ex, *abut_ex;
3236 ext4_lblk_t ee_block, eof_block;
3237 unsigned int ee_len, depth, map_len = map->m_len;
3238 int allocated = 0, max_zeroout = 0;
3242 ext_debug("ext4_ext_convert_to_initialized: inode %lu, logical"
3243 "block %llu, max_blocks %u\n", inode->i_ino,
3244 (unsigned long long)map->m_lblk, map_len);
3246 sbi = EXT4_SB(inode->i_sb);
3247 eof_block = (inode->i_size + inode->i_sb->s_blocksize - 1) >>
3248 inode->i_sb->s_blocksize_bits;
3249 if (eof_block < map->m_lblk + map_len)
3250 eof_block = map->m_lblk + map_len;
3252 depth = ext_depth(inode);
3253 eh = path[depth].p_hdr;
3254 ex = path[depth].p_ext;
3255 ee_block = le32_to_cpu(ex->ee_block);
3256 ee_len = ext4_ext_get_actual_len(ex);
3259 trace_ext4_ext_convert_to_initialized_enter(inode, map, ex);
3261 /* Pre-conditions */
3262 BUG_ON(!ext4_ext_is_uninitialized(ex));
3263 BUG_ON(!in_range(map->m_lblk, ee_block, ee_len));
3266 * Attempt to transfer newly initialized blocks from the currently
3267 * uninitialized extent to its neighbor. This is much cheaper
3268 * than an insertion followed by a merge as those involve costly
3269 * memmove() calls. Transferring to the left is the common case in
3270 * steady state for workloads doing fallocate(FALLOC_FL_KEEP_SIZE)
3271 * followed by append writes.
3273 * Limitations of the current logic:
3274 * - L1: we do not deal with writes covering the whole extent.
3275 * This would require removing the extent if the transfer
3277 * - L2: we only attempt to merge with an extent stored in the
3278 * same extent tree node.
3280 if ((map->m_lblk == ee_block) &&
3281 /* See if we can merge left */
3282 (map_len < ee_len) && /*L1*/
3283 (ex > EXT_FIRST_EXTENT(eh))) { /*L2*/
3284 ext4_lblk_t prev_lblk;
3285 ext4_fsblk_t prev_pblk, ee_pblk;
3286 unsigned int prev_len;
3289 prev_lblk = le32_to_cpu(abut_ex->ee_block);
3290 prev_len = ext4_ext_get_actual_len(abut_ex);
3291 prev_pblk = ext4_ext_pblock(abut_ex);
3292 ee_pblk = ext4_ext_pblock(ex);
3295 * A transfer of blocks from 'ex' to 'abut_ex' is allowed
3296 * upon those conditions:
3297 * - C1: abut_ex is initialized,
3298 * - C2: abut_ex is logically abutting ex,
3299 * - C3: abut_ex is physically abutting ex,
3300 * - C4: abut_ex can receive the additional blocks without
3301 * overflowing the (initialized) length limit.
3303 if ((!ext4_ext_is_uninitialized(abut_ex)) && /*C1*/
3304 ((prev_lblk + prev_len) == ee_block) && /*C2*/
3305 ((prev_pblk + prev_len) == ee_pblk) && /*C3*/
3306 (prev_len < (EXT_INIT_MAX_LEN - map_len))) { /*C4*/
3307 err = ext4_ext_get_access(handle, inode, path + depth);
3311 trace_ext4_ext_convert_to_initialized_fastpath(inode,
3314 /* Shift the start of ex by 'map_len' blocks */
3315 ex->ee_block = cpu_to_le32(ee_block + map_len);
3316 ext4_ext_store_pblock(ex, ee_pblk + map_len);
3317 ex->ee_len = cpu_to_le16(ee_len - map_len);
3318 ext4_ext_mark_uninitialized(ex); /* Restore the flag */
3320 /* Extend abut_ex by 'map_len' blocks */
3321 abut_ex->ee_len = cpu_to_le16(prev_len + map_len);
3323 /* Result: number of initialized blocks past m_lblk */
3324 allocated = map_len;
3326 } else if (((map->m_lblk + map_len) == (ee_block + ee_len)) &&
3327 (map_len < ee_len) && /*L1*/
3328 ex < EXT_LAST_EXTENT(eh)) { /*L2*/
3329 /* See if we can merge right */
3330 ext4_lblk_t next_lblk;
3331 ext4_fsblk_t next_pblk, ee_pblk;
3332 unsigned int next_len;
3335 next_lblk = le32_to_cpu(abut_ex->ee_block);
3336 next_len = ext4_ext_get_actual_len(abut_ex);
3337 next_pblk = ext4_ext_pblock(abut_ex);
3338 ee_pblk = ext4_ext_pblock(ex);
3341 * A transfer of blocks from 'ex' to 'abut_ex' is allowed
3342 * upon those conditions:
3343 * - C1: abut_ex is initialized,
3344 * - C2: abut_ex is logically abutting ex,
3345 * - C3: abut_ex is physically abutting ex,
3346 * - C4: abut_ex can receive the additional blocks without
3347 * overflowing the (initialized) length limit.
3349 if ((!ext4_ext_is_uninitialized(abut_ex)) && /*C1*/
3350 ((map->m_lblk + map_len) == next_lblk) && /*C2*/
3351 ((ee_pblk + ee_len) == next_pblk) && /*C3*/
3352 (next_len < (EXT_INIT_MAX_LEN - map_len))) { /*C4*/
3353 err = ext4_ext_get_access(handle, inode, path + depth);
3357 trace_ext4_ext_convert_to_initialized_fastpath(inode,
3360 /* Shift the start of abut_ex by 'map_len' blocks */
3361 abut_ex->ee_block = cpu_to_le32(next_lblk - map_len);
3362 ext4_ext_store_pblock(abut_ex, next_pblk - map_len);
3363 ex->ee_len = cpu_to_le16(ee_len - map_len);
3364 ext4_ext_mark_uninitialized(ex); /* Restore the flag */
3366 /* Extend abut_ex by 'map_len' blocks */
3367 abut_ex->ee_len = cpu_to_le16(next_len + map_len);
3369 /* Result: number of initialized blocks past m_lblk */
3370 allocated = map_len;
3374 /* Mark the block containing both extents as dirty */
3375 ext4_ext_dirty(handle, inode, path + depth);
3377 /* Update path to point to the right extent */
3378 path[depth].p_ext = abut_ex;
3381 allocated = ee_len - (map->m_lblk - ee_block);
3383 WARN_ON(map->m_lblk < ee_block);
3385 * It is safe to convert extent to initialized via explicit
3386 * zeroout only if extent is fully insde i_size or new_size.
3388 split_flag |= ee_block + ee_len <= eof_block ? EXT4_EXT_MAY_ZEROOUT : 0;
3390 if (EXT4_EXT_MAY_ZEROOUT & split_flag)
3391 max_zeroout = sbi->s_extent_max_zeroout_kb >>
3392 (inode->i_sb->s_blocksize_bits - 10);
3394 /* If extent is less than s_max_zeroout_kb, zeroout directly */
3395 if (max_zeroout && (ee_len <= max_zeroout)) {
3396 err = ext4_ext_zeroout(inode, ex);
3399 zero_ex.ee_block = ex->ee_block;
3400 zero_ex.ee_len = cpu_to_le16(ext4_ext_get_actual_len(ex));
3401 ext4_ext_store_pblock(&zero_ex, ext4_ext_pblock(ex));
3403 err = ext4_ext_get_access(handle, inode, path + depth);
3406 ext4_ext_mark_initialized(ex);
3407 ext4_ext_try_to_merge(handle, inode, path, ex);
3408 err = ext4_ext_dirty(handle, inode, path + path->p_depth);
3414 * 1. split the extent into three extents.
3415 * 2. split the extent into two extents, zeroout the first half.
3416 * 3. split the extent into two extents, zeroout the second half.
3417 * 4. split the extent into two extents with out zeroout.
3419 split_map.m_lblk = map->m_lblk;
3420 split_map.m_len = map->m_len;
3422 if (max_zeroout && (allocated > map->m_len)) {
3423 if (allocated <= max_zeroout) {
3426 cpu_to_le32(map->m_lblk);
3427 zero_ex.ee_len = cpu_to_le16(allocated);
3428 ext4_ext_store_pblock(&zero_ex,
3429 ext4_ext_pblock(ex) + map->m_lblk - ee_block);
3430 err = ext4_ext_zeroout(inode, &zero_ex);
3433 split_map.m_lblk = map->m_lblk;
3434 split_map.m_len = allocated;
3435 } else if (map->m_lblk - ee_block + map->m_len < max_zeroout) {
3437 if (map->m_lblk != ee_block) {
3438 zero_ex.ee_block = ex->ee_block;
3439 zero_ex.ee_len = cpu_to_le16(map->m_lblk -
3441 ext4_ext_store_pblock(&zero_ex,
3442 ext4_ext_pblock(ex));
3443 err = ext4_ext_zeroout(inode, &zero_ex);
3448 split_map.m_lblk = ee_block;
3449 split_map.m_len = map->m_lblk - ee_block + map->m_len;
3450 allocated = map->m_len;
3454 allocated = ext4_split_extent(handle, inode, path,
3455 &split_map, split_flag, flags);
3460 /* If we have gotten a failure, don't zero out status tree */
3462 err = ext4_es_zeroout(inode, &zero_ex);
3463 return err ? err : allocated;
3467 * This function is called by ext4_ext_map_blocks() from
3468 * ext4_get_blocks_dio_write() when DIO to write
3469 * to an uninitialized extent.
3471 * Writing to an uninitialized extent may result in splitting the uninitialized
3472 * extent into multiple initialized/uninitialized extents (up to three)
3473 * There are three possibilities:
3474 * a> There is no split required: Entire extent should be uninitialized
3475 * b> Splits in two extents: Write is happening at either end of the extent
3476 * c> Splits in three extents: Somone is writing in middle of the extent
3478 * One of more index blocks maybe needed if the extent tree grow after
3479 * the uninitialized extent split. To prevent ENOSPC occur at the IO
3480 * complete, we need to split the uninitialized extent before DIO submit
3481 * the IO. The uninitialized extent called at this time will be split
3482 * into three uninitialized extent(at most). After IO complete, the part
3483 * being filled will be convert to initialized by the end_io callback function
3484 * via ext4_convert_unwritten_extents().
3486 * Returns the size of uninitialized extent to be written on success.
3488 static int ext4_split_unwritten_extents(handle_t *handle,
3489 struct inode *inode,
3490 struct ext4_map_blocks *map,
3491 struct ext4_ext_path *path,
3494 ext4_lblk_t eof_block;
3495 ext4_lblk_t ee_block;
3496 struct ext4_extent *ex;
3497 unsigned int ee_len;
3498 int split_flag = 0, depth;
3500 ext_debug("ext4_split_unwritten_extents: inode %lu, logical"
3501 "block %llu, max_blocks %u\n", inode->i_ino,
3502 (unsigned long long)map->m_lblk, map->m_len);
3504 eof_block = (inode->i_size + inode->i_sb->s_blocksize - 1) >>
3505 inode->i_sb->s_blocksize_bits;
3506 if (eof_block < map->m_lblk + map->m_len)
3507 eof_block = map->m_lblk + map->m_len;
3509 * It is safe to convert extent to initialized via explicit
3510 * zeroout only if extent is fully insde i_size or new_size.
3512 depth = ext_depth(inode);
3513 ex = path[depth].p_ext;
3514 ee_block = le32_to_cpu(ex->ee_block);
3515 ee_len = ext4_ext_get_actual_len(ex);
3517 split_flag |= ee_block + ee_len <= eof_block ? EXT4_EXT_MAY_ZEROOUT : 0;
3518 split_flag |= EXT4_EXT_MARK_UNINIT2;
3519 if (flags & EXT4_GET_BLOCKS_CONVERT)
3520 split_flag |= EXT4_EXT_DATA_VALID2;
3521 flags |= EXT4_GET_BLOCKS_PRE_IO;
3522 return ext4_split_extent(handle, inode, path, map, split_flag, flags);
3525 static int ext4_convert_unwritten_extents_endio(handle_t *handle,
3526 struct inode *inode,
3527 struct ext4_map_blocks *map,
3528 struct ext4_ext_path *path)
3530 struct ext4_extent *ex;
3531 ext4_lblk_t ee_block;
3532 unsigned int ee_len;
3536 depth = ext_depth(inode);
3537 ex = path[depth].p_ext;
3538 ee_block = le32_to_cpu(ex->ee_block);
3539 ee_len = ext4_ext_get_actual_len(ex);
3541 ext_debug("ext4_convert_unwritten_extents_endio: inode %lu, logical"
3542 "block %llu, max_blocks %u\n", inode->i_ino,
3543 (unsigned long long)ee_block, ee_len);
3545 /* If extent is larger than requested it is a clear sign that we still
3546 * have some extent state machine issues left. So extent_split is still
3548 * TODO: Once all related issues will be fixed this situation should be
3551 if (ee_block != map->m_lblk || ee_len > map->m_len) {
3553 ext4_warning("Inode (%ld) finished: extent logical block %llu,"
3554 " len %u; IO logical block %llu, len %u\n",
3555 inode->i_ino, (unsigned long long)ee_block, ee_len,
3556 (unsigned long long)map->m_lblk, map->m_len);
3558 err = ext4_split_unwritten_extents(handle, inode, map, path,
3559 EXT4_GET_BLOCKS_CONVERT);
3562 ext4_ext_drop_refs(path);
3563 path = ext4_ext_find_extent(inode, map->m_lblk, path);
3565 err = PTR_ERR(path);
3568 depth = ext_depth(inode);
3569 ex = path[depth].p_ext;
3572 err = ext4_ext_get_access(handle, inode, path + depth);
3575 /* first mark the extent as initialized */
3576 ext4_ext_mark_initialized(ex);
3578 /* note: ext4_ext_correct_indexes() isn't needed here because
3579 * borders are not changed
3581 ext4_ext_try_to_merge(handle, inode, path, ex);
3583 /* Mark modified extent as dirty */
3584 err = ext4_ext_dirty(handle, inode, path + path->p_depth);
3586 ext4_ext_show_leaf(inode, path);
3590 static void unmap_underlying_metadata_blocks(struct block_device *bdev,
3591 sector_t block, int count)
3594 for (i = 0; i < count; i++)
3595 unmap_underlying_metadata(bdev, block + i);
3599 * Handle EOFBLOCKS_FL flag, clearing it if necessary
3601 static int check_eofblocks_fl(handle_t *handle, struct inode *inode,
3603 struct ext4_ext_path *path,
3607 struct ext4_extent_header *eh;
3608 struct ext4_extent *last_ex;
3610 if (!ext4_test_inode_flag(inode, EXT4_INODE_EOFBLOCKS))
3613 depth = ext_depth(inode);
3614 eh = path[depth].p_hdr;
3617 * We're going to remove EOFBLOCKS_FL entirely in future so we
3618 * do not care for this case anymore. Simply remove the flag
3619 * if there are no extents.
3621 if (unlikely(!eh->eh_entries))
3623 last_ex = EXT_LAST_EXTENT(eh);
3625 * We should clear the EOFBLOCKS_FL flag if we are writing the
3626 * last block in the last extent in the file. We test this by
3627 * first checking to see if the caller to
3628 * ext4_ext_get_blocks() was interested in the last block (or
3629 * a block beyond the last block) in the current extent. If
3630 * this turns out to be false, we can bail out from this
3631 * function immediately.
3633 if (lblk + len < le32_to_cpu(last_ex->ee_block) +
3634 ext4_ext_get_actual_len(last_ex))
3637 * If the caller does appear to be planning to write at or
3638 * beyond the end of the current extent, we then test to see
3639 * if the current extent is the last extent in the file, by
3640 * checking to make sure it was reached via the rightmost node
3641 * at each level of the tree.
3643 for (i = depth-1; i >= 0; i--)
3644 if (path[i].p_idx != EXT_LAST_INDEX(path[i].p_hdr))
3647 ext4_clear_inode_flag(inode, EXT4_INODE_EOFBLOCKS);
3648 return ext4_mark_inode_dirty(handle, inode);
3652 * ext4_find_delalloc_range: find delayed allocated block in the given range.
3654 * Return 1 if there is a delalloc block in the range, otherwise 0.
3656 int ext4_find_delalloc_range(struct inode *inode,
3657 ext4_lblk_t lblk_start,
3658 ext4_lblk_t lblk_end)
3660 struct extent_status es;
3662 ext4_es_find_delayed_extent_range(inode, lblk_start, lblk_end, &es);
3664 return 0; /* there is no delay extent in this tree */
3665 else if (es.es_lblk <= lblk_start &&
3666 lblk_start < es.es_lblk + es.es_len)
3668 else if (lblk_start <= es.es_lblk && es.es_lblk <= lblk_end)
3674 int ext4_find_delalloc_cluster(struct inode *inode, ext4_lblk_t lblk)
3676 struct ext4_sb_info *sbi = EXT4_SB(inode->i_sb);
3677 ext4_lblk_t lblk_start, lblk_end;
3678 lblk_start = lblk & (~(sbi->s_cluster_ratio - 1));
3679 lblk_end = lblk_start + sbi->s_cluster_ratio - 1;
3681 return ext4_find_delalloc_range(inode, lblk_start, lblk_end);
3685 * Determines how many complete clusters (out of those specified by the 'map')
3686 * are under delalloc and were reserved quota for.
3687 * This function is called when we are writing out the blocks that were
3688 * originally written with their allocation delayed, but then the space was
3689 * allocated using fallocate() before the delayed allocation could be resolved.
3690 * The cases to look for are:
3691 * ('=' indicated delayed allocated blocks
3692 * '-' indicates non-delayed allocated blocks)
3693 * (a) partial clusters towards beginning and/or end outside of allocated range
3694 * are not delalloc'ed.
3696 * |----c---=|====c====|====c====|===-c----|
3697 * |++++++ allocated ++++++|
3698 * ==> 4 complete clusters in above example
3700 * (b) partial cluster (outside of allocated range) towards either end is
3701 * marked for delayed allocation. In this case, we will exclude that
3704 * |----====c========|========c========|
3705 * |++++++ allocated ++++++|
3706 * ==> 1 complete clusters in above example
3709 * |================c================|
3710 * |++++++ allocated ++++++|
3711 * ==> 0 complete clusters in above example
3713 * The ext4_da_update_reserve_space will be called only if we
3714 * determine here that there were some "entire" clusters that span
3715 * this 'allocated' range.
3716 * In the non-bigalloc case, this function will just end up returning num_blks
3717 * without ever calling ext4_find_delalloc_range.
3720 get_reserved_cluster_alloc(struct inode *inode, ext4_lblk_t lblk_start,
3721 unsigned int num_blks)
3723 struct ext4_sb_info *sbi = EXT4_SB(inode->i_sb);
3724 ext4_lblk_t alloc_cluster_start, alloc_cluster_end;
3725 ext4_lblk_t lblk_from, lblk_to, c_offset;
3726 unsigned int allocated_clusters = 0;
3728 alloc_cluster_start = EXT4_B2C(sbi, lblk_start);
3729 alloc_cluster_end = EXT4_B2C(sbi, lblk_start + num_blks - 1);
3731 /* max possible clusters for this allocation */
3732 allocated_clusters = alloc_cluster_end - alloc_cluster_start + 1;
3734 trace_ext4_get_reserved_cluster_alloc(inode, lblk_start, num_blks);
3736 /* Check towards left side */
3737 c_offset = lblk_start & (sbi->s_cluster_ratio - 1);
3739 lblk_from = lblk_start & (~(sbi->s_cluster_ratio - 1));
3740 lblk_to = lblk_from + c_offset - 1;
3742 if (ext4_find_delalloc_range(inode, lblk_from, lblk_to))
3743 allocated_clusters--;
3746 /* Now check towards right. */
3747 c_offset = (lblk_start + num_blks) & (sbi->s_cluster_ratio - 1);
3748 if (allocated_clusters && c_offset) {
3749 lblk_from = lblk_start + num_blks;
3750 lblk_to = lblk_from + (sbi->s_cluster_ratio - c_offset) - 1;
3752 if (ext4_find_delalloc_range(inode, lblk_from, lblk_to))
3753 allocated_clusters--;
3756 return allocated_clusters;
3760 ext4_ext_handle_uninitialized_extents(handle_t *handle, struct inode *inode,
3761 struct ext4_map_blocks *map,
3762 struct ext4_ext_path *path, int flags,
3763 unsigned int allocated, ext4_fsblk_t newblock)
3767 ext4_io_end_t *io = ext4_inode_aio(inode);
3769 ext_debug("ext4_ext_handle_uninitialized_extents: inode %lu, logical "
3770 "block %llu, max_blocks %u, flags %x, allocated %u\n",
3771 inode->i_ino, (unsigned long long)map->m_lblk, map->m_len,
3773 ext4_ext_show_leaf(inode, path);
3776 * When writing into uninitialized space, we should not fail to
3777 * allocate metadata blocks for the new extent block if needed.
3779 flags |= EXT4_GET_BLOCKS_METADATA_NOFAIL;
3781 trace_ext4_ext_handle_uninitialized_extents(inode, map, flags,
3782 allocated, newblock);
3784 /* get_block() before submit the IO, split the extent */
3785 if ((flags & EXT4_GET_BLOCKS_PRE_IO)) {
3786 ret = ext4_split_unwritten_extents(handle, inode, map,
3791 * Flag the inode(non aio case) or end_io struct (aio case)
3792 * that this IO needs to conversion to written when IO is
3796 ext4_set_io_unwritten_flag(inode, io);
3798 ext4_set_inode_state(inode, EXT4_STATE_DIO_UNWRITTEN);
3799 map->m_flags |= EXT4_MAP_UNWRITTEN;
3800 if (ext4_should_dioread_nolock(inode))
3801 map->m_flags |= EXT4_MAP_UNINIT;
3804 /* IO end_io complete, convert the filled extent to written */
3805 if ((flags & EXT4_GET_BLOCKS_CONVERT)) {
3806 ret = ext4_convert_unwritten_extents_endio(handle, inode, map,
3809 ext4_update_inode_fsync_trans(handle, inode, 1);
3810 err = check_eofblocks_fl(handle, inode, map->m_lblk,
3814 map->m_flags |= EXT4_MAP_MAPPED;
3815 if (allocated > map->m_len)
3816 allocated = map->m_len;
3817 map->m_len = allocated;
3820 /* buffered IO case */
3822 * repeat fallocate creation request
3823 * we already have an unwritten extent
3825 if (flags & EXT4_GET_BLOCKS_UNINIT_EXT) {
3826 map->m_flags |= EXT4_MAP_UNWRITTEN;
3830 /* buffered READ or buffered write_begin() lookup */
3831 if ((flags & EXT4_GET_BLOCKS_CREATE) == 0) {
3833 * We have blocks reserved already. We
3834 * return allocated blocks so that delalloc
3835 * won't do block reservation for us. But
3836 * the buffer head will be unmapped so that
3837 * a read from the block returns 0s.
3839 map->m_flags |= EXT4_MAP_UNWRITTEN;
3843 /* buffered write, writepage time, convert*/
3844 ret = ext4_ext_convert_to_initialized(handle, inode, map, path, flags);
3846 ext4_update_inode_fsync_trans(handle, inode, 1);
3853 map->m_flags |= EXT4_MAP_NEW;
3855 * if we allocated more blocks than requested
3856 * we need to make sure we unmap the extra block
3857 * allocated. The actual needed block will get
3858 * unmapped later when we find the buffer_head marked
3861 if (allocated > map->m_len) {
3862 unmap_underlying_metadata_blocks(inode->i_sb->s_bdev,
3863 newblock + map->m_len,
3864 allocated - map->m_len);
3865 allocated = map->m_len;
3867 map->m_len = allocated;
3870 * If we have done fallocate with the offset that is already
3871 * delayed allocated, we would have block reservation
3872 * and quota reservation done in the delayed write path.
3873 * But fallocate would have already updated quota and block
3874 * count for this offset. So cancel these reservation
3876 if (flags & EXT4_GET_BLOCKS_DELALLOC_RESERVE) {
3877 unsigned int reserved_clusters;
3878 reserved_clusters = get_reserved_cluster_alloc(inode,
3879 map->m_lblk, map->m_len);
3880 if (reserved_clusters)
3881 ext4_da_update_reserve_space(inode,
3887 map->m_flags |= EXT4_MAP_MAPPED;
3888 if ((flags & EXT4_GET_BLOCKS_KEEP_SIZE) == 0) {
3889 err = check_eofblocks_fl(handle, inode, map->m_lblk, path,
3895 if (allocated > map->m_len)
3896 allocated = map->m_len;
3897 ext4_ext_show_leaf(inode, path);
3898 map->m_pblk = newblock;
3899 map->m_len = allocated;
3902 ext4_ext_drop_refs(path);
3905 return err ? err : allocated;
3909 * get_implied_cluster_alloc - check to see if the requested
3910 * allocation (in the map structure) overlaps with a cluster already
3911 * allocated in an extent.
3912 * @sb The filesystem superblock structure
3913 * @map The requested lblk->pblk mapping
3914 * @ex The extent structure which might contain an implied
3915 * cluster allocation
3917 * This function is called by ext4_ext_map_blocks() after we failed to
3918 * find blocks that were already in the inode's extent tree. Hence,
3919 * we know that the beginning of the requested region cannot overlap
3920 * the extent from the inode's extent tree. There are three cases we
3921 * want to catch. The first is this case:
3923 * |--- cluster # N--|
3924 * |--- extent ---| |---- requested region ---|
3927 * The second case that we need to test for is this one:
3929 * |--------- cluster # N ----------------|
3930 * |--- requested region --| |------- extent ----|
3931 * |=======================|
3933 * The third case is when the requested region lies between two extents
3934 * within the same cluster:
3935 * |------------- cluster # N-------------|
3936 * |----- ex -----| |---- ex_right ----|
3937 * |------ requested region ------|
3938 * |================|
3940 * In each of the above cases, we need to set the map->m_pblk and
3941 * map->m_len so it corresponds to the return the extent labelled as
3942 * "|====|" from cluster #N, since it is already in use for data in
3943 * cluster EXT4_B2C(sbi, map->m_lblk). We will then return 1 to
3944 * signal to ext4_ext_map_blocks() that map->m_pblk should be treated
3945 * as a new "allocated" block region. Otherwise, we will return 0 and
3946 * ext4_ext_map_blocks() will then allocate one or more new clusters
3947 * by calling ext4_mb_new_blocks().
3949 static int get_implied_cluster_alloc(struct super_block *sb,
3950 struct ext4_map_blocks *map,
3951 struct ext4_extent *ex,
3952 struct ext4_ext_path *path)
3954 struct ext4_sb_info *sbi = EXT4_SB(sb);
3955 ext4_lblk_t c_offset = map->m_lblk & (sbi->s_cluster_ratio-1);
3956 ext4_lblk_t ex_cluster_start, ex_cluster_end;
3957 ext4_lblk_t rr_cluster_start;
3958 ext4_lblk_t ee_block = le32_to_cpu(ex->ee_block);
3959 ext4_fsblk_t ee_start = ext4_ext_pblock(ex);
3960 unsigned short ee_len = ext4_ext_get_actual_len(ex);
3962 /* The extent passed in that we are trying to match */
3963 ex_cluster_start = EXT4_B2C(sbi, ee_block);
3964 ex_cluster_end = EXT4_B2C(sbi, ee_block + ee_len - 1);
3966 /* The requested region passed into ext4_map_blocks() */
3967 rr_cluster_start = EXT4_B2C(sbi, map->m_lblk);
3969 if ((rr_cluster_start == ex_cluster_end) ||
3970 (rr_cluster_start == ex_cluster_start)) {
3971 if (rr_cluster_start == ex_cluster_end)
3972 ee_start += ee_len - 1;
3973 map->m_pblk = (ee_start & ~(sbi->s_cluster_ratio - 1)) +
3975 map->m_len = min(map->m_len,
3976 (unsigned) sbi->s_cluster_ratio - c_offset);
3978 * Check for and handle this case:
3980 * |--------- cluster # N-------------|
3981 * |------- extent ----|
3982 * |--- requested region ---|
3986 if (map->m_lblk < ee_block)
3987 map->m_len = min(map->m_len, ee_block - map->m_lblk);
3990 * Check for the case where there is already another allocated
3991 * block to the right of 'ex' but before the end of the cluster.
3993 * |------------- cluster # N-------------|
3994 * |----- ex -----| |---- ex_right ----|
3995 * |------ requested region ------|
3996 * |================|
3998 if (map->m_lblk > ee_block) {
3999 ext4_lblk_t next = ext4_ext_next_allocated_block(path);
4000 map->m_len = min(map->m_len, next - map->m_lblk);
4003 trace_ext4_get_implied_cluster_alloc_exit(sb, map, 1);
4007 trace_ext4_get_implied_cluster_alloc_exit(sb, map, 0);
4013 * Block allocation/map/preallocation routine for extents based files
4016 * Need to be called with
4017 * down_read(&EXT4_I(inode)->i_data_sem) if not allocating file system block
4018 * (ie, create is zero). Otherwise down_write(&EXT4_I(inode)->i_data_sem)
4020 * return > 0, number of of blocks already mapped/allocated
4021 * if create == 0 and these are pre-allocated blocks
4022 * buffer head is unmapped
4023 * otherwise blocks are mapped
4025 * return = 0, if plain look up failed (blocks have not been allocated)
4026 * buffer head is unmapped
4028 * return < 0, error case.
4030 int ext4_ext_map_blocks(handle_t *handle, struct inode *inode,
4031 struct ext4_map_blocks *map, int flags)
4033 struct ext4_ext_path *path = NULL;
4034 struct ext4_extent newex, *ex, *ex2;
4035 struct ext4_sb_info *sbi = EXT4_SB(inode->i_sb);
4036 ext4_fsblk_t newblock = 0;
4037 int free_on_err = 0, err = 0, depth;
4038 unsigned int allocated = 0, offset = 0;
4039 unsigned int allocated_clusters = 0;
4040 struct ext4_allocation_request ar;
4041 ext4_io_end_t *io = ext4_inode_aio(inode);
4042 ext4_lblk_t cluster_offset;
4043 int set_unwritten = 0;
4045 ext_debug("blocks %u/%u requested for inode %lu\n",
4046 map->m_lblk, map->m_len, inode->i_ino);
4047 trace_ext4_ext_map_blocks_enter(inode, map->m_lblk, map->m_len, flags);
4049 /* find extent for this block */
4050 path = ext4_ext_find_extent(inode, map->m_lblk, NULL);
4052 err = PTR_ERR(path);
4057 depth = ext_depth(inode);
4060 * consistent leaf must not be empty;
4061 * this situation is possible, though, _during_ tree modification;
4062 * this is why assert can't be put in ext4_ext_find_extent()
4064 if (unlikely(path[depth].p_ext == NULL && depth != 0)) {
4065 EXT4_ERROR_INODE(inode, "bad extent address "
4066 "lblock: %lu, depth: %d pblock %lld",
4067 (unsigned long) map->m_lblk, depth,
4068 path[depth].p_block);
4073 ex = path[depth].p_ext;
4075 ext4_lblk_t ee_block = le32_to_cpu(ex->ee_block);
4076 ext4_fsblk_t ee_start = ext4_ext_pblock(ex);
4077 unsigned short ee_len;
4080 * Uninitialized extents are treated as holes, except that
4081 * we split out initialized portions during a write.
4083 ee_len = ext4_ext_get_actual_len(ex);
4085 trace_ext4_ext_show_extent(inode, ee_block, ee_start, ee_len);
4087 /* if found extent covers block, simply return it */
4088 if (in_range(map->m_lblk, ee_block, ee_len)) {
4089 newblock = map->m_lblk - ee_block + ee_start;
4090 /* number of remaining blocks in the extent */
4091 allocated = ee_len - (map->m_lblk - ee_block);
4092 ext_debug("%u fit into %u:%d -> %llu\n", map->m_lblk,
4093 ee_block, ee_len, newblock);
4095 if (!ext4_ext_is_uninitialized(ex))
4098 allocated = ext4_ext_handle_uninitialized_extents(
4099 handle, inode, map, path, flags,
4100 allocated, newblock);
4105 if ((sbi->s_cluster_ratio > 1) &&
4106 ext4_find_delalloc_cluster(inode, map->m_lblk))
4107 map->m_flags |= EXT4_MAP_FROM_CLUSTER;
4110 * requested block isn't allocated yet;
4111 * we couldn't try to create block if create flag is zero
4113 if ((flags & EXT4_GET_BLOCKS_CREATE) == 0) {
4115 * put just found gap into cache to speed up
4116 * subsequent requests
4118 if ((flags & EXT4_GET_BLOCKS_NO_PUT_HOLE) == 0)
4119 ext4_ext_put_gap_in_cache(inode, path, map->m_lblk);
4124 * Okay, we need to do block allocation.
4126 map->m_flags &= ~EXT4_MAP_FROM_CLUSTER;
4127 newex.ee_block = cpu_to_le32(map->m_lblk);
4128 cluster_offset = map->m_lblk & (sbi->s_cluster_ratio-1);
4131 * If we are doing bigalloc, check to see if the extent returned
4132 * by ext4_ext_find_extent() implies a cluster we can use.
4134 if (cluster_offset && ex &&
4135 get_implied_cluster_alloc(inode->i_sb, map, ex, path)) {
4136 ar.len = allocated = map->m_len;
4137 newblock = map->m_pblk;
4138 map->m_flags |= EXT4_MAP_FROM_CLUSTER;
4139 goto got_allocated_blocks;
4142 /* find neighbour allocated blocks */
4143 ar.lleft = map->m_lblk;
4144 err = ext4_ext_search_left(inode, path, &ar.lleft, &ar.pleft);
4147 ar.lright = map->m_lblk;
4149 err = ext4_ext_search_right(inode, path, &ar.lright, &ar.pright, &ex2);
4153 /* Check if the extent after searching to the right implies a
4154 * cluster we can use. */
4155 if ((sbi->s_cluster_ratio > 1) && ex2 &&
4156 get_implied_cluster_alloc(inode->i_sb, map, ex2, path)) {
4157 ar.len = allocated = map->m_len;
4158 newblock = map->m_pblk;
4159 map->m_flags |= EXT4_MAP_FROM_CLUSTER;
4160 goto got_allocated_blocks;
4164 * See if request is beyond maximum number of blocks we can have in
4165 * a single extent. For an initialized extent this limit is
4166 * EXT_INIT_MAX_LEN and for an uninitialized extent this limit is
4167 * EXT_UNINIT_MAX_LEN.
4169 if (map->m_len > EXT_INIT_MAX_LEN &&
4170 !(flags & EXT4_GET_BLOCKS_UNINIT_EXT))
4171 map->m_len = EXT_INIT_MAX_LEN;
4172 else if (map->m_len > EXT_UNINIT_MAX_LEN &&
4173 (flags & EXT4_GET_BLOCKS_UNINIT_EXT))
4174 map->m_len = EXT_UNINIT_MAX_LEN;
4176 /* Check if we can really insert (m_lblk)::(m_lblk + m_len) extent */
4177 newex.ee_len = cpu_to_le16(map->m_len);
4178 err = ext4_ext_check_overlap(sbi, inode, &newex, path);
4180 allocated = ext4_ext_get_actual_len(&newex);
4182 allocated = map->m_len;
4184 /* allocate new block */
4186 ar.goal = ext4_ext_find_goal(inode, path, map->m_lblk);
4187 ar.logical = map->m_lblk;
4189 * We calculate the offset from the beginning of the cluster
4190 * for the logical block number, since when we allocate a
4191 * physical cluster, the physical block should start at the
4192 * same offset from the beginning of the cluster. This is
4193 * needed so that future calls to get_implied_cluster_alloc()
4196 offset = map->m_lblk & (sbi->s_cluster_ratio - 1);
4197 ar.len = EXT4_NUM_B2C(sbi, offset+allocated);
4199 ar.logical -= offset;
4200 if (S_ISREG(inode->i_mode))
4201 ar.flags = EXT4_MB_HINT_DATA;
4203 /* disable in-core preallocation for non-regular files */
4205 if (flags & EXT4_GET_BLOCKS_NO_NORMALIZE)
4206 ar.flags |= EXT4_MB_HINT_NOPREALLOC;
4207 newblock = ext4_mb_new_blocks(handle, &ar, &err);
4210 ext_debug("allocate new block: goal %llu, found %llu/%u\n",
4211 ar.goal, newblock, allocated);
4213 allocated_clusters = ar.len;
4214 ar.len = EXT4_C2B(sbi, ar.len) - offset;
4215 if (ar.len > allocated)
4218 got_allocated_blocks:
4219 /* try to insert new extent into found leaf and return */
4220 ext4_ext_store_pblock(&newex, newblock + offset);
4221 newex.ee_len = cpu_to_le16(ar.len);
4222 /* Mark uninitialized */
4223 if (flags & EXT4_GET_BLOCKS_UNINIT_EXT){
4224 ext4_ext_mark_uninitialized(&newex);
4225 map->m_flags |= EXT4_MAP_UNWRITTEN;
4227 * io_end structure was created for every IO write to an
4228 * uninitialized extent. To avoid unnecessary conversion,
4229 * here we flag the IO that really needs the conversion.
4230 * For non asycn direct IO case, flag the inode state
4231 * that we need to perform conversion when IO is done.
4233 if ((flags & EXT4_GET_BLOCKS_PRE_IO))
4235 if (ext4_should_dioread_nolock(inode))
4236 map->m_flags |= EXT4_MAP_UNINIT;
4240 if ((flags & EXT4_GET_BLOCKS_KEEP_SIZE) == 0)
4241 err = check_eofblocks_fl(handle, inode, map->m_lblk,
4244 err = ext4_ext_insert_extent(handle, inode, path,
4247 if (!err && set_unwritten) {
4249 ext4_set_io_unwritten_flag(inode, io);
4251 ext4_set_inode_state(inode,
4252 EXT4_STATE_DIO_UNWRITTEN);
4255 if (err && free_on_err) {
4256 int fb_flags = flags & EXT4_GET_BLOCKS_DELALLOC_RESERVE ?
4257 EXT4_FREE_BLOCKS_NO_QUOT_UPDATE : 0;
4258 /* free data blocks we just allocated */
4259 /* not a good idea to call discard here directly,
4260 * but otherwise we'd need to call it every free() */
4261 ext4_discard_preallocations(inode);
4262 ext4_free_blocks(handle, inode, NULL, ext4_ext_pblock(&newex),
4263 ext4_ext_get_actual_len(&newex), fb_flags);
4267 /* previous routine could use block we allocated */
4268 newblock = ext4_ext_pblock(&newex);
4269 allocated = ext4_ext_get_actual_len(&newex);
4270 if (allocated > map->m_len)
4271 allocated = map->m_len;
4272 map->m_flags |= EXT4_MAP_NEW;
4275 * Update reserved blocks/metadata blocks after successful
4276 * block allocation which had been deferred till now.
4278 if (flags & EXT4_GET_BLOCKS_DELALLOC_RESERVE) {
4279 unsigned int reserved_clusters;
4281 * Check how many clusters we had reserved this allocated range
4283 reserved_clusters = get_reserved_cluster_alloc(inode,
4284 map->m_lblk, allocated);
4285 if (map->m_flags & EXT4_MAP_FROM_CLUSTER) {
4286 if (reserved_clusters) {
4288 * We have clusters reserved for this range.
4289 * But since we are not doing actual allocation
4290 * and are simply using blocks from previously
4291 * allocated cluster, we should release the
4292 * reservation and not claim quota.
4294 ext4_da_update_reserve_space(inode,
4295 reserved_clusters, 0);
4298 BUG_ON(allocated_clusters < reserved_clusters);
4299 if (reserved_clusters < allocated_clusters) {
4300 struct ext4_inode_info *ei = EXT4_I(inode);
4301 int reservation = allocated_clusters -
4304 * It seems we claimed few clusters outside of
4305 * the range of this allocation. We should give
4306 * it back to the reservation pool. This can
4307 * happen in the following case:
4309 * * Suppose s_cluster_ratio is 4 (i.e., each
4310 * cluster has 4 blocks. Thus, the clusters
4311 * are [0-3],[4-7],[8-11]...
4312 * * First comes delayed allocation write for
4313 * logical blocks 10 & 11. Since there were no
4314 * previous delayed allocated blocks in the
4315 * range [8-11], we would reserve 1 cluster
4317 * * Next comes write for logical blocks 3 to 8.
4318 * In this case, we will reserve 2 clusters
4319 * (for [0-3] and [4-7]; and not for [8-11] as
4320 * that range has a delayed allocated blocks.
4321 * Thus total reserved clusters now becomes 3.
4322 * * Now, during the delayed allocation writeout
4323 * time, we will first write blocks [3-8] and
4324 * allocate 3 clusters for writing these
4325 * blocks. Also, we would claim all these
4326 * three clusters above.
4327 * * Now when we come here to writeout the
4328 * blocks [10-11], we would expect to claim
4329 * the reservation of 1 cluster we had made
4330 * (and we would claim it since there are no
4331 * more delayed allocated blocks in the range
4332 * [8-11]. But our reserved cluster count had
4333 * already gone to 0.
4335 * Thus, at the step 4 above when we determine
4336 * that there are still some unwritten delayed
4337 * allocated blocks outside of our current
4338 * block range, we should increment the
4339 * reserved clusters count so that when the
4340 * remaining blocks finally gets written, we
4343 dquot_reserve_block(inode,
4344 EXT4_C2B(sbi, reservation));
4345 spin_lock(&ei->i_block_reservation_lock);
4346 ei->i_reserved_data_blocks += reservation;
4347 spin_unlock(&ei->i_block_reservation_lock);
4350 * We will claim quota for all newly allocated blocks.
4351 * We're updating the reserved space *after* the
4352 * correction above so we do not accidentally free
4353 * all the metadata reservation because we might
4354 * actually need it later on.
4356 ext4_da_update_reserve_space(inode, allocated_clusters,
4362 * Cache the extent and update transaction to commit on fdatasync only
4363 * when it is _not_ an uninitialized extent.
4365 if ((flags & EXT4_GET_BLOCKS_UNINIT_EXT) == 0)
4366 ext4_update_inode_fsync_trans(handle, inode, 1);
4368 ext4_update_inode_fsync_trans(handle, inode, 0);
4370 if (allocated > map->m_len)
4371 allocated = map->m_len;
4372 ext4_ext_show_leaf(inode, path);
4373 map->m_flags |= EXT4_MAP_MAPPED;
4374 map->m_pblk = newblock;
4375 map->m_len = allocated;
4378 ext4_ext_drop_refs(path);
4383 trace_ext4_ext_map_blocks_exit(inode, map, err ? err : allocated);
4385 return err ? err : allocated;
4388 void ext4_ext_truncate(handle_t *handle, struct inode *inode)
4390 struct super_block *sb = inode->i_sb;
4391 ext4_lblk_t last_block;
4395 * TODO: optimization is possible here.
4396 * Probably we need not scan at all,
4397 * because page truncation is enough.
4400 /* we have to know where to truncate from in crash case */
4401 EXT4_I(inode)->i_disksize = inode->i_size;
4402 ext4_mark_inode_dirty(handle, inode);
4404 last_block = (inode->i_size + sb->s_blocksize - 1)
4405 >> EXT4_BLOCK_SIZE_BITS(sb);
4407 err = ext4_es_remove_extent(inode, last_block,
4408 EXT_MAX_BLOCKS - last_block);
4409 if (err == -ENOMEM) {
4411 congestion_wait(BLK_RW_ASYNC, HZ/50);
4415 ext4_std_error(inode->i_sb, err);
4418 err = ext4_ext_remove_space(inode, last_block, EXT_MAX_BLOCKS - 1);
4419 ext4_std_error(inode->i_sb, err);
4422 static void ext4_falloc_update_inode(struct inode *inode,
4423 int mode, loff_t new_size, int update_ctime)
4425 struct timespec now;
4428 now = current_fs_time(inode->i_sb);
4429 if (!timespec_equal(&inode->i_ctime, &now))
4430 inode->i_ctime = now;
4433 * Update only when preallocation was requested beyond
4436 if (!(mode & FALLOC_FL_KEEP_SIZE)) {
4437 if (new_size > i_size_read(inode))
4438 i_size_write(inode, new_size);
4439 if (new_size > EXT4_I(inode)->i_disksize)
4440 ext4_update_i_disksize(inode, new_size);
4443 * Mark that we allocate beyond EOF so the subsequent truncate
4444 * can proceed even if the new size is the same as i_size.
4446 if (new_size > i_size_read(inode))
4447 ext4_set_inode_flag(inode, EXT4_INODE_EOFBLOCKS);
4453 * preallocate space for a file. This implements ext4's fallocate file
4454 * operation, which gets called from sys_fallocate system call.
4455 * For block-mapped files, posix_fallocate should fall back to the method
4456 * of writing zeroes to the required new blocks (the same behavior which is
4457 * expected for file systems which do not support fallocate() system call).
4459 long ext4_fallocate(struct file *file, int mode, loff_t offset, loff_t len)
4461 struct inode *inode = file_inode(file);
4464 unsigned int max_blocks;
4469 struct ext4_map_blocks map;
4470 unsigned int credits, blkbits = inode->i_blkbits;
4472 /* Return error if mode is not supported */
4473 if (mode & ~(FALLOC_FL_KEEP_SIZE | FALLOC_FL_PUNCH_HOLE))
4476 if (mode & FALLOC_FL_PUNCH_HOLE)
4477 return ext4_punch_hole(file, offset, len);
4479 ret = ext4_convert_inline_data(inode);
4484 * currently supporting (pre)allocate mode for extent-based
4487 if (!(ext4_test_inode_flag(inode, EXT4_INODE_EXTENTS)))
4490 trace_ext4_fallocate_enter(inode, offset, len, mode);
4491 map.m_lblk = offset >> blkbits;
4493 * We can't just convert len to max_blocks because
4494 * If blocksize = 4096 offset = 3072 and len = 2048
4496 max_blocks = (EXT4_BLOCK_ALIGN(len + offset, blkbits) >> blkbits)
4499 * credits to insert 1 extent into extent tree
4501 credits = ext4_chunk_trans_blocks(inode, max_blocks);
4502 mutex_lock(&inode->i_mutex);
4503 ret = inode_newsize_ok(inode, (len + offset));
4505 mutex_unlock(&inode->i_mutex);
4506 trace_ext4_fallocate_exit(inode, offset, max_blocks, ret);
4509 flags = EXT4_GET_BLOCKS_CREATE_UNINIT_EXT;
4510 if (mode & FALLOC_FL_KEEP_SIZE)
4511 flags |= EXT4_GET_BLOCKS_KEEP_SIZE;
4513 * Don't normalize the request if it can fit in one extent so
4514 * that it doesn't get unnecessarily split into multiple
4517 if (len <= EXT_UNINIT_MAX_LEN << blkbits)
4518 flags |= EXT4_GET_BLOCKS_NO_NORMALIZE;
4521 while (ret >= 0 && ret < max_blocks) {
4522 map.m_lblk = map.m_lblk + ret;
4523 map.m_len = max_blocks = max_blocks - ret;
4524 handle = ext4_journal_start(inode, EXT4_HT_MAP_BLOCKS,
4526 if (IS_ERR(handle)) {
4527 ret = PTR_ERR(handle);
4530 ret = ext4_map_blocks(handle, inode, &map, flags);
4533 ext4_warning(inode->i_sb,
4534 "inode #%lu: block %u: len %u: "
4535 "ext4_ext_map_blocks returned %d",
4536 inode->i_ino, map.m_lblk,
4539 ext4_mark_inode_dirty(handle, inode);
4540 ret2 = ext4_journal_stop(handle);
4543 if ((map.m_lblk + ret) >= (EXT4_BLOCK_ALIGN(offset + len,
4544 blkbits) >> blkbits))
4545 new_size = offset + len;
4547 new_size = ((loff_t) map.m_lblk + ret) << blkbits;
4549 ext4_falloc_update_inode(inode, mode, new_size,
4550 (map.m_flags & EXT4_MAP_NEW));
4551 ext4_mark_inode_dirty(handle, inode);
4552 if ((file->f_flags & O_SYNC) && ret >= max_blocks)
4553 ext4_handle_sync(handle);
4554 ret2 = ext4_journal_stop(handle);
4558 if (ret == -ENOSPC &&
4559 ext4_should_retry_alloc(inode->i_sb, &retries)) {
4563 mutex_unlock(&inode->i_mutex);
4564 trace_ext4_fallocate_exit(inode, offset, max_blocks,
4565 ret > 0 ? ret2 : ret);
4566 return ret > 0 ? ret2 : ret;
4570 * This function convert a range of blocks to written extents
4571 * The caller of this function will pass the start offset and the size.
4572 * all unwritten extents within this range will be converted to
4575 * This function is called from the direct IO end io call back
4576 * function, to convert the fallocated extents after IO is completed.
4577 * Returns 0 on success.
4579 int ext4_convert_unwritten_extents(struct inode *inode, loff_t offset,
4583 unsigned int max_blocks;
4586 struct ext4_map_blocks map;
4587 unsigned int credits, blkbits = inode->i_blkbits;
4589 map.m_lblk = offset >> blkbits;
4591 * We can't just convert len to max_blocks because
4592 * If blocksize = 4096 offset = 3072 and len = 2048
4594 max_blocks = ((EXT4_BLOCK_ALIGN(len + offset, blkbits) >> blkbits) -
4597 * credits to insert 1 extent into extent tree
4599 credits = ext4_chunk_trans_blocks(inode, max_blocks);
4600 while (ret >= 0 && ret < max_blocks) {
4602 map.m_len = (max_blocks -= ret);
4603 handle = ext4_journal_start(inode, EXT4_HT_MAP_BLOCKS, credits);
4604 if (IS_ERR(handle)) {
4605 ret = PTR_ERR(handle);
4608 ret = ext4_map_blocks(handle, inode, &map,
4609 EXT4_GET_BLOCKS_IO_CONVERT_EXT);
4611 ext4_warning(inode->i_sb,
4612 "inode #%lu: block %u: len %u: "
4613 "ext4_ext_map_blocks returned %d",
4614 inode->i_ino, map.m_lblk,
4616 ext4_mark_inode_dirty(handle, inode);
4617 ret2 = ext4_journal_stop(handle);
4618 if (ret <= 0 || ret2 )
4621 return ret > 0 ? ret2 : ret;
4625 * If newes is not existing extent (newes->ec_pblk equals zero) find
4626 * delayed extent at start of newes and update newes accordingly and
4627 * return start of the next delayed extent.
4629 * If newes is existing extent (newes->ec_pblk is not equal zero)
4630 * return start of next delayed extent or EXT_MAX_BLOCKS if no delayed
4631 * extent found. Leave newes unmodified.
4633 static int ext4_find_delayed_extent(struct inode *inode,
4634 struct extent_status *newes)
4636 struct extent_status es;
4637 ext4_lblk_t block, next_del;
4639 if (newes->es_pblk == 0) {
4640 ext4_es_find_delayed_extent_range(inode, newes->es_lblk,
4641 newes->es_lblk + newes->es_len - 1, &es);
4644 * No extent in extent-tree contains block @newes->es_pblk,
4645 * then the block may stay in 1)a hole or 2)delayed-extent.
4651 if (es.es_lblk > newes->es_lblk) {
4653 newes->es_len = min(es.es_lblk - newes->es_lblk,
4658 newes->es_len = es.es_lblk + es.es_len - newes->es_lblk;
4661 block = newes->es_lblk + newes->es_len;
4662 ext4_es_find_delayed_extent_range(inode, block, EXT_MAX_BLOCKS, &es);
4664 next_del = EXT_MAX_BLOCKS;
4666 next_del = es.es_lblk;
4670 /* fiemap flags we can handle specified here */
4671 #define EXT4_FIEMAP_FLAGS (FIEMAP_FLAG_SYNC|FIEMAP_FLAG_XATTR)
4673 static int ext4_xattr_fiemap(struct inode *inode,
4674 struct fiemap_extent_info *fieinfo)
4678 __u32 flags = FIEMAP_EXTENT_LAST;
4679 int blockbits = inode->i_sb->s_blocksize_bits;
4683 if (ext4_test_inode_state(inode, EXT4_STATE_XATTR)) {
4684 struct ext4_iloc iloc;
4685 int offset; /* offset of xattr in inode */
4687 error = ext4_get_inode_loc(inode, &iloc);
4690 physical = (__u64)iloc.bh->b_blocknr << blockbits;
4691 offset = EXT4_GOOD_OLD_INODE_SIZE +
4692 EXT4_I(inode)->i_extra_isize;
4694 length = EXT4_SB(inode->i_sb)->s_inode_size - offset;
4695 flags |= FIEMAP_EXTENT_DATA_INLINE;
4697 } else { /* external block */
4698 physical = (__u64)EXT4_I(inode)->i_file_acl << blockbits;
4699 length = inode->i_sb->s_blocksize;
4703 error = fiemap_fill_next_extent(fieinfo, 0, physical,
4705 return (error < 0 ? error : 0);
4708 int ext4_fiemap(struct inode *inode, struct fiemap_extent_info *fieinfo,
4709 __u64 start, __u64 len)
4711 ext4_lblk_t start_blk;
4714 if (ext4_has_inline_data(inode)) {
4717 error = ext4_inline_data_fiemap(inode, fieinfo, &has_inline);
4723 /* fallback to generic here if not in extents fmt */
4724 if (!(ext4_test_inode_flag(inode, EXT4_INODE_EXTENTS)))
4725 return generic_block_fiemap(inode, fieinfo, start, len,
4728 if (fiemap_check_flags(fieinfo, EXT4_FIEMAP_FLAGS))
4731 if (fieinfo->fi_flags & FIEMAP_FLAG_XATTR) {
4732 error = ext4_xattr_fiemap(inode, fieinfo);
4734 ext4_lblk_t len_blks;
4737 start_blk = start >> inode->i_sb->s_blocksize_bits;
4738 last_blk = (start + len - 1) >> inode->i_sb->s_blocksize_bits;
4739 if (last_blk >= EXT_MAX_BLOCKS)
4740 last_blk = EXT_MAX_BLOCKS-1;
4741 len_blks = ((ext4_lblk_t) last_blk) - start_blk + 1;
4744 * Walk the extent tree gathering extent information
4745 * and pushing extents back to the user.
4747 error = ext4_fill_fiemap_extents(inode, start_blk,