Linux Audio

Check our new training course

Loading...
v3.5.6
 
  1/*
  2 * Copyright IBM Corporation, 2007
  3 * Author Aneesh Kumar K.V <aneesh.kumar@linux.vnet.ibm.com>
  4 *
  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.
  8 *
  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.
 12 *
 13 */
 14
 15#include <linux/slab.h>
 16#include "ext4_jbd2.h"
 
 17
 18/*
 19 * The contiguous blocks details which can be
 20 * represented by a single extent
 21 */
 22struct migrate_struct {
 23	ext4_lblk_t first_block, last_block, curr_block;
 24	ext4_fsblk_t first_pblock, last_pblock;
 25};
 26
 27static int finish_range(handle_t *handle, struct inode *inode,
 28				struct migrate_struct *lb)
 29
 30{
 31	int retval = 0, needed;
 32	struct ext4_extent newext;
 33	struct ext4_ext_path *path;
 34	if (lb->first_pblock == 0)
 35		return 0;
 36
 37	/* Add the extent to temp inode*/
 38	newext.ee_block = cpu_to_le32(lb->first_block);
 39	newext.ee_len   = cpu_to_le16(lb->last_block - lb->first_block + 1);
 40	ext4_ext_store_pblock(&newext, lb->first_pblock);
 41	path = ext4_ext_find_extent(inode, lb->first_block, NULL);
 42
 
 43	if (IS_ERR(path)) {
 44		retval = PTR_ERR(path);
 45		path = NULL;
 46		goto err_out;
 47	}
 48
 49	/*
 50	 * Calculate the credit needed to inserting this extent
 51	 * Since we are doing this in loop we may accumalate extra
 52	 * credit. But below we try to not accumalate too much
 53	 * of them by restarting the journal.
 54	 */
 55	needed = ext4_ext_calc_credits_for_single_extent(inode,
 56		    lb->last_block - lb->first_block + 1, path);
 57
 58	/*
 59	 * Make sure the credit we accumalated is not really high
 60	 */
 61	if (needed && ext4_handle_has_enough_credits(handle,
 62						EXT4_RESERVE_TRANS_BLOCKS)) {
 63		retval = ext4_journal_restart(handle, needed);
 64		if (retval)
 65			goto err_out;
 66	} else if (needed) {
 67		retval = ext4_journal_extend(handle, needed);
 68		if (retval) {
 69			/*
 70			 * IF not able to extend the journal restart the journal
 71			 */
 72			retval = ext4_journal_restart(handle, needed);
 73			if (retval)
 74				goto err_out;
 75		}
 76	}
 77	retval = ext4_ext_insert_extent(handle, inode, path, &newext, 0);
 78err_out:
 79	if (path) {
 80		ext4_ext_drop_refs(path);
 81		kfree(path);
 82	}
 83	lb->first_pblock = 0;
 84	return retval;
 85}
 86
 87static int update_extent_range(handle_t *handle, struct inode *inode,
 88			       ext4_fsblk_t pblock, struct migrate_struct *lb)
 89{
 90	int retval;
 91	/*
 92	 * See if we can add on to the existing range (if it exists)
 93	 */
 94	if (lb->first_pblock &&
 95		(lb->last_pblock+1 == pblock) &&
 96		(lb->last_block+1 == lb->curr_block)) {
 97		lb->last_pblock = pblock;
 98		lb->last_block = lb->curr_block;
 99		lb->curr_block++;
100		return 0;
101	}
102	/*
103	 * Start a new range.
104	 */
105	retval = finish_range(handle, inode, lb);
106	lb->first_pblock = lb->last_pblock = pblock;
107	lb->first_block = lb->last_block = lb->curr_block;
108	lb->curr_block++;
109	return retval;
110}
111
112static int update_ind_extent_range(handle_t *handle, struct inode *inode,
113				   ext4_fsblk_t pblock,
114				   struct migrate_struct *lb)
115{
116	struct buffer_head *bh;
117	__le32 *i_data;
118	int i, retval = 0;
119	unsigned long max_entries = inode->i_sb->s_blocksize >> 2;
120
121	bh = sb_bread(inode->i_sb, pblock);
122	if (!bh)
123		return -EIO;
124
125	i_data = (__le32 *)bh->b_data;
126	for (i = 0; i < max_entries; i++) {
127		if (i_data[i]) {
128			retval = update_extent_range(handle, inode,
129						le32_to_cpu(i_data[i]), lb);
130			if (retval)
131				break;
132		} else {
133			lb->curr_block++;
134		}
135	}
136	put_bh(bh);
137	return retval;
138
139}
140
141static int update_dind_extent_range(handle_t *handle, struct inode *inode,
142				    ext4_fsblk_t pblock,
143				    struct migrate_struct *lb)
144{
145	struct buffer_head *bh;
146	__le32 *i_data;
147	int i, retval = 0;
148	unsigned long max_entries = inode->i_sb->s_blocksize >> 2;
149
150	bh = sb_bread(inode->i_sb, pblock);
151	if (!bh)
152		return -EIO;
153
154	i_data = (__le32 *)bh->b_data;
155	for (i = 0; i < max_entries; i++) {
156		if (i_data[i]) {
157			retval = update_ind_extent_range(handle, inode,
158						le32_to_cpu(i_data[i]), lb);
159			if (retval)
160				break;
161		} else {
162			/* Only update the file block number */
163			lb->curr_block += max_entries;
164		}
165	}
166	put_bh(bh);
167	return retval;
168
169}
170
171static int update_tind_extent_range(handle_t *handle, struct inode *inode,
172				    ext4_fsblk_t pblock,
173				    struct migrate_struct *lb)
174{
175	struct buffer_head *bh;
176	__le32 *i_data;
177	int i, retval = 0;
178	unsigned long max_entries = inode->i_sb->s_blocksize >> 2;
179
180	bh = sb_bread(inode->i_sb, pblock);
181	if (!bh)
182		return -EIO;
183
184	i_data = (__le32 *)bh->b_data;
185	for (i = 0; i < max_entries; i++) {
186		if (i_data[i]) {
187			retval = update_dind_extent_range(handle, inode,
188						le32_to_cpu(i_data[i]), lb);
189			if (retval)
190				break;
191		} else {
192			/* Only update the file block number */
193			lb->curr_block += max_entries * max_entries;
194		}
195	}
196	put_bh(bh);
197	return retval;
198
199}
200
201static int extend_credit_for_blkdel(handle_t *handle, struct inode *inode)
202{
203	int retval = 0, needed;
204
205	if (ext4_handle_has_enough_credits(handle, EXT4_RESERVE_TRANS_BLOCKS+1))
206		return 0;
207	/*
208	 * We are freeing a blocks. During this we touch
209	 * superblock, group descriptor and block bitmap.
210	 * So allocate a credit of 3. We may update
211	 * quota (user and group).
212	 */
213	needed = 3 + EXT4_MAXQUOTAS_TRANS_BLOCKS(inode->i_sb);
214
215	if (ext4_journal_extend(handle, needed) != 0)
216		retval = ext4_journal_restart(handle, needed);
217
218	return retval;
219}
220
221static int free_dind_blocks(handle_t *handle,
222				struct inode *inode, __le32 i_data)
223{
224	int i;
225	__le32 *tmp_idata;
226	struct buffer_head *bh;
 
227	unsigned long max_entries = inode->i_sb->s_blocksize >> 2;
 
228
229	bh = sb_bread(inode->i_sb, le32_to_cpu(i_data));
230	if (!bh)
231		return -EIO;
232
233	tmp_idata = (__le32 *)bh->b_data;
234	for (i = 0; i < max_entries; i++) {
235		if (tmp_idata[i]) {
236			extend_credit_for_blkdel(handle, inode);
 
 
 
 
 
 
237			ext4_free_blocks(handle, inode, NULL,
238					 le32_to_cpu(tmp_idata[i]), 1,
239					 EXT4_FREE_BLOCKS_METADATA |
240					 EXT4_FREE_BLOCKS_FORGET);
241		}
242	}
243	put_bh(bh);
244	extend_credit_for_blkdel(handle, inode);
 
 
 
245	ext4_free_blocks(handle, inode, NULL, le32_to_cpu(i_data), 1,
246			 EXT4_FREE_BLOCKS_METADATA |
247			 EXT4_FREE_BLOCKS_FORGET);
248	return 0;
249}
250
251static int free_tind_blocks(handle_t *handle,
252				struct inode *inode, __le32 i_data)
253{
254	int i, retval = 0;
255	__le32 *tmp_idata;
256	struct buffer_head *bh;
257	unsigned long max_entries = inode->i_sb->s_blocksize >> 2;
258
259	bh = sb_bread(inode->i_sb, le32_to_cpu(i_data));
260	if (!bh)
261		return -EIO;
262
263	tmp_idata = (__le32 *)bh->b_data;
264	for (i = 0; i < max_entries; i++) {
265		if (tmp_idata[i]) {
266			retval = free_dind_blocks(handle,
267					inode, tmp_idata[i]);
268			if (retval) {
269				put_bh(bh);
270				return retval;
271			}
272		}
273	}
274	put_bh(bh);
275	extend_credit_for_blkdel(handle, inode);
 
 
 
276	ext4_free_blocks(handle, inode, NULL, le32_to_cpu(i_data), 1,
277			 EXT4_FREE_BLOCKS_METADATA |
278			 EXT4_FREE_BLOCKS_FORGET);
279	return 0;
280}
281
282static int free_ind_block(handle_t *handle, struct inode *inode, __le32 *i_data)
283{
284	int retval;
285
286	/* ei->i_data[EXT4_IND_BLOCK] */
287	if (i_data[0]) {
288		extend_credit_for_blkdel(handle, inode);
 
 
 
 
289		ext4_free_blocks(handle, inode, NULL,
290				le32_to_cpu(i_data[0]), 1,
291				 EXT4_FREE_BLOCKS_METADATA |
292				 EXT4_FREE_BLOCKS_FORGET);
293	}
294
295	/* ei->i_data[EXT4_DIND_BLOCK] */
296	if (i_data[1]) {
297		retval = free_dind_blocks(handle, inode, i_data[1]);
298		if (retval)
299			return retval;
300	}
301
302	/* ei->i_data[EXT4_TIND_BLOCK] */
303	if (i_data[2]) {
304		retval = free_tind_blocks(handle, inode, i_data[2]);
305		if (retval)
306			return retval;
307	}
308	return 0;
309}
310
311static int ext4_ext_swap_inode_data(handle_t *handle, struct inode *inode,
312						struct inode *tmp_inode)
313{
314	int retval;
315	__le32	i_data[3];
316	struct ext4_inode_info *ei = EXT4_I(inode);
317	struct ext4_inode_info *tmp_ei = EXT4_I(tmp_inode);
318
319	/*
320	 * One credit accounted for writing the
321	 * i_data field of the original inode
322	 */
323	retval = ext4_journal_extend(handle, 1);
324	if (retval) {
325		retval = ext4_journal_restart(handle, 1);
326		if (retval)
327			goto err_out;
328	}
329
330	i_data[0] = ei->i_data[EXT4_IND_BLOCK];
331	i_data[1] = ei->i_data[EXT4_DIND_BLOCK];
332	i_data[2] = ei->i_data[EXT4_TIND_BLOCK];
333
334	down_write(&EXT4_I(inode)->i_data_sem);
335	/*
336	 * if EXT4_STATE_EXT_MIGRATE is cleared a block allocation
337	 * happened after we started the migrate. We need to
338	 * fail the migrate
339	 */
340	if (!ext4_test_inode_state(inode, EXT4_STATE_EXT_MIGRATE)) {
341		retval = -EAGAIN;
342		up_write(&EXT4_I(inode)->i_data_sem);
343		goto err_out;
344	} else
345		ext4_clear_inode_state(inode, EXT4_STATE_EXT_MIGRATE);
346	/*
347	 * We have the extent map build with the tmp inode.
348	 * Now copy the i_data across
349	 */
350	ext4_set_inode_flag(inode, EXT4_INODE_EXTENTS);
351	memcpy(ei->i_data, tmp_ei->i_data, sizeof(ei->i_data));
352
353	/*
354	 * Update i_blocks with the new blocks that got
355	 * allocated while adding extents for extent index
356	 * blocks.
357	 *
358	 * While converting to extents we need not
359	 * update the orignal inode i_blocks for extent blocks
360	 * via quota APIs. The quota update happened via tmp_inode already.
361	 */
362	spin_lock(&inode->i_lock);
363	inode->i_blocks += tmp_inode->i_blocks;
364	spin_unlock(&inode->i_lock);
365	up_write(&EXT4_I(inode)->i_data_sem);
366
367	/*
368	 * We mark the inode dirty after, because we decrement the
369	 * i_blocks when freeing the indirect meta-data blocks
370	 */
371	retval = free_ind_block(handle, inode, i_data);
372	ext4_mark_inode_dirty(handle, inode);
 
 
373
374err_out:
375	return retval;
376}
377
378static int free_ext_idx(handle_t *handle, struct inode *inode,
379					struct ext4_extent_idx *ix)
380{
381	int i, retval = 0;
382	ext4_fsblk_t block;
383	struct buffer_head *bh;
384	struct ext4_extent_header *eh;
385
386	block = ext4_idx_pblock(ix);
387	bh = sb_bread(inode->i_sb, block);
388	if (!bh)
389		return -EIO;
390
391	eh = (struct ext4_extent_header *)bh->b_data;
392	if (eh->eh_depth != 0) {
393		ix = EXT_FIRST_INDEX(eh);
394		for (i = 0; i < le16_to_cpu(eh->eh_entries); i++, ix++) {
395			retval = free_ext_idx(handle, inode, ix);
396			if (retval)
397				break;
 
 
398		}
399	}
400	put_bh(bh);
401	extend_credit_for_blkdel(handle, inode);
 
 
 
402	ext4_free_blocks(handle, inode, NULL, block, 1,
403			 EXT4_FREE_BLOCKS_METADATA | EXT4_FREE_BLOCKS_FORGET);
404	return retval;
405}
406
407/*
408 * Free the extent meta data blocks only
409 */
410static int free_ext_block(handle_t *handle, struct inode *inode)
411{
412	int i, retval = 0;
413	struct ext4_inode_info *ei = EXT4_I(inode);
414	struct ext4_extent_header *eh = (struct ext4_extent_header *)ei->i_data;
415	struct ext4_extent_idx *ix;
416	if (eh->eh_depth == 0)
417		/*
418		 * No extra blocks allocated for extent meta data
419		 */
420		return 0;
421	ix = EXT_FIRST_INDEX(eh);
422	for (i = 0; i < le16_to_cpu(eh->eh_entries); i++, ix++) {
423		retval = free_ext_idx(handle, inode, ix);
424		if (retval)
425			return retval;
426	}
427	return retval;
428
429}
430
431int ext4_ext_migrate(struct inode *inode)
432{
433	handle_t *handle;
434	int retval = 0, i;
435	__le32 *i_data;
436	struct ext4_inode_info *ei;
437	struct inode *tmp_inode = NULL;
438	struct migrate_struct lb;
439	unsigned long max_entries;
440	__u32 goal;
441	uid_t owner[2];
 
442
443	/*
444	 * If the filesystem does not support extents, or the inode
445	 * already is extent-based, error out.
446	 */
447	if (!EXT4_HAS_INCOMPAT_FEATURE(inode->i_sb,
448				       EXT4_FEATURE_INCOMPAT_EXTENTS) ||
449	    (ext4_test_inode_flag(inode, EXT4_INODE_EXTENTS)))
450		return -EINVAL;
451
452	if (S_ISLNK(inode->i_mode) && inode->i_blocks == 0)
453		/*
454		 * don't migrate fast symlink
455		 */
456		return retval;
457
458	handle = ext4_journal_start(inode,
459					EXT4_DATA_TRANS_BLOCKS(inode->i_sb) +
460					EXT4_INDEX_EXTRA_TRANS_BLOCKS + 3 +
461					EXT4_MAXQUOTAS_INIT_BLOCKS(inode->i_sb)
462					+ 1);
 
 
 
 
 
463	if (IS_ERR(handle)) {
464		retval = PTR_ERR(handle);
465		return retval;
466	}
467	goal = (((inode->i_ino - 1) / EXT4_INODES_PER_GROUP(inode->i_sb)) *
468		EXT4_INODES_PER_GROUP(inode->i_sb)) + 1;
469	owner[0] = i_uid_read(inode);
470	owner[1] = i_gid_read(inode);
471	tmp_inode = ext4_new_inode(handle, inode->i_sb->s_root->d_inode,
472				   S_IFREG, NULL, goal, owner);
473	if (IS_ERR(tmp_inode)) {
474		retval = PTR_ERR(tmp_inode);
475		ext4_journal_stop(handle);
476		return retval;
477	}
 
 
 
 
 
 
 
 
478	i_size_write(tmp_inode, i_size_read(inode));
479	/*
480	 * Set the i_nlink to zero so it will be deleted later
481	 * when we drop inode reference.
482	 */
483	clear_nlink(tmp_inode);
484
485	ext4_ext_tree_init(handle, tmp_inode);
486	ext4_orphan_add(handle, tmp_inode);
487	ext4_journal_stop(handle);
488
489	/*
490	 * start with one credit accounted for
491	 * superblock modification.
492	 *
493	 * For the tmp_inode we already have committed the
494	 * trascation that created the inode. Later as and
495	 * when we add extents we extent the journal
496	 */
497	/*
498	 * Even though we take i_mutex we can still cause block
499	 * allocation via mmap write to holes. If we have allocated
500	 * new blocks we fail migrate.  New block allocation will
501	 * clear EXT4_STATE_EXT_MIGRATE flag.  The flag is updated
502	 * with i_data_sem held to prevent racing with block
503	 * allocation.
504	 */
505	down_read((&EXT4_I(inode)->i_data_sem));
506	ext4_set_inode_state(inode, EXT4_STATE_EXT_MIGRATE);
507	up_read((&EXT4_I(inode)->i_data_sem));
508
509	handle = ext4_journal_start(inode, 1);
510	if (IS_ERR(handle)) {
511		/*
512		 * It is impossible to update on-disk structures without
513		 * a handle, so just rollback in-core changes and live other
514		 * work to orphan_list_cleanup()
515		 */
516		ext4_orphan_del(NULL, tmp_inode);
517		retval = PTR_ERR(handle);
518		goto out;
519	}
520
521	ei = EXT4_I(inode);
522	i_data = ei->i_data;
523	memset(&lb, 0, sizeof(lb));
524
525	/* 32 bit block address 4 bytes */
526	max_entries = inode->i_sb->s_blocksize >> 2;
527	for (i = 0; i < EXT4_NDIR_BLOCKS; i++) {
528		if (i_data[i]) {
529			retval = update_extent_range(handle, tmp_inode,
530						le32_to_cpu(i_data[i]), &lb);
531			if (retval)
532				goto err_out;
533		} else
534			lb.curr_block++;
535	}
536	if (i_data[EXT4_IND_BLOCK]) {
537		retval = update_ind_extent_range(handle, tmp_inode,
538				le32_to_cpu(i_data[EXT4_IND_BLOCK]), &lb);
539			if (retval)
540				goto err_out;
541	} else
542		lb.curr_block += max_entries;
543	if (i_data[EXT4_DIND_BLOCK]) {
544		retval = update_dind_extent_range(handle, tmp_inode,
545				le32_to_cpu(i_data[EXT4_DIND_BLOCK]), &lb);
546			if (retval)
547				goto err_out;
548	} else
549		lb.curr_block += max_entries * max_entries;
550	if (i_data[EXT4_TIND_BLOCK]) {
551		retval = update_tind_extent_range(handle, tmp_inode,
552				le32_to_cpu(i_data[EXT4_TIND_BLOCK]), &lb);
553			if (retval)
554				goto err_out;
555	}
556	/*
557	 * Build the last extent
558	 */
559	retval = finish_range(handle, tmp_inode, &lb);
560err_out:
561	if (retval)
562		/*
563		 * Failure case delete the extent information with the
564		 * tmp_inode
565		 */
566		free_ext_block(handle, tmp_inode);
567	else {
568		retval = ext4_ext_swap_inode_data(handle, inode, tmp_inode);
569		if (retval)
570			/*
571			 * if we fail to swap inode data free the extent
572			 * details of the tmp inode
573			 */
574			free_ext_block(handle, tmp_inode);
575	}
576
577	/* We mark the tmp_inode dirty via ext4_ext_tree_init. */
578	if (ext4_journal_extend(handle, 1) != 0)
579		ext4_journal_restart(handle, 1);
580
581	/*
582	 * Mark the tmp_inode as of size zero
583	 */
584	i_size_write(tmp_inode, 0);
585
586	/*
587	 * set the  i_blocks count to zero
588	 * so that the ext4_delete_inode does the
589	 * right job
590	 *
591	 * We don't need to take the i_lock because
592	 * the inode is not visible to user space.
593	 */
594	tmp_inode->i_blocks = 0;
 
595
596	/* Reset the extent details */
597	ext4_ext_tree_init(handle, tmp_inode);
 
598	ext4_journal_stop(handle);
599out:
600	unlock_new_inode(tmp_inode);
601	iput(tmp_inode);
602
 
603	return retval;
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
604}
v6.8
  1// SPDX-License-Identifier: LGPL-2.1
  2/*
  3 * Copyright IBM Corporation, 2007
  4 * Author Aneesh Kumar K.V <aneesh.kumar@linux.vnet.ibm.com>
  5 *
 
 
 
 
 
 
 
 
  6 */
  7
  8#include <linux/slab.h>
  9#include "ext4_jbd2.h"
 10#include "ext4_extents.h"
 11
 12/*
 13 * The contiguous blocks details which can be
 14 * represented by a single extent
 15 */
 16struct migrate_struct {
 17	ext4_lblk_t first_block, last_block, curr_block;
 18	ext4_fsblk_t first_pblock, last_pblock;
 19};
 20
 21static int finish_range(handle_t *handle, struct inode *inode,
 22				struct migrate_struct *lb)
 23
 24{
 25	int retval = 0, needed;
 26	struct ext4_extent newext;
 27	struct ext4_ext_path *path;
 28	if (lb->first_pblock == 0)
 29		return 0;
 30
 31	/* Add the extent to temp inode*/
 32	newext.ee_block = cpu_to_le32(lb->first_block);
 33	newext.ee_len   = cpu_to_le16(lb->last_block - lb->first_block + 1);
 34	ext4_ext_store_pblock(&newext, lb->first_pblock);
 35	/* Locking only for convenience since we are operating on temp inode */
 36	down_write(&EXT4_I(inode)->i_data_sem);
 37	path = ext4_find_extent(inode, lb->first_block, NULL, 0);
 38	if (IS_ERR(path)) {
 39		retval = PTR_ERR(path);
 40		path = NULL;
 41		goto err_out;
 42	}
 43
 44	/*
 45	 * Calculate the credit needed to inserting this extent
 46	 * Since we are doing this in loop we may accumulate extra
 47	 * credit. But below we try to not accumulate too much
 48	 * of them by restarting the journal.
 49	 */
 50	needed = ext4_ext_calc_credits_for_single_extent(inode,
 51		    lb->last_block - lb->first_block + 1, path);
 52
 53	retval = ext4_datasem_ensure_credits(handle, inode, needed, needed, 0);
 54	if (retval < 0)
 55		goto err_out;
 56	retval = ext4_ext_insert_extent(handle, inode, &path, &newext, 0);
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 57err_out:
 58	up_write((&EXT4_I(inode)->i_data_sem));
 59	ext4_free_ext_path(path);
 
 
 60	lb->first_pblock = 0;
 61	return retval;
 62}
 63
 64static int update_extent_range(handle_t *handle, struct inode *inode,
 65			       ext4_fsblk_t pblock, struct migrate_struct *lb)
 66{
 67	int retval;
 68	/*
 69	 * See if we can add on to the existing range (if it exists)
 70	 */
 71	if (lb->first_pblock &&
 72		(lb->last_pblock+1 == pblock) &&
 73		(lb->last_block+1 == lb->curr_block)) {
 74		lb->last_pblock = pblock;
 75		lb->last_block = lb->curr_block;
 76		lb->curr_block++;
 77		return 0;
 78	}
 79	/*
 80	 * Start a new range.
 81	 */
 82	retval = finish_range(handle, inode, lb);
 83	lb->first_pblock = lb->last_pblock = pblock;
 84	lb->first_block = lb->last_block = lb->curr_block;
 85	lb->curr_block++;
 86	return retval;
 87}
 88
 89static int update_ind_extent_range(handle_t *handle, struct inode *inode,
 90				   ext4_fsblk_t pblock,
 91				   struct migrate_struct *lb)
 92{
 93	struct buffer_head *bh;
 94	__le32 *i_data;
 95	int i, retval = 0;
 96	unsigned long max_entries = inode->i_sb->s_blocksize >> 2;
 97
 98	bh = ext4_sb_bread(inode->i_sb, pblock, 0);
 99	if (IS_ERR(bh))
100		return PTR_ERR(bh);
101
102	i_data = (__le32 *)bh->b_data;
103	for (i = 0; i < max_entries; i++) {
104		if (i_data[i]) {
105			retval = update_extent_range(handle, inode,
106						le32_to_cpu(i_data[i]), lb);
107			if (retval)
108				break;
109		} else {
110			lb->curr_block++;
111		}
112	}
113	put_bh(bh);
114	return retval;
115
116}
117
118static int update_dind_extent_range(handle_t *handle, struct inode *inode,
119				    ext4_fsblk_t pblock,
120				    struct migrate_struct *lb)
121{
122	struct buffer_head *bh;
123	__le32 *i_data;
124	int i, retval = 0;
125	unsigned long max_entries = inode->i_sb->s_blocksize >> 2;
126
127	bh = ext4_sb_bread(inode->i_sb, pblock, 0);
128	if (IS_ERR(bh))
129		return PTR_ERR(bh);
130
131	i_data = (__le32 *)bh->b_data;
132	for (i = 0; i < max_entries; i++) {
133		if (i_data[i]) {
134			retval = update_ind_extent_range(handle, inode,
135						le32_to_cpu(i_data[i]), lb);
136			if (retval)
137				break;
138		} else {
139			/* Only update the file block number */
140			lb->curr_block += max_entries;
141		}
142	}
143	put_bh(bh);
144	return retval;
145
146}
147
148static int update_tind_extent_range(handle_t *handle, struct inode *inode,
149				    ext4_fsblk_t pblock,
150				    struct migrate_struct *lb)
151{
152	struct buffer_head *bh;
153	__le32 *i_data;
154	int i, retval = 0;
155	unsigned long max_entries = inode->i_sb->s_blocksize >> 2;
156
157	bh = ext4_sb_bread(inode->i_sb, pblock, 0);
158	if (IS_ERR(bh))
159		return PTR_ERR(bh);
160
161	i_data = (__le32 *)bh->b_data;
162	for (i = 0; i < max_entries; i++) {
163		if (i_data[i]) {
164			retval = update_dind_extent_range(handle, inode,
165						le32_to_cpu(i_data[i]), lb);
166			if (retval)
167				break;
168		} else {
169			/* Only update the file block number */
170			lb->curr_block += max_entries * max_entries;
171		}
172	}
173	put_bh(bh);
174	return retval;
175
176}
177
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
178static int free_dind_blocks(handle_t *handle,
179				struct inode *inode, __le32 i_data)
180{
181	int i;
182	__le32 *tmp_idata;
183	struct buffer_head *bh;
184	struct super_block *sb = inode->i_sb;
185	unsigned long max_entries = inode->i_sb->s_blocksize >> 2;
186	int err;
187
188	bh = ext4_sb_bread(sb, le32_to_cpu(i_data), 0);
189	if (IS_ERR(bh))
190		return PTR_ERR(bh);
191
192	tmp_idata = (__le32 *)bh->b_data;
193	for (i = 0; i < max_entries; i++) {
194		if (tmp_idata[i]) {
195			err = ext4_journal_ensure_credits(handle,
196				EXT4_RESERVE_TRANS_BLOCKS,
197				ext4_free_metadata_revoke_credits(sb, 1));
198			if (err < 0) {
199				put_bh(bh);
200				return err;
201			}
202			ext4_free_blocks(handle, inode, NULL,
203					 le32_to_cpu(tmp_idata[i]), 1,
204					 EXT4_FREE_BLOCKS_METADATA |
205					 EXT4_FREE_BLOCKS_FORGET);
206		}
207	}
208	put_bh(bh);
209	err = ext4_journal_ensure_credits(handle, EXT4_RESERVE_TRANS_BLOCKS,
210				ext4_free_metadata_revoke_credits(sb, 1));
211	if (err < 0)
212		return err;
213	ext4_free_blocks(handle, inode, NULL, le32_to_cpu(i_data), 1,
214			 EXT4_FREE_BLOCKS_METADATA |
215			 EXT4_FREE_BLOCKS_FORGET);
216	return 0;
217}
218
219static int free_tind_blocks(handle_t *handle,
220				struct inode *inode, __le32 i_data)
221{
222	int i, retval = 0;
223	__le32 *tmp_idata;
224	struct buffer_head *bh;
225	unsigned long max_entries = inode->i_sb->s_blocksize >> 2;
226
227	bh = ext4_sb_bread(inode->i_sb, le32_to_cpu(i_data), 0);
228	if (IS_ERR(bh))
229		return PTR_ERR(bh);
230
231	tmp_idata = (__le32 *)bh->b_data;
232	for (i = 0; i < max_entries; i++) {
233		if (tmp_idata[i]) {
234			retval = free_dind_blocks(handle,
235					inode, tmp_idata[i]);
236			if (retval) {
237				put_bh(bh);
238				return retval;
239			}
240		}
241	}
242	put_bh(bh);
243	retval = ext4_journal_ensure_credits(handle, EXT4_RESERVE_TRANS_BLOCKS,
244			ext4_free_metadata_revoke_credits(inode->i_sb, 1));
245	if (retval < 0)
246		return retval;
247	ext4_free_blocks(handle, inode, NULL, le32_to_cpu(i_data), 1,
248			 EXT4_FREE_BLOCKS_METADATA |
249			 EXT4_FREE_BLOCKS_FORGET);
250	return 0;
251}
252
253static int free_ind_block(handle_t *handle, struct inode *inode, __le32 *i_data)
254{
255	int retval;
256
257	/* ei->i_data[EXT4_IND_BLOCK] */
258	if (i_data[0]) {
259		retval = ext4_journal_ensure_credits(handle,
260			EXT4_RESERVE_TRANS_BLOCKS,
261			ext4_free_metadata_revoke_credits(inode->i_sb, 1));
262		if (retval < 0)
263			return retval;
264		ext4_free_blocks(handle, inode, NULL,
265				le32_to_cpu(i_data[0]), 1,
266				 EXT4_FREE_BLOCKS_METADATA |
267				 EXT4_FREE_BLOCKS_FORGET);
268	}
269
270	/* ei->i_data[EXT4_DIND_BLOCK] */
271	if (i_data[1]) {
272		retval = free_dind_blocks(handle, inode, i_data[1]);
273		if (retval)
274			return retval;
275	}
276
277	/* ei->i_data[EXT4_TIND_BLOCK] */
278	if (i_data[2]) {
279		retval = free_tind_blocks(handle, inode, i_data[2]);
280		if (retval)
281			return retval;
282	}
283	return 0;
284}
285
286static int ext4_ext_swap_inode_data(handle_t *handle, struct inode *inode,
287						struct inode *tmp_inode)
288{
289	int retval, retval2 = 0;
290	__le32	i_data[3];
291	struct ext4_inode_info *ei = EXT4_I(inode);
292	struct ext4_inode_info *tmp_ei = EXT4_I(tmp_inode);
293
294	/*
295	 * One credit accounted for writing the
296	 * i_data field of the original inode
297	 */
298	retval = ext4_journal_ensure_credits(handle, 1, 0);
299	if (retval < 0)
300		goto err_out;
 
 
 
301
302	i_data[0] = ei->i_data[EXT4_IND_BLOCK];
303	i_data[1] = ei->i_data[EXT4_DIND_BLOCK];
304	i_data[2] = ei->i_data[EXT4_TIND_BLOCK];
305
306	down_write(&EXT4_I(inode)->i_data_sem);
307	/*
308	 * if EXT4_STATE_EXT_MIGRATE is cleared a block allocation
309	 * happened after we started the migrate. We need to
310	 * fail the migrate
311	 */
312	if (!ext4_test_inode_state(inode, EXT4_STATE_EXT_MIGRATE)) {
313		retval = -EAGAIN;
314		up_write(&EXT4_I(inode)->i_data_sem);
315		goto err_out;
316	} else
317		ext4_clear_inode_state(inode, EXT4_STATE_EXT_MIGRATE);
318	/*
319	 * We have the extent map build with the tmp inode.
320	 * Now copy the i_data across
321	 */
322	ext4_set_inode_flag(inode, EXT4_INODE_EXTENTS);
323	memcpy(ei->i_data, tmp_ei->i_data, sizeof(ei->i_data));
324
325	/*
326	 * Update i_blocks with the new blocks that got
327	 * allocated while adding extents for extent index
328	 * blocks.
329	 *
330	 * While converting to extents we need not
331	 * update the original inode i_blocks for extent blocks
332	 * via quota APIs. The quota update happened via tmp_inode already.
333	 */
334	spin_lock(&inode->i_lock);
335	inode->i_blocks += tmp_inode->i_blocks;
336	spin_unlock(&inode->i_lock);
337	up_write(&EXT4_I(inode)->i_data_sem);
338
339	/*
340	 * We mark the inode dirty after, because we decrement the
341	 * i_blocks when freeing the indirect meta-data blocks
342	 */
343	retval = free_ind_block(handle, inode, i_data);
344	retval2 = ext4_mark_inode_dirty(handle, inode);
345	if (unlikely(retval2 && !retval))
346		retval = retval2;
347
348err_out:
349	return retval;
350}
351
352static int free_ext_idx(handle_t *handle, struct inode *inode,
353					struct ext4_extent_idx *ix)
354{
355	int i, retval = 0;
356	ext4_fsblk_t block;
357	struct buffer_head *bh;
358	struct ext4_extent_header *eh;
359
360	block = ext4_idx_pblock(ix);
361	bh = ext4_sb_bread(inode->i_sb, block, 0);
362	if (IS_ERR(bh))
363		return PTR_ERR(bh);
364
365	eh = (struct ext4_extent_header *)bh->b_data;
366	if (eh->eh_depth != 0) {
367		ix = EXT_FIRST_INDEX(eh);
368		for (i = 0; i < le16_to_cpu(eh->eh_entries); i++, ix++) {
369			retval = free_ext_idx(handle, inode, ix);
370			if (retval) {
371				put_bh(bh);
372				return retval;
373			}
374		}
375	}
376	put_bh(bh);
377	retval = ext4_journal_ensure_credits(handle, EXT4_RESERVE_TRANS_BLOCKS,
378			ext4_free_metadata_revoke_credits(inode->i_sb, 1));
379	if (retval < 0)
380		return retval;
381	ext4_free_blocks(handle, inode, NULL, block, 1,
382			 EXT4_FREE_BLOCKS_METADATA | EXT4_FREE_BLOCKS_FORGET);
383	return 0;
384}
385
386/*
387 * Free the extent meta data blocks only
388 */
389static int free_ext_block(handle_t *handle, struct inode *inode)
390{
391	int i, retval = 0;
392	struct ext4_inode_info *ei = EXT4_I(inode);
393	struct ext4_extent_header *eh = (struct ext4_extent_header *)ei->i_data;
394	struct ext4_extent_idx *ix;
395	if (eh->eh_depth == 0)
396		/*
397		 * No extra blocks allocated for extent meta data
398		 */
399		return 0;
400	ix = EXT_FIRST_INDEX(eh);
401	for (i = 0; i < le16_to_cpu(eh->eh_entries); i++, ix++) {
402		retval = free_ext_idx(handle, inode, ix);
403		if (retval)
404			return retval;
405	}
406	return retval;
 
407}
408
409int ext4_ext_migrate(struct inode *inode)
410{
411	handle_t *handle;
412	int retval = 0, i;
413	__le32 *i_data;
414	struct ext4_inode_info *ei;
415	struct inode *tmp_inode = NULL;
416	struct migrate_struct lb;
417	unsigned long max_entries;
418	__u32 goal, tmp_csum_seed;
419	uid_t owner[2];
420	int alloc_ctx;
421
422	/*
423	 * If the filesystem does not support extents, or the inode
424	 * already is extent-based, error out.
425	 */
426	if (!ext4_has_feature_extents(inode->i_sb) ||
427	    ext4_test_inode_flag(inode, EXT4_INODE_EXTENTS) ||
428	    ext4_has_inline_data(inode))
429		return -EINVAL;
430
431	if (S_ISLNK(inode->i_mode) && inode->i_blocks == 0)
432		/*
433		 * don't migrate fast symlink
434		 */
435		return retval;
436
437	alloc_ctx = ext4_writepages_down_write(inode->i_sb);
438
439	/*
440	 * Worst case we can touch the allocation bitmaps and a block
441	 * group descriptor block.  We do need to worry about
442	 * credits for modifying the quota inode.
443	 */
444	handle = ext4_journal_start(inode, EXT4_HT_MIGRATE,
445		3 + EXT4_MAXQUOTAS_TRANS_BLOCKS(inode->i_sb));
446
447	if (IS_ERR(handle)) {
448		retval = PTR_ERR(handle);
449		goto out_unlock;
450	}
451	goal = (((inode->i_ino - 1) / EXT4_INODES_PER_GROUP(inode->i_sb)) *
452		EXT4_INODES_PER_GROUP(inode->i_sb)) + 1;
453	owner[0] = i_uid_read(inode);
454	owner[1] = i_gid_read(inode);
455	tmp_inode = ext4_new_inode(handle, d_inode(inode->i_sb->s_root),
456				   S_IFREG, NULL, goal, owner, 0);
457	if (IS_ERR(tmp_inode)) {
458		retval = PTR_ERR(tmp_inode);
459		ext4_journal_stop(handle);
460		goto out_unlock;
461	}
462	/*
463	 * Use the correct seed for checksum (i.e. the seed from 'inode').  This
464	 * is so that the metadata blocks will have the correct checksum after
465	 * the migration.
466	 */
467	ei = EXT4_I(inode);
468	tmp_csum_seed = EXT4_I(tmp_inode)->i_csum_seed;
469	EXT4_I(tmp_inode)->i_csum_seed = ei->i_csum_seed;
470	i_size_write(tmp_inode, i_size_read(inode));
471	/*
472	 * Set the i_nlink to zero so it will be deleted later
473	 * when we drop inode reference.
474	 */
475	clear_nlink(tmp_inode);
476
477	ext4_ext_tree_init(handle, tmp_inode);
 
478	ext4_journal_stop(handle);
479
480	/*
481	 * start with one credit accounted for
482	 * superblock modification.
483	 *
484	 * For the tmp_inode we already have committed the
485	 * transaction that created the inode. Later as and
486	 * when we add extents we extent the journal
487	 */
488	/*
489	 * Even though we take i_rwsem we can still cause block
490	 * allocation via mmap write to holes. If we have allocated
491	 * new blocks we fail migrate.  New block allocation will
492	 * clear EXT4_STATE_EXT_MIGRATE flag.  The flag is updated
493	 * with i_data_sem held to prevent racing with block
494	 * allocation.
495	 */
496	down_read(&EXT4_I(inode)->i_data_sem);
497	ext4_set_inode_state(inode, EXT4_STATE_EXT_MIGRATE);
498	up_read((&EXT4_I(inode)->i_data_sem));
499
500	handle = ext4_journal_start(inode, EXT4_HT_MIGRATE, 1);
501	if (IS_ERR(handle)) {
 
 
 
 
 
 
502		retval = PTR_ERR(handle);
503		goto out_tmp_inode;
504	}
505
 
506	i_data = ei->i_data;
507	memset(&lb, 0, sizeof(lb));
508
509	/* 32 bit block address 4 bytes */
510	max_entries = inode->i_sb->s_blocksize >> 2;
511	for (i = 0; i < EXT4_NDIR_BLOCKS; i++) {
512		if (i_data[i]) {
513			retval = update_extent_range(handle, tmp_inode,
514						le32_to_cpu(i_data[i]), &lb);
515			if (retval)
516				goto err_out;
517		} else
518			lb.curr_block++;
519	}
520	if (i_data[EXT4_IND_BLOCK]) {
521		retval = update_ind_extent_range(handle, tmp_inode,
522				le32_to_cpu(i_data[EXT4_IND_BLOCK]), &lb);
523		if (retval)
524			goto err_out;
525	} else
526		lb.curr_block += max_entries;
527	if (i_data[EXT4_DIND_BLOCK]) {
528		retval = update_dind_extent_range(handle, tmp_inode,
529				le32_to_cpu(i_data[EXT4_DIND_BLOCK]), &lb);
530		if (retval)
531			goto err_out;
532	} else
533		lb.curr_block += max_entries * max_entries;
534	if (i_data[EXT4_TIND_BLOCK]) {
535		retval = update_tind_extent_range(handle, tmp_inode,
536				le32_to_cpu(i_data[EXT4_TIND_BLOCK]), &lb);
537		if (retval)
538			goto err_out;
539	}
540	/*
541	 * Build the last extent
542	 */
543	retval = finish_range(handle, tmp_inode, &lb);
544err_out:
545	if (retval)
546		/*
547		 * Failure case delete the extent information with the
548		 * tmp_inode
549		 */
550		free_ext_block(handle, tmp_inode);
551	else {
552		retval = ext4_ext_swap_inode_data(handle, inode, tmp_inode);
553		if (retval)
554			/*
555			 * if we fail to swap inode data free the extent
556			 * details of the tmp inode
557			 */
558			free_ext_block(handle, tmp_inode);
559	}
560
561	/* We mark the tmp_inode dirty via ext4_ext_tree_init. */
562	retval = ext4_journal_ensure_credits(handle, 1, 0);
563	if (retval < 0)
564		goto out_stop;
565	/*
566	 * Mark the tmp_inode as of size zero
567	 */
568	i_size_write(tmp_inode, 0);
569
570	/*
571	 * set the  i_blocks count to zero
572	 * so that the ext4_evict_inode() does the
573	 * right job
574	 *
575	 * We don't need to take the i_lock because
576	 * the inode is not visible to user space.
577	 */
578	tmp_inode->i_blocks = 0;
579	EXT4_I(tmp_inode)->i_csum_seed = tmp_csum_seed;
580
581	/* Reset the extent details */
582	ext4_ext_tree_init(handle, tmp_inode);
583out_stop:
584	ext4_journal_stop(handle);
585out_tmp_inode:
586	unlock_new_inode(tmp_inode);
587	iput(tmp_inode);
588out_unlock:
589	ext4_writepages_up_write(inode->i_sb, alloc_ctx);
590	return retval;
591}
592
593/*
594 * Migrate a simple extent-based inode to use the i_blocks[] array
595 */
596int ext4_ind_migrate(struct inode *inode)
597{
598	struct ext4_extent_header	*eh;
599	struct ext4_sb_info		*sbi = EXT4_SB(inode->i_sb);
600	struct ext4_super_block		*es = sbi->s_es;
601	struct ext4_inode_info		*ei = EXT4_I(inode);
602	struct ext4_extent		*ex;
603	unsigned int			i, len;
604	ext4_lblk_t			start, end;
605	ext4_fsblk_t			blk;
606	handle_t			*handle;
607	int				ret, ret2 = 0;
608	int				alloc_ctx;
609
610	if (!ext4_has_feature_extents(inode->i_sb) ||
611	    (!ext4_test_inode_flag(inode, EXT4_INODE_EXTENTS)))
612		return -EINVAL;
613
614	if (ext4_has_feature_bigalloc(inode->i_sb))
615		return -EOPNOTSUPP;
616
617	/*
618	 * In order to get correct extent info, force all delayed allocation
619	 * blocks to be allocated, otherwise delayed allocation blocks may not
620	 * be reflected and bypass the checks on extent header.
621	 */
622	if (test_opt(inode->i_sb, DELALLOC))
623		ext4_alloc_da_blocks(inode);
624
625	alloc_ctx = ext4_writepages_down_write(inode->i_sb);
626
627	handle = ext4_journal_start(inode, EXT4_HT_MIGRATE, 1);
628	if (IS_ERR(handle)) {
629		ret = PTR_ERR(handle);
630		goto out_unlock;
631	}
632
633	down_write(&EXT4_I(inode)->i_data_sem);
634	ret = ext4_ext_check_inode(inode);
635	if (ret)
636		goto errout;
637
638	eh = ext_inode_hdr(inode);
639	ex  = EXT_FIRST_EXTENT(eh);
640	if (ext4_blocks_count(es) > EXT4_MAX_BLOCK_FILE_PHYS ||
641	    eh->eh_depth != 0 || le16_to_cpu(eh->eh_entries) > 1) {
642		ret = -EOPNOTSUPP;
643		goto errout;
644	}
645	if (eh->eh_entries == 0)
646		blk = len = start = end = 0;
647	else {
648		len = le16_to_cpu(ex->ee_len);
649		blk = ext4_ext_pblock(ex);
650		start = le32_to_cpu(ex->ee_block);
651		end = start + len - 1;
652		if (end >= EXT4_NDIR_BLOCKS) {
653			ret = -EOPNOTSUPP;
654			goto errout;
655		}
656	}
657
658	ext4_clear_inode_flag(inode, EXT4_INODE_EXTENTS);
659	memset(ei->i_data, 0, sizeof(ei->i_data));
660	for (i = start; i <= end; i++)
661		ei->i_data[i] = cpu_to_le32(blk++);
662	ret2 = ext4_mark_inode_dirty(handle, inode);
663	if (unlikely(ret2 && !ret))
664		ret = ret2;
665errout:
666	ext4_journal_stop(handle);
667	up_write(&EXT4_I(inode)->i_data_sem);
668out_unlock:
669	ext4_writepages_up_write(inode->i_sb, alloc_ctx);
670	return ret;
671}