[deliverable/linux.git] / fs / reiserfs / resize.c

/*
 * Copyright 2000 by Hans Reiser, licensing governed by reiserfs/README
 */

/*
 * Written by Alexander Zarochentcev.
 *
 * The kernel part of the (on-line) reiserfs resizer.
 */

#include <linux/kernel.h>
#include <linux/mm.h>
#include <linux/vmalloc.h>
#include <linux/string.h>
#include <linux/errno.h>
#include "reiserfs.h"
#include <linux/buffer_head.h>

int reiserfs_resize(struct super_block *s, unsigned long block_count_new)
{
	int err = 0;
	struct reiserfs_super_block *sb;
	struct reiserfs_bitmap_info *bitmap;
	struct reiserfs_bitmap_info *info;
	struct reiserfs_bitmap_info *old_bitmap = SB_AP_BITMAP(s);
	struct buffer_head *bh;
	struct reiserfs_transaction_handle th;
	unsigned int bmap_nr_new, bmap_nr;
	unsigned int block_r_new, block_r;

	struct reiserfs_list_bitmap *jb;
	struct reiserfs_list_bitmap jbitmap[JOURNAL_NUM_BITMAPS];

	unsigned long int block_count, free_blocks;
	int i;
	int copy_size;
	int depth;

	sb = SB_DISK_SUPER_BLOCK(s);

	if (SB_BLOCK_COUNT(s) >= block_count_new) {
		printk("can\'t shrink filesystem on-line\n");
		return -EINVAL;
	}

	/* check the device size */
	depth = reiserfs_write_unlock_nested(s);
	bh = sb_bread(s, block_count_new - 1);
	reiserfs_write_lock_nested(s, depth);
	if (!bh) {
		printk("reiserfs_resize: can\'t read last block\n");
		return -EINVAL;
	}
	bforget(bh);

	/* old disk layout detection; those partitions can be mounted, but
	 * cannot be resized */
	if (SB_BUFFER_WITH_SB(s)->b_blocknr * SB_BUFFER_WITH_SB(s)->b_size
	    != REISERFS_DISK_OFFSET_IN_BYTES) {
		printk
		    ("reiserfs_resize: unable to resize a reiserfs without distributed bitmap (fs version < 3.5.12)\n");
		return -ENOTSUPP;
	}

	/* count used bits in last bitmap block */
	block_r = SB_BLOCK_COUNT(s) -
			(reiserfs_bmap_count(s) - 1) * s->s_blocksize * 8;

	/* count bitmap blocks in new fs */
	bmap_nr_new = block_count_new / (s->s_blocksize * 8);
	block_r_new = block_count_new - bmap_nr_new * s->s_blocksize * 8;
	if (block_r_new)
		bmap_nr_new++;
	else
		block_r_new = s->s_blocksize * 8;

	/* save old values */
	block_count = SB_BLOCK_COUNT(s);
	bmap_nr = reiserfs_bmap_count(s);

	/* resizing of reiserfs bitmaps (journal and real), if needed */
	if (bmap_nr_new > bmap_nr) {
		/* reallocate journal bitmaps */
		if (reiserfs_allocate_list_bitmaps(s, jbitmap, bmap_nr_new) < 0) {
			printk
			    ("reiserfs_resize: unable to allocate memory for journal bitmaps\n");
			return -ENOMEM;
		}
		/* the new journal bitmaps are zero filled, now we copy in the bitmap
		 ** node pointers from the old journal bitmap structs, and then
		 ** transfer the new data structures into the journal struct.
		 **
		 ** using the copy_size var below allows this code to work for
		 ** both shrinking and expanding the FS.
		 */
		copy_size = bmap_nr_new < bmap_nr ? bmap_nr_new : bmap_nr;
		copy_size =
		    copy_size * sizeof(struct reiserfs_list_bitmap_node *);
		for (i = 0; i < JOURNAL_NUM_BITMAPS; i++) {
			struct reiserfs_bitmap_node **node_tmp;
			jb = SB_JOURNAL(s)->j_list_bitmap + i;
			memcpy(jbitmap[i].bitmaps, jb->bitmaps, copy_size);

			/* just in case vfree schedules on us, copy the new
			 ** pointer into the journal struct before freeing the
			 ** old one
			 */
			node_tmp = jb->bitmaps;
			jb->bitmaps = jbitmap[i].bitmaps;
			vfree(node_tmp);
		}

		/* allocate additional bitmap blocks, reallocate array of bitmap
		 * block pointers */
		bitmap =
		    vzalloc(sizeof(struct reiserfs_bitmap_info) * bmap_nr_new);
		if (!bitmap) {
			/* Journal bitmaps are still supersized, but the memory isn't
			 * leaked, so I guess it's ok */
			printk("reiserfs_resize: unable to allocate memory.\n");
			return -ENOMEM;
		}
		for (i = 0; i < bmap_nr; i++)
			bitmap[i] = old_bitmap[i];

		/* This doesn't go through the journal, but it doesn't have to.
		 * The changes are still atomic: We're synced up when the journal
		 * transaction begins, and the new bitmaps don't matter if the
		 * transaction fails. */
		for (i = bmap_nr; i < bmap_nr_new; i++) {
			int depth;
			/* don't use read_bitmap_block since it will cache
			 * the uninitialized bitmap */
			depth = reiserfs_write_unlock_nested(s);
			bh = sb_bread(s, i * s->s_blocksize * 8);
			reiserfs_write_lock_nested(s, depth);
			if (!bh) {
				vfree(bitmap);
				return -EIO;
			}
			memset(bh->b_data, 0, sb_blocksize(sb));
			reiserfs_set_le_bit(0, bh->b_data);
			reiserfs_cache_bitmap_metadata(s, bh, bitmap + i);

			set_buffer_uptodate(bh);
			mark_buffer_dirty(bh);
			depth = reiserfs_write_unlock_nested(s);
			sync_dirty_buffer(bh);
			reiserfs_write_lock_nested(s, depth);
			// update bitmap_info stuff
			bitmap[i].free_count = sb_blocksize(sb) * 8 - 1;
			brelse(bh);
		}
		/* free old bitmap blocks array */
		SB_AP_BITMAP(s) = bitmap;
		vfree(old_bitmap);
	}

	/* begin transaction, if there was an error, it's fine. Yes, we have
	 * incorrect bitmaps now, but none of it is ever going to touch the
	 * disk anyway. */
	err = journal_begin(&th, s, 10);
	if (err)
		return err;

	/* Extend old last bitmap block - new blocks have been made available */
	info = SB_AP_BITMAP(s) + bmap_nr - 1;
	bh = reiserfs_read_bitmap_block(s, bmap_nr - 1);
	if (!bh) {
		int jerr = journal_end(&th, s, 10);
		if (jerr)
			return jerr;
		return -EIO;
	}

	reiserfs_prepare_for_journal(s, bh, 1);
	for (i = block_r; i < s->s_blocksize * 8; i++)
		reiserfs_clear_le_bit(i, bh->b_data);
	info->free_count += s->s_blocksize * 8 - block_r;

	journal_mark_dirty(&th, s, bh);
	brelse(bh);

	/* Correct new last bitmap block - It may not be full */
	info = SB_AP_BITMAP(s) + bmap_nr_new - 1;
	bh = reiserfs_read_bitmap_block(s, bmap_nr_new - 1);
	if (!bh) {
		int jerr = journal_end(&th, s, 10);
		if (jerr)
			return jerr;
		return -EIO;
	}

	reiserfs_prepare_for_journal(s, bh, 1);
	for (i = block_r_new; i < s->s_blocksize * 8; i++)
		reiserfs_set_le_bit(i, bh->b_data);
	journal_mark_dirty(&th, s, bh);
	brelse(bh);

	info->free_count -= s->s_blocksize * 8 - block_r_new;
	/* update super */
	reiserfs_prepare_for_journal(s, SB_BUFFER_WITH_SB(s), 1);
	free_blocks = SB_FREE_BLOCKS(s);
	PUT_SB_FREE_BLOCKS(s,
			   free_blocks + (block_count_new - block_count -
					  (bmap_nr_new - bmap_nr)));
	PUT_SB_BLOCK_COUNT(s, block_count_new);
	PUT_SB_BMAP_NR(s, bmap_would_wrap(bmap_nr_new) ? : bmap_nr_new);

	journal_mark_dirty(&th, s, SB_BUFFER_WITH_SB(s));

	SB_JOURNAL(s)->j_must_wait = 1;
	return journal_end(&th, s, 10);
}
Commit	Line	Data
0222e657	1	/*
1da177e4 LT	2	* Copyright 2000 by Hans Reiser, licensing governed by reiserfs/README
1da177e4 LT	3	*/
bd4c625c	4
0222e657	5	/*
1da177e4 LT	6	* Written by Alexander Zarochentcev.
	7	*
	8	* The kernel part of the (on-line) reiserfs resizer.
	9	*/
	10
	11	#include <linux/kernel.h>
	12	#include <linux/mm.h>
	13	#include <linux/vmalloc.h>
	14	#include <linux/string.h>
	15	#include <linux/errno.h>
f466c6fd	16	#include "reiserfs.h"
1da177e4 LT	17	#include <linux/buffer_head.h>
1da177e4 LT	18
bd4c625c	19	int reiserfs_resize(struct super_block *s, unsigned long block_count_new)
1da177e4	20	{
bd4c625c LT	21	int err = 0;
	22	struct reiserfs_super_block *sb;
	23	struct reiserfs_bitmap_info *bitmap;
0b3dc17b	24	struct reiserfs_bitmap_info *info;
1da177e4	25	struct reiserfs_bitmap_info *old_bitmap = SB_AP_BITMAP(s);
bd4c625c	26	struct buffer_head *bh;
1da177e4 LT	27	struct reiserfs_transaction_handle th;
	28	unsigned int bmap_nr_new, bmap_nr;
	29	unsigned int block_r_new, block_r;
bd4c625c LT	30
bd4c625c LT	31	struct reiserfs_list_bitmap *jb;
1da177e4	32	struct reiserfs_list_bitmap jbitmap[JOURNAL_NUM_BITMAPS];
bd4c625c	33
1da177e4 LT	34	unsigned long int block_count, free_blocks;
1da177e4 LT	35	int i;
bd4c625c	36	int copy_size;
278f6679	37	int depth;
1da177e4 LT	38
	39	sb = SB_DISK_SUPER_BLOCK(s);
	40
	41	if (SB_BLOCK_COUNT(s) >= block_count_new) {
	42	printk("can\'t shrink filesystem on-line\n");
	43	return -EINVAL;
	44	}
	45
	46	/* check the device size */
278f6679	47	depth = reiserfs_write_unlock_nested(s);
1da177e4	48	bh = sb_bread(s, block_count_new - 1);
278f6679	49	reiserfs_write_lock_nested(s, depth);
1da177e4 LT	50	if (!bh) {
	51	printk("reiserfs_resize: can\'t read last block\n");
	52	return -EINVAL;
bd4c625c	53	}
1da177e4 LT	54	bforget(bh);
	55
	56	/* old disk layout detection; those partitions can be mounted, but
	57	* cannot be resized */
bd4c625c LT	58	if (SB_BUFFER_WITH_SB(s)->b_blocknr * SB_BUFFER_WITH_SB(s)->b_size
	59	!= REISERFS_DISK_OFFSET_IN_BYTES) {
	60	printk
	61	("reiserfs_resize: unable to resize a reiserfs without distributed bitmap (fs version < 3.5.12)\n");
1da177e4 LT	62	return -ENOTSUPP;
1da177e4 LT	63	}
bd4c625c	64
1da177e4	65	/* count used bits in last bitmap block */
cb680c1b JM	66	block_r = SB_BLOCK_COUNT(s) -
cb680c1b JM	67	(reiserfs_bmap_count(s) - 1) * s->s_blocksize * 8;
bd4c625c	68
1da177e4	69	/* count bitmap blocks in new fs */
bd4c625c	70	bmap_nr_new = block_count_new / (s->s_blocksize * 8);
1da177e4	71	block_r_new = block_count_new - bmap_nr_new * s->s_blocksize * 8;
bd4c625c	72	if (block_r_new)
1da177e4 LT	73	bmap_nr_new++;
	74	else
	75	block_r_new = s->s_blocksize * 8;
	76
	77	/* save old values */
	78	block_count = SB_BLOCK_COUNT(s);
cb680c1b	79	bmap_nr = reiserfs_bmap_count(s);
1da177e4 LT	80
1da177e4 LT	81	/* resizing of reiserfs bitmaps (journal and real), if needed */
bd4c625c LT	82	if (bmap_nr_new > bmap_nr) {
	83	/* reallocate journal bitmaps */
	84	if (reiserfs_allocate_list_bitmaps(s, jbitmap, bmap_nr_new) < 0) {
	85	printk
	86	("reiserfs_resize: unable to allocate memory for journal bitmaps\n");
bd4c625c LT	87	return -ENOMEM;
	88	}
	89	/* the new journal bitmaps are zero filled, now we copy in the bitmap
	90	** node pointers from the old journal bitmap structs, and then
	91	** transfer the new data structures into the journal struct.
	92	**
	93	** using the copy_size var below allows this code to work for
	94	** both shrinking and expanding the FS.
	95	*/
	96	copy_size = bmap_nr_new < bmap_nr ? bmap_nr_new : bmap_nr;
	97	copy_size =
	98	copy_size * sizeof(struct reiserfs_list_bitmap_node *);
	99	for (i = 0; i < JOURNAL_NUM_BITMAPS; i++) {
	100	struct reiserfs_bitmap_node **node_tmp;
	101	jb = SB_JOURNAL(s)->j_list_bitmap + i;
	102	memcpy(jbitmap[i].bitmaps, jb->bitmaps, copy_size);
	103
	104	/* just in case vfree schedules on us, copy the new
0222e657	105	** pointer into the journal struct before freeing the
bd4c625c LT	106	** old one
	107	*/
	108	node_tmp = jb->bitmaps;
	109	jb->bitmaps = jbitmap[i].bitmaps;
	110	vfree(node_tmp);
	111	}
	112
	113	/* allocate additional bitmap blocks, reallocate array of bitmap
	114	* block pointers */
	115	bitmap =
558feb08	116	vzalloc(sizeof(struct reiserfs_bitmap_info) * bmap_nr_new);
bd4c625c LT	117	if (!bitmap) {
	118	/* Journal bitmaps are still supersized, but the memory isn't
	119	* leaked, so I guess it's ok */
	120	printk("reiserfs_resize: unable to allocate memory.\n");
	121	return -ENOMEM;
	122	}
bd4c625c LT	123	for (i = 0; i < bmap_nr; i++)
	124	bitmap[i] = old_bitmap[i];
	125
	126	/* This doesn't go through the journal, but it doesn't have to.
	127	* The changes are still atomic: We're synced up when the journal
	128	* transaction begins, and the new bitmaps don't matter if the
	129	* transaction fails. */
	130	for (i = bmap_nr; i < bmap_nr_new; i++) {
278f6679	131	int depth;
5065227b JM	132	/* don't use read_bitmap_block since it will cache
5065227b JM	133	* the uninitialized bitmap */
278f6679	134	depth = reiserfs_write_unlock_nested(s);
5065227b	135	bh = sb_bread(s, i * s->s_blocksize * 8);
278f6679	136	reiserfs_write_lock_nested(s, depth);
2d3466a3 DM	137	if (!bh) {
	138	vfree(bitmap);
	139	return -EIO;
	140	}
0b3dc17b	141	memset(bh->b_data, 0, sb_blocksize(sb));
0c2fd1bf	142	reiserfs_set_le_bit(0, bh->b_data);
6f01046b	143	reiserfs_cache_bitmap_metadata(s, bh, bitmap + i);
0b3dc17b JM	144
	145	set_buffer_uptodate(bh);
	146	mark_buffer_dirty(bh);
278f6679	147	depth = reiserfs_write_unlock_nested(s);
0b3dc17b	148	sync_dirty_buffer(bh);
278f6679	149	reiserfs_write_lock_nested(s, depth);
bd4c625c	150	// update bitmap_info stuff
bd4c625c	151	bitmap[i].free_count = sb_blocksize(sb) * 8 - 1;
0b3dc17b	152	brelse(bh);
bd4c625c LT	153	}
	154	/* free old bitmap blocks array */
	155	SB_AP_BITMAP(s) = bitmap;
	156	vfree(old_bitmap);
1da177e4	157	}
bd4c625c	158
1da177e4 LT	159	/* begin transaction, if there was an error, it's fine. Yes, we have
	160	* incorrect bitmaps now, but none of it is ever going to touch the
	161	* disk anyway. */
	162	err = journal_begin(&th, s, 10);
	163	if (err)
bd4c625c	164	return err;
1da177e4	165
0b3dc17b JM	166	/* Extend old last bitmap block - new blocks have been made available */
0b3dc17b JM	167	info = SB_AP_BITMAP(s) + bmap_nr - 1;
5065227b JM	168	bh = reiserfs_read_bitmap_block(s, bmap_nr - 1);
	169	if (!bh) {
	170	int jerr = journal_end(&th, s, 10);
	171	if (jerr)
	172	return jerr;
	173	return -EIO;
	174	}
0b3dc17b JM	175
0b3dc17b JM	176	reiserfs_prepare_for_journal(s, bh, 1);
1da177e4	177	for (i = block_r; i < s->s_blocksize * 8; i++)
0c2fd1bf	178	reiserfs_clear_le_bit(i, bh->b_data);
0b3dc17b	179	info->free_count += s->s_blocksize * 8 - block_r;
0b3dc17b JM	180
	181	journal_mark_dirty(&th, s, bh);
	182	brelse(bh);
1da177e4	183
0b3dc17b JM	184	/* Correct new last bitmap block - It may not be full */
0b3dc17b JM	185	info = SB_AP_BITMAP(s) + bmap_nr_new - 1;
5065227b JM	186	bh = reiserfs_read_bitmap_block(s, bmap_nr_new - 1);
	187	if (!bh) {
	188	int jerr = journal_end(&th, s, 10);
	189	if (jerr)
	190	return jerr;
	191	return -EIO;
	192	}
1da177e4	193
0b3dc17b	194	reiserfs_prepare_for_journal(s, bh, 1);
1da177e4	195	for (i = block_r_new; i < s->s_blocksize * 8; i++)
0c2fd1bf	196	reiserfs_set_le_bit(i, bh->b_data);
0b3dc17b JM	197	journal_mark_dirty(&th, s, bh);
0b3dc17b JM	198	brelse(bh);
bd4c625c	199
0b3dc17b	200	info->free_count -= s->s_blocksize * 8 - block_r_new;
bd4c625c LT	201	/* update super */
bd4c625c LT	202	reiserfs_prepare_for_journal(s, SB_BUFFER_WITH_SB(s), 1);
1da177e4	203	free_blocks = SB_FREE_BLOCKS(s);
bd4c625c LT	204	PUT_SB_FREE_BLOCKS(s,
	205	free_blocks + (block_count_new - block_count -
	206	(bmap_nr_new - bmap_nr)));
1da177e4	207	PUT_SB_BLOCK_COUNT(s, block_count_new);
cb680c1b	208	PUT_SB_BMAP_NR(s, bmap_would_wrap(bmap_nr_new) ? : bmap_nr_new);
1da177e4 LT	209
1da177e4 LT	210	journal_mark_dirty(&th, s, SB_BUFFER_WITH_SB(s));
bd4c625c	211
1da177e4 LT	212	SB_JOURNAL(s)->j_must_wait = 1;
	213	return journal_end(&th, s, 10);
	214	}