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