blob: 85449a6ddc564dfcba455febf406e0587210fce5 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
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
Linus Torvalds1da177e2005-04-16 15:20:36 -070025#include <linux/time.h>
26#include <linux/highuid.h>
27#include <linux/pagemap.h>
Matthew Wilcoxc94c2ac2015-09-08 14:58:40 -070028#include <linux/dax.h>
Matthew Wilcox3dc29162016-03-15 11:20:41 -060029#include <linux/blkdev.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070030#include <linux/quotaops.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070031#include <linux/writeback.h>
32#include <linux/buffer_head.h>
33#include <linux/mpage.h>
Josef Bacik68c9d702008-10-03 17:32:43 -040034#include <linux/fiemap.h>
Christoph Hellwig25f4e702016-09-19 11:30:29 +100035#include <linux/iomap.h>
Duane Griffin8d6d0c42008-12-19 20:47:13 +000036#include <linux/namei.h>
Christoph Hellwige2e40f22015-02-22 08:58:50 -080037#include <linux/uio.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070038#include "ext2.h"
39#include "acl.h"
Jan Karac288d292013-03-13 12:57:08 +010040#include "xattr.h"
Linus Torvalds1da177e2005-04-16 15:20:36 -070041
Christoph Hellwiga9185b42010-03-05 09:21:37 +010042static int __ext2_write_inode(struct inode *inode, int do_sync);
43
Linus Torvalds1da177e2005-04-16 15:20:36 -070044/*
45 * Test whether an inode is a fast symlink.
46 */
47static 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
npiggin@suse.de737f2e92010-05-27 01:05:37 +100056static void ext2_truncate_blocks(struct inode *inode, loff_t offset);
57
58static 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) {
Kirill A. Shutemov7caef262013-09-12 15:13:56 -070063 truncate_pagecache(inode, inode->i_size);
npiggin@suse.de737f2e92010-05-27 01:05:37 +100064 ext2_truncate_blocks(inode, inode->i_size);
65 }
66}
67
Linus Torvalds1da177e2005-04-16 15:20:36 -070068/*
Linus Torvalds1da177e2005-04-16 15:20:36 -070069 * Called at the last iput() if i_nlink is zero.
70 */
Al Viro72edc4d2010-06-04 23:32:28 -040071void ext2_evict_inode(struct inode * inode)
Linus Torvalds1da177e2005-04-16 15:20:36 -070072{
Al Viro72edc4d2010-06-04 23:32:28 -040073 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;
Christoph Hellwig871a2932010-03-03 09:05:07 -050078 dquot_initialize(inode);
Al Viro72edc4d2010-06-04 23:32:28 -040079 } else {
80 dquot_drop(inode);
81 }
82
Johannes Weiner91b0abe2014-04-03 14:47:49 -070083 truncate_inode_pages_final(&inode->i_data);
Mark Fashehfef26652005-09-09 13:01:31 -070084
Al Viro72edc4d2010-06-04 23:32:28 -040085 if (want_delete) {
Jan Kara1e8b2122012-06-12 16:20:46 +020086 sb_start_intwrite(inode->i_sb);
Al Viro72edc4d2010-06-04 23:32:28 -040087 /* 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);
Jan Karac288d292013-03-13 12:57:08 +010095 ext2_xattr_delete_inode(inode);
Al Viro72edc4d2010-06-04 23:32:28 -040096 }
Linus Torvalds1da177e2005-04-16 15:20:36 -070097
Al Viro72edc4d2010-06-04 23:32:28 -040098 invalidate_inode_buffers(inode);
Jan Karadbd57682012-05-03 14:48:02 +020099 clear_inode(inode);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700100
Al Viro72edc4d2010-06-04 23:32:28 -0400101 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
Jan Kara1e8b2122012-06-12 16:20:46 +0200107 if (want_delete) {
Al Viro72edc4d2010-06-04 23:32:28 -0400108 ext2_free_inode(inode);
Jan Kara1e8b2122012-06-12 16:20:46 +0200109 sb_end_intwrite(inode->i_sb);
110 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700111}
112
Linus Torvalds1da177e2005-04-16 15:20:36 -0700113typedef struct {
114 __le32 *p;
115 __le32 key;
116 struct buffer_head *bh;
117} Indirect;
118
119static 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
125static 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
162static 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) {
Alexey Fisher2314b072009-11-19 19:12:51 +0100174 ext2_msg(inode->i_sb, KERN_WARNING,
175 "warning: %s: block < 0", __func__);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700176 } 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 {
Alexey Fisher2314b072009-11-19 19:12:51 +0100195 ext2_msg(inode->i_sb, KERN_WARNING,
196 "warning: %s: block is too big", __func__);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700197 }
198 if (boundary)
Martin J. Bligha686cd82007-10-16 23:30:46 -0700199 *boundary = final - 1 - (i_block & (ptrs - 1));
200
Linus Torvalds1da177e2005-04-16 15:20:36 -0700201 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 */
233static 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
262changed:
263 read_unlock(&EXT2_I(inode)->i_meta_lock);
264 brelse(bh);
265 *err = -EAGAIN;
266 goto no_block;
267failure:
268 *err = -EIO;
269no_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 *
Benoit Boissinot1cc8dcf52008-04-21 22:45:55 +0000278 * This function returns the preferred place for block allocation.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700279 * 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
Akinobu Mita4c8b3122008-04-28 02:16:02 -0700293static ext2_fsblk_t ext2_find_near(struct inode *inode, Indirect *ind)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700294{
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;
Akinobu Mita4c8b3122008-04-28 02:16:02 -0700298 ext2_fsblk_t bg_start;
299 ext2_fsblk_t colour;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700300
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 /*
Lucas De Marchi25985ed2011-03-30 22:57:33 -0300311 * It is going to be referred from inode itself? OK, just put it into
Linus Torvalds1da177e2005-04-16 15:20:36 -0700312 * the same cylinder group then.
313 */
Akinobu Mita24097d12008-04-28 02:16:01 -0700314 bg_start = ext2_group_first_block_no(inode->i_sb, ei->i_block_group);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700315 colour = (current->pid % 16) *
316 (EXT2_BLOCKS_PER_GROUP(inode->i_sb) / 16);
317 return bg_start + colour;
318}
319
320/**
Benoit Boissinot1cc8dcf52008-04-21 22:45:55 +0000321 * ext2_find_goal - find a preferred place for allocation.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700322 * @inode: owner
323 * @block: block we want
Linus Torvalds1da177e2005-04-16 15:20:36 -0700324 * @partial: pointer to the last triple within a chain
Linus Torvalds1da177e2005-04-16 15:20:36 -0700325 *
Martin J. Bligha686cd82007-10-16 23:30:46 -0700326 * Returns preferred place for a block (the goal).
Linus Torvalds1da177e2005-04-16 15:20:36 -0700327 */
328
Akinobu Mita4c8b3122008-04-28 02:16:02 -0700329static inline ext2_fsblk_t ext2_find_goal(struct inode *inode, long block,
330 Indirect *partial)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700331{
Martin J. Bligha686cd82007-10-16 23:30:46 -0700332 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;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700343 }
Martin J. Bligha686cd82007-10-16 23:30:46 -0700344
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 */
360static int
361ext2_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 */
397static 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;
442failed_out:
443 for (i = 0; i <index; i++)
444 ext2_free_blocks(inode, new_blocks[i], 1);
Al Viroaddacc72010-07-22 01:19:42 +0400445 if (index)
446 mark_inode_dirty(inode);
Martin J. Bligha686cd82007-10-16 23:30:46 -0700447 return ret;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700448}
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
Namhyung Kim72b43572010-09-15 21:46:02 +0900464 * picture as after the successful ext2_get_block(), except that in one
Linus Torvalds1da177e2005-04-16 15:20:36 -0700465 * 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
475static int ext2_alloc_branch(struct inode *inode,
Martin J. Bligha686cd82007-10-16 23:30:46 -0700476 int indirect_blks, int *blks, ext2_fsblk_t goal,
477 int *offsets, Indirect *branch)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700478{
479 int blocksize = inode->i_sb->s_blocksize;
Martin J. Bligha686cd82007-10-16 23:30:46 -0700480 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;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700486
Martin J. Bligha686cd82007-10-16 23:30:46 -0700487 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++) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700497 /*
Martin J. Bligha686cd82007-10-16 23:30:46 -0700498 * Get buffer_head for parent block, zero it out
499 * and set the pointer to new one, then send
500 * parent to disk.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700501 */
Martin J. Bligha686cd82007-10-16 23:30:46 -0700502 bh = sb_getblk(inode->i_sb, new_blocks[n-1]);
Wang Shilong8d8759e2013-01-12 01:19:32 -0800503 if (unlikely(!bh)) {
504 err = -ENOMEM;
505 goto failed;
506 }
Martin J. Bligha686cd82007-10-16 23:30:46 -0700507 branch[n].bh = bh;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700508 lock_buffer(bh);
509 memset(bh->b_data, 0, blocksize);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700510 branch[n].p = (__le32 *) bh->b_data + offsets[n];
Martin J. Bligha686cd82007-10-16 23:30:46 -0700511 branch[n].key = cpu_to_le32(new_blocks[n]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700512 *branch[n].p = branch[n].key;
Martin J. Bligha686cd82007-10-16 23:30:46 -0700513 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 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700523 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).
Jan Karaa2a735a2009-08-18 17:54:11 +0200527 * But we now rely upon generic_write_sync()
Linus Torvalds1da177e2005-04-16 15:20:36 -0700528 * and b_inode_buffers. But not for directories.
529 */
530 if (S_ISDIR(inode->i_mode) && IS_DIRSYNC(inode))
531 sync_dirty_buffer(bh);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700532 }
Martin J. Bligha686cd82007-10-16 23:30:46 -0700533 *blks = num;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700534 return err;
Wang Shilong8d8759e2013-01-12 01:19:32 -0800535
536failed:
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;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700543}
544
545/**
Martin J. Bligha686cd82007-10-16 23:30:46 -0700546 * ext2_splice_branch - splice the allocated branch onto inode.
547 * @inode: owner
548 * @block: (logical) number of block we are adding
Martin J. Bligha686cd82007-10-16 23:30:46 -0700549 * @where: location of missing link
550 * @num: number of indirect blocks we are adding
551 * @blks: number of direct blocks we are adding
Linus Torvalds1da177e2005-04-16 15:20:36 -0700552 *
Martin J. Bligha686cd82007-10-16 23:30:46 -0700553 * 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.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700556 */
Martin J. Bligha686cd82007-10-16 23:30:46 -0700557static void ext2_splice_branch(struct inode *inode,
558 long block, Indirect *where, int num, int blks)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700559{
Linus Torvalds1da177e2005-04-16 15:20:36 -0700560 int i;
Martin J. Bligha686cd82007-10-16 23:30:46 -0700561 struct ext2_block_alloc_info *block_i;
562 ext2_fsblk_t current_block;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700563
Martin J. Bligha686cd82007-10-16 23:30:46 -0700564 block_i = EXT2_I(inode)->i_block_alloc_info;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700565
Martin J. Bligha686cd82007-10-16 23:30:46 -0700566 /* XXX LOCKING probably should have i_meta_lock ?*/
Linus Torvalds1da177e2005-04-16 15:20:36 -0700567 /* That's it */
568
569 *where->p = where->key;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700570
Martin J. Bligha686cd82007-10-16 23:30:46 -0700571 /*
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 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700591
592 /* We are done with atomic stuff, now do the rest of housekeeping */
593
Linus Torvalds1da177e2005-04-16 15:20:36 -0700594 /* had we spliced it onto indirect block? */
595 if (where->bh)
596 mark_buffer_dirty_inode(where->bh, inode);
597
Deepa Dinamani02027d42016-09-14 07:48:05 -0700598 inode->i_ctime = current_time(inode);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700599 mark_inode_dirty(inode);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700600}
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.
Martin J. Bligha686cd82007-10-16 23:30:46 -0700613 *
614 * `handle' can be NULL if create == 0.
615 *
Martin J. Bligha686cd82007-10-16 23:30:46 -0700616 * return > 0, # of blocks mapped or allocated.
617 * return = 0, if plain lookup failed.
618 * return < 0, error case.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700619 */
Martin J. Bligha686cd82007-10-16 23:30:46 -0700620static int ext2_get_blocks(struct inode *inode,
621 sector_t iblock, unsigned long maxblocks,
Christoph Hellwig6750ad72016-09-19 11:28:39 +1000622 u32 *bno, bool *new, bool *boundary,
Martin J. Bligha686cd82007-10-16 23:30:46 -0700623 int create)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700624{
Arnd Bergmanne9528132016-10-18 00:05:34 +0200625 int err;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700626 int offsets[4];
627 Indirect chain[4];
628 Indirect *partial;
Martin J. Bligha686cd82007-10-16 23:30:46 -0700629 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
Jan Kara7ba3ec52013-11-05 01:15:38 +0100637 BUG_ON(maxblocks == 0);
638
Martin J. Bligha686cd82007-10-16 23:30:46 -0700639 depth = ext2_block_to_path(inode,iblock,offsets,&blocks_to_boundary);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700640
641 if (depth == 0)
Arnd Bergmanne9528132016-10-18 00:05:34 +0200642 return -EIO;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700643
Jan Kara316cb4ef32009-04-13 14:40:14 -0700644 partial = ext2_get_branch(inode, depth, offsets, chain, &err);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700645 /* Simplest case - block found, no allocation needed */
646 if (!partial) {
Martin J. Bligha686cd82007-10-16 23:30:46 -0700647 first_block = le32_to_cpu(chain[depth - 1].key);
Martin J. Bligha686cd82007-10-16 23:30:46 -0700648 count++;
649 /*map more blocks*/
650 while (count < maxblocks && count <= blocks_to_boundary) {
651 ext2_fsblk_t blk;
652
Jan Kara316cb4ef32009-04-13 14:40:14 -0700653 if (!verify_chain(chain, chain + depth - 1)) {
Martin J. Bligha686cd82007-10-16 23:30:46 -0700654 /*
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 */
Jan Kara316cb4ef32009-04-13 14:40:14 -0700660 err = -EAGAIN;
Martin J. Bligha686cd82007-10-16 23:30:46 -0700661 count = 0;
Jan Kara316cb4ef32009-04-13 14:40:14 -0700662 break;
Martin J. Bligha686cd82007-10-16 23:30:46 -0700663 }
664 blk = le32_to_cpu(*(chain[depth-1].p + count));
665 if (blk == first_block + count)
666 count++;
667 else
668 break;
669 }
Jan Kara316cb4ef32009-04-13 14:40:14 -0700670 if (err != -EAGAIN)
671 goto got_it;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700672 }
673
674 /* Next simple case - plain lookup or failed read of indirect block */
Martin J. Bligha686cd82007-10-16 23:30:46 -0700675 if (!create || err == -EIO)
676 goto cleanup;
677
678 mutex_lock(&ei->truncate_mutex);
Jan Kara316cb4ef32009-04-13 14:40:14 -0700679 /*
680 * If the indirect block is missing while we are reading
Namhyung Kim72b43572010-09-15 21:46:02 +0900681 * the chain(ext2_get_branch() returns -EAGAIN err), or
Jan Kara316cb4ef32009-04-13 14:40:14 -0700682 * 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;
Jan Kara316cb4ef32009-04-13 14:40:14 -0700702 goto got_it;
703 }
704 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700705
706 /*
Martin J. Bligha686cd82007-10-16 23:30:46 -0700707 * 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
Akinobu Mitafb01bfd2008-02-06 01:40:16 -0800713 goal = ext2_find_goal(inode, iblock, partial);
Martin J. Bligha686cd82007-10-16 23:30:46 -0700714
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.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700720 */
Martin J. Bligha686cd82007-10-16 23:30:46 -0700721 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);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700728
Martin J. Bligha686cd82007-10-16 23:30:46 -0700729 if (err) {
730 mutex_unlock(&ei->truncate_mutex);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700731 goto cleanup;
Martin J. Bligha686cd82007-10-16 23:30:46 -0700732 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700733
Matthew Wilcoxfbbbad42015-02-16 15:58:53 -0800734 if (IS_DAX(inode)) {
Jan Kara225c5162016-09-27 16:35:45 +0200735 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 }
Carsten Otte6d791252005-06-23 22:05:26 -0700745 /*
Matthew Wilcox289c6ae2015-02-16 15:58:59 -0800746 * 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
Carsten Otte6d791252005-06-23 22:05:26 -0700749 */
Matthew Wilcox3dc29162016-03-15 11:20:41 -0600750 err = sb_issue_zeroout(inode->i_sb,
751 le32_to_cpu(chain[depth-1].key), count,
752 GFP_NOFS);
Martin J. Bligha686cd82007-10-16 23:30:46 -0700753 if (err) {
754 mutex_unlock(&ei->truncate_mutex);
Carsten Otte6d791252005-06-23 22:05:26 -0700755 goto cleanup;
Martin J. Bligha686cd82007-10-16 23:30:46 -0700756 }
Christoph Hellwig6750ad72016-09-19 11:28:39 +1000757 } else {
758 *new = true;
759 }
Carsten Otte6d791252005-06-23 22:05:26 -0700760
Martin J. Bligha686cd82007-10-16 23:30:46 -0700761 ext2_splice_branch(inode, iblock, partial, indirect_blks, count);
762 mutex_unlock(&ei->truncate_mutex);
Martin J. Bligha686cd82007-10-16 23:30:46 -0700763got_it:
Martin J. Bligha686cd82007-10-16 23:30:46 -0700764 if (count > blocks_to_boundary)
Christoph Hellwig6750ad72016-09-19 11:28:39 +1000765 *boundary = true;
Martin J. Bligha686cd82007-10-16 23:30:46 -0700766 err = count;
767 /* Clean up and exit */
768 partial = chain + depth - 1; /* the whole chain */
769cleanup:
770 while (partial > chain) {
771 brelse(partial->bh);
772 partial--;
773 }
Arnd Bergmanne9528132016-10-18 00:05:34 +0200774 if (err > 0)
775 *bno = le32_to_cpu(chain[depth-1].key);
Martin J. Bligha686cd82007-10-16 23:30:46 -0700776 return err;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700777}
778
Christoph Hellwig6750ad72016-09-19 11:28:39 +1000779int ext2_get_block(struct inode *inode, sector_t iblock,
780 struct buffer_head *bh_result, int create)
Martin J. Bligha686cd82007-10-16 23:30:46 -0700781{
782 unsigned max_blocks = bh_result->b_size >> inode->i_blkbits;
Christoph Hellwig6750ad72016-09-19 11:28:39 +1000783 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;
Martin J. Bligha686cd82007-10-16 23:30:46 -0700799
800}
801
Christoph Hellwig25f4e702016-09-19 11:30:29 +1000802#ifdef CONFIG_FS_DAX
803static 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;
Christoph Hellwigd5bfccd2016-10-03 09:46:04 +1100820 iomap->offset = (u64)first_block << blkbits;
Christoph Hellwig25f4e702016-09-19 11:30:29 +1000821
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
838static int
839ext2_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
849struct iomap_ops ext2_iomap_ops = {
850 .iomap_begin = ext2_iomap_begin,
851 .iomap_end = ext2_iomap_end,
852};
853#endif /* CONFIG_FS_DAX */
854
Josef Bacik68c9d702008-10-03 17:32:43 -0400855int ext2_fiemap(struct inode *inode, struct fiemap_extent_info *fieinfo,
856 u64 start, u64 len)
857{
858 return generic_block_fiemap(inode, fieinfo, start, len,
859 ext2_get_block);
860}
861
Linus Torvalds1da177e2005-04-16 15:20:36 -0700862static int ext2_writepage(struct page *page, struct writeback_control *wbc)
863{
864 return block_write_full_page(page, ext2_get_block, wbc);
865}
866
867static int ext2_readpage(struct file *file, struct page *page)
868{
869 return mpage_readpage(page, ext2_get_block);
870}
871
872static int
873ext2_readpages(struct file *file, struct address_space *mapping,
874 struct list_head *pages, unsigned nr_pages)
875{
876 return mpage_readpages(mapping, pages, nr_pages, ext2_get_block);
877}
878
Linus Torvalds1da177e2005-04-16 15:20:36 -0700879static int
Nick Pigginf34fb6e2007-10-16 01:25:04 -0700880ext2_write_begin(struct file *file, struct address_space *mapping,
881 loff_t pos, unsigned len, unsigned flags,
882 struct page **pagep, void **fsdata)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700883{
npiggin@suse.de737f2e92010-05-27 01:05:37 +1000884 int ret;
885
Christoph Hellwig155130a2010-06-04 11:29:58 +0200886 ret = block_write_begin(mapping, pos, len, flags, pagep,
887 ext2_get_block);
npiggin@suse.de737f2e92010-05-27 01:05:37 +1000888 if (ret < 0)
889 ext2_write_failed(mapping, pos + len);
890 return ret;
891}
892
893static int ext2_write_end(struct file *file, struct address_space *mapping,
894 loff_t pos, unsigned len, unsigned copied,
895 struct page *page, void *fsdata)
896{
897 int ret;
898
899 ret = generic_write_end(file, mapping, pos, len, copied, page, fsdata);
900 if (ret < len)
901 ext2_write_failed(mapping, pos + len);
902 return ret;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700903}
904
Nick Piggin03158cd2007-10-16 01:25:25 -0700905static int
906ext2_nobh_write_begin(struct file *file, struct address_space *mapping,
907 loff_t pos, unsigned len, unsigned flags,
908 struct page **pagep, void **fsdata)
909{
npiggin@suse.de737f2e92010-05-27 01:05:37 +1000910 int ret;
911
Christoph Hellwigea0f04e2010-06-04 11:29:54 +0200912 ret = nobh_write_begin(mapping, pos, len, flags, pagep, fsdata,
913 ext2_get_block);
npiggin@suse.de737f2e92010-05-27 01:05:37 +1000914 if (ret < 0)
915 ext2_write_failed(mapping, pos + len);
916 return ret;
Nick Piggin03158cd2007-10-16 01:25:25 -0700917}
918
Linus Torvalds1da177e2005-04-16 15:20:36 -0700919static int ext2_nobh_writepage(struct page *page,
920 struct writeback_control *wbc)
921{
922 return nobh_writepage(page, ext2_get_block, wbc);
923}
924
925static sector_t ext2_bmap(struct address_space *mapping, sector_t block)
926{
927 return generic_block_bmap(mapping,block,ext2_get_block);
928}
929
Linus Torvalds1da177e2005-04-16 15:20:36 -0700930static ssize_t
Christoph Hellwigc8b8e322016-04-07 08:51:58 -0700931ext2_direct_IO(struct kiocb *iocb, struct iov_iter *iter)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700932{
933 struct file *file = iocb->ki_filp;
npiggin@suse.de737f2e92010-05-27 01:05:37 +1000934 struct address_space *mapping = file->f_mapping;
935 struct inode *inode = mapping->host;
Al Viroa6cbcd42014-03-04 22:38:00 -0500936 size_t count = iov_iter_count(iter);
Christoph Hellwigc8b8e322016-04-07 08:51:58 -0700937 loff_t offset = iocb->ki_pos;
npiggin@suse.de737f2e92010-05-27 01:05:37 +1000938 ssize_t ret;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700939
Christoph Hellwig25f4e702016-09-19 11:30:29 +1000940 if (WARN_ON_ONCE(IS_DAX(inode)))
941 return -EIO;
942
943 ret = blockdev_direct_IO(iocb, inode, iter, ext2_get_block);
Omar Sandoval6f673762015-03-16 04:33:52 -0700944 if (ret < 0 && iov_iter_rw(iter) == WRITE)
Al Viroa6cbcd42014-03-04 22:38:00 -0500945 ext2_write_failed(mapping, offset + count);
npiggin@suse.de737f2e92010-05-27 01:05:37 +1000946 return ret;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700947}
948
949static int
950ext2_writepages(struct address_space *mapping, struct writeback_control *wbc)
951{
Ross Zwisler7f6d5b52016-02-26 15:19:55 -0800952#ifdef CONFIG_FS_DAX
953 if (dax_mapping(mapping)) {
954 return dax_writeback_mapping_range(mapping,
955 mapping->host->i_sb->s_bdev,
956 wbc);
957 }
958#endif
959
Linus Torvalds1da177e2005-04-16 15:20:36 -0700960 return mpage_writepages(mapping, wbc, ext2_get_block);
961}
962
Christoph Hellwigf5e54d62006-06-28 04:26:44 -0700963const struct address_space_operations ext2_aops = {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700964 .readpage = ext2_readpage,
965 .readpages = ext2_readpages,
966 .writepage = ext2_writepage,
Nick Pigginf34fb6e2007-10-16 01:25:04 -0700967 .write_begin = ext2_write_begin,
npiggin@suse.de737f2e92010-05-27 01:05:37 +1000968 .write_end = ext2_write_end,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700969 .bmap = ext2_bmap,
970 .direct_IO = ext2_direct_IO,
971 .writepages = ext2_writepages,
Christoph Lametere965f962006-02-01 03:05:41 -0800972 .migratepage = buffer_migrate_page,
Hisashi Hifumi8ab22b92008-07-28 15:46:36 -0700973 .is_partially_uptodate = block_is_partially_uptodate,
Andi Kleenaa261f52009-09-16 11:50:16 +0200974 .error_remove_page = generic_error_remove_page,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700975};
976
Christoph Hellwigf5e54d62006-06-28 04:26:44 -0700977const struct address_space_operations ext2_nobh_aops = {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700978 .readpage = ext2_readpage,
979 .readpages = ext2_readpages,
980 .writepage = ext2_nobh_writepage,
Nick Piggin03158cd2007-10-16 01:25:25 -0700981 .write_begin = ext2_nobh_write_begin,
982 .write_end = nobh_write_end,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700983 .bmap = ext2_bmap,
984 .direct_IO = ext2_direct_IO,
985 .writepages = ext2_writepages,
Christoph Lametere965f962006-02-01 03:05:41 -0800986 .migratepage = buffer_migrate_page,
Andi Kleenaa261f52009-09-16 11:50:16 +0200987 .error_remove_page = generic_error_remove_page,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700988};
989
990/*
991 * Probably it should be a library function... search for first non-zero word
992 * or memcmp with zero_page, whatever is better for particular architecture.
993 * Linus?
994 */
995static inline int all_zeroes(__le32 *p, __le32 *q)
996{
997 while (p < q)
998 if (*p++)
999 return 0;
1000 return 1;
1001}
1002
1003/**
1004 * ext2_find_shared - find the indirect blocks for partial truncation.
1005 * @inode: inode in question
1006 * @depth: depth of the affected branch
1007 * @offsets: offsets of pointers in that branch (see ext2_block_to_path)
1008 * @chain: place to store the pointers to partial indirect blocks
1009 * @top: place to the (detached) top of branch
1010 *
1011 * This is a helper function used by ext2_truncate().
1012 *
1013 * When we do truncate() we may have to clean the ends of several indirect
1014 * blocks but leave the blocks themselves alive. Block is partially
Lucas De Marchi25985ed2011-03-30 22:57:33 -03001015 * truncated if some data below the new i_size is referred from it (and
Linus Torvalds1da177e2005-04-16 15:20:36 -07001016 * it is on the path to the first completely truncated data block, indeed).
1017 * We have to free the top of that path along with everything to the right
1018 * of the path. Since no allocation past the truncation point is possible
1019 * until ext2_truncate() finishes, we may safely do the latter, but top
1020 * of branch may require special attention - pageout below the truncation
1021 * point might try to populate it.
1022 *
1023 * We atomically detach the top of branch from the tree, store the block
1024 * number of its root in *@top, pointers to buffer_heads of partially
1025 * truncated blocks - in @chain[].bh and pointers to their last elements
1026 * that should not be removed - in @chain[].p. Return value is the pointer
1027 * to last filled element of @chain.
1028 *
1029 * The work left to caller to do the actual freeing of subtrees:
1030 * a) free the subtree starting from *@top
1031 * b) free the subtrees whose roots are stored in
1032 * (@chain[i].p+1 .. end of @chain[i].bh->b_data)
1033 * c) free the subtrees growing from the inode past the @chain[0].p
1034 * (no partially truncated stuff there).
1035 */
1036
1037static Indirect *ext2_find_shared(struct inode *inode,
1038 int depth,
1039 int offsets[4],
1040 Indirect chain[4],
1041 __le32 *top)
1042{
1043 Indirect *partial, *p;
1044 int k, err;
1045
1046 *top = 0;
1047 for (k = depth; k > 1 && !offsets[k-1]; k--)
1048 ;
1049 partial = ext2_get_branch(inode, k, offsets, chain, &err);
1050 if (!partial)
1051 partial = chain + k-1;
1052 /*
1053 * If the branch acquired continuation since we've looked at it -
1054 * fine, it should all survive and (new) top doesn't belong to us.
1055 */
1056 write_lock(&EXT2_I(inode)->i_meta_lock);
1057 if (!partial->key && *partial->p) {
1058 write_unlock(&EXT2_I(inode)->i_meta_lock);
1059 goto no_top;
1060 }
1061 for (p=partial; p>chain && all_zeroes((__le32*)p->bh->b_data,p->p); p--)
1062 ;
1063 /*
1064 * OK, we've found the last block that must survive. The rest of our
1065 * branch should be detached before unlocking. However, if that rest
1066 * of branch is all ours and does not grow immediately from the inode
1067 * it's easier to cheat and just decrement partial->p.
1068 */
1069 if (p == chain + k - 1 && p > chain) {
1070 p->p--;
1071 } else {
1072 *top = *p->p;
1073 *p->p = 0;
1074 }
1075 write_unlock(&EXT2_I(inode)->i_meta_lock);
1076
1077 while(partial > p)
1078 {
1079 brelse(partial->bh);
1080 partial--;
1081 }
1082no_top:
1083 return partial;
1084}
1085
1086/**
1087 * ext2_free_data - free a list of data blocks
1088 * @inode: inode we are dealing with
1089 * @p: array of block numbers
1090 * @q: points immediately past the end of array
1091 *
Lucas De Marchi25985ed2011-03-30 22:57:33 -03001092 * We are freeing all blocks referred from that array (numbers are
Linus Torvalds1da177e2005-04-16 15:20:36 -07001093 * stored as little-endian 32-bit) and updating @inode->i_blocks
1094 * appropriately.
1095 */
1096static inline void ext2_free_data(struct inode *inode, __le32 *p, __le32 *q)
1097{
1098 unsigned long block_to_free = 0, count = 0;
1099 unsigned long nr;
1100
1101 for ( ; p < q ; p++) {
1102 nr = le32_to_cpu(*p);
1103 if (nr) {
1104 *p = 0;
1105 /* accumulate blocks to free if they're contiguous */
1106 if (count == 0)
1107 goto free_this;
1108 else if (block_to_free == nr - count)
1109 count++;
1110 else {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001111 ext2_free_blocks (inode, block_to_free, count);
Al Viroaddacc72010-07-22 01:19:42 +04001112 mark_inode_dirty(inode);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001113 free_this:
1114 block_to_free = nr;
1115 count = 1;
1116 }
1117 }
1118 }
1119 if (count > 0) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001120 ext2_free_blocks (inode, block_to_free, count);
Al Viroaddacc72010-07-22 01:19:42 +04001121 mark_inode_dirty(inode);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001122 }
1123}
1124
1125/**
1126 * ext2_free_branches - free an array of branches
1127 * @inode: inode we are dealing with
1128 * @p: array of block numbers
1129 * @q: pointer immediately past the end of array
1130 * @depth: depth of the branches to free
1131 *
Lucas De Marchi25985ed2011-03-30 22:57:33 -03001132 * We are freeing all blocks referred from these branches (numbers are
Linus Torvalds1da177e2005-04-16 15:20:36 -07001133 * stored as little-endian 32-bit) and updating @inode->i_blocks
1134 * appropriately.
1135 */
1136static void ext2_free_branches(struct inode *inode, __le32 *p, __le32 *q, int depth)
1137{
1138 struct buffer_head * bh;
1139 unsigned long nr;
1140
1141 if (depth--) {
1142 int addr_per_block = EXT2_ADDR_PER_BLOCK(inode->i_sb);
1143 for ( ; p < q ; p++) {
1144 nr = le32_to_cpu(*p);
1145 if (!nr)
1146 continue;
1147 *p = 0;
1148 bh = sb_bread(inode->i_sb, nr);
1149 /*
1150 * A read failure? Report error and clear slot
1151 * (should be rare).
1152 */
1153 if (!bh) {
1154 ext2_error(inode->i_sb, "ext2_free_branches",
1155 "Read failure, inode=%ld, block=%ld",
1156 inode->i_ino, nr);
1157 continue;
1158 }
1159 ext2_free_branches(inode,
1160 (__le32*)bh->b_data,
1161 (__le32*)bh->b_data + addr_per_block,
1162 depth);
1163 bforget(bh);
1164 ext2_free_blocks(inode, nr, 1);
1165 mark_inode_dirty(inode);
1166 }
1167 } else
1168 ext2_free_data(inode, p, q);
1169}
1170
Ross Zwisler5726b272015-10-13 16:25:37 -06001171/* dax_sem must be held when calling this function */
npiggin@suse.de737f2e92010-05-27 01:05:37 +10001172static void __ext2_truncate_blocks(struct inode *inode, loff_t offset)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001173{
1174 __le32 *i_data = EXT2_I(inode)->i_data;
Martin J. Bligha686cd82007-10-16 23:30:46 -07001175 struct ext2_inode_info *ei = EXT2_I(inode);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001176 int addr_per_block = EXT2_ADDR_PER_BLOCK(inode->i_sb);
1177 int offsets[4];
1178 Indirect chain[4];
1179 Indirect *partial;
1180 __le32 nr = 0;
1181 int n;
1182 long iblock;
1183 unsigned blocksize;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001184 blocksize = inode->i_sb->s_blocksize;
npiggin@suse.de737f2e92010-05-27 01:05:37 +10001185 iblock = (offset + blocksize-1) >> EXT2_BLOCK_SIZE_BITS(inode->i_sb);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001186
Ross Zwisler5726b272015-10-13 16:25:37 -06001187#ifdef CONFIG_FS_DAX
1188 WARN_ON(!rwsem_is_locked(&ei->dax_sem));
1189#endif
1190
Linus Torvalds1da177e2005-04-16 15:20:36 -07001191 n = ext2_block_to_path(inode, iblock, offsets, NULL);
1192 if (n == 0)
1193 return;
1194
Martin J. Bligha686cd82007-10-16 23:30:46 -07001195 /*
1196 * From here we block out all ext2_get_block() callers who want to
1197 * modify the block allocation tree.
1198 */
1199 mutex_lock(&ei->truncate_mutex);
1200
Linus Torvalds1da177e2005-04-16 15:20:36 -07001201 if (n == 1) {
1202 ext2_free_data(inode, i_data+offsets[0],
1203 i_data + EXT2_NDIR_BLOCKS);
1204 goto do_indirects;
1205 }
1206
1207 partial = ext2_find_shared(inode, n, offsets, chain, &nr);
1208 /* Kill the top of shared branch (already detached) */
1209 if (nr) {
1210 if (partial == chain)
1211 mark_inode_dirty(inode);
1212 else
1213 mark_buffer_dirty_inode(partial->bh, inode);
1214 ext2_free_branches(inode, &nr, &nr+1, (chain+n-1) - partial);
1215 }
1216 /* Clear the ends of indirect blocks on the shared branch */
1217 while (partial > chain) {
1218 ext2_free_branches(inode,
1219 partial->p + 1,
1220 (__le32*)partial->bh->b_data+addr_per_block,
1221 (chain+n-1) - partial);
1222 mark_buffer_dirty_inode(partial->bh, inode);
1223 brelse (partial->bh);
1224 partial--;
1225 }
1226do_indirects:
1227 /* Kill the remaining (whole) subtrees */
1228 switch (offsets[0]) {
1229 default:
1230 nr = i_data[EXT2_IND_BLOCK];
1231 if (nr) {
1232 i_data[EXT2_IND_BLOCK] = 0;
1233 mark_inode_dirty(inode);
1234 ext2_free_branches(inode, &nr, &nr+1, 1);
1235 }
1236 case EXT2_IND_BLOCK:
1237 nr = i_data[EXT2_DIND_BLOCK];
1238 if (nr) {
1239 i_data[EXT2_DIND_BLOCK] = 0;
1240 mark_inode_dirty(inode);
1241 ext2_free_branches(inode, &nr, &nr+1, 2);
1242 }
1243 case EXT2_DIND_BLOCK:
1244 nr = i_data[EXT2_TIND_BLOCK];
1245 if (nr) {
1246 i_data[EXT2_TIND_BLOCK] = 0;
1247 mark_inode_dirty(inode);
1248 ext2_free_branches(inode, &nr, &nr+1, 3);
1249 }
1250 case EXT2_TIND_BLOCK:
1251 ;
1252 }
Martin J. Bligha686cd82007-10-16 23:30:46 -07001253
1254 ext2_discard_reservation(inode);
1255
1256 mutex_unlock(&ei->truncate_mutex);
npiggin@suse.de737f2e92010-05-27 01:05:37 +10001257}
1258
1259static void ext2_truncate_blocks(struct inode *inode, loff_t offset)
1260{
npiggin@suse.de737f2e92010-05-27 01:05:37 +10001261 if (!(S_ISREG(inode->i_mode) || S_ISDIR(inode->i_mode) ||
1262 S_ISLNK(inode->i_mode)))
1263 return;
1264 if (ext2_inode_is_fast_symlink(inode))
1265 return;
Ross Zwisler5726b272015-10-13 16:25:37 -06001266
1267 dax_sem_down_write(EXT2_I(inode));
npiggin@suse.de737f2e92010-05-27 01:05:37 +10001268 __ext2_truncate_blocks(inode, offset);
Ross Zwisler5726b272015-10-13 16:25:37 -06001269 dax_sem_up_write(EXT2_I(inode));
npiggin@suse.de737f2e92010-05-27 01:05:37 +10001270}
1271
Christoph Hellwig2c27c652010-06-04 11:30:04 +02001272static int ext2_setsize(struct inode *inode, loff_t newsize)
npiggin@suse.de737f2e92010-05-27 01:05:37 +10001273{
npiggin@suse.de737f2e92010-05-27 01:05:37 +10001274 int error;
1275
npiggin@suse.de737f2e92010-05-27 01:05:37 +10001276 if (!(S_ISREG(inode->i_mode) || S_ISDIR(inode->i_mode) ||
1277 S_ISLNK(inode->i_mode)))
1278 return -EINVAL;
1279 if (ext2_inode_is_fast_symlink(inode))
1280 return -EINVAL;
1281 if (IS_APPEND(inode) || IS_IMMUTABLE(inode))
1282 return -EPERM;
1283
Christoph Hellwig562c72a2011-06-24 14:29:45 -04001284 inode_dio_wait(inode);
1285
Matthew Wilcoxfbbbad42015-02-16 15:58:53 -08001286 if (IS_DAX(inode))
Matthew Wilcox4c0ccfe2015-02-16 15:59:06 -08001287 error = dax_truncate_page(inode, newsize, ext2_get_block);
npiggin@suse.de737f2e92010-05-27 01:05:37 +10001288 else if (test_opt(inode->i_sb, NOBH))
1289 error = nobh_truncate_page(inode->i_mapping,
1290 newsize, ext2_get_block);
1291 else
1292 error = block_truncate_page(inode->i_mapping,
1293 newsize, ext2_get_block);
1294 if (error)
1295 return error;
1296
Ross Zwisler5726b272015-10-13 16:25:37 -06001297 dax_sem_down_write(EXT2_I(inode));
Christoph Hellwig2c27c652010-06-04 11:30:04 +02001298 truncate_setsize(inode, newsize);
npiggin@suse.de737f2e92010-05-27 01:05:37 +10001299 __ext2_truncate_blocks(inode, newsize);
Ross Zwisler5726b272015-10-13 16:25:37 -06001300 dax_sem_up_write(EXT2_I(inode));
npiggin@suse.de737f2e92010-05-27 01:05:37 +10001301
Deepa Dinamani02027d42016-09-14 07:48:05 -07001302 inode->i_mtime = inode->i_ctime = current_time(inode);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001303 if (inode_needs_sync(inode)) {
1304 sync_mapping_buffers(inode->i_mapping);
Christoph Hellwigc37650162010-10-06 10:48:20 +02001305 sync_inode_metadata(inode, 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001306 } else {
1307 mark_inode_dirty(inode);
1308 }
npiggin@suse.de737f2e92010-05-27 01:05:37 +10001309
1310 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001311}
1312
1313static struct ext2_inode *ext2_get_inode(struct super_block *sb, ino_t ino,
1314 struct buffer_head **p)
1315{
1316 struct buffer_head * bh;
1317 unsigned long block_group;
1318 unsigned long block;
1319 unsigned long offset;
1320 struct ext2_group_desc * gdp;
1321
1322 *p = NULL;
1323 if ((ino != EXT2_ROOT_INO && ino < EXT2_FIRST_INO(sb)) ||
1324 ino > le32_to_cpu(EXT2_SB(sb)->s_es->s_inodes_count))
1325 goto Einval;
1326
1327 block_group = (ino - 1) / EXT2_INODES_PER_GROUP(sb);
Eric Sandeenef2fb672007-10-16 23:26:30 -07001328 gdp = ext2_get_group_desc(sb, block_group, NULL);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001329 if (!gdp)
1330 goto Egdp;
1331 /*
1332 * Figure out the offset within the block group inode table
1333 */
1334 offset = ((ino - 1) % EXT2_INODES_PER_GROUP(sb)) * EXT2_INODE_SIZE(sb);
1335 block = le32_to_cpu(gdp->bg_inode_table) +
1336 (offset >> EXT2_BLOCK_SIZE_BITS(sb));
1337 if (!(bh = sb_bread(sb, block)))
1338 goto Eio;
1339
1340 *p = bh;
1341 offset &= (EXT2_BLOCK_SIZE(sb) - 1);
1342 return (struct ext2_inode *) (bh->b_data + offset);
1343
1344Einval:
1345 ext2_error(sb, "ext2_get_inode", "bad inode number: %lu",
1346 (unsigned long) ino);
1347 return ERR_PTR(-EINVAL);
1348Eio:
1349 ext2_error(sb, "ext2_get_inode",
1350 "unable to read inode block - inode=%lu, block=%lu",
1351 (unsigned long) ino, block);
1352Egdp:
1353 return ERR_PTR(-EIO);
1354}
1355
1356void ext2_set_inode_flags(struct inode *inode)
1357{
1358 unsigned int flags = EXT2_I(inode)->i_flags;
1359
Matthew Wilcoxfbbbad42015-02-16 15:58:53 -08001360 inode->i_flags &= ~(S_SYNC | S_APPEND | S_IMMUTABLE | S_NOATIME |
1361 S_DIRSYNC | S_DAX);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001362 if (flags & EXT2_SYNC_FL)
1363 inode->i_flags |= S_SYNC;
1364 if (flags & EXT2_APPEND_FL)
1365 inode->i_flags |= S_APPEND;
1366 if (flags & EXT2_IMMUTABLE_FL)
1367 inode->i_flags |= S_IMMUTABLE;
1368 if (flags & EXT2_NOATIME_FL)
1369 inode->i_flags |= S_NOATIME;
1370 if (flags & EXT2_DIRSYNC_FL)
1371 inode->i_flags |= S_DIRSYNC;
Ross Zwisler0a6cf912016-02-26 15:19:46 -08001372 if (test_opt(inode->i_sb, DAX) && S_ISREG(inode->i_mode))
Matthew Wilcoxfbbbad42015-02-16 15:58:53 -08001373 inode->i_flags |= S_DAX;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001374}
1375
Jan Kara4f99ed62007-05-08 00:31:04 -07001376/* Propagate flags from i_flags to EXT2_I(inode)->i_flags */
1377void ext2_get_inode_flags(struct ext2_inode_info *ei)
1378{
1379 unsigned int flags = ei->vfs_inode.i_flags;
1380
1381 ei->i_flags &= ~(EXT2_SYNC_FL|EXT2_APPEND_FL|
1382 EXT2_IMMUTABLE_FL|EXT2_NOATIME_FL|EXT2_DIRSYNC_FL);
1383 if (flags & S_SYNC)
1384 ei->i_flags |= EXT2_SYNC_FL;
1385 if (flags & S_APPEND)
1386 ei->i_flags |= EXT2_APPEND_FL;
1387 if (flags & S_IMMUTABLE)
1388 ei->i_flags |= EXT2_IMMUTABLE_FL;
1389 if (flags & S_NOATIME)
1390 ei->i_flags |= EXT2_NOATIME_FL;
1391 if (flags & S_DIRSYNC)
1392 ei->i_flags |= EXT2_DIRSYNC_FL;
1393}
1394
David Howells52fcf702008-02-07 00:15:35 -08001395struct inode *ext2_iget (struct super_block *sb, unsigned long ino)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001396{
David Howells52fcf702008-02-07 00:15:35 -08001397 struct ext2_inode_info *ei;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001398 struct buffer_head * bh;
David Howells52fcf702008-02-07 00:15:35 -08001399 struct ext2_inode *raw_inode;
1400 struct inode *inode;
1401 long ret = -EIO;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001402 int n;
Eric W. Biedermanb8a9f9e2012-02-07 15:39:12 -08001403 uid_t i_uid;
1404 gid_t i_gid;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001405
David Howells52fcf702008-02-07 00:15:35 -08001406 inode = iget_locked(sb, ino);
1407 if (!inode)
1408 return ERR_PTR(-ENOMEM);
1409 if (!(inode->i_state & I_NEW))
1410 return inode;
1411
1412 ei = EXT2_I(inode);
Martin J. Bligha686cd82007-10-16 23:30:46 -07001413 ei->i_block_alloc_info = NULL;
1414
David Howells52fcf702008-02-07 00:15:35 -08001415 raw_inode = ext2_get_inode(inode->i_sb, ino, &bh);
1416 if (IS_ERR(raw_inode)) {
1417 ret = PTR_ERR(raw_inode);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001418 goto bad_inode;
David Howells52fcf702008-02-07 00:15:35 -08001419 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001420
1421 inode->i_mode = le16_to_cpu(raw_inode->i_mode);
Eric W. Biedermanb8a9f9e2012-02-07 15:39:12 -08001422 i_uid = (uid_t)le16_to_cpu(raw_inode->i_uid_low);
1423 i_gid = (gid_t)le16_to_cpu(raw_inode->i_gid_low);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001424 if (!(test_opt (inode->i_sb, NO_UID32))) {
Eric W. Biedermanb8a9f9e2012-02-07 15:39:12 -08001425 i_uid |= le16_to_cpu(raw_inode->i_uid_high) << 16;
1426 i_gid |= le16_to_cpu(raw_inode->i_gid_high) << 16;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001427 }
Eric W. Biedermanb8a9f9e2012-02-07 15:39:12 -08001428 i_uid_write(inode, i_uid);
1429 i_gid_write(inode, i_gid);
Miklos Szeredibfe86842011-10-28 14:13:29 +02001430 set_nlink(inode, le16_to_cpu(raw_inode->i_links_count));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001431 inode->i_size = le32_to_cpu(raw_inode->i_size);
Markus Rechberger4d7bf112007-05-08 00:23:39 -07001432 inode->i_atime.tv_sec = (signed)le32_to_cpu(raw_inode->i_atime);
1433 inode->i_ctime.tv_sec = (signed)le32_to_cpu(raw_inode->i_ctime);
1434 inode->i_mtime.tv_sec = (signed)le32_to_cpu(raw_inode->i_mtime);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001435 inode->i_atime.tv_nsec = inode->i_mtime.tv_nsec = inode->i_ctime.tv_nsec = 0;
1436 ei->i_dtime = le32_to_cpu(raw_inode->i_dtime);
1437 /* We now have enough fields to check if the inode was active or not.
1438 * This is needed because nfsd might try to access dead inodes
1439 * the test is that same one that e2fsck uses
1440 * NeilBrown 1999oct15
1441 */
1442 if (inode->i_nlink == 0 && (inode->i_mode == 0 || ei->i_dtime)) {
1443 /* this inode is deleted */
1444 brelse (bh);
David Howells52fcf702008-02-07 00:15:35 -08001445 ret = -ESTALE;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001446 goto bad_inode;
1447 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001448 inode->i_blocks = le32_to_cpu(raw_inode->i_blocks);
1449 ei->i_flags = le32_to_cpu(raw_inode->i_flags);
1450 ei->i_faddr = le32_to_cpu(raw_inode->i_faddr);
1451 ei->i_frag_no = raw_inode->i_frag;
1452 ei->i_frag_size = raw_inode->i_fsize;
1453 ei->i_file_acl = le32_to_cpu(raw_inode->i_file_acl);
1454 ei->i_dir_acl = 0;
Carlos Maiolinoff0031d2016-07-05 22:02:41 -04001455
1456 if (ei->i_file_acl &&
1457 !ext2_data_block_valid(EXT2_SB(sb), ei->i_file_acl, 1)) {
1458 ext2_error(sb, "ext2_iget", "bad extended attribute block %u",
1459 ei->i_file_acl);
1460 brelse(bh);
1461 ret = -EFSCORRUPTED;
1462 goto bad_inode;
1463 }
1464
Linus Torvalds1da177e2005-04-16 15:20:36 -07001465 if (S_ISREG(inode->i_mode))
1466 inode->i_size |= ((__u64)le32_to_cpu(raw_inode->i_size_high)) << 32;
1467 else
1468 ei->i_dir_acl = le32_to_cpu(raw_inode->i_dir_acl);
1469 ei->i_dtime = 0;
1470 inode->i_generation = le32_to_cpu(raw_inode->i_generation);
1471 ei->i_state = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001472 ei->i_block_group = (ino - 1) / EXT2_INODES_PER_GROUP(inode->i_sb);
1473 ei->i_dir_start_lookup = 0;
1474
1475 /*
1476 * NOTE! The in-memory inode i_data array is in little-endian order
1477 * even on big-endian machines: we do NOT byteswap the block numbers!
1478 */
1479 for (n = 0; n < EXT2_N_BLOCKS; n++)
1480 ei->i_data[n] = raw_inode->i_block[n];
1481
1482 if (S_ISREG(inode->i_mode)) {
1483 inode->i_op = &ext2_file_inode_operations;
Boaz Harroshbe64f882015-04-15 16:15:17 -07001484 if (test_opt(inode->i_sb, NOBH)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001485 inode->i_mapping->a_ops = &ext2_nobh_aops;
Carsten Otte6d791252005-06-23 22:05:26 -07001486 inode->i_fop = &ext2_file_operations;
1487 } else {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001488 inode->i_mapping->a_ops = &ext2_aops;
Carsten Otte6d791252005-06-23 22:05:26 -07001489 inode->i_fop = &ext2_file_operations;
1490 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001491 } else if (S_ISDIR(inode->i_mode)) {
1492 inode->i_op = &ext2_dir_inode_operations;
1493 inode->i_fop = &ext2_dir_operations;
1494 if (test_opt(inode->i_sb, NOBH))
1495 inode->i_mapping->a_ops = &ext2_nobh_aops;
1496 else
1497 inode->i_mapping->a_ops = &ext2_aops;
1498 } else if (S_ISLNK(inode->i_mode)) {
Duane Griffin8d6d0c42008-12-19 20:47:13 +00001499 if (ext2_inode_is_fast_symlink(inode)) {
Al Virocbe0fa32015-05-02 10:02:46 -04001500 inode->i_link = (char *)ei->i_data;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001501 inode->i_op = &ext2_fast_symlink_inode_operations;
Duane Griffin8d6d0c42008-12-19 20:47:13 +00001502 nd_terminate_link(ei->i_data, inode->i_size,
1503 sizeof(ei->i_data) - 1);
1504 } else {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001505 inode->i_op = &ext2_symlink_inode_operations;
Al Viro21fc61c2015-11-17 01:07:57 -05001506 inode_nohighmem(inode);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001507 if (test_opt(inode->i_sb, NOBH))
1508 inode->i_mapping->a_ops = &ext2_nobh_aops;
1509 else
1510 inode->i_mapping->a_ops = &ext2_aops;
1511 }
1512 } else {
1513 inode->i_op = &ext2_special_inode_operations;
1514 if (raw_inode->i_block[0])
1515 init_special_inode(inode, inode->i_mode,
1516 old_decode_dev(le32_to_cpu(raw_inode->i_block[0])));
1517 else
1518 init_special_inode(inode, inode->i_mode,
1519 new_decode_dev(le32_to_cpu(raw_inode->i_block[1])));
1520 }
1521 brelse (bh);
1522 ext2_set_inode_flags(inode);
David Howells52fcf702008-02-07 00:15:35 -08001523 unlock_new_inode(inode);
1524 return inode;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001525
1526bad_inode:
David Howells52fcf702008-02-07 00:15:35 -08001527 iget_failed(inode);
1528 return ERR_PTR(ret);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001529}
1530
Christoph Hellwiga9185b42010-03-05 09:21:37 +01001531static int __ext2_write_inode(struct inode *inode, int do_sync)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001532{
1533 struct ext2_inode_info *ei = EXT2_I(inode);
1534 struct super_block *sb = inode->i_sb;
1535 ino_t ino = inode->i_ino;
Eric W. Biedermanb8a9f9e2012-02-07 15:39:12 -08001536 uid_t uid = i_uid_read(inode);
1537 gid_t gid = i_gid_read(inode);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001538 struct buffer_head * bh;
1539 struct ext2_inode * raw_inode = ext2_get_inode(sb, ino, &bh);
1540 int n;
1541 int err = 0;
1542
1543 if (IS_ERR(raw_inode))
1544 return -EIO;
1545
1546 /* For fields not not tracking in the in-memory inode,
1547 * initialise them to zero for new inodes. */
1548 if (ei->i_state & EXT2_STATE_NEW)
1549 memset(raw_inode, 0, EXT2_SB(sb)->s_inode_size);
1550
Jan Kara4f99ed62007-05-08 00:31:04 -07001551 ext2_get_inode_flags(ei);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001552 raw_inode->i_mode = cpu_to_le16(inode->i_mode);
1553 if (!(test_opt(sb, NO_UID32))) {
1554 raw_inode->i_uid_low = cpu_to_le16(low_16_bits(uid));
1555 raw_inode->i_gid_low = cpu_to_le16(low_16_bits(gid));
1556/*
1557 * Fix up interoperability with old kernels. Otherwise, old inodes get
1558 * re-used with the upper 16 bits of the uid/gid intact
1559 */
1560 if (!ei->i_dtime) {
1561 raw_inode->i_uid_high = cpu_to_le16(high_16_bits(uid));
1562 raw_inode->i_gid_high = cpu_to_le16(high_16_bits(gid));
1563 } else {
1564 raw_inode->i_uid_high = 0;
1565 raw_inode->i_gid_high = 0;
1566 }
1567 } else {
1568 raw_inode->i_uid_low = cpu_to_le16(fs_high2lowuid(uid));
1569 raw_inode->i_gid_low = cpu_to_le16(fs_high2lowgid(gid));
1570 raw_inode->i_uid_high = 0;
1571 raw_inode->i_gid_high = 0;
1572 }
1573 raw_inode->i_links_count = cpu_to_le16(inode->i_nlink);
1574 raw_inode->i_size = cpu_to_le32(inode->i_size);
1575 raw_inode->i_atime = cpu_to_le32(inode->i_atime.tv_sec);
1576 raw_inode->i_ctime = cpu_to_le32(inode->i_ctime.tv_sec);
1577 raw_inode->i_mtime = cpu_to_le32(inode->i_mtime.tv_sec);
1578
1579 raw_inode->i_blocks = cpu_to_le32(inode->i_blocks);
1580 raw_inode->i_dtime = cpu_to_le32(ei->i_dtime);
1581 raw_inode->i_flags = cpu_to_le32(ei->i_flags);
1582 raw_inode->i_faddr = cpu_to_le32(ei->i_faddr);
1583 raw_inode->i_frag = ei->i_frag_no;
1584 raw_inode->i_fsize = ei->i_frag_size;
1585 raw_inode->i_file_acl = cpu_to_le32(ei->i_file_acl);
1586 if (!S_ISREG(inode->i_mode))
1587 raw_inode->i_dir_acl = cpu_to_le32(ei->i_dir_acl);
1588 else {
1589 raw_inode->i_size_high = cpu_to_le32(inode->i_size >> 32);
1590 if (inode->i_size > 0x7fffffffULL) {
1591 if (!EXT2_HAS_RO_COMPAT_FEATURE(sb,
1592 EXT2_FEATURE_RO_COMPAT_LARGE_FILE) ||
1593 EXT2_SB(sb)->s_es->s_rev_level ==
1594 cpu_to_le32(EXT2_GOOD_OLD_REV)) {
1595 /* If this is the first large file
1596 * created, add a flag to the superblock.
1597 */
Jan Blunckc15271f2010-04-14 14:38:38 +02001598 spin_lock(&EXT2_SB(sb)->s_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001599 ext2_update_dynamic_rev(sb);
1600 EXT2_SET_RO_COMPAT_FEATURE(sb,
1601 EXT2_FEATURE_RO_COMPAT_LARGE_FILE);
Jan Blunckc15271f2010-04-14 14:38:38 +02001602 spin_unlock(&EXT2_SB(sb)->s_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001603 ext2_write_super(sb);
1604 }
1605 }
1606 }
1607
1608 raw_inode->i_generation = cpu_to_le32(inode->i_generation);
1609 if (S_ISCHR(inode->i_mode) || S_ISBLK(inode->i_mode)) {
1610 if (old_valid_dev(inode->i_rdev)) {
1611 raw_inode->i_block[0] =
1612 cpu_to_le32(old_encode_dev(inode->i_rdev));
1613 raw_inode->i_block[1] = 0;
1614 } else {
1615 raw_inode->i_block[0] = 0;
1616 raw_inode->i_block[1] =
1617 cpu_to_le32(new_encode_dev(inode->i_rdev));
1618 raw_inode->i_block[2] = 0;
1619 }
1620 } else for (n = 0; n < EXT2_N_BLOCKS; n++)
1621 raw_inode->i_block[n] = ei->i_data[n];
1622 mark_buffer_dirty(bh);
1623 if (do_sync) {
1624 sync_dirty_buffer(bh);
1625 if (buffer_req(bh) && !buffer_uptodate(bh)) {
1626 printk ("IO error syncing ext2 inode [%s:%08lx]\n",
1627 sb->s_id, (unsigned long) ino);
1628 err = -EIO;
1629 }
1630 }
1631 ei->i_state &= ~EXT2_STATE_NEW;
1632 brelse (bh);
1633 return err;
1634}
1635
Christoph Hellwiga9185b42010-03-05 09:21:37 +01001636int ext2_write_inode(struct inode *inode, struct writeback_control *wbc)
1637{
1638 return __ext2_write_inode(inode, wbc->sync_mode == WB_SYNC_ALL);
1639}
1640
Linus Torvalds1da177e2005-04-16 15:20:36 -07001641int ext2_setattr(struct dentry *dentry, struct iattr *iattr)
1642{
David Howells2b0143b2015-03-17 22:25:59 +00001643 struct inode *inode = d_inode(dentry);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001644 int error;
1645
Jan Kara31051c82016-05-26 16:55:18 +02001646 error = setattr_prepare(dentry, iattr);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001647 if (error)
1648 return error;
Christoph Hellwig907f4552010-03-03 09:05:06 -05001649
Jan Karac2edb302015-06-29 16:08:45 +02001650 if (is_quota_modification(inode, iattr)) {
1651 error = dquot_initialize(inode);
1652 if (error)
1653 return error;
1654 }
Eric W. Biedermanb8a9f9e2012-02-07 15:39:12 -08001655 if ((iattr->ia_valid & ATTR_UID && !uid_eq(iattr->ia_uid, inode->i_uid)) ||
1656 (iattr->ia_valid & ATTR_GID && !gid_eq(iattr->ia_gid, inode->i_gid))) {
Christoph Hellwigb43fa822010-03-03 09:05:03 -05001657 error = dquot_transfer(inode, iattr);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001658 if (error)
1659 return error;
1660 }
Nick Pigginaf5a30d2010-06-03 22:01:46 +10001661 if (iattr->ia_valid & ATTR_SIZE && iattr->ia_size != inode->i_size) {
npiggin@suse.de737f2e92010-05-27 01:05:37 +10001662 error = ext2_setsize(inode, iattr->ia_size);
1663 if (error)
1664 return error;
1665 }
Christoph Hellwig6a1a90a2010-06-04 11:30:00 +02001666 setattr_copy(inode, iattr);
npiggin@suse.de737f2e92010-05-27 01:05:37 +10001667 if (iattr->ia_valid & ATTR_MODE)
Christoph Hellwig64e178a2013-12-20 05:16:44 -08001668 error = posix_acl_chmod(inode, inode->i_mode);
npiggin@suse.de737f2e92010-05-27 01:05:37 +10001669 mark_inode_dirty(inode);
1670
Linus Torvalds1da177e2005-04-16 15:20:36 -07001671 return error;
1672}