2 * Copyright IBM Corporation, 2007
3 * Author Aneesh Kumar K.V <aneesh.kumar@linux.vnet.ibm.com>
5 * This program is free software; you can redistribute it and/or modify it
6 * under the terms of version 2.1 of the GNU Lesser General Public License
7 * as published by the Free Software Foundation.
9 * This program is distributed in the hope that it would be useful, but
10 * WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
15 #include <linux/module.h>
16 #include "ext4_jbd2.h"
17 #include "ext4_extents.h"
20 * The contiguous blocks details which can be
21 * represented by a single extent
23 struct list_blocks_struct
{
24 ext4_lblk_t first_block
, last_block
;
25 ext4_fsblk_t first_pblock
, last_pblock
;
28 static int finish_range(handle_t
*handle
, struct inode
*inode
,
29 struct list_blocks_struct
*lb
)
32 int retval
= 0, needed
;
33 struct ext4_extent newext
;
34 struct ext4_ext_path
*path
;
35 if (lb
->first_pblock
== 0)
38 /* Add the extent to temp inode*/
39 newext
.ee_block
= cpu_to_le32(lb
->first_block
);
40 newext
.ee_len
= cpu_to_le16(lb
->last_block
- lb
->first_block
+ 1);
41 ext4_ext_store_pblock(&newext
, lb
->first_pblock
);
42 path
= ext4_ext_find_extent(inode
, lb
->first_block
, NULL
);
45 retval
= PTR_ERR(path
);
51 * Calculate the credit needed to inserting this extent
52 * Since we are doing this in loop we may accumalate extra
53 * credit. But below we try to not accumalate too much
54 * of them by restarting the journal.
56 needed
= ext4_ext_calc_credits_for_insert(inode
, path
);
59 * Make sure the credit we accumalated is not really high
61 if (needed
&& handle
->h_buffer_credits
>= EXT4_RESERVE_TRANS_BLOCKS
) {
62 retval
= ext4_journal_restart(handle
, needed
);
66 retval
= ext4_journal_extend(handle
, needed
);
69 * IF not able to extend the journal restart the journal
71 retval
= ext4_journal_restart(handle
, needed
);
76 retval
= ext4_ext_insert_extent(handle
, inode
, path
, &newext
);
79 ext4_ext_drop_refs(path
);
86 static int update_extent_range(handle_t
*handle
, struct inode
*inode
,
87 ext4_fsblk_t pblock
, ext4_lblk_t blk_num
,
88 struct list_blocks_struct
*lb
)
92 * See if we can add on to the existing range (if it exists)
94 if (lb
->first_pblock
&&
95 (lb
->last_pblock
+1 == pblock
) &&
96 (lb
->last_block
+1 == blk_num
)) {
97 lb
->last_pblock
= pblock
;
98 lb
->last_block
= blk_num
;
104 retval
= finish_range(handle
, inode
, lb
);
105 lb
->first_pblock
= lb
->last_pblock
= pblock
;
106 lb
->first_block
= lb
->last_block
= blk_num
;
111 static int update_ind_extent_range(handle_t
*handle
, struct inode
*inode
,
112 ext4_fsblk_t pblock
, ext4_lblk_t
*blk_nump
,
113 struct list_blocks_struct
*lb
)
115 struct buffer_head
*bh
;
118 ext4_lblk_t blk_count
= *blk_nump
;
119 unsigned long max_entries
= inode
->i_sb
->s_blocksize
>> 2;
122 /* Only update the file block number */
123 *blk_nump
+= max_entries
;
127 bh
= sb_bread(inode
->i_sb
, pblock
);
131 i_data
= (__le32
*)bh
->b_data
;
132 for (i
= 0; i
< max_entries
; i
++, blk_count
++) {
134 retval
= update_extent_range(handle
, inode
,
135 le32_to_cpu(i_data
[i
]),
142 /* Update the file block number */
143 *blk_nump
= blk_count
;
149 static int update_dind_extent_range(handle_t
*handle
, struct inode
*inode
,
150 ext4_fsblk_t pblock
, ext4_lblk_t
*blk_nump
,
151 struct list_blocks_struct
*lb
)
153 struct buffer_head
*bh
;
156 ext4_lblk_t blk_count
= *blk_nump
;
157 unsigned long max_entries
= inode
->i_sb
->s_blocksize
>> 2;
160 /* Only update the file block number */
161 *blk_nump
+= max_entries
* max_entries
;
164 bh
= sb_bread(inode
->i_sb
, pblock
);
168 i_data
= (__le32
*)bh
->b_data
;
169 for (i
= 0; i
< max_entries
; i
++) {
171 retval
= update_ind_extent_range(handle
, inode
,
172 le32_to_cpu(i_data
[i
]),
177 /* Only update the file block number */
178 blk_count
+= max_entries
;
182 /* Update the file block number */
183 *blk_nump
= blk_count
;
189 static int update_tind_extent_range(handle_t
*handle
, struct inode
*inode
,
190 ext4_fsblk_t pblock
, ext4_lblk_t
*blk_nump
,
191 struct list_blocks_struct
*lb
)
193 struct buffer_head
*bh
;
196 ext4_lblk_t blk_count
= *blk_nump
;
197 unsigned long max_entries
= inode
->i_sb
->s_blocksize
>> 2;
200 /* Only update the file block number */
201 *blk_nump
+= max_entries
* max_entries
* max_entries
;
204 bh
= sb_bread(inode
->i_sb
, pblock
);
208 i_data
= (__le32
*)bh
->b_data
;
209 for (i
= 0; i
< max_entries
; i
++) {
211 retval
= update_dind_extent_range(handle
, inode
,
212 le32_to_cpu(i_data
[i
]),
217 /* Only update the file block number */
218 blk_count
+= max_entries
* max_entries
;
220 /* Update the file block number */
221 *blk_nump
= blk_count
;
227 static int extend_credit_for_blkdel(handle_t
*handle
, struct inode
*inode
)
229 int retval
= 0, needed
;
231 if (handle
->h_buffer_credits
> EXT4_RESERVE_TRANS_BLOCKS
)
234 * We are freeing a blocks. During this we touch
235 * superblock, group descriptor and block bitmap.
236 * So allocate a credit of 3. We may update
237 * quota (user and group).
239 needed
= 3 + 2*EXT4_QUOTA_TRANS_BLOCKS(inode
->i_sb
);
241 if (ext4_journal_extend(handle
, needed
) != 0)
242 retval
= ext4_journal_restart(handle
, needed
);
247 static int free_dind_blocks(handle_t
*handle
,
248 struct inode
*inode
, __le32 i_data
)
252 struct buffer_head
*bh
;
253 unsigned long max_entries
= inode
->i_sb
->s_blocksize
>> 2;
255 bh
= sb_bread(inode
->i_sb
, le32_to_cpu(i_data
));
259 tmp_idata
= (__le32
*)bh
->b_data
;
260 for (i
= 0; i
< max_entries
; i
++) {
262 extend_credit_for_blkdel(handle
, inode
);
263 ext4_free_blocks(handle
, inode
,
264 le32_to_cpu(tmp_idata
[i
]), 1, 1);
268 extend_credit_for_blkdel(handle
, inode
);
269 ext4_free_blocks(handle
, inode
, le32_to_cpu(i_data
), 1, 1);
273 static int free_tind_blocks(handle_t
*handle
,
274 struct inode
*inode
, __le32 i_data
)
278 struct buffer_head
*bh
;
279 unsigned long max_entries
= inode
->i_sb
->s_blocksize
>> 2;
281 bh
= sb_bread(inode
->i_sb
, le32_to_cpu(i_data
));
285 tmp_idata
= (__le32
*)bh
->b_data
;
286 for (i
= 0; i
< max_entries
; i
++) {
288 retval
= free_dind_blocks(handle
,
289 inode
, tmp_idata
[i
]);
297 extend_credit_for_blkdel(handle
, inode
);
298 ext4_free_blocks(handle
, inode
, le32_to_cpu(i_data
), 1, 1);
302 static int free_ind_block(handle_t
*handle
, struct inode
*inode
, __le32
*i_data
)
306 /* ei->i_data[EXT4_IND_BLOCK] */
308 extend_credit_for_blkdel(handle
, inode
);
309 ext4_free_blocks(handle
, inode
,
310 le32_to_cpu(i_data
[0]), 1, 1);
313 /* ei->i_data[EXT4_DIND_BLOCK] */
315 retval
= free_dind_blocks(handle
, inode
, i_data
[1]);
320 /* ei->i_data[EXT4_TIND_BLOCK] */
322 retval
= free_tind_blocks(handle
, inode
, i_data
[2]);
329 static int ext4_ext_swap_inode_data(handle_t
*handle
, struct inode
*inode
,
330 struct inode
*tmp_inode
)
334 struct ext4_inode_info
*ei
= EXT4_I(inode
);
335 struct ext4_inode_info
*tmp_ei
= EXT4_I(tmp_inode
);
338 * One credit accounted for writing the
339 * i_data field of the original inode
341 retval
= ext4_journal_extend(handle
, 1);
343 retval
= ext4_journal_restart(handle
, 1);
348 i_data
[0] = ei
->i_data
[EXT4_IND_BLOCK
];
349 i_data
[1] = ei
->i_data
[EXT4_DIND_BLOCK
];
350 i_data
[2] = ei
->i_data
[EXT4_TIND_BLOCK
];
352 down_write(&EXT4_I(inode
)->i_data_sem
);
354 * if EXT4_EXT_MIGRATE is cleared a block allocation
355 * happened after we started the migrate. We need to
358 if (!(EXT4_I(inode
)->i_flags
& EXT4_EXT_MIGRATE
)) {
360 up_write(&EXT4_I(inode
)->i_data_sem
);
363 EXT4_I(inode
)->i_flags
= EXT4_I(inode
)->i_flags
&
366 * We have the extent map build with the tmp inode.
367 * Now copy the i_data across
369 ei
->i_flags
|= EXT4_EXTENTS_FL
;
370 memcpy(ei
->i_data
, tmp_ei
->i_data
, sizeof(ei
->i_data
));
373 * Update i_blocks with the new blocks that got
374 * allocated while adding extents for extent index
377 * While converting to extents we need not
378 * update the orignal inode i_blocks for extent blocks
379 * via quota APIs. The quota update happened via tmp_inode already.
381 spin_lock(&inode
->i_lock
);
382 inode
->i_blocks
+= tmp_inode
->i_blocks
;
383 spin_unlock(&inode
->i_lock
);
384 up_write(&EXT4_I(inode
)->i_data_sem
);
387 * We mark the inode dirty after, because we decrement the
388 * i_blocks when freeing the indirect meta-data blocks
390 retval
= free_ind_block(handle
, inode
, i_data
);
391 ext4_mark_inode_dirty(handle
, inode
);
397 static int free_ext_idx(handle_t
*handle
, struct inode
*inode
,
398 struct ext4_extent_idx
*ix
)
402 struct buffer_head
*bh
;
403 struct ext4_extent_header
*eh
;
405 block
= idx_pblock(ix
);
406 bh
= sb_bread(inode
->i_sb
, block
);
410 eh
= (struct ext4_extent_header
*)bh
->b_data
;
411 if (eh
->eh_depth
!= 0) {
412 ix
= EXT_FIRST_INDEX(eh
);
413 for (i
= 0; i
< le16_to_cpu(eh
->eh_entries
); i
++, ix
++) {
414 retval
= free_ext_idx(handle
, inode
, ix
);
420 extend_credit_for_blkdel(handle
, inode
);
421 ext4_free_blocks(handle
, inode
, block
, 1, 1);
426 * Free the extent meta data blocks only
428 static int free_ext_block(handle_t
*handle
, struct inode
*inode
)
431 struct ext4_inode_info
*ei
= EXT4_I(inode
);
432 struct ext4_extent_header
*eh
= (struct ext4_extent_header
*)ei
->i_data
;
433 struct ext4_extent_idx
*ix
;
434 if (eh
->eh_depth
== 0)
436 * No extra blocks allocated for extent meta data
439 ix
= EXT_FIRST_INDEX(eh
);
440 for (i
= 0; i
< le16_to_cpu(eh
->eh_entries
); i
++, ix
++) {
441 retval
= free_ext_idx(handle
, inode
, ix
);
449 int ext4_ext_migrate(struct inode
*inode
, struct file
*filp
,
450 unsigned int cmd
, unsigned long arg
)
455 ext4_lblk_t blk_count
= 0;
456 struct ext4_inode_info
*ei
;
457 struct inode
*tmp_inode
= NULL
;
458 struct list_blocks_struct lb
;
459 unsigned long max_entries
;
461 if (!test_opt(inode
->i_sb
, EXTENTS
))
463 * if mounted with noextents we don't allow the migrate
467 if ((EXT4_I(inode
)->i_flags
& EXT4_EXTENTS_FL
))
470 if (S_ISLNK(inode
->i_mode
) && inode
->i_blocks
== 0)
472 * don't migrate fast symlink
476 handle
= ext4_journal_start(inode
,
477 EXT4_DATA_TRANS_BLOCKS(inode
->i_sb
) +
478 EXT4_INDEX_EXTRA_TRANS_BLOCKS
+ 3 +
479 2 * EXT4_QUOTA_INIT_BLOCKS(inode
->i_sb
)
481 if (IS_ERR(handle
)) {
482 retval
= PTR_ERR(handle
);
485 tmp_inode
= ext4_new_inode(handle
,
486 inode
->i_sb
->s_root
->d_inode
,
488 if (IS_ERR(tmp_inode
)) {
490 ext4_journal_stop(handle
);
494 i_size_write(tmp_inode
, i_size_read(inode
));
496 * We don't want the inode to be reclaimed
497 * if we got interrupted in between. We have
498 * this tmp inode carrying reference to the
499 * data blocks of the original file. We set
500 * the i_nlink to zero at the last stage after
501 * switching the original file to extent format
503 tmp_inode
->i_nlink
= 1;
505 ext4_ext_tree_init(handle
, tmp_inode
);
506 ext4_orphan_add(handle
, tmp_inode
);
507 ext4_journal_stop(handle
);
510 * start with one credit accounted for
511 * superblock modification.
513 * For the tmp_inode we already have commited the
514 * trascation that created the inode. Later as and
515 * when we add extents we extent the journal
518 * inode_mutex prevent write and truncate on the file. Read still goes
519 * through. We take i_data_sem in ext4_ext_swap_inode_data before we
520 * switch the inode format to prevent read.
522 mutex_lock(&(inode
->i_mutex
));
524 * Even though we take i_mutex we can still cause block allocation
525 * via mmap write to holes. If we have allocated new blocks we fail
526 * migrate. New block allocation will clear EXT4_EXT_MIGRATE flag.
527 * The flag is updated with i_data_sem held to prevent racing with
530 down_read((&EXT4_I(inode
)->i_data_sem
));
531 EXT4_I(inode
)->i_flags
= EXT4_I(inode
)->i_flags
| EXT4_EXT_MIGRATE
;
532 up_read((&EXT4_I(inode
)->i_data_sem
));
534 handle
= ext4_journal_start(inode
, 1);
538 memset(&lb
, 0, sizeof(lb
));
540 /* 32 bit block address 4 bytes */
541 max_entries
= inode
->i_sb
->s_blocksize
>> 2;
542 for (i
= 0; i
< EXT4_NDIR_BLOCKS
; i
++, blk_count
++) {
544 retval
= update_extent_range(handle
, tmp_inode
,
545 le32_to_cpu(i_data
[i
]),
551 if (i_data
[EXT4_IND_BLOCK
]) {
552 retval
= update_ind_extent_range(handle
, tmp_inode
,
553 le32_to_cpu(i_data
[EXT4_IND_BLOCK
]),
558 blk_count
+= max_entries
;
559 if (i_data
[EXT4_DIND_BLOCK
]) {
560 retval
= update_dind_extent_range(handle
, tmp_inode
,
561 le32_to_cpu(i_data
[EXT4_DIND_BLOCK
]),
566 blk_count
+= max_entries
* max_entries
;
567 if (i_data
[EXT4_TIND_BLOCK
]) {
568 retval
= update_tind_extent_range(handle
, tmp_inode
,
569 le32_to_cpu(i_data
[EXT4_TIND_BLOCK
]),
575 * Build the last extent
577 retval
= finish_range(handle
, tmp_inode
, &lb
);
581 * Failure case delete the extent information with the
584 free_ext_block(handle
, tmp_inode
);
586 retval
= ext4_ext_swap_inode_data(handle
, inode
, tmp_inode
);
589 * if we fail to swap inode data free the extent
590 * details of the tmp inode
592 free_ext_block(handle
, tmp_inode
);
595 /* We mark the tmp_inode dirty via ext4_ext_tree_init. */
596 if (ext4_journal_extend(handle
, 1) != 0)
597 ext4_journal_restart(handle
, 1);
600 * Mark the tmp_inode as of size zero
602 i_size_write(tmp_inode
, 0);
605 * set the i_blocks count to zero
606 * so that the ext4_delete_inode does the
609 * We don't need to take the i_lock because
610 * the inode is not visible to user space.
612 tmp_inode
->i_blocks
= 0;
614 /* Reset the extent details */
615 ext4_ext_tree_init(handle
, tmp_inode
);
618 * Set the i_nlink to zero so that
619 * generic_drop_inode really deletes the
622 tmp_inode
->i_nlink
= 0;
624 ext4_journal_stop(handle
);
625 mutex_unlock(&(inode
->i_mutex
));