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