2 * linux/fs/ext2/inode.c
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)
11 * linux/fs/minix/inode.c
13 * Copyright (C) 1991, 1992 Linus Torvalds
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)
22 * Assorted race fixes, rewrite of ext2_get_block() by Al Viro, 2000
25 #include <linux/time.h>
26 #include <linux/highuid.h>
27 #include <linux/pagemap.h>
28 #include <linux/quotaops.h>
29 #include <linux/writeback.h>
30 #include <linux/buffer_head.h>
31 #include <linux/mpage.h>
32 #include <linux/fiemap.h>
33 #include <linux/namei.h>
39 static int __ext2_write_inode(struct inode
*inode
, int do_sync
);
42 * Test whether an inode is a fast symlink.
44 static inline int ext2_inode_is_fast_symlink(struct inode
*inode
)
46 int ea_blocks
= EXT2_I(inode
)->i_file_acl
?
47 (inode
->i_sb
->s_blocksize
>> 9) : 0;
49 return (S_ISLNK(inode
->i_mode
) &&
50 inode
->i_blocks
- ea_blocks
== 0);
53 static void ext2_truncate_blocks(struct inode
*inode
, loff_t offset
);
55 static void ext2_write_failed(struct address_space
*mapping
, loff_t to
)
57 struct inode
*inode
= mapping
->host
;
59 if (to
> inode
->i_size
) {
60 truncate_pagecache(inode
, to
, inode
->i_size
);
61 ext2_truncate_blocks(inode
, inode
->i_size
);
66 * Called at the last iput() if i_nlink is zero.
68 void ext2_evict_inode(struct inode
* inode
)
70 struct ext2_block_alloc_info
*rsv
;
73 if (!inode
->i_nlink
&& !is_bad_inode(inode
)) {
75 dquot_initialize(inode
);
80 truncate_inode_pages(&inode
->i_data
, 0);
83 sb_start_intwrite(inode
->i_sb
);
85 EXT2_I(inode
)->i_dtime
= get_seconds();
86 mark_inode_dirty(inode
);
87 __ext2_write_inode(inode
, inode_needs_sync(inode
));
91 ext2_truncate_blocks(inode
, 0);
92 ext2_xattr_delete_inode(inode
);
95 invalidate_inode_buffers(inode
);
98 ext2_discard_reservation(inode
);
99 rsv
= EXT2_I(inode
)->i_block_alloc_info
;
100 EXT2_I(inode
)->i_block_alloc_info
= NULL
;
105 ext2_free_inode(inode
);
106 sb_end_intwrite(inode
->i_sb
);
113 struct buffer_head
*bh
;
116 static inline void add_chain(Indirect
*p
, struct buffer_head
*bh
, __le32
*v
)
118 p
->key
= *(p
->p
= v
);
122 static inline int verify_chain(Indirect
*from
, Indirect
*to
)
124 while (from
<= to
&& from
->key
== *from
->p
)
130 * ext2_block_to_path - parse the block number into array of offsets
131 * @inode: inode in question (we are only interested in its superblock)
132 * @i_block: block number to be parsed
133 * @offsets: array to store the offsets in
134 * @boundary: set this non-zero if the referred-to block is likely to be
135 * followed (on disk) by an indirect block.
136 * To store the locations of file's data ext2 uses a data structure common
137 * for UNIX filesystems - tree of pointers anchored in the inode, with
138 * data blocks at leaves and indirect blocks in intermediate nodes.
139 * This function translates the block number into path in that tree -
140 * return value is the path length and @offsets[n] is the offset of
141 * pointer to (n+1)th node in the nth one. If @block is out of range
142 * (negative or too large) warning is printed and zero returned.
144 * Note: function doesn't find node addresses, so no IO is needed. All
145 * we need to know is the capacity of indirect blocks (taken from the
150 * Portability note: the last comparison (check that we fit into triple
151 * indirect block) is spelled differently, because otherwise on an
152 * architecture with 32-bit longs and 8Kb pages we might get into trouble
153 * if our filesystem had 8Kb blocks. We might use long long, but that would
154 * kill us on x86. Oh, well, at least the sign propagation does not matter -
155 * i_block would have to be negative in the very beginning, so we would not
159 static int ext2_block_to_path(struct inode
*inode
,
160 long i_block
, int offsets
[4], int *boundary
)
162 int ptrs
= EXT2_ADDR_PER_BLOCK(inode
->i_sb
);
163 int ptrs_bits
= EXT2_ADDR_PER_BLOCK_BITS(inode
->i_sb
);
164 const long direct_blocks
= EXT2_NDIR_BLOCKS
,
165 indirect_blocks
= ptrs
,
166 double_blocks
= (1 << (ptrs_bits
* 2));
171 ext2_msg(inode
->i_sb
, KERN_WARNING
,
172 "warning: %s: block < 0", __func__
);
173 } else if (i_block
< direct_blocks
) {
174 offsets
[n
++] = i_block
;
175 final
= direct_blocks
;
176 } else if ( (i_block
-= direct_blocks
) < indirect_blocks
) {
177 offsets
[n
++] = EXT2_IND_BLOCK
;
178 offsets
[n
++] = i_block
;
180 } else if ((i_block
-= indirect_blocks
) < double_blocks
) {
181 offsets
[n
++] = EXT2_DIND_BLOCK
;
182 offsets
[n
++] = i_block
>> ptrs_bits
;
183 offsets
[n
++] = i_block
& (ptrs
- 1);
185 } else if (((i_block
-= double_blocks
) >> (ptrs_bits
* 2)) < ptrs
) {
186 offsets
[n
++] = EXT2_TIND_BLOCK
;
187 offsets
[n
++] = i_block
>> (ptrs_bits
* 2);
188 offsets
[n
++] = (i_block
>> ptrs_bits
) & (ptrs
- 1);
189 offsets
[n
++] = i_block
& (ptrs
- 1);
192 ext2_msg(inode
->i_sb
, KERN_WARNING
,
193 "warning: %s: block is too big", __func__
);
196 *boundary
= final
- 1 - (i_block
& (ptrs
- 1));
202 * ext2_get_branch - read the chain of indirect blocks leading to data
203 * @inode: inode in question
204 * @depth: depth of the chain (1 - direct pointer, etc.)
205 * @offsets: offsets of pointers in inode/indirect blocks
206 * @chain: place to store the result
207 * @err: here we store the error value
209 * Function fills the array of triples <key, p, bh> and returns %NULL
210 * if everything went OK or the pointer to the last filled triple
211 * (incomplete one) otherwise. Upon the return chain[i].key contains
212 * the number of (i+1)-th block in the chain (as it is stored in memory,
213 * i.e. little-endian 32-bit), chain[i].p contains the address of that
214 * number (it points into struct inode for i==0 and into the bh->b_data
215 * for i>0) and chain[i].bh points to the buffer_head of i-th indirect
216 * block for i>0 and NULL for i==0. In other words, it holds the block
217 * numbers of the chain, addresses they were taken from (and where we can
218 * verify that chain did not change) and buffer_heads hosting these
221 * Function stops when it stumbles upon zero pointer (absent block)
222 * (pointer to last triple returned, *@err == 0)
223 * or when it gets an IO error reading an indirect block
224 * (ditto, *@err == -EIO)
225 * or when it notices that chain had been changed while it was reading
226 * (ditto, *@err == -EAGAIN)
227 * or when it reads all @depth-1 indirect blocks successfully and finds
228 * the whole chain, all way to the data (returns %NULL, *err == 0).
230 static Indirect
*ext2_get_branch(struct inode
*inode
,
236 struct super_block
*sb
= inode
->i_sb
;
238 struct buffer_head
*bh
;
241 /* i_data is not going away, no lock needed */
242 add_chain (chain
, NULL
, EXT2_I(inode
)->i_data
+ *offsets
);
246 bh
= sb_bread(sb
, le32_to_cpu(p
->key
));
249 read_lock(&EXT2_I(inode
)->i_meta_lock
);
250 if (!verify_chain(chain
, p
))
252 add_chain(++p
, bh
, (__le32
*)bh
->b_data
+ *++offsets
);
253 read_unlock(&EXT2_I(inode
)->i_meta_lock
);
260 read_unlock(&EXT2_I(inode
)->i_meta_lock
);
271 * ext2_find_near - find a place for allocation with sufficient locality
273 * @ind: descriptor of indirect block.
275 * This function returns the preferred place for block allocation.
276 * It is used when heuristic for sequential allocation fails.
278 * + if there is a block to the left of our position - allocate near it.
279 * + if pointer will live in indirect block - allocate near that block.
280 * + if pointer will live in inode - allocate in the same cylinder group.
282 * In the latter case we colour the starting block by the callers PID to
283 * prevent it from clashing with concurrent allocations for a different inode
284 * in the same block group. The PID is used here so that functionally related
285 * files will be close-by on-disk.
287 * Caller must make sure that @ind is valid and will stay that way.
290 static ext2_fsblk_t
ext2_find_near(struct inode
*inode
, Indirect
*ind
)
292 struct ext2_inode_info
*ei
= EXT2_I(inode
);
293 __le32
*start
= ind
->bh
? (__le32
*) ind
->bh
->b_data
: ei
->i_data
;
295 ext2_fsblk_t bg_start
;
298 /* Try to find previous block */
299 for (p
= ind
->p
- 1; p
>= start
; p
--)
301 return le32_to_cpu(*p
);
303 /* No such thing, so let's try location of indirect block */
305 return ind
->bh
->b_blocknr
;
308 * It is going to be referred from inode itself? OK, just put it into
309 * the same cylinder group then.
311 bg_start
= ext2_group_first_block_no(inode
->i_sb
, ei
->i_block_group
);
312 colour
= (current
->pid
% 16) *
313 (EXT2_BLOCKS_PER_GROUP(inode
->i_sb
) / 16);
314 return bg_start
+ colour
;
318 * ext2_find_goal - find a preferred place for allocation.
320 * @block: block we want
321 * @partial: pointer to the last triple within a chain
323 * Returns preferred place for a block (the goal).
326 static inline ext2_fsblk_t
ext2_find_goal(struct inode
*inode
, long block
,
329 struct ext2_block_alloc_info
*block_i
;
331 block_i
= EXT2_I(inode
)->i_block_alloc_info
;
334 * try the heuristic for sequential allocation,
335 * failing that at least try to get decent locality.
337 if (block_i
&& (block
== block_i
->last_alloc_logical_block
+ 1)
338 && (block_i
->last_alloc_physical_block
!= 0)) {
339 return block_i
->last_alloc_physical_block
+ 1;
342 return ext2_find_near(inode
, partial
);
346 * ext2_blks_to_allocate: Look up the block map and count the number
347 * of direct blocks need to be allocated for the given branch.
349 * @branch: chain of indirect blocks
350 * @k: number of blocks need for indirect blocks
351 * @blks: number of data blocks to be mapped.
352 * @blocks_to_boundary: the offset in the indirect block
354 * return the total number of blocks to be allocate, including the
355 * direct and indirect blocks.
358 ext2_blks_to_allocate(Indirect
* branch
, int k
, unsigned long blks
,
359 int blocks_to_boundary
)
361 unsigned long count
= 0;
364 * Simple case, [t,d]Indirect block(s) has not allocated yet
365 * then it's clear blocks on that path have not allocated
368 /* right now don't hanel cross boundary allocation */
369 if (blks
< blocks_to_boundary
+ 1)
372 count
+= blocks_to_boundary
+ 1;
377 while (count
< blks
&& count
<= blocks_to_boundary
378 && le32_to_cpu(*(branch
[0].p
+ count
)) == 0) {
385 * ext2_alloc_blocks: multiple allocate blocks needed for a branch
386 * @indirect_blks: the number of blocks need to allocate for indirect
389 * @new_blocks: on return it will store the new block numbers for
390 * the indirect blocks(if needed) and the first direct block,
391 * @blks: on return it will store the total number of allocated
394 static int ext2_alloc_blocks(struct inode
*inode
,
395 ext2_fsblk_t goal
, int indirect_blks
, int blks
,
396 ext2_fsblk_t new_blocks
[4], int *err
)
399 unsigned long count
= 0;
401 ext2_fsblk_t current_block
= 0;
405 * Here we try to allocate the requested multiple blocks at once,
406 * on a best-effort basis.
407 * To build a branch, we should allocate blocks for
408 * the indirect blocks(if not allocated yet), and at least
409 * the first direct block of this branch. That's the
410 * minimum number of blocks need to allocate(required)
412 target
= blks
+ indirect_blks
;
416 /* allocating blocks for indirect blocks and direct blocks */
417 current_block
= ext2_new_blocks(inode
,goal
,&count
,err
);
422 /* allocate blocks for indirect blocks */
423 while (index
< indirect_blks
&& count
) {
424 new_blocks
[index
++] = current_block
++;
432 /* save the new block number for the first direct block */
433 new_blocks
[index
] = current_block
;
435 /* total number of blocks allocated for direct blocks */
440 for (i
= 0; i
<index
; i
++)
441 ext2_free_blocks(inode
, new_blocks
[i
], 1);
443 mark_inode_dirty(inode
);
448 * ext2_alloc_branch - allocate and set up a chain of blocks.
450 * @num: depth of the chain (number of blocks to allocate)
451 * @offsets: offsets (in the blocks) to store the pointers to next.
452 * @branch: place to store the chain in.
454 * This function allocates @num blocks, zeroes out all but the last one,
455 * links them into chain and (if we are synchronous) writes them to disk.
456 * In other words, it prepares a branch that can be spliced onto the
457 * inode. It stores the information about that chain in the branch[], in
458 * the same format as ext2_get_branch() would do. We are calling it after
459 * we had read the existing part of chain and partial points to the last
460 * triple of that (one with zero ->key). Upon the exit we have the same
461 * picture as after the successful ext2_get_block(), except that in one
462 * place chain is disconnected - *branch->p is still zero (we did not
463 * set the last link), but branch->key contains the number that should
464 * be placed into *branch->p to fill that gap.
466 * If allocation fails we free all blocks we've allocated (and forget
467 * their buffer_heads) and return the error value the from failed
468 * ext2_alloc_block() (normally -ENOSPC). Otherwise we set the chain
469 * as described above and return 0.
472 static int ext2_alloc_branch(struct inode
*inode
,
473 int indirect_blks
, int *blks
, ext2_fsblk_t goal
,
474 int *offsets
, Indirect
*branch
)
476 int blocksize
= inode
->i_sb
->s_blocksize
;
479 struct buffer_head
*bh
;
481 ext2_fsblk_t new_blocks
[4];
482 ext2_fsblk_t current_block
;
484 num
= ext2_alloc_blocks(inode
, goal
, indirect_blks
,
485 *blks
, new_blocks
, &err
);
489 branch
[0].key
= cpu_to_le32(new_blocks
[0]);
491 * metadata blocks and data blocks are allocated.
493 for (n
= 1; n
<= indirect_blks
; n
++) {
495 * Get buffer_head for parent block, zero it out
496 * and set the pointer to new one, then send
499 bh
= sb_getblk(inode
->i_sb
, new_blocks
[n
-1]);
506 memset(bh
->b_data
, 0, blocksize
);
507 branch
[n
].p
= (__le32
*) bh
->b_data
+ offsets
[n
];
508 branch
[n
].key
= cpu_to_le32(new_blocks
[n
]);
509 *branch
[n
].p
= branch
[n
].key
;
510 if ( n
== indirect_blks
) {
511 current_block
= new_blocks
[n
];
513 * End of chain, update the last new metablock of
514 * the chain to point to the new allocated
515 * data blocks numbers
517 for (i
=1; i
< num
; i
++)
518 *(branch
[n
].p
+ i
) = cpu_to_le32(++current_block
);
520 set_buffer_uptodate(bh
);
522 mark_buffer_dirty_inode(bh
, inode
);
523 /* We used to sync bh here if IS_SYNC(inode).
524 * But we now rely upon generic_write_sync()
525 * and b_inode_buffers. But not for directories.
527 if (S_ISDIR(inode
->i_mode
) && IS_DIRSYNC(inode
))
528 sync_dirty_buffer(bh
);
534 for (i
= 1; i
< n
; i
++)
535 bforget(branch
[i
].bh
);
536 for (i
= 0; i
< indirect_blks
; i
++)
537 ext2_free_blocks(inode
, new_blocks
[i
], 1);
538 ext2_free_blocks(inode
, new_blocks
[i
], num
);
543 * ext2_splice_branch - splice the allocated branch onto inode.
545 * @block: (logical) number of block we are adding
546 * @where: location of missing link
547 * @num: number of indirect blocks we are adding
548 * @blks: number of direct blocks we are adding
550 * This function fills the missing link and does all housekeeping needed in
551 * inode (->i_blocks, etc.). In case of success we end up with the full
552 * chain to new block and return 0.
554 static void ext2_splice_branch(struct inode
*inode
,
555 long block
, Indirect
*where
, int num
, int blks
)
558 struct ext2_block_alloc_info
*block_i
;
559 ext2_fsblk_t current_block
;
561 block_i
= EXT2_I(inode
)->i_block_alloc_info
;
563 /* XXX LOCKING probably should have i_meta_lock ?*/
566 *where
->p
= where
->key
;
569 * Update the host buffer_head or inode to point to more just allocated
570 * direct blocks blocks
572 if (num
== 0 && blks
> 1) {
573 current_block
= le32_to_cpu(where
->key
) + 1;
574 for (i
= 1; i
< blks
; i
++)
575 *(where
->p
+ i
) = cpu_to_le32(current_block
++);
579 * update the most recently allocated logical & physical block
580 * in i_block_alloc_info, to assist find the proper goal block for next
584 block_i
->last_alloc_logical_block
= block
+ blks
- 1;
585 block_i
->last_alloc_physical_block
=
586 le32_to_cpu(where
[num
].key
) + blks
- 1;
589 /* We are done with atomic stuff, now do the rest of housekeeping */
591 /* had we spliced it onto indirect block? */
593 mark_buffer_dirty_inode(where
->bh
, inode
);
595 inode
->i_ctime
= CURRENT_TIME_SEC
;
596 mark_inode_dirty(inode
);
600 * Allocation strategy is simple: if we have to allocate something, we will
601 * have to go the whole way to leaf. So let's do it before attaching anything
602 * to tree, set linkage between the newborn blocks, write them if sync is
603 * required, recheck the path, free and repeat if check fails, otherwise
604 * set the last missing link (that will protect us from any truncate-generated
605 * removals - all blocks on the path are immune now) and possibly force the
606 * write on the parent block.
607 * That has a nice additional property: no special recovery from the failed
608 * allocations is needed - we simply release blocks and do not touch anything
609 * reachable from inode.
611 * `handle' can be NULL if create == 0.
613 * return > 0, # of blocks mapped or allocated.
614 * return = 0, if plain lookup failed.
615 * return < 0, error case.
617 static int ext2_get_blocks(struct inode
*inode
,
618 sector_t iblock
, unsigned long maxblocks
,
619 struct buffer_head
*bh_result
,
628 int blocks_to_boundary
= 0;
630 struct ext2_inode_info
*ei
= EXT2_I(inode
);
632 ext2_fsblk_t first_block
= 0;
634 depth
= ext2_block_to_path(inode
,iblock
,offsets
,&blocks_to_boundary
);
639 partial
= ext2_get_branch(inode
, depth
, offsets
, chain
, &err
);
640 /* Simplest case - block found, no allocation needed */
642 first_block
= le32_to_cpu(chain
[depth
- 1].key
);
643 clear_buffer_new(bh_result
); /* What's this do? */
646 while (count
< maxblocks
&& count
<= blocks_to_boundary
) {
649 if (!verify_chain(chain
, chain
+ depth
- 1)) {
651 * Indirect block might be removed by
652 * truncate while we were reading it.
653 * Handling of that case: forget what we've
654 * got now, go to reread.
660 blk
= le32_to_cpu(*(chain
[depth
-1].p
+ count
));
661 if (blk
== first_block
+ count
)
670 /* Next simple case - plain lookup or failed read of indirect block */
671 if (!create
|| err
== -EIO
)
674 mutex_lock(&ei
->truncate_mutex
);
676 * If the indirect block is missing while we are reading
677 * the chain(ext2_get_branch() returns -EAGAIN err), or
678 * if the chain has been changed after we grab the semaphore,
679 * (either because another process truncated this branch, or
680 * another get_block allocated this branch) re-grab the chain to see if
681 * the request block has been allocated or not.
683 * Since we already block the truncate/other get_block
684 * at this point, we will have the current copy of the chain when we
685 * splice the branch into the tree.
687 if (err
== -EAGAIN
|| !verify_chain(chain
, partial
)) {
688 while (partial
> chain
) {
692 partial
= ext2_get_branch(inode
, depth
, offsets
, chain
, &err
);
695 mutex_unlock(&ei
->truncate_mutex
);
698 clear_buffer_new(bh_result
);
704 * Okay, we need to do block allocation. Lazily initialize the block
705 * allocation info here if necessary
707 if (S_ISREG(inode
->i_mode
) && (!ei
->i_block_alloc_info
))
708 ext2_init_block_alloc_info(inode
);
710 goal
= ext2_find_goal(inode
, iblock
, partial
);
712 /* the number of blocks need to allocate for [d,t]indirect blocks */
713 indirect_blks
= (chain
+ depth
) - partial
- 1;
715 * Next look up the indirect map to count the totoal number of
716 * direct blocks to allocate for this branch.
718 count
= ext2_blks_to_allocate(partial
, indirect_blks
,
719 maxblocks
, blocks_to_boundary
);
721 * XXX ???? Block out ext2_truncate while we alter the tree
723 err
= ext2_alloc_branch(inode
, indirect_blks
, &count
, goal
,
724 offsets
+ (partial
- chain
), partial
);
727 mutex_unlock(&ei
->truncate_mutex
);
731 if (ext2_use_xip(inode
->i_sb
)) {
733 * we need to clear the block
735 err
= ext2_clear_xip_target (inode
,
736 le32_to_cpu(chain
[depth
-1].key
));
738 mutex_unlock(&ei
->truncate_mutex
);
743 ext2_splice_branch(inode
, iblock
, partial
, indirect_blks
, count
);
744 mutex_unlock(&ei
->truncate_mutex
);
745 set_buffer_new(bh_result
);
747 map_bh(bh_result
, inode
->i_sb
, le32_to_cpu(chain
[depth
-1].key
));
748 if (count
> blocks_to_boundary
)
749 set_buffer_boundary(bh_result
);
751 /* Clean up and exit */
752 partial
= chain
+ depth
- 1; /* the whole chain */
754 while (partial
> chain
) {
761 int ext2_get_block(struct inode
*inode
, sector_t iblock
, struct buffer_head
*bh_result
, int create
)
763 unsigned max_blocks
= bh_result
->b_size
>> inode
->i_blkbits
;
764 int ret
= ext2_get_blocks(inode
, iblock
, max_blocks
,
767 bh_result
->b_size
= (ret
<< inode
->i_blkbits
);
774 int ext2_fiemap(struct inode
*inode
, struct fiemap_extent_info
*fieinfo
,
777 return generic_block_fiemap(inode
, fieinfo
, start
, len
,
781 static int ext2_writepage(struct page
*page
, struct writeback_control
*wbc
)
783 return block_write_full_page(page
, ext2_get_block
, wbc
);
786 static int ext2_readpage(struct file
*file
, struct page
*page
)
788 return mpage_readpage(page
, ext2_get_block
);
792 ext2_readpages(struct file
*file
, struct address_space
*mapping
,
793 struct list_head
*pages
, unsigned nr_pages
)
795 return mpage_readpages(mapping
, pages
, nr_pages
, ext2_get_block
);
799 ext2_write_begin(struct file
*file
, struct address_space
*mapping
,
800 loff_t pos
, unsigned len
, unsigned flags
,
801 struct page
**pagep
, void **fsdata
)
805 ret
= block_write_begin(mapping
, pos
, len
, flags
, pagep
,
808 ext2_write_failed(mapping
, pos
+ len
);
812 static int ext2_write_end(struct file
*file
, struct address_space
*mapping
,
813 loff_t pos
, unsigned len
, unsigned copied
,
814 struct page
*page
, void *fsdata
)
818 ret
= generic_write_end(file
, mapping
, pos
, len
, copied
, page
, fsdata
);
820 ext2_write_failed(mapping
, pos
+ len
);
825 ext2_nobh_write_begin(struct file
*file
, struct address_space
*mapping
,
826 loff_t pos
, unsigned len
, unsigned flags
,
827 struct page
**pagep
, void **fsdata
)
831 ret
= nobh_write_begin(mapping
, pos
, len
, flags
, pagep
, fsdata
,
834 ext2_write_failed(mapping
, pos
+ len
);
838 static int ext2_nobh_writepage(struct page
*page
,
839 struct writeback_control
*wbc
)
841 return nobh_writepage(page
, ext2_get_block
, wbc
);
844 static sector_t
ext2_bmap(struct address_space
*mapping
, sector_t block
)
846 return generic_block_bmap(mapping
,block
,ext2_get_block
);
850 ext2_direct_IO(int rw
, struct kiocb
*iocb
, const struct iovec
*iov
,
851 loff_t offset
, unsigned long nr_segs
)
853 struct file
*file
= iocb
->ki_filp
;
854 struct address_space
*mapping
= file
->f_mapping
;
855 struct inode
*inode
= mapping
->host
;
858 ret
= blockdev_direct_IO(rw
, iocb
, inode
, iov
, offset
, nr_segs
,
860 if (ret
< 0 && (rw
& WRITE
))
861 ext2_write_failed(mapping
, offset
+ iov_length(iov
, nr_segs
));
866 ext2_writepages(struct address_space
*mapping
, struct writeback_control
*wbc
)
868 return mpage_writepages(mapping
, wbc
, ext2_get_block
);
871 const struct address_space_operations ext2_aops
= {
872 .readpage
= ext2_readpage
,
873 .readpages
= ext2_readpages
,
874 .writepage
= ext2_writepage
,
875 .write_begin
= ext2_write_begin
,
876 .write_end
= ext2_write_end
,
878 .direct_IO
= ext2_direct_IO
,
879 .writepages
= ext2_writepages
,
880 .migratepage
= buffer_migrate_page
,
881 .is_partially_uptodate
= block_is_partially_uptodate
,
882 .error_remove_page
= generic_error_remove_page
,
885 const struct address_space_operations ext2_aops_xip
= {
887 .get_xip_mem
= ext2_get_xip_mem
,
890 const struct address_space_operations ext2_nobh_aops
= {
891 .readpage
= ext2_readpage
,
892 .readpages
= ext2_readpages
,
893 .writepage
= ext2_nobh_writepage
,
894 .write_begin
= ext2_nobh_write_begin
,
895 .write_end
= nobh_write_end
,
897 .direct_IO
= ext2_direct_IO
,
898 .writepages
= ext2_writepages
,
899 .migratepage
= buffer_migrate_page
,
900 .error_remove_page
= generic_error_remove_page
,
904 * Probably it should be a library function... search for first non-zero word
905 * or memcmp with zero_page, whatever is better for particular architecture.
908 static inline int all_zeroes(__le32
*p
, __le32
*q
)
917 * ext2_find_shared - find the indirect blocks for partial truncation.
918 * @inode: inode in question
919 * @depth: depth of the affected branch
920 * @offsets: offsets of pointers in that branch (see ext2_block_to_path)
921 * @chain: place to store the pointers to partial indirect blocks
922 * @top: place to the (detached) top of branch
924 * This is a helper function used by ext2_truncate().
926 * When we do truncate() we may have to clean the ends of several indirect
927 * blocks but leave the blocks themselves alive. Block is partially
928 * truncated if some data below the new i_size is referred from it (and
929 * it is on the path to the first completely truncated data block, indeed).
930 * We have to free the top of that path along with everything to the right
931 * of the path. Since no allocation past the truncation point is possible
932 * until ext2_truncate() finishes, we may safely do the latter, but top
933 * of branch may require special attention - pageout below the truncation
934 * point might try to populate it.
936 * We atomically detach the top of branch from the tree, store the block
937 * number of its root in *@top, pointers to buffer_heads of partially
938 * truncated blocks - in @chain[].bh and pointers to their last elements
939 * that should not be removed - in @chain[].p. Return value is the pointer
940 * to last filled element of @chain.
942 * The work left to caller to do the actual freeing of subtrees:
943 * a) free the subtree starting from *@top
944 * b) free the subtrees whose roots are stored in
945 * (@chain[i].p+1 .. end of @chain[i].bh->b_data)
946 * c) free the subtrees growing from the inode past the @chain[0].p
947 * (no partially truncated stuff there).
950 static Indirect
*ext2_find_shared(struct inode
*inode
,
956 Indirect
*partial
, *p
;
960 for (k
= depth
; k
> 1 && !offsets
[k
-1]; k
--)
962 partial
= ext2_get_branch(inode
, k
, offsets
, chain
, &err
);
964 partial
= chain
+ k
-1;
966 * If the branch acquired continuation since we've looked at it -
967 * fine, it should all survive and (new) top doesn't belong to us.
969 write_lock(&EXT2_I(inode
)->i_meta_lock
);
970 if (!partial
->key
&& *partial
->p
) {
971 write_unlock(&EXT2_I(inode
)->i_meta_lock
);
974 for (p
=partial
; p
>chain
&& all_zeroes((__le32
*)p
->bh
->b_data
,p
->p
); p
--)
977 * OK, we've found the last block that must survive. The rest of our
978 * branch should be detached before unlocking. However, if that rest
979 * of branch is all ours and does not grow immediately from the inode
980 * it's easier to cheat and just decrement partial->p.
982 if (p
== chain
+ k
- 1 && p
> chain
) {
988 write_unlock(&EXT2_I(inode
)->i_meta_lock
);
1000 * ext2_free_data - free a list of data blocks
1001 * @inode: inode we are dealing with
1002 * @p: array of block numbers
1003 * @q: points immediately past the end of array
1005 * We are freeing all blocks referred from that array (numbers are
1006 * stored as little-endian 32-bit) and updating @inode->i_blocks
1009 static inline void ext2_free_data(struct inode
*inode
, __le32
*p
, __le32
*q
)
1011 unsigned long block_to_free
= 0, count
= 0;
1014 for ( ; p
< q
; p
++) {
1015 nr
= le32_to_cpu(*p
);
1018 /* accumulate blocks to free if they're contiguous */
1021 else if (block_to_free
== nr
- count
)
1024 ext2_free_blocks (inode
, block_to_free
, count
);
1025 mark_inode_dirty(inode
);
1033 ext2_free_blocks (inode
, block_to_free
, count
);
1034 mark_inode_dirty(inode
);
1039 * ext2_free_branches - free an array of branches
1040 * @inode: inode we are dealing with
1041 * @p: array of block numbers
1042 * @q: pointer immediately past the end of array
1043 * @depth: depth of the branches to free
1045 * We are freeing all blocks referred from these branches (numbers are
1046 * stored as little-endian 32-bit) and updating @inode->i_blocks
1049 static void ext2_free_branches(struct inode
*inode
, __le32
*p
, __le32
*q
, int depth
)
1051 struct buffer_head
* bh
;
1055 int addr_per_block
= EXT2_ADDR_PER_BLOCK(inode
->i_sb
);
1056 for ( ; p
< q
; p
++) {
1057 nr
= le32_to_cpu(*p
);
1061 bh
= sb_bread(inode
->i_sb
, nr
);
1063 * A read failure? Report error and clear slot
1067 ext2_error(inode
->i_sb
, "ext2_free_branches",
1068 "Read failure, inode=%ld, block=%ld",
1072 ext2_free_branches(inode
,
1073 (__le32
*)bh
->b_data
,
1074 (__le32
*)bh
->b_data
+ addr_per_block
,
1077 ext2_free_blocks(inode
, nr
, 1);
1078 mark_inode_dirty(inode
);
1081 ext2_free_data(inode
, p
, q
);
1084 static void __ext2_truncate_blocks(struct inode
*inode
, loff_t offset
)
1086 __le32
*i_data
= EXT2_I(inode
)->i_data
;
1087 struct ext2_inode_info
*ei
= EXT2_I(inode
);
1088 int addr_per_block
= EXT2_ADDR_PER_BLOCK(inode
->i_sb
);
1096 blocksize
= inode
->i_sb
->s_blocksize
;
1097 iblock
= (offset
+ blocksize
-1) >> EXT2_BLOCK_SIZE_BITS(inode
->i_sb
);
1099 n
= ext2_block_to_path(inode
, iblock
, offsets
, NULL
);
1104 * From here we block out all ext2_get_block() callers who want to
1105 * modify the block allocation tree.
1107 mutex_lock(&ei
->truncate_mutex
);
1110 ext2_free_data(inode
, i_data
+offsets
[0],
1111 i_data
+ EXT2_NDIR_BLOCKS
);
1115 partial
= ext2_find_shared(inode
, n
, offsets
, chain
, &nr
);
1116 /* Kill the top of shared branch (already detached) */
1118 if (partial
== chain
)
1119 mark_inode_dirty(inode
);
1121 mark_buffer_dirty_inode(partial
->bh
, inode
);
1122 ext2_free_branches(inode
, &nr
, &nr
+1, (chain
+n
-1) - partial
);
1124 /* Clear the ends of indirect blocks on the shared branch */
1125 while (partial
> chain
) {
1126 ext2_free_branches(inode
,
1128 (__le32
*)partial
->bh
->b_data
+addr_per_block
,
1129 (chain
+n
-1) - partial
);
1130 mark_buffer_dirty_inode(partial
->bh
, inode
);
1131 brelse (partial
->bh
);
1135 /* Kill the remaining (whole) subtrees */
1136 switch (offsets
[0]) {
1138 nr
= i_data
[EXT2_IND_BLOCK
];
1140 i_data
[EXT2_IND_BLOCK
] = 0;
1141 mark_inode_dirty(inode
);
1142 ext2_free_branches(inode
, &nr
, &nr
+1, 1);
1144 case EXT2_IND_BLOCK
:
1145 nr
= i_data
[EXT2_DIND_BLOCK
];
1147 i_data
[EXT2_DIND_BLOCK
] = 0;
1148 mark_inode_dirty(inode
);
1149 ext2_free_branches(inode
, &nr
, &nr
+1, 2);
1151 case EXT2_DIND_BLOCK
:
1152 nr
= i_data
[EXT2_TIND_BLOCK
];
1154 i_data
[EXT2_TIND_BLOCK
] = 0;
1155 mark_inode_dirty(inode
);
1156 ext2_free_branches(inode
, &nr
, &nr
+1, 3);
1158 case EXT2_TIND_BLOCK
:
1162 ext2_discard_reservation(inode
);
1164 mutex_unlock(&ei
->truncate_mutex
);
1167 static void ext2_truncate_blocks(struct inode
*inode
, loff_t offset
)
1170 * XXX: it seems like a bug here that we don't allow
1171 * IS_APPEND inode to have blocks-past-i_size trimmed off.
1172 * review and fix this.
1174 * Also would be nice to be able to handle IO errors and such,
1175 * but that's probably too much to ask.
1177 if (!(S_ISREG(inode
->i_mode
) || S_ISDIR(inode
->i_mode
) ||
1178 S_ISLNK(inode
->i_mode
)))
1180 if (ext2_inode_is_fast_symlink(inode
))
1182 if (IS_APPEND(inode
) || IS_IMMUTABLE(inode
))
1184 __ext2_truncate_blocks(inode
, offset
);
1187 static int ext2_setsize(struct inode
*inode
, loff_t newsize
)
1191 if (!(S_ISREG(inode
->i_mode
) || S_ISDIR(inode
->i_mode
) ||
1192 S_ISLNK(inode
->i_mode
)))
1194 if (ext2_inode_is_fast_symlink(inode
))
1196 if (IS_APPEND(inode
) || IS_IMMUTABLE(inode
))
1199 inode_dio_wait(inode
);
1201 if (mapping_is_xip(inode
->i_mapping
))
1202 error
= xip_truncate_page(inode
->i_mapping
, newsize
);
1203 else if (test_opt(inode
->i_sb
, NOBH
))
1204 error
= nobh_truncate_page(inode
->i_mapping
,
1205 newsize
, ext2_get_block
);
1207 error
= block_truncate_page(inode
->i_mapping
,
1208 newsize
, ext2_get_block
);
1212 truncate_setsize(inode
, newsize
);
1213 __ext2_truncate_blocks(inode
, newsize
);
1215 inode
->i_mtime
= inode
->i_ctime
= CURRENT_TIME_SEC
;
1216 if (inode_needs_sync(inode
)) {
1217 sync_mapping_buffers(inode
->i_mapping
);
1218 sync_inode_metadata(inode
, 1);
1220 mark_inode_dirty(inode
);
1226 static struct ext2_inode
*ext2_get_inode(struct super_block
*sb
, ino_t ino
,
1227 struct buffer_head
**p
)
1229 struct buffer_head
* bh
;
1230 unsigned long block_group
;
1231 unsigned long block
;
1232 unsigned long offset
;
1233 struct ext2_group_desc
* gdp
;
1236 if ((ino
!= EXT2_ROOT_INO
&& ino
< EXT2_FIRST_INO(sb
)) ||
1237 ino
> le32_to_cpu(EXT2_SB(sb
)->s_es
->s_inodes_count
))
1240 block_group
= (ino
- 1) / EXT2_INODES_PER_GROUP(sb
);
1241 gdp
= ext2_get_group_desc(sb
, block_group
, NULL
);
1245 * Figure out the offset within the block group inode table
1247 offset
= ((ino
- 1) % EXT2_INODES_PER_GROUP(sb
)) * EXT2_INODE_SIZE(sb
);
1248 block
= le32_to_cpu(gdp
->bg_inode_table
) +
1249 (offset
>> EXT2_BLOCK_SIZE_BITS(sb
));
1250 if (!(bh
= sb_bread(sb
, block
)))
1254 offset
&= (EXT2_BLOCK_SIZE(sb
) - 1);
1255 return (struct ext2_inode
*) (bh
->b_data
+ offset
);
1258 ext2_error(sb
, "ext2_get_inode", "bad inode number: %lu",
1259 (unsigned long) ino
);
1260 return ERR_PTR(-EINVAL
);
1262 ext2_error(sb
, "ext2_get_inode",
1263 "unable to read inode block - inode=%lu, block=%lu",
1264 (unsigned long) ino
, block
);
1266 return ERR_PTR(-EIO
);
1269 void ext2_set_inode_flags(struct inode
*inode
)
1271 unsigned int flags
= EXT2_I(inode
)->i_flags
;
1273 inode
->i_flags
&= ~(S_SYNC
|S_APPEND
|S_IMMUTABLE
|S_NOATIME
|S_DIRSYNC
);
1274 if (flags
& EXT2_SYNC_FL
)
1275 inode
->i_flags
|= S_SYNC
;
1276 if (flags
& EXT2_APPEND_FL
)
1277 inode
->i_flags
|= S_APPEND
;
1278 if (flags
& EXT2_IMMUTABLE_FL
)
1279 inode
->i_flags
|= S_IMMUTABLE
;
1280 if (flags
& EXT2_NOATIME_FL
)
1281 inode
->i_flags
|= S_NOATIME
;
1282 if (flags
& EXT2_DIRSYNC_FL
)
1283 inode
->i_flags
|= S_DIRSYNC
;
1286 /* Propagate flags from i_flags to EXT2_I(inode)->i_flags */
1287 void ext2_get_inode_flags(struct ext2_inode_info
*ei
)
1289 unsigned int flags
= ei
->vfs_inode
.i_flags
;
1291 ei
->i_flags
&= ~(EXT2_SYNC_FL
|EXT2_APPEND_FL
|
1292 EXT2_IMMUTABLE_FL
|EXT2_NOATIME_FL
|EXT2_DIRSYNC_FL
);
1294 ei
->i_flags
|= EXT2_SYNC_FL
;
1295 if (flags
& S_APPEND
)
1296 ei
->i_flags
|= EXT2_APPEND_FL
;
1297 if (flags
& S_IMMUTABLE
)
1298 ei
->i_flags
|= EXT2_IMMUTABLE_FL
;
1299 if (flags
& S_NOATIME
)
1300 ei
->i_flags
|= EXT2_NOATIME_FL
;
1301 if (flags
& S_DIRSYNC
)
1302 ei
->i_flags
|= EXT2_DIRSYNC_FL
;
1305 struct inode
*ext2_iget (struct super_block
*sb
, unsigned long ino
)
1307 struct ext2_inode_info
*ei
;
1308 struct buffer_head
* bh
;
1309 struct ext2_inode
*raw_inode
;
1310 struct inode
*inode
;
1316 inode
= iget_locked(sb
, ino
);
1318 return ERR_PTR(-ENOMEM
);
1319 if (!(inode
->i_state
& I_NEW
))
1323 ei
->i_block_alloc_info
= NULL
;
1325 raw_inode
= ext2_get_inode(inode
->i_sb
, ino
, &bh
);
1326 if (IS_ERR(raw_inode
)) {
1327 ret
= PTR_ERR(raw_inode
);
1331 inode
->i_mode
= le16_to_cpu(raw_inode
->i_mode
);
1332 i_uid
= (uid_t
)le16_to_cpu(raw_inode
->i_uid_low
);
1333 i_gid
= (gid_t
)le16_to_cpu(raw_inode
->i_gid_low
);
1334 if (!(test_opt (inode
->i_sb
, NO_UID32
))) {
1335 i_uid
|= le16_to_cpu(raw_inode
->i_uid_high
) << 16;
1336 i_gid
|= le16_to_cpu(raw_inode
->i_gid_high
) << 16;
1338 i_uid_write(inode
, i_uid
);
1339 i_gid_write(inode
, i_gid
);
1340 set_nlink(inode
, le16_to_cpu(raw_inode
->i_links_count
));
1341 inode
->i_size
= le32_to_cpu(raw_inode
->i_size
);
1342 inode
->i_atime
.tv_sec
= (signed)le32_to_cpu(raw_inode
->i_atime
);
1343 inode
->i_ctime
.tv_sec
= (signed)le32_to_cpu(raw_inode
->i_ctime
);
1344 inode
->i_mtime
.tv_sec
= (signed)le32_to_cpu(raw_inode
->i_mtime
);
1345 inode
->i_atime
.tv_nsec
= inode
->i_mtime
.tv_nsec
= inode
->i_ctime
.tv_nsec
= 0;
1346 ei
->i_dtime
= le32_to_cpu(raw_inode
->i_dtime
);
1347 /* We now have enough fields to check if the inode was active or not.
1348 * This is needed because nfsd might try to access dead inodes
1349 * the test is that same one that e2fsck uses
1350 * NeilBrown 1999oct15
1352 if (inode
->i_nlink
== 0 && (inode
->i_mode
== 0 || ei
->i_dtime
)) {
1353 /* this inode is deleted */
1358 inode
->i_blocks
= le32_to_cpu(raw_inode
->i_blocks
);
1359 ei
->i_flags
= le32_to_cpu(raw_inode
->i_flags
);
1360 ei
->i_faddr
= le32_to_cpu(raw_inode
->i_faddr
);
1361 ei
->i_frag_no
= raw_inode
->i_frag
;
1362 ei
->i_frag_size
= raw_inode
->i_fsize
;
1363 ei
->i_file_acl
= le32_to_cpu(raw_inode
->i_file_acl
);
1365 if (S_ISREG(inode
->i_mode
))
1366 inode
->i_size
|= ((__u64
)le32_to_cpu(raw_inode
->i_size_high
)) << 32;
1368 ei
->i_dir_acl
= le32_to_cpu(raw_inode
->i_dir_acl
);
1370 inode
->i_generation
= le32_to_cpu(raw_inode
->i_generation
);
1372 ei
->i_block_group
= (ino
- 1) / EXT2_INODES_PER_GROUP(inode
->i_sb
);
1373 ei
->i_dir_start_lookup
= 0;
1376 * NOTE! The in-memory inode i_data array is in little-endian order
1377 * even on big-endian machines: we do NOT byteswap the block numbers!
1379 for (n
= 0; n
< EXT2_N_BLOCKS
; n
++)
1380 ei
->i_data
[n
] = raw_inode
->i_block
[n
];
1382 if (S_ISREG(inode
->i_mode
)) {
1383 inode
->i_op
= &ext2_file_inode_operations
;
1384 if (ext2_use_xip(inode
->i_sb
)) {
1385 inode
->i_mapping
->a_ops
= &ext2_aops_xip
;
1386 inode
->i_fop
= &ext2_xip_file_operations
;
1387 } else if (test_opt(inode
->i_sb
, NOBH
)) {
1388 inode
->i_mapping
->a_ops
= &ext2_nobh_aops
;
1389 inode
->i_fop
= &ext2_file_operations
;
1391 inode
->i_mapping
->a_ops
= &ext2_aops
;
1392 inode
->i_fop
= &ext2_file_operations
;
1394 } else if (S_ISDIR(inode
->i_mode
)) {
1395 inode
->i_op
= &ext2_dir_inode_operations
;
1396 inode
->i_fop
= &ext2_dir_operations
;
1397 if (test_opt(inode
->i_sb
, NOBH
))
1398 inode
->i_mapping
->a_ops
= &ext2_nobh_aops
;
1400 inode
->i_mapping
->a_ops
= &ext2_aops
;
1401 } else if (S_ISLNK(inode
->i_mode
)) {
1402 if (ext2_inode_is_fast_symlink(inode
)) {
1403 inode
->i_op
= &ext2_fast_symlink_inode_operations
;
1404 nd_terminate_link(ei
->i_data
, inode
->i_size
,
1405 sizeof(ei
->i_data
) - 1);
1407 inode
->i_op
= &ext2_symlink_inode_operations
;
1408 if (test_opt(inode
->i_sb
, NOBH
))
1409 inode
->i_mapping
->a_ops
= &ext2_nobh_aops
;
1411 inode
->i_mapping
->a_ops
= &ext2_aops
;
1414 inode
->i_op
= &ext2_special_inode_operations
;
1415 if (raw_inode
->i_block
[0])
1416 init_special_inode(inode
, inode
->i_mode
,
1417 old_decode_dev(le32_to_cpu(raw_inode
->i_block
[0])));
1419 init_special_inode(inode
, inode
->i_mode
,
1420 new_decode_dev(le32_to_cpu(raw_inode
->i_block
[1])));
1423 ext2_set_inode_flags(inode
);
1424 unlock_new_inode(inode
);
1429 return ERR_PTR(ret
);
1432 static int __ext2_write_inode(struct inode
*inode
, int do_sync
)
1434 struct ext2_inode_info
*ei
= EXT2_I(inode
);
1435 struct super_block
*sb
= inode
->i_sb
;
1436 ino_t ino
= inode
->i_ino
;
1437 uid_t uid
= i_uid_read(inode
);
1438 gid_t gid
= i_gid_read(inode
);
1439 struct buffer_head
* bh
;
1440 struct ext2_inode
* raw_inode
= ext2_get_inode(sb
, ino
, &bh
);
1444 if (IS_ERR(raw_inode
))
1447 /* For fields not not tracking in the in-memory inode,
1448 * initialise them to zero for new inodes. */
1449 if (ei
->i_state
& EXT2_STATE_NEW
)
1450 memset(raw_inode
, 0, EXT2_SB(sb
)->s_inode_size
);
1452 ext2_get_inode_flags(ei
);
1453 raw_inode
->i_mode
= cpu_to_le16(inode
->i_mode
);
1454 if (!(test_opt(sb
, NO_UID32
))) {
1455 raw_inode
->i_uid_low
= cpu_to_le16(low_16_bits(uid
));
1456 raw_inode
->i_gid_low
= cpu_to_le16(low_16_bits(gid
));
1458 * Fix up interoperability with old kernels. Otherwise, old inodes get
1459 * re-used with the upper 16 bits of the uid/gid intact
1462 raw_inode
->i_uid_high
= cpu_to_le16(high_16_bits(uid
));
1463 raw_inode
->i_gid_high
= cpu_to_le16(high_16_bits(gid
));
1465 raw_inode
->i_uid_high
= 0;
1466 raw_inode
->i_gid_high
= 0;
1469 raw_inode
->i_uid_low
= cpu_to_le16(fs_high2lowuid(uid
));
1470 raw_inode
->i_gid_low
= cpu_to_le16(fs_high2lowgid(gid
));
1471 raw_inode
->i_uid_high
= 0;
1472 raw_inode
->i_gid_high
= 0;
1474 raw_inode
->i_links_count
= cpu_to_le16(inode
->i_nlink
);
1475 raw_inode
->i_size
= cpu_to_le32(inode
->i_size
);
1476 raw_inode
->i_atime
= cpu_to_le32(inode
->i_atime
.tv_sec
);
1477 raw_inode
->i_ctime
= cpu_to_le32(inode
->i_ctime
.tv_sec
);
1478 raw_inode
->i_mtime
= cpu_to_le32(inode
->i_mtime
.tv_sec
);
1480 raw_inode
->i_blocks
= cpu_to_le32(inode
->i_blocks
);
1481 raw_inode
->i_dtime
= cpu_to_le32(ei
->i_dtime
);
1482 raw_inode
->i_flags
= cpu_to_le32(ei
->i_flags
);
1483 raw_inode
->i_faddr
= cpu_to_le32(ei
->i_faddr
);
1484 raw_inode
->i_frag
= ei
->i_frag_no
;
1485 raw_inode
->i_fsize
= ei
->i_frag_size
;
1486 raw_inode
->i_file_acl
= cpu_to_le32(ei
->i_file_acl
);
1487 if (!S_ISREG(inode
->i_mode
))
1488 raw_inode
->i_dir_acl
= cpu_to_le32(ei
->i_dir_acl
);
1490 raw_inode
->i_size_high
= cpu_to_le32(inode
->i_size
>> 32);
1491 if (inode
->i_size
> 0x7fffffffULL
) {
1492 if (!EXT2_HAS_RO_COMPAT_FEATURE(sb
,
1493 EXT2_FEATURE_RO_COMPAT_LARGE_FILE
) ||
1494 EXT2_SB(sb
)->s_es
->s_rev_level
==
1495 cpu_to_le32(EXT2_GOOD_OLD_REV
)) {
1496 /* If this is the first large file
1497 * created, add a flag to the superblock.
1499 spin_lock(&EXT2_SB(sb
)->s_lock
);
1500 ext2_update_dynamic_rev(sb
);
1501 EXT2_SET_RO_COMPAT_FEATURE(sb
,
1502 EXT2_FEATURE_RO_COMPAT_LARGE_FILE
);
1503 spin_unlock(&EXT2_SB(sb
)->s_lock
);
1504 ext2_write_super(sb
);
1509 raw_inode
->i_generation
= cpu_to_le32(inode
->i_generation
);
1510 if (S_ISCHR(inode
->i_mode
) || S_ISBLK(inode
->i_mode
)) {
1511 if (old_valid_dev(inode
->i_rdev
)) {
1512 raw_inode
->i_block
[0] =
1513 cpu_to_le32(old_encode_dev(inode
->i_rdev
));
1514 raw_inode
->i_block
[1] = 0;
1516 raw_inode
->i_block
[0] = 0;
1517 raw_inode
->i_block
[1] =
1518 cpu_to_le32(new_encode_dev(inode
->i_rdev
));
1519 raw_inode
->i_block
[2] = 0;
1521 } else for (n
= 0; n
< EXT2_N_BLOCKS
; n
++)
1522 raw_inode
->i_block
[n
] = ei
->i_data
[n
];
1523 mark_buffer_dirty(bh
);
1525 sync_dirty_buffer(bh
);
1526 if (buffer_req(bh
) && !buffer_uptodate(bh
)) {
1527 printk ("IO error syncing ext2 inode [%s:%08lx]\n",
1528 sb
->s_id
, (unsigned long) ino
);
1532 ei
->i_state
&= ~EXT2_STATE_NEW
;
1537 int ext2_write_inode(struct inode
*inode
, struct writeback_control
*wbc
)
1539 return __ext2_write_inode(inode
, wbc
->sync_mode
== WB_SYNC_ALL
);
1542 int ext2_setattr(struct dentry
*dentry
, struct iattr
*iattr
)
1544 struct inode
*inode
= dentry
->d_inode
;
1547 error
= inode_change_ok(inode
, iattr
);
1551 if (is_quota_modification(inode
, iattr
))
1552 dquot_initialize(inode
);
1553 if ((iattr
->ia_valid
& ATTR_UID
&& !uid_eq(iattr
->ia_uid
, inode
->i_uid
)) ||
1554 (iattr
->ia_valid
& ATTR_GID
&& !gid_eq(iattr
->ia_gid
, inode
->i_gid
))) {
1555 error
= dquot_transfer(inode
, iattr
);
1559 if (iattr
->ia_valid
& ATTR_SIZE
&& iattr
->ia_size
!= inode
->i_size
) {
1560 error
= ext2_setsize(inode
, iattr
->ia_size
);
1564 setattr_copy(inode
, iattr
);
1565 if (iattr
->ia_valid
& ATTR_MODE
)
1566 error
= ext2_acl_chmod(inode
);
1567 mark_inode_dirty(inode
);