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