fs/ext4/extents.c

   1 // SPDX-License-Identifier: GPL-2.0
   2 /*
   3  * Copyright (c) 2003-2006, Cluster File Systems, Inc, info@clusterfs.com
   4  * Written by Alex Tomas <alex@clusterfs.com>
   5  *
   6  * Architecture independence:
   7  *   Copyright (c) 2005, Bull S.A.
   8  *   Written by Pierre Peiffer <pierre.peiffer@bull.net>
   9  */
  10
  11 /*
  12  * Extents support for EXT4
  13  *
  14  * TODO:
  15  *   - ext4*_error() should be used in some situations
  16  *   - analyze all BUG()/BUG_ON(), use -EIO where appropriate
  17  *   - smart tree reduction
  18  */
  19
  20 #include <linux/fs.h>
  21 #include <linux/time.h>
  22 #include <linux/jbd2.h>
  23 #include <linux/highuid.h>
  24 #include <linux/pagemap.h>
  25 #include <linux/quotaops.h>
  26 #include <linux/string.h>
  27 #include <linux/slab.h>
  28 #include <linux/uaccess.h>
  29 #include <linux/fiemap.h>
  30 #include <linux/backing-dev.h>
  31 #include "ext4_jbd2.h"
  32 #include "ext4_extents.h"
  33 #include "xattr.h"
  34
  35 #include <trace/events/ext4.h>
  36
  37 /*
  38  * used by extent splitting.
  39  */
  40 #define EXT4_EXT_MAY_ZEROOUT    0x1  /* safe to zeroout if split fails \
  41                                         due to ENOSPC */
  42 #define EXT4_EXT_MARK_UNWRIT1   0x2  /* mark first half unwritten */
  43 #define EXT4_EXT_MARK_UNWRIT2   0x4  /* mark second half unwritten */
  44
  45 #define EXT4_EXT_DATA_VALID1    0x8  /* first half contains valid data */
  46 #define EXT4_EXT_DATA_VALID2    0x10 /* second half contains valid data */
  47
  48 static __le32 ext4_extent_block_csum(struct inode *inode,
  49                                      struct ext4_extent_header *eh)
  50 {
  51         struct ext4_inode_info *ei = EXT4_I(inode);
  52         struct ext4_sb_info *sbi = EXT4_SB(inode->i_sb);
  53         __u32 csum;
  54
  55         csum = ext4_chksum(sbi, ei->i_csum_seed, (__u8 *)eh,
  56                            EXT4_EXTENT_TAIL_OFFSET(eh));
  57         return cpu_to_le32(csum);
  58 }
  59
  60 static int ext4_extent_block_csum_verify(struct inode *inode,
  61                                          struct ext4_extent_header *eh)
  62 {
  63         struct ext4_extent_tail *et;
  64
  65         if (!ext4_has_metadata_csum(inode->i_sb))
  66                 return 1;
  67
  68         et = find_ext4_extent_tail(eh);
  69         if (et->et_checksum != ext4_extent_block_csum(inode, eh))
  70                 return 0;
  71         return 1;
  72 }
  73
  74 static void ext4_extent_block_csum_set(struct inode *inode,
  75                                        struct ext4_extent_header *eh)
  76 {
  77         struct ext4_extent_tail *et;
  78
  79         if (!ext4_has_metadata_csum(inode->i_sb))
  80                 return;
  81
  82         et = find_ext4_extent_tail(eh);
  83         et->et_checksum = ext4_extent_block_csum(inode, eh);
  84 }
  85
  86 static int ext4_split_extent(handle_t *handle,
  87                                 struct inode *inode,
  88                                 struct ext4_ext_path **ppath,
  89                                 struct ext4_map_blocks *map,
  90                                 int split_flag,
  91                                 int flags);
  92
  93 static int ext4_split_extent_at(handle_t *handle,
  94                              struct inode *inode,
  95                              struct ext4_ext_path **ppath,
  96                              ext4_lblk_t split,
  97                              int split_flag,
  98                              int flags);
  99
 100 static int ext4_find_delayed_extent(struct inode *inode,
 101                                     struct extent_status *newes);
 102
 103 static int ext4_ext_trunc_restart_fn(struct inode *inode, int *dropped)
 104 {
 105         /*
 106          * Drop i_data_sem to avoid deadlock with ext4_map_blocks.  At this
 107          * moment, get_block can be called only for blocks inside i_size since
 108          * page cache has been already dropped and writes are blocked by
 109          * i_mutex. So we can safely drop the i_data_sem here.
 110          */
 111         BUG_ON(EXT4_JOURNAL(inode) == NULL);
 112         ext4_discard_preallocations(inode);
 113         up_write(&EXT4_I(inode)->i_data_sem);
 114         *dropped = 1;
 115         return 0;
 116 }
 117
 118 /*
 119  * Make sure 'handle' has at least 'check_cred' credits. If not, restart
 120  * transaction with 'restart_cred' credits. The function drops i_data_sem
 121  * when restarting transaction and gets it after transaction is restarted.
 122  *
 123  * The function returns 0 on success, 1 if transaction had to be restarted,
 124  * and < 0 in case of fatal error.
 125  */
 126 int ext4_datasem_ensure_credits(handle_t *handle, struct inode *inode,
 127                                 int check_cred, int restart_cred,
 128                                 int revoke_cred)
 129 {
 130         int ret;
 131         int dropped = 0;
 132
 133         ret = ext4_journal_ensure_credits_fn(handle, check_cred, restart_cred,
 134                 revoke_cred, ext4_ext_trunc_restart_fn(inode, &dropped));
 135         if (dropped)
 136                 down_write(&EXT4_I(inode)->i_data_sem);
 137         return ret;
 138 }
 139
 140 /*
 141  * could return:
 142  *  - EROFS
 143  *  - ENOMEM
 144  */
 145 static int ext4_ext_get_access(handle_t *handle, struct inode *inode,
 146                                 struct ext4_ext_path *path)
 147 {
 148         if (path->p_bh) {
 149                 /* path points to block */
 150                 BUFFER_TRACE(path->p_bh, "get_write_access");
 151                 return ext4_journal_get_write_access(handle, path->p_bh);
 152         }
 153         /* path points to leaf/index in inode body */
 154         /* we use in-core data, no need to protect them */
 155         return 0;
 156 }
 157
 158 /*
 159  * could return:
 160  *  - EROFS
 161  *  - ENOMEM
 162  *  - EIO
 163  */
 164 static int __ext4_ext_dirty(const char *where, unsigned int line,
 165                             handle_t *handle, struct inode *inode,
 166                             struct ext4_ext_path *path)
 167 {
 168         int err;
 169
 170         WARN_ON(!rwsem_is_locked(&EXT4_I(inode)->i_data_sem));
 171         if (path->p_bh) {
 172                 ext4_extent_block_csum_set(inode, ext_block_hdr(path->p_bh));
 173                 /* path points to block */
 174                 err = __ext4_handle_dirty_metadata(where, line, handle,
 175                                                    inode, path->p_bh);
 176         } else {
 177                 /* path points to leaf/index in inode body */
 178                 err = ext4_mark_inode_dirty(handle, inode);
 179         }
 180         return err;
 181 }
 182
 183 #define ext4_ext_dirty(handle, inode, path) \
 184                 __ext4_ext_dirty(__func__, __LINE__, (handle), (inode), (path))
 185
 186 static ext4_fsblk_t ext4_ext_find_goal(struct inode *inode,
 187                               struct ext4_ext_path *path,
 188                               ext4_lblk_t block)
 189 {
 190         if (path) {
 191                 int depth = path->p_depth;
 192                 struct ext4_extent *ex;
 193
 194                 /*
 195                  * Try to predict block placement assuming that we are
 196                  * filling in a file which will eventually be
 197                  * non-sparse --- i.e., in the case of libbfd writing
 198                  * an ELF object sections out-of-order but in a way
 199                  * the eventually results in a contiguous object or
 200                  * executable file, or some database extending a table
 201                  * space file.  However, this is actually somewhat
 202                  * non-ideal if we are writing a sparse file such as
 203                  * qemu or KVM writing a raw image file that is going
 204                  * to stay fairly sparse, since it will end up
 205                  * fragmenting the file system's free space.  Maybe we
 206                  * should have some hueristics or some way to allow
 207                  * userspace to pass a hint to file system,
 208                  * especially if the latter case turns out to be
 209                  * common.
 210                  */
 211                 ex = path[depth].p_ext;
 212                 if (ex) {
 213                         ext4_fsblk_t ext_pblk = ext4_ext_pblock(ex);
 214                         ext4_lblk_t ext_block = le32_to_cpu(ex->ee_block);
 215
 216                         if (block > ext_block)
 217                                 return ext_pblk + (block - ext_block);
 218                         else
 219                                 return ext_pblk - (ext_block - block);
 220                 }
 221
 222                 /* it looks like index is empty;
 223                  * try to find starting block from index itself */
 224                 if (path[depth].p_bh)
 225                         return path[depth].p_bh->b_blocknr;
 226         }
 227
 228         /* OK. use inode's group */
 229         return ext4_inode_to_goal_block(inode);
 230 }
 231
 232 /*
 233  * Allocation for a meta data block
 234  */
 235 static ext4_fsblk_t
 236 ext4_ext_new_meta_block(handle_t *handle, struct inode *inode,
 237                         struct ext4_ext_path *path,
 238                         struct ext4_extent *ex, int *err, unsigned int flags)
 239 {
 240         ext4_fsblk_t goal, newblock;
 241
 242         goal = ext4_ext_find_goal(inode, path, le32_to_cpu(ex->ee_block));
 243         newblock = ext4_new_meta_blocks(handle, inode, goal, flags,
 244                                         NULL, err);
 245         return newblock;
 246 }
 247
 248 static inline int ext4_ext_space_block(struct inode *inode, int check)
 249 {
 250         int size;
 251
 252         size = (inode->i_sb->s_blocksize - sizeof(struct ext4_extent_header))
 253                         / sizeof(struct ext4_extent);
 254 #ifdef AGGRESSIVE_TEST
 255         if (!check && size > 6)
 256                 size = 6;
 257 #endif
 258         return size;
 259 }
 260
 261 static inline int ext4_ext_space_block_idx(struct inode *inode, int check)
 262 {
 263         int size;
 264
 265         size = (inode->i_sb->s_blocksize - sizeof(struct ext4_extent_header))
 266                         / sizeof(struct ext4_extent_idx);
 267 #ifdef AGGRESSIVE_TEST
 268         if (!check && size > 5)
 269                 size = 5;
 270 #endif
 271         return size;
 272 }
 273
 274 static inline int ext4_ext_space_root(struct inode *inode, int check)
 275 {
 276         int size;
 277
 278         size = sizeof(EXT4_I(inode)->i_data);
 279         size -= sizeof(struct ext4_extent_header);
 280         size /= sizeof(struct ext4_extent);
 281 #ifdef AGGRESSIVE_TEST
 282         if (!check && size > 3)
 283                 size = 3;
 284 #endif
 285         return size;
 286 }
 287
 288 static inline int ext4_ext_space_root_idx(struct inode *inode, int check)
 289 {
 290         int size;
 291
 292         size = sizeof(EXT4_I(inode)->i_data);
 293         size -= sizeof(struct ext4_extent_header);
 294         size /= sizeof(struct ext4_extent_idx);
 295 #ifdef AGGRESSIVE_TEST
 296         if (!check && size > 4)
 297                 size = 4;
 298 #endif
 299         return size;
 300 }
 301
 302 static inline int
 303 ext4_force_split_extent_at(handle_t *handle, struct inode *inode,
 304                            struct ext4_ext_path **ppath, ext4_lblk_t lblk,
 305                            int nofail)
 306 {
 307         struct ext4_ext_path *path = *ppath;
 308         int unwritten = ext4_ext_is_unwritten(path[path->p_depth].p_ext);
 309
 310         return ext4_split_extent_at(handle, inode, ppath, lblk, unwritten ?
 311                         EXT4_EXT_MARK_UNWRIT1|EXT4_EXT_MARK_UNWRIT2 : 0,
 312                         EXT4_EX_NOCACHE | EXT4_GET_BLOCKS_PRE_IO |
 313                         (nofail ? EXT4_GET_BLOCKS_METADATA_NOFAIL:0));
 314 }
 315
 316 static int
 317 ext4_ext_max_entries(struct inode *inode, int depth)
 318 {
 319         int max;
 320
 321         if (depth == ext_depth(inode)) {
 322                 if (depth == 0)
 323                         max = ext4_ext_space_root(inode, 1);
 324                 else
 325                         max = ext4_ext_space_root_idx(inode, 1);
 326         } else {
 327                 if (depth == 0)
 328                         max = ext4_ext_space_block(inode, 1);
 329                 else
 330                         max = ext4_ext_space_block_idx(inode, 1);
 331         }
 332
 333         return max;
 334 }
 335
 336 static int ext4_valid_extent(struct inode *inode, struct ext4_extent *ext)
 337 {
 338         ext4_fsblk_t block = ext4_ext_pblock(ext);
 339         int len = ext4_ext_get_actual_len(ext);
 340         ext4_lblk_t lblock = le32_to_cpu(ext->ee_block);
 341
 342         /*
 343          * We allow neither:
 344          *  - zero length
 345          *  - overflow/wrap-around
 346          */
 347         if (lblock + len <= lblock)
 348                 return 0;
 349         return ext4_data_block_valid(EXT4_SB(inode->i_sb), block, len);
 350 }
 351
 352 static int ext4_valid_extent_idx(struct inode *inode,
 353                                 struct ext4_extent_idx *ext_idx)
 354 {
 355         ext4_fsblk_t block = ext4_idx_pblock(ext_idx);
 356
 357         return ext4_data_block_valid(EXT4_SB(inode->i_sb), block, 1);
 358 }
 359
 360 static int ext4_valid_extent_entries(struct inode *inode,
 361                                 struct ext4_extent_header *eh,
 362                                 int depth)
 363 {
 364         unsigned short entries;
 365         if (eh->eh_entries == 0)
 366                 return 1;
 367
 368         entries = le16_to_cpu(eh->eh_entries);
 369
 370         if (depth == 0) {
 371                 /* leaf entries */
 372                 struct ext4_extent *ext = EXT_FIRST_EXTENT(eh);
 373                 struct ext4_super_block *es = EXT4_SB(inode->i_sb)->s_es;
 374                 ext4_fsblk_t pblock = 0;
 375                 ext4_lblk_t lblock = 0;
 376                 ext4_lblk_t prev = 0;
 377                 int len = 0;
 378                 while (entries) {
 379                         if (!ext4_valid_extent(inode, ext))
 380                                 return 0;
 381
 382                         /* Check for overlapping extents */
 383                         lblock = le32_to_cpu(ext->ee_block);
 384                         len = ext4_ext_get_actual_len(ext);
 385                         if ((lblock <= prev) && prev) {
 386                                 pblock = ext4_ext_pblock(ext);
 387                                 es->s_last_error_block = cpu_to_le64(pblock);
 388                                 return 0;
 389                         }
 390                         ext++;
 391                         entries--;
 392                         prev = lblock + len - 1;
 393                 }
 394         } else {
 395                 struct ext4_extent_idx *ext_idx = EXT_FIRST_INDEX(eh);
 396                 while (entries) {
 397                         if (!ext4_valid_extent_idx(inode, ext_idx))
 398                                 return 0;
 399                         ext_idx++;
 400                         entries--;
 401                 }
 402         }
 403         return 1;
 404 }
 405
 406 static int __ext4_ext_check(const char *function, unsigned int line,
 407                             struct inode *inode, struct ext4_extent_header *eh,
 408                             int depth, ext4_fsblk_t pblk)
 409 {
 410         const char *error_msg;
 411         int max = 0, err = -EFSCORRUPTED;
 412
 413         if (unlikely(eh->eh_magic != EXT4_EXT_MAGIC)) {
 414                 error_msg = "invalid magic";
 415                 goto corrupted;
 416         }
 417         if (unlikely(le16_to_cpu(eh->eh_depth) != depth)) {
 418                 error_msg = "unexpected eh_depth";
 419                 goto corrupted;
 420         }
 421         if (unlikely(eh->eh_max == 0)) {
 422                 error_msg = "invalid eh_max";
 423                 goto corrupted;
 424         }
 425         max = ext4_ext_max_entries(inode, depth);
 426         if (unlikely(le16_to_cpu(eh->eh_max) > max)) {
 427                 error_msg = "too large eh_max";
 428                 goto corrupted;
 429         }
 430         if (unlikely(le16_to_cpu(eh->eh_entries) > le16_to_cpu(eh->eh_max))) {
 431                 error_msg = "invalid eh_entries";
 432                 goto corrupted;
 433         }
 434         if (!ext4_valid_extent_entries(inode, eh, depth)) {
 435                 error_msg = "invalid extent entries";
 436                 goto corrupted;
 437         }
 438         if (unlikely(depth > 32)) {
 439                 error_msg = "too large eh_depth";
 440                 goto corrupted;
 441         }
 442         /* Verify checksum on non-root extent tree nodes */
 443         if (ext_depth(inode) != depth &&
 444             !ext4_extent_block_csum_verify(inode, eh)) {
 445                 error_msg = "extent tree corrupted";
 446                 err = -EFSBADCRC;
 447                 goto corrupted;
 448         }
 449         return 0;
 450
 451 corrupted:
 452         ext4_set_errno(inode->i_sb, -err);
 453         ext4_error_inode(inode, function, line, 0,
 454                          "pblk %llu bad header/extent: %s - magic %x, "
 455                          "entries %u, max %u(%u), depth %u(%u)",
 456                          (unsigned long long) pblk, error_msg,
 457                          le16_to_cpu(eh->eh_magic),
 458                          le16_to_cpu(eh->eh_entries), le16_to_cpu(eh->eh_max),
 459                          max, le16_to_cpu(eh->eh_depth), depth);
 460         return err;
 461 }
 462
 463 #define ext4_ext_check(inode, eh, depth, pblk)                  \
 464         __ext4_ext_check(__func__, __LINE__, (inode), (eh), (depth), (pblk))
 465
 466 int ext4_ext_check_inode(struct inode *inode)
 467 {
 468         return ext4_ext_check(inode, ext_inode_hdr(inode), ext_depth(inode), 0);
 469 }
 470
 471 static struct buffer_head *
 472 __read_extent_tree_block(const char *function, unsigned int line,
 473                          struct inode *inode, ext4_fsblk_t pblk, int depth,
 474                          int flags)
 475 {
 476         struct buffer_head              *bh;
 477         int                             err;
 478
 479         bh = sb_getblk_gfp(inode->i_sb, pblk, __GFP_MOVABLE | GFP_NOFS);
 480         if (unlikely(!bh))
 481                 return ERR_PTR(-ENOMEM);
 482
 483         if (!bh_uptodate_or_lock(bh)) {
 484                 trace_ext4_ext_load_extent(inode, pblk, _RET_IP_);
 485                 err = bh_submit_read(bh);
 486                 if (err < 0)
 487                         goto errout;
 488         }
 489         if (buffer_verified(bh) && !(flags & EXT4_EX_FORCE_CACHE))
 490                 return bh;
 491         if (!ext4_has_feature_journal(inode->i_sb) ||
 492             (inode->i_ino !=
 493              le32_to_cpu(EXT4_SB(inode->i_sb)->s_es->s_journal_inum))) {
 494                 err = __ext4_ext_check(function, line, inode,
 495                                        ext_block_hdr(bh), depth, pblk);
 496                 if (err)
 497                         goto errout;
 498         }
 499         set_buffer_verified(bh);
 500         /*
 501          * If this is a leaf block, cache all of its entries
 502          */
 503         if (!(flags & EXT4_EX_NOCACHE) && depth == 0) {
 504                 struct ext4_extent_header *eh = ext_block_hdr(bh);
 505                 struct ext4_extent *ex = EXT_FIRST_EXTENT(eh);
 506                 ext4_lblk_t prev = 0;
 507                 int i;
 508
 509                 for (i = le16_to_cpu(eh->eh_entries); i > 0; i--, ex++) {
 510                         unsigned int status = EXTENT_STATUS_WRITTEN;
 511                         ext4_lblk_t lblk = le32_to_cpu(ex->ee_block);
 512                         int len = ext4_ext_get_actual_len(ex);
 513
 514                         if (prev && (prev != lblk))
 515                                 ext4_es_cache_extent(inode, prev,
 516                                                      lblk - prev, ~0,
 517                                                      EXTENT_STATUS_HOLE);
 518
 519                         if (ext4_ext_is_unwritten(ex))
 520                                 status = EXTENT_STATUS_UNWRITTEN;
 521                         ext4_es_cache_extent(inode, lblk, len,
 522                                              ext4_ext_pblock(ex), status);
 523                         prev = lblk + len;
 524                 }
 525         }
 526         return bh;
 527 errout:
 528         put_bh(bh);
 529         return ERR_PTR(err);
 530
 531 }
 532
 533 #define read_extent_tree_block(inode, pblk, depth, flags)               \
 534         __read_extent_tree_block(__func__, __LINE__, (inode), (pblk),   \
 535                                  (depth), (flags))
 536
 537 /*
 538  * This function is called to cache a file's extent information in the
 539  * extent status tree
 540  */
 541 int ext4_ext_precache(struct inode *inode)
 542 {
 543         struct ext4_inode_info *ei = EXT4_I(inode);
 544         struct ext4_ext_path *path = NULL;
 545         struct buffer_head *bh;
 546         int i = 0, depth, ret = 0;
 547
 548         if (!ext4_test_inode_flag(inode, EXT4_INODE_EXTENTS))
 549                 return 0;       /* not an extent-mapped inode */
 550
 551         down_read(&ei->i_data_sem);
 552         depth = ext_depth(inode);
 553
 554         path = kcalloc(depth + 1, sizeof(struct ext4_ext_path),
 555                        GFP_NOFS);
 556         if (path == NULL) {
 557                 up_read(&ei->i_data_sem);
 558                 return -ENOMEM;
 559         }
 560
 561         /* Don't cache anything if there are no external extent blocks */
 562         if (depth == 0)
 563                 goto out;
 564         path[0].p_hdr = ext_inode_hdr(inode);
 565         ret = ext4_ext_check(inode, path[0].p_hdr, depth, 0);
 566         if (ret)
 567                 goto out;
 568         path[0].p_idx = EXT_FIRST_INDEX(path[0].p_hdr);
 569         while (i >= 0) {
 570                 /*
 571                  * If this is a leaf block or we've reached the end of
 572                  * the index block, go up
 573                  */
 574                 if ((i == depth) ||
 575                     path[i].p_idx > EXT_LAST_INDEX(path[i].p_hdr)) {
 576                         brelse(path[i].p_bh);
 577                         path[i].p_bh = NULL;
 578                         i--;
 579                         continue;
 580                 }
 581                 bh = read_extent_tree_block(inode,
 582                                             ext4_idx_pblock(path[i].p_idx++),
 583                                             depth - i - 1,
 584                                             EXT4_EX_FORCE_CACHE);
 585                 if (IS_ERR(bh)) {
 586                         ret = PTR_ERR(bh);
 587                         break;
 588                 }
 589                 i++;
 590                 path[i].p_bh = bh;
 591                 path[i].p_hdr = ext_block_hdr(bh);
 592                 path[i].p_idx = EXT_FIRST_INDEX(path[i].p_hdr);
 593         }
 594         ext4_set_inode_state(inode, EXT4_STATE_EXT_PRECACHED);
 595 out:
 596         up_read(&ei->i_data_sem);
 597         ext4_ext_drop_refs(path);
 598         kfree(path);
 599         return ret;
 600 }
 601
 602 #ifdef EXT_DEBUG
 603 static void ext4_ext_show_path(struct inode *inode, struct ext4_ext_path *path)
 604 {
 605         int k, l = path->p_depth;
 606
 607         ext_debug("path:");
 608         for (k = 0; k <= l; k++, path++) {
 609                 if (path->p_idx) {
 610                   ext_debug("  %d->%llu", le32_to_cpu(path->p_idx->ei_block),
 611                             ext4_idx_pblock(path->p_idx));
 612                 } else if (path->p_ext) {
 613                         ext_debug("  %d:[%d]%d:%llu ",
 614                                   le32_to_cpu(path->p_ext->ee_block),
 615                                   ext4_ext_is_unwritten(path->p_ext),
 616                                   ext4_ext_get_actual_len(path->p_ext),
 617                                   ext4_ext_pblock(path->p_ext));
 618                 } else
 619                         ext_debug("  []");
 620         }
 621         ext_debug("\n");
 622 }
 623
 624 static void ext4_ext_show_leaf(struct inode *inode, struct ext4_ext_path *path)
 625 {
 626         int depth = ext_depth(inode);
 627         struct ext4_extent_header *eh;
 628         struct ext4_extent *ex;
 629         int i;
 630
 631         if (!path)
 632                 return;
 633
 634         eh = path[depth].p_hdr;
 635         ex = EXT_FIRST_EXTENT(eh);
 636
 637         ext_debug("Displaying leaf extents for inode %lu\n", inode->i_ino);
 638
 639         for (i = 0; i < le16_to_cpu(eh->eh_entries); i++, ex++) {
 640                 ext_debug("%d:[%d]%d:%llu ", le32_to_cpu(ex->ee_block),
 641                           ext4_ext_is_unwritten(ex),
 642                           ext4_ext_get_actual_len(ex), ext4_ext_pblock(ex));
 643         }
 644         ext_debug("\n");
 645 }
 646
 647 static void ext4_ext_show_move(struct inode *inode, struct ext4_ext_path *path,
 648                         ext4_fsblk_t newblock, int level)
 649 {
 650         int depth = ext_depth(inode);
 651         struct ext4_extent *ex;
 652
 653         if (depth != level) {
 654                 struct ext4_extent_idx *idx;
 655                 idx = path[level].p_idx;
 656                 while (idx <= EXT_MAX_INDEX(path[level].p_hdr)) {
 657                         ext_debug("%d: move %d:%llu in new index %llu\n", level,
 658                                         le32_to_cpu(idx->ei_block),
 659                                         ext4_idx_pblock(idx),
 660                                         newblock);
 661                         idx++;
 662                 }
 663
 664                 return;
 665         }
 666
 667         ex = path[depth].p_ext;
 668         while (ex <= EXT_MAX_EXTENT(path[depth].p_hdr)) {
 669                 ext_debug("move %d:%llu:[%d]%d in new leaf %llu\n",
 670                                 le32_to_cpu(ex->ee_block),
 671                                 ext4_ext_pblock(ex),
 672                                 ext4_ext_is_unwritten(ex),
 673                                 ext4_ext_get_actual_len(ex),
 674                                 newblock);
 675                 ex++;
 676         }
 677 }
 678
 679 #else
 680 #define ext4_ext_show_path(inode, path)
 681 #define ext4_ext_show_leaf(inode, path)
 682 #define ext4_ext_show_move(inode, path, newblock, level)
 683 #endif
 684
 685 void ext4_ext_drop_refs(struct ext4_ext_path *path)
 686 {
 687         int depth, i;
 688
 689         if (!path)
 690                 return;
 691         depth = path->p_depth;
 692         for (i = 0; i <= depth; i++, path++)
 693                 if (path->p_bh) {
 694                         brelse(path->p_bh);
 695                         path->p_bh = NULL;
 696                 }
 697 }
 698
 699 /*
 700  * ext4_ext_binsearch_idx:
 701  * binary search for the closest index of the given block
 702  * the header must be checked before calling this
 703  */
 704 static void
 705 ext4_ext_binsearch_idx(struct inode *inode,
 706                         struct ext4_ext_path *path, ext4_lblk_t block)
 707 {
 708         struct ext4_extent_header *eh = path->p_hdr;
 709         struct ext4_extent_idx *r, *l, *m;
 710
 711
 712         ext_debug("binsearch for %u(idx):  ", block);
 713
 714         l = EXT_FIRST_INDEX(eh) + 1;
 715         r = EXT_LAST_INDEX(eh);
 716         while (l <= r) {
 717                 m = l + (r - l) / 2;
 718                 if (block < le32_to_cpu(m->ei_block))
 719                         r = m - 1;
 720                 else
 721                         l = m + 1;
 722                 ext_debug("%p(%u):%p(%u):%p(%u) ", l, le32_to_cpu(l->ei_block),
 723                                 m, le32_to_cpu(m->ei_block),
 724                                 r, le32_to_cpu(r->ei_block));
 725         }
 726
 727         path->p_idx = l - 1;
 728         ext_debug("  -> %u->%lld ", le32_to_cpu(path->p_idx->ei_block),
 729                   ext4_idx_pblock(path->p_idx));
 730
 731 #ifdef CHECK_BINSEARCH
 732         {
 733                 struct ext4_extent_idx *chix, *ix;
 734                 int k;
 735
 736                 chix = ix = EXT_FIRST_INDEX(eh);
 737                 for (k = 0; k < le16_to_cpu(eh->eh_entries); k++, ix++) {
 738                   if (k != 0 &&
 739                       le32_to_cpu(ix->ei_block) <= le32_to_cpu(ix[-1].ei_block)) {
 740                                 printk(KERN_DEBUG "k=%d, ix=0x%p, "
 741                                        "first=0x%p\n", k,
 742                                        ix, EXT_FIRST_INDEX(eh));
 743                                 printk(KERN_DEBUG "%u <= %u\n",
 744                                        le32_to_cpu(ix->ei_block),
 745                                        le32_to_cpu(ix[-1].ei_block));
 746                         }
 747                         BUG_ON(k && le32_to_cpu(ix->ei_block)
 748                                            <= le32_to_cpu(ix[-1].ei_block));
 749                         if (block < le32_to_cpu(ix->ei_block))
 750                                 break;
 751                         chix = ix;
 752                 }
 753                 BUG_ON(chix != path->p_idx);
 754         }
 755 #endif
 756
 757 }
 758
 759 /*
 760  * ext4_ext_binsearch:
 761  * binary search for closest extent of the given block
 762  * the header must be checked before calling this
 763  */
 764 static void
 765 ext4_ext_binsearch(struct inode *inode,
 766                 struct ext4_ext_path *path, ext4_lblk_t block)
 767 {
 768         struct ext4_extent_header *eh = path->p_hdr;
 769         struct ext4_extent *r, *l, *m;
 770
 771         if (eh->eh_entries == 0) {
 772                 /*
 773                  * this leaf is empty:
 774                  * we get such a leaf in split/add case
 775                  */
 776                 return;
 777         }
 778
 779         ext_debug("binsearch for %u:  ", block);
 780
 781         l = EXT_FIRST_EXTENT(eh) + 1;
 782         r = EXT_LAST_EXTENT(eh);
 783
 784         while (l <= r) {
 785                 m = l + (r - l) / 2;
 786                 if (block < le32_to_cpu(m->ee_block))
 787                         r = m - 1;
 788                 else
 789                         l = m + 1;
 790                 ext_debug("%p(%u):%p(%u):%p(%u) ", l, le32_to_cpu(l->ee_block),
 791                                 m, le32_to_cpu(m->ee_block),
 792                                 r, le32_to_cpu(r->ee_block));
 793         }
 794
 795         path->p_ext = l - 1;
 796         ext_debug("  -> %d:%llu:[%d]%d ",
 797                         le32_to_cpu(path->p_ext->ee_block),
 798                         ext4_ext_pblock(path->p_ext),
 799                         ext4_ext_is_unwritten(path->p_ext),
 800                         ext4_ext_get_actual_len(path->p_ext));
 801
 802 #ifdef CHECK_BINSEARCH
 803         {
 804                 struct ext4_extent *chex, *ex;
 805                 int k;
 806
 807                 chex = ex = EXT_FIRST_EXTENT(eh);
 808                 for (k = 0; k < le16_to_cpu(eh->eh_entries); k++, ex++) {
 809                         BUG_ON(k && le32_to_cpu(ex->ee_block)
 810                                           <= le32_to_cpu(ex[-1].ee_block));
 811                         if (block < le32_to_cpu(ex->ee_block))
 812                                 break;
 813                         chex = ex;
 814                 }
 815                 BUG_ON(chex != path->p_ext);
 816         }
 817 #endif
 818
 819 }
 820
 821 int ext4_ext_tree_init(handle_t *handle, struct inode *inode)
 822 {
 823         struct ext4_extent_header *eh;
 824
 825         eh = ext_inode_hdr(inode);
 826         eh->eh_depth = 0;
 827         eh->eh_entries = 0;
 828         eh->eh_magic = EXT4_EXT_MAGIC;
 829         eh->eh_max = cpu_to_le16(ext4_ext_space_root(inode, 0));
 830         ext4_mark_inode_dirty(handle, inode);
 831         return 0;
 832 }
 833
 834 struct ext4_ext_path *
 835 ext4_find_extent(struct inode *inode, ext4_lblk_t block,
 836                  struct ext4_ext_path **orig_path, int flags)
 837 {
 838         struct ext4_extent_header *eh;
 839         struct buffer_head *bh;
 840         struct ext4_ext_path *path = orig_path ? *orig_path : NULL;
 841         short int depth, i, ppos = 0;
 842         int ret;
 843
 844         eh = ext_inode_hdr(inode);
 845         depth = ext_depth(inode);
 846         if (depth < 0 || depth > EXT4_MAX_EXTENT_DEPTH) {
 847                 EXT4_ERROR_INODE(inode, "inode has invalid extent depth: %d",
 848                                  depth);
 849                 ret = -EFSCORRUPTED;
 850                 goto err;
 851         }
 852
 853         if (path) {
 854                 ext4_ext_drop_refs(path);
 855                 if (depth > path[0].p_maxdepth) {
 856                         kfree(path);
 857                         *orig_path = path = NULL;
 858                 }
 859         }
 860         if (!path) {
 861                 /* account possible depth increase */
 862                 path = kcalloc(depth + 2, sizeof(struct ext4_ext_path),
 863                                 GFP_NOFS);
 864                 if (unlikely(!path))
 865                         return ERR_PTR(-ENOMEM);
 866                 path[0].p_maxdepth = depth + 1;
 867         }
 868         path[0].p_hdr = eh;
 869         path[0].p_bh = NULL;
 870
 871         i = depth;
 872         /* walk through the tree */
 873         while (i) {
 874                 ext_debug("depth %d: num %d, max %d\n",
 875                           ppos, le16_to_cpu(eh->eh_entries), le16_to_cpu(eh->eh_max));
 876
 877                 ext4_ext_binsearch_idx(inode, path + ppos, block);
 878                 path[ppos].p_block = ext4_idx_pblock(path[ppos].p_idx);
 879                 path[ppos].p_depth = i;
 880                 path[ppos].p_ext = NULL;
 881
 882                 bh = read_extent_tree_block(inode, path[ppos].p_block, --i,
 883                                             flags);
 884                 if (IS_ERR(bh)) {
 885                         ret = PTR_ERR(bh);
 886                         goto err;
 887                 }
 888
 889                 eh = ext_block_hdr(bh);
 890                 ppos++;
 891                 path[ppos].p_bh = bh;
 892                 path[ppos].p_hdr = eh;
 893         }
 894
 895         path[ppos].p_depth = i;
 896         path[ppos].p_ext = NULL;
 897         path[ppos].p_idx = NULL;
 898
 899         /* find extent */
 900         ext4_ext_binsearch(inode, path + ppos, block);
 901         /* if not an empty leaf */
 902         if (path[ppos].p_ext)
 903                 path[ppos].p_block = ext4_ext_pblock(path[ppos].p_ext);
 904
 905         ext4_ext_show_path(inode, path);
 906
 907         return path;
 908
 909 err:
 910         ext4_ext_drop_refs(path);
 911         kfree(path);
 912         if (orig_path)
 913                 *orig_path = NULL;
 914         return ERR_PTR(ret);
 915 }
 916
 917 /*
 918  * ext4_ext_insert_index:
 919  * insert new index [@logical;@ptr] into the block at @curp;
 920  * check where to insert: before @curp or after @curp
 921  */
 922 static int ext4_ext_insert_index(handle_t *handle, struct inode *inode,
 923                                  struct ext4_ext_path *curp,
 924                                  int logical, ext4_fsblk_t ptr)
 925 {
 926         struct ext4_extent_idx *ix;
 927         int len, err;
 928
 929         err = ext4_ext_get_access(handle, inode, curp);
 930         if (err)
 931                 return err;
 932
 933         if (unlikely(logical == le32_to_cpu(curp->p_idx->ei_block))) {
 934                 EXT4_ERROR_INODE(inode,
 935                                  "logical %d == ei_block %d!",
 936                                  logical, le32_to_cpu(curp->p_idx->ei_block));
 937                 return -EFSCORRUPTED;
 938         }
 939
 940         if (unlikely(le16_to_cpu(curp->p_hdr->eh_entries)
 941                              >= le16_to_cpu(curp->p_hdr->eh_max))) {
 942                 EXT4_ERROR_INODE(inode,
 943                                  "eh_entries %d >= eh_max %d!",
 944                                  le16_to_cpu(curp->p_hdr->eh_entries),
 945                                  le16_to_cpu(curp->p_hdr->eh_max));
 946                 return -EFSCORRUPTED;
 947         }
 948
 949         if (logical > le32_to_cpu(curp->p_idx->ei_block)) {
 950                 /* insert after */
 951                 ext_debug("insert new index %d after: %llu\n", logical, ptr);
 952                 ix = curp->p_idx + 1;
 953         } else {
 954                 /* insert before */
 955                 ext_debug("insert new index %d before: %llu\n", logical, ptr);
 956                 ix = curp->p_idx;
 957         }
 958
 959         len = EXT_LAST_INDEX(curp->p_hdr) - ix + 1;
 960         BUG_ON(len < 0);
 961         if (len > 0) {
 962                 ext_debug("insert new index %d: "
 963                                 "move %d indices from 0x%p to 0x%p\n",
 964                                 logical, len, ix, ix + 1);
 965                 memmove(ix + 1, ix, len * sizeof(struct ext4_extent_idx));
 966         }
 967
 968         if (unlikely(ix > EXT_MAX_INDEX(curp->p_hdr))) {
 969                 EXT4_ERROR_INODE(inode, "ix > EXT_MAX_INDEX!");
 970                 return -EFSCORRUPTED;
 971         }
 972
 973         ix->ei_block = cpu_to_le32(logical);
 974         ext4_idx_store_pblock(ix, ptr);
 975         le16_add_cpu(&curp->p_hdr->eh_entries, 1);
 976
 977         if (unlikely(ix > EXT_LAST_INDEX(curp->p_hdr))) {
 978                 EXT4_ERROR_INODE(inode, "ix > EXT_LAST_INDEX!");
 979                 return -EFSCORRUPTED;
 980         }
 981
 982         err = ext4_ext_dirty(handle, inode, curp);
 983         ext4_std_error(inode->i_sb, err);
 984
 985         return err;
 986 }
 987
 988 /*
 989  * ext4_ext_split:
 990  * inserts new subtree into the path, using free index entry
 991  * at depth @at:
 992  * - allocates all needed blocks (new leaf and all intermediate index blocks)
 993  * - makes decision where to split
 994  * - moves remaining extents and index entries (right to the split point)
 995  *   into the newly allocated blocks
 996  * - initializes subtree
 997  */
 998 static int ext4_ext_split(handle_t *handle, struct inode *inode,
 999                           unsigned int flags,
1000                           struct ext4_ext_path *path,
1001                           struct ext4_extent *newext, int at)
1002 {
1003         struct buffer_head *bh = NULL;
1004         int depth = ext_depth(inode);
1005         struct ext4_extent_header *neh;
1006         struct ext4_extent_idx *fidx;
1007         int i = at, k, m, a;
1008         ext4_fsblk_t newblock, oldblock;
1009         __le32 border;
1010         ext4_fsblk_t *ablocks = NULL; /* array of allocated blocks */
1011         int err = 0;
1012         size_t ext_size = 0;
1013
1014         /* make decision: where to split? */
1015         /* FIXME: now decision is simplest: at current extent */
1016
1017         /* if current leaf will be split, then we should use
1018          * border from split point */
1019         if (unlikely(path[depth].p_ext > EXT_MAX_EXTENT(path[depth].p_hdr))) {
1020                 EXT4_ERROR_INODE(inode, "p_ext > EXT_MAX_EXTENT!");
1021                 return -EFSCORRUPTED;
1022         }
1023         if (path[depth].p_ext != EXT_MAX_EXTENT(path[depth].p_hdr)) {
1024                 border = path[depth].p_ext[1].ee_block;
1025                 ext_debug("leaf will be split."
1026                                 " next leaf starts at %d\n",
1027                                   le32_to_cpu(border));
1028         } else {
1029                 border = newext->ee_block;
1030                 ext_debug("leaf will be added."
1031                                 " next leaf starts at %d\n",
1032                                 le32_to_cpu(border));
1033         }
1034
1035         /*
1036          * If error occurs, then we break processing
1037          * and mark filesystem read-only. index won't
1038          * be inserted and tree will be in consistent
1039          * state. Next mount will repair buffers too.
1040          */
1041
1042         /*
1043          * Get array to track all allocated blocks.
1044          * We need this to handle errors and free blocks
1045          * upon them.
1046          */
1047         ablocks = kcalloc(depth, sizeof(ext4_fsblk_t), GFP_NOFS);
1048         if (!ablocks)
1049                 return -ENOMEM;
1050
1051         /* allocate all needed blocks */
1052         ext_debug("allocate %d blocks for indexes/leaf\n", depth - at);
1053         for (a = 0; a < depth - at; a++) {
1054                 newblock = ext4_ext_new_meta_block(handle, inode, path,
1055                                                    newext, &err, flags);
1056                 if (newblock == 0)
1057                         goto cleanup;
1058                 ablocks[a] = newblock;
1059         }
1060
1061         /* initialize new leaf */
1062         newblock = ablocks[--a];
1063         if (unlikely(newblock == 0)) {
1064                 EXT4_ERROR_INODE(inode, "newblock == 0!");
1065                 err = -EFSCORRUPTED;
1066                 goto cleanup;
1067         }
1068         bh = sb_getblk_gfp(inode->i_sb, newblock, __GFP_MOVABLE | GFP_NOFS);
1069         if (unlikely(!bh)) {
1070                 err = -ENOMEM;
1071                 goto cleanup;
1072         }
1073         lock_buffer(bh);
1074
1075         err = ext4_journal_get_create_access(handle, bh);
1076         if (err)
1077                 goto cleanup;
1078
1079         neh = ext_block_hdr(bh);
1080         neh->eh_entries = 0;
1081         neh->eh_max = cpu_to_le16(ext4_ext_space_block(inode, 0));
1082         neh->eh_magic = EXT4_EXT_MAGIC;
1083         neh->eh_depth = 0;
1084
1085         /* move remainder of path[depth] to the new leaf */
1086         if (unlikely(path[depth].p_hdr->eh_entries !=
1087                      path[depth].p_hdr->eh_max)) {
1088                 EXT4_ERROR_INODE(inode, "eh_entries %d != eh_max %d!",
1089                                  path[depth].p_hdr->eh_entries,
1090                                  path[depth].p_hdr->eh_max);
1091                 err = -EFSCORRUPTED;
1092                 goto cleanup;
1093         }
1094         /* start copy from next extent */
1095         m = EXT_MAX_EXTENT(path[depth].p_hdr) - path[depth].p_ext++;
1096         ext4_ext_show_move(inode, path, newblock, depth);
1097         if (m) {
1098                 struct ext4_extent *ex;
1099                 ex = EXT_FIRST_EXTENT(neh);
1100                 memmove(ex, path[depth].p_ext, sizeof(struct ext4_extent) * m);
1101                 le16_add_cpu(&neh->eh_entries, m);
1102         }
1103
1104         /* zero out unused area in the extent block */
1105         ext_size = sizeof(struct ext4_extent_header) +
1106                 sizeof(struct ext4_extent) * le16_to_cpu(neh->eh_entries);
1107         memset(bh->b_data + ext_size, 0, inode->i_sb->s_blocksize - ext_size);
1108         ext4_extent_block_csum_set(inode, neh);
1109         set_buffer_uptodate(bh);
1110         unlock_buffer(bh);
1111
1112         err = ext4_handle_dirty_metadata(handle, inode, bh);
1113         if (err)
1114                 goto cleanup;
1115         brelse(bh);
1116         bh = NULL;
1117
1118         /* correct old leaf */
1119         if (m) {
1120                 err = ext4_ext_get_access(handle, inode, path + depth);
1121                 if (err)
1122                         goto cleanup;
1123                 le16_add_cpu(&path[depth].p_hdr->eh_entries, -m);
1124                 err = ext4_ext_dirty(handle, inode, path + depth);
1125                 if (err)
1126                         goto cleanup;
1127
1128         }
1129
1130         /* create intermediate indexes */
1131         k = depth - at - 1;
1132         if (unlikely(k < 0)) {
1133                 EXT4_ERROR_INODE(inode, "k %d < 0!", k);
1134                 err = -EFSCORRUPTED;
1135                 goto cleanup;
1136         }
1137         if (k)
1138                 ext_debug("create %d intermediate indices\n", k);
1139         /* insert new index into current index block */
1140         /* current depth stored in i var */
1141         i = depth - 1;
1142         while (k--) {
1143                 oldblock = newblock;
1144                 newblock = ablocks[--a];
1145                 bh = sb_getblk(inode->i_sb, newblock);
1146                 if (unlikely(!bh)) {
1147                         err = -ENOMEM;
1148                         goto cleanup;
1149                 }
1150                 lock_buffer(bh);
1151
1152                 err = ext4_journal_get_create_access(handle, bh);
1153                 if (err)
1154                         goto cleanup;
1155
1156                 neh = ext_block_hdr(bh);
1157                 neh->eh_entries = cpu_to_le16(1);
1158                 neh->eh_magic = EXT4_EXT_MAGIC;
1159                 neh->eh_max = cpu_to_le16(ext4_ext_space_block_idx(inode, 0));
1160                 neh->eh_depth = cpu_to_le16(depth - i);
1161                 fidx = EXT_FIRST_INDEX(neh);
1162                 fidx->ei_block = border;
1163                 ext4_idx_store_pblock(fidx, oldblock);
1164
1165                 ext_debug("int.index at %d (block %llu): %u -> %llu\n",
1166                                 i, newblock, le32_to_cpu(border), oldblock);
1167
1168                 /* move remainder of path[i] to the new index block */
1169                 if (unlikely(EXT_MAX_INDEX(path[i].p_hdr) !=
1170                                         EXT_LAST_INDEX(path[i].p_hdr))) {
1171                         EXT4_ERROR_INODE(inode,
1172                                          "EXT_MAX_INDEX != EXT_LAST_INDEX ee_block %d!",
1173                                          le32_to_cpu(path[i].p_ext->ee_block));
1174                         err = -EFSCORRUPTED;
1175                         goto cleanup;
1176                 }
1177                 /* start copy indexes */
1178                 m = EXT_MAX_INDEX(path[i].p_hdr) - path[i].p_idx++;
1179                 ext_debug("cur 0x%p, last 0x%p\n", path[i].p_idx,
1180                                 EXT_MAX_INDEX(path[i].p_hdr));
1181                 ext4_ext_show_move(inode, path, newblock, i);
1182                 if (m) {
1183                         memmove(++fidx, path[i].p_idx,
1184                                 sizeof(struct ext4_extent_idx) * m);
1185                         le16_add_cpu(&neh->eh_entries, m);
1186                 }
1187                 /* zero out unused area in the extent block */
1188                 ext_size = sizeof(struct ext4_extent_header) +
1189                    (sizeof(struct ext4_extent) * le16_to_cpu(neh->eh_entries));
1190                 memset(bh->b_data + ext_size, 0,
1191                         inode->i_sb->s_blocksize - ext_size);
1192                 ext4_extent_block_csum_set(inode, neh);
1193                 set_buffer_uptodate(bh);
1194                 unlock_buffer(bh);
1195
1196                 err = ext4_handle_dirty_metadata(handle, inode, bh);
1197                 if (err)
1198                         goto cleanup;
1199                 brelse(bh);
1200                 bh = NULL;
1201
1202                 /* correct old index */
1203                 if (m) {
1204                         err = ext4_ext_get_access(handle, inode, path + i);
1205                         if (err)
1206                                 goto cleanup;
1207                         le16_add_cpu(&path[i].p_hdr->eh_entries, -m);
1208                         err = ext4_ext_dirty(handle, inode, path + i);
1209                         if (err)
1210                                 goto cleanup;
1211                 }
1212
1213                 i--;
1214         }
1215
1216         /* insert new index */
1217         err = ext4_ext_insert_index(handle, inode, path + at,
1218                                     le32_to_cpu(border), newblock);
1219
1220 cleanup:
1221         if (bh) {
1222                 if (buffer_locked(bh))
1223                         unlock_buffer(bh);
1224                 brelse(bh);
1225         }
1226
1227         if (err) {
1228                 /* free all allocated blocks in error case */
1229                 for (i = 0; i < depth; i++) {
1230                         if (!ablocks[i])
1231                                 continue;
1232                         ext4_free_blocks(handle, inode, NULL, ablocks[i], 1,
1233                                          EXT4_FREE_BLOCKS_METADATA);
1234                 }
1235         }
1236         kfree(ablocks);
1237
1238         return err;
1239 }
1240
1241 /*
1242  * ext4_ext_grow_indepth:
1243  * implements tree growing procedure:
1244  * - allocates new block
1245  * - moves top-level data (index block or leaf) into the new block
1246  * - initializes new top-level, creating index that points to the
1247  *   just created block
1248  */
1249 static int ext4_ext_grow_indepth(handle_t *handle, struct inode *inode,
1250                                  unsigned int flags)
1251 {
1252         struct ext4_extent_header *neh;
1253         struct buffer_head *bh;
1254         ext4_fsblk_t newblock, goal = 0;
1255         struct ext4_super_block *es = EXT4_SB(inode->i_sb)->s_es;
1256         int err = 0;
1257         size_t ext_size = 0;
1258
1259         /* Try to prepend new index to old one */
1260         if (ext_depth(inode))
1261                 goal = ext4_idx_pblock(EXT_FIRST_INDEX(ext_inode_hdr(inode)));
1262         if (goal > le32_to_cpu(es->s_first_data_block)) {
1263                 flags |= EXT4_MB_HINT_TRY_GOAL;
1264                 goal--;
1265         } else
1266                 goal = ext4_inode_to_goal_block(inode);
1267         newblock = ext4_new_meta_blocks(handle, inode, goal, flags,
1268                                         NULL, &err);
1269         if (newblock == 0)
1270                 return err;
1271
1272         bh = sb_getblk_gfp(inode->i_sb, newblock, __GFP_MOVABLE | GFP_NOFS);
1273         if (unlikely(!bh))
1274                 return -ENOMEM;
1275         lock_buffer(bh);
1276
1277         err = ext4_journal_get_create_access(handle, bh);
1278         if (err) {
1279                 unlock_buffer(bh);
1280                 goto out;
1281         }
1282
1283         ext_size = sizeof(EXT4_I(inode)->i_data);
1284         /* move top-level index/leaf into new block */
1285         memmove(bh->b_data, EXT4_I(inode)->i_data, ext_size);
1286         /* zero out unused area in the extent block */
1287         memset(bh->b_data + ext_size, 0, inode->i_sb->s_blocksize - ext_size);
1288
1289         /* set size of new block */
1290         neh = ext_block_hdr(bh);
1291         /* old root could have indexes or leaves
1292          * so calculate e_max right way */
1293         if (ext_depth(inode))
1294                 neh->eh_max = cpu_to_le16(ext4_ext_space_block_idx(inode, 0));
1295         else
1296                 neh->eh_max = cpu_to_le16(ext4_ext_space_block(inode, 0));
1297         neh->eh_magic = EXT4_EXT_MAGIC;
1298         ext4_extent_block_csum_set(inode, neh);
1299         set_buffer_uptodate(bh);
1300         unlock_buffer(bh);
1301
1302         err = ext4_handle_dirty_metadata(handle, inode, bh);
1303         if (err)
1304                 goto out;
1305
1306         /* Update top-level index: num,max,pointer */
1307         neh = ext_inode_hdr(inode);
1308         neh->eh_entries = cpu_to_le16(1);
1309         ext4_idx_store_pblock(EXT_FIRST_INDEX(neh), newblock);
1310         if (neh->eh_depth == 0) {
1311                 /* Root extent block becomes index block */
1312                 neh->eh_max = cpu_to_le16(ext4_ext_space_root_idx(inode, 0));
1313                 EXT_FIRST_INDEX(neh)->ei_block =
1314                         EXT_FIRST_EXTENT(neh)->ee_block;
1315         }
1316         ext_debug("new root: num %d(%d), lblock %d, ptr %llu\n",
1317                   le16_to_cpu(neh->eh_entries), le16_to_cpu(neh->eh_max),
1318                   le32_to_cpu(EXT_FIRST_INDEX(neh)->ei_block),
1319                   ext4_idx_pblock(EXT_FIRST_INDEX(neh)));
1320
1321         le16_add_cpu(&neh->eh_depth, 1);
1322         ext4_mark_inode_dirty(handle, inode);
1323 out:
1324         brelse(bh);
1325
1326         return err;
1327 }
1328
1329 /*
1330  * ext4_ext_create_new_leaf:
1331  * finds empty index and adds new leaf.
1332  * if no free index is found, then it requests in-depth growing.
1333  */
1334 static int ext4_ext_create_new_leaf(handle_t *handle, struct inode *inode,
1335                                     unsigned int mb_flags,
1336                                     unsigned int gb_flags,
1337                                     struct ext4_ext_path **ppath,
1338                                     struct ext4_extent *newext)
1339 {
1340         struct ext4_ext_path *path = *ppath;
1341         struct ext4_ext_path *curp;
1342         int depth, i, err = 0;
1343
1344 repeat:
1345         i = depth = ext_depth(inode);
1346
1347         /* walk up to the tree and look for free index entry */
1348         curp = path + depth;
1349         while (i > 0 && !EXT_HAS_FREE_INDEX(curp)) {
1350                 i--;
1351                 curp--;
1352         }
1353
1354         /* we use already allocated block for index block,
1355          * so subsequent data blocks should be contiguous */
1356         if (EXT_HAS_FREE_INDEX(curp)) {
1357                 /* if we found index with free entry, then use that
1358                  * entry: create all needed subtree and add new leaf */
1359                 err = ext4_ext_split(handle, inode, mb_flags, path, newext, i);
1360                 if (err)
1361                         goto out;
1362
1363                 /* refill path */
1364                 path = ext4_find_extent(inode,
1365                                     (ext4_lblk_t)le32_to_cpu(newext->ee_block),
1366                                     ppath, gb_flags);
1367                 if (IS_ERR(path))
1368                         err = PTR_ERR(path);
1369         } else {
1370                 /* tree is full, time to grow in depth */
1371                 err = ext4_ext_grow_indepth(handle, inode, mb_flags);
1372                 if (err)
1373                         goto out;
1374
1375                 /* refill path */
1376                 path = ext4_find_extent(inode,
1377                                    (ext4_lblk_t)le32_to_cpu(newext->ee_block),
1378                                     ppath, gb_flags);
1379                 if (IS_ERR(path)) {
1380                         err = PTR_ERR(path);
1381                         goto out;
1382                 }
1383
1384                 /*
1385                  * only first (depth 0 -> 1) produces free space;
1386                  * in all other cases we have to split the grown tree
1387                  */
1388                 depth = ext_depth(inode);
1389                 if (path[depth].p_hdr->eh_entries == path[depth].p_hdr->eh_max) {
1390                         /* now we need to split */
1391                         goto repeat;
1392                 }
1393         }
1394
1395 out:
1396         return err;
1397 }
1398
1399 /*
1400  * search the closest allocated block to the left for *logical
1401  * and returns it at @logical + it's physical address at @phys
1402  * if *logical is the smallest allocated block, the function
1403  * returns 0 at @phys
1404  * return value contains 0 (success) or error code
1405  */
1406 static int ext4_ext_search_left(struct inode *inode,
1407                                 struct ext4_ext_path *path,
1408                                 ext4_lblk_t *logical, ext4_fsblk_t *phys)
1409 {
1410         struct ext4_extent_idx *ix;
1411         struct ext4_extent *ex;
1412         int depth, ee_len;
1413
1414         if (unlikely(path == NULL)) {
1415                 EXT4_ERROR_INODE(inode, "path == NULL *logical %d!", *logical);
1416                 return -EFSCORRUPTED;
1417         }
1418         depth = path->p_depth;
1419         *phys = 0;
1420
1421         if (depth == 0 && path->p_ext == NULL)
1422                 return 0;
1423
1424         /* usually extent in the path covers blocks smaller
1425          * then *logical, but it can be that extent is the
1426          * first one in the file */
1427
1428         ex = path[depth].p_ext;
1429         ee_len = ext4_ext_get_actual_len(ex);
1430         if (*logical < le32_to_cpu(ex->ee_block)) {
1431                 if (unlikely(EXT_FIRST_EXTENT(path[depth].p_hdr) != ex)) {
1432                         EXT4_ERROR_INODE(inode,
1433                                          "EXT_FIRST_EXTENT != ex *logical %d ee_block %d!",
1434                                          *logical, le32_to_cpu(ex->ee_block));
1435                         return -EFSCORRUPTED;
1436                 }
1437                 while (--depth >= 0) {
1438                         ix = path[depth].p_idx;
1439                         if (unlikely(ix != EXT_FIRST_INDEX(path[depth].p_hdr))) {
1440                                 EXT4_ERROR_INODE(inode,
1441                                   "ix (%d) != EXT_FIRST_INDEX (%d) (depth %d)!",
1442                                   ix != NULL ? le32_to_cpu(ix->ei_block) : 0,
1443                                   EXT_FIRST_INDEX(path[depth].p_hdr) != NULL ?
1444                 le32_to_cpu(EXT_FIRST_INDEX(path[depth].p_hdr)->ei_block) : 0,
1445                                   depth);
1446                                 return -EFSCORRUPTED;
1447                         }
1448                 }
1449                 return 0;
1450         }
1451
1452         if (unlikely(*logical < (le32_to_cpu(ex->ee_block) + ee_len))) {
1453                 EXT4_ERROR_INODE(inode,
1454                                  "logical %d < ee_block %d + ee_len %d!",
1455                                  *logical, le32_to_cpu(ex->ee_block), ee_len);
1456                 return -EFSCORRUPTED;
1457         }
1458
1459         *logical = le32_to_cpu(ex->ee_block) + ee_len - 1;
1460         *phys = ext4_ext_pblock(ex) + ee_len - 1;
1461         return 0;
1462 }
1463
1464 /*
1465  * search the closest allocated block to the right for *logical
1466  * and returns it at @logical + it's physical address at @phys
1467  * if *logical is the largest allocated block, the function
1468  * returns 0 at @phys
1469  * return value contains 0 (success) or error code
1470  */
1471 static int ext4_ext_search_right(struct inode *inode,
1472                                  struct ext4_ext_path *path,
1473                                  ext4_lblk_t *logical, ext4_fsblk_t *phys,
1474                                  struct ext4_extent **ret_ex)
1475 {
1476         struct buffer_head *bh = NULL;
1477         struct ext4_extent_header *eh;
1478         struct ext4_extent_idx *ix;
1479         struct ext4_extent *ex;
1480         ext4_fsblk_t block;
1481         int depth;      /* Note, NOT eh_depth; depth from top of tree */
1482         int ee_len;
1483
1484         if (unlikely(path == NULL)) {
1485                 EXT4_ERROR_INODE(inode, "path == NULL *logical %d!", *logical);
1486                 return -EFSCORRUPTED;
1487         }
1488         depth = path->p_depth;
1489         *phys = 0;
1490
1491         if (depth == 0 && path->p_ext == NULL)
1492                 return 0;
1493
1494         /* usually extent in the path covers blocks smaller
1495          * then *logical, but it can be that extent is the
1496          * first one in the file */
1497
1498         ex = path[depth].p_ext;
1499         ee_len = ext4_ext_get_actual_len(ex);
1500         if (*logical < le32_to_cpu(ex->ee_block)) {
1501                 if (unlikely(EXT_FIRST_EXTENT(path[depth].p_hdr) != ex)) {
1502                         EXT4_ERROR_INODE(inode,
1503                                          "first_extent(path[%d].p_hdr) != ex",
1504                                          depth);
1505                         return -EFSCORRUPTED;
1506                 }
1507                 while (--depth >= 0) {
1508                         ix = path[depth].p_idx;
1509                         if (unlikely(ix != EXT_FIRST_INDEX(path[depth].p_hdr))) {
1510                                 EXT4_ERROR_INODE(inode,
1511                                                  "ix != EXT_FIRST_INDEX *logical %d!",
1512                                                  *logical);
1513                                 return -EFSCORRUPTED;
1514                         }
1515                 }
1516                 goto found_extent;
1517         }
1518
1519         if (unlikely(*logical < (le32_to_cpu(ex->ee_block) + ee_len))) {
1520                 EXT4_ERROR_INODE(inode,
1521                                  "logical %d < ee_block %d + ee_len %d!",
1522                                  *logical, le32_to_cpu(ex->ee_block), ee_len);
1523                 return -EFSCORRUPTED;
1524         }
1525
1526         if (ex != EXT_LAST_EXTENT(path[depth].p_hdr)) {
1527                 /* next allocated block in this leaf */
1528                 ex++;
1529                 goto found_extent;
1530         }
1531
1532         /* go up and search for index to the right */
1533         while (--depth >= 0) {
1534                 ix = path[depth].p_idx;
1535                 if (ix != EXT_LAST_INDEX(path[depth].p_hdr))
1536                         goto got_index;
1537         }
1538
1539         /* we've gone up to the root and found no index to the right */
1540         return 0;
1541
1542 got_index:
1543         /* we've found index to the right, let's
1544          * follow it and find the closest allocated
1545          * block to the right */
1546         ix++;
1547         block = ext4_idx_pblock(ix);
1548         while (++depth < path->p_depth) {
1549                 /* subtract from p_depth to get proper eh_depth */
1550                 bh = read_extent_tree_block(inode, block,
1551                                             path->p_depth - depth, 0);
1552                 if (IS_ERR(bh))
1553                         return PTR_ERR(bh);
1554                 eh = ext_block_hdr(bh);
1555                 ix = EXT_FIRST_INDEX(eh);
1556                 block = ext4_idx_pblock(ix);
1557                 put_bh(bh);
1558         }
1559
1560         bh = read_extent_tree_block(inode, block, path->p_depth - depth, 0);
1561         if (IS_ERR(bh))
1562                 return PTR_ERR(bh);
1563         eh = ext_block_hdr(bh);
1564         ex = EXT_FIRST_EXTENT(eh);
1565 found_extent:
1566         *logical = le32_to_cpu(ex->ee_block);
1567         *phys = ext4_ext_pblock(ex);
1568         *ret_ex = ex;
1569         if (bh)
1570                 put_bh(bh);
1571         return 0;
1572 }
1573
1574 /*
1575  * ext4_ext_next_allocated_block:
1576  * returns allocated block in subsequent extent or EXT_MAX_BLOCKS.
1577  * NOTE: it considers block number from index entry as
1578  * allocated block. Thus, index entries have to be consistent
1579  * with leaves.
1580  */
1581 ext4_lblk_t
1582 ext4_ext_next_allocated_block(struct ext4_ext_path *path)
1583 {
1584         int depth;
1585
1586         BUG_ON(path == NULL);
1587         depth = path->p_depth;
1588
1589         if (depth == 0 && path->p_ext == NULL)
1590                 return EXT_MAX_BLOCKS;
1591
1592         while (depth >= 0) {
1593                 if (depth == path->p_depth) {
1594                         /* leaf */
1595                         if (path[depth].p_ext &&
1596                                 path[depth].p_ext !=
1597                                         EXT_LAST_EXTENT(path[depth].p_hdr))
1598                           return le32_to_cpu(path[depth].p_ext[1].ee_block);
1599                 } else {
1600                         /* index */
1601                         if (path[depth].p_idx !=
1602                                         EXT_LAST_INDEX(path[depth].p_hdr))
1603                           return le32_to_cpu(path[depth].p_idx[1].ei_block);
1604                 }
1605                 depth--;
1606         }
1607
1608         return EXT_MAX_BLOCKS;
1609 }
1610
1611 /*
1612  * ext4_ext_next_leaf_block:
1613  * returns first allocated block from next leaf or EXT_MAX_BLOCKS
1614  */
1615 static ext4_lblk_t ext4_ext_next_leaf_block(struct ext4_ext_path *path)
1616 {
1617         int depth;
1618
1619         BUG_ON(path == NULL);
1620         depth = path->p_depth;
1621
1622         /* zero-tree has no leaf blocks at all */
1623         if (depth == 0)
1624                 return EXT_MAX_BLOCKS;
1625
1626         /* go to index block */
1627         depth--;
1628
1629         while (depth >= 0) {
1630                 if (path[depth].p_idx !=
1631                                 EXT_LAST_INDEX(path[depth].p_hdr))
1632                         return (ext4_lblk_t)
1633                                 le32_to_cpu(path[depth].p_idx[1].ei_block);
1634                 depth--;
1635         }
1636
1637         return EXT_MAX_BLOCKS;
1638 }
1639
1640 /*
1641  * ext4_ext_correct_indexes:
1642  * if leaf gets modified and modified extent is first in the leaf,
1643  * then we have to correct all indexes above.
1644  * TODO: do we need to correct tree in all cases?
1645  */
1646 static int ext4_ext_correct_indexes(handle_t *handle, struct inode *inode,
1647                                 struct ext4_ext_path *path)
1648 {
1649         struct ext4_extent_header *eh;
1650         int depth = ext_depth(inode);
1651         struct ext4_extent *ex;
1652         __le32 border;
1653         int k, err = 0;
1654
1655         eh = path[depth].p_hdr;
1656         ex = path[depth].p_ext;
1657
1658         if (unlikely(ex == NULL || eh == NULL)) {
1659                 EXT4_ERROR_INODE(inode,
1660                                  "ex %p == NULL or eh %p == NULL", ex, eh);
1661                 return -EFSCORRUPTED;
1662         }
1663
1664         if (depth == 0) {
1665                 /* there is no tree at all */
1666                 return 0;
1667         }
1668
1669         if (ex != EXT_FIRST_EXTENT(eh)) {
1670                 /* we correct tree if first leaf got modified only */
1671                 return 0;
1672         }
1673
1674         /*
1675          * TODO: we need correction if border is smaller than current one
1676          */
1677         k = depth - 1;
1678         border = path[depth].p_ext->ee_block;
1679         err = ext4_ext_get_access(handle, inode, path + k);
1680         if (err)
1681                 return err;
1682         path[k].p_idx->ei_block = border;
1683         err = ext4_ext_dirty(handle, inode, path + k);
1684         if (err)
1685                 return err;
1686
1687         while (k--) {
1688                 /* change all left-side indexes */
1689                 if (path[k+1].p_idx != EXT_FIRST_INDEX(path[k+1].p_hdr))
1690                         break;
1691                 err = ext4_ext_get_access(handle, inode, path + k);
1692                 if (err)
1693                         break;
1694                 path[k].p_idx->ei_block = border;
1695                 err = ext4_ext_dirty(handle, inode, path + k);
1696                 if (err)
1697                         break;
1698         }
1699
1700         return err;
1701 }
1702
1703 static int ext4_can_extents_be_merged(struct inode *inode,
1704                                       struct ext4_extent *ex1,
1705                                       struct ext4_extent *ex2)
1706 {
1707         unsigned short ext1_ee_len, ext2_ee_len;
1708
1709         if (ext4_ext_is_unwritten(ex1) != ext4_ext_is_unwritten(ex2))
1710                 return 0;
1711
1712         ext1_ee_len = ext4_ext_get_actual_len(ex1);
1713         ext2_ee_len = ext4_ext_get_actual_len(ex2);
1714
1715         if (le32_to_cpu(ex1->ee_block) + ext1_ee_len !=
1716                         le32_to_cpu(ex2->ee_block))
1717                 return 0;
1718
1719         if (ext1_ee_len + ext2_ee_len > EXT_INIT_MAX_LEN)
1720                 return 0;
1721
1722         if (ext4_ext_is_unwritten(ex1) &&
1723             ext1_ee_len + ext2_ee_len > EXT_UNWRITTEN_MAX_LEN)
1724                 return 0;
1725 #ifdef AGGRESSIVE_TEST
1726         if (ext1_ee_len >= 4)
1727                 return 0;
1728 #endif
1729
1730         if (ext4_ext_pblock(ex1) + ext1_ee_len == ext4_ext_pblock(ex2))
1731                 return 1;
1732         return 0;
1733 }
1734
1735 /*
1736  * This function tries to merge the "ex" extent to the next extent in the tree.
1737  * It always tries to merge towards right. If you want to merge towards
1738  * left, pass "ex - 1" as argument instead of "ex".
1739  * Returns 0 if the extents (ex and ex+1) were _not_ merged and returns
1740  * 1 if they got merged.
1741  */
1742 static int ext4_ext_try_to_merge_right(struct inode *inode,
1743                                  struct ext4_ext_path *path,
1744                                  struct ext4_extent *ex)
1745 {
1746         struct ext4_extent_header *eh;
1747         unsigned int depth, len;
1748         int merge_done = 0, unwritten;
1749
1750         depth = ext_depth(inode);
1751         BUG_ON(path[depth].p_hdr == NULL);
1752         eh = path[depth].p_hdr;
1753
1754         while (ex < EXT_LAST_EXTENT(eh)) {
1755                 if (!ext4_can_extents_be_merged(inode, ex, ex + 1))
1756                         break;
1757                 /* merge with next extent! */
1758                 unwritten = ext4_ext_is_unwritten(ex);
1759                 ex->ee_len = cpu_to_le16(ext4_ext_get_actual_len(ex)
1760                                 + ext4_ext_get_actual_len(ex + 1));
1761                 if (unwritten)
1762                         ext4_ext_mark_unwritten(ex);
1763
1764                 if (ex + 1 < EXT_LAST_EXTENT(eh)) {
1765                         len = (EXT_LAST_EXTENT(eh) - ex - 1)
1766                                 * sizeof(struct ext4_extent);
1767                         memmove(ex + 1, ex + 2, len);
1768                 }
1769                 le16_add_cpu(&eh->eh_entries, -1);
1770                 merge_done = 1;
1771                 WARN_ON(eh->eh_entries == 0);
1772                 if (!eh->eh_entries)
1773                         EXT4_ERROR_INODE(inode, "eh->eh_entries = 0!");
1774         }
1775
1776         return merge_done;
1777 }
1778
1779 /*
1780  * This function does a very simple check to see if we can collapse
1781  * an extent tree with a single extent tree leaf block into the inode.
1782  */
1783 static void ext4_ext_try_to_merge_up(handle_t *handle,
1784                                      struct inode *inode,
1785                                      struct ext4_ext_path *path)
1786 {
1787         size_t s;
1788         unsigned max_root = ext4_ext_space_root(inode, 0);
1789         ext4_fsblk_t blk;
1790
1791         if ((path[0].p_depth != 1) ||
1792             (le16_to_cpu(path[0].p_hdr->eh_entries) != 1) ||
1793             (le16_to_cpu(path[1].p_hdr->eh_entries) > max_root))
1794                 return;
1795
1796         /*
1797          * We need to modify the block allocation bitmap and the block
1798          * group descriptor to release the extent tree block.  If we
1799          * can't get the journal credits, give up.
1800          */
1801         if (ext4_journal_extend(handle, 2,
1802                         ext4_free_metadata_revoke_credits(inode->i_sb, 1)))
1803                 return;
1804
1805         /*
1806          * Copy the extent data up to the inode
1807          */
1808         blk = ext4_idx_pblock(path[0].p_idx);
1809         s = le16_to_cpu(path[1].p_hdr->eh_entries) *
1810                 sizeof(struct ext4_extent_idx);
1811         s += sizeof(struct ext4_extent_header);
1812
1813         path[1].p_maxdepth = path[0].p_maxdepth;
1814         memcpy(path[0].p_hdr, path[1].p_hdr, s);
1815         path[0].p_depth = 0;
1816         path[0].p_ext = EXT_FIRST_EXTENT(path[0].p_hdr) +
1817                 (path[1].p_ext - EXT_FIRST_EXTENT(path[1].p_hdr));
1818         path[0].p_hdr->eh_max = cpu_to_le16(max_root);
1819
1820         brelse(path[1].p_bh);
1821         ext4_free_blocks(handle, inode, NULL, blk, 1,
1822                          EXT4_FREE_BLOCKS_METADATA | EXT4_FREE_BLOCKS_FORGET);
1823 }
1824
1825 /*
1826  * This function tries to merge the @ex extent to neighbours in the tree, then
1827  * tries to collapse the extent tree into the inode.
1828  */
1829 static void ext4_ext_try_to_merge(handle_t *handle,
1830                                   struct inode *inode,
1831                                   struct ext4_ext_path *path,
1832                                   struct ext4_extent *ex)
1833 {
1834         struct ext4_extent_header *eh;
1835         unsigned int depth;
1836         int merge_done = 0;
1837
1838         depth = ext_depth(inode);
1839         BUG_ON(path[depth].p_hdr == NULL);
1840         eh = path[depth].p_hdr;
1841
1842         if (ex > EXT_FIRST_EXTENT(eh))
1843                 merge_done = ext4_ext_try_to_merge_right(inode, path, ex - 1);
1844
1845         if (!merge_done)
1846                 (void) ext4_ext_try_to_merge_right(inode, path, ex);
1847
1848         ext4_ext_try_to_merge_up(handle, inode, path);
1849 }
1850
1851 /*
1852  * check if a portion of the "newext" extent overlaps with an
1853  * existing extent.
1854  *
1855  * If there is an overlap discovered, it updates the length of the newext
1856  * such that there will be no overlap, and then returns 1.
1857  * If there is no overlap found, it returns 0.
1858  */
1859 static unsigned int ext4_ext_check_overlap(struct ext4_sb_info *sbi,
1860                                            struct inode *inode,
1861                                            struct ext4_extent *newext,
1862                                            struct ext4_ext_path *path)
1863 {
1864         ext4_lblk_t b1, b2;
1865         unsigned int depth, len1;
1866         unsigned int ret = 0;
1867
1868         b1 = le32_to_cpu(newext->ee_block);
1869         len1 = ext4_ext_get_actual_len(newext);
1870         depth = ext_depth(inode);
1871         if (!path[depth].p_ext)
1872                 goto out;
1873         b2 = EXT4_LBLK_CMASK(sbi, le32_to_cpu(path[depth].p_ext->ee_block));
1874
1875         /*
1876          * get the next allocated block if the extent in the path
1877          * is before the requested block(s)
1878          */
1879         if (b2 < b1) {
1880                 b2 = ext4_ext_next_allocated_block(path);
1881                 if (b2 == EXT_MAX_BLOCKS)
1882                         goto out;
1883                 b2 = EXT4_LBLK_CMASK(sbi, b2);
1884         }
1885
1886         /* check for wrap through zero on extent logical start block*/
1887         if (b1 + len1 < b1) {
1888                 len1 = EXT_MAX_BLOCKS - b1;
1889                 newext->ee_len = cpu_to_le16(len1);
1890                 ret = 1;
1891         }
1892
1893         /* check for overlap */
1894         if (b1 + len1 > b2) {
1895                 newext->ee_len = cpu_to_le16(b2 - b1);
1896                 ret = 1;
1897         }
1898 out:
1899         return ret;
1900 }
1901
1902 /*
1903  * ext4_ext_insert_extent:
1904  * tries to merge requsted extent into the existing extent or
1905  * inserts requested extent as new one into the tree,
1906  * creating new leaf in the no-space case.
1907  */
1908 int ext4_ext_insert_extent(handle_t *handle, struct inode *inode,
1909                                 struct ext4_ext_path **ppath,
1910                                 struct ext4_extent *newext, int gb_flags)
1911 {
1912         struct ext4_ext_path *path = *ppath;
1913         struct ext4_extent_header *eh;
1914         struct ext4_extent *ex, *fex;
1915         struct ext4_extent *nearex; /* nearest extent */
1916         struct ext4_ext_path *npath = NULL;
1917         int depth, len, err;
1918         ext4_lblk_t next;
1919         int mb_flags = 0, unwritten;
1920
1921         if (gb_flags & EXT4_GET_BLOCKS_DELALLOC_RESERVE)
1922                 mb_flags |= EXT4_MB_DELALLOC_RESERVED;
1923         if (unlikely(ext4_ext_get_actual_len(newext) == 0)) {
1924                 EXT4_ERROR_INODE(inode, "ext4_ext_get_actual_len(newext) == 0");
1925                 return -EFSCORRUPTED;
1926         }
1927         depth = ext_depth(inode);
1928         ex = path[depth].p_ext;
1929         eh = path[depth].p_hdr;
1930         if (unlikely(path[depth].p_hdr == NULL)) {
1931                 EXT4_ERROR_INODE(inode, "path[%d].p_hdr == NULL", depth);
1932                 return -EFSCORRUPTED;
1933         }
1934
1935         /* try to insert block into found extent and return */
1936         if (ex && !(gb_flags & EXT4_GET_BLOCKS_PRE_IO)) {
1937
1938                 /*
1939                  * Try to see whether we should rather test the extent on
1940                  * right from ex, or from the left of ex. This is because
1941                  * ext4_find_extent() can return either extent on the
1942                  * left, or on the right from the searched position. This
1943                  * will make merging more effective.
1944                  */
1945                 if (ex < EXT_LAST_EXTENT(eh) &&
1946                     (le32_to_cpu(ex->ee_block) +
1947                     ext4_ext_get_actual_len(ex) <
1948                     le32_to_cpu(newext->ee_block))) {
1949                         ex += 1;
1950                         goto prepend;
1951                 } else if ((ex > EXT_FIRST_EXTENT(eh)) &&
1952                            (le32_to_cpu(newext->ee_block) +
1953                            ext4_ext_get_actual_len(newext) <
1954                            le32_to_cpu(ex->ee_block)))
1955                         ex -= 1;
1956
1957                 /* Try to append newex to the ex */
1958                 if (ext4_can_extents_be_merged(inode, ex, newext)) {
1959                         ext_debug("append [%d]%d block to %u:[%d]%d"
1960                                   "(from %llu)\n",
1961                                   ext4_ext_is_unwritten(newext),
1962                                   ext4_ext_get_actual_len(newext),
1963                                   le32_to_cpu(ex->ee_block),
1964                                   ext4_ext_is_unwritten(ex),
1965                                   ext4_ext_get_actual_len(ex),
1966                                   ext4_ext_pblock(ex));
1967                         err = ext4_ext_get_access(handle, inode,
1968                                                   path + depth);
1969                         if (err)
1970                                 return err;
1971                         unwritten = ext4_ext_is_unwritten(ex);
1972                         ex->ee_len = cpu_to_le16(ext4_ext_get_actual_len(ex)
1973                                         + ext4_ext_get_actual_len(newext));
1974                         if (unwritten)
1975                                 ext4_ext_mark_unwritten(ex);
1976                         eh = path[depth].p_hdr;
1977                         nearex = ex;
1978                         goto merge;
1979                 }
1980
1981 prepend:
1982                 /* Try to prepend newex to the ex */
1983                 if (ext4_can_extents_be_merged(inode, newext, ex)) {
1984                         ext_debug("prepend %u[%d]%d block to %u:[%d]%d"
1985                                   "(from %llu)\n",
1986                                   le32_to_cpu(newext->ee_block),
1987                                   ext4_ext_is_unwritten(newext),
1988                                   ext4_ext_get_actual_len(newext),
1989                                   le32_to_cpu(ex->ee_block),
1990                                   ext4_ext_is_unwritten(ex),
1991                                   ext4_ext_get_actual_len(ex),
1992                                   ext4_ext_pblock(ex));
1993                         err = ext4_ext_get_access(handle, inode,
1994                                                   path + depth);
1995                         if (err)
1996                                 return err;
1997
1998                         unwritten = ext4_ext_is_unwritten(ex);
1999                         ex->ee_block = newext->ee_block;
2000                         ext4_ext_store_pblock(ex, ext4_ext_pblock(newext));
2001                         ex->ee_len = cpu_to_le16(ext4_ext_get_actual_len(ex)
2002                                         + ext4_ext_get_actual_len(newext));
2003                         if (unwritten)
2004                                 ext4_ext_mark_unwritten(ex);
2005                         eh = path[depth].p_hdr;
2006                         nearex = ex;
2007                         goto merge;
2008                 }
2009         }
2010
2011         depth = ext_depth(inode);
2012         eh = path[depth].p_hdr;
2013         if (le16_to_cpu(eh->eh_entries) < le16_to_cpu(eh->eh_max))
2014                 goto has_space;
2015
2016         /* probably next leaf has space for us? */
2017         fex = EXT_LAST_EXTENT(eh);
2018         next = EXT_MAX_BLOCKS;
2019         if (le32_to_cpu(newext->ee_block) > le32_to_cpu(fex->ee_block))
2020                 next = ext4_ext_next_leaf_block(path);
2021         if (next != EXT_MAX_BLOCKS) {
2022                 ext_debug("next leaf block - %u\n", next);
2023                 BUG_ON(npath != NULL);
2024                 npath = ext4_find_extent(inode, next, NULL, 0);
2025                 if (IS_ERR(npath))
2026                         return PTR_ERR(npath);
2027                 BUG_ON(npath->p_depth != path->p_depth);
2028                 eh = npath[depth].p_hdr;
2029                 if (le16_to_cpu(eh->eh_entries) < le16_to_cpu(eh->eh_max)) {
2030                         ext_debug("next leaf isn't full(%d)\n",
2031                                   le16_to_cpu(eh->eh_entries));
2032                         path = npath;
2033                         goto has_space;
2034                 }
2035                 ext_debug("next leaf has no free space(%d,%d)\n",
2036                           le16_to_cpu(eh->eh_entries), le16_to_cpu(eh->eh_max));
2037         }
2038
2039         /*
2040          * There is no free space in the found leaf.
2041          * We're gonna add a new leaf in the tree.
2042          */
2043         if (gb_flags & EXT4_GET_BLOCKS_METADATA_NOFAIL)
2044                 mb_flags |= EXT4_MB_USE_RESERVED;
2045         err = ext4_ext_create_new_leaf(handle, inode, mb_flags, gb_flags,
2046                                        ppath, newext);
2047         if (err)
2048                 goto cleanup;
2049         depth = ext_depth(inode);
2050         eh = path[depth].p_hdr;
2051
2052 has_space:
2053         nearex = path[depth].p_ext;
2054
2055         err = ext4_ext_get_access(handle, inode, path + depth);
2056         if (err)
2057                 goto cleanup;
2058
2059         if (!nearex) {
2060                 /* there is no extent in this leaf, create first one */
2061                 ext_debug("first extent in the leaf: %u:%llu:[%d]%d\n",
2062                                 le32_to_cpu(newext->ee_block),
2063                                 ext4_ext_pblock(newext),
2064                                 ext4_ext_is_unwritten(newext),
2065                                 ext4_ext_get_actual_len(newext));
2066                 nearex = EXT_FIRST_EXTENT(eh);
2067         } else {
2068                 if (le32_to_cpu(newext->ee_block)
2069                            > le32_to_cpu(nearex->ee_block)) {
2070                         /* Insert after */
2071                         ext_debug("insert %u:%llu:[%d]%d before: "
2072                                         "nearest %p\n",
2073                                         le32_to_cpu(newext->ee_block),
2074                                         ext4_ext_pblock(newext),
2075                                         ext4_ext_is_unwritten(newext),
2076                                         ext4_ext_get_actual_len(newext),
2077                                         nearex);
2078                         nearex++;
2079                 } else {
2080                         /* Insert before */
2081                         BUG_ON(newext->ee_block == nearex->ee_block);
2082                         ext_debug("insert %u:%llu:[%d]%d after: "
2083                                         "nearest %p\n",
2084                                         le32_to_cpu(newext->ee_block),
2085                                         ext4_ext_pblock(newext),
2086                                         ext4_ext_is_unwritten(newext),
2087                                         ext4_ext_get_actual_len(newext),
2088                                         nearex);
2089                 }
2090                 len = EXT_LAST_EXTENT(eh) - nearex + 1;
2091                 if (len > 0) {
2092                         ext_debug("insert %u:%llu:[%d]%d: "
2093                                         "move %d extents from 0x%p to 0x%p\n",
2094                                         le32_to_cpu(newext->ee_block),
2095                                         ext4_ext_pblock(newext),
2096                                         ext4_ext_is_unwritten(newext),
2097                                         ext4_ext_get_actual_len(newext),
2098                                         len, nearex, nearex + 1);
2099                         memmove(nearex + 1, nearex,
2100                                 len * sizeof(struct ext4_extent));
2101                 }
2102         }
2103
2104         le16_add_cpu(&eh->eh_entries, 1);
2105         path[depth].p_ext = nearex;
2106         nearex->ee_block = newext->ee_block;
2107         ext4_ext_store_pblock(nearex, ext4_ext_pblock(newext));
2108         nearex->ee_len = newext->ee_len;
2109
2110 merge:
2111         /* try to merge extents */
2112         if (!(gb_flags & EXT4_GET_BLOCKS_PRE_IO))
2113                 ext4_ext_try_to_merge(handle, inode, path, nearex);
2114
2115
2116         /* time to correct all indexes above */
2117         err = ext4_ext_correct_indexes(handle, inode, path);
2118         if (err)
2119                 goto cleanup;
2120
2121         err = ext4_ext_dirty(handle, inode, path + path->p_depth);
2122
2123 cleanup:
2124         ext4_ext_drop_refs(npath);
2125         kfree(npath);
2126         return err;
2127 }
2128
2129 static int ext4_fill_fiemap_extents(struct inode *inode,
2130                                     ext4_lblk_t block, ext4_lblk_t num,
2131                                     struct fiemap_extent_info *fieinfo)
2132 {
2133         struct ext4_ext_path *path = NULL;
2134         struct ext4_extent *ex;
2135         struct extent_status es;
2136         ext4_lblk_t next, next_del, start = 0, end = 0;
2137         ext4_lblk_t last = block + num;
2138         int exists, depth = 0, err = 0;
2139         unsigned int flags = 0;
2140         unsigned char blksize_bits = inode->i_sb->s_blocksize_bits;
2141
2142         while (block < last && block != EXT_MAX_BLOCKS) {
2143                 num = last - block;
2144                 /* find extent for this block */
2145                 down_read(&EXT4_I(inode)->i_data_sem);
2146
2147                 path = ext4_find_extent(inode, block, &path, 0);
2148                 if (IS_ERR(path)) {
2149                         up_read(&EXT4_I(inode)->i_data_sem);
2150                         err = PTR_ERR(path);
2151                         path = NULL;
2152                         break;
2153                 }
2154
2155                 depth = ext_depth(inode);
2156                 if (unlikely(path[depth].p_hdr == NULL)) {
2157                         up_read(&EXT4_I(inode)->i_data_sem);
2158                         EXT4_ERROR_INODE(inode, "path[%d].p_hdr == NULL", depth);
2159                         err = -EFSCORRUPTED;
2160                         break;
2161                 }
2162                 ex = path[depth].p_ext;
2163                 next = ext4_ext_next_allocated_block(path);
2164
2165                 flags = 0;
2166                 exists = 0;
2167                 if (!ex) {
2168                         /* there is no extent yet, so try to allocate
2169                          * all requested space */
2170                         start = block;
2171                         end = block + num;
2172                 } else if (le32_to_cpu(ex->ee_block) > block) {
2173                         /* need to allocate space before found extent */
2174                         start = block;
2175                         end = le32_to_cpu(ex->ee_block);
2176                         if (block + num < end)
2177                                 end = block + num;
2178                 } else if (block >= le32_to_cpu(ex->ee_block)
2179                                         + ext4_ext_get_actual_len(ex)) {
2180                         /* need to allocate space after found extent */
2181                         start = block;
2182                         end = block + num;
2183                         if (end >= next)
2184                                 end = next;
2185                 } else if (block >= le32_to_cpu(ex->ee_block)) {
2186                         /*
2187                          * some part of requested space is covered
2188                          * by found extent
2189                          */
2190                         start = block;
2191                         end = le32_to_cpu(ex->ee_block)
2192                                 + ext4_ext_get_actual_len(ex);
2193                         if (block + num < end)
2194                                 end = block + num;
2195                         exists = 1;
2196                 } else {
2197                         BUG();
2198                 }
2199                 BUG_ON(end <= start);
2200
2201                 if (!exists) {
2202                         es.es_lblk = start;
2203                         es.es_len = end - start;
2204                         es.es_pblk = 0;
2205                 } else {
2206                         es.es_lblk = le32_to_cpu(ex->ee_block);
2207                         es.es_len = ext4_ext_get_actual_len(ex);
2208                         es.es_pblk = ext4_ext_pblock(ex);
2209                         if (ext4_ext_is_unwritten(ex))
2210                                 flags |= FIEMAP_EXTENT_UNWRITTEN;
2211                 }
2212
2213                 /*
2214                  * Find delayed extent and update es accordingly. We call
2215                  * it even in !exists case to find out whether es is the
2216                  * last existing extent or not.
2217                  */
2218                 next_del = ext4_find_delayed_extent(inode, &es);
2219                 if (!exists && next_del) {
2220                         exists = 1;
2221                         flags |= (FIEMAP_EXTENT_DELALLOC |
2222                                   FIEMAP_EXTENT_UNKNOWN);
2223                 }
2224                 up_read(&EXT4_I(inode)->i_data_sem);
2225
2226                 if (unlikely(es.es_len == 0)) {
2227                         EXT4_ERROR_INODE(inode, "es.es_len == 0");
2228                         err = -EFSCORRUPTED;
2229                         break;
2230                 }
2231
2232                 /*
2233                  * This is possible iff next == next_del == EXT_MAX_BLOCKS.
2234                  * we need to check next == EXT_MAX_BLOCKS because it is
2235                  * possible that an extent is with unwritten and delayed
2236                  * status due to when an extent is delayed allocated and
2237                  * is allocated by fallocate status tree will track both of
2238                  * them in a extent.
2239                  *
2240                  * So we could return a unwritten and delayed extent, and
2241                  * its block is equal to 'next'.
2242                  */
2243                 if (next == next_del && next == EXT_MAX_BLOCKS) {
2244                         flags |= FIEMAP_EXTENT_LAST;
2245                         if (unlikely(next_del != EXT_MAX_BLOCKS ||
2246                                      next != EXT_MAX_BLOCKS)) {
2247                                 EXT4_ERROR_INODE(inode,
2248                                                  "next extent == %u, next "
2249                                                  "delalloc extent = %u",
2250                                                  next, next_del);
2251                                 err = -EFSCORRUPTED;
2252                                 break;
2253                         }
2254                 }
2255
2256                 if (exists) {
2257                         err = fiemap_fill_next_extent(fieinfo,
2258                                 (__u64)es.es_lblk << blksize_bits,
2259                                 (__u64)es.es_pblk << blksize_bits,
2260                                 (__u64)es.es_len << blksize_bits,
2261                                 flags);
2262                         if (err < 0)
2263                                 break;
2264                         if (err == 1) {
2265                                 err = 0;
2266                                 break;
2267                         }
2268                 }
2269
2270                 block = es.es_lblk + es.es_len;
2271         }
2272
2273         ext4_ext_drop_refs(path);
2274         kfree(path);
2275         return err;
2276 }
2277
2278 static int ext4_fill_es_cache_info(struct inode *inode,
2279                                    ext4_lblk_t block, ext4_lblk_t num,
2280                                    struct fiemap_extent_info *fieinfo)
2281 {
2282         ext4_lblk_t next, end = block + num - 1;
2283         struct extent_status es;
2284         unsigned char blksize_bits = inode->i_sb->s_blocksize_bits;
2285         unsigned int flags;
2286         int err;
2287
2288         while (block <= end) {
2289                 next = 0;
2290                 flags = 0;
2291                 if (!ext4_es_lookup_extent(inode, block, &next, &es))
2292                         break;
2293                 if (ext4_es_is_unwritten(&es))
2294                         flags |= FIEMAP_EXTENT_UNWRITTEN;
2295                 if (ext4_es_is_delayed(&es))
2296                         flags |= (FIEMAP_EXTENT_DELALLOC |
2297                                   FIEMAP_EXTENT_UNKNOWN);
2298                 if (ext4_es_is_hole(&es))
2299                         flags |= EXT4_FIEMAP_EXTENT_HOLE;
2300                 if (next == 0)
2301                         flags |= FIEMAP_EXTENT_LAST;
2302                 if (flags & (FIEMAP_EXTENT_DELALLOC|
2303                              EXT4_FIEMAP_EXTENT_HOLE))
2304                         es.es_pblk = 0;
2305                 else
2306                         es.es_pblk = ext4_es_pblock(&es);
2307                 err = fiemap_fill_next_extent(fieinfo,
2308                                 (__u64)es.es_lblk << blksize_bits,
2309                                 (__u64)es.es_pblk << blksize_bits,
2310                                 (__u64)es.es_len << blksize_bits,
2311                                 flags);
2312                 if (next == 0)
2313                         break;
2314                 block = next;
2315                 if (err < 0)
2316                         return err;
2317                 if (err == 1)
2318                         return 0;
2319         }
2320         return 0;
2321 }
2322
2323
2324 /*
2325  * ext4_ext_determine_hole - determine hole around given block
2326  * @inode:      inode we lookup in
2327  * @path:       path in extent tree to @lblk
2328  * @lblk:       pointer to logical block around which we want to determine hole
2329  *
2330  * Determine hole length (and start if easily possible) around given logical
2331  * block. We don't try too hard to find the beginning of the hole but @path
2332  * actually points to extent before @lblk, we provide it.
2333  *
2334  * The function returns the length of a hole starting at @lblk. We update @lblk
2335  * to the beginning of the hole if we managed to find it.
2336  */
2337 static ext4_lblk_t ext4_ext_determine_hole(struct inode *inode,
2338                                            struct ext4_ext_path *path,
2339                                            ext4_lblk_t *lblk)
2340 {
2341         int depth = ext_depth(inode);
2342         struct ext4_extent *ex;
2343         ext4_lblk_t len;
2344
2345         ex = path[depth].p_ext;
2346         if (ex == NULL) {
2347                 /* there is no extent yet, so gap is [0;-] */
2348                 *lblk = 0;
2349                 len = EXT_MAX_BLOCKS;
2350         } else if (*lblk < le32_to_cpu(ex->ee_block)) {
2351                 len = le32_to_cpu(ex->ee_block) - *lblk;
2352         } else if (*lblk >= le32_to_cpu(ex->ee_block)
2353                         + ext4_ext_get_actual_len(ex)) {
2354                 ext4_lblk_t next;
2355
2356                 *lblk = le32_to_cpu(ex->ee_block) + ext4_ext_get_actual_len(ex);
2357                 next = ext4_ext_next_allocated_block(path);
2358                 BUG_ON(next == *lblk);
2359                 len = next - *lblk;
2360         } else {
2361                 BUG();
2362         }
2363         return len;
2364 }
2365
2366 /*
2367  * ext4_ext_put_gap_in_cache:
2368  * calculate boundaries of the gap that the requested block fits into
2369  * and cache this gap
2370  */
2371 static void
2372 ext4_ext_put_gap_in_cache(struct inode *inode, ext4_lblk_t hole_start,
2373                           ext4_lblk_t hole_len)
2374 {
2375         struct extent_status es;
2376
2377         ext4_es_find_extent_range(inode, &ext4_es_is_delayed, hole_start,
2378                                   hole_start + hole_len - 1, &es);
2379         if (es.es_len) {
2380                 /* There's delayed extent containing lblock? */
2381                 if (es.es_lblk <= hole_start)
2382                         return;
2383                 hole_len = min(es.es_lblk - hole_start, hole_len);
2384         }
2385         ext_debug(" -> %u:%u\n", hole_start, hole_len);
2386         ext4_es_insert_extent(inode, hole_start, hole_len, ~0,
2387                               EXTENT_STATUS_HOLE);
2388 }
2389
2390 /*
2391  * ext4_ext_rm_idx:
2392  * removes index from the index block.
2393  */
2394 static int ext4_ext_rm_idx(handle_t *handle, struct inode *inode,
2395                         struct ext4_ext_path *path, int depth)
2396 {
2397         int err;
2398         ext4_fsblk_t leaf;
2399
2400         /* free index block */
2401         depth--;
2402         path = path + depth;
2403         leaf = ext4_idx_pblock(path->p_idx);
2404         if (unlikely(path->p_hdr->eh_entries == 0)) {
2405                 EXT4_ERROR_INODE(inode, "path->p_hdr->eh_entries == 0");
2406                 return -EFSCORRUPTED;
2407         }
2408         err = ext4_ext_get_access(handle, inode, path);
2409         if (err)
2410                 return err;
2411
2412         if (path->p_idx != EXT_LAST_INDEX(path->p_hdr)) {
2413                 int len = EXT_LAST_INDEX(path->p_hdr) - path->p_idx;
2414                 len *= sizeof(struct ext4_extent_idx);
2415                 memmove(path->p_idx, path->p_idx + 1, len);
2416         }
2417
2418         le16_add_cpu(&path->p_hdr->eh_entries, -1);
2419         err = ext4_ext_dirty(handle, inode, path);
2420         if (err)
2421                 return err;
2422         ext_debug("index is empty, remove it, free block %llu\n", leaf);
2423         trace_ext4_ext_rm_idx(inode, leaf);
2424
2425         ext4_free_blocks(handle, inode, NULL, leaf, 1,
2426                          EXT4_FREE_BLOCKS_METADATA | EXT4_FREE_BLOCKS_FORGET);
2427
2428         while (--depth >= 0) {
2429                 if (path->p_idx != EXT_FIRST_INDEX(path->p_hdr))
2430                         break;
2431                 path--;
2432                 err = ext4_ext_get_access(handle, inode, path);
2433                 if (err)
2434                         break;
2435                 path->p_idx->ei_block = (path+1)->p_idx->ei_block;
2436                 err = ext4_ext_dirty(handle, inode, path);
2437                 if (err)
2438                         break;
2439         }
2440         return err;
2441 }
2442
2443 /*
2444  * ext4_ext_calc_credits_for_single_extent:
2445  * This routine returns max. credits that needed to insert an extent
2446  * to the extent tree.
2447  * When pass the actual path, the caller should calculate credits
2448  * under i_data_sem.
2449  */
2450 int ext4_ext_calc_credits_for_single_extent(struct inode *inode, int nrblocks,
2451                                                 struct ext4_ext_path *path)
2452 {
2453         if (path) {
2454                 int depth = ext_depth(inode);
2455                 int ret = 0;
2456
2457                 /* probably there is space in leaf? */
2458                 if (le16_to_cpu(path[depth].p_hdr->eh_entries)
2459                                 < le16_to_cpu(path[depth].p_hdr->eh_max)) {
2460
2461                         /*
2462                          *  There are some space in the leaf tree, no
2463                          *  need to account for leaf block credit
2464                          *
2465                          *  bitmaps and block group descriptor blocks
2466                          *  and other metadata blocks still need to be
2467                          *  accounted.
2468                          */
2469                         /* 1 bitmap, 1 block group descriptor */
2470                         ret = 2 + EXT4_META_TRANS_BLOCKS(inode->i_sb);
2471                         return ret;
2472                 }
2473         }
2474
2475         return ext4_chunk_trans_blocks(inode, nrblocks);
2476 }
2477
2478 /*
2479  * How many index/leaf blocks need to change/allocate to add @extents extents?
2480  *
2481  * If we add a single extent, then in the worse case, each tree level
2482  * index/leaf need to be changed in case of the tree split.
2483  *
2484  * If more extents are inserted, they could cause the whole tree split more
2485  * than once, but this is really rare.
2486  */
2487 int ext4_ext_index_trans_blocks(struct inode *inode, int extents)
2488 {
2489         int index;
2490         int depth;
2491
2492         /* If we are converting the inline data, only one is needed here. */
2493         if (ext4_has_inline_data(inode))
2494                 return 1;
2495
2496         depth = ext_depth(inode);
2497
2498         if (extents <= 1)
2499                 index = depth * 2;
2500         else
2501                 index = depth * 3;
2502
2503         return index;
2504 }
2505
2506 static inline int get_default_free_blocks_flags(struct inode *inode)
2507 {
2508         if (S_ISDIR(inode->i_mode) || S_ISLNK(inode->i_mode) ||
2509             ext4_test_inode_flag(inode, EXT4_INODE_EA_INODE))
2510                 return EXT4_FREE_BLOCKS_METADATA | EXT4_FREE_BLOCKS_FORGET;
2511         else if (ext4_should_journal_data(inode))
2512                 return EXT4_FREE_BLOCKS_FORGET;
2513         return 0;
2514 }
2515
2516 /*
2517  * ext4_rereserve_cluster - increment the reserved cluster count when
2518  *                          freeing a cluster with a pending reservation
2519  *
2520  * @inode - file containing the cluster
2521  * @lblk - logical block in cluster to be reserved
2522  *
2523  * Increments the reserved cluster count and adjusts quota in a bigalloc
2524  * file system when freeing a partial cluster containing at least one
2525  * delayed and unwritten block.  A partial cluster meeting that
2526  * requirement will have a pending reservation.  If so, the
2527  * RERESERVE_CLUSTER flag is used when calling ext4_free_blocks() to
2528  * defer reserved and allocated space accounting to a subsequent call
2529  * to this function.
2530  */
2531 static void ext4_rereserve_cluster(struct inode *inode, ext4_lblk_t lblk)
2532 {
2533         struct ext4_sb_info *sbi = EXT4_SB(inode->i_sb);
2534         struct ext4_inode_info *ei = EXT4_I(inode);
2535
2536         dquot_reclaim_block(inode, EXT4_C2B(sbi, 1));
2537
2538         spin_lock(&ei->i_block_reservation_lock);
2539         ei->i_reserved_data_blocks++;
2540         percpu_counter_add(&sbi->s_dirtyclusters_counter, 1);
2541         spin_unlock(&ei->i_block_reservation_lock);
2542
2543         percpu_counter_add(&sbi->s_freeclusters_counter, 1);
2544         ext4_remove_pending(inode, lblk);
2545 }
2546
2547 static int ext4_remove_blocks(handle_t *handle, struct inode *inode,
2548                               struct ext4_extent *ex,
2549                               struct partial_cluster *partial,
2550                               ext4_lblk_t from, ext4_lblk_t to)
2551 {
2552         struct ext4_sb_info *sbi = EXT4_SB(inode->i_sb);
2553         unsigned short ee_len = ext4_ext_get_actual_len(ex);
2554         ext4_fsblk_t last_pblk, pblk;
2555         ext4_lblk_t num;
2556         int flags;
2557
2558         /* only extent tail removal is allowed */
2559         if (from < le32_to_cpu(ex->ee_block) ||
2560             to != le32_to_cpu(ex->ee_block) + ee_len - 1) {
2561                 ext4_error(sbi->s_sb,
2562                            "strange request: removal(2) %u-%u from %u:%u",
2563                            from, to, le32_to_cpu(ex->ee_block), ee_len);
2564                 return 0;
2565         }
2566
2567 #ifdef EXTENTS_STATS
2568         spin_lock(&sbi->s_ext_stats_lock);
2569         sbi->s_ext_blocks += ee_len;
2570         sbi->s_ext_extents++;
2571         if (ee_len < sbi->s_ext_min)
2572                 sbi->s_ext_min = ee_len;
2573         if (ee_len > sbi->s_ext_max)
2574                 sbi->s_ext_max = ee_len;
2575         if (ext_depth(inode) > sbi->s_depth_max)
2576                 sbi->s_depth_max = ext_depth(inode);
2577         spin_unlock(&sbi->s_ext_stats_lock);
2578 #endif
2579
2580         trace_ext4_remove_blocks(inode, ex, from, to, partial);
2581
2582         /*
2583          * if we have a partial cluster, and it's different from the
2584          * cluster of the last block in the extent, we free it
2585          */
2586         last_pblk = ext4_ext_pblock(ex) + ee_len - 1;
2587
2588         if (partial->state != initial &&
2589             partial->pclu != EXT4_B2C(sbi, last_pblk)) {
2590                 if (partial->state == tofree) {
2591                         flags = get_default_free_blocks_flags(inode);
2592                         if (ext4_is_pending(inode, partial->lblk))
2593                                 flags |= EXT4_FREE_BLOCKS_RERESERVE_CLUSTER;
2594                         ext4_free_blocks(handle, inode, NULL,
2595                                          EXT4_C2B(sbi, partial->pclu),
2596                                          sbi->s_cluster_ratio, flags);
2597                         if (flags & EXT4_FREE_BLOCKS_RERESERVE_CLUSTER)
2598                                 ext4_rereserve_cluster(inode, partial->lblk);
2599                 }
2600                 partial->state = initial;
2601         }
2602
2603         num = le32_to_cpu(ex->ee_block) + ee_len - from;
2604         pblk = ext4_ext_pblock(ex) + ee_len - num;
2605
2606         /*
2607          * We free the partial cluster at the end of the extent (if any),
2608          * unless the cluster is used by another extent (partial_cluster
2609          * state is nofree).  If a partial cluster exists here, it must be
2610          * shared with the last block in the extent.
2611          */
2612         flags = get_default_free_blocks_flags(inode);
2613
2614         /* partial, left end cluster aligned, right end unaligned */
2615         if ((EXT4_LBLK_COFF(sbi, to) != sbi->s_cluster_ratio - 1) &&
2616             (EXT4_LBLK_CMASK(sbi, to) >= from) &&
2617             (partial->state != nofree)) {
2618                 if (ext4_is_pending(inode, to))
2619                         flags |= EXT4_FREE_BLOCKS_RERESERVE_CLUSTER;
2620                 ext4_free_blocks(handle, inode, NULL,
2621                                  EXT4_PBLK_CMASK(sbi, last_pblk),
2622                                  sbi->s_cluster_ratio, flags);
2623                 if (flags & EXT4_FREE_BLOCKS_RERESERVE_CLUSTER)
2624                         ext4_rereserve_cluster(inode, to);
2625                 partial->state = initial;
2626                 flags = get_default_free_blocks_flags(inode);
2627         }
2628
2629         flags |= EXT4_FREE_BLOCKS_NOFREE_LAST_CLUSTER;
2630
2631         /*
2632          * For bigalloc file systems, we never free a partial cluster
2633          * at the beginning of the extent.  Instead, we check to see if we
2634          * need to free it on a subsequent call to ext4_remove_blocks,
2635          * or at the end of ext4_ext_rm_leaf or ext4_ext_remove_space.
2636          */
2637         flags |= EXT4_FREE_BLOCKS_NOFREE_FIRST_CLUSTER;
2638         ext4_free_blocks(handle, inode, NULL, pblk, num, flags);
2639
2640         /* reset the partial cluster if we've freed past it */
2641         if (partial->state != initial && partial->pclu != EXT4_B2C(sbi, pblk))
2642                 partial->state = initial;
2643
2644         /*
2645          * If we've freed the entire extent but the beginning is not left
2646          * cluster aligned and is not marked as ineligible for freeing we
2647          * record the partial cluster at the beginning of the extent.  It
2648          * wasn't freed by the preceding ext4_free_blocks() call, and we
2649          * need to look farther to the left to determine if it's to be freed
2650          * (not shared with another extent). Else, reset the partial
2651          * cluster - we're either  done freeing or the beginning of the
2652          * extent is left cluster aligned.
2653          */
2654         if (EXT4_LBLK_COFF(sbi, from) && num == ee_len) {
2655                 if (partial->state == initial) {
2656                         partial->pclu = EXT4_B2C(sbi, pblk);
2657                         partial->lblk = from;
2658                         partial->state = tofree;
2659                 }
2660         } else {
2661                 partial->state = initial;
2662         }
2663
2664         return 0;
2665 }
2666
2667 /*
2668  * ext4_ext_rm_leaf() Removes the extents associated with the
2669  * blocks appearing between "start" and "end".  Both "start"
2670  * and "end" must appear in the same extent or EIO is returned.
2671  *
2672  * @handle: The journal handle
2673  * @inode:  The files inode
2674  * @path:   The path to the leaf
2675  * @partial_cluster: The cluster which we'll have to free if all extents
2676  *                   has been released from it.  However, if this value is
2677  *                   negative, it's a cluster just to the right of the
2678  *                   punched region and it must not be freed.
2679  * @start:  The first block to remove
2680  * @end:   The last block to remove
2681  */
2682 static int
2683 ext4_ext_rm_leaf(handle_t *handle, struct inode *inode,
2684                  struct ext4_ext_path *path,
2685                  struct partial_cluster *partial,
2686                  ext4_lblk_t start, ext4_lblk_t end)
2687 {
2688         struct ext4_sb_info *sbi = EXT4_SB(inode->i_sb);
2689         int err = 0, correct_index = 0;
2690         int depth = ext_depth(inode), credits, revoke_credits;
2691         struct ext4_extent_header *eh;
2692         ext4_lblk_t a, b;
2693         unsigned num;
2694         ext4_lblk_t ex_ee_block;
2695         unsigned short ex_ee_len;
2696         unsigned unwritten = 0;
2697         struct ext4_extent *ex;
2698         ext4_fsblk_t pblk;
2699
2700         /* the header must be checked already in ext4_ext_remove_space() */
2701         ext_debug("truncate since %u in leaf to %u\n", start, end);
2702         if (!path[depth].p_hdr)
2703                 path[depth].p_hdr = ext_block_hdr(path[depth].p_bh);
2704         eh = path[depth].p_hdr;
2705         if (unlikely(path[depth].p_hdr == NULL)) {
2706                 EXT4_ERROR_INODE(inode, "path[%d].p_hdr == NULL", depth);
2707                 return -EFSCORRUPTED;
2708         }
2709         /* find where to start removing */
2710         ex = path[depth].p_ext;
2711         if (!ex)
2712                 ex = EXT_LAST_EXTENT(eh);
2713
2714         ex_ee_block = le32_to_cpu(ex->ee_block);
2715         ex_ee_len = ext4_ext_get_actual_len(ex);
2716
2717         trace_ext4_ext_rm_leaf(inode, start, ex, partial);
2718
2719         while (ex >= EXT_FIRST_EXTENT(eh) &&
2720                         ex_ee_block + ex_ee_len > start) {
2721
2722                 if (ext4_ext_is_unwritten(ex))
2723                         unwritten = 1;
2724                 else
2725                         unwritten = 0;
2726
2727                 ext_debug("remove ext %u:[%d]%d\n", ex_ee_block,
2728                           unwritten, ex_ee_len);
2729                 path[depth].p_ext = ex;
2730
2731                 a = ex_ee_block > start ? ex_ee_block : start;
2732                 b = ex_ee_block+ex_ee_len - 1 < end ?
2733                         ex_ee_block+ex_ee_len - 1 : end;
2734
2735                 ext_debug("  border %u:%u\n", a, b);
2736
2737                 /* If this extent is beyond the end of the hole, skip it */
2738                 if (end < ex_ee_block) {
2739                         /*
2740                          * We're going to skip this extent and move to another,
2741                          * so note that its first cluster is in use to avoid
2742                          * freeing it when removing blocks.  Eventually, the
2743                          * right edge of the truncated/punched region will
2744                          * be just to the left.
2745                          */
2746                         if (sbi->s_cluster_ratio > 1) {
2747                                 pblk = ext4_ext_pblock(ex);
2748                                 partial->pclu = EXT4_B2C(sbi, pblk);
2749                                 partial->state = nofree;
2750                         }
2751                         ex--;
2752                         ex_ee_block = le32_to_cpu(ex->ee_block);
2753                         ex_ee_len = ext4_ext_get_actual_len(ex);
2754                         continue;
2755                 } else if (b != ex_ee_block + ex_ee_len - 1) {
2756                         EXT4_ERROR_INODE(inode,
2757                                          "can not handle truncate %u:%u "
2758                                          "on extent %u:%u",
2759                                          start, end, ex_ee_block,
2760                                          ex_ee_block + ex_ee_len - 1);
2761                         err = -EFSCORRUPTED;
2762                         goto out;
2763                 } else if (a != ex_ee_block) {
2764                         /* remove tail of the extent */
2765                         num = a - ex_ee_block;
2766                 } else {
2767                         /* remove whole extent: excellent! */
2768                         num = 0;
2769                 }
2770                 /*
2771                  * 3 for leaf, sb, and inode plus 2 (bmap and group
2772                  * descriptor) for each block group; assume two block
2773                  * groups plus ex_ee_len/blocks_per_block_group for
2774                  * the worst case
2775                  */
2776                 credits = 7 + 2*(ex_ee_len/EXT4_BLOCKS_PER_GROUP(inode->i_sb));
2777                 if (ex == EXT_FIRST_EXTENT(eh)) {
2778                         correct_index = 1;
2779                         credits += (ext_depth(inode)) + 1;
2780                 }
2781                 credits += EXT4_MAXQUOTAS_TRANS_BLOCKS(inode->i_sb);
2782                 /*
2783                  * We may end up freeing some index blocks and data from the
2784                  * punched range. Note that partial clusters are accounted for
2785                  * by ext4_free_data_revoke_credits().
2786                  */
2787                 revoke_credits =
2788                         ext4_free_metadata_revoke_credits(inode->i_sb,
2789                                                           ext_depth(inode)) +
2790                         ext4_free_data_revoke_credits(inode, b - a + 1);
2791
2792                 err = ext4_datasem_ensure_credits(handle, inode, credits,
2793                                                   credits, revoke_credits);
2794                 if (err) {
2795                         if (err > 0)
2796                                 err = -EAGAIN;
2797                         goto out;
2798                 }
2799
2800                 err = ext4_ext_get_access(handle, inode, path + depth);
2801                 if (err)
2802                         goto out;
2803
2804                 err = ext4_remove_blocks(handle, inode, ex, partial, a, b);
2805                 if (err)
2806                         goto out;
2807
2808                 if (num == 0)
2809                         /* this extent is removed; mark slot entirely unused */
2810                         ext4_ext_store_pblock(ex, 0);
2811
2812                 ex->ee_len = cpu_to_le16(num);
2813                 /*
2814                  * Do not mark unwritten if all the blocks in the
2815                  * extent have been removed.
2816                  */
2817                 if (unwritten && num)
2818                         ext4_ext_mark_unwritten(ex);
2819                 /*
2820                  * If the extent was completely released,
2821                  * we need to remove it from the leaf
2822                  */
2823                 if (num == 0) {
2824                         if (end != EXT_MAX_BLOCKS - 1) {
2825                                 /*
2826                                  * For hole punching, we need to scoot all the
2827                                  * extents up when an extent is removed so that
2828                                  * we dont have blank extents in the middle
2829                                  */
2830                                 memmove(ex, ex+1, (EXT_LAST_EXTENT(eh) - ex) *
2831                                         sizeof(struct ext4_extent));
2832
2833                                 /* Now get rid of the one at the end */
2834                                 memset(EXT_LAST_EXTENT(eh), 0,
2835                                         sizeof(struct ext4_extent));
2836                         }
2837                         le16_add_cpu(&eh->eh_entries, -1);
2838                 }
2839
2840                 err = ext4_ext_dirty(handle, inode, path + depth);
2841                 if (err)
2842                         goto out;
2843
2844                 ext_debug("new extent: %u:%u:%llu\n", ex_ee_block, num,
2845                                 ext4_ext_pblock(ex));
2846                 ex--;
2847                 ex_ee_block = le32_to_cpu(ex->ee_block);
2848                 ex_ee_len = ext4_ext_get_actual_len(ex);
2849         }
2850
2851         if (correct_index && eh->eh_entries)
2852                 err = ext4_ext_correct_indexes(handle, inode, path);
2853
2854         /*
2855          * If there's a partial cluster and at least one extent remains in
2856          * the leaf, free the partial cluster if it isn't shared with the
2857          * current extent.  If it is shared with the current extent
2858          * we reset the partial cluster because we've reached the start of the
2859          * truncated/punched region and we're done removing blocks.
2860          */
2861         if (partial->state == tofree && ex >= EXT_FIRST_EXTENT(eh)) {
2862                 pblk = ext4_ext_pblock(ex) + ex_ee_len - 1;
2863                 if (partial->pclu != EXT4_B2C(sbi, pblk)) {
2864                         int flags = get_default_free_blocks_flags(inode);
2865
2866                         if (ext4_is_pending(inode, partial->lblk))
2867                                 flags |= EXT4_FREE_BLOCKS_RERESERVE_CLUSTER;
2868                         ext4_free_blocks(handle, inode, NULL,
2869                                          EXT4_C2B(sbi, partial->pclu),
2870                                          sbi->s_cluster_ratio, flags);
2871                         if (flags & EXT4_FREE_BLOCKS_RERESERVE_CLUSTER)
2872                                 ext4_rereserve_cluster(inode, partial->lblk);
2873                 }
2874                 partial->state = initial;
2875         }
2876
2877         /* if this leaf is free, then we should
2878          * remove it from index block above */
2879         if (err == 0 && eh->eh_entries == 0 && path[depth].p_bh != NULL)
2880                 err = ext4_ext_rm_idx(handle, inode, path, depth);
2881
2882 out:
2883         return err;
2884 }
2885
2886 /*
2887  * ext4_ext_more_to_rm:
2888  * returns 1 if current index has to be freed (even partial)
2889  */
2890 static int
2891 ext4_ext_more_to_rm(struct ext4_ext_path *path)
2892 {
2893         BUG_ON(path->p_idx == NULL);
2894
2895         if (path->p_idx < EXT_FIRST_INDEX(path->p_hdr))
2896                 return 0;
2897
2898         /*
2899          * if truncate on deeper level happened, it wasn't partial,
2900          * so we have to consider current index for truncation
2901          */
2902         if (le16_to_cpu(path->p_hdr->eh_entries) == path->p_block)
2903                 return 0;
2904         return 1;
2905 }
2906
2907 int ext4_ext_remove_space(struct inode *inode, ext4_lblk_t start,
2908                           ext4_lblk_t end)
2909 {
2910         struct ext4_sb_info *sbi = EXT4_SB(inode->i_sb);
2911         int depth = ext_depth(inode);
2912         struct ext4_ext_path *path = NULL;
2913         struct partial_cluster partial;
2914         handle_t *handle;
2915         int i = 0, err = 0;
2916
2917         partial.pclu = 0;
2918         partial.lblk = 0;
2919         partial.state = initial;
2920
2921         ext_debug("truncate since %u to %u\n", start, end);
2922
2923         /* probably first extent we're gonna free will be last in block */
2924         handle = ext4_journal_start_with_revoke(inode, EXT4_HT_TRUNCATE,
2925                         depth + 1,
2926                         ext4_free_metadata_revoke_credits(inode->i_sb, depth));
2927         if (IS_ERR(handle))
2928                 return PTR_ERR(handle);
2929
2930 again:
2931         trace_ext4_ext_remove_space(inode, start, end, depth);
2932
2933         /*
2934          * Check if we are removing extents inside the extent tree. If that
2935          * is the case, we are going to punch a hole inside the extent tree
2936          * so we have to check whether we need to split the extent covering
2937          * the last block to remove so we can easily remove the part of it
2938          * in ext4_ext_rm_leaf().
2939          */
2940         if (end < EXT_MAX_BLOCKS - 1) {
2941                 struct ext4_extent *ex;
2942                 ext4_lblk_t ee_block, ex_end, lblk;
2943                 ext4_fsblk_t pblk;
2944
2945                 /* find extent for or closest extent to this block */
2946                 path = ext4_find_extent(inode, end, NULL, EXT4_EX_NOCACHE);
2947                 if (IS_ERR(path)) {
2948                         ext4_journal_stop(handle);
2949                         return PTR_ERR(path);
2950                 }
2951                 depth = ext_depth(inode);
2952                 /* Leaf not may not exist only if inode has no blocks at all */
2953                 ex = path[depth].p_ext;
2954                 if (!ex) {
2955                         if (depth) {
2956                                 EXT4_ERROR_INODE(inode,
2957                                                  "path[%d].p_hdr == NULL",
2958                                                  depth);
2959                                 err = -EFSCORRUPTED;
2960                         }
2961                         goto out;
2962                 }
2963
2964                 ee_block = le32_to_cpu(ex->ee_block);
2965                 ex_end = ee_block + ext4_ext_get_actual_len(ex) - 1;
2966
2967                 /*
2968                  * See if the last block is inside the extent, if so split
2969                  * the extent at 'end' block so we can easily remove the
2970                  * tail of the first part of the split extent in
2971                  * ext4_ext_rm_leaf().
2972                  */
2973                 if (end >= ee_block && end < ex_end) {
2974
2975                         /*
2976                          * If we're going to split the extent, note that
2977                          * the cluster containing the block after 'end' is
2978                          * in use to avoid freeing it when removing blocks.
2979                          */
2980                         if (sbi->s_cluster_ratio > 1) {
2981                                 pblk = ext4_ext_pblock(ex) + end - ee_block + 2;
2982                                 partial.pclu = EXT4_B2C(sbi, pblk);
2983                                 partial.state = nofree;
2984                         }
2985
2986                         /*
2987                          * Split the extent in two so that 'end' is the last
2988                          * block in the first new extent. Also we should not
2989                          * fail removing space due to ENOSPC so try to use
2990                          * reserved block if that happens.
2991                          */
2992                         err = ext4_force_split_extent_at(handle, inode, &path,
2993                                                          end + 1, 1);
2994                         if (err < 0)
2995                                 goto out;
2996
2997                 } else if (sbi->s_cluster_ratio > 1 && end >= ex_end &&
2998                            partial.state == initial) {
2999                         /*
3000                          * If we're punching, there's an extent to the right.
3001                          * If the partial cluster hasn't been set, set it to
3002                          * that extent's first cluster and its state to nofree
3003                          * so it won't be freed should it contain blocks to be
3004                          * removed. If it's already set (tofree/nofree), we're
3005                          * retrying and keep the original partial cluster info
3006                          * so a cluster marked tofree as a result of earlier
3007                          * extent removal is not lost.
3008                          */
3009                         lblk = ex_end + 1;
3010                         err = ext4_ext_search_right(inode, path, &lblk, &pblk,
3011                                                     &ex);
3012                         if (err)
3013                                 goto out;
3014                         if (pblk) {
3015                                 partial.pclu = EXT4_B2C(sbi, pblk);
3016                                 partial.state = nofree;
3017                         }
3018                 }
3019         }
3020         /*
3021          * We start scanning from right side, freeing all the blocks
3022          * after i_size and walking into the tree depth-wise.
3023          */
3024         depth = ext_depth(inode);
3025         if (path) {
3026                 int k = i = depth;
3027                 while (--k > 0)
3028                         path[k].p_block =
3029                                 le16_to_cpu(path[k].p_hdr->eh_entries)+1;
3030         } else {
3031                 path = kcalloc(depth + 1, sizeof(struct ext4_ext_path),
3032                                GFP_NOFS);
3033                 if (path == NULL) {
3034                         ext4_journal_stop(handle);
3035                         return -ENOMEM;
3036                 }
3037                 path[0].p_maxdepth = path[0].p_depth = depth;
3038                 path[0].p_hdr = ext_inode_hdr(inode);
3039                 i = 0;
3040
3041                 if (ext4_ext_check(inode, path[0].p_hdr, depth, 0)) {
3042                         err = -EFSCORRUPTED;
3043                         goto out;
3044                 }
3045         }
3046         err = 0;
3047
3048         while (i >= 0 && err == 0) {
3049                 if (i == depth) {
3050                         /* this is leaf block */
3051                         err = ext4_ext_rm_leaf(handle, inode, path,
3052                                                &partial, start, end);
3053                         /* root level has p_bh == NULL, brelse() eats this */
3054                         brelse(path[i].p_bh);
3055                         path[i].p_bh = NULL;
3056                         i--;
3057                         continue;
3058                 }
3059
3060                 /* this is index block */
3061                 if (!path[i].p_hdr) {
3062                         ext_debug("initialize header\n");
3063                         path[i].p_hdr = ext_block_hdr(path[i].p_bh);
3064                 }
3065
3066                 if (!path[i].p_idx) {
3067                         /* this level hasn't been touched yet */
3068                         path[i].p_idx = EXT_LAST_INDEX(path[i].p_hdr);
3069                         path[i].p_block = le16_to_cpu(path[i].p_hdr->eh_entries)+1;
3070                         ext_debug("init index ptr: hdr 0x%p, num %d\n",
3071                                   path[i].p_hdr,
3072                                   le16_to_cpu(path[i].p_hdr->eh_entries));
3073                 } else {
3074                         /* we were already here, see at next index */
3075                         path[i].p_idx--;
3076                 }
3077
3078                 ext_debug("level %d - index, first 0x%p, cur 0x%p\n",
3079                                 i, EXT_FIRST_INDEX(path[i].p_hdr),
3080                                 path[i].p_idx);
3081                 if (ext4_ext_more_to_rm(path + i)) {
3082                         struct buffer_head *bh;
3083                         /* go to the next level */
3084                         ext_debug("move to level %d (block %llu)\n",
3085                                   i + 1, ext4_idx_pblock(path[i].p_idx));
3086                         memset(path + i + 1, 0, sizeof(*path));
3087                         bh = read_extent_tree_block(inode,
3088                                 ext4_idx_pblock(path[i].p_idx), depth - i - 1,
3089                                 EXT4_EX_NOCACHE);
3090                         if (IS_ERR(bh)) {
3091                                 /* should we reset i_size? */
3092                                 err = PTR_ERR(bh);
3093                                 break;
3094                         }
3095                         /* Yield here to deal with large extent trees.
3096                          * Should be a no-op if we did IO above. */
3097                         cond_resched();
3098                         if (WARN_ON(i + 1 > depth)) {
3099                                 err = -EFSCORRUPTED;
3100                                 break;
3101                         }
3102                         path[i + 1].p_bh = bh;
3103
3104                         /* save actual number of indexes since this
3105                          * number is changed at the next iteration */
3106                         path[i].p_block = le16_to_cpu(path[i].p_hdr->eh_entries);
3107                         i++;
3108                 } else {
3109                         /* we finished processing this index, go up */
3110                         if (path[i].p_hdr->eh_entries == 0 && i > 0) {
3111                                 /* index is empty, remove it;
3112                                  * handle must be already prepared by the
3113                                  * truncatei_leaf() */
3114                                 err = ext4_ext_rm_idx(handle, inode, path, i);
3115                         }
3116                         /* root level has p_bh == NULL, brelse() eats this */
3117                         brelse(path[i].p_bh);
3118                         path[i].p_bh = NULL;
3119                         i--;
3120                         ext_debug("return to level %d\n", i);
3121                 }
3122         }
3123
3124         trace_ext4_ext_remove_space_done(inode, start, end, depth, &partial,
3125                                          path->p_hdr->eh_entries);
3126
3127         /*
3128          * if there's a partial cluster and we have removed the first extent
3129          * in the file, then we also free the partial cluster, if any
3130          */
3131         if (partial.state == tofree && err == 0) {
3132                 int flags = get_default_free_blocks_flags(inode);
3133
3134                 if (ext4_is_pending(inode, partial.lblk))
3135                         flags |= EXT4_FREE_BLOCKS_RERESERVE_CLUSTER;
3136                 ext4_free_blocks(handle, inode, NULL,
3137                                  EXT4_C2B(sbi, partial.pclu),
3138                                  sbi->s_cluster_ratio, flags);
3139                 if (flags & EXT4_FREE_BLOCKS_RERESERVE_CLUSTER)
3140                         ext4_rereserve_cluster(inode, partial.lblk);
3141                 partial.state = initial;
3142         }
3143
3144         /* TODO: flexible tree reduction should be here */
3145         if (path->p_hdr->eh_entries == 0) {
3146                 /*
3147                  * truncate to zero freed all the tree,
3148                  * so we need to correct eh_depth
3149                  */
3150                 err = ext4_ext_get_access(handle, inode, path);
3151                 if (err == 0) {
3152                         ext_inode_hdr(inode)->eh_depth = 0;
3153                         ext_inode_hdr(inode)->eh_max =
3154                                 cpu_to_le16(ext4_ext_space_root(inode, 0));
3155                         err = ext4_ext_dirty(handle, inode, path);
3156                 }
3157         }
3158 out:
3159         ext4_ext_drop_refs(path);
3160         kfree(path);
3161         path = NULL;
3162         if (err == -EAGAIN)
3163                 goto again;
3164         ext4_journal_stop(handle);
3165
3166         return err;
3167 }
3168
3169 /*
3170  * called at mount time
3171  */
3172 void ext4_ext_init(struct super_block *sb)
3173 {
3174         /*
3175          * possible initialization would be here
3176          */
3177
3178         if (ext4_has_feature_extents(sb)) {
3179 #if defined(AGGRESSIVE_TEST) || defined(CHECK_BINSEARCH) || defined(EXTENTS_STATS)
3180                 printk(KERN_INFO "EXT4-fs: file extents enabled"
3181 #ifdef AGGRESSIVE_TEST
3182                        ", aggressive tests"
3183 #endif
3184 #ifdef CHECK_BINSEARCH
3185                        ", check binsearch"
3186 #endif
3187 #ifdef EXTENTS_STATS
3188                        ", stats"
3189 #endif
3190                        "\n");
3191 #endif
3192 #ifdef EXTENTS_STATS
3193                 spin_lock_init(&EXT4_SB(sb)->s_ext_stats_lock);
3194                 EXT4_SB(sb)->s_ext_min = 1 << 30;
3195                 EXT4_SB(sb)->s_ext_max = 0;
3196 #endif
3197         }
3198 }
3199
3200 /*
3201  * called at umount time
3202  */
3203 void ext4_ext_release(struct super_block *sb)
3204 {
3205         if (!ext4_has_feature_extents(sb))
3206                 return;
3207
3208 #ifdef EXTENTS_STATS
3209         if (EXT4_SB(sb)->s_ext_blocks && EXT4_SB(sb)->s_ext_extents) {
3210                 struct ext4_sb_info *sbi = EXT4_SB(sb);
3211                 printk(KERN_ERR "EXT4-fs: %lu blocks in %lu extents (%lu ave)\n",
3212                         sbi->s_ext_blocks, sbi->s_ext_extents,
3213                         sbi->s_ext_blocks / sbi->s_ext_extents);
3214                 printk(KERN_ERR "EXT4-fs: extents: %lu min, %lu max, max depth %lu\n",
3215                         sbi->s_ext_min, sbi->s_ext_max, sbi->s_depth_max);
3216         }
3217 #endif
3218 }
3219
3220 static int ext4_zeroout_es(struct inode *inode, struct ext4_extent *ex)
3221 {
3222         ext4_lblk_t  ee_block;
3223         ext4_fsblk_t ee_pblock;
3224         unsigned int ee_len;
3225
3226         ee_block  = le32_to_cpu(ex->ee_block);
3227         ee_len    = ext4_ext_get_actual_len(ex);
3228         ee_pblock = ext4_ext_pblock(ex);
3229
3230         if (ee_len == 0)
3231                 return 0;
3232
3233         return ext4_es_insert_extent(inode, ee_block, ee_len, ee_pblock,
3234                                      EXTENT_STATUS_WRITTEN);
3235 }
3236
3237 /* FIXME!! we need to try to merge to left or right after zero-out  */
3238 static int ext4_ext_zeroout(struct inode *inode, struct ext4_extent *ex)
3239 {
3240         ext4_fsblk_t ee_pblock;
3241         unsigned int ee_len;
3242
3243         ee_len    = ext4_ext_get_actual_len(ex);
3244         ee_pblock = ext4_ext_pblock(ex);
3245         return ext4_issue_zeroout(inode, le32_to_cpu(ex->ee_block), ee_pblock,
3246                                   ee_len);
3247 }
3248
3249 /*
3250  * ext4_split_extent_at() splits an extent at given block.
3251  *
3252  * @handle: the journal handle
3253  * @inode: the file inode
3254  * @path: the path to the extent
3255  * @split: the logical block where the extent is splitted.
3256  * @split_flags: indicates if the extent could be zeroout if split fails, and
3257  *               the states(init or unwritten) of new extents.
3258  * @flags: flags used to insert new extent to extent tree.
3259  *
3260  *
3261  * Splits extent [a, b] into two extents [a, @split) and [@split, b], states
3262  * of which are deterimined by split_flag.
3263  *
3264  * There are two cases:
3265  *  a> the extent are splitted into two extent.
3266  *  b> split is not needed, and just mark the extent.
3267  *
3268  * return 0 on success.
3269  */
3270 static int ext4_split_extent_at(handle_t *handle,
3271                              struct inode *inode,
3272                              struct ext4_ext_path **ppath,
3273                              ext4_lblk_t split,
3274                              int split_flag,
3275                              int flags)
3276 {
3277         struct ext4_ext_path *path = *ppath;
3278         ext4_fsblk_t newblock;
3279         ext4_lblk_t ee_block;
3280         struct ext4_extent *ex, newex, orig_ex, zero_ex;
3281         struct ext4_extent *ex2 = NULL;
3282         unsigned int ee_len, depth;
3283         int err = 0;
3284
3285         BUG_ON((split_flag & (EXT4_EXT_DATA_VALID1 | EXT4_EXT_DATA_VALID2)) ==
3286                (EXT4_EXT_DATA_VALID1 | EXT4_EXT_DATA_VALID2));
3287
3288         ext_debug("ext4_split_extents_at: inode %lu, logical"
3289                 "block %llu\n", inode->i_ino, (unsigned long long)split);
3290
3291         ext4_ext_show_leaf(inode, path);
3292
3293         depth = ext_depth(inode);
3294         ex = path[depth].p_ext;
3295         ee_block = le32_to_cpu(ex->ee_block);
3296         ee_len = ext4_ext_get_actual_len(ex);
3297         newblock = split - ee_block + ext4_ext_pblock(ex);
3298
3299         BUG_ON(split < ee_block || split >= (ee_block + ee_len));
3300         BUG_ON(!ext4_ext_is_unwritten(ex) &&
3301                split_flag & (EXT4_EXT_MAY_ZEROOUT |
3302                              EXT4_EXT_MARK_UNWRIT1 |
3303                              EXT4_EXT_MARK_UNWRIT2));
3304
3305         err = ext4_ext_get_access(handle, inode, path + depth);
3306         if (err)
3307                 goto out;
3308
3309         if (split == ee_block) {
3310                 /*
3311                  * case b: block @split is the block that the extent begins with
3312                  * then we just change the state of the extent, and splitting
3313                  * is not needed.
3314                  */
3315                 if (split_flag & EXT4_EXT_MARK_UNWRIT2)
3316                         ext4_ext_mark_unwritten(ex);
3317                 else
3318                         ext4_ext_mark_initialized(ex);
3319
3320                 if (!(flags & EXT4_GET_BLOCKS_PRE_IO))
3321                         ext4_ext_try_to_merge(handle, inode, path, ex);
3322
3323                 err = ext4_ext_dirty(handle, inode, path + path->p_depth);
3324                 goto out;
3325         }
3326
3327         /* case a */
3328         memcpy(&orig_ex, ex, sizeof(orig_ex));
3329         ex->ee_len = cpu_to_le16(split - ee_block);
3330         if (split_flag & EXT4_EXT_MARK_UNWRIT1)
3331                 ext4_ext_mark_unwritten(ex);
3332
3333         /*
3334          * path may lead to new leaf, not to original leaf any more
3335          * after ext4_ext_insert_extent() returns,
3336          */
3337         err = ext4_ext_dirty(handle, inode, path + depth);
3338         if (err)
3339                 goto fix_extent_len;
3340
3341         ex2 = &newex;
3342         ex2->ee_block = cpu_to_le32(split);
3343         ex2->ee_len   = cpu_to_le16(ee_len - (split - ee_block));
3344         ext4_ext_store_pblock(ex2, newblock);
3345         if (split_flag & EXT4_EXT_MARK_UNWRIT2)
3346                 ext4_ext_mark_unwritten(ex2);
3347
3348         err = ext4_ext_insert_extent(handle, inode, ppath, &newex, flags);
3349         if (err == -ENOSPC && (EXT4_EXT_MAY_ZEROOUT & split_flag)) {
3350                 if (split_flag & (EXT4_EXT_DATA_VALID1|EXT4_EXT_DATA_VALID2)) {
3351                         if (split_flag & EXT4_EXT_DATA_VALID1) {
3352                                 err = ext4_ext_zeroout(inode, ex2);
3353                                 zero_ex.ee_block = ex2->ee_block;
3354                                 zero_ex.ee_len = cpu_to_le16(
3355                                                 ext4_ext_get_actual_len(ex2));
3356                                 ext4_ext_store_pblock(&zero_ex,
3357                                                       ext4_ext_pblock(ex2));
3358                         } else {
3359                                 err = ext4_ext_zeroout(inode, ex);
3360                                 zero_ex.ee_block = ex->ee_block;
3361                                 zero_ex.ee_len = cpu_to_le16(
3362                                                 ext4_ext_get_actual_len(ex));
3363                                 ext4_ext_store_pblock(&zero_ex,
3364                                                       ext4_ext_pblock(ex));
3365                         }
3366                 } else {
3367                         err = ext4_ext_zeroout(inode, &orig_ex);
3368                         zero_ex.ee_block = orig_ex.ee_block;
3369                         zero_ex.ee_len = cpu_to_le16(
3370                                                 ext4_ext_get_actual_len(&orig_ex));
3371                         ext4_ext_store_pblock(&zero_ex,
3372                                               ext4_ext_pblock(&orig_ex));
3373                 }
3374
3375                 if (err)
3376                         goto fix_extent_len;
3377                 /* update the extent length and mark as initialized */
3378                 ex->ee_len = cpu_to_le16(ee_len);
3379                 ext4_ext_try_to_merge(handle, inode, path, ex);
3380                 err = ext4_ext_dirty(handle, inode, path + path->p_depth);
3381                 if (err)
3382                         goto fix_extent_len;
3383
3384                 /* update extent status tree */
3385                 err = ext4_zeroout_es(inode, &zero_ex);
3386
3387                 goto out;
3388         } else if (err)
3389                 goto fix_extent_len;
3390
3391 out:
3392         ext4_ext_show_leaf(inode, path);
3393         return err;
3394
3395 fix_extent_len:
3396         ex->ee_len = orig_ex.ee_len;
3397         ext4_ext_dirty(handle, inode, path + path->p_depth);
3398         return err;
3399 }
3400
3401 /*
3402  * ext4_split_extents() splits an extent and mark extent which is covered
3403  * by @map as split_flags indicates
3404  *
3405  * It may result in splitting the extent into multiple extents (up to three)
3406  * There are three possibilities:
3407  *   a> There is no split required
3408  *   b> Splits in two extents: Split is happening at either end of the extent
3409  *   c> Splits in three extents: Somone is splitting in middle of the extent
3410  *
3411  */
3412 static int ext4_split_extent(handle_t *handle,
3413                               struct inode *inode,
3414                               struct ext4_ext_path **ppath,
3415                               struct ext4_map_blocks *map,
3416                               int split_flag,
3417                               int flags)
3418 {
3419         struct ext4_ext_path *path = *ppath;
3420         ext4_lblk_t ee_block;
3421         struct ext4_extent *ex;
3422         unsigned int ee_len, depth;
3423         int err = 0;
3424         int unwritten;
3425         int split_flag1, flags1;
3426         int allocated = map->m_len;
3427
3428         depth = ext_depth(inode);
3429         ex = path[depth].p_ext;
3430         ee_block = le32_to_cpu(ex->ee_block);
3431         ee_len = ext4_ext_get_actual_len(ex);
3432         unwritten = ext4_ext_is_unwritten(ex);
3433
3434         if (map->m_lblk + map->m_len < ee_block + ee_len) {
3435                 split_flag1 = split_flag & EXT4_EXT_MAY_ZEROOUT;
3436                 flags1 = flags | EXT4_GET_BLOCKS_PRE_IO;
3437                 if (unwritten)
3438                         split_flag1 |= EXT4_EXT_MARK_UNWRIT1 |
3439                                        EXT4_EXT_MARK_UNWRIT2;
3440                 if (split_flag & EXT4_EXT_DATA_VALID2)
3441                         split_flag1 |= EXT4_EXT_DATA_VALID1;
3442                 err = ext4_split_extent_at(handle, inode, ppath,
3443                                 map->m_lblk + map->m_len, split_flag1, flags1);
3444                 if (err)
3445                         goto out;
3446         } else {
3447                 allocated = ee_len - (map->m_lblk - ee_block);
3448         }
3449         /*
3450          * Update path is required because previous ext4_split_extent_at() may
3451          * result in split of original leaf or extent zeroout.
3452          */
3453         path = ext4_find_extent(inode, map->m_lblk, ppath, 0);
3454         if (IS_ERR(path))
3455                 return PTR_ERR(path);
3456         depth = ext_depth(inode);
3457         ex = path[depth].p_ext;
3458         if (!ex) {
3459                 EXT4_ERROR_INODE(inode, "unexpected hole at %lu",
3460                                  (unsigned long) map->m_lblk);
3461                 return -EFSCORRUPTED;
3462         }
3463         unwritten = ext4_ext_is_unwritten(ex);
3464         split_flag1 = 0;
3465
3466         if (map->m_lblk >= ee_block) {
3467                 split_flag1 = split_flag & EXT4_EXT_DATA_VALID2;
3468                 if (unwritten) {
3469                         split_flag1 |= EXT4_EXT_MARK_UNWRIT1;
3470                         split_flag1 |= split_flag & (EXT4_EXT_MAY_ZEROOUT |
3471                                                      EXT4_EXT_MARK_UNWRIT2);
3472                 }
3473                 err = ext4_split_extent_at(handle, inode, ppath,
3474                                 map->m_lblk, split_flag1, flags);
3475                 if (err)
3476                         goto out;
3477         }
3478
3479         ext4_ext_show_leaf(inode, path);
3480 out:
3481         return err ? err : allocated;
3482 }
3483
3484 /*
3485  * This function is called by ext4_ext_map_blocks() if someone tries to write
3486  * to an unwritten extent. It may result in splitting the unwritten
3487  * extent into multiple extents (up to three - one initialized and two
3488  * unwritten).
3489  * There are three possibilities:
3490  *   a> There is no split required: Entire extent should be initialized
3491  *   b> Splits in two extents: Write is happening at either end of the extent
3492  *   c> Splits in three extents: Somone is writing in middle of the extent
3493  *
3494  * Pre-conditions:
3495  *  - The extent pointed to by 'path' is unwritten.
3496  *  - The extent pointed to by 'path' contains a superset
3497  *    of the logical span [map->m_lblk, map->m_lblk + map->m_len).
3498  *
3499  * Post-conditions on success:
3500  *  - the returned value is the number of blocks beyond map->l_lblk
3501  *    that are allocated and initialized.
3502  *    It is guaranteed to be >= map->m_len.
3503  */
3504 static int ext4_ext_convert_to_initialized(handle_t *handle,
3505                                            struct inode *inode,
3506                                            struct ext4_map_blocks *map,
3507                                            struct ext4_ext_path **ppath,
3508                                            int flags)
3509 {
3510         struct ext4_ext_path *path = *ppath;
3511         struct ext4_sb_info *sbi;
3512         struct ext4_extent_header *eh;
3513         struct ext4_map_blocks split_map;
3514         struct ext4_extent zero_ex1, zero_ex2;
3515         struct ext4_extent *ex, *abut_ex;
3516         ext4_lblk_t ee_block, eof_block;
3517         unsigned int ee_len, depth, map_len = map->m_len;
3518         int allocated = 0, max_zeroout = 0;
3519         int err = 0;
3520         int split_flag = EXT4_EXT_DATA_VALID2;
3521
3522         ext_debug("ext4_ext_convert_to_initialized: inode %lu, logical"
3523                 "block %llu, max_blocks %u\n", inode->i_ino,
3524                 (unsigned long long)map->m_lblk, map_len);
3525
3526         sbi = EXT4_SB(inode->i_sb);
3527         eof_block = (inode->i_size + inode->i_sb->s_blocksize - 1) >>
3528                 inode->i_sb->s_blocksize_bits;
3529         if (eof_block < map->m_lblk + map_len)
3530                 eof_block = map->m_lblk + map_len;
3531
3532         depth = ext_depth(inode);
3533         eh = path[depth].p_hdr;
3534         ex = path[depth].p_ext;
3535         ee_block = le32_to_cpu(ex->ee_block);
3536         ee_len = ext4_ext_get_actual_len(ex);
3537         zero_ex1.ee_len = 0;
3538         zero_ex2.ee_len = 0;
3539
3540         trace_ext4_ext_convert_to_initialized_enter(inode, map, ex);
3541
3542         /* Pre-conditions */
3543         BUG_ON(!ext4_ext_is_unwritten(ex));
3544         BUG_ON(!in_range(map->m_lblk, ee_block, ee_len));
3545
3546         /*
3547          * Attempt to transfer newly initialized blocks from the currently
3548          * unwritten extent to its neighbor. This is much cheaper
3549          * than an insertion followed by a merge as those involve costly
3550          * memmove() calls. Transferring to the left is the common case in
3551          * steady state for workloads doing fallocate(FALLOC_FL_KEEP_SIZE)
3552          * followed by append writes.
3553          *
3554          * Limitations of the current logic:
3555          *  - L1: we do not deal with writes covering the whole extent.
3556          *    This would require removing the extent if the transfer
3557          *    is possible.
3558          *  - L2: we only attempt to merge with an extent stored in the
3559          *    same extent tree node.
3560          */
3561         if ((map->m_lblk == ee_block) &&
3562                 /* See if we can merge left */
3563                 (map_len < ee_len) &&           /*L1*/
3564                 (ex > EXT_FIRST_EXTENT(eh))) {  /*L2*/
3565                 ext4_lblk_t prev_lblk;
3566                 ext4_fsblk_t prev_pblk, ee_pblk;
3567                 unsigned int prev_len;
3568
3569                 abut_ex = ex - 1;
3570                 prev_lblk = le32_to_cpu(abut_ex->ee_block);
3571                 prev_len = ext4_ext_get_actual_len(abut_ex);
3572                 prev_pblk = ext4_ext_pblock(abut_ex);
3573                 ee_pblk = ext4_ext_pblock(ex);
3574
3575                 /*
3576                  * A transfer of blocks from 'ex' to 'abut_ex' is allowed
3577                  * upon those conditions:
3578                  * - C1: abut_ex is initialized,
3579                  * - C2: abut_ex is logically abutting ex,
3580                  * - C3: abut_ex is physically abutting ex,
3581                  * - C4: abut_ex can receive the additional blocks without
3582                  *   overflowing the (initialized) length limit.
3583                  */
3584                 if ((!ext4_ext_is_unwritten(abut_ex)) &&                /*C1*/
3585                         ((prev_lblk + prev_len) == ee_block) &&         /*C2*/
3586                         ((prev_pblk + prev_len) == ee_pblk) &&          /*C3*/
3587                         (prev_len < (EXT_INIT_MAX_LEN - map_len))) {    /*C4*/
3588                         err = ext4_ext_get_access(handle, inode, path + depth);
3589                         if (err)
3590                                 goto out;
3591
3592                         trace_ext4_ext_convert_to_initialized_fastpath(inode,
3593                                 map, ex, abut_ex);
3594
3595                         /* Shift the start of ex by 'map_len' blocks */
3596                         ex->ee_block = cpu_to_le32(ee_block + map_len);
3597                         ext4_ext_store_pblock(ex, ee_pblk + map_len);
3598                         ex->ee_len = cpu_to_le16(ee_len - map_len);
3599                         ext4_ext_mark_unwritten(ex); /* Restore the flag */
3600
3601                         /* Extend abut_ex by 'map_len' blocks */
3602                         abut_ex->ee_len = cpu_to_le16(prev_len + map_len);
3603
3604                         /* Result: number of initialized blocks past m_lblk */
3605                         allocated = map_len;
3606                 }
3607         } else if (((map->m_lblk + map_len) == (ee_block + ee_len)) &&
3608                    (map_len < ee_len) &&        /*L1*/
3609                    ex < EXT_LAST_EXTENT(eh)) {  /*L2*/
3610                 /* See if we can merge right */
3611                 ext4_lblk_t next_lblk;
3612                 ext4_fsblk_t next_pblk, ee_pblk;
3613                 unsigned int next_len;
3614
3615                 abut_ex = ex + 1;
3616                 next_lblk = le32_to_cpu(abut_ex->ee_block);
3617                 next_len = ext4_ext_get_actual_len(abut_ex);
3618                 next_pblk = ext4_ext_pblock(abut_ex);
3619                 ee_pblk = ext4_ext_pblock(ex);
3620
3621                 /*
3622                  * A transfer of blocks from 'ex' to 'abut_ex' is allowed
3623                  * upon those conditions:
3624                  * - C1: abut_ex is initialized,
3625                  * - C2: abut_ex is logically abutting ex,
3626                  * - C3: abut_ex is physically abutting ex,
3627                  * - C4: abut_ex can receive the additional blocks without
3628                  *   overflowing the (initialized) length limit.
3629                  */
3630                 if ((!ext4_ext_is_unwritten(abut_ex)) &&                /*C1*/
3631                     ((map->m_lblk + map_len) == next_lblk) &&           /*C2*/
3632                     ((ee_pblk + ee_len) == next_pblk) &&                /*C3*/
3633                     (next_len < (EXT_INIT_MAX_LEN - map_len))) {        /*C4*/
3634                         err = ext4_ext_get_access(handle, inode, path + depth);
3635                         if (err)
3636                                 goto out;
3637
3638                         trace_ext4_ext_convert_to_initialized_fastpath(inode,
3639                                 map, ex, abut_ex);
3640
3641                         /* Shift the start of abut_ex by 'map_len' blocks */
3642                         abut_ex->ee_block = cpu_to_le32(next_lblk - map_len);
3643                         ext4_ext_store_pblock(abut_ex, next_pblk - map_len);
3644                         ex->ee_len = cpu_to_le16(ee_len - map_len);
3645                         ext4_ext_mark_unwritten(ex); /* Restore the flag */
3646
3647                         /* Extend abut_ex by 'map_len' blocks */
3648                         abut_ex->ee_len = cpu_to_le16(next_len + map_len);
3649
3650                         /* Result: number of initialized blocks past m_lblk */
3651                         allocated = map_len;
3652                 }
3653         }
3654         if (allocated) {
3655                 /* Mark the block containing both extents as dirty */
3656                 ext4_ext_dirty(handle, inode, path + depth);
3657
3658                 /* Update path to point to the right extent */
3659                 path[depth].p_ext = abut_ex;
3660                 goto out;
3661         } else
3662                 allocated = ee_len - (map->m_lblk - ee_block);
3663
3664         WARN_ON(map->m_lblk < ee_block);
3665         /*
3666          * It is safe to convert extent to initialized via explicit
3667          * zeroout only if extent is fully inside i_size or new_size.
3668          */
3669         split_flag |= ee_block + ee_len <= eof_block ? EXT4_EXT_MAY_ZEROOUT : 0;
3670
3671         if (EXT4_EXT_MAY_ZEROOUT & split_flag)
3672                 max_zeroout = sbi->s_extent_max_zeroout_kb >>
3673                         (inode->i_sb->s_blocksize_bits - 10);
3674
3675         /*
3676          * five cases:
3677          * 1. split the extent into three extents.
3678          * 2. split the extent into two extents, zeroout the head of the first
3679          *    extent.
3680          * 3. split the extent into two extents, zeroout the tail of the second
3681          *    extent.
3682          * 4. split the extent into two extents with out zeroout.
3683          * 5. no splitting needed, just possibly zeroout the head and / or the
3684          *    tail of the extent.
3685          */
3686         split_map.m_lblk = map->m_lblk;
3687         split_map.m_len = map->m_len;
3688
3689         if (max_zeroout && (allocated > split_map.m_len)) {
3690                 if (allocated <= max_zeroout) {
3691                         /* case 3 or 5 */
3692                         zero_ex1.ee_block =
3693                                  cpu_to_le32(split_map.m_lblk +
3694                                              split_map.m_len);
3695                         zero_ex1.ee_len =
3696                                 cpu_to_le16(allocated - split_map.m_len);
3697                         ext4_ext_store_pblock(&zero_ex1,
3698                                 ext4_ext_pblock(ex) + split_map.m_lblk +
3699                                 split_map.m_len - ee_block);
3700                         err = ext4_ext_zeroout(inode, &zero_ex1);
3701                         if (err)
3702                                 goto out;
3703                         split_map.m_len = allocated;
3704                 }
3705                 if (split_map.m_lblk - ee_block + split_map.m_len <
3706                                                                 max_zeroout) {
3707                         /* case 2 or 5 */
3708                         if (split_map.m_lblk != ee_block) {
3709                                 zero_ex2.ee_block = ex->ee_block;
3710                                 zero_ex2.ee_len = cpu_to_le16(split_map.m_lblk -
3711                                                         ee_block);
3712                                 ext4_ext_store_pblock(&zero_ex2,
3713                                                       ext4_ext_pblock(ex));
3714                                 err = ext4_ext_zeroout(inode, &zero_ex2);
3715                                 if (err)
3716                                         goto out;
3717                         }
3718
3719                         split_map.m_len += split_map.m_lblk - ee_block;
3720                         split_map.m_lblk = ee_block;
3721                         allocated = map->m_len;
3722                 }
3723         }
3724
3725         err = ext4_split_extent(handle, inode, ppath, &split_map, split_flag,
3726                                 flags);
3727         if (err > 0)
3728                 err = 0;
3729 out:
3730         /* If we have gotten a failure, don't zero out status tree */
3731         if (!err) {
3732                 err = ext4_zeroout_es(inode, &zero_ex1);
3733                 if (!err)
3734                         err = ext4_zeroout_es(inode, &zero_ex2);
3735         }
3736         return err ? err : allocated;
3737 }
3738
3739 /*
3740  * This function is called by ext4_ext_map_blocks() from
3741  * ext4_get_blocks_dio_write() when DIO to write
3742  * to an unwritten extent.
3743  *
3744  * Writing to an unwritten extent may result in splitting the unwritten
3745  * extent into multiple initialized/unwritten extents (up to three)
3746  * There are three possibilities:
3747  *   a> There is no split required: Entire extent should be unwritten
3748  *   b> Splits in two extents: Write is happening at either end of the extent
3749  *   c> Splits in three extents: Somone is writing in middle of the extent
3750  *
3751  * This works the same way in the case of initialized -> unwritten conversion.
3752  *
3753  * One of more index blocks maybe needed if the extent tree grow after
3754  * the unwritten extent split. To prevent ENOSPC occur at the IO
3755  * complete, we need to split the unwritten extent before DIO submit
3756  * the IO. The unwritten extent called at this time will be split
3757  * into three unwritten extent(at most). After IO complete, the part
3758  * being filled will be convert to initialized by the end_io callback function
3759  * via ext4_convert_unwritten_extents().
3760  *
3761  * Returns the size of unwritten extent to be written on success.
3762  */
3763 static int ext4_split_convert_extents(handle_t *handle,
3764                                         struct inode *inode,
3765                                         struct ext4_map_blocks *map,
3766                                         struct ext4_ext_path **ppath,
3767                                         int flags)
3768 {
3769         struct ext4_ext_path *path = *ppath;
3770         ext4_lblk_t eof_block;
3771         ext4_lblk_t ee_block;
3772         struct ext4_extent *ex;
3773         unsigned int ee_len;
3774         int split_flag = 0, depth;
3775
3776         ext_debug("%s: inode %lu, logical block %llu, max_blocks %u\n",
3777                   __func__, inode->i_ino,
3778                   (unsigned long long)map->m_lblk, map->m_len);
3779
3780         eof_block = (inode->i_size + inode->i_sb->s_blocksize - 1) >>
3781                 inode->i_sb->s_blocksize_bits;
3782         if (eof_block < map->m_lblk + map->m_len)
3783                 eof_block = map->m_lblk + map->m_len;
3784         /*
3785          * It is safe to convert extent to initialized via explicit
3786          * zeroout only if extent is fully insde i_size or new_size.
3787          */
3788         depth = ext_depth(inode);
3789         ex = path[depth].p_ext;
3790         ee_block = le32_to_cpu(ex->ee_block);
3791         ee_len = ext4_ext_get_actual_len(ex);
3792
3793         /* Convert to unwritten */
3794         if (flags & EXT4_GET_BLOCKS_CONVERT_UNWRITTEN) {
3795                 split_flag |= EXT4_EXT_DATA_VALID1;
3796         /* Convert to initialized */
3797         } else if (flags & EXT4_GET_BLOCKS_CONVERT) {
3798                 split_flag |= ee_block + ee_len <= eof_block ?
3799                               EXT4_EXT_MAY_ZEROOUT : 0;
3800                 split_flag |= (EXT4_EXT_MARK_UNWRIT2 | EXT4_EXT_DATA_VALID2);
3801         }
3802         flags |= EXT4_GET_BLOCKS_PRE_IO;
3803         return ext4_split_extent(handle, inode, ppath, map, split_flag, flags);
3804 }
3805
3806 static int ext4_convert_unwritten_extents_endio(handle_t *handle,
3807                                                 struct inode *inode,
3808                                                 struct ext4_map_blocks *map,
3809                                                 struct ext4_ext_path **ppath)
3810 {
3811         struct ext4_ext_path *path = *ppath;
3812         struct ext4_extent *ex;
3813         ext4_lblk_t ee_block;
3814         unsigned int ee_len;
3815         int depth;
3816         int err = 0;
3817
3818         depth = ext_depth(inode);
3819         ex = path[depth].p_ext;
3820         ee_block = le32_to_cpu(ex->ee_block);
3821         ee_len = ext4_ext_get_actual_len(ex);
3822
3823         ext_debug("ext4_convert_unwritten_extents_endio: inode %lu, logical"
3824                 "block %llu, max_blocks %u\n", inode->i_ino,
3825                   (unsigned long long)ee_block, ee_len);
3826
3827         /* If extent is larger than requested it is a clear sign that we still
3828          * have some extent state machine issues left. So extent_split is still
3829          * required.
3830          * TODO: Once all related issues will be fixed this situation should be
3831          * illegal.
3832          */
3833         if (ee_block != map->m_lblk || ee_len > map->m_len) {
3834 #ifdef CONFIG_EXT4_DEBUG
3835                 ext4_warning(inode->i_sb, "Inode (%ld) finished: extent logical block %llu,"
3836                              " len %u; IO logical block %llu, len %u",
3837                              inode->i_ino, (unsigned long long)ee_block, ee_len,
3838                              (unsigned long long)map->m_lblk, map->m_len);
3839 #endif
3840                 err = ext4_split_convert_extents(handle, inode, map, ppath,
3841                                                  EXT4_GET_BLOCKS_CONVERT);
3842                 if (err < 0)
3843                         return err;
3844                 path = ext4_find_extent(inode, map->m_lblk, ppath, 0);
3845                 if (IS_ERR(path))
3846                         return PTR_ERR(path);
3847                 depth = ext_depth(inode);
3848                 ex = path[depth].p_ext;
3849         }
3850
3851         err = ext4_ext_get_access(handle, inode, path + depth);
3852         if (err)
3853                 goto out;
3854         /* first mark the extent as initialized */
3855         ext4_ext_mark_initialized(ex);
3856
3857         /* note: ext4_ext_correct_indexes() isn't needed here because
3858          * borders are not changed
3859          */
3860         ext4_ext_try_to_merge(handle, inode, path, ex);
3861
3862         /* Mark modified extent as dirty */
3863         err = ext4_ext_dirty(handle, inode, path + path->p_depth);
3864 out:
3865         ext4_ext_show_leaf(inode, path);
3866         return err;
3867 }
3868
3869 /*
3870  * Handle EOFBLOCKS_FL flag, clearing it if necessary
3871  */
3872 static int check_eofblocks_fl(handle_t *handle, struct inode *inode,
3873                               ext4_lblk_t lblk,
3874                               struct ext4_ext_path *path,
3875                               unsigned int len)
3876 {
3877         int i, depth;
3878         struct ext4_extent_header *eh;
3879         struct ext4_extent *last_ex;
3880
3881         if (!ext4_test_inode_flag(inode, EXT4_INODE_EOFBLOCKS))
3882                 return 0;
3883
3884         depth = ext_depth(inode);
3885         eh = path[depth].p_hdr;
3886
3887         /*
3888          * We're going to remove EOFBLOCKS_FL entirely in future so we
3889          * do not care for this case anymore. Simply remove the flag
3890          * if there are no extents.
3891          */
3892         if (unlikely(!eh->eh_entries))
3893                 goto out;
3894         last_ex = EXT_LAST_EXTENT(eh);
3895         /*
3896          * We should clear the EOFBLOCKS_FL flag if we are writing the
3897          * last block in the last extent in the file.  We test this by
3898          * first checking to see if the caller to
3899          * ext4_ext_get_blocks() was interested in the last block (or
3900          * a block beyond the last block) in the current extent.  If
3901          * this turns out to be false, we can bail out from this
3902          * function immediately.
3903          */
3904         if (lblk + len < le32_to_cpu(last_ex->ee_block) +
3905             ext4_ext_get_actual_len(last_ex))
3906                 return 0;
3907         /*
3908          * If the caller does appear to be planning to write at or
3909          * beyond the end of the current extent, we then test to see
3910          * if the current extent is the last extent in the file, by
3911          * checking to make sure it was reached via the rightmost node
3912          * at each level of the tree.
3913          */
3914         for (i = depth-1; i >= 0; i--)
3915                 if (path[i].p_idx != EXT_LAST_INDEX(path[i].p_hdr))
3916                         return 0;
3917 out:
3918         ext4_clear_inode_flag(inode, EXT4_INODE_EOFBLOCKS);
3919         return ext4_mark_inode_dirty(handle, inode);
3920 }
3921
3922 static int
3923 convert_initialized_extent(handle_t *handle, struct inode *inode,
3924                            struct ext4_map_blocks *map,
3925                            struct ext4_ext_path **ppath,
3926                            unsigned int allocated)
3927 {
3928         struct ext4_ext_path *path = *ppath;
3929         struct ext4_extent *ex;
3930         ext4_lblk_t ee_block;
3931         unsigned int ee_len;
3932         int depth;
3933         int err = 0;
3934
3935         /*
3936          * Make sure that the extent is no bigger than we support with
3937          * unwritten extent
3938          */
3939         if (map->m_len > EXT_UNWRITTEN_MAX_LEN)
3940                 map->m_len = EXT_UNWRITTEN_MAX_LEN / 2;
3941
3942         depth = ext_depth(inode);
3943         ex = path[depth].p_ext;
3944         ee_block = le32_to_cpu(ex->ee_block);
3945         ee_len = ext4_ext_get_actual_len(ex);
3946
3947         ext_debug("%s: inode %lu, logical"
3948                 "block %llu, max_blocks %u\n", __func__, inode->i_ino,
3949                   (unsigned long long)ee_block, ee_len);
3950
3951         if (ee_block != map->m_lblk || ee_len > map->m_len) {
3952                 err = ext4_split_convert_extents(handle, inode, map, ppath,
3953                                 EXT4_GET_BLOCKS_CONVERT_UNWRITTEN);
3954                 if (err < 0)
3955                         return err;
3956                 path = ext4_find_extent(inode, map->m_lblk, ppath, 0);
3957                 if (IS_ERR(path))
3958                         return PTR_ERR(path);
3959                 depth = ext_depth(inode);
3960                 ex = path[depth].p_ext;
3961                 if (!ex) {
3962                         EXT4_ERROR_INODE(inode, "unexpected hole at %lu",
3963                                          (unsigned long) map->m_lblk);
3964                         return -EFSCORRUPTED;
3965                 }
3966         }
3967
3968         err = ext4_ext_get_access(handle, inode, path + depth);
3969         if (err)
3970                 return err;
3971         /* first mark the extent as unwritten */
3972         ext4_ext_mark_unwritten(ex);
3973
3974         /* note: ext4_ext_correct_indexes() isn't needed here because
3975          * borders are not changed
3976          */
3977         ext4_ext_try_to_merge(handle, inode, path, ex);
3978
3979         /* Mark modified extent as dirty */
3980         err = ext4_ext_dirty(handle, inode, path + path->p_depth);
3981         if (err)
3982                 return err;
3983         ext4_ext_show_leaf(inode, path);
3984
3985         ext4_update_inode_fsync_trans(handle, inode, 1);
3986         err = check_eofblocks_fl(handle, inode, map->m_lblk, path, map->m_len);
3987         if (err)
3988                 return err;
3989         map->m_flags |= EXT4_MAP_UNWRITTEN;
3990         if (allocated > map->m_len)
3991                 allocated = map->m_len;
3992         map->m_len = allocated;
3993         return allocated;
3994 }
3995
3996 static int
3997 ext4_ext_handle_unwritten_extents(handle_t *handle, struct inode *inode,
3998                         struct ext4_map_blocks *map,
3999                         struct ext4_ext_path **ppath, int flags,
4000                         unsigned int allocated, ext4_fsblk_t newblock)
4001 {
4002         struct ext4_ext_path *path = *ppath;
4003         int ret = 0;
4004         int err = 0;
4005
4006         ext_debug("ext4_ext_handle_unwritten_extents: inode %lu, logical "
4007                   "block %llu, max_blocks %u, flags %x, allocated %u\n",
4008                   inode->i_ino, (unsigned long long)map->m_lblk, map->m_len,
4009                   flags, allocated);
4010         ext4_ext_show_leaf(inode, path);
4011
4012         /*
4013          * When writing into unwritten space, we should not fail to
4014          * allocate metadata blocks for the new extent block if needed.
4015          */
4016         flags |= EXT4_GET_BLOCKS_METADATA_NOFAIL;
4017
4018         trace_ext4_ext_handle_unwritten_extents(inode, map, flags,
4019                                                     allocated, newblock);
4020
4021         /* get_block() before submit the IO, split the extent */
4022         if (flags & EXT4_GET_BLOCKS_PRE_IO) {
4023                 ret = ext4_split_convert_extents(handle, inode, map, ppath,
4024                                          flags | EXT4_GET_BLOCKS_CONVERT);
4025                 if (ret <= 0)
4026                         goto out;
4027                 map->m_flags |= EXT4_MAP_UNWRITTEN;
4028                 goto out;
4029         }
4030         /* IO end_io complete, convert the filled extent to written */
4031         if (flags & EXT4_GET_BLOCKS_CONVERT) {
4032                 if (flags & EXT4_GET_BLOCKS_ZERO) {
4033                         if (allocated > map->m_len)
4034                                 allocated = map->m_len;
4035                         err = ext4_issue_zeroout(inode, map->m_lblk, newblock,
4036                                                  allocated);
4037                         if (err < 0)
4038                                 goto out2;
4039                 }
4040                 ret = ext4_convert_unwritten_extents_endio(handle, inode, map,
4041                                                            ppath);
4042                 if (ret >= 0) {
4043                         ext4_update_inode_fsync_trans(handle, inode, 1);
4044                         err = check_eofblocks_fl(handle, inode, map->m_lblk,
4045                                                  path, map->m_len);
4046                 } else
4047                         err = ret;
4048                 map->m_flags |= EXT4_MAP_MAPPED;
4049                 map->m_pblk = newblock;
4050                 if (allocated > map->m_len)
4051                         allocated = map->m_len;
4052                 map->m_len = allocated;
4053                 goto out2;
4054         }
4055         /* buffered IO case */
4056         /*
4057          * repeat fallocate creation request
4058          * we already have an unwritten extent
4059          */
4060         if (flags & EXT4_GET_BLOCKS_UNWRIT_EXT) {
4061                 map->m_flags |= EXT4_MAP_UNWRITTEN;
4062                 goto map_out;
4063         }
4064
4065         /* buffered READ or buffered write_begin() lookup */
4066         if ((flags & EXT4_GET_BLOCKS_CREATE) == 0) {
4067                 /*
4068                  * We have blocks reserved already.  We
4069                  * return allocated blocks so that delalloc
4070                  * won't do block reservation for us.  But
4071                  * the buffer head will be unmapped so that
4072                  * a read from the block returns 0s.
4073                  */
4074                 map->m_flags |= EXT4_MAP_UNWRITTEN;
4075                 goto out1;
4076         }
4077
4078         /* buffered write, writepage time, convert*/
4079         ret = ext4_ext_convert_to_initialized(handle, inode, map, ppath, flags);
4080         if (ret >= 0)
4081                 ext4_update_inode_fsync_trans(handle, inode, 1);
4082 out:
4083         if (ret <= 0) {
4084                 err = ret;
4085                 goto out2;
4086         } else
4087                 allocated = ret;
4088         map->m_flags |= EXT4_MAP_NEW;
4089         if (allocated > map->m_len)
4090                 allocated = map->m_len;
4091         map->m_len = allocated;
4092
4093 map_out:
4094         map->m_flags |= EXT4_MAP_MAPPED;
4095         if ((flags & EXT4_GET_BLOCKS_KEEP_SIZE) == 0) {
4096                 err = check_eofblocks_fl(handle, inode, map->m_lblk, path,
4097                                          map->m_len);
4098                 if (err < 0)
4099                         goto out2;
4100         }
4101 out1:
4102         if (allocated > map->m_len)
4103                 allocated = map->m_len;
4104         ext4_ext_show_leaf(inode, path);
4105         map->m_pblk = newblock;
4106         map->m_len = allocated;
4107 out2:
4108         return err ? err : allocated;
4109 }
4110
4111 /*
4112  * get_implied_cluster_alloc - check to see if the requested
4113  * allocation (in the map structure) overlaps with a cluster already
4114  * allocated in an extent.
4115  *      @sb     The filesystem superblock structure
4116  *      @map    The requested lblk->pblk mapping
4117  *      @ex     The extent structure which might contain an implied
4118  *                      cluster allocation
4119  *
4120  * This function is called by ext4_ext_map_blocks() after we failed to
4121  * find blocks that were already in the inode's extent tree.  Hence,
4122  * we know that the beginning of the requested region cannot overlap
4123  * the extent from the inode's extent tree.  There are three cases we
4124  * want to catch.  The first is this case:
4125  *
4126  *               |--- cluster # N--|
4127  *    |--- extent ---|  |---- requested region ---|
4128  *                      |==========|
4129  *
4130  * The second case that we need to test for is this one:
4131  *
4132  *   |--------- cluster # N ----------------|
4133  *         |--- requested region --|   |------- extent ----|
4134  *         |=======================|
4135  *
4136  * The third case is when the requested region lies between two extents
4137  * within the same cluster:
4138  *          |------------- cluster # N-------------|
4139  * |----- ex -----|                  |---- ex_right ----|
4140  *                  |------ requested region ------|
4141  *                  |================|
4142  *
4143  * In each of the above cases, we need to set the map->m_pblk and
4144  * map->m_len so it corresponds to the return the extent labelled as
4145  * "|====|" from cluster #N, since it is already in use for data in
4146  * cluster EXT4_B2C(sbi, map->m_lblk).  We will then return 1 to
4147  * signal to ext4_ext_map_blocks() that map->m_pblk should be treated
4148  * as a new "allocated" block region.  Otherwise, we will return 0 and
4149  * ext4_ext_map_blocks() will then allocate one or more new clusters
4150  * by calling ext4_mb_new_blocks().
4151  */
4152 static int get_implied_cluster_alloc(struct super_block *sb,
4153                                      struct ext4_map_blocks *map,
4154                                      struct ext4_extent *ex,
4155                                      struct ext4_ext_path *path)
4156 {
4157         struct ext4_sb_info *sbi = EXT4_SB(sb);
4158         ext4_lblk_t c_offset = EXT4_LBLK_COFF(sbi, map->m_lblk);
4159         ext4_lblk_t ex_cluster_start, ex_cluster_end;
4160         ext4_lblk_t rr_cluster_start;
4161         ext4_lblk_t ee_block = le32_to_cpu(ex->ee_block);
4162         ext4_fsblk_t ee_start = ext4_ext_pblock(ex);
4163         unsigned short ee_len = ext4_ext_get_actual_len(ex);
4164
4165         /* The extent passed in that we are trying to match */
4166         ex_cluster_start = EXT4_B2C(sbi, ee_block);
4167         ex_cluster_end = EXT4_B2C(sbi, ee_block + ee_len - 1);
4168
4169         /* The requested region passed into ext4_map_blocks() */
4170         rr_cluster_start = EXT4_B2C(sbi, map->m_lblk);
4171
4172         if ((rr_cluster_start == ex_cluster_end) ||
4173             (rr_cluster_start == ex_cluster_start)) {
4174                 if (rr_cluster_start == ex_cluster_end)
4175                         ee_start += ee_len - 1;
4176                 map->m_pblk = EXT4_PBLK_CMASK(sbi, ee_start) + c_offset;
4177                 map->m_len = min(map->m_len,
4178                                  (unsigned) sbi->s_cluster_ratio - c_offset);
4179                 /*
4180                  * Check for and handle this case:
4181                  *
4182                  *   |--------- cluster # N-------------|
4183                  *                     |------- extent ----|
4184                  *         |--- requested region ---|
4185                  *         |===========|
4186                  */
4187
4188                 if (map->m_lblk < ee_block)
4189                         map->m_len = min(map->m_len, ee_block - map->m_lblk);
4190
4191                 /*
4192                  * Check for the case where there is already another allocated
4193                  * block to the right of 'ex' but before the end of the cluster.
4194                  *
4195                  *          |------------- cluster # N-------------|
4196                  * |----- ex -----|                  |---- ex_right ----|
4197                  *                  |------ requested region ------|
4198                  *                  |================|
4199                  */
4200                 if (map->m_lblk > ee_block) {
4201                         ext4_lblk_t next = ext4_ext_next_allocated_block(path);
4202                         map->m_len = min(map->m_len, next - map->m_lblk);
4203                 }
4204
4205                 trace_ext4_get_implied_cluster_alloc_exit(sb, map, 1);
4206                 return 1;
4207         }
4208
4209         trace_ext4_get_implied_cluster_alloc_exit(sb, map, 0);
4210         return 0;
4211 }
4212
4213
4214 /*
4215  * Block allocation/map/preallocation routine for extents based files
4216  *
4217  *
4218  * Need to be called with
4219  * down_read(&EXT4_I(inode)->i_data_sem) if not allocating file system block
4220  * (ie, create is zero). Otherwise down_write(&EXT4_I(inode)->i_data_sem)
4221  *
4222  * return > 0, number of of blocks already mapped/allocated
4223  *          if create == 0 and these are pre-allocated blocks
4224  *              buffer head is unmapped
4225  *          otherwise blocks are mapped
4226  *
4227  * return = 0, if plain look up failed (blocks have not been allocated)
4228  *          buffer head is unmapped
4229  *
4230  * return < 0, error case.
4231  */
4232 int ext4_ext_map_blocks(handle_t *handle, struct inode *inode,
4233                         struct ext4_map_blocks *map, int flags)
4234 {
4235         struct ext4_ext_path *path = NULL;
4236         struct ext4_extent newex, *ex, *ex2;
4237         struct ext4_sb_info *sbi = EXT4_SB(inode->i_sb);
4238         ext4_fsblk_t newblock = 0;
4239         int free_on_err = 0, err = 0, depth, ret;
4240         unsigned int allocated = 0, offset = 0;
4241         unsigned int allocated_clusters = 0;
4242         struct ext4_allocation_request ar;
4243         ext4_lblk_t cluster_offset;
4244         bool map_from_cluster = false;
4245
4246         ext_debug("blocks %u/%u requested for inode %lu\n",
4247                   map->m_lblk, map->m_len, inode->i_ino);
4248         trace_ext4_ext_map_blocks_enter(inode, map->m_lblk, map->m_len, flags);
4249
4250         /* find extent for this block */
4251         path = ext4_find_extent(inode, map->m_lblk, NULL, 0);
4252         if (IS_ERR(path)) {
4253                 err = PTR_ERR(path);
4254                 path = NULL;
4255                 goto out2;
4256         }
4257
4258         depth = ext_depth(inode);
4259
4260         /*
4261          * consistent leaf must not be empty;
4262          * this situation is possible, though, _during_ tree modification;
4263          * this is why assert can't be put in ext4_find_extent()
4264          */
4265         if (unlikely(path[depth].p_ext == NULL && depth != 0)) {
4266                 EXT4_ERROR_INODE(inode, "bad extent address "
4267                                  "lblock: %lu, depth: %d pblock %lld",
4268                                  (unsigned long) map->m_lblk, depth,
4269                                  path[depth].p_block);
4270                 err = -EFSCORRUPTED;
4271                 goto out2;
4272         }
4273
4274         ex = path[depth].p_ext;
4275         if (ex) {
4276                 ext4_lblk_t ee_block = le32_to_cpu(ex->ee_block);
4277                 ext4_fsblk_t ee_start = ext4_ext_pblock(ex);
4278                 unsigned short ee_len;
4279
4280
4281                 /*
4282                  * unwritten extents are treated as holes, except that
4283                  * we split out initialized portions during a write.
4284                  */
4285                 ee_len = ext4_ext_get_actual_len(ex);
4286
4287                 trace_ext4_ext_show_extent(inode, ee_block, ee_start, ee_len);
4288
4289                 /* if found extent covers block, simply return it */
4290                 if (in_range(map->m_lblk, ee_block, ee_len)) {
4291                         newblock = map->m_lblk - ee_block + ee_start;
4292                         /* number of remaining blocks in the extent */
4293                         allocated = ee_len - (map->m_lblk - ee_block);
4294                         ext_debug("%u fit into %u:%d -> %llu\n", map->m_lblk,
4295                                   ee_block, ee_len, newblock);
4296
4297                         /*
4298                          * If the extent is initialized check whether the
4299                          * caller wants to convert it to unwritten.
4300                          */
4301                         if ((!ext4_ext_is_unwritten(ex)) &&
4302                             (flags & EXT4_GET_BLOCKS_CONVERT_UNWRITTEN)) {
4303                                 allocated = convert_initialized_extent(
4304                                                 handle, inode, map, &path,
4305                                                 allocated);
4306                                 goto out2;
4307                         } else if (!ext4_ext_is_unwritten(ex))
4308                                 goto out;
4309
4310                         ret = ext4_ext_handle_unwritten_extents(
4311                                 handle, inode, map, &path, flags,
4312                                 allocated, newblock);
4313                         if (ret < 0)
4314                                 err = ret;
4315                         else
4316                                 allocated = ret;
4317                         goto out2;
4318                 }
4319         }
4320
4321         /*
4322          * requested block isn't allocated yet;
4323          * we couldn't try to create block if create flag is zero
4324          */
4325         if ((flags & EXT4_GET_BLOCKS_CREATE) == 0) {
4326                 ext4_lblk_t hole_start, hole_len;
4327
4328                 hole_start = map->m_lblk;
4329                 hole_len = ext4_ext_determine_hole(inode, path, &hole_start);
4330                 /*
4331                  * put just found gap into cache to speed up
4332                  * subsequent requests
4333                  */
4334                 ext4_ext_put_gap_in_cache(inode, hole_start, hole_len);
4335
4336                 /* Update hole_len to reflect hole size after map->m_lblk */
4337                 if (hole_start != map->m_lblk)
4338                         hole_len -= map->m_lblk - hole_start;
4339                 map->m_pblk = 0;
4340                 map->m_len = min_t(unsigned int, map->m_len, hole_len);
4341
4342                 goto out2;
4343         }
4344
4345         /*
4346          * Okay, we need to do block allocation.
4347          */
4348         newex.ee_block = cpu_to_le32(map->m_lblk);
4349         cluster_offset = EXT4_LBLK_COFF(sbi, map->m_lblk);
4350
4351         /*
4352          * If we are doing bigalloc, check to see if the extent returned
4353          * by ext4_find_extent() implies a cluster we can use.
4354          */
4355         if (cluster_offset && ex &&
4356             get_implied_cluster_alloc(inode->i_sb, map, ex, path)) {
4357                 ar.len = allocated = map->m_len;
4358                 newblock = map->m_pblk;
4359                 map_from_cluster = true;
4360                 goto got_allocated_blocks;
4361         }
4362
4363         /* find neighbour allocated blocks */
4364         ar.lleft = map->m_lblk;
4365         err = ext4_ext_search_left(inode, path, &ar.lleft, &ar.pleft);
4366         if (err)
4367                 goto out2;
4368         ar.lright = map->m_lblk;
4369         ex2 = NULL;
4370         err = ext4_ext_search_right(inode, path, &ar.lright, &ar.pright, &ex2);
4371         if (err)
4372                 goto out2;
4373
4374         /* Check if the extent after searching to the right implies a
4375          * cluster we can use. */
4376         if ((sbi->s_cluster_ratio > 1) && ex2 &&
4377             get_implied_cluster_alloc(inode->i_sb, map, ex2, path)) {
4378                 ar.len = allocated = map->m_len;
4379                 newblock = map->m_pblk;
4380                 map_from_cluster = true;
4381                 goto got_allocated_blocks;
4382         }
4383
4384         /*
4385          * See if request is beyond maximum number of blocks we can have in
4386          * a single extent. For an initialized extent this limit is
4387          * EXT_INIT_MAX_LEN and for an unwritten extent this limit is
4388          * EXT_UNWRITTEN_MAX_LEN.
4389          */
4390         if (map->m_len > EXT_INIT_MAX_LEN &&
4391             !(flags & EXT4_GET_BLOCKS_UNWRIT_EXT))
4392                 map->m_len = EXT_INIT_MAX_LEN;
4393         else if (map->m_len > EXT_UNWRITTEN_MAX_LEN &&
4394                  (flags & EXT4_GET_BLOCKS_UNWRIT_EXT))
4395                 map->m_len = EXT_UNWRITTEN_MAX_LEN;
4396
4397         /* Check if we can really insert (m_lblk)::(m_lblk + m_len) extent */
4398         newex.ee_len = cpu_to_le16(map->m_len);
4399         err = ext4_ext_check_overlap(sbi, inode, &newex, path);
4400         if (err)
4401                 allocated = ext4_ext_get_actual_len(&newex);
4402         else
4403                 allocated = map->m_len;
4404
4405         /* allocate new block */
4406         ar.inode = inode;
4407         ar.goal = ext4_ext_find_goal(inode, path, map->m_lblk);
4408         ar.logical = map->m_lblk;
4409         /*
4410          * We calculate the offset from the beginning of the cluster
4411          * for the logical block number, since when we allocate a
4412          * physical cluster, the physical block should start at the
4413          * same offset from the beginning of the cluster.  This is
4414          * needed so that future calls to get_implied_cluster_alloc()
4415          * work correctly.
4416          */
4417         offset = EXT4_LBLK_COFF(sbi, map->m_lblk);
4418         ar.len = EXT4_NUM_B2C(sbi, offset+allocated);
4419         ar.goal -= offset;
4420         ar.logical -= offset;
4421         if (S_ISREG(inode->i_mode))
4422                 ar.flags = EXT4_MB_HINT_DATA;
4423         else
4424                 /* disable in-core preallocation for non-regular files */
4425                 ar.flags = 0;
4426         if (flags & EXT4_GET_BLOCKS_NO_NORMALIZE)
4427                 ar.flags |= EXT4_MB_HINT_NOPREALLOC;
4428         if (flags & EXT4_GET_BLOCKS_DELALLOC_RESERVE)
4429                 ar.flags |= EXT4_MB_DELALLOC_RESERVED;
4430         if (flags & EXT4_GET_BLOCKS_METADATA_NOFAIL)
4431                 ar.flags |= EXT4_MB_USE_RESERVED;
4432         newblock = ext4_mb_new_blocks(handle, &ar, &err);
4433         if (!newblock)
4434                 goto out2;
4435         ext_debug("allocate new block: goal %llu, found %llu/%u\n",
4436                   ar.goal, newblock, allocated);
4437         free_on_err = 1;
4438         allocated_clusters = ar.len;
4439         ar.len = EXT4_C2B(sbi, ar.len) - offset;
4440         if (ar.len > allocated)
4441                 ar.len = allocated;
4442
4443 got_allocated_blocks:
4444         /* try to insert new extent into found leaf and return */
4445         ext4_ext_store_pblock(&newex, newblock + offset);
4446         newex.ee_len = cpu_to_le16(ar.len);
4447         /* Mark unwritten */
4448         if (flags & EXT4_GET_BLOCKS_UNWRIT_EXT){
4449                 ext4_ext_mark_unwritten(&newex);
4450                 map->m_flags |= EXT4_MAP_UNWRITTEN;
4451         }
4452
4453         err = 0;
4454         if ((flags & EXT4_GET_BLOCKS_KEEP_SIZE) == 0)
4455                 err = check_eofblocks_fl(handle, inode, map->m_lblk,
4456                                          path, ar.len);
4457         if (!err)
4458                 err = ext4_ext_insert_extent(handle, inode, &path,
4459                                              &newex, flags);
4460
4461         if (err && free_on_err) {
4462                 int fb_flags = flags & EXT4_GET_BLOCKS_DELALLOC_RESERVE ?
4463                         EXT4_FREE_BLOCKS_NO_QUOT_UPDATE : 0;
4464                 /* free data blocks we just allocated */
4465                 /* not a good idea to call discard here directly,
4466                  * but otherwise we'd need to call it every free() */
4467                 ext4_discard_preallocations(inode);
4468                 ext4_free_blocks(handle, inode, NULL, newblock,
4469                                  EXT4_C2B(sbi, allocated_clusters), fb_flags);
4470                 goto out2;
4471         }
4472
4473         /* previous routine could use block we allocated */
4474         newblock = ext4_ext_pblock(&newex);
4475         allocated = ext4_ext_get_actual_len(&newex);
4476         if (allocated > map->m_len)
4477                 allocated = map->m_len;
4478         map->m_flags |= EXT4_MAP_NEW;
4479
4480         /*
4481          * Reduce the reserved cluster count to reflect successful deferred
4482          * allocation of delayed allocated clusters or direct allocation of
4483          * clusters discovered to be delayed allocated.  Once allocated, a
4484          * cluster is not included in the reserved count.
4485          */
4486         if (test_opt(inode->i_sb, DELALLOC) && !map_from_cluster) {
4487                 if (flags & EXT4_GET_BLOCKS_DELALLOC_RESERVE) {
4488                         /*
4489                          * When allocating delayed allocated clusters, simply
4490                          * reduce the reserved cluster count and claim quota
4491                          */
4492                         ext4_da_update_reserve_space(inode, allocated_clusters,
4493                                                         1);
4494                 } else {
4495                         ext4_lblk_t lblk, len;
4496                         unsigned int n;
4497
4498                         /*
4499                          * When allocating non-delayed allocated clusters
4500                          * (from fallocate, filemap, DIO, or clusters
4501                          * allocated when delalloc has been disabled by
4502                          * ext4_nonda_switch), reduce the reserved cluster
4503                          * count by the number of allocated clusters that
4504                          * have previously been delayed allocated.  Quota
4505                          * has been claimed by ext4_mb_new_blocks() above,
4506                          * so release the quota reservations made for any
4507                          * previously delayed allocated clusters.
4508                          */
4509                         lblk = EXT4_LBLK_CMASK(sbi, map->m_lblk);
4510                         len = allocated_clusters << sbi->s_cluster_bits;
4511                         n = ext4_es_delayed_clu(inode, lblk, len);
4512                         if (n > 0)
4513                                 ext4_da_update_reserve_space(inode, (int) n, 0);
4514                 }
4515         }
4516
4517         /*
4518          * Cache the extent and update transaction to commit on fdatasync only
4519          * when it is _not_ an unwritten extent.
4520          */
4521         if ((flags & EXT4_GET_BLOCKS_UNWRIT_EXT) == 0)
4522                 ext4_update_inode_fsync_trans(handle, inode, 1);
4523         else
4524                 ext4_update_inode_fsync_trans(handle, inode, 0);
4525 out:
4526         if (allocated > map->m_len)
4527                 allocated = map->m_len;
4528         ext4_ext_show_leaf(inode, path);
4529         map->m_flags |= EXT4_MAP_MAPPED;
4530         map->m_pblk = newblock;
4531         map->m_len = allocated;
4532 out2:
4533         ext4_ext_drop_refs(path);
4534         kfree(path);
4535
4536         trace_ext4_ext_map_blocks_exit(inode, flags, map,
4537                                        err ? err : allocated);
4538         return err ? err : allocated;
4539 }
4540
4541 int ext4_ext_truncate(handle_t *handle, struct inode *inode)
4542 {
4543         struct super_block *sb = inode->i_sb;
4544         ext4_lblk_t last_block;
4545         int err = 0;
4546
4547         /*
4548          * TODO: optimization is possible here.
4549          * Probably we need not scan at all,
4550          * because page truncation is enough.
4551          */
4552
4553         /* we have to know where to truncate from in crash case */
4554         EXT4_I(inode)->i_disksize = inode->i_size;
4555         err = ext4_mark_inode_dirty(handle, inode);
4556         if (err)
4557                 return err;
4558
4559         last_block = (inode->i_size + sb->s_blocksize - 1)
4560                         >> EXT4_BLOCK_SIZE_BITS(sb);
4561 retry:
4562         err = ext4_es_remove_extent(inode, last_block,
4563                                     EXT_MAX_BLOCKS - last_block);
4564         if (err == -ENOMEM) {
4565                 cond_resched();
4566                 congestion_wait(BLK_RW_ASYNC, HZ/50);
4567                 goto retry;
4568         }
4569         if (err)
4570                 return err;
4571         return ext4_ext_remove_space(inode, last_block, EXT_MAX_BLOCKS - 1);
4572 }
4573
4574 static int ext4_alloc_file_blocks(struct file *file, ext4_lblk_t offset,
4575                                   ext4_lblk_t len, loff_t new_size,
4576                                   int flags)
4577 {
4578         struct inode *inode = file_inode(file);
4579         handle_t *handle;
4580         int ret = 0;
4581         int ret2 = 0;
4582         int retries = 0;
4583         int depth = 0;
4584         struct ext4_map_blocks map;
4585         unsigned int credits;
4586         loff_t epos;
4587
4588         BUG_ON(!ext4_test_inode_flag(inode, EXT4_INODE_EXTENTS));
4589         map.m_lblk = offset;
4590         map.m_len = len;
4591         /*
4592          * Don't normalize the request if it can fit in one extent so
4593          * that it doesn't get unnecessarily split into multiple
4594          * extents.
4595          */
4596         if (len <= EXT_UNWRITTEN_MAX_LEN)
4597                 flags |= EXT4_GET_BLOCKS_NO_NORMALIZE;
4598
4599         /*
4600          * credits to insert 1 extent into extent tree
4601          */
4602         credits = ext4_chunk_trans_blocks(inode, len);
4603         depth = ext_depth(inode);
4604
4605 retry:
4606         while (ret >= 0 && len) {
4607                 /*
4608                  * Recalculate credits when extent tree depth changes.
4609                  */
4610                 if (depth != ext_depth(inode)) {
4611                         credits = ext4_chunk_trans_blocks(inode, len);
4612                         depth = ext_depth(inode);
4613                 }
4614
4615                 handle = ext4_journal_start(inode, EXT4_HT_MAP_BLOCKS,
4616                                             credits);
4617                 if (IS_ERR(handle)) {
4618                         ret = PTR_ERR(handle);
4619                         break;
4620                 }
4621                 ret = ext4_map_blocks(handle, inode, &map, flags);
4622                 if (ret <= 0) {
4623                         ext4_debug("inode #%lu: block %u: len %u: "
4624                                    "ext4_ext_map_blocks returned %d",
4625                                    inode->i_ino, map.m_lblk,
4626                                    map.m_len, ret);
4627                         ext4_mark_inode_dirty(handle, inode);
4628                         ret2 = ext4_journal_stop(handle);
4629                         break;
4630                 }
4631                 map.m_lblk += ret;
4632                 map.m_len = len = len - ret;
4633                 epos = (loff_t)map.m_lblk << inode->i_blkbits;
4634                 inode->i_ctime = current_time(inode);
4635                 if (new_size) {
4636                         if (epos > new_size)
4637                                 epos = new_size;
4638                         if (ext4_update_inode_size(inode, epos) & 0x1)
4639                                 inode->i_mtime = inode->i_ctime;
4640                 } else {
4641                         if (epos > inode->i_size)
4642                                 ext4_set_inode_flag(inode,
4643                                                     EXT4_INODE_EOFBLOCKS);
4644                 }
4645                 ext4_mark_inode_dirty(handle, inode);
4646                 ext4_update_inode_fsync_trans(handle, inode, 1);
4647                 ret2 = ext4_journal_stop(handle);
4648                 if (ret2)
4649                         break;
4650         }
4651         if (ret == -ENOSPC &&
4652                         ext4_should_retry_alloc(inode->i_sb, &retries)) {
4653                 ret = 0;
4654                 goto retry;
4655         }
4656
4657         return ret > 0 ? ret2 : ret;
4658 }
4659
4660 static int ext4_collapse_range(struct inode *inode, loff_t offset, loff_t len);
4661
4662 static int ext4_insert_range(struct inode *inode, loff_t offset, loff_t len);
4663
4664 static long ext4_zero_range(struct file *file, loff_t offset,
4665                             loff_t len, int mode)
4666 {
4667         struct inode *inode = file_inode(file);
4668         handle_t *handle = NULL;
4669         unsigned int max_blocks;
4670         loff_t new_size = 0;
4671         int ret = 0;
4672         int flags;
4673         int credits;
4674         int partial_begin, partial_end;
4675         loff_t start, end;
4676         ext4_lblk_t lblk;
4677         unsigned int blkbits = inode->i_blkbits;
4678
4679         trace_ext4_zero_range(inode, offset, len, mode);
4680
4681         /* Call ext4_force_commit to flush all data in case of data=journal. */
4682         if (ext4_should_journal_data(inode)) {
4683                 ret = ext4_force_commit(inode->i_sb);
4684                 if (ret)
4685                         return ret;
4686         }
4687
4688         /*
4689          * Round up offset. This is not fallocate, we neet to zero out
4690          * blocks, so convert interior block aligned part of the range to
4691          * unwritten and possibly manually zero out unaligned parts of the
4692          * range.
4693          */
4694         start = round_up(offset, 1 << blkbits);
4695         end = round_down((offset + len), 1 << blkbits);
4696
4697         if (start < offset || end > offset + len)
4698                 return -EINVAL;
4699         partial_begin = offset & ((1 << blkbits) - 1);
4700         partial_end = (offset + len) & ((1 << blkbits) - 1);
4701
4702         lblk = start >> blkbits;
4703         max_blocks = (end >> blkbits);
4704         if (max_blocks < lblk)
4705                 max_blocks = 0;
4706         else
4707                 max_blocks -= lblk;
4708
4709         inode_lock(inode);
4710
4711         /*
4712          * Indirect files do not support unwritten extnets
4713          */
4714         if (!(ext4_test_inode_flag(inode, EXT4_INODE_EXTENTS))) {
4715                 ret = -EOPNOTSUPP;
4716                 goto out_mutex;
4717         }
4718
4719         if (!(mode & FALLOC_FL_KEEP_SIZE) &&
4720             (offset + len > inode->i_size ||
4721              offset + len > EXT4_I(inode)->i_disksize)) {
4722                 new_size = offset + len;
4723                 ret = inode_newsize_ok(inode, new_size);
4724                 if (ret)
4725                         goto out_mutex;
4726         }
4727
4728         flags = EXT4_GET_BLOCKS_CREATE_UNWRIT_EXT;
4729         if (mode & FALLOC_FL_KEEP_SIZE)
4730                 flags |= EXT4_GET_BLOCKS_KEEP_SIZE;
4731
4732         /* Wait all existing dio workers, newcomers will block on i_mutex */
4733         inode_dio_wait(inode);
4734
4735         /* Preallocate the range including the unaligned edges */
4736         if (partial_begin || partial_end) {
4737                 ret = ext4_alloc_file_blocks(file,
4738                                 round_down(offset, 1 << blkbits) >> blkbits,
4739                                 (round_up((offset + len), 1 << blkbits) -
4740                                  round_down(offset, 1 << blkbits)) >> blkbits,
4741                                 new_size, flags);
4742                 if (ret)
4743                         goto out_mutex;
4744
4745         }
4746
4747         /* Zero range excluding the unaligned edges */
4748         if (max_blocks > 0) {
4749                 flags |= (EXT4_GET_BLOCKS_CONVERT_UNWRITTEN |
4750                           EXT4_EX_NOCACHE);
4751
4752                 /*
4753                  * Prevent page faults from reinstantiating pages we have
4754                  * released from page cache.
4755                  */
4756                 down_write(&EXT4_I(inode)->i_mmap_sem);
4757
4758                 ret = ext4_break_layouts(inode);
4759                 if (ret) {
4760                         up_write(&EXT4_I(inode)->i_mmap_sem);
4761                         goto out_mutex;
4762                 }
4763
4764                 ret = ext4_update_disksize_before_punch(inode, offset, len);
4765                 if (ret) {
4766                         up_write(&EXT4_I(inode)->i_mmap_sem);
4767                         goto out_mutex;
4768                 }
4769                 /* Now release the pages and zero block aligned part of pages */
4770                 truncate_pagecache_range(inode, start, end - 1);
4771                 inode->i_mtime = inode->i_ctime = current_time(inode);
4772
4773                 ret = ext4_alloc_file_blocks(file, lblk, max_blocks, new_size,
4774                                              flags);
4775                 up_write(&EXT4_I(inode)->i_mmap_sem);
4776                 if (ret)
4777                         goto out_mutex;
4778         }
4779         if (!partial_begin && !partial_end)
4780                 goto out_mutex;
4781
4782         /*
4783          * In worst case we have to writeout two nonadjacent unwritten
4784          * blocks and update the inode
4785          */
4786         credits = (2 * ext4_ext_index_trans_blocks(inode, 2)) + 1;
4787         if (ext4_should_journal_data(inode))
4788                 credits += 2;
4789         handle = ext4_journal_start(inode, EXT4_HT_MISC, credits);
4790         if (IS_ERR(handle)) {
4791                 ret = PTR_ERR(handle);
4792                 ext4_std_error(inode->i_sb, ret);
4793                 goto out_mutex;
4794         }
4795
4796         inode->i_mtime = inode->i_ctime = current_time(inode);
4797         if (new_size) {
4798                 ext4_update_inode_size(inode, new_size);
4799         } else {
4800                 /*
4801                 * Mark that we allocate beyond EOF so the subsequent truncate
4802                 * can proceed even if the new size is the same as i_size.
4803                 */
4804                 if (offset + len > inode->i_size)
4805                         ext4_set_inode_flag(inode, EXT4_INODE_EOFBLOCKS);
4806         }
4807         ext4_mark_inode_dirty(handle, inode);
4808
4809         /* Zero out partial block at the edges of the range */
4810         ret = ext4_zero_partial_blocks(handle, inode, offset, len);
4811         if (ret >= 0)
4812                 ext4_update_inode_fsync_trans(handle, inode, 1);
4813
4814         if (file->f_flags & O_SYNC)
4815                 ext4_handle_sync(handle);
4816
4817         ext4_journal_stop(handle);
4818 out_mutex:
4819         inode_unlock(inode);
4820         return ret;
4821 }
4822
4823 /*
4824  * preallocate space for a file. This implements ext4's fallocate file
4825  * operation, which gets called from sys_fallocate system call.
4826  * For block-mapped files, posix_fallocate should fall back to the method
4827  * of writing zeroes to the required new blocks (the same behavior which is
4828  * expected for file systems which do not support fallocate() system call).
4829  */
4830 long ext4_fallocate(struct file *file, int mode, loff_t offset, loff_t len)
4831 {
4832         struct inode *inode = file_inode(file);
4833         loff_t new_size = 0;
4834         unsigned int max_blocks;
4835         int ret = 0;
4836         int flags;
4837         ext4_lblk_t lblk;
4838         unsigned int blkbits = inode->i_blkbits;
4839
4840         /*
4841          * Encrypted inodes can't handle collapse range or insert
4842          * range since we would need to re-encrypt blocks with a
4843          * different IV or XTS tweak (which are based on the logical
4844          * block number).
4845          */
4846         if (IS_ENCRYPTED(inode) &&
4847             (mode & (FALLOC_FL_COLLAPSE_RANGE | FALLOC_FL_INSERT_RANGE)))
4848                 return -EOPNOTSUPP;
4849
4850         /* Return error if mode is not supported */
4851         if (mode & ~(FALLOC_FL_KEEP_SIZE | FALLOC_FL_PUNCH_HOLE |
4852                      FALLOC_FL_COLLAPSE_RANGE | FALLOC_FL_ZERO_RANGE |
4853                      FALLOC_FL_INSERT_RANGE))
4854                 return -EOPNOTSUPP;
4855
4856         if (mode & FALLOC_FL_PUNCH_HOLE)
4857                 return ext4_punch_hole(inode, offset, len);
4858
4859         ret = ext4_convert_inline_data(inode);
4860         if (ret)
4861                 return ret;
4862
4863         if (mode & FALLOC_FL_COLLAPSE_RANGE)
4864                 return ext4_collapse_range(inode, offset, len);
4865
4866         if (mode & FALLOC_FL_INSERT_RANGE)
4867                 return ext4_insert_range(inode, offset, len);
4868
4869         if (mode & FALLOC_FL_ZERO_RANGE)
4870                 return ext4_zero_range(file, offset, len, mode);
4871
4872         trace_ext4_fallocate_enter(inode, offset, len, mode);
4873         lblk = offset >> blkbits;
4874
4875         max_blocks = EXT4_MAX_BLOCKS(len, offset, blkbits);
4876         flags = EXT4_GET_BLOCKS_CREATE_UNWRIT_EXT;
4877         if (mode & FALLOC_FL_KEEP_SIZE)
4878                 flags |= EXT4_GET_BLOCKS_KEEP_SIZE;
4879
4880         inode_lock(inode);
4881
4882         /*
4883          * We only support preallocation for extent-based files only
4884          */
4885         if (!(ext4_test_inode_flag(inode, EXT4_INODE_EXTENTS))) {
4886                 ret = -EOPNOTSUPP;
4887                 goto out;
4888         }
4889
4890         if (!(mode & FALLOC_FL_KEEP_SIZE) &&
4891             (offset + len > inode->i_size ||
4892              offset + len > EXT4_I(inode)->i_disksize)) {
4893                 new_size = offset + len;
4894                 ret = inode_newsize_ok(inode, new_size);
4895                 if (ret)
4896                         goto out;
4897         }
4898
4899         /* Wait all existing dio workers, newcomers will block on i_mutex */
4900         inode_dio_wait(inode);
4901
4902         ret = ext4_alloc_file_blocks(file, lblk, max_blocks, new_size, flags);
4903         if (ret)
4904                 goto out;
4905
4906         if (file->f_flags & O_SYNC && EXT4_SB(inode->i_sb)->s_journal) {
4907                 ret = jbd2_complete_transaction(EXT4_SB(inode->i_sb)->s_journal,
4908                                                 EXT4_I(inode)->i_sync_tid);
4909         }
4910 out:
4911         inode_unlock(inode);
4912         trace_ext4_fallocate_exit(inode, offset, max_blocks, ret);
4913         return ret;
4914 }
4915
4916 /*
4917  * This function convert a range of blocks to written extents
4918  * The caller of this function will pass the start offset and the size.
4919  * all unwritten extents within this range will be converted to
4920  * written extents.
4921  *
4922  * This function is called from the direct IO end io call back
4923  * function, to convert the fallocated extents after IO is completed.
4924  * Returns 0 on success.
4925  */
4926 int ext4_convert_unwritten_extents(handle_t *handle, struct inode *inode,
4927                                    loff_t offset, ssize_t len)
4928 {
4929         unsigned int max_blocks;
4930         int ret = 0;
4931         int ret2 = 0;
4932         struct ext4_map_blocks map;
4933         unsigned int blkbits = inode->i_blkbits;
4934         unsigned int credits = 0;
4935
4936         map.m_lblk = offset >> blkbits;
4937         max_blocks = EXT4_MAX_BLOCKS(len, offset, blkbits);
4938
4939         if (!handle) {
4940                 /*
4941                  * credits to insert 1 extent into extent tree
4942                  */
4943                 credits = ext4_chunk_trans_blocks(inode, max_blocks);
4944         }
4945         while (ret >= 0 && ret < max_blocks) {
4946                 map.m_lblk += ret;
4947                 map.m_len = (max_blocks -= ret);
4948                 if (credits) {
4949                         handle = ext4_journal_start(inode, EXT4_HT_MAP_BLOCKS,
4950                                                     credits);
4951                         if (IS_ERR(handle)) {
4952                                 ret = PTR_ERR(handle);
4953                                 break;
4954                         }
4955                 }
4956                 ret = ext4_map_blocks(handle, inode, &map,
4957                                       EXT4_GET_BLOCKS_IO_CONVERT_EXT);
4958                 if (ret <= 0)
4959                         ext4_warning(inode->i_sb,
4960                                      "inode #%lu: block %u: len %u: "
4961                                      "ext4_ext_map_blocks returned %d",
4962                                      inode->i_ino, map.m_lblk,
4963                                      map.m_len, ret);
4964                 ext4_mark_inode_dirty(handle, inode);
4965                 if (credits)
4966                         ret2 = ext4_journal_stop(handle);
4967                 if (ret <= 0 || ret2)
4968                         break;
4969         }
4970         return ret > 0 ? ret2 : ret;
4971 }
4972
4973 int ext4_convert_unwritten_io_end_vec(handle_t *handle, ext4_io_end_t *io_end)
4974 {
4975         int ret, err = 0;
4976         struct ext4_io_end_vec *io_end_vec;
4977
4978         /*
4979          * This is somewhat ugly but the idea is clear: When transaction is
4980          * reserved, everything goes into it. Otherwise we rather start several
4981          * smaller transactions for conversion of each extent separately.
4982          */
4983         if (handle) {
4984                 handle = ext4_journal_start_reserved(handle,
4985                                                      EXT4_HT_EXT_CONVERT);
4986                 if (IS_ERR(handle))
4987                         return PTR_ERR(handle);
4988         }
4989
4990         list_for_each_entry(io_end_vec, &io_end->list_vec, list) {
4991                 ret = ext4_convert_unwritten_extents(handle, io_end->inode,
4992                                                      io_end_vec->offset,
4993                                                      io_end_vec->size);
4994                 if (ret)
4995                         break;
4996         }
4997
4998         if (handle)
4999                 err = ext4_journal_stop(handle);
5000
5001         return ret < 0 ? ret : err;
5002 }
5003
5004 /*
5005  * If newes is not existing extent (newes->ec_pblk equals zero) find
5006  * delayed extent at start of newes and update newes accordingly and
5007  * return start of the next delayed extent.
5008  *
5009  * If newes is existing extent (newes->ec_pblk is not equal zero)
5010  * return start of next delayed extent or EXT_MAX_BLOCKS if no delayed
5011  * extent found. Leave newes unmodified.
5012  */
5013 static int ext4_find_delayed_extent(struct inode *inode,
5014                                     struct extent_status *newes)
5015 {
5016         struct extent_status es;
5017         ext4_lblk_t block, next_del;
5018
5019         if (newes->es_pblk == 0) {
5020                 ext4_es_find_extent_range(inode, &ext4_es_is_delayed,
5021                                           newes->es_lblk,
5022                                           newes->es_lblk + newes->es_len - 1,
5023                                           &es);
5024
5025                 /*
5026                  * No extent in extent-tree contains block @newes->es_pblk,
5027                  * then the block may stay in 1)a hole or 2)delayed-extent.
5028                  */
5029                 if (es.es_len == 0)
5030                         /* A hole found. */
5031                         return 0;
5032
5033                 if (es.es_lblk > newes->es_lblk) {
5034                         /* A hole found. */
5035                         newes->es_len = min(es.es_lblk - newes->es_lblk,
5036                                             newes->es_len);
5037                         return 0;
5038                 }
5039
5040                 newes->es_len = es.es_lblk + es.es_len - newes->es_lblk;
5041         }
5042
5043         block = newes->es_lblk + newes->es_len;
5044         ext4_es_find_extent_range(inode, &ext4_es_is_delayed, block,
5045                                   EXT_MAX_BLOCKS, &es);
5046         if (es.es_len == 0)
5047                 next_del = EXT_MAX_BLOCKS;
5048         else
5049                 next_del = es.es_lblk;
5050
5051         return next_del;
5052 }
5053
5054 static int ext4_xattr_fiemap(struct inode *inode,
5055                                 struct fiemap_extent_info *fieinfo)
5056 {
5057         __u64 physical = 0;
5058         __u64 length;
5059         __u32 flags = FIEMAP_EXTENT_LAST;
5060         int blockbits = inode->i_sb->s_blocksize_bits;
5061         int error = 0;
5062
5063         /* in-inode? */
5064         if (ext4_test_inode_state(inode, EXT4_STATE_XATTR)) {
5065                 struct ext4_iloc iloc;
5066                 int offset;     /* offset of xattr in inode */
5067
5068                 error = ext4_get_inode_loc(inode, &iloc);
5069                 if (error)
5070                         return error;
5071                 physical = (__u64)iloc.bh->b_blocknr << blockbits;
5072                 offset = EXT4_GOOD_OLD_INODE_SIZE +
5073                                 EXT4_I(inode)->i_extra_isize;
5074                 physical += offset;
5075                 length = EXT4_SB(inode->i_sb)->s_inode_size - offset;
5076                 flags |= FIEMAP_EXTENT_DATA_INLINE;
5077                 brelse(iloc.bh);
5078         } else { /* external block */
5079                 physical = (__u64)EXT4_I(inode)->i_file_acl << blockbits;
5080                 length = inode->i_sb->s_blocksize;
5081         }
5082
5083         if (physical)
5084                 error = fiemap_fill_next_extent(fieinfo, 0, physical,
5085                                                 length, flags);
5086         return (error < 0 ? error : 0);
5087 }
5088
5089 static int _ext4_fiemap(struct inode *inode,
5090                         struct fiemap_extent_info *fieinfo,
5091                         __u64 start, __u64 len,
5092                         int (*fill)(struct inode *, ext4_lblk_t,
5093                                     ext4_lblk_t,
5094                                     struct fiemap_extent_info *))
5095 {
5096         ext4_lblk_t start_blk;
5097         u32 ext4_fiemap_flags = FIEMAP_FLAG_SYNC|FIEMAP_FLAG_XATTR;
5098
5099         int error = 0;
5100
5101         if (ext4_has_inline_data(inode)) {
5102                 int has_inline = 1;
5103
5104                 error = ext4_inline_data_fiemap(inode, fieinfo, &has_inline,
5105                                                 start, len);
5106
5107                 if (has_inline)
5108                         return error;
5109         }
5110
5111         if (fieinfo->fi_flags & FIEMAP_FLAG_CACHE) {
5112                 error = ext4_ext_precache(inode);
5113                 if (error)
5114                         return error;
5115                 fieinfo->fi_flags &= ~FIEMAP_FLAG_CACHE;
5116         }
5117
5118         /* fallback to generic here if not in extents fmt */
5119         if (!(ext4_test_inode_flag(inode, EXT4_INODE_EXTENTS)) &&
5120             fill == ext4_fill_fiemap_extents)
5121                 return generic_block_fiemap(inode, fieinfo, start, len,
5122                         ext4_get_block);
5123
5124         if (fill == ext4_fill_es_cache_info)
5125                 ext4_fiemap_flags &= FIEMAP_FLAG_XATTR;
5126         if (fiemap_check_flags(fieinfo, ext4_fiemap_flags))
5127                 return -EBADR;
5128
5129         if (fieinfo->fi_flags & FIEMAP_FLAG_XATTR) {
5130                 error = ext4_xattr_fiemap(inode, fieinfo);
5131         } else {
5132                 ext4_lblk_t len_blks;
5133                 __u64 last_blk;
5134
5135                 start_blk = start >> inode->i_sb->s_blocksize_bits;
5136                 last_blk = (start + len - 1) >> inode->i_sb->s_blocksize_bits;
5137                 if (last_blk >= EXT_MAX_BLOCKS)
5138                         last_blk = EXT_MAX_BLOCKS-1;
5139                 len_blks = ((ext4_lblk_t) last_blk) - start_blk + 1;
5140
5141                 /*
5142                  * Walk the extent tree gathering extent information
5143                  * and pushing extents back to the user.
5144                  */
5145                 error = fill(inode, start_blk, len_blks, fieinfo);
5146         }
5147         return error;
5148 }
5149
5150 int ext4_fiemap(struct inode *inode, struct fiemap_extent_info *fieinfo,
5151                 __u64 start, __u64 len)
5152 {
5153         return _ext4_fiemap(inode, fieinfo, start, len,
5154                             ext4_fill_fiemap_extents);
5155 }
5156
5157 int ext4_get_es_cache(struct inode *inode, struct fiemap_extent_info *fieinfo,
5158                       __u64 start, __u64 len)
5159 {
5160         if (ext4_has_inline_data(inode)) {
5161                 int has_inline;
5162
5163                 down_read(&EXT4_I(inode)->xattr_sem);
5164                 has_inline = ext4_has_inline_data(inode);
5165                 up_read(&EXT4_I(inode)->xattr_sem);
5166                 if (has_inline)
5167                         return 0;
5168         }
5169
5170         return _ext4_fiemap(inode, fieinfo, start, len,
5171                             ext4_fill_es_cache_info);
5172 }
5173
5174
5175 /*
5176  * ext4_access_path:
5177  * Function to access the path buffer for marking it dirty.
5178  * It also checks if there are sufficient credits left in the journal handle
5179  * to update path.
5180  */
5181 static int
5182 ext4_access_path(handle_t *handle, struct inode *inode,
5183                 struct ext4_ext_path *path)
5184 {
5185         int credits, err;
5186
5187         if (!ext4_handle_valid(handle))
5188                 return 0;
5189
5190         /*
5191          * Check if need to extend journal credits
5192          * 3 for leaf, sb, and inode plus 2 (bmap and group
5193          * descriptor) for each block group; assume two block
5194          * groups
5195          */
5196         credits = ext4_writepage_trans_blocks(inode);
5197         err = ext4_datasem_ensure_credits(handle, inode, 7, credits, 0);
5198         if (err < 0)
5199                 return err;
5200
5201         err = ext4_ext_get_access(handle, inode, path);
5202         return err;
5203 }
5204
5205 /*
5206  * ext4_ext_shift_path_extents:
5207  * Shift the extents of a path structure lying between path[depth].p_ext
5208  * and EXT_LAST_EXTENT(path[depth].p_hdr), by @shift blocks. @SHIFT tells
5209  * if it is right shift or left shift operation.
5210  */
5211 static int
5212 ext4_ext_shift_path_extents(struct ext4_ext_path *path, ext4_lblk_t shift,
5213                             struct inode *inode, handle_t *handle,
5214                             enum SHIFT_DIRECTION SHIFT)
5215 {
5216         int depth, err = 0;
5217         struct ext4_extent *ex_start, *ex_last;
5218         bool update = false;
5219         depth = path->p_depth;
5220
5221         while (depth >= 0) {
5222                 if (depth == path->p_depth) {
5223                         ex_start = path[depth].p_ext;
5224                         if (!ex_start)
5225                                 return -EFSCORRUPTED;
5226
5227                         ex_last = EXT_LAST_EXTENT(path[depth].p_hdr);
5228
5229                         err = ext4_access_path(handle, inode, path + depth);
5230                         if (err)
5231                                 goto out;
5232
5233                         if (ex_start == EXT_FIRST_EXTENT(path[depth].p_hdr))
5234                                 update = true;
5235
5236                         while (ex_start <= ex_last) {
5237                                 if (SHIFT == SHIFT_LEFT) {
5238                                         le32_add_cpu(&ex_start->ee_block,
5239                                                 -shift);
5240                                         /* Try to merge to the left. */
5241                                         if ((ex_start >
5242                                             EXT_FIRST_EXTENT(path[depth].p_hdr))
5243                                             &&
5244                                             ext4_ext_try_to_merge_right(inode,
5245                                             path, ex_start - 1))
5246                                                 ex_last--;
5247                                         else
5248                                                 ex_start++;
5249                                 } else {
5250                                         le32_add_cpu(&ex_last->ee_block, shift);
5251                                         ext4_ext_try_to_merge_right(inode, path,
5252                                                 ex_last);
5253                                         ex_last--;
5254                                 }
5255                         }
5256                         err = ext4_ext_dirty(handle, inode, path + depth);
5257                         if (err)
5258                                 goto out;
5259
5260                         if (--depth < 0 || !update)
5261                                 break;
5262                 }
5263
5264                 /* Update index too */
5265                 err = ext4_access_path(handle, inode, path + depth);
5266                 if (err)
5267                         goto out;
5268
5269                 if (SHIFT == SHIFT_LEFT)
5270                         le32_add_cpu(&path[depth].p_idx->ei_block, -shift);
5271                 else
5272                         le32_add_cpu(&path[depth].p_idx->ei_block, shift);
5273                 err = ext4_ext_dirty(handle, inode, path + depth);
5274                 if (err)
5275                         goto out;
5276
5277                 /* we are done if current index is not a starting index */
5278                 if (path[depth].p_idx != EXT_FIRST_INDEX(path[depth].p_hdr))
5279                         break;
5280
5281                 depth--;
5282         }
5283
5284 out:
5285         return err;
5286 }
5287
5288 /*
5289  * ext4_ext_shift_extents:
5290  * All the extents which lies in the range from @start to the last allocated
5291  * block for the @inode are shifted either towards left or right (depending
5292  * upon @SHIFT) by @shift blocks.
5293  * On success, 0 is returned, error otherwise.
5294  */
5295 static int
5296 ext4_ext_shift_extents(struct inode *inode, handle_t *handle,
5297                        ext4_lblk_t start, ext4_lblk_t shift,
5298                        enum SHIFT_DIRECTION SHIFT)
5299 {
5300         struct ext4_ext_path *path;
5301         int ret = 0, depth;
5302         struct ext4_extent *extent;
5303         ext4_lblk_t stop, *iterator, ex_start, ex_end;
5304
5305         /* Let path point to the last extent */
5306         path = ext4_find_extent(inode, EXT_MAX_BLOCKS - 1, NULL,
5307                                 EXT4_EX_NOCACHE);
5308         if (IS_ERR(path))
5309                 return PTR_ERR(path);
5310
5311         depth = path->p_depth;
5312         extent = path[depth].p_ext;
5313         if (!extent)
5314                 goto out;
5315
5316         stop = le32_to_cpu(extent->ee_block);
5317
5318        /*
5319         * For left shifts, make sure the hole on the left is big enough to
5320         * accommodate the shift.  For right shifts, make sure the last extent
5321         * won't be shifted beyond EXT_MAX_BLOCKS.
5322         */
5323         if (SHIFT == SHIFT_LEFT) {
5324                 path = ext4_find_extent(inode, start - 1, &path,
5325                                         EXT4_EX_NOCACHE);
5326                 if (IS_ERR(path))
5327                         return PTR_ERR(path);
5328                 depth = path->p_depth;
5329                 extent =  path[depth].p_ext;
5330                 if (extent) {
5331                         ex_start = le32_to_cpu(extent->ee_block);
5332                         ex_end = le32_to_cpu(extent->ee_block) +
5333                                 ext4_ext_get_actual_len(extent);
5334                 } else {
5335                         ex_start = 0;
5336                         ex_end = 0;
5337                 }
5338
5339                 if ((start == ex_start && shift > ex_start) ||
5340                     (shift > start - ex_end)) {
5341                         ret = -EINVAL;
5342                         goto out;
5343                 }
5344         } else {
5345                 if (shift > EXT_MAX_BLOCKS -
5346                     (stop + ext4_ext_get_actual_len(extent))) {
5347                         ret = -EINVAL;
5348                         goto out;
5349                 }
5350         }
5351
5352         /*
5353          * In case of left shift, iterator points to start and it is increased
5354          * till we reach stop. In case of right shift, iterator points to stop
5355          * and it is decreased till we reach start.
5356          */
5357         if (SHIFT == SHIFT_LEFT)
5358                 iterator = &start;
5359         else
5360                 iterator = &stop;
5361
5362         /*
5363          * Its safe to start updating extents.  Start and stop are unsigned, so
5364          * in case of right shift if extent with 0 block is reached, iterator
5365          * becomes NULL to indicate the end of the loop.
5366          */
5367         while (iterator && start <= stop) {
5368                 path = ext4_find_extent(inode, *iterator, &path,
5369                                         EXT4_EX_NOCACHE);
5370                 if (IS_ERR(path))
5371                         return PTR_ERR(path);
5372                 depth = path->p_depth;
5373                 extent = path[depth].p_ext;
5374                 if (!extent) {
5375                         EXT4_ERROR_INODE(inode, "unexpected hole at %lu",
5376                                          (unsigned long) *iterator);
5377                         return -EFSCORRUPTED;
5378                 }
5379                 if (SHIFT == SHIFT_LEFT && *iterator >
5380                     le32_to_cpu(extent->ee_block)) {
5381                         /* Hole, move to the next extent */
5382                         if (extent < EXT_LAST_EXTENT(path[depth].p_hdr)) {
5383                                 path[depth].p_ext++;
5384                         } else {
5385                                 *iterator = ext4_ext_next_allocated_block(path);
5386                                 continue;
5387                         }
5388                 }
5389
5390                 if (SHIFT == SHIFT_LEFT) {
5391                         extent = EXT_LAST_EXTENT(path[depth].p_hdr);
5392                         *iterator = le32_to_cpu(extent->ee_block) +
5393                                         ext4_ext_get_actual_len(extent);
5394                 } else {
5395                         extent = EXT_FIRST_EXTENT(path[depth].p_hdr);
5396                         if (le32_to_cpu(extent->ee_block) > 0)
5397                                 *iterator = le32_to_cpu(extent->ee_block) - 1;
5398                         else
5399                                 /* Beginning is reached, end of the loop */
5400                                 iterator = NULL;
5401                         /* Update path extent in case we need to stop */
5402                         while (le32_to_cpu(extent->ee_block) < start)
5403                                 extent++;
5404                         path[depth].p_ext = extent;
5405                 }
5406                 ret = ext4_ext_shift_path_extents(path, shift, inode,
5407                                 handle, SHIFT);
5408                 if (ret)
5409                         break;
5410         }
5411 out:
5412         ext4_ext_drop_refs(path);
5413         kfree(path);
5414         return ret;
5415 }
5416
5417 /*
5418  * ext4_collapse_range:
5419  * This implements the fallocate's collapse range functionality for ext4
5420  * Returns: 0 and non-zero on error.
5421  */
5422 static int ext4_collapse_range(struct inode *inode, loff_t offset, loff_t len)
5423 {
5424         struct super_block *sb = inode->i_sb;
5425         ext4_lblk_t punch_start, punch_stop;
5426         handle_t *handle;
5427         unsigned int credits;
5428         loff_t new_size, ioffset;
5429         int ret;
5430
5431         /*
5432          * We need to test this early because xfstests assumes that a
5433          * collapse range of (0, 1) will return EOPNOTSUPP if the file
5434          * system does not support collapse range.
5435          */
5436         if (!ext4_test_inode_flag(inode, EXT4_INODE_EXTENTS))
5437                 return -EOPNOTSUPP;
5438
5439         /* Collapse range works only on fs cluster size aligned regions. */
5440         if (!IS_ALIGNED(offset | len, EXT4_CLUSTER_SIZE(sb)))
5441                 return -EINVAL;
5442
5443         trace_ext4_collapse_range(inode, offset, len);
5444
5445         punch_start = offset >> EXT4_BLOCK_SIZE_BITS(sb);
5446         punch_stop = (offset + len) >> EXT4_BLOCK_SIZE_BITS(sb);
5447
5448         /* Call ext4_force_commit to flush all data in case of data=journal. */
5449         if (ext4_should_journal_data(inode)) {
5450                 ret = ext4_force_commit(inode->i_sb);
5451                 if (ret)
5452                         return ret;
5453         }
5454
5455         inode_lock(inode);
5456         /*
5457          * There is no need to overlap collapse range with EOF, in which case
5458          * it is effectively a truncate operation
5459          */
5460         if (offset + len >= inode->i_size) {
5461                 ret = -EINVAL;
5462                 goto out_mutex;
5463         }
5464
5465         /* Currently just for extent based files */
5466         if (!ext4_test_inode_flag(inode, EXT4_INODE_EXTENTS)) {
5467                 ret = -EOPNOTSUPP;
5468                 goto out_mutex;
5469         }
5470
5471         /* Wait for existing dio to complete */
5472         inode_dio_wait(inode);
5473
5474         /*
5475          * Prevent page faults from reinstantiating pages we have released from
5476          * page cache.
5477          */
5478         down_write(&EXT4_I(inode)->i_mmap_sem);
5479
5480         ret = ext4_break_layouts(inode);
5481         if (ret)
5482                 goto out_mmap;
5483
5484         /*
5485          * Need to round down offset to be aligned with page size boundary
5486          * for page size > block size.
5487          */
5488         ioffset = round_down(offset, PAGE_SIZE);
5489         /*
5490          * Write tail of the last page before removed range since it will get
5491          * removed from the page cache below.
5492          */
5493         ret = filemap_write_and_wait_range(inode->i_mapping, ioffset, offset);
5494         if (ret)
5495                 goto out_mmap;
5496         /*
5497          * Write data that will be shifted to preserve them when discarding
5498          * page cache below. We are also protected from pages becoming dirty
5499          * by i_mmap_sem.
5500          */
5501         ret = filemap_write_and_wait_range(inode->i_mapping, offset + len,
5502                                            LLONG_MAX);
5503         if (ret)
5504                 goto out_mmap;
5505         truncate_pagecache(inode, ioffset);
5506
5507         credits = ext4_writepage_trans_blocks(inode);
5508         handle = ext4_journal_start(inode, EXT4_HT_TRUNCATE, credits);
5509         if (IS_ERR(handle)) {
5510                 ret = PTR_ERR(handle);
5511                 goto out_mmap;
5512         }
5513
5514         down_write(&EXT4_I(inode)->i_data_sem);
5515         ext4_discard_preallocations(inode);
5516
5517         ret = ext4_es_remove_extent(inode, punch_start,
5518                                     EXT_MAX_BLOCKS - punch_start);
5519         if (ret) {
5520                 up_write(&EXT4_I(inode)->i_data_sem);
5521                 goto out_stop;
5522         }
5523
5524         ret = ext4_ext_remove_space(inode, punch_start, punch_stop - 1);
5525         if (ret) {
5526                 up_write(&EXT4_I(inode)->i_data_sem);
5527                 goto out_stop;
5528         }
5529         ext4_discard_preallocations(inode);
5530
5531         ret = ext4_ext_shift_extents(inode, handle, punch_stop,
5532                                      punch_stop - punch_start, SHIFT_LEFT);
5533         if (ret) {
5534                 up_write(&EXT4_I(inode)->i_data_sem);
5535                 goto out_stop;
5536         }
5537
5538         new_size = inode->i_size - len;
5539         i_size_write(inode, new_size);
5540         EXT4_I(inode)->i_disksize = new_size;
5541
5542         up_write(&EXT4_I(inode)->i_data_sem);
5543         if (IS_SYNC(inode))
5544                 ext4_handle_sync(handle);
5545         inode->i_mtime = inode->i_ctime = current_time(inode);
5546         ext4_mark_inode_dirty(handle, inode);
5547         ext4_update_inode_fsync_trans(handle, inode, 1);
5548
5549 out_stop:
5550         ext4_journal_stop(handle);
5551 out_mmap:
5552         up_write(&EXT4_I(inode)->i_mmap_sem);
5553 out_mutex:
5554         inode_unlock(inode);
5555         return ret;
5556 }
5557
5558 /*
5559  * ext4_insert_range:
5560  * This function implements the FALLOC_FL_INSERT_RANGE flag of fallocate.
5561  * The data blocks starting from @offset to the EOF are shifted by @len
5562  * towards right to create a hole in the @inode. Inode size is increased
5563  * by len bytes.
5564  * Returns 0 on success, error otherwise.
5565  */
5566 static int ext4_insert_range(struct inode *inode, loff_t offset, loff_t len)
5567 {
5568         struct super_block *sb = inode->i_sb;
5569         handle_t *handle;
5570         struct ext4_ext_path *path;
5571         struct ext4_extent *extent;
5572         ext4_lblk_t offset_lblk, len_lblk, ee_start_lblk = 0;
5573         unsigned int credits, ee_len;
5574         int ret = 0, depth, split_flag = 0;
5575         loff_t ioffset;
5576
5577         /*
5578          * We need to test this early because xfstests assumes that an
5579          * insert range of (0, 1) will return EOPNOTSUPP if the file
5580          * system does not support insert range.
5581          */
5582         if (!ext4_test_inode_flag(inode, EXT4_INODE_EXTENTS))
5583                 return -EOPNOTSUPP;
5584
5585         /* Insert range works only on fs cluster size aligned regions. */
5586         if (!IS_ALIGNED(offset | len, EXT4_CLUSTER_SIZE(sb)))
5587                 return -EINVAL;
5588
5589         trace_ext4_insert_range(inode, offset, len);
5590
5591         offset_lblk = offset >> EXT4_BLOCK_SIZE_BITS(sb);
5592         len_lblk = len >> EXT4_BLOCK_SIZE_BITS(sb);
5593
5594         /* Call ext4_force_commit to flush all data in case of data=journal */
5595         if (ext4_should_journal_data(inode)) {
5596                 ret = ext4_force_commit(inode->i_sb);
5597                 if (ret)
5598                         return ret;
5599         }
5600
5601         inode_lock(inode);
5602         /* Currently just for extent based files */
5603         if (!ext4_test_inode_flag(inode, EXT4_INODE_EXTENTS)) {
5604                 ret = -EOPNOTSUPP;
5605                 goto out_mutex;
5606         }
5607
5608         /* Check whether the maximum file size would be exceeded */
5609         if (len > inode->i_sb->s_maxbytes - inode->i_size) {
5610                 ret = -EFBIG;
5611                 goto out_mutex;
5612         }
5613
5614         /* Offset must be less than i_size */
5615         if (offset >= inode->i_size) {
5616                 ret = -EINVAL;
5617                 goto out_mutex;
5618         }
5619
5620         /* Wait for existing dio to complete */
5621         inode_dio_wait(inode);
5622
5623         /*
5624          * Prevent page faults from reinstantiating pages we have released from
5625          * page cache.
5626          */
5627         down_write(&EXT4_I(inode)->i_mmap_sem);
5628
5629         ret = ext4_break_layouts(inode);
5630         if (ret)
5631                 goto out_mmap;
5632
5633         /*
5634          * Need to round down to align start offset to page size boundary
5635          * for page size > block size.
5636          */
5637         ioffset = round_down(offset, PAGE_SIZE);
5638         /* Write out all dirty pages */
5639         ret = filemap_write_and_wait_range(inode->i_mapping, ioffset,
5640                         LLONG_MAX);
5641         if (ret)
5642                 goto out_mmap;
5643         truncate_pagecache(inode, ioffset);
5644
5645         credits = ext4_writepage_trans_blocks(inode);
5646         handle = ext4_journal_start(inode, EXT4_HT_TRUNCATE, credits);
5647         if (IS_ERR(handle)) {
5648                 ret = PTR_ERR(handle);
5649                 goto out_mmap;
5650         }
5651
5652         /* Expand file to avoid data loss if there is error while shifting */
5653         inode->i_size += len;
5654         EXT4_I(inode)->i_disksize += len;
5655         inode->i_mtime = inode->i_ctime = current_time(inode);
5656         ret = ext4_mark_inode_dirty(handle, inode);
5657         if (ret)
5658                 goto out_stop;
5659
5660         down_write(&EXT4_I(inode)->i_data_sem);
5661         ext4_discard_preallocations(inode);
5662
5663         path = ext4_find_extent(inode, offset_lblk, NULL, 0);
5664         if (IS_ERR(path)) {
5665                 up_write(&EXT4_I(inode)->i_data_sem);
5666                 goto out_stop;
5667         }
5668
5669         depth = ext_depth(inode);
5670         extent = path[depth].p_ext;
5671         if (extent) {
5672                 ee_start_lblk = le32_to_cpu(extent->ee_block);
5673                 ee_len = ext4_ext_get_actual_len(extent);
5674
5675                 /*
5676                  * If offset_lblk is not the starting block of extent, split
5677                  * the extent @offset_lblk
5678                  */
5679                 if ((offset_lblk > ee_start_lblk) &&
5680                                 (offset_lblk < (ee_start_lblk + ee_len))) {
5681                         if (ext4_ext_is_unwritten(extent))
5682                                 split_flag = EXT4_EXT_MARK_UNWRIT1 |
5683                                         EXT4_EXT_MARK_UNWRIT2;
5684                         ret = ext4_split_extent_at(handle, inode, &path,
5685                                         offset_lblk, split_flag,
5686                                         EXT4_EX_NOCACHE |
5687                                         EXT4_GET_BLOCKS_PRE_IO |
5688                                         EXT4_GET_BLOCKS_METADATA_NOFAIL);
5689                 }
5690
5691                 ext4_ext_drop_refs(path);
5692                 kfree(path);
5693                 if (ret < 0) {
5694                         up_write(&EXT4_I(inode)->i_data_sem);
5695                         goto out_stop;
5696                 }
5697         } else {
5698                 ext4_ext_drop_refs(path);
5699                 kfree(path);
5700         }
5701
5702         ret = ext4_es_remove_extent(inode, offset_lblk,
5703                         EXT_MAX_BLOCKS - offset_lblk);
5704         if (ret) {
5705                 up_write(&EXT4_I(inode)->i_data_sem);
5706                 goto out_stop;
5707         }
5708
5709         /*
5710          * if offset_lblk lies in a hole which is at start of file, use
5711          * ee_start_lblk to shift extents
5712          */
5713         ret = ext4_ext_shift_extents(inode, handle,
5714                 ee_start_lblk > offset_lblk ? ee_start_lblk : offset_lblk,
5715                 len_lblk, SHIFT_RIGHT);
5716
5717         up_write(&EXT4_I(inode)->i_data_sem);
5718         if (IS_SYNC(inode))
5719                 ext4_handle_sync(handle);
5720         if (ret >= 0)
5721                 ext4_update_inode_fsync_trans(handle, inode, 1);
5722
5723 out_stop:
5724         ext4_journal_stop(handle);
5725 out_mmap:
5726         up_write(&EXT4_I(inode)->i_mmap_sem);
5727 out_mutex:
5728         inode_unlock(inode);
5729         return ret;
5730 }
5731
5732 /**
5733  * ext4_swap_extents() - Swap extents between two inodes
5734  * @handle: handle for this transaction
5735  * @inode1:     First inode
5736  * @inode2:     Second inode
5737  * @lblk1:      Start block for first inode
5738  * @lblk2:      Start block for second inode
5739  * @count:      Number of blocks to swap
5740  * @unwritten: Mark second inode's extents as unwritten after swap
5741  * @erp:        Pointer to save error value
5742  *
5743  * This helper routine does exactly what is promise "swap extents". All other
5744  * stuff such as page-cache locking consistency, bh mapping consistency or
5745  * extent's data copying must be performed by caller.
5746  * Locking:
5747  *              i_mutex is held for both inodes
5748  *              i_data_sem is locked for write for both inodes
5749  * Assumptions:
5750  *              All pages from requested range are locked for both inodes
5751  */
5752 int
5753 ext4_swap_extents(handle_t *handle, struct inode *inode1,
5754                   struct inode *inode2, ext4_lblk_t lblk1, ext4_lblk_t lblk2,
5755                   ext4_lblk_t count, int unwritten, int *erp)
5756 {
5757         struct ext4_ext_path *path1 = NULL;
5758         struct ext4_ext_path *path2 = NULL;
5759         int replaced_count = 0;
5760
5761         BUG_ON(!rwsem_is_locked(&EXT4_I(inode1)->i_data_sem));
5762         BUG_ON(!rwsem_is_locked(&EXT4_I(inode2)->i_data_sem));
5763         BUG_ON(!inode_is_locked(inode1));
5764         BUG_ON(!inode_is_locked(inode2));
5765
5766         *erp = ext4_es_remove_extent(inode1, lblk1, count);
5767         if (unlikely(*erp))
5768                 return 0;
5769         *erp = ext4_es_remove_extent(inode2, lblk2, count);
5770         if (unlikely(*erp))
5771                 return 0;
5772
5773         while (count) {
5774                 struct ext4_extent *ex1, *ex2, tmp_ex;
5775                 ext4_lblk_t e1_blk, e2_blk;
5776                 int e1_len, e2_len, len;
5777                 int split = 0;
5778
5779                 path1 = ext4_find_extent(inode1, lblk1, NULL, EXT4_EX_NOCACHE);
5780                 if (IS_ERR(path1)) {
5781                         *erp = PTR_ERR(path1);
5782                         path1 = NULL;
5783                 finish:
5784                         count = 0;
5785                         goto repeat;
5786                 }
5787                 path2 = ext4_find_extent(inode2, lblk2, NULL, EXT4_EX_NOCACHE);
5788                 if (IS_ERR(path2)) {
5789                         *erp = PTR_ERR(path2);
5790                         path2 = NULL;
5791                         goto finish;
5792                 }
5793                 ex1 = path1[path1->p_depth].p_ext;
5794                 ex2 = path2[path2->p_depth].p_ext;
5795                 /* Do we have somthing to swap ? */
5796                 if (unlikely(!ex2 || !ex1))
5797                         goto finish;
5798
5799                 e1_blk = le32_to_cpu(ex1->ee_block);
5800                 e2_blk = le32_to_cpu(ex2->ee_block);
5801                 e1_len = ext4_ext_get_actual_len(ex1);
5802                 e2_len = ext4_ext_get_actual_len(ex2);
5803
5804                 /* Hole handling */
5805                 if (!in_range(lblk1, e1_blk, e1_len) ||
5806                     !in_range(lblk2, e2_blk, e2_len)) {
5807                         ext4_lblk_t next1, next2;
5808
5809                         /* if hole after extent, then go to next extent */
5810                         next1 = ext4_ext_next_allocated_block(path1);
5811                         next2 = ext4_ext_next_allocated_block(path2);
5812                         /* If hole before extent, then shift to that extent */
5813                         if (e1_blk > lblk1)
5814                                 next1 = e1_blk;
5815                         if (e2_blk > lblk2)
5816                                 next2 = e2_blk;
5817                         /* Do we have something to swap */
5818                         if (next1 == EXT_MAX_BLOCKS || next2 == EXT_MAX_BLOCKS)
5819                                 goto finish;
5820                         /* Move to the rightest boundary */
5821                         len = next1 - lblk1;
5822                         if (len < next2 - lblk2)
5823                                 len = next2 - lblk2;
5824                         if (len > count)
5825                                 len = count;
5826                         lblk1 += len;
5827                         lblk2 += len;
5828                         count -= len;
5829                         goto repeat;
5830                 }
5831
5832                 /* Prepare left boundary */
5833                 if (e1_blk < lblk1) {
5834                         split = 1;
5835                         *erp = ext4_force_split_extent_at(handle, inode1,
5836                                                 &path1, lblk1, 0);
5837                         if (unlikely(*erp))
5838                                 goto finish;
5839                 }
5840                 if (e2_blk < lblk2) {
5841                         split = 1;
5842                         *erp = ext4_force_split_extent_at(handle, inode2,
5843                                                 &path2,  lblk2, 0);
5844                         if (unlikely(*erp))
5845                                 goto finish;
5846                 }
5847                 /* ext4_split_extent_at() may result in leaf extent split,
5848                  * path must to be revalidated. */
5849                 if (split)
5850                         goto repeat;
5851
5852                 /* Prepare right boundary */
5853                 len = count;
5854                 if (len > e1_blk + e1_len - lblk1)
5855                         len = e1_blk + e1_len - lblk1;
5856                 if (len > e2_blk + e2_len - lblk2)
5857                         len = e2_blk + e2_len - lblk2;
5858
5859                 if (len != e1_len) {
5860                         split = 1;
5861                         *erp = ext4_force_split_extent_at(handle, inode1,
5862                                                 &path1, lblk1 + len, 0);
5863                         if (unlikely(*erp))
5864                                 goto finish;
5865                 }
5866                 if (len != e2_len) {
5867                         split = 1;
5868                         *erp = ext4_force_split_extent_at(handle, inode2,
5869                                                 &path2, lblk2 + len, 0);
5870                         if (*erp)
5871                                 goto finish;
5872                 }
5873                 /* ext4_split_extent_at() may result in leaf extent split,
5874                  * path must to be revalidated. */
5875                 if (split)
5876                         goto repeat;
5877
5878                 BUG_ON(e2_len != e1_len);
5879                 *erp = ext4_ext_get_access(handle, inode1, path1 + path1->p_depth);
5880                 if (unlikely(*erp))
5881                         goto finish;
5882                 *erp = ext4_ext_get_access(handle, inode2, path2 + path2->p_depth);
5883                 if (unlikely(*erp))
5884                         goto finish;
5885
5886                 /* Both extents are fully inside boundaries. Swap it now */
5887                 tmp_ex = *ex1;
5888                 ext4_ext_store_pblock(ex1, ext4_ext_pblock(ex2));
5889                 ext4_ext_store_pblock(ex2, ext4_ext_pblock(&tmp_ex));
5890                 ex1->ee_len = cpu_to_le16(e2_len);
5891                 ex2->ee_len = cpu_to_le16(e1_len);
5892                 if (unwritten)
5893                         ext4_ext_mark_unwritten(ex2);
5894                 if (ext4_ext_is_unwritten(&tmp_ex))
5895                         ext4_ext_mark_unwritten(ex1);
5896
5897                 ext4_ext_try_to_merge(handle, inode2, path2, ex2);
5898                 ext4_ext_try_to_merge(handle, inode1, path1, ex1);
5899                 *erp = ext4_ext_dirty(handle, inode2, path2 +
5900                                       path2->p_depth);
5901                 if (unlikely(*erp))
5902                         goto finish;
5903                 *erp = ext4_ext_dirty(handle, inode1, path1 +
5904                                       path1->p_depth);
5905                 /*
5906                  * Looks scarry ah..? second inode already points to new blocks,
5907                  * and it was successfully dirtied. But luckily error may happen
5908                  * only due to journal error, so full transaction will be
5909                  * aborted anyway.
5910                  */
5911                 if (unlikely(*erp))
5912                         goto finish;
5913                 lblk1 += len;
5914                 lblk2 += len;
5915                 replaced_count += len;
5916                 count -= len;
5917
5918         repeat:
5919                 ext4_ext_drop_refs(path1);
5920                 kfree(path1);
5921                 ext4_ext_drop_refs(path2);
5922                 kfree(path2);
5923                 path1 = path2 = NULL;
5924         }
5925         return replaced_count;
5926 }
5927
5928 /*
5929  * ext4_clu_mapped - determine whether any block in a logical cluster has
5930  *                   been mapped to a physical cluster
5931  *
5932  * @inode - file containing the logical cluster
5933  * @lclu - logical cluster of interest
5934  *
5935  * Returns 1 if any block in the logical cluster is mapped, signifying
5936  * that a physical cluster has been allocated for it.  Otherwise,
5937  * returns 0.  Can also return negative error codes.  Derived from
5938  * ext4_ext_map_blocks().
5939  */
5940 int ext4_clu_mapped(struct inode *inode, ext4_lblk_t lclu)
5941 {
5942         struct ext4_sb_info *sbi = EXT4_SB(inode->i_sb);
5943         struct ext4_ext_path *path;
5944         int depth, mapped = 0, err = 0;
5945         struct ext4_extent *extent;
5946         ext4_lblk_t first_lblk, first_lclu, last_lclu;
5947
5948         /* search for the extent closest to the first block in the cluster */
5949         path = ext4_find_extent(inode, EXT4_C2B(sbi, lclu), NULL, 0);
5950         if (IS_ERR(path)) {
5951                 err = PTR_ERR(path);
5952                 path = NULL;
5953                 goto out;
5954         }
5955
5956         depth = ext_depth(inode);
5957
5958         /*
5959          * A consistent leaf must not be empty.  This situation is possible,
5960          * though, _during_ tree modification, and it's why an assert can't
5961          * be put in ext4_find_extent().
5962          */
5963         if (unlikely(path[depth].p_ext == NULL && depth != 0)) {
5964                 EXT4_ERROR_INODE(inode,
5965                     "bad extent address - lblock: %lu, depth: %d, pblock: %lld",
5966                                  (unsigned long) EXT4_C2B(sbi, lclu),
5967                                  depth, path[depth].p_block);
5968                 err = -EFSCORRUPTED;
5969                 goto out;
5970         }
5971
5972         extent = path[depth].p_ext;
5973
5974         /* can't be mapped if the extent tree is empty */
5975         if (extent == NULL)
5976                 goto out;
5977
5978         first_lblk = le32_to_cpu(extent->ee_block);
5979         first_lclu = EXT4_B2C(sbi, first_lblk);
5980
5981         /*
5982          * Three possible outcomes at this point - found extent spanning
5983          * the target cluster, to the left of the target cluster, or to the
5984          * right of the target cluster.  The first two cases are handled here.
5985          * The last case indicates the target cluster is not mapped.
5986          */
5987         if (lclu >= first_lclu) {
5988                 last_lclu = EXT4_B2C(sbi, first_lblk +
5989                                      ext4_ext_get_actual_len(extent) - 1);
5990                 if (lclu <= last_lclu) {
5991                         mapped = 1;
5992                 } else {
5993                         first_lblk = ext4_ext_next_allocated_block(path);
5994                         first_lclu = EXT4_B2C(sbi, first_lblk);
5995                         if (lclu == first_lclu)
5996                                 mapped = 1;
5997                 }
5998         }
5999
6000 out:
6001         ext4_ext_drop_refs(path);
6002         kfree(path);
6003
6004         return err ? err : mapped;
6005 }