fs/ext2/inode.c

   1 /*
   2  *  linux/fs/ext2/inode.c
   3  *
   4  * Copyright (C) 1992, 1993, 1994, 1995
   5  * Remy Card (card@masi.ibp.fr)
   6  * Laboratoire MASI - Institut Blaise Pascal
   7  * Universite Pierre et Marie Curie (Paris VI)
   8  *
   9  *  from
  10  *
  11  *  linux/fs/minix/inode.c
  12  *
  13  *  Copyright (C) 1991, 1992  Linus Torvalds
  14  *
  15  *  Goal-directed block allocation by Stephen Tweedie
  16  *      (sct@dcs.ed.ac.uk), 1993, 1998
  17  *  Big-endian to little-endian byte-swapping/bitmaps by
  18  *        David S. Miller (davem@caip.rutgers.edu), 1995
  19  *  64-bit file support on 64-bit platforms by Jakub Jelinek
  20  *      (jj@sunsite.ms.mff.cuni.cz)
  21  *
  22  *  Assorted race fixes, rewrite of ext2_get_block() by Al Viro, 2000
  23  */
  24
  25 #include <linux/time.h>
  26 #include <linux/highuid.h>
  27 #include <linux/pagemap.h>
  28 #include <linux/dax.h>
  29 #include <linux/blkdev.h>
  30 #include <linux/quotaops.h>
  31 #include <linux/writeback.h>
  32 #include <linux/buffer_head.h>
  33 #include <linux/mpage.h>
  34 #include <linux/fiemap.h>
  35 #include <linux/iomap.h>
  36 #include <linux/namei.h>
  37 #include <linux/uio.h>
  38 #include "ext2.h"
  39 #include "acl.h"
  40 #include "xattr.h"
  41
  42 static int __ext2_write_inode(struct inode *inode, int do_sync);
  43
  44 /*
  45  * Test whether an inode is a fast symlink.
  46  */
  47 static inline int ext2_inode_is_fast_symlink(struct inode *inode)
  48 {
  49         int ea_blocks = EXT2_I(inode)->i_file_acl ?
  50                 (inode->i_sb->s_blocksize >> 9) : 0;
  51
  52         return (S_ISLNK(inode->i_mode) &&
  53                 inode->i_blocks - ea_blocks == 0);
  54 }
  55
  56 static void ext2_truncate_blocks(struct inode *inode, loff_t offset);
  57
  58 static void ext2_write_failed(struct address_space *mapping, loff_t to)
  59 {
  60         struct inode *inode = mapping->host;
  61
  62         if (to > inode->i_size) {
  63                 truncate_pagecache(inode, inode->i_size);
  64                 ext2_truncate_blocks(inode, inode->i_size);
  65         }
  66 }
  67
  68 /*
  69  * Called at the last iput() if i_nlink is zero.
  70  */
  71 void ext2_evict_inode(struct inode * inode)
  72 {
  73         struct ext2_block_alloc_info *rsv;
  74         int want_delete = 0;
  75
  76         if (!inode->i_nlink && !is_bad_inode(inode)) {
  77                 want_delete = 1;
  78                 dquot_initialize(inode);
  79         } else {
  80                 dquot_drop(inode);
  81         }
  82
  83         truncate_inode_pages_final(&inode->i_data);
  84
  85         if (want_delete) {
  86                 sb_start_intwrite(inode->i_sb);
  87                 /* set dtime */
  88                 EXT2_I(inode)->i_dtime  = get_seconds();
  89                 mark_inode_dirty(inode);
  90                 __ext2_write_inode(inode, inode_needs_sync(inode));
  91                 /* truncate to 0 */
  92                 inode->i_size = 0;
  93                 if (inode->i_blocks)
  94                         ext2_truncate_blocks(inode, 0);
  95                 ext2_xattr_delete_inode(inode);
  96         }
  97
  98         invalidate_inode_buffers(inode);
  99         clear_inode(inode);
 100
 101         ext2_discard_reservation(inode);
 102         rsv = EXT2_I(inode)->i_block_alloc_info;
 103         EXT2_I(inode)->i_block_alloc_info = NULL;
 104         if (unlikely(rsv))
 105                 kfree(rsv);
 106
 107         if (want_delete) {
 108                 ext2_free_inode(inode);
 109                 sb_end_intwrite(inode->i_sb);
 110         }
 111 }
 112
 113 typedef struct {
 114         __le32  *p;
 115         __le32  key;
 116         struct buffer_head *bh;
 117 } Indirect;
 118
 119 static inline void add_chain(Indirect *p, struct buffer_head *bh, __le32 *v)
 120 {
 121         p->key = *(p->p = v);
 122         p->bh = bh;
 123 }
 124
 125 static inline int verify_chain(Indirect *from, Indirect *to)
 126 {
 127         while (from <= to && from->key == *from->p)
 128                 from++;
 129         return (from > to);
 130 }
 131
 132 /**
 133  *      ext2_block_to_path - parse the block number into array of offsets
 134  *      @inode: inode in question (we are only interested in its superblock)
 135  *      @i_block: block number to be parsed
 136  *      @offsets: array to store the offsets in
 137  *      @boundary: set this non-zero if the referred-to block is likely to be
 138  *             followed (on disk) by an indirect block.
 139  *      To store the locations of file's data ext2 uses a data structure common
 140  *      for UNIX filesystems - tree of pointers anchored in the inode, with
 141  *      data blocks at leaves and indirect blocks in intermediate nodes.
 142  *      This function translates the block number into path in that tree -
 143  *      return value is the path length and @offsets[n] is the offset of
 144  *      pointer to (n+1)th node in the nth one. If @block is out of range
 145  *      (negative or too large) warning is printed and zero returned.
 146  *
 147  *      Note: function doesn't find node addresses, so no IO is needed. All
 148  *      we need to know is the capacity of indirect blocks (taken from the
 149  *      inode->i_sb).
 150  */
 151
 152 /*
 153  * Portability note: the last comparison (check that we fit into triple
 154  * indirect block) is spelled differently, because otherwise on an
 155  * architecture with 32-bit longs and 8Kb pages we might get into trouble
 156  * if our filesystem had 8Kb blocks. We might use long long, but that would
 157  * kill us on x86. Oh, well, at least the sign propagation does not matter -
 158  * i_block would have to be negative in the very beginning, so we would not
 159  * get there at all.
 160  */
 161
 162 static int ext2_block_to_path(struct inode *inode,
 163                         long i_block, int offsets[4], int *boundary)
 164 {
 165         int ptrs = EXT2_ADDR_PER_BLOCK(inode->i_sb);
 166         int ptrs_bits = EXT2_ADDR_PER_BLOCK_BITS(inode->i_sb);
 167         const long direct_blocks = EXT2_NDIR_BLOCKS,
 168                 indirect_blocks = ptrs,
 169                 double_blocks = (1 << (ptrs_bits * 2));
 170         int n = 0;
 171         int final = 0;
 172
 173         if (i_block < 0) {
 174                 ext2_msg(inode->i_sb, KERN_WARNING,
 175                         "warning: %s: block < 0", __func__);
 176         } else if (i_block < direct_blocks) {
 177                 offsets[n++] = i_block;
 178                 final = direct_blocks;
 179         } else if ( (i_block -= direct_blocks) < indirect_blocks) {
 180                 offsets[n++] = EXT2_IND_BLOCK;
 181                 offsets[n++] = i_block;
 182                 final = ptrs;
 183         } else if ((i_block -= indirect_blocks) < double_blocks) {
 184                 offsets[n++] = EXT2_DIND_BLOCK;
 185                 offsets[n++] = i_block >> ptrs_bits;
 186                 offsets[n++] = i_block & (ptrs - 1);
 187                 final = ptrs;
 188         } else if (((i_block -= double_blocks) >> (ptrs_bits * 2)) < ptrs) {
 189                 offsets[n++] = EXT2_TIND_BLOCK;
 190                 offsets[n++] = i_block >> (ptrs_bits * 2);
 191                 offsets[n++] = (i_block >> ptrs_bits) & (ptrs - 1);
 192                 offsets[n++] = i_block & (ptrs - 1);
 193                 final = ptrs;
 194         } else {
 195                 ext2_msg(inode->i_sb, KERN_WARNING,
 196                         "warning: %s: block is too big", __func__);
 197         }
 198         if (boundary)
 199                 *boundary = final - 1 - (i_block & (ptrs - 1));
 200
 201         return n;
 202 }
 203
 204 /**
 205  *      ext2_get_branch - read the chain of indirect blocks leading to data
 206  *      @inode: inode in question
 207  *      @depth: depth of the chain (1 - direct pointer, etc.)
 208  *      @offsets: offsets of pointers in inode/indirect blocks
 209  *      @chain: place to store the result
 210  *      @err: here we store the error value
 211  *
 212  *      Function fills the array of triples <key, p, bh> and returns %NULL
 213  *      if everything went OK or the pointer to the last filled triple
 214  *      (incomplete one) otherwise. Upon the return chain[i].key contains
 215  *      the number of (i+1)-th block in the chain (as it is stored in memory,
 216  *      i.e. little-endian 32-bit), chain[i].p contains the address of that
 217  *      number (it points into struct inode for i==0 and into the bh->b_data
 218  *      for i>0) and chain[i].bh points to the buffer_head of i-th indirect
 219  *      block for i>0 and NULL for i==0. In other words, it holds the block
 220  *      numbers of the chain, addresses they were taken from (and where we can
 221  *      verify that chain did not change) and buffer_heads hosting these
 222  *      numbers.
 223  *
 224  *      Function stops when it stumbles upon zero pointer (absent block)
 225  *              (pointer to last triple returned, *@err == 0)
 226  *      or when it gets an IO error reading an indirect block
 227  *              (ditto, *@err == -EIO)
 228  *      or when it notices that chain had been changed while it was reading
 229  *              (ditto, *@err == -EAGAIN)
 230  *      or when it reads all @depth-1 indirect blocks successfully and finds
 231  *      the whole chain, all way to the data (returns %NULL, *err == 0).
 232  */
 233 static Indirect *ext2_get_branch(struct inode *inode,
 234                                  int depth,
 235                                  int *offsets,
 236                                  Indirect chain[4],
 237                                  int *err)
 238 {
 239         struct super_block *sb = inode->i_sb;
 240         Indirect *p = chain;
 241         struct buffer_head *bh;
 242
 243         *err = 0;
 244         /* i_data is not going away, no lock needed */
 245         add_chain (chain, NULL, EXT2_I(inode)->i_data + *offsets);
 246         if (!p->key)
 247                 goto no_block;
 248         while (--depth) {
 249                 bh = sb_bread(sb, le32_to_cpu(p->key));
 250                 if (!bh)
 251                         goto failure;
 252                 read_lock(&EXT2_I(inode)->i_meta_lock);
 253                 if (!verify_chain(chain, p))
 254                         goto changed;
 255                 add_chain(++p, bh, (__le32*)bh->b_data + *++offsets);
 256                 read_unlock(&EXT2_I(inode)->i_meta_lock);
 257                 if (!p->key)
 258                         goto no_block;
 259         }
 260         return NULL;
 261
 262 changed:
 263         read_unlock(&EXT2_I(inode)->i_meta_lock);
 264         brelse(bh);
 265         *err = -EAGAIN;
 266         goto no_block;
 267 failure:
 268         *err = -EIO;
 269 no_block:
 270         return p;
 271 }
 272
 273 /**
 274  *      ext2_find_near - find a place for allocation with sufficient locality
 275  *      @inode: owner
 276  *      @ind: descriptor of indirect block.
 277  *
 278  *      This function returns the preferred place for block allocation.
 279  *      It is used when heuristic for sequential allocation fails.
 280  *      Rules are:
 281  *        + if there is a block to the left of our position - allocate near it.
 282  *        + if pointer will live in indirect block - allocate near that block.
 283  *        + if pointer will live in inode - allocate in the same cylinder group.
 284  *
 285  * In the latter case we colour the starting block by the callers PID to
 286  * prevent it from clashing with concurrent allocations for a different inode
 287  * in the same block group.   The PID is used here so that functionally related
 288  * files will be close-by on-disk.
 289  *
 290  *      Caller must make sure that @ind is valid and will stay that way.
 291  */
 292
 293 static ext2_fsblk_t ext2_find_near(struct inode *inode, Indirect *ind)
 294 {
 295         struct ext2_inode_info *ei = EXT2_I(inode);
 296         __le32 *start = ind->bh ? (__le32 *) ind->bh->b_data : ei->i_data;
 297         __le32 *p;
 298         ext2_fsblk_t bg_start;
 299         ext2_fsblk_t colour;
 300
 301         /* Try to find previous block */
 302         for (p = ind->p - 1; p >= start; p--)
 303                 if (*p)
 304                         return le32_to_cpu(*p);
 305
 306         /* No such thing, so let's try location of indirect block */
 307         if (ind->bh)
 308                 return ind->bh->b_blocknr;
 309
 310         /*
 311          * It is going to be referred from inode itself? OK, just put it into
 312          * the same cylinder group then.
 313          */
 314         bg_start = ext2_group_first_block_no(inode->i_sb, ei->i_block_group);
 315         colour = (current->pid % 16) *
 316                         (EXT2_BLOCKS_PER_GROUP(inode->i_sb) / 16);
 317         return bg_start + colour;
 318 }
 319
 320 /**
 321  *      ext2_find_goal - find a preferred place for allocation.
 322  *      @inode: owner
 323  *      @block:  block we want
 324  *      @partial: pointer to the last triple within a chain
 325  *
 326  *      Returns preferred place for a block (the goal).
 327  */
 328
 329 static inline ext2_fsblk_t ext2_find_goal(struct inode *inode, long block,
 330                                           Indirect *partial)
 331 {
 332         struct ext2_block_alloc_info *block_i;
 333
 334         block_i = EXT2_I(inode)->i_block_alloc_info;
 335
 336         /*
 337          * try the heuristic for sequential allocation,
 338          * failing that at least try to get decent locality.
 339          */
 340         if (block_i && (block == block_i->last_alloc_logical_block + 1)
 341                 && (block_i->last_alloc_physical_block != 0)) {
 342                 return block_i->last_alloc_physical_block + 1;
 343         }
 344
 345         return ext2_find_near(inode, partial);
 346 }
 347
 348 /**
 349  *      ext2_blks_to_allocate: Look up the block map and count the number
 350  *      of direct blocks need to be allocated for the given branch.
 351  *
 352  *      @branch: chain of indirect blocks
 353  *      @k: number of blocks need for indirect blocks
 354  *      @blks: number of data blocks to be mapped.
 355  *      @blocks_to_boundary:  the offset in the indirect block
 356  *
 357  *      return the total number of blocks to be allocate, including the
 358  *      direct and indirect blocks.
 359  */
 360 static int
 361 ext2_blks_to_allocate(Indirect * branch, int k, unsigned long blks,
 362                 int blocks_to_boundary)
 363 {
 364         unsigned long count = 0;
 365
 366         /*
 367          * Simple case, [t,d]Indirect block(s) has not allocated yet
 368          * then it's clear blocks on that path have not allocated
 369          */
 370         if (k > 0) {
 371                 /* right now don't hanel cross boundary allocation */
 372                 if (blks < blocks_to_boundary + 1)
 373                         count += blks;
 374                 else
 375                         count += blocks_to_boundary + 1;
 376                 return count;
 377         }
 378
 379         count++;
 380         while (count < blks && count <= blocks_to_boundary
 381                 && le32_to_cpu(*(branch[0].p + count)) == 0) {
 382                 count++;
 383         }
 384         return count;
 385 }
 386
 387 /**
 388  *      ext2_alloc_blocks: multiple allocate blocks needed for a branch
 389  *      @indirect_blks: the number of blocks need to allocate for indirect
 390  *                      blocks
 391  *
 392  *      @new_blocks: on return it will store the new block numbers for
 393  *      the indirect blocks(if needed) and the first direct block,
 394  *      @blks:  on return it will store the total number of allocated
 395  *              direct blocks
 396  */
 397 static int ext2_alloc_blocks(struct inode *inode,
 398                         ext2_fsblk_t goal, int indirect_blks, int blks,
 399                         ext2_fsblk_t new_blocks[4], int *err)
 400 {
 401         int target, i;
 402         unsigned long count = 0;
 403         int index = 0;
 404         ext2_fsblk_t current_block = 0;
 405         int ret = 0;
 406
 407         /*
 408          * Here we try to allocate the requested multiple blocks at once,
 409          * on a best-effort basis.
 410          * To build a branch, we should allocate blocks for
 411          * the indirect blocks(if not allocated yet), and at least
 412          * the first direct block of this branch.  That's the
 413          * minimum number of blocks need to allocate(required)
 414          */
 415         target = blks + indirect_blks;
 416
 417         while (1) {
 418                 count = target;
 419                 /* allocating blocks for indirect blocks and direct blocks */
 420                 current_block = ext2_new_blocks(inode,goal,&count,err);
 421                 if (*err)
 422                         goto failed_out;
 423
 424                 target -= count;
 425                 /* allocate blocks for indirect blocks */
 426                 while (index < indirect_blks && count) {
 427                         new_blocks[index++] = current_block++;
 428                         count--;
 429                 }
 430
 431                 if (count > 0)
 432                         break;
 433         }
 434
 435         /* save the new block number for the first direct block */
 436         new_blocks[index] = current_block;
 437
 438         /* total number of blocks allocated for direct blocks */
 439         ret = count;
 440         *err = 0;
 441         return ret;
 442 failed_out:
 443         for (i = 0; i <index; i++)
 444                 ext2_free_blocks(inode, new_blocks[i], 1);
 445         if (index)
 446                 mark_inode_dirty(inode);
 447         return ret;
 448 }
 449
 450 /**
 451  *      ext2_alloc_branch - allocate and set up a chain of blocks.
 452  *      @inode: owner
 453  *      @num: depth of the chain (number of blocks to allocate)
 454  *      @offsets: offsets (in the blocks) to store the pointers to next.
 455  *      @branch: place to store the chain in.
 456  *
 457  *      This function allocates @num blocks, zeroes out all but the last one,
 458  *      links them into chain and (if we are synchronous) writes them to disk.
 459  *      In other words, it prepares a branch that can be spliced onto the
 460  *      inode. It stores the information about that chain in the branch[], in
 461  *      the same format as ext2_get_branch() would do. We are calling it after
 462  *      we had read the existing part of chain and partial points to the last
 463  *      triple of that (one with zero ->key). Upon the exit we have the same
 464  *      picture as after the successful ext2_get_block(), except that in one
 465  *      place chain is disconnected - *branch->p is still zero (we did not
 466  *      set the last link), but branch->key contains the number that should
 467  *      be placed into *branch->p to fill that gap.
 468  *
 469  *      If allocation fails we free all blocks we've allocated (and forget
 470  *      their buffer_heads) and return the error value the from failed
 471  *      ext2_alloc_block() (normally -ENOSPC). Otherwise we set the chain
 472  *      as described above and return 0.
 473  */
 474
 475 static int ext2_alloc_branch(struct inode *inode,
 476                         int indirect_blks, int *blks, ext2_fsblk_t goal,
 477                         int *offsets, Indirect *branch)
 478 {
 479         int blocksize = inode->i_sb->s_blocksize;
 480         int i, n = 0;
 481         int err = 0;
 482         struct buffer_head *bh;
 483         int num;
 484         ext2_fsblk_t new_blocks[4];
 485         ext2_fsblk_t current_block;
 486
 487         num = ext2_alloc_blocks(inode, goal, indirect_blks,
 488                                 *blks, new_blocks, &err);
 489         if (err)
 490                 return err;
 491
 492         branch[0].key = cpu_to_le32(new_blocks[0]);
 493         /*
 494          * metadata blocks and data blocks are allocated.
 495          */
 496         for (n = 1; n <= indirect_blks;  n++) {
 497                 /*
 498                  * Get buffer_head for parent block, zero it out
 499                  * and set the pointer to new one, then send
 500                  * parent to disk.
 501                  */
 502                 bh = sb_getblk(inode->i_sb, new_blocks[n-1]);
 503                 if (unlikely(!bh)) {
 504                         err = -ENOMEM;
 505                         goto failed;
 506                 }
 507                 branch[n].bh = bh;
 508                 lock_buffer(bh);
 509                 memset(bh->b_data, 0, blocksize);
 510                 branch[n].p = (__le32 *) bh->b_data + offsets[n];
 511                 branch[n].key = cpu_to_le32(new_blocks[n]);
 512                 *branch[n].p = branch[n].key;
 513                 if ( n == indirect_blks) {
 514                         current_block = new_blocks[n];
 515                         /*
 516                          * End of chain, update the last new metablock of
 517                          * the chain to point to the new allocated
 518                          * data blocks numbers
 519                          */
 520                         for (i=1; i < num; i++)
 521                                 *(branch[n].p + i) = cpu_to_le32(++current_block);
 522                 }
 523                 set_buffer_uptodate(bh);
 524                 unlock_buffer(bh);
 525                 mark_buffer_dirty_inode(bh, inode);
 526                 /* We used to sync bh here if IS_SYNC(inode).
 527                  * But we now rely upon generic_write_sync()
 528                  * and b_inode_buffers.  But not for directories.
 529                  */
 530                 if (S_ISDIR(inode->i_mode) && IS_DIRSYNC(inode))
 531                         sync_dirty_buffer(bh);
 532         }
 533         *blks = num;
 534         return err;
 535
 536 failed:
 537         for (i = 1; i < n; i++)
 538                 bforget(branch[i].bh);
 539         for (i = 0; i < indirect_blks; i++)
 540                 ext2_free_blocks(inode, new_blocks[i], 1);
 541         ext2_free_blocks(inode, new_blocks[i], num);
 542         return err;
 543 }
 544
 545 /**
 546  * ext2_splice_branch - splice the allocated branch onto inode.
 547  * @inode: owner
 548  * @block: (logical) number of block we are adding
 549  * @where: location of missing link
 550  * @num:   number of indirect blocks we are adding
 551  * @blks:  number of direct blocks we are adding
 552  *
 553  * This function fills the missing link and does all housekeeping needed in
 554  * inode (->i_blocks, etc.). In case of success we end up with the full
 555  * chain to new block and return 0.
 556  */
 557 static void ext2_splice_branch(struct inode *inode,
 558                         long block, Indirect *where, int num, int blks)
 559 {
 560         int i;
 561         struct ext2_block_alloc_info *block_i;
 562         ext2_fsblk_t current_block;
 563
 564         block_i = EXT2_I(inode)->i_block_alloc_info;
 565
 566         /* XXX LOCKING probably should have i_meta_lock ?*/
 567         /* That's it */
 568
 569         *where->p = where->key;
 570
 571         /*
 572          * Update the host buffer_head or inode to point to more just allocated
 573          * direct blocks blocks
 574          */
 575         if (num == 0 && blks > 1) {
 576                 current_block = le32_to_cpu(where->key) + 1;
 577                 for (i = 1; i < blks; i++)
 578                         *(where->p + i ) = cpu_to_le32(current_block++);
 579         }
 580
 581         /*
 582          * update the most recently allocated logical & physical block
 583          * in i_block_alloc_info, to assist find the proper goal block for next
 584          * allocation
 585          */
 586         if (block_i) {
 587                 block_i->last_alloc_logical_block = block + blks - 1;
 588                 block_i->last_alloc_physical_block =
 589                                 le32_to_cpu(where[num].key) + blks - 1;
 590         }
 591
 592         /* We are done with atomic stuff, now do the rest of housekeeping */
 593
 594         /* had we spliced it onto indirect block? */
 595         if (where->bh)
 596                 mark_buffer_dirty_inode(where->bh, inode);
 597
 598         inode->i_ctime = current_time(inode);
 599         mark_inode_dirty(inode);
 600 }
 601
 602 /*
 603  * Allocation strategy is simple: if we have to allocate something, we will
 604  * have to go the whole way to leaf. So let's do it before attaching anything
 605  * to tree, set linkage between the newborn blocks, write them if sync is
 606  * required, recheck the path, free and repeat if check fails, otherwise
 607  * set the last missing link (that will protect us from any truncate-generated
 608  * removals - all blocks on the path are immune now) and possibly force the
 609  * write on the parent block.
 610  * That has a nice additional property: no special recovery from the failed
 611  * allocations is needed - we simply release blocks and do not touch anything
 612  * reachable from inode.
 613  *
 614  * `handle' can be NULL if create == 0.
 615  *
 616  * return > 0, # of blocks mapped or allocated.
 617  * return = 0, if plain lookup failed.
 618  * return < 0, error case.
 619  */
 620 static int ext2_get_blocks(struct inode *inode,
 621                            sector_t iblock, unsigned long maxblocks,
 622                            u32 *bno, bool *new, bool *boundary,
 623                            int create)
 624 {
 625         int err;
 626         int offsets[4];
 627         Indirect chain[4];
 628         Indirect *partial;
 629         ext2_fsblk_t goal;
 630         int indirect_blks;
 631         int blocks_to_boundary = 0;
 632         int depth;
 633         struct ext2_inode_info *ei = EXT2_I(inode);
 634         int count = 0;
 635         ext2_fsblk_t first_block = 0;
 636
 637         BUG_ON(maxblocks == 0);
 638
 639         depth = ext2_block_to_path(inode,iblock,offsets,&blocks_to_boundary);
 640
 641         if (depth == 0)
 642                 return -EIO;
 643
 644         partial = ext2_get_branch(inode, depth, offsets, chain, &err);
 645         /* Simplest case - block found, no allocation needed */
 646         if (!partial) {
 647                 first_block = le32_to_cpu(chain[depth - 1].key);
 648                 count++;
 649                 /*map more blocks*/
 650                 while (count < maxblocks && count <= blocks_to_boundary) {
 651                         ext2_fsblk_t blk;
 652
 653                         if (!verify_chain(chain, chain + depth - 1)) {
 654                                 /*
 655                                  * Indirect block might be removed by
 656                                  * truncate while we were reading it.
 657                                  * Handling of that case: forget what we've
 658                                  * got now, go to reread.
 659                                  */
 660                                 err = -EAGAIN;
 661                                 count = 0;
 662                                 break;
 663                         }
 664                         blk = le32_to_cpu(*(chain[depth-1].p + count));
 665                         if (blk == first_block + count)
 666                                 count++;
 667                         else
 668                                 break;
 669                 }
 670                 if (err != -EAGAIN)
 671                         goto got_it;
 672         }
 673
 674         /* Next simple case - plain lookup or failed read of indirect block */
 675         if (!create || err == -EIO)
 676                 goto cleanup;
 677
 678         mutex_lock(&ei->truncate_mutex);
 679         /*
 680          * If the indirect block is missing while we are reading
 681          * the chain(ext2_get_branch() returns -EAGAIN err), or
 682          * if the chain has been changed after we grab the semaphore,
 683          * (either because another process truncated this branch, or
 684          * another get_block allocated this branch) re-grab the chain to see if
 685          * the request block has been allocated or not.
 686          *
 687          * Since we already block the truncate/other get_block
 688          * at this point, we will have the current copy of the chain when we
 689          * splice the branch into the tree.
 690          */
 691         if (err == -EAGAIN || !verify_chain(chain, partial)) {
 692                 while (partial > chain) {
 693                         brelse(partial->bh);
 694                         partial--;
 695                 }
 696                 partial = ext2_get_branch(inode, depth, offsets, chain, &err);
 697                 if (!partial) {
 698                         count++;
 699                         mutex_unlock(&ei->truncate_mutex);
 700                         if (err)
 701                                 goto cleanup;
 702                         goto got_it;
 703                 }
 704         }
 705
 706         /*
 707          * Okay, we need to do block allocation.  Lazily initialize the block
 708          * allocation info here if necessary
 709         */
 710         if (S_ISREG(inode->i_mode) && (!ei->i_block_alloc_info))
 711                 ext2_init_block_alloc_info(inode);
 712
 713         goal = ext2_find_goal(inode, iblock, partial);
 714
 715         /* the number of blocks need to allocate for [d,t]indirect blocks */
 716         indirect_blks = (chain + depth) - partial - 1;
 717         /*
 718          * Next look up the indirect map to count the totoal number of
 719          * direct blocks to allocate for this branch.
 720          */
 721         count = ext2_blks_to_allocate(partial, indirect_blks,
 722                                         maxblocks, blocks_to_boundary);
 723         /*
 724          * XXX ???? Block out ext2_truncate while we alter the tree
 725          */
 726         err = ext2_alloc_branch(inode, indirect_blks, &count, goal,
 727                                 offsets + (partial - chain), partial);
 728
 729         if (err) {
 730                 mutex_unlock(&ei->truncate_mutex);
 731                 goto cleanup;
 732         }
 733
 734         if (IS_DAX(inode)) {
 735                 int i;
 736
 737                 /*
 738                  * We must unmap blocks before zeroing so that writeback cannot
 739                  * overwrite zeros with stale data from block device page cache.
 740                  */
 741                 for (i = 0; i < count; i++) {
 742                         unmap_underlying_metadata(inode->i_sb->s_bdev,
 743                                         le32_to_cpu(chain[depth-1].key) + i);
 744                 }
 745                 /*
 746                  * block must be initialised before we put it in the tree
 747                  * so that it's not found by another thread before it's
 748                  * initialised
 749                  */
 750                 err = sb_issue_zeroout(inode->i_sb,
 751                                 le32_to_cpu(chain[depth-1].key), count,
 752                                 GFP_NOFS);
 753                 if (err) {
 754                         mutex_unlock(&ei->truncate_mutex);
 755                         goto cleanup;
 756                 }
 757         } else {
 758                 *new = true;
 759         }
 760
 761         ext2_splice_branch(inode, iblock, partial, indirect_blks, count);
 762         mutex_unlock(&ei->truncate_mutex);
 763 got_it:
 764         if (count > blocks_to_boundary)
 765                 *boundary = true;
 766         err = count;
 767         /* Clean up and exit */
 768         partial = chain + depth - 1;    /* the whole chain */
 769 cleanup:
 770         while (partial > chain) {
 771                 brelse(partial->bh);
 772                 partial--;
 773         }
 774         if (err > 0)
 775                 *bno = le32_to_cpu(chain[depth-1].key);
 776         return err;
 777 }
 778
 779 int ext2_get_block(struct inode *inode, sector_t iblock,
 780                 struct buffer_head *bh_result, int create)
 781 {
 782         unsigned max_blocks = bh_result->b_size >> inode->i_blkbits;
 783         bool new = false, boundary = false;
 784         u32 bno;
 785         int ret;
 786
 787         ret = ext2_get_blocks(inode, iblock, max_blocks, &bno, &new, &boundary,
 788                         create);
 789         if (ret <= 0)
 790                 return ret;
 791
 792         map_bh(bh_result, inode->i_sb, bno);
 793         bh_result->b_size = (ret << inode->i_blkbits);
 794         if (new)
 795                 set_buffer_new(bh_result);
 796         if (boundary)
 797                 set_buffer_boundary(bh_result);
 798         return 0;
 799
 800 }
 801
 802 #ifdef CONFIG_FS_DAX
 803 static int ext2_iomap_begin(struct inode *inode, loff_t offset, loff_t length,
 804                 unsigned flags, struct iomap *iomap)
 805 {
 806         unsigned int blkbits = inode->i_blkbits;
 807         unsigned long first_block = offset >> blkbits;
 808         unsigned long max_blocks = (length + (1 << blkbits) - 1) >> blkbits;
 809         bool new = false, boundary = false;
 810         u32 bno;
 811         int ret;
 812
 813         ret = ext2_get_blocks(inode, first_block, max_blocks,
 814                         &bno, &new, &boundary, flags & IOMAP_WRITE);
 815         if (ret < 0)
 816                 return ret;
 817
 818         iomap->flags = 0;
 819         iomap->bdev = inode->i_sb->s_bdev;
 820         iomap->offset = (u64)first_block << blkbits;
 821
 822         if (ret == 0) {
 823                 iomap->type = IOMAP_HOLE;
 824                 iomap->blkno = IOMAP_NULL_BLOCK;
 825                 iomap->length = 1 << blkbits;
 826         } else {
 827                 iomap->type = IOMAP_MAPPED;
 828                 iomap->blkno = (sector_t)bno << (blkbits - 9);
 829                 iomap->length = (u64)ret << blkbits;
 830                 iomap->flags |= IOMAP_F_MERGED;
 831         }
 832
 833         if (new)
 834                 iomap->flags |= IOMAP_F_NEW;
 835         return 0;
 836 }
 837
 838 static int
 839 ext2_iomap_end(struct inode *inode, loff_t offset, loff_t length,
 840                 ssize_t written, unsigned flags, struct iomap *iomap)
 841 {
 842         if (iomap->type == IOMAP_MAPPED &&
 843             written < length &&
 844             (flags & IOMAP_WRITE))
 845                 ext2_write_failed(inode->i_mapping, offset + length);
 846         return 0;
 847 }
 848
 849 struct iomap_ops ext2_iomap_ops = {
 850         .iomap_begin            = ext2_iomap_begin,
 851         .iomap_end              = ext2_iomap_end,
 852 };
 853 #else
 854 /* Define empty ops for !CONFIG_FS_DAX case to avoid ugly ifdefs */
 855 struct iomap_ops ext2_iomap_ops;
 856 #endif /* CONFIG_FS_DAX */
 857
 858 int ext2_fiemap(struct inode *inode, struct fiemap_extent_info *fieinfo,
 859                 u64 start, u64 len)
 860 {
 861         return generic_block_fiemap(inode, fieinfo, start, len,
 862                                     ext2_get_block);
 863 }
 864
 865 static int ext2_writepage(struct page *page, struct writeback_control *wbc)
 866 {
 867         return block_write_full_page(page, ext2_get_block, wbc);
 868 }
 869
 870 static int ext2_readpage(struct file *file, struct page *page)
 871 {
 872         return mpage_readpage(page, ext2_get_block);
 873 }
 874
 875 static int
 876 ext2_readpages(struct file *file, struct address_space *mapping,
 877                 struct list_head *pages, unsigned nr_pages)
 878 {
 879         return mpage_readpages(mapping, pages, nr_pages, ext2_get_block);
 880 }
 881
 882 static int
 883 ext2_write_begin(struct file *file, struct address_space *mapping,
 884                 loff_t pos, unsigned len, unsigned flags,
 885                 struct page **pagep, void **fsdata)
 886 {
 887         int ret;
 888
 889         ret = block_write_begin(mapping, pos, len, flags, pagep,
 890                                 ext2_get_block);
 891         if (ret < 0)
 892                 ext2_write_failed(mapping, pos + len);
 893         return ret;
 894 }
 895
 896 static int ext2_write_end(struct file *file, struct address_space *mapping,
 897                         loff_t pos, unsigned len, unsigned copied,
 898                         struct page *page, void *fsdata)
 899 {
 900         int ret;
 901
 902         ret = generic_write_end(file, mapping, pos, len, copied, page, fsdata);
 903         if (ret < len)
 904                 ext2_write_failed(mapping, pos + len);
 905         return ret;
 906 }
 907
 908 static int
 909 ext2_nobh_write_begin(struct file *file, struct address_space *mapping,
 910                 loff_t pos, unsigned len, unsigned flags,
 911                 struct page **pagep, void **fsdata)
 912 {
 913         int ret;
 914
 915         ret = nobh_write_begin(mapping, pos, len, flags, pagep, fsdata,
 916                                ext2_get_block);
 917         if (ret < 0)
 918                 ext2_write_failed(mapping, pos + len);
 919         return ret;
 920 }
 921
 922 static int ext2_nobh_writepage(struct page *page,
 923                         struct writeback_control *wbc)
 924 {
 925         return nobh_writepage(page, ext2_get_block, wbc);
 926 }
 927
 928 static sector_t ext2_bmap(struct address_space *mapping, sector_t block)
 929 {
 930         return generic_block_bmap(mapping,block,ext2_get_block);
 931 }
 932
 933 static ssize_t
 934 ext2_direct_IO(struct kiocb *iocb, struct iov_iter *iter)
 935 {
 936         struct file *file = iocb->ki_filp;
 937         struct address_space *mapping = file->f_mapping;
 938         struct inode *inode = mapping->host;
 939         size_t count = iov_iter_count(iter);
 940         loff_t offset = iocb->ki_pos;
 941         ssize_t ret;
 942
 943         if (WARN_ON_ONCE(IS_DAX(inode)))
 944                 return -EIO;
 945
 946         ret = blockdev_direct_IO(iocb, inode, iter, ext2_get_block);
 947         if (ret < 0 && iov_iter_rw(iter) == WRITE)
 948                 ext2_write_failed(mapping, offset + count);
 949         return ret;
 950 }
 951
 952 static int
 953 ext2_writepages(struct address_space *mapping, struct writeback_control *wbc)
 954 {
 955 #ifdef CONFIG_FS_DAX
 956         if (dax_mapping(mapping)) {
 957                 return dax_writeback_mapping_range(mapping,
 958                                                    mapping->host->i_sb->s_bdev,
 959                                                    wbc);
 960         }
 961 #endif
 962
 963         return mpage_writepages(mapping, wbc, ext2_get_block);
 964 }
 965
 966 const struct address_space_operations ext2_aops = {
 967         .readpage               = ext2_readpage,
 968         .readpages              = ext2_readpages,
 969         .writepage              = ext2_writepage,
 970         .write_begin            = ext2_write_begin,
 971         .write_end              = ext2_write_end,
 972         .bmap                   = ext2_bmap,
 973         .direct_IO              = ext2_direct_IO,
 974         .writepages             = ext2_writepages,
 975         .migratepage            = buffer_migrate_page,
 976         .is_partially_uptodate  = block_is_partially_uptodate,
 977         .error_remove_page      = generic_error_remove_page,
 978 };
 979
 980 const struct address_space_operations ext2_nobh_aops = {
 981         .readpage               = ext2_readpage,
 982         .readpages              = ext2_readpages,
 983         .writepage              = ext2_nobh_writepage,
 984         .write_begin            = ext2_nobh_write_begin,
 985         .write_end              = nobh_write_end,
 986         .bmap                   = ext2_bmap,
 987         .direct_IO              = ext2_direct_IO,
 988         .writepages             = ext2_writepages,
 989         .migratepage            = buffer_migrate_page,
 990         .error_remove_page      = generic_error_remove_page,
 991 };
 992
 993 /*
 994  * Probably it should be a library function... search for first non-zero word
 995  * or memcmp with zero_page, whatever is better for particular architecture.
 996  * Linus?
 997  */
 998 static inline int all_zeroes(__le32 *p, __le32 *q)
 999 {
1000         while (p < q)
1001                 if (*p++)
1002                         return 0;
1003         return 1;
1004 }
1005
1006 /**
1007  *      ext2_find_shared - find the indirect blocks for partial truncation.
1008  *      @inode:   inode in question
1009  *      @depth:   depth of the affected branch
1010  *      @offsets: offsets of pointers in that branch (see ext2_block_to_path)
1011  *      @chain:   place to store the pointers to partial indirect blocks
1012  *      @top:     place to the (detached) top of branch
1013  *
1014  *      This is a helper function used by ext2_truncate().
1015  *
1016  *      When we do truncate() we may have to clean the ends of several indirect
1017  *      blocks but leave the blocks themselves alive. Block is partially
1018  *      truncated if some data below the new i_size is referred from it (and
1019  *      it is on the path to the first completely truncated data block, indeed).
1020  *      We have to free the top of that path along with everything to the right
1021  *      of the path. Since no allocation past the truncation point is possible
1022  *      until ext2_truncate() finishes, we may safely do the latter, but top
1023  *      of branch may require special attention - pageout below the truncation
1024  *      point might try to populate it.
1025  *
1026  *      We atomically detach the top of branch from the tree, store the block
1027  *      number of its root in *@top, pointers to buffer_heads of partially
1028  *      truncated blocks - in @chain[].bh and pointers to their last elements
1029  *      that should not be removed - in @chain[].p. Return value is the pointer
1030  *      to last filled element of @chain.
1031  *
1032  *      The work left to caller to do the actual freeing of subtrees:
1033  *              a) free the subtree starting from *@top
1034  *              b) free the subtrees whose roots are stored in
1035  *                      (@chain[i].p+1 .. end of @chain[i].bh->b_data)
1036  *              c) free the subtrees growing from the inode past the @chain[0].p
1037  *                      (no partially truncated stuff there).
1038  */
1039
1040 static Indirect *ext2_find_shared(struct inode *inode,
1041                                 int depth,
1042                                 int offsets[4],
1043                                 Indirect chain[4],
1044                                 __le32 *top)
1045 {
1046         Indirect *partial, *p;
1047         int k, err;
1048
1049         *top = 0;
1050         for (k = depth; k > 1 && !offsets[k-1]; k--)
1051                 ;
1052         partial = ext2_get_branch(inode, k, offsets, chain, &err);
1053         if (!partial)
1054                 partial = chain + k-1;
1055         /*
1056          * If the branch acquired continuation since we've looked at it -
1057          * fine, it should all survive and (new) top doesn't belong to us.
1058          */
1059         write_lock(&EXT2_I(inode)->i_meta_lock);
1060         if (!partial->key && *partial->p) {
1061                 write_unlock(&EXT2_I(inode)->i_meta_lock);
1062                 goto no_top;
1063         }
1064         for (p=partial; p>chain && all_zeroes((__le32*)p->bh->b_data,p->p); p--)
1065                 ;
1066         /*
1067          * OK, we've found the last block that must survive. The rest of our
1068          * branch should be detached before unlocking. However, if that rest
1069          * of branch is all ours and does not grow immediately from the inode
1070          * it's easier to cheat and just decrement partial->p.
1071          */
1072         if (p == chain + k - 1 && p > chain) {
1073                 p->p--;
1074         } else {
1075                 *top = *p->p;
1076                 *p->p = 0;
1077         }
1078         write_unlock(&EXT2_I(inode)->i_meta_lock);
1079
1080         while(partial > p)
1081         {
1082                 brelse(partial->bh);
1083                 partial--;
1084         }
1085 no_top:
1086         return partial;
1087 }
1088
1089 /**
1090  *      ext2_free_data - free a list of data blocks
1091  *      @inode: inode we are dealing with
1092  *      @p:     array of block numbers
1093  *      @q:     points immediately past the end of array
1094  *
1095  *      We are freeing all blocks referred from that array (numbers are
1096  *      stored as little-endian 32-bit) and updating @inode->i_blocks
1097  *      appropriately.
1098  */
1099 static inline void ext2_free_data(struct inode *inode, __le32 *p, __le32 *q)
1100 {
1101         unsigned long block_to_free = 0, count = 0;
1102         unsigned long nr;
1103
1104         for ( ; p < q ; p++) {
1105                 nr = le32_to_cpu(*p);
1106                 if (nr) {
1107                         *p = 0;
1108                         /* accumulate blocks to free if they're contiguous */
1109                         if (count == 0)
1110                                 goto free_this;
1111                         else if (block_to_free == nr - count)
1112                                 count++;
1113                         else {
1114                                 ext2_free_blocks (inode, block_to_free, count);
1115                                 mark_inode_dirty(inode);
1116                         free_this:
1117                                 block_to_free = nr;
1118                                 count = 1;
1119                         }
1120                 }
1121         }
1122         if (count > 0) {
1123                 ext2_free_blocks (inode, block_to_free, count);
1124                 mark_inode_dirty(inode);
1125         }
1126 }
1127
1128 /**
1129  *      ext2_free_branches - free an array of branches
1130  *      @inode: inode we are dealing with
1131  *      @p:     array of block numbers
1132  *      @q:     pointer immediately past the end of array
1133  *      @depth: depth of the branches to free
1134  *
1135  *      We are freeing all blocks referred from these branches (numbers are
1136  *      stored as little-endian 32-bit) and updating @inode->i_blocks
1137  *      appropriately.
1138  */
1139 static void ext2_free_branches(struct inode *inode, __le32 *p, __le32 *q, int depth)
1140 {
1141         struct buffer_head * bh;
1142         unsigned long nr;
1143
1144         if (depth--) {
1145                 int addr_per_block = EXT2_ADDR_PER_BLOCK(inode->i_sb);
1146                 for ( ; p < q ; p++) {
1147                         nr = le32_to_cpu(*p);
1148                         if (!nr)
1149                                 continue;
1150                         *p = 0;
1151                         bh = sb_bread(inode->i_sb, nr);
1152                         /*
1153                          * A read failure? Report error and clear slot
1154                          * (should be rare).
1155                          */
1156                         if (!bh) {
1157                                 ext2_error(inode->i_sb, "ext2_free_branches",
1158                                         "Read failure, inode=%ld, block=%ld",
1159                                         inode->i_ino, nr);
1160                                 continue;
1161                         }
1162                         ext2_free_branches(inode,
1163                                            (__le32*)bh->b_data,
1164                                            (__le32*)bh->b_data + addr_per_block,
1165                                            depth);
1166                         bforget(bh);
1167                         ext2_free_blocks(inode, nr, 1);
1168                         mark_inode_dirty(inode);
1169                 }
1170         } else
1171                 ext2_free_data(inode, p, q);
1172 }
1173
1174 /* dax_sem must be held when calling this function */
1175 static void __ext2_truncate_blocks(struct inode *inode, loff_t offset)
1176 {
1177         __le32 *i_data = EXT2_I(inode)->i_data;
1178         struct ext2_inode_info *ei = EXT2_I(inode);
1179         int addr_per_block = EXT2_ADDR_PER_BLOCK(inode->i_sb);
1180         int offsets[4];
1181         Indirect chain[4];
1182         Indirect *partial;
1183         __le32 nr = 0;
1184         int n;
1185         long iblock;
1186         unsigned blocksize;
1187         blocksize = inode->i_sb->s_blocksize;
1188         iblock = (offset + blocksize-1) >> EXT2_BLOCK_SIZE_BITS(inode->i_sb);
1189
1190 #ifdef CONFIG_FS_DAX
1191         WARN_ON(!rwsem_is_locked(&ei->dax_sem));
1192 #endif
1193
1194         n = ext2_block_to_path(inode, iblock, offsets, NULL);
1195         if (n == 0)
1196                 return;
1197
1198         /*
1199          * From here we block out all ext2_get_block() callers who want to
1200          * modify the block allocation tree.
1201          */
1202         mutex_lock(&ei->truncate_mutex);
1203
1204         if (n == 1) {
1205                 ext2_free_data(inode, i_data+offsets[0],
1206                                         i_data + EXT2_NDIR_BLOCKS);
1207                 goto do_indirects;
1208         }
1209
1210         partial = ext2_find_shared(inode, n, offsets, chain, &nr);
1211         /* Kill the top of shared branch (already detached) */
1212         if (nr) {
1213                 if (partial == chain)
1214                         mark_inode_dirty(inode);
1215                 else
1216                         mark_buffer_dirty_inode(partial->bh, inode);
1217                 ext2_free_branches(inode, &nr, &nr+1, (chain+n-1) - partial);
1218         }
1219         /* Clear the ends of indirect blocks on the shared branch */
1220         while (partial > chain) {
1221                 ext2_free_branches(inode,
1222                                    partial->p + 1,
1223                                    (__le32*)partial->bh->b_data+addr_per_block,
1224                                    (chain+n-1) - partial);
1225                 mark_buffer_dirty_inode(partial->bh, inode);
1226                 brelse (partial->bh);
1227                 partial--;
1228         }
1229 do_indirects:
1230         /* Kill the remaining (whole) subtrees */
1231         switch (offsets[0]) {
1232                 default:
1233                         nr = i_data[EXT2_IND_BLOCK];
1234                         if (nr) {
1235                                 i_data[EXT2_IND_BLOCK] = 0;
1236                                 mark_inode_dirty(inode);
1237                                 ext2_free_branches(inode, &nr, &nr+1, 1);
1238                         }
1239                 case EXT2_IND_BLOCK:
1240                         nr = i_data[EXT2_DIND_BLOCK];
1241                         if (nr) {
1242                                 i_data[EXT2_DIND_BLOCK] = 0;
1243                                 mark_inode_dirty(inode);
1244                                 ext2_free_branches(inode, &nr, &nr+1, 2);
1245                         }
1246                 case EXT2_DIND_BLOCK:
1247                         nr = i_data[EXT2_TIND_BLOCK];
1248                         if (nr) {
1249                                 i_data[EXT2_TIND_BLOCK] = 0;
1250                                 mark_inode_dirty(inode);
1251                                 ext2_free_branches(inode, &nr, &nr+1, 3);
1252                         }
1253                 case EXT2_TIND_BLOCK:
1254                         ;
1255         }
1256
1257         ext2_discard_reservation(inode);
1258
1259         mutex_unlock(&ei->truncate_mutex);
1260 }
1261
1262 static void ext2_truncate_blocks(struct inode *inode, loff_t offset)
1263 {
1264         /*
1265          * XXX: it seems like a bug here that we don't allow
1266          * IS_APPEND inode to have blocks-past-i_size trimmed off.
1267          * review and fix this.
1268          *
1269          * Also would be nice to be able to handle IO errors and such,
1270          * but that's probably too much to ask.
1271          */
1272         if (!(S_ISREG(inode->i_mode) || S_ISDIR(inode->i_mode) ||
1273             S_ISLNK(inode->i_mode)))
1274                 return;
1275         if (ext2_inode_is_fast_symlink(inode))
1276                 return;
1277         if (IS_APPEND(inode) || IS_IMMUTABLE(inode))
1278                 return;
1279
1280         dax_sem_down_write(EXT2_I(inode));
1281         __ext2_truncate_blocks(inode, offset);
1282         dax_sem_up_write(EXT2_I(inode));
1283 }
1284
1285 static int ext2_setsize(struct inode *inode, loff_t newsize)
1286 {
1287         int error;
1288
1289         if (!(S_ISREG(inode->i_mode) || S_ISDIR(inode->i_mode) ||
1290             S_ISLNK(inode->i_mode)))
1291                 return -EINVAL;
1292         if (ext2_inode_is_fast_symlink(inode))
1293                 return -EINVAL;
1294         if (IS_APPEND(inode) || IS_IMMUTABLE(inode))
1295                 return -EPERM;
1296
1297         inode_dio_wait(inode);
1298
1299         if (IS_DAX(inode)) {
1300                 error = iomap_zero_range(inode, newsize,
1301                                          PAGE_ALIGN(newsize) - newsize, NULL,
1302                                          &ext2_iomap_ops);
1303         } else if (test_opt(inode->i_sb, NOBH))
1304                 error = nobh_truncate_page(inode->i_mapping,
1305                                 newsize, ext2_get_block);
1306         else
1307                 error = block_truncate_page(inode->i_mapping,
1308                                 newsize, ext2_get_block);
1309         if (error)
1310                 return error;
1311
1312         dax_sem_down_write(EXT2_I(inode));
1313         truncate_setsize(inode, newsize);
1314         __ext2_truncate_blocks(inode, newsize);
1315         dax_sem_up_write(EXT2_I(inode));
1316
1317         inode->i_mtime = inode->i_ctime = current_time(inode);
1318         if (inode_needs_sync(inode)) {
1319                 sync_mapping_buffers(inode->i_mapping);
1320                 sync_inode_metadata(inode, 1);
1321         } else {
1322                 mark_inode_dirty(inode);
1323         }
1324
1325         return 0;
1326 }
1327
1328 static struct ext2_inode *ext2_get_inode(struct super_block *sb, ino_t ino,
1329                                         struct buffer_head **p)
1330 {
1331         struct buffer_head * bh;
1332         unsigned long block_group;
1333         unsigned long block;
1334         unsigned long offset;
1335         struct ext2_group_desc * gdp;
1336
1337         *p = NULL;
1338         if ((ino != EXT2_ROOT_INO && ino < EXT2_FIRST_INO(sb)) ||
1339             ino > le32_to_cpu(EXT2_SB(sb)->s_es->s_inodes_count))
1340                 goto Einval;
1341
1342         block_group = (ino - 1) / EXT2_INODES_PER_GROUP(sb);
1343         gdp = ext2_get_group_desc(sb, block_group, NULL);
1344         if (!gdp)
1345                 goto Egdp;
1346         /*
1347          * Figure out the offset within the block group inode table
1348          */
1349         offset = ((ino - 1) % EXT2_INODES_PER_GROUP(sb)) * EXT2_INODE_SIZE(sb);
1350         block = le32_to_cpu(gdp->bg_inode_table) +
1351                 (offset >> EXT2_BLOCK_SIZE_BITS(sb));
1352         if (!(bh = sb_bread(sb, block)))
1353                 goto Eio;
1354
1355         *p = bh;
1356         offset &= (EXT2_BLOCK_SIZE(sb) - 1);
1357         return (struct ext2_inode *) (bh->b_data + offset);
1358
1359 Einval:
1360         ext2_error(sb, "ext2_get_inode", "bad inode number: %lu",
1361                    (unsigned long) ino);
1362         return ERR_PTR(-EINVAL);
1363 Eio:
1364         ext2_error(sb, "ext2_get_inode",
1365                    "unable to read inode block - inode=%lu, block=%lu",
1366                    (unsigned long) ino, block);
1367 Egdp:
1368         return ERR_PTR(-EIO);
1369 }
1370
1371 void ext2_set_inode_flags(struct inode *inode)
1372 {
1373         unsigned int flags = EXT2_I(inode)->i_flags;
1374
1375         inode->i_flags &= ~(S_SYNC | S_APPEND | S_IMMUTABLE | S_NOATIME |
1376                                 S_DIRSYNC | S_DAX);
1377         if (flags & EXT2_SYNC_FL)
1378                 inode->i_flags |= S_SYNC;
1379         if (flags & EXT2_APPEND_FL)
1380                 inode->i_flags |= S_APPEND;
1381         if (flags & EXT2_IMMUTABLE_FL)
1382                 inode->i_flags |= S_IMMUTABLE;
1383         if (flags & EXT2_NOATIME_FL)
1384                 inode->i_flags |= S_NOATIME;
1385         if (flags & EXT2_DIRSYNC_FL)
1386                 inode->i_flags |= S_DIRSYNC;
1387         if (test_opt(inode->i_sb, DAX) && S_ISREG(inode->i_mode))
1388                 inode->i_flags |= S_DAX;
1389 }
1390
1391 /* Propagate flags from i_flags to EXT2_I(inode)->i_flags */
1392 void ext2_get_inode_flags(struct ext2_inode_info *ei)
1393 {
1394         unsigned int flags = ei->vfs_inode.i_flags;
1395
1396         ei->i_flags &= ~(EXT2_SYNC_FL|EXT2_APPEND_FL|
1397                         EXT2_IMMUTABLE_FL|EXT2_NOATIME_FL|EXT2_DIRSYNC_FL);
1398         if (flags & S_SYNC)
1399                 ei->i_flags |= EXT2_SYNC_FL;
1400         if (flags & S_APPEND)
1401                 ei->i_flags |= EXT2_APPEND_FL;
1402         if (flags & S_IMMUTABLE)
1403                 ei->i_flags |= EXT2_IMMUTABLE_FL;
1404         if (flags & S_NOATIME)
1405                 ei->i_flags |= EXT2_NOATIME_FL;
1406         if (flags & S_DIRSYNC)
1407                 ei->i_flags |= EXT2_DIRSYNC_FL;
1408 }
1409
1410 struct inode *ext2_iget (struct super_block *sb, unsigned long ino)
1411 {
1412         struct ext2_inode_info *ei;
1413         struct buffer_head * bh;
1414         struct ext2_inode *raw_inode;
1415         struct inode *inode;
1416         long ret = -EIO;
1417         int n;
1418         uid_t i_uid;
1419         gid_t i_gid;
1420
1421         inode = iget_locked(sb, ino);
1422         if (!inode)
1423                 return ERR_PTR(-ENOMEM);
1424         if (!(inode->i_state & I_NEW))
1425                 return inode;
1426
1427         ei = EXT2_I(inode);
1428         ei->i_block_alloc_info = NULL;
1429
1430         raw_inode = ext2_get_inode(inode->i_sb, ino, &bh);
1431         if (IS_ERR(raw_inode)) {
1432                 ret = PTR_ERR(raw_inode);
1433                 goto bad_inode;
1434         }
1435
1436         inode->i_mode = le16_to_cpu(raw_inode->i_mode);
1437         i_uid = (uid_t)le16_to_cpu(raw_inode->i_uid_low);
1438         i_gid = (gid_t)le16_to_cpu(raw_inode->i_gid_low);
1439         if (!(test_opt (inode->i_sb, NO_UID32))) {
1440                 i_uid |= le16_to_cpu(raw_inode->i_uid_high) << 16;
1441                 i_gid |= le16_to_cpu(raw_inode->i_gid_high) << 16;
1442         }
1443         i_uid_write(inode, i_uid);
1444         i_gid_write(inode, i_gid);
1445         set_nlink(inode, le16_to_cpu(raw_inode->i_links_count));
1446         inode->i_size = le32_to_cpu(raw_inode->i_size);
1447         inode->i_atime.tv_sec = (signed)le32_to_cpu(raw_inode->i_atime);
1448         inode->i_ctime.tv_sec = (signed)le32_to_cpu(raw_inode->i_ctime);
1449         inode->i_mtime.tv_sec = (signed)le32_to_cpu(raw_inode->i_mtime);
1450         inode->i_atime.tv_nsec = inode->i_mtime.tv_nsec = inode->i_ctime.tv_nsec = 0;
1451         ei->i_dtime = le32_to_cpu(raw_inode->i_dtime);
1452         /* We now have enough fields to check if the inode was active or not.
1453          * This is needed because nfsd might try to access dead inodes
1454          * the test is that same one that e2fsck uses
1455          * NeilBrown 1999oct15
1456          */
1457         if (inode->i_nlink == 0 && (inode->i_mode == 0 || ei->i_dtime)) {
1458                 /* this inode is deleted */
1459                 brelse (bh);
1460                 ret = -ESTALE;
1461                 goto bad_inode;
1462         }
1463         inode->i_blocks = le32_to_cpu(raw_inode->i_blocks);
1464         ei->i_flags = le32_to_cpu(raw_inode->i_flags);
1465         ei->i_faddr = le32_to_cpu(raw_inode->i_faddr);
1466         ei->i_frag_no = raw_inode->i_frag;
1467         ei->i_frag_size = raw_inode->i_fsize;
1468         ei->i_file_acl = le32_to_cpu(raw_inode->i_file_acl);
1469         ei->i_dir_acl = 0;
1470
1471         if (ei->i_file_acl &&
1472             !ext2_data_block_valid(EXT2_SB(sb), ei->i_file_acl, 1)) {
1473                 ext2_error(sb, "ext2_iget", "bad extended attribute block %u",
1474                            ei->i_file_acl);
1475                 brelse(bh);
1476                 ret = -EFSCORRUPTED;
1477                 goto bad_inode;
1478         }
1479
1480         if (S_ISREG(inode->i_mode))
1481                 inode->i_size |= ((__u64)le32_to_cpu(raw_inode->i_size_high)) << 32;
1482         else
1483                 ei->i_dir_acl = le32_to_cpu(raw_inode->i_dir_acl);
1484         ei->i_dtime = 0;
1485         inode->i_generation = le32_to_cpu(raw_inode->i_generation);
1486         ei->i_state = 0;
1487         ei->i_block_group = (ino - 1) / EXT2_INODES_PER_GROUP(inode->i_sb);
1488         ei->i_dir_start_lookup = 0;
1489
1490         /*
1491          * NOTE! The in-memory inode i_data array is in little-endian order
1492          * even on big-endian machines: we do NOT byteswap the block numbers!
1493          */
1494         for (n = 0; n < EXT2_N_BLOCKS; n++)
1495                 ei->i_data[n] = raw_inode->i_block[n];
1496
1497         if (S_ISREG(inode->i_mode)) {
1498                 inode->i_op = &ext2_file_inode_operations;
1499                 if (test_opt(inode->i_sb, NOBH)) {
1500                         inode->i_mapping->a_ops = &ext2_nobh_aops;
1501                         inode->i_fop = &ext2_file_operations;
1502                 } else {
1503                         inode->i_mapping->a_ops = &ext2_aops;
1504                         inode->i_fop = &ext2_file_operations;
1505                 }
1506         } else if (S_ISDIR(inode->i_mode)) {
1507                 inode->i_op = &ext2_dir_inode_operations;
1508                 inode->i_fop = &ext2_dir_operations;
1509                 if (test_opt(inode->i_sb, NOBH))
1510                         inode->i_mapping->a_ops = &ext2_nobh_aops;
1511                 else
1512                         inode->i_mapping->a_ops = &ext2_aops;
1513         } else if (S_ISLNK(inode->i_mode)) {
1514                 if (ext2_inode_is_fast_symlink(inode)) {
1515                         inode->i_link = (char *)ei->i_data;
1516                         inode->i_op = &ext2_fast_symlink_inode_operations;
1517                         nd_terminate_link(ei->i_data, inode->i_size,
1518                                 sizeof(ei->i_data) - 1);
1519                 } else {
1520                         inode->i_op = &ext2_symlink_inode_operations;
1521                         inode_nohighmem(inode);
1522                         if (test_opt(inode->i_sb, NOBH))
1523                                 inode->i_mapping->a_ops = &ext2_nobh_aops;
1524                         else
1525                                 inode->i_mapping->a_ops = &ext2_aops;
1526                 }
1527         } else {
1528                 inode->i_op = &ext2_special_inode_operations;
1529                 if (raw_inode->i_block[0])
1530                         init_special_inode(inode, inode->i_mode,
1531                            old_decode_dev(le32_to_cpu(raw_inode->i_block[0])));
1532                 else
1533                         init_special_inode(inode, inode->i_mode,
1534                            new_decode_dev(le32_to_cpu(raw_inode->i_block[1])));
1535         }
1536         brelse (bh);
1537         ext2_set_inode_flags(inode);
1538         unlock_new_inode(inode);
1539         return inode;
1540
1541 bad_inode:
1542         iget_failed(inode);
1543         return ERR_PTR(ret);
1544 }
1545
1546 static int __ext2_write_inode(struct inode *inode, int do_sync)
1547 {
1548         struct ext2_inode_info *ei = EXT2_I(inode);
1549         struct super_block *sb = inode->i_sb;
1550         ino_t ino = inode->i_ino;
1551         uid_t uid = i_uid_read(inode);
1552         gid_t gid = i_gid_read(inode);
1553         struct buffer_head * bh;
1554         struct ext2_inode * raw_inode = ext2_get_inode(sb, ino, &bh);
1555         int n;
1556         int err = 0;
1557
1558         if (IS_ERR(raw_inode))
1559                 return -EIO;
1560
1561         /* For fields not not tracking in the in-memory inode,
1562          * initialise them to zero for new inodes. */
1563         if (ei->i_state & EXT2_STATE_NEW)
1564                 memset(raw_inode, 0, EXT2_SB(sb)->s_inode_size);
1565
1566         ext2_get_inode_flags(ei);
1567         raw_inode->i_mode = cpu_to_le16(inode->i_mode);
1568         if (!(test_opt(sb, NO_UID32))) {
1569                 raw_inode->i_uid_low = cpu_to_le16(low_16_bits(uid));
1570                 raw_inode->i_gid_low = cpu_to_le16(low_16_bits(gid));
1571 /*
1572  * Fix up interoperability with old kernels. Otherwise, old inodes get
1573  * re-used with the upper 16 bits of the uid/gid intact
1574  */
1575                 if (!ei->i_dtime) {
1576                         raw_inode->i_uid_high = cpu_to_le16(high_16_bits(uid));
1577                         raw_inode->i_gid_high = cpu_to_le16(high_16_bits(gid));
1578                 } else {
1579                         raw_inode->i_uid_high = 0;
1580                         raw_inode->i_gid_high = 0;
1581                 }
1582         } else {
1583                 raw_inode->i_uid_low = cpu_to_le16(fs_high2lowuid(uid));
1584                 raw_inode->i_gid_low = cpu_to_le16(fs_high2lowgid(gid));
1585                 raw_inode->i_uid_high = 0;
1586                 raw_inode->i_gid_high = 0;
1587         }
1588         raw_inode->i_links_count = cpu_to_le16(inode->i_nlink);
1589         raw_inode->i_size = cpu_to_le32(inode->i_size);
1590         raw_inode->i_atime = cpu_to_le32(inode->i_atime.tv_sec);
1591         raw_inode->i_ctime = cpu_to_le32(inode->i_ctime.tv_sec);
1592         raw_inode->i_mtime = cpu_to_le32(inode->i_mtime.tv_sec);
1593
1594         raw_inode->i_blocks = cpu_to_le32(inode->i_blocks);
1595         raw_inode->i_dtime = cpu_to_le32(ei->i_dtime);
1596         raw_inode->i_flags = cpu_to_le32(ei->i_flags);
1597         raw_inode->i_faddr = cpu_to_le32(ei->i_faddr);
1598         raw_inode->i_frag = ei->i_frag_no;
1599         raw_inode->i_fsize = ei->i_frag_size;
1600         raw_inode->i_file_acl = cpu_to_le32(ei->i_file_acl);
1601         if (!S_ISREG(inode->i_mode))
1602                 raw_inode->i_dir_acl = cpu_to_le32(ei->i_dir_acl);
1603         else {
1604                 raw_inode->i_size_high = cpu_to_le32(inode->i_size >> 32);
1605                 if (inode->i_size > 0x7fffffffULL) {
1606                         if (!EXT2_HAS_RO_COMPAT_FEATURE(sb,
1607                                         EXT2_FEATURE_RO_COMPAT_LARGE_FILE) ||
1608                             EXT2_SB(sb)->s_es->s_rev_level ==
1609                                         cpu_to_le32(EXT2_GOOD_OLD_REV)) {
1610                                /* If this is the first large file
1611                                 * created, add a flag to the superblock.
1612                                 */
1613                                 spin_lock(&EXT2_SB(sb)->s_lock);
1614                                 ext2_update_dynamic_rev(sb);
1615                                 EXT2_SET_RO_COMPAT_FEATURE(sb,
1616                                         EXT2_FEATURE_RO_COMPAT_LARGE_FILE);
1617                                 spin_unlock(&EXT2_SB(sb)->s_lock);
1618                                 ext2_write_super(sb);
1619                         }
1620                 }
1621         }
1622
1623         raw_inode->i_generation = cpu_to_le32(inode->i_generation);
1624         if (S_ISCHR(inode->i_mode) || S_ISBLK(inode->i_mode)) {
1625                 if (old_valid_dev(inode->i_rdev)) {
1626                         raw_inode->i_block[0] =
1627                                 cpu_to_le32(old_encode_dev(inode->i_rdev));
1628                         raw_inode->i_block[1] = 0;
1629                 } else {
1630                         raw_inode->i_block[0] = 0;
1631                         raw_inode->i_block[1] =
1632                                 cpu_to_le32(new_encode_dev(inode->i_rdev));
1633                         raw_inode->i_block[2] = 0;
1634                 }
1635         } else for (n = 0; n < EXT2_N_BLOCKS; n++)
1636                 raw_inode->i_block[n] = ei->i_data[n];
1637         mark_buffer_dirty(bh);
1638         if (do_sync) {
1639                 sync_dirty_buffer(bh);
1640                 if (buffer_req(bh) && !buffer_uptodate(bh)) {
1641                         printk ("IO error syncing ext2 inode [%s:%08lx]\n",
1642                                 sb->s_id, (unsigned long) ino);
1643                         err = -EIO;
1644                 }
1645         }
1646         ei->i_state &= ~EXT2_STATE_NEW;
1647         brelse (bh);
1648         return err;
1649 }
1650
1651 int ext2_write_inode(struct inode *inode, struct writeback_control *wbc)
1652 {
1653         return __ext2_write_inode(inode, wbc->sync_mode == WB_SYNC_ALL);
1654 }
1655
1656 int ext2_setattr(struct dentry *dentry, struct iattr *iattr)
1657 {
1658         struct inode *inode = d_inode(dentry);
1659         int error;
1660
1661         error = setattr_prepare(dentry, iattr);
1662         if (error)
1663                 return error;
1664
1665         if (is_quota_modification(inode, iattr)) {
1666                 error = dquot_initialize(inode);
1667                 if (error)
1668                         return error;
1669         }
1670         if ((iattr->ia_valid & ATTR_UID && !uid_eq(iattr->ia_uid, inode->i_uid)) ||
1671             (iattr->ia_valid & ATTR_GID && !gid_eq(iattr->ia_gid, inode->i_gid))) {
1672                 error = dquot_transfer(inode, iattr);
1673                 if (error)
1674                         return error;
1675         }
1676         if (iattr->ia_valid & ATTR_SIZE && iattr->ia_size != inode->i_size) {
1677                 error = ext2_setsize(inode, iattr->ia_size);
1678                 if (error)
1679                         return error;
1680         }
1681         setattr_copy(inode, iattr);
1682         if (iattr->ia_valid & ATTR_MODE)
1683                 error = posix_acl_chmod(inode, inode->i_mode);
1684         mark_inode_dirty(inode);
1685
1686         return error;
1687 }