Commit | Line | Data |
---|---|---|
32a7627c N |
1 | /* |
2 | * bitmap.c two-level bitmap (C) Peter T. Breuer (ptb@ot.uc3m.es) 2003 | |
3 | * | |
4 | * bitmap_create - sets up the bitmap structure | |
5 | * bitmap_destroy - destroys the bitmap structure | |
6 | * | |
7 | * additions, Copyright (C) 2003-2004, Paul Clements, SteelEye Technology, Inc.: | |
8 | * - added disk storage for bitmap | |
9 | * - changes to allow various bitmap chunk sizes | |
32a7627c N |
10 | */ |
11 | ||
12 | /* | |
13 | * Still to do: | |
14 | * | |
15 | * flush after percent set rather than just time based. (maybe both). | |
32a7627c N |
16 | */ |
17 | ||
bff61975 | 18 | #include <linux/blkdev.h> |
32a7627c | 19 | #include <linux/module.h> |
32a7627c N |
20 | #include <linux/errno.h> |
21 | #include <linux/slab.h> | |
22 | #include <linux/init.h> | |
32a7627c N |
23 | #include <linux/timer.h> |
24 | #include <linux/sched.h> | |
25 | #include <linux/list.h> | |
26 | #include <linux/file.h> | |
27 | #include <linux/mount.h> | |
28 | #include <linux/buffer_head.h> | |
57148964 | 29 | #include <linux/seq_file.h> |
43b2e5d8 | 30 | #include "md.h" |
ef740c37 | 31 | #include "bitmap.h" |
32a7627c | 32 | |
ac2f40be | 33 | static inline char *bmname(struct bitmap *bitmap) |
32a7627c N |
34 | { |
35 | return bitmap->mddev ? mdname(bitmap->mddev) : "mdX"; | |
36 | } | |
37 | ||
32a7627c N |
38 | /* |
39 | * check a page and, if necessary, allocate it (or hijack it if the alloc fails) | |
40 | * | |
41 | * 1) check to see if this page is allocated, if it's not then try to alloc | |
42 | * 2) if the alloc fails, set the page's hijacked flag so we'll use the | |
43 | * page pointer directly as a counter | |
44 | * | |
45 | * if we find our page, we increment the page's refcount so that it stays | |
46 | * allocated while we're using it | |
47 | */ | |
ac2f40be N |
48 | static int bitmap_checkpage(struct bitmap *bitmap, |
49 | unsigned long page, int create) | |
ee305ace N |
50 | __releases(bitmap->lock) |
51 | __acquires(bitmap->lock) | |
32a7627c N |
52 | { |
53 | unsigned char *mappage; | |
54 | ||
55 | if (page >= bitmap->pages) { | |
1187cf0a N |
56 | /* This can happen if bitmap_start_sync goes beyond |
57 | * End-of-device while looking for a whole page. | |
58 | * It is harmless. | |
59 | */ | |
32a7627c N |
60 | return -EINVAL; |
61 | } | |
62 | ||
32a7627c N |
63 | if (bitmap->bp[page].hijacked) /* it's hijacked, don't try to alloc */ |
64 | return 0; | |
65 | ||
66 | if (bitmap->bp[page].map) /* page is already allocated, just return */ | |
67 | return 0; | |
68 | ||
69 | if (!create) | |
70 | return -ENOENT; | |
71 | ||
32a7627c N |
72 | /* this page has not been allocated yet */ |
73 | ||
ac2f40be | 74 | spin_unlock_irq(&bitmap->lock); |
792a1d4b | 75 | mappage = kzalloc(PAGE_SIZE, GFP_NOIO); |
ac2f40be N |
76 | spin_lock_irq(&bitmap->lock); |
77 | ||
78 | if (mappage == NULL) { | |
36a4e1fe N |
79 | pr_debug("%s: bitmap map page allocation failed, hijacking\n", |
80 | bmname(bitmap)); | |
32a7627c N |
81 | /* failed - set the hijacked flag so that we can use the |
82 | * pointer as a counter */ | |
32a7627c N |
83 | if (!bitmap->bp[page].map) |
84 | bitmap->bp[page].hijacked = 1; | |
ac2f40be N |
85 | } else if (bitmap->bp[page].map || |
86 | bitmap->bp[page].hijacked) { | |
32a7627c | 87 | /* somebody beat us to getting the page */ |
792a1d4b | 88 | kfree(mappage); |
32a7627c | 89 | return 0; |
ac2f40be | 90 | } else { |
32a7627c | 91 | |
ac2f40be | 92 | /* no page was in place and we have one, so install it */ |
32a7627c | 93 | |
ac2f40be N |
94 | bitmap->bp[page].map = mappage; |
95 | bitmap->missing_pages--; | |
96 | } | |
32a7627c N |
97 | return 0; |
98 | } | |
99 | ||
32a7627c N |
100 | /* if page is completely empty, put it back on the free list, or dealloc it */ |
101 | /* if page was hijacked, unmark the flag so it might get alloced next time */ | |
102 | /* Note: lock should be held when calling this */ | |
858119e1 | 103 | static void bitmap_checkfree(struct bitmap *bitmap, unsigned long page) |
32a7627c N |
104 | { |
105 | char *ptr; | |
106 | ||
107 | if (bitmap->bp[page].count) /* page is still busy */ | |
108 | return; | |
109 | ||
110 | /* page is no longer in use, it can be released */ | |
111 | ||
112 | if (bitmap->bp[page].hijacked) { /* page was hijacked, undo this now */ | |
113 | bitmap->bp[page].hijacked = 0; | |
114 | bitmap->bp[page].map = NULL; | |
ac2f40be N |
115 | } else { |
116 | /* normal case, free the page */ | |
117 | ptr = bitmap->bp[page].map; | |
118 | bitmap->bp[page].map = NULL; | |
119 | bitmap->missing_pages++; | |
792a1d4b | 120 | kfree(ptr); |
32a7627c | 121 | } |
32a7627c N |
122 | } |
123 | ||
32a7627c N |
124 | /* |
125 | * bitmap file handling - read and write the bitmap file and its superblock | |
126 | */ | |
127 | ||
32a7627c N |
128 | /* |
129 | * basic page I/O operations | |
130 | */ | |
131 | ||
a654b9d8 | 132 | /* IO operations when bitmap is stored near all superblocks */ |
fd01b88c | 133 | static struct page *read_sb_page(struct mddev *mddev, loff_t offset, |
a2ed9615 N |
134 | struct page *page, |
135 | unsigned long index, int size) | |
a654b9d8 N |
136 | { |
137 | /* choose a good rdev and read the page from there */ | |
138 | ||
3cb03002 | 139 | struct md_rdev *rdev; |
a654b9d8 | 140 | sector_t target; |
ac2f40be | 141 | int did_alloc = 0; |
a654b9d8 | 142 | |
ac2f40be | 143 | if (!page) { |
a2ed9615 | 144 | page = alloc_page(GFP_KERNEL); |
ac2f40be N |
145 | if (!page) |
146 | return ERR_PTR(-ENOMEM); | |
147 | did_alloc = 1; | |
148 | } | |
a654b9d8 | 149 | |
dafb20fa | 150 | rdev_for_each(rdev, mddev) { |
b2d444d7 N |
151 | if (! test_bit(In_sync, &rdev->flags) |
152 | || test_bit(Faulty, &rdev->flags)) | |
ab904d63 N |
153 | continue; |
154 | ||
ccebd4c4 | 155 | target = offset + index * (PAGE_SIZE/512); |
a654b9d8 | 156 | |
2b193363 | 157 | if (sync_page_io(rdev, target, |
e1defc4f | 158 | roundup(size, bdev_logical_block_size(rdev->bdev)), |
ccebd4c4 | 159 | page, READ, true)) { |
ab904d63 | 160 | page->index = index; |
ce25c31b N |
161 | attach_page_buffers(page, NULL); /* so that free_buffer will |
162 | * quietly no-op */ | |
ab904d63 N |
163 | return page; |
164 | } | |
165 | } | |
ac2f40be N |
166 | if (did_alloc) |
167 | put_page(page); | |
ab904d63 | 168 | return ERR_PTR(-EIO); |
a654b9d8 | 169 | |
a654b9d8 N |
170 | } |
171 | ||
fd01b88c | 172 | static struct md_rdev *next_active_rdev(struct md_rdev *rdev, struct mddev *mddev) |
b2d2c4ce N |
173 | { |
174 | /* Iterate the disks of an mddev, using rcu to protect access to the | |
175 | * linked list, and raising the refcount of devices we return to ensure | |
176 | * they don't disappear while in use. | |
177 | * As devices are only added or removed when raid_disk is < 0 and | |
178 | * nr_pending is 0 and In_sync is clear, the entries we return will | |
179 | * still be in the same position on the list when we re-enter | |
180 | * list_for_each_continue_rcu. | |
181 | */ | |
182 | struct list_head *pos; | |
183 | rcu_read_lock(); | |
184 | if (rdev == NULL) | |
185 | /* start at the beginning */ | |
186 | pos = &mddev->disks; | |
187 | else { | |
188 | /* release the previous rdev and start from there. */ | |
189 | rdev_dec_pending(rdev, mddev); | |
190 | pos = &rdev->same_set; | |
191 | } | |
192 | list_for_each_continue_rcu(pos, &mddev->disks) { | |
3cb03002 | 193 | rdev = list_entry(pos, struct md_rdev, same_set); |
b2d2c4ce | 194 | if (rdev->raid_disk >= 0 && |
b2d2c4ce N |
195 | !test_bit(Faulty, &rdev->flags)) { |
196 | /* this is a usable devices */ | |
197 | atomic_inc(&rdev->nr_pending); | |
198 | rcu_read_unlock(); | |
199 | return rdev; | |
200 | } | |
201 | } | |
202 | rcu_read_unlock(); | |
203 | return NULL; | |
204 | } | |
205 | ||
ab6085c7 | 206 | static int write_sb_page(struct bitmap *bitmap, struct page *page, int wait) |
a654b9d8 | 207 | { |
3cb03002 | 208 | struct md_rdev *rdev = NULL; |
a6ff7e08 | 209 | struct block_device *bdev; |
fd01b88c | 210 | struct mddev *mddev = bitmap->mddev; |
a654b9d8 | 211 | |
b2d2c4ce | 212 | while ((rdev = next_active_rdev(rdev, mddev)) != NULL) { |
ac2f40be N |
213 | int size = PAGE_SIZE; |
214 | loff_t offset = mddev->bitmap_info.offset; | |
a6ff7e08 JB |
215 | |
216 | bdev = (rdev->meta_bdev) ? rdev->meta_bdev : rdev->bdev; | |
217 | ||
ac2f40be N |
218 | if (page->index == bitmap->file_pages-1) |
219 | size = roundup(bitmap->last_page_size, | |
a6ff7e08 | 220 | bdev_logical_block_size(bdev)); |
ac2f40be N |
221 | /* Just make sure we aren't corrupting data or |
222 | * metadata | |
223 | */ | |
224 | if (mddev->external) { | |
225 | /* Bitmap could be anywhere. */ | |
226 | if (rdev->sb_start + offset + (page->index | |
227 | * (PAGE_SIZE/512)) | |
228 | > rdev->data_offset | |
229 | && | |
230 | rdev->sb_start + offset | |
231 | < (rdev->data_offset + mddev->dev_sectors | |
232 | + (PAGE_SIZE/512))) | |
233 | goto bad_alignment; | |
234 | } else if (offset < 0) { | |
235 | /* DATA BITMAP METADATA */ | |
236 | if (offset | |
237 | + (long)(page->index * (PAGE_SIZE/512)) | |
238 | + size/512 > 0) | |
239 | /* bitmap runs in to metadata */ | |
240 | goto bad_alignment; | |
241 | if (rdev->data_offset + mddev->dev_sectors | |
242 | > rdev->sb_start + offset) | |
243 | /* data runs in to bitmap */ | |
244 | goto bad_alignment; | |
245 | } else if (rdev->sb_start < rdev->data_offset) { | |
246 | /* METADATA BITMAP DATA */ | |
247 | if (rdev->sb_start | |
248 | + offset | |
249 | + page->index*(PAGE_SIZE/512) + size/512 | |
250 | > rdev->data_offset) | |
251 | /* bitmap runs in to data */ | |
252 | goto bad_alignment; | |
253 | } else { | |
254 | /* DATA METADATA BITMAP - no problems */ | |
255 | } | |
256 | md_super_write(mddev, rdev, | |
257 | rdev->sb_start + offset | |
258 | + page->index * (PAGE_SIZE/512), | |
259 | size, | |
260 | page); | |
b2d2c4ce | 261 | } |
a654b9d8 N |
262 | |
263 | if (wait) | |
a9701a30 | 264 | md_super_wait(mddev); |
a654b9d8 | 265 | return 0; |
4b80991c N |
266 | |
267 | bad_alignment: | |
4b80991c | 268 | return -EINVAL; |
a654b9d8 N |
269 | } |
270 | ||
4ad13663 | 271 | static void bitmap_file_kick(struct bitmap *bitmap); |
32a7627c | 272 | /* |
a654b9d8 | 273 | * write out a page to a file |
32a7627c | 274 | */ |
4ad13663 | 275 | static void write_page(struct bitmap *bitmap, struct page *page, int wait) |
32a7627c | 276 | { |
d785a06a | 277 | struct buffer_head *bh; |
32a7627c | 278 | |
f0d76d70 N |
279 | if (bitmap->file == NULL) { |
280 | switch (write_sb_page(bitmap, page, wait)) { | |
281 | case -EINVAL: | |
282 | bitmap->flags |= BITMAP_WRITE_ERROR; | |
f0d76d70 | 283 | } |
4ad13663 | 284 | } else { |
a654b9d8 | 285 | |
4ad13663 | 286 | bh = page_buffers(page); |
c708443c | 287 | |
4ad13663 N |
288 | while (bh && bh->b_blocknr) { |
289 | atomic_inc(&bitmap->pending_writes); | |
290 | set_buffer_locked(bh); | |
291 | set_buffer_mapped(bh); | |
721a9602 | 292 | submit_bh(WRITE | REQ_SYNC, bh); |
4ad13663 N |
293 | bh = bh->b_this_page; |
294 | } | |
d785a06a | 295 | |
ac2f40be | 296 | if (wait) |
4ad13663 N |
297 | wait_event(bitmap->write_wait, |
298 | atomic_read(&bitmap->pending_writes)==0); | |
8a5e9cf1 | 299 | } |
4ad13663 N |
300 | if (bitmap->flags & BITMAP_WRITE_ERROR) |
301 | bitmap_file_kick(bitmap); | |
d785a06a N |
302 | } |
303 | ||
304 | static void end_bitmap_write(struct buffer_head *bh, int uptodate) | |
305 | { | |
306 | struct bitmap *bitmap = bh->b_private; | |
307 | unsigned long flags; | |
32a7627c | 308 | |
d785a06a N |
309 | if (!uptodate) { |
310 | spin_lock_irqsave(&bitmap->lock, flags); | |
311 | bitmap->flags |= BITMAP_WRITE_ERROR; | |
312 | spin_unlock_irqrestore(&bitmap->lock, flags); | |
32a7627c | 313 | } |
d785a06a N |
314 | if (atomic_dec_and_test(&bitmap->pending_writes)) |
315 | wake_up(&bitmap->write_wait); | |
316 | } | |
32a7627c | 317 | |
d785a06a N |
318 | /* copied from buffer.c */ |
319 | static void | |
320 | __clear_page_buffers(struct page *page) | |
321 | { | |
322 | ClearPagePrivate(page); | |
323 | set_page_private(page, 0); | |
324 | page_cache_release(page); | |
325 | } | |
326 | static void free_buffers(struct page *page) | |
327 | { | |
328 | struct buffer_head *bh = page_buffers(page); | |
77ad4bc7 | 329 | |
d785a06a N |
330 | while (bh) { |
331 | struct buffer_head *next = bh->b_this_page; | |
332 | free_buffer_head(bh); | |
333 | bh = next; | |
77ad4bc7 | 334 | } |
d785a06a N |
335 | __clear_page_buffers(page); |
336 | put_page(page); | |
32a7627c N |
337 | } |
338 | ||
d785a06a N |
339 | /* read a page from a file. |
340 | * We both read the page, and attach buffers to the page to record the | |
341 | * address of each block (using bmap). These addresses will be used | |
342 | * to write the block later, completely bypassing the filesystem. | |
343 | * This usage is similar to how swap files are handled, and allows us | |
344 | * to write to a file with no concerns of memory allocation failing. | |
345 | */ | |
32a7627c | 346 | static struct page *read_page(struct file *file, unsigned long index, |
d785a06a N |
347 | struct bitmap *bitmap, |
348 | unsigned long count) | |
32a7627c | 349 | { |
32a7627c | 350 | struct page *page = NULL; |
c649bb9c | 351 | struct inode *inode = file->f_path.dentry->d_inode; |
d785a06a N |
352 | struct buffer_head *bh; |
353 | sector_t block; | |
32a7627c | 354 | |
36a4e1fe N |
355 | pr_debug("read bitmap file (%dB @ %llu)\n", (int)PAGE_SIZE, |
356 | (unsigned long long)index << PAGE_SHIFT); | |
32a7627c | 357 | |
d785a06a N |
358 | page = alloc_page(GFP_KERNEL); |
359 | if (!page) | |
360 | page = ERR_PTR(-ENOMEM); | |
32a7627c N |
361 | if (IS_ERR(page)) |
362 | goto out; | |
d785a06a | 363 | |
d785a06a N |
364 | bh = alloc_page_buffers(page, 1<<inode->i_blkbits, 0); |
365 | if (!bh) { | |
2d1f3b5d | 366 | put_page(page); |
d785a06a | 367 | page = ERR_PTR(-ENOMEM); |
32a7627c N |
368 | goto out; |
369 | } | |
d785a06a N |
370 | attach_page_buffers(page, bh); |
371 | block = index << (PAGE_SHIFT - inode->i_blkbits); | |
372 | while (bh) { | |
373 | if (count == 0) | |
374 | bh->b_blocknr = 0; | |
375 | else { | |
376 | bh->b_blocknr = bmap(inode, block); | |
377 | if (bh->b_blocknr == 0) { | |
378 | /* Cannot use this file! */ | |
379 | free_buffers(page); | |
380 | page = ERR_PTR(-EINVAL); | |
381 | goto out; | |
382 | } | |
383 | bh->b_bdev = inode->i_sb->s_bdev; | |
384 | if (count < (1<<inode->i_blkbits)) | |
385 | count = 0; | |
386 | else | |
387 | count -= (1<<inode->i_blkbits); | |
388 | ||
389 | bh->b_end_io = end_bitmap_write; | |
390 | bh->b_private = bitmap; | |
ce25c31b N |
391 | atomic_inc(&bitmap->pending_writes); |
392 | set_buffer_locked(bh); | |
393 | set_buffer_mapped(bh); | |
394 | submit_bh(READ, bh); | |
d785a06a N |
395 | } |
396 | block++; | |
397 | bh = bh->b_this_page; | |
398 | } | |
d785a06a | 399 | page->index = index; |
ce25c31b N |
400 | |
401 | wait_event(bitmap->write_wait, | |
402 | atomic_read(&bitmap->pending_writes)==0); | |
403 | if (bitmap->flags & BITMAP_WRITE_ERROR) { | |
404 | free_buffers(page); | |
405 | page = ERR_PTR(-EIO); | |
406 | } | |
32a7627c N |
407 | out: |
408 | if (IS_ERR(page)) | |
ac2f40be | 409 | printk(KERN_ALERT "md: bitmap read error: (%dB @ %llu): %ld\n", |
2d1f3b5d N |
410 | (int)PAGE_SIZE, |
411 | (unsigned long long)index << PAGE_SHIFT, | |
32a7627c N |
412 | PTR_ERR(page)); |
413 | return page; | |
414 | } | |
415 | ||
416 | /* | |
417 | * bitmap file superblock operations | |
418 | */ | |
419 | ||
420 | /* update the event counter and sync the superblock to disk */ | |
4ad13663 | 421 | void bitmap_update_sb(struct bitmap *bitmap) |
32a7627c N |
422 | { |
423 | bitmap_super_t *sb; | |
32a7627c N |
424 | |
425 | if (!bitmap || !bitmap->mddev) /* no bitmap for this array */ | |
4ad13663 | 426 | return; |
ece5cff0 N |
427 | if (bitmap->mddev->bitmap_info.external) |
428 | return; | |
5a6c824e | 429 | if (!bitmap->sb_page) /* no superblock */ |
4ad13663 | 430 | return; |
b2f46e68 | 431 | sb = kmap_atomic(bitmap->sb_page); |
32a7627c | 432 | sb->events = cpu_to_le64(bitmap->mddev->events); |
8258c532 | 433 | if (bitmap->mddev->events < bitmap->events_cleared) |
a0da84f3 NB |
434 | /* rocking back to read-only */ |
435 | bitmap->events_cleared = bitmap->mddev->events; | |
8258c532 N |
436 | sb->events_cleared = cpu_to_le64(bitmap->events_cleared); |
437 | sb->state = cpu_to_le32(bitmap->flags); | |
43a70507 N |
438 | /* Just in case these have been changed via sysfs: */ |
439 | sb->daemon_sleep = cpu_to_le32(bitmap->mddev->bitmap_info.daemon_sleep/HZ); | |
440 | sb->write_behind = cpu_to_le32(bitmap->mddev->bitmap_info.max_write_behind); | |
b2f46e68 | 441 | kunmap_atomic(sb); |
4ad13663 | 442 | write_page(bitmap, bitmap->sb_page, 1); |
32a7627c N |
443 | } |
444 | ||
445 | /* print out the bitmap file superblock */ | |
446 | void bitmap_print_sb(struct bitmap *bitmap) | |
447 | { | |
448 | bitmap_super_t *sb; | |
449 | ||
450 | if (!bitmap || !bitmap->sb_page) | |
451 | return; | |
b2f46e68 | 452 | sb = kmap_atomic(bitmap->sb_page); |
32a7627c | 453 | printk(KERN_DEBUG "%s: bitmap file superblock:\n", bmname(bitmap)); |
a2cff26a N |
454 | printk(KERN_DEBUG " magic: %08x\n", le32_to_cpu(sb->magic)); |
455 | printk(KERN_DEBUG " version: %d\n", le32_to_cpu(sb->version)); | |
456 | printk(KERN_DEBUG " uuid: %08x.%08x.%08x.%08x\n", | |
32a7627c N |
457 | *(__u32 *)(sb->uuid+0), |
458 | *(__u32 *)(sb->uuid+4), | |
459 | *(__u32 *)(sb->uuid+8), | |
460 | *(__u32 *)(sb->uuid+12)); | |
a2cff26a | 461 | printk(KERN_DEBUG " events: %llu\n", |
32a7627c | 462 | (unsigned long long) le64_to_cpu(sb->events)); |
a2cff26a | 463 | printk(KERN_DEBUG "events cleared: %llu\n", |
32a7627c | 464 | (unsigned long long) le64_to_cpu(sb->events_cleared)); |
a2cff26a N |
465 | printk(KERN_DEBUG " state: %08x\n", le32_to_cpu(sb->state)); |
466 | printk(KERN_DEBUG " chunksize: %d B\n", le32_to_cpu(sb->chunksize)); | |
467 | printk(KERN_DEBUG " daemon sleep: %ds\n", le32_to_cpu(sb->daemon_sleep)); | |
468 | printk(KERN_DEBUG " sync size: %llu KB\n", | |
469 | (unsigned long long)le64_to_cpu(sb->sync_size)/2); | |
4b6d287f | 470 | printk(KERN_DEBUG "max write behind: %d\n", le32_to_cpu(sb->write_behind)); |
b2f46e68 | 471 | kunmap_atomic(sb); |
32a7627c N |
472 | } |
473 | ||
9c81075f JB |
474 | /* |
475 | * bitmap_new_disk_sb | |
476 | * @bitmap | |
477 | * | |
478 | * This function is somewhat the reverse of bitmap_read_sb. bitmap_read_sb | |
479 | * reads and verifies the on-disk bitmap superblock and populates bitmap_info. | |
480 | * This function verifies 'bitmap_info' and populates the on-disk bitmap | |
481 | * structure, which is to be written to disk. | |
482 | * | |
483 | * Returns: 0 on success, -Exxx on error | |
484 | */ | |
485 | static int bitmap_new_disk_sb(struct bitmap *bitmap) | |
486 | { | |
487 | bitmap_super_t *sb; | |
488 | unsigned long chunksize, daemon_sleep, write_behind; | |
489 | int err = -EINVAL; | |
490 | ||
491 | bitmap->sb_page = alloc_page(GFP_KERNEL); | |
492 | if (IS_ERR(bitmap->sb_page)) { | |
493 | err = PTR_ERR(bitmap->sb_page); | |
494 | bitmap->sb_page = NULL; | |
495 | return err; | |
496 | } | |
497 | bitmap->sb_page->index = 0; | |
498 | ||
b2f46e68 | 499 | sb = kmap_atomic(bitmap->sb_page); |
9c81075f JB |
500 | |
501 | sb->magic = cpu_to_le32(BITMAP_MAGIC); | |
502 | sb->version = cpu_to_le32(BITMAP_MAJOR_HI); | |
503 | ||
504 | chunksize = bitmap->mddev->bitmap_info.chunksize; | |
505 | BUG_ON(!chunksize); | |
506 | if (!is_power_of_2(chunksize)) { | |
b2f46e68 | 507 | kunmap_atomic(sb); |
9c81075f JB |
508 | printk(KERN_ERR "bitmap chunksize not a power of 2\n"); |
509 | return -EINVAL; | |
510 | } | |
511 | sb->chunksize = cpu_to_le32(chunksize); | |
512 | ||
513 | daemon_sleep = bitmap->mddev->bitmap_info.daemon_sleep; | |
514 | if (!daemon_sleep || | |
515 | (daemon_sleep < 1) || (daemon_sleep > MAX_SCHEDULE_TIMEOUT)) { | |
516 | printk(KERN_INFO "Choosing daemon_sleep default (5 sec)\n"); | |
517 | daemon_sleep = 5 * HZ; | |
518 | } | |
519 | sb->daemon_sleep = cpu_to_le32(daemon_sleep); | |
520 | bitmap->mddev->bitmap_info.daemon_sleep = daemon_sleep; | |
521 | ||
522 | /* | |
523 | * FIXME: write_behind for RAID1. If not specified, what | |
524 | * is a good choice? We choose COUNTER_MAX / 2 arbitrarily. | |
525 | */ | |
526 | write_behind = bitmap->mddev->bitmap_info.max_write_behind; | |
527 | if (write_behind > COUNTER_MAX) | |
528 | write_behind = COUNTER_MAX / 2; | |
529 | sb->write_behind = cpu_to_le32(write_behind); | |
530 | bitmap->mddev->bitmap_info.max_write_behind = write_behind; | |
531 | ||
532 | /* keep the array size field of the bitmap superblock up to date */ | |
533 | sb->sync_size = cpu_to_le64(bitmap->mddev->resync_max_sectors); | |
534 | ||
535 | memcpy(sb->uuid, bitmap->mddev->uuid, 16); | |
536 | ||
537 | bitmap->flags |= BITMAP_STALE; | |
538 | sb->state |= cpu_to_le32(BITMAP_STALE); | |
539 | bitmap->events_cleared = bitmap->mddev->events; | |
540 | sb->events_cleared = cpu_to_le64(bitmap->mddev->events); | |
541 | ||
b2f46e68 | 542 | kunmap_atomic(sb); |
9c81075f JB |
543 | |
544 | return 0; | |
545 | } | |
546 | ||
32a7627c N |
547 | /* read the superblock from the bitmap file and initialize some bitmap fields */ |
548 | static int bitmap_read_sb(struct bitmap *bitmap) | |
549 | { | |
550 | char *reason = NULL; | |
551 | bitmap_super_t *sb; | |
4b6d287f | 552 | unsigned long chunksize, daemon_sleep, write_behind; |
32a7627c N |
553 | unsigned long long events; |
554 | int err = -EINVAL; | |
555 | ||
ef99bf48 N |
556 | if (!bitmap->file && !bitmap->mddev->bitmap_info.offset) { |
557 | chunksize = 128 * 1024 * 1024; | |
558 | daemon_sleep = 5 * HZ; | |
559 | write_behind = 0; | |
560 | bitmap->flags = BITMAP_STALE; | |
561 | err = 0; | |
562 | goto out_no_sb; | |
563 | } | |
32a7627c | 564 | /* page 0 is the superblock, read it... */ |
f49d5e62 N |
565 | if (bitmap->file) { |
566 | loff_t isize = i_size_read(bitmap->file->f_mapping->host); | |
567 | int bytes = isize > PAGE_SIZE ? PAGE_SIZE : isize; | |
568 | ||
569 | bitmap->sb_page = read_page(bitmap->file, 0, bitmap, bytes); | |
570 | } else { | |
42a04b50 N |
571 | bitmap->sb_page = read_sb_page(bitmap->mddev, |
572 | bitmap->mddev->bitmap_info.offset, | |
a2ed9615 N |
573 | NULL, |
574 | 0, sizeof(bitmap_super_t)); | |
a654b9d8 | 575 | } |
32a7627c N |
576 | if (IS_ERR(bitmap->sb_page)) { |
577 | err = PTR_ERR(bitmap->sb_page); | |
578 | bitmap->sb_page = NULL; | |
579 | return err; | |
580 | } | |
581 | ||
b2f46e68 | 582 | sb = kmap_atomic(bitmap->sb_page); |
32a7627c | 583 | |
32a7627c | 584 | chunksize = le32_to_cpu(sb->chunksize); |
1b04be96 | 585 | daemon_sleep = le32_to_cpu(sb->daemon_sleep) * HZ; |
4b6d287f | 586 | write_behind = le32_to_cpu(sb->write_behind); |
32a7627c N |
587 | |
588 | /* verify that the bitmap-specific fields are valid */ | |
589 | if (sb->magic != cpu_to_le32(BITMAP_MAGIC)) | |
590 | reason = "bad magic"; | |
bd926c63 N |
591 | else if (le32_to_cpu(sb->version) < BITMAP_MAJOR_LO || |
592 | le32_to_cpu(sb->version) > BITMAP_MAJOR_HI) | |
32a7627c | 593 | reason = "unrecognized superblock version"; |
1187cf0a | 594 | else if (chunksize < 512) |
7dd5d34c | 595 | reason = "bitmap chunksize too small"; |
d744540c | 596 | else if (!is_power_of_2(chunksize)) |
32a7627c | 597 | reason = "bitmap chunksize not a power of 2"; |
1b04be96 | 598 | else if (daemon_sleep < 1 || daemon_sleep > MAX_SCHEDULE_TIMEOUT) |
7dd5d34c | 599 | reason = "daemon sleep period out of range"; |
4b6d287f N |
600 | else if (write_behind > COUNTER_MAX) |
601 | reason = "write-behind limit out of range (0 - 16383)"; | |
32a7627c N |
602 | if (reason) { |
603 | printk(KERN_INFO "%s: invalid bitmap file superblock: %s\n", | |
604 | bmname(bitmap), reason); | |
605 | goto out; | |
606 | } | |
607 | ||
608 | /* keep the array size field of the bitmap superblock up to date */ | |
609 | sb->sync_size = cpu_to_le64(bitmap->mddev->resync_max_sectors); | |
610 | ||
278c1ca2 N |
611 | if (bitmap->mddev->persistent) { |
612 | /* | |
613 | * We have a persistent array superblock, so compare the | |
614 | * bitmap's UUID and event counter to the mddev's | |
615 | */ | |
616 | if (memcmp(sb->uuid, bitmap->mddev->uuid, 16)) { | |
617 | printk(KERN_INFO | |
618 | "%s: bitmap superblock UUID mismatch\n", | |
619 | bmname(bitmap)); | |
620 | goto out; | |
621 | } | |
622 | events = le64_to_cpu(sb->events); | |
623 | if (events < bitmap->mddev->events) { | |
624 | printk(KERN_INFO | |
625 | "%s: bitmap file is out of date (%llu < %llu) " | |
626 | "-- forcing full recovery\n", | |
627 | bmname(bitmap), events, | |
628 | (unsigned long long) bitmap->mddev->events); | |
629 | sb->state |= cpu_to_le32(BITMAP_STALE); | |
630 | } | |
32a7627c | 631 | } |
278c1ca2 | 632 | |
32a7627c | 633 | /* assign fields using values from superblock */ |
4f2e639a | 634 | bitmap->flags |= le32_to_cpu(sb->state); |
bd926c63 N |
635 | if (le32_to_cpu(sb->version) == BITMAP_MAJOR_HOSTENDIAN) |
636 | bitmap->flags |= BITMAP_HOSTENDIAN; | |
32a7627c N |
637 | bitmap->events_cleared = le64_to_cpu(sb->events_cleared); |
638 | err = 0; | |
639 | out: | |
b2f46e68 | 640 | kunmap_atomic(sb); |
ef99bf48 N |
641 | out_no_sb: |
642 | if (bitmap->flags & BITMAP_STALE) | |
643 | bitmap->events_cleared = bitmap->mddev->events; | |
644 | bitmap->mddev->bitmap_info.chunksize = chunksize; | |
645 | bitmap->mddev->bitmap_info.daemon_sleep = daemon_sleep; | |
646 | bitmap->mddev->bitmap_info.max_write_behind = write_behind; | |
32a7627c N |
647 | if (err) |
648 | bitmap_print_sb(bitmap); | |
649 | return err; | |
650 | } | |
651 | ||
652 | enum bitmap_mask_op { | |
653 | MASK_SET, | |
654 | MASK_UNSET | |
655 | }; | |
656 | ||
4ad13663 N |
657 | /* record the state of the bitmap in the superblock. Return the old value */ |
658 | static int bitmap_mask_state(struct bitmap *bitmap, enum bitmap_state bits, | |
659 | enum bitmap_mask_op op) | |
32a7627c N |
660 | { |
661 | bitmap_super_t *sb; | |
4ad13663 | 662 | int old; |
32a7627c | 663 | |
5a6c824e | 664 | if (!bitmap->sb_page) /* can't set the state */ |
4ad13663 | 665 | return 0; |
b2f46e68 | 666 | sb = kmap_atomic(bitmap->sb_page); |
4ad13663 | 667 | old = le32_to_cpu(sb->state) & bits; |
32a7627c | 668 | switch (op) { |
ac2f40be N |
669 | case MASK_SET: |
670 | sb->state |= cpu_to_le32(bits); | |
8258c532 | 671 | bitmap->flags |= bits; |
ac2f40be N |
672 | break; |
673 | case MASK_UNSET: | |
674 | sb->state &= cpu_to_le32(~bits); | |
8258c532 | 675 | bitmap->flags &= ~bits; |
ac2f40be N |
676 | break; |
677 | default: | |
678 | BUG(); | |
32a7627c | 679 | } |
b2f46e68 | 680 | kunmap_atomic(sb); |
4ad13663 | 681 | return old; |
32a7627c N |
682 | } |
683 | ||
684 | /* | |
685 | * general bitmap file operations | |
686 | */ | |
687 | ||
ece5cff0 N |
688 | /* |
689 | * on-disk bitmap: | |
690 | * | |
691 | * Use one bit per "chunk" (block set). We do the disk I/O on the bitmap | |
692 | * file a page at a time. There's a superblock at the start of the file. | |
693 | */ | |
32a7627c | 694 | /* calculate the index of the page that contains this bit */ |
ece5cff0 | 695 | static inline unsigned long file_page_index(struct bitmap *bitmap, unsigned long chunk) |
32a7627c | 696 | { |
ece5cff0 N |
697 | if (!bitmap->mddev->bitmap_info.external) |
698 | chunk += sizeof(bitmap_super_t) << 3; | |
699 | return chunk >> PAGE_BIT_SHIFT; | |
32a7627c N |
700 | } |
701 | ||
702 | /* calculate the (bit) offset of this bit within a page */ | |
ece5cff0 | 703 | static inline unsigned long file_page_offset(struct bitmap *bitmap, unsigned long chunk) |
32a7627c | 704 | { |
ece5cff0 N |
705 | if (!bitmap->mddev->bitmap_info.external) |
706 | chunk += sizeof(bitmap_super_t) << 3; | |
707 | return chunk & (PAGE_BITS - 1); | |
32a7627c N |
708 | } |
709 | ||
710 | /* | |
711 | * return a pointer to the page in the filemap that contains the given bit | |
712 | * | |
713 | * this lookup is complicated by the fact that the bitmap sb might be exactly | |
714 | * 1 page (e.g., x86) or less than 1 page -- so the bitmap might start on page | |
715 | * 0 or page 1 | |
716 | */ | |
717 | static inline struct page *filemap_get_page(struct bitmap *bitmap, | |
3520fa4d | 718 | unsigned long chunk) |
32a7627c | 719 | { |
ac2f40be N |
720 | if (file_page_index(bitmap, chunk) >= bitmap->file_pages) |
721 | return NULL; | |
ece5cff0 N |
722 | return bitmap->filemap[file_page_index(bitmap, chunk) |
723 | - file_page_index(bitmap, 0)]; | |
32a7627c N |
724 | } |
725 | ||
32a7627c N |
726 | static void bitmap_file_unmap(struct bitmap *bitmap) |
727 | { | |
728 | struct page **map, *sb_page; | |
729 | unsigned long *attr; | |
730 | int pages; | |
731 | unsigned long flags; | |
732 | ||
733 | spin_lock_irqsave(&bitmap->lock, flags); | |
734 | map = bitmap->filemap; | |
735 | bitmap->filemap = NULL; | |
736 | attr = bitmap->filemap_attr; | |
737 | bitmap->filemap_attr = NULL; | |
738 | pages = bitmap->file_pages; | |
739 | bitmap->file_pages = 0; | |
740 | sb_page = bitmap->sb_page; | |
741 | bitmap->sb_page = NULL; | |
742 | spin_unlock_irqrestore(&bitmap->lock, flags); | |
743 | ||
744 | while (pages--) | |
ece5cff0 | 745 | if (map[pages] != sb_page) /* 0 is sb_page, release it below */ |
d785a06a | 746 | free_buffers(map[pages]); |
32a7627c N |
747 | kfree(map); |
748 | kfree(attr); | |
749 | ||
d785a06a N |
750 | if (sb_page) |
751 | free_buffers(sb_page); | |
32a7627c N |
752 | } |
753 | ||
754 | static void bitmap_file_put(struct bitmap *bitmap) | |
755 | { | |
756 | struct file *file; | |
32a7627c N |
757 | unsigned long flags; |
758 | ||
759 | spin_lock_irqsave(&bitmap->lock, flags); | |
760 | file = bitmap->file; | |
761 | bitmap->file = NULL; | |
762 | spin_unlock_irqrestore(&bitmap->lock, flags); | |
763 | ||
d785a06a N |
764 | if (file) |
765 | wait_event(bitmap->write_wait, | |
766 | atomic_read(&bitmap->pending_writes)==0); | |
32a7627c N |
767 | bitmap_file_unmap(bitmap); |
768 | ||
d785a06a | 769 | if (file) { |
c649bb9c | 770 | struct inode *inode = file->f_path.dentry->d_inode; |
fc0ecff6 | 771 | invalidate_mapping_pages(inode->i_mapping, 0, -1); |
32a7627c | 772 | fput(file); |
d785a06a | 773 | } |
32a7627c N |
774 | } |
775 | ||
32a7627c N |
776 | /* |
777 | * bitmap_file_kick - if an error occurs while manipulating the bitmap file | |
778 | * then it is no longer reliable, so we stop using it and we mark the file | |
779 | * as failed in the superblock | |
780 | */ | |
781 | static void bitmap_file_kick(struct bitmap *bitmap) | |
782 | { | |
783 | char *path, *ptr = NULL; | |
784 | ||
4ad13663 N |
785 | if (bitmap_mask_state(bitmap, BITMAP_STALE, MASK_SET) == 0) { |
786 | bitmap_update_sb(bitmap); | |
32a7627c | 787 | |
4ad13663 N |
788 | if (bitmap->file) { |
789 | path = kmalloc(PAGE_SIZE, GFP_KERNEL); | |
790 | if (path) | |
6bcfd601 CH |
791 | ptr = d_path(&bitmap->file->f_path, path, |
792 | PAGE_SIZE); | |
793 | ||
4ad13663 N |
794 | printk(KERN_ALERT |
795 | "%s: kicking failed bitmap file %s from array!\n", | |
6bcfd601 | 796 | bmname(bitmap), IS_ERR(ptr) ? "" : ptr); |
32a7627c | 797 | |
4ad13663 N |
798 | kfree(path); |
799 | } else | |
800 | printk(KERN_ALERT | |
801 | "%s: disabling internal bitmap due to errors\n", | |
802 | bmname(bitmap)); | |
a654b9d8 | 803 | } |
32a7627c N |
804 | |
805 | bitmap_file_put(bitmap); | |
806 | ||
807 | return; | |
808 | } | |
809 | ||
810 | enum bitmap_page_attr { | |
ac2f40be | 811 | BITMAP_PAGE_DIRTY = 0, /* there are set bits that need to be synced */ |
5a537df4 N |
812 | BITMAP_PAGE_PENDING = 1, /* there are bits that are being cleaned. |
813 | * i.e. counter is 1 or 2. */ | |
ac2f40be | 814 | BITMAP_PAGE_NEEDWRITE = 2, /* there are cleared bits that need to be synced */ |
32a7627c N |
815 | }; |
816 | ||
817 | static inline void set_page_attr(struct bitmap *bitmap, struct page *page, | |
818 | enum bitmap_page_attr attr) | |
819 | { | |
3520fa4d | 820 | __set_bit((page->index<<2) + attr, bitmap->filemap_attr); |
32a7627c N |
821 | } |
822 | ||
823 | static inline void clear_page_attr(struct bitmap *bitmap, struct page *page, | |
824 | enum bitmap_page_attr attr) | |
825 | { | |
3520fa4d | 826 | __clear_bit((page->index<<2) + attr, bitmap->filemap_attr); |
32a7627c N |
827 | } |
828 | ||
ec7a3197 N |
829 | static inline unsigned long test_page_attr(struct bitmap *bitmap, struct page *page, |
830 | enum bitmap_page_attr attr) | |
32a7627c | 831 | { |
3520fa4d | 832 | return test_bit((page->index<<2) + attr, bitmap->filemap_attr); |
32a7627c N |
833 | } |
834 | ||
835 | /* | |
836 | * bitmap_file_set_bit -- called before performing a write to the md device | |
837 | * to set (and eventually sync) a particular bit in the bitmap file | |
838 | * | |
839 | * we set the bit immediately, then we record the page number so that | |
840 | * when an unplug occurs, we can flush the dirty pages out to disk | |
841 | */ | |
842 | static void bitmap_file_set_bit(struct bitmap *bitmap, sector_t block) | |
843 | { | |
844 | unsigned long bit; | |
3520fa4d | 845 | struct page *page; |
32a7627c | 846 | void *kaddr; |
61a0d80c | 847 | unsigned long chunk = block >> bitmap->chunkshift; |
32a7627c | 848 | |
3520fa4d JB |
849 | page = filemap_get_page(bitmap, chunk); |
850 | if (!page) | |
851 | return; | |
852 | bit = file_page_offset(bitmap, chunk); | |
32a7627c | 853 | |
3520fa4d | 854 | /* set the bit */ |
b2f46e68 | 855 | kaddr = kmap_atomic(page); |
3520fa4d JB |
856 | if (bitmap->flags & BITMAP_HOSTENDIAN) |
857 | set_bit(bit, kaddr); | |
858 | else | |
859 | __set_bit_le(bit, kaddr); | |
b2f46e68 | 860 | kunmap_atomic(kaddr); |
36a4e1fe | 861 | pr_debug("set file bit %lu page %lu\n", bit, page->index); |
32a7627c N |
862 | /* record page number so it gets flushed to disk when unplug occurs */ |
863 | set_page_attr(bitmap, page, BITMAP_PAGE_DIRTY); | |
32a7627c N |
864 | } |
865 | ||
ef99bf48 N |
866 | static void bitmap_file_clear_bit(struct bitmap *bitmap, sector_t block) |
867 | { | |
868 | unsigned long bit; | |
869 | struct page *page; | |
870 | void *paddr; | |
871 | unsigned long chunk = block >> bitmap->chunkshift; | |
872 | ||
873 | page = filemap_get_page(bitmap, chunk); | |
874 | if (!page) | |
875 | return; | |
876 | bit = file_page_offset(bitmap, chunk); | |
877 | paddr = kmap_atomic(page); | |
878 | if (bitmap->flags & BITMAP_HOSTENDIAN) | |
879 | clear_bit(bit, paddr); | |
880 | else | |
881 | __clear_bit_le(bit, paddr); | |
882 | kunmap_atomic(paddr); | |
883 | if (!test_page_attr(bitmap, page, BITMAP_PAGE_NEEDWRITE)) { | |
884 | set_page_attr(bitmap, page, BITMAP_PAGE_PENDING); | |
885 | bitmap->allclean = 0; | |
886 | } | |
887 | } | |
888 | ||
32a7627c N |
889 | /* this gets called when the md device is ready to unplug its underlying |
890 | * (slave) device queues -- before we let any writes go down, we need to | |
891 | * sync the dirty pages of the bitmap file to disk */ | |
4ad13663 | 892 | void bitmap_unplug(struct bitmap *bitmap) |
32a7627c | 893 | { |
ec7a3197 N |
894 | unsigned long i, flags; |
895 | int dirty, need_write; | |
32a7627c N |
896 | struct page *page; |
897 | int wait = 0; | |
898 | ||
ef99bf48 | 899 | if (!bitmap || !bitmap->filemap) |
4ad13663 | 900 | return; |
32a7627c N |
901 | |
902 | /* look at each page to see if there are any set bits that need to be | |
903 | * flushed out to disk */ | |
904 | for (i = 0; i < bitmap->file_pages; i++) { | |
905 | spin_lock_irqsave(&bitmap->lock, flags); | |
a654b9d8 | 906 | if (!bitmap->filemap) { |
32a7627c | 907 | spin_unlock_irqrestore(&bitmap->lock, flags); |
4ad13663 | 908 | return; |
32a7627c N |
909 | } |
910 | page = bitmap->filemap[i]; | |
ec7a3197 N |
911 | dirty = test_page_attr(bitmap, page, BITMAP_PAGE_DIRTY); |
912 | need_write = test_page_attr(bitmap, page, BITMAP_PAGE_NEEDWRITE); | |
32a7627c N |
913 | clear_page_attr(bitmap, page, BITMAP_PAGE_DIRTY); |
914 | clear_page_attr(bitmap, page, BITMAP_PAGE_NEEDWRITE); | |
bf07bb7d N |
915 | if (dirty || need_write) |
916 | clear_page_attr(bitmap, page, BITMAP_PAGE_PENDING); | |
ec7a3197 | 917 | if (dirty) |
32a7627c N |
918 | wait = 1; |
919 | spin_unlock_irqrestore(&bitmap->lock, flags); | |
920 | ||
ac2f40be | 921 | if (dirty || need_write) |
4ad13663 | 922 | write_page(bitmap, page, 0); |
32a7627c N |
923 | } |
924 | if (wait) { /* if any writes were performed, we need to wait on them */ | |
0b79ccf0 | 925 | if (bitmap->file) |
d785a06a N |
926 | wait_event(bitmap->write_wait, |
927 | atomic_read(&bitmap->pending_writes)==0); | |
0b79ccf0 | 928 | else |
a9701a30 | 929 | md_super_wait(bitmap->mddev); |
32a7627c | 930 | } |
d785a06a N |
931 | if (bitmap->flags & BITMAP_WRITE_ERROR) |
932 | bitmap_file_kick(bitmap); | |
32a7627c | 933 | } |
ac2f40be | 934 | EXPORT_SYMBOL(bitmap_unplug); |
32a7627c | 935 | |
6a07997f | 936 | static void bitmap_set_memory_bits(struct bitmap *bitmap, sector_t offset, int needed); |
32a7627c N |
937 | /* * bitmap_init_from_disk -- called at bitmap_create time to initialize |
938 | * the in-memory bitmap from the on-disk bitmap -- also, sets up the | |
939 | * memory mapping of the bitmap file | |
940 | * Special cases: | |
941 | * if there's no bitmap file, or if the bitmap file had been | |
942 | * previously kicked from the array, we mark all the bits as | |
943 | * 1's in order to cause a full resync. | |
6a07997f N |
944 | * |
945 | * We ignore all bits for sectors that end earlier than 'start'. | |
946 | * This is used when reading an out-of-date bitmap... | |
32a7627c | 947 | */ |
6a07997f | 948 | static int bitmap_init_from_disk(struct bitmap *bitmap, sector_t start) |
32a7627c N |
949 | { |
950 | unsigned long i, chunks, index, oldindex, bit; | |
951 | struct page *page = NULL, *oldpage = NULL; | |
952 | unsigned long num_pages, bit_cnt = 0; | |
953 | struct file *file; | |
d785a06a | 954 | unsigned long bytes, offset; |
32a7627c N |
955 | int outofdate; |
956 | int ret = -ENOSPC; | |
ea03aff9 | 957 | void *paddr; |
32a7627c N |
958 | |
959 | chunks = bitmap->chunks; | |
960 | file = bitmap->file; | |
961 | ||
ef99bf48 N |
962 | if (!file && !bitmap->mddev->bitmap_info.offset) { |
963 | /* No permanent bitmap - fill with '1s'. */ | |
964 | bitmap->filemap = NULL; | |
965 | bitmap->file_pages = 0; | |
966 | for (i = 0; i < chunks ; i++) { | |
967 | /* if the disk bit is set, set the memory bit */ | |
968 | int needed = ((sector_t)(i+1) << (bitmap->chunkshift) | |
969 | >= start); | |
970 | bitmap_set_memory_bits(bitmap, | |
971 | (sector_t)i << bitmap->chunkshift, | |
972 | needed); | |
973 | } | |
974 | return 0; | |
975 | } | |
32a7627c | 976 | |
32a7627c | 977 | outofdate = bitmap->flags & BITMAP_STALE; |
32a7627c N |
978 | if (outofdate) |
979 | printk(KERN_INFO "%s: bitmap file is out of date, doing full " | |
980 | "recovery\n", bmname(bitmap)); | |
981 | ||
e384e585 | 982 | bytes = DIV_ROUND_UP(bitmap->chunks, 8); |
ece5cff0 N |
983 | if (!bitmap->mddev->bitmap_info.external) |
984 | bytes += sizeof(bitmap_super_t); | |
bc7f77de | 985 | |
e384e585 | 986 | num_pages = DIV_ROUND_UP(bytes, PAGE_SIZE); |
bc7f77de | 987 | |
ece5cff0 | 988 | if (file && i_size_read(file->f_mapping->host) < bytes) { |
32a7627c N |
989 | printk(KERN_INFO "%s: bitmap file too short %lu < %lu\n", |
990 | bmname(bitmap), | |
991 | (unsigned long) i_size_read(file->f_mapping->host), | |
ece5cff0 | 992 | bytes); |
4ad13663 | 993 | goto err; |
32a7627c | 994 | } |
bc7f77de N |
995 | |
996 | ret = -ENOMEM; | |
997 | ||
32a7627c | 998 | bitmap->filemap = kmalloc(sizeof(struct page *) * num_pages, GFP_KERNEL); |
bc7f77de | 999 | if (!bitmap->filemap) |
4ad13663 | 1000 | goto err; |
32a7627c | 1001 | |
e16b68b6 N |
1002 | /* We need 4 bits per page, rounded up to a multiple of sizeof(unsigned long) */ |
1003 | bitmap->filemap_attr = kzalloc( | |
ac2f40be | 1004 | roundup(DIV_ROUND_UP(num_pages*4, 8), sizeof(unsigned long)), |
e16b68b6 | 1005 | GFP_KERNEL); |
bc7f77de | 1006 | if (!bitmap->filemap_attr) |
4ad13663 | 1007 | goto err; |
32a7627c | 1008 | |
32a7627c N |
1009 | oldindex = ~0L; |
1010 | ||
1011 | for (i = 0; i < chunks; i++) { | |
bd926c63 | 1012 | int b; |
ece5cff0 N |
1013 | index = file_page_index(bitmap, i); |
1014 | bit = file_page_offset(bitmap, i); | |
32a7627c | 1015 | if (index != oldindex) { /* this is a new page, read it in */ |
d785a06a | 1016 | int count; |
32a7627c | 1017 | /* unmap the old page, we're done with it */ |
d785a06a | 1018 | if (index == num_pages-1) |
ece5cff0 | 1019 | count = bytes - index * PAGE_SIZE; |
d785a06a N |
1020 | else |
1021 | count = PAGE_SIZE; | |
ece5cff0 | 1022 | if (index == 0 && bitmap->sb_page) { |
32a7627c N |
1023 | /* |
1024 | * if we're here then the superblock page | |
1025 | * contains some bits (PAGE_SIZE != sizeof sb) | |
1026 | * we've already read it in, so just use it | |
1027 | */ | |
1028 | page = bitmap->sb_page; | |
1029 | offset = sizeof(bitmap_super_t); | |
53845270 | 1030 | if (!file) |
5c04f551 VK |
1031 | page = read_sb_page( |
1032 | bitmap->mddev, | |
1033 | bitmap->mddev->bitmap_info.offset, | |
1034 | page, | |
1035 | index, count); | |
a654b9d8 | 1036 | } else if (file) { |
d785a06a | 1037 | page = read_page(file, index, bitmap, count); |
a654b9d8 N |
1038 | offset = 0; |
1039 | } else { | |
42a04b50 N |
1040 | page = read_sb_page(bitmap->mddev, |
1041 | bitmap->mddev->bitmap_info.offset, | |
a2ed9615 N |
1042 | NULL, |
1043 | index, count); | |
32a7627c N |
1044 | offset = 0; |
1045 | } | |
a654b9d8 N |
1046 | if (IS_ERR(page)) { /* read error */ |
1047 | ret = PTR_ERR(page); | |
4ad13663 | 1048 | goto err; |
a654b9d8 N |
1049 | } |
1050 | ||
32a7627c N |
1051 | oldindex = index; |
1052 | oldpage = page; | |
32a7627c | 1053 | |
b74fd282 N |
1054 | bitmap->filemap[bitmap->file_pages++] = page; |
1055 | bitmap->last_page_size = count; | |
1056 | ||
32a7627c N |
1057 | if (outofdate) { |
1058 | /* | |
1059 | * if bitmap is out of date, dirty the | |
ac2f40be | 1060 | * whole page and write it out |
32a7627c | 1061 | */ |
b2f46e68 | 1062 | paddr = kmap_atomic(page); |
ea03aff9 | 1063 | memset(paddr + offset, 0xff, |
6a07997f | 1064 | PAGE_SIZE - offset); |
b2f46e68 | 1065 | kunmap_atomic(paddr); |
4ad13663 N |
1066 | write_page(bitmap, page, 1); |
1067 | ||
1068 | ret = -EIO; | |
b74fd282 | 1069 | if (bitmap->flags & BITMAP_WRITE_ERROR) |
4ad13663 | 1070 | goto err; |
32a7627c | 1071 | } |
32a7627c | 1072 | } |
b2f46e68 | 1073 | paddr = kmap_atomic(page); |
bd926c63 | 1074 | if (bitmap->flags & BITMAP_HOSTENDIAN) |
ea03aff9 | 1075 | b = test_bit(bit, paddr); |
bd926c63 | 1076 | else |
6b33aff3 | 1077 | b = test_bit_le(bit, paddr); |
b2f46e68 | 1078 | kunmap_atomic(paddr); |
bd926c63 | 1079 | if (b) { |
32a7627c | 1080 | /* if the disk bit is set, set the memory bit */ |
61a0d80c | 1081 | int needed = ((sector_t)(i+1) << bitmap->chunkshift |
db305e50 N |
1082 | >= start); |
1083 | bitmap_set_memory_bits(bitmap, | |
61a0d80c | 1084 | (sector_t)i << bitmap->chunkshift, |
db305e50 | 1085 | needed); |
32a7627c N |
1086 | bit_cnt++; |
1087 | } | |
32a7627c N |
1088 | } |
1089 | ||
32a7627c | 1090 | printk(KERN_INFO "%s: bitmap initialized from disk: " |
9c81075f JB |
1091 | "read %lu/%lu pages, set %lu of %lu bits\n", |
1092 | bmname(bitmap), bitmap->file_pages, num_pages, bit_cnt, chunks); | |
4ad13663 N |
1093 | |
1094 | return 0; | |
32a7627c | 1095 | |
4ad13663 N |
1096 | err: |
1097 | printk(KERN_INFO "%s: bitmap initialisation failed: %d\n", | |
1098 | bmname(bitmap), ret); | |
32a7627c N |
1099 | return ret; |
1100 | } | |
1101 | ||
a654b9d8 N |
1102 | void bitmap_write_all(struct bitmap *bitmap) |
1103 | { | |
1104 | /* We don't actually write all bitmap blocks here, | |
1105 | * just flag them as needing to be written | |
1106 | */ | |
ec7a3197 | 1107 | int i; |
a654b9d8 | 1108 | |
ef99bf48 N |
1109 | if (!bitmap || !bitmap->filemap) |
1110 | return; | |
1111 | if (bitmap->file) | |
1112 | /* Only one copy, so nothing needed */ | |
1113 | return; | |
1114 | ||
7c8f4247 | 1115 | spin_lock_irq(&bitmap->lock); |
ac2f40be | 1116 | for (i = 0; i < bitmap->file_pages; i++) |
ec7a3197 N |
1117 | set_page_attr(bitmap, bitmap->filemap[i], |
1118 | BITMAP_PAGE_NEEDWRITE); | |
2585f3ef | 1119 | bitmap->allclean = 0; |
7c8f4247 | 1120 | spin_unlock_irq(&bitmap->lock); |
a654b9d8 N |
1121 | } |
1122 | ||
32a7627c N |
1123 | static void bitmap_count_page(struct bitmap *bitmap, sector_t offset, int inc) |
1124 | { | |
61a0d80c | 1125 | sector_t chunk = offset >> bitmap->chunkshift; |
32a7627c N |
1126 | unsigned long page = chunk >> PAGE_COUNTER_SHIFT; |
1127 | bitmap->bp[page].count += inc; | |
32a7627c N |
1128 | bitmap_checkfree(bitmap, page); |
1129 | } | |
bf07bb7d N |
1130 | |
1131 | static void bitmap_set_pending(struct bitmap *bitmap, sector_t offset) | |
1132 | { | |
1133 | sector_t chunk = offset >> bitmap->chunkshift; | |
1134 | unsigned long page = chunk >> PAGE_COUNTER_SHIFT; | |
1135 | struct bitmap_page *bp = &bitmap->bp[page]; | |
1136 | ||
1137 | if (!bp->pending) | |
1138 | bp->pending = 1; | |
1139 | } | |
1140 | ||
32a7627c | 1141 | static bitmap_counter_t *bitmap_get_counter(struct bitmap *bitmap, |
57dab0bd | 1142 | sector_t offset, sector_t *blocks, |
32a7627c N |
1143 | int create); |
1144 | ||
1145 | /* | |
1146 | * bitmap daemon -- periodically wakes up to clean bits and flush pages | |
1147 | * out to disk | |
1148 | */ | |
1149 | ||
fd01b88c | 1150 | void bitmap_daemon_work(struct mddev *mddev) |
32a7627c | 1151 | { |
aa5cbd10 | 1152 | struct bitmap *bitmap; |
aa3163f8 | 1153 | unsigned long j; |
bf07bb7d | 1154 | unsigned long nextpage; |
32a7627c | 1155 | unsigned long flags; |
57dab0bd | 1156 | sector_t blocks; |
32a7627c | 1157 | |
aa5cbd10 N |
1158 | /* Use a mutex to guard daemon_work against |
1159 | * bitmap_destroy. | |
1160 | */ | |
c3d9714e | 1161 | mutex_lock(&mddev->bitmap_info.mutex); |
aa5cbd10 N |
1162 | bitmap = mddev->bitmap; |
1163 | if (bitmap == NULL) { | |
c3d9714e | 1164 | mutex_unlock(&mddev->bitmap_info.mutex); |
4ad13663 | 1165 | return; |
aa5cbd10 | 1166 | } |
42a04b50 | 1167 | if (time_before(jiffies, bitmap->daemon_lastrun |
2e61ebbc | 1168 | + mddev->bitmap_info.daemon_sleep)) |
7be3dfec N |
1169 | goto done; |
1170 | ||
32a7627c | 1171 | bitmap->daemon_lastrun = jiffies; |
8311c29d | 1172 | if (bitmap->allclean) { |
2e61ebbc | 1173 | mddev->thread->timeout = MAX_SCHEDULE_TIMEOUT; |
aa5cbd10 | 1174 | goto done; |
8311c29d N |
1175 | } |
1176 | bitmap->allclean = 1; | |
32a7627c | 1177 | |
bf07bb7d N |
1178 | /* Any file-page which is PENDING now needs to be written. |
1179 | * So set NEEDWRITE now, then after we make any last-minute changes | |
1180 | * we will write it. | |
1181 | */ | |
be512691 | 1182 | spin_lock_irqsave(&bitmap->lock, flags); |
bf07bb7d N |
1183 | for (j = 0; j < bitmap->file_pages; j++) |
1184 | if (test_page_attr(bitmap, bitmap->filemap[j], | |
1185 | BITMAP_PAGE_PENDING)) { | |
1186 | set_page_attr(bitmap, bitmap->filemap[j], | |
1187 | BITMAP_PAGE_NEEDWRITE); | |
1188 | clear_page_attr(bitmap, bitmap->filemap[j], | |
1189 | BITMAP_PAGE_PENDING); | |
1190 | } | |
1191 | ||
1192 | if (bitmap->need_sync && | |
1193 | mddev->bitmap_info.external == 0) { | |
1194 | /* Arrange for superblock update as well as | |
1195 | * other changes */ | |
1196 | bitmap_super_t *sb; | |
1197 | bitmap->need_sync = 0; | |
ef99bf48 N |
1198 | if (bitmap->filemap) { |
1199 | sb = kmap_atomic(bitmap->sb_page); | |
1200 | sb->events_cleared = | |
1201 | cpu_to_le64(bitmap->events_cleared); | |
1202 | kunmap_atomic(sb); | |
1203 | set_page_attr(bitmap, bitmap->sb_page, | |
1204 | BITMAP_PAGE_NEEDWRITE); | |
1205 | } | |
bf07bb7d N |
1206 | } |
1207 | /* Now look at the bitmap counters and if any are '2' or '1', | |
1208 | * decrement and handle accordingly. | |
1209 | */ | |
1210 | nextpage = 0; | |
32a7627c N |
1211 | for (j = 0; j < bitmap->chunks; j++) { |
1212 | bitmap_counter_t *bmc; | |
ef99bf48 | 1213 | sector_t block = (sector_t)j << bitmap->chunkshift; |
3520fa4d | 1214 | |
bf07bb7d N |
1215 | if (j == nextpage) { |
1216 | nextpage += PAGE_COUNTER_RATIO; | |
1217 | if (!bitmap->bp[j >> PAGE_COUNTER_SHIFT].pending) { | |
1218 | j |= PAGE_COUNTER_MASK; | |
aa3163f8 N |
1219 | continue; |
1220 | } | |
bf07bb7d | 1221 | bitmap->bp[j >> PAGE_COUNTER_SHIFT].pending = 0; |
32a7627c | 1222 | } |
db305e50 | 1223 | bmc = bitmap_get_counter(bitmap, |
ef99bf48 | 1224 | block, |
db305e50 | 1225 | &blocks, 0); |
bf07bb7d N |
1226 | |
1227 | if (!bmc) { | |
5a537df4 | 1228 | j |= PAGE_COUNTER_MASK; |
bf07bb7d N |
1229 | continue; |
1230 | } | |
1231 | if (*bmc == 1 && !bitmap->need_sync) { | |
1232 | /* We can clear the bit */ | |
bf07bb7d | 1233 | *bmc = 0; |
ef99bf48 N |
1234 | bitmap_count_page(bitmap, block, -1); |
1235 | bitmap_file_clear_bit(bitmap, block); | |
bf07bb7d N |
1236 | } else if (*bmc && *bmc <= 2) { |
1237 | *bmc = 1; | |
ef99bf48 | 1238 | bitmap_set_pending(bitmap, block); |
bf07bb7d | 1239 | bitmap->allclean = 0; |
5a537df4 | 1240 | } |
32a7627c N |
1241 | } |
1242 | ||
bf07bb7d N |
1243 | /* Now start writeout on any page in NEEDWRITE that isn't DIRTY. |
1244 | * DIRTY pages need to be written by bitmap_unplug so it can wait | |
1245 | * for them. | |
1246 | * If we find any DIRTY page we stop there and let bitmap_unplug | |
1247 | * handle all the rest. This is important in the case where | |
1248 | * the first blocking holds the superblock and it has been updated. | |
1249 | * We mustn't write any other blocks before the superblock. | |
1250 | */ | |
1251 | for (j = 0; j < bitmap->file_pages; j++) { | |
1252 | struct page *page = bitmap->filemap[j]; | |
1253 | ||
1254 | if (test_page_attr(bitmap, page, | |
1255 | BITMAP_PAGE_DIRTY)) | |
1256 | /* bitmap_unplug will handle the rest */ | |
1257 | break; | |
1258 | if (test_page_attr(bitmap, page, | |
1259 | BITMAP_PAGE_NEEDWRITE)) { | |
1260 | clear_page_attr(bitmap, page, | |
1261 | BITMAP_PAGE_NEEDWRITE); | |
32a7627c | 1262 | spin_unlock_irqrestore(&bitmap->lock, flags); |
bf07bb7d N |
1263 | write_page(bitmap, page, 0); |
1264 | spin_lock_irqsave(&bitmap->lock, flags); | |
1265 | if (!bitmap->filemap) | |
1266 | break; | |
32a7627c | 1267 | } |
32a7627c | 1268 | } |
bf07bb7d | 1269 | spin_unlock_irqrestore(&bitmap->lock, flags); |
32a7627c | 1270 | |
7be3dfec | 1271 | done: |
8311c29d | 1272 | if (bitmap->allclean == 0) |
2e61ebbc N |
1273 | mddev->thread->timeout = |
1274 | mddev->bitmap_info.daemon_sleep; | |
c3d9714e | 1275 | mutex_unlock(&mddev->bitmap_info.mutex); |
32a7627c N |
1276 | } |
1277 | ||
32a7627c | 1278 | static bitmap_counter_t *bitmap_get_counter(struct bitmap *bitmap, |
57dab0bd | 1279 | sector_t offset, sector_t *blocks, |
32a7627c | 1280 | int create) |
ee305ace N |
1281 | __releases(bitmap->lock) |
1282 | __acquires(bitmap->lock) | |
32a7627c N |
1283 | { |
1284 | /* If 'create', we might release the lock and reclaim it. | |
1285 | * The lock must have been taken with interrupts enabled. | |
1286 | * If !create, we don't release the lock. | |
1287 | */ | |
61a0d80c | 1288 | sector_t chunk = offset >> bitmap->chunkshift; |
32a7627c N |
1289 | unsigned long page = chunk >> PAGE_COUNTER_SHIFT; |
1290 | unsigned long pageoff = (chunk & PAGE_COUNTER_MASK) << COUNTER_BYTE_SHIFT; | |
1291 | sector_t csize; | |
ef425673 | 1292 | int err; |
32a7627c | 1293 | |
ef425673 N |
1294 | err = bitmap_checkpage(bitmap, page, create); |
1295 | ||
1296 | if (bitmap->bp[page].hijacked || | |
1297 | bitmap->bp[page].map == NULL) | |
61a0d80c | 1298 | csize = ((sector_t)1) << (bitmap->chunkshift + |
ef425673 N |
1299 | PAGE_COUNTER_SHIFT - 1); |
1300 | else | |
61a0d80c | 1301 | csize = ((sector_t)1) << bitmap->chunkshift; |
ef425673 N |
1302 | *blocks = csize - (offset & (csize - 1)); |
1303 | ||
1304 | if (err < 0) | |
32a7627c | 1305 | return NULL; |
ef425673 | 1306 | |
32a7627c N |
1307 | /* now locked ... */ |
1308 | ||
1309 | if (bitmap->bp[page].hijacked) { /* hijacked pointer */ | |
1310 | /* should we use the first or second counter field | |
1311 | * of the hijacked pointer? */ | |
1312 | int hi = (pageoff > PAGE_COUNTER_MASK); | |
32a7627c N |
1313 | return &((bitmap_counter_t *) |
1314 | &bitmap->bp[page].map)[hi]; | |
ef425673 | 1315 | } else /* page is allocated */ |
32a7627c N |
1316 | return (bitmap_counter_t *) |
1317 | &(bitmap->bp[page].map[pageoff]); | |
32a7627c N |
1318 | } |
1319 | ||
4b6d287f | 1320 | int bitmap_startwrite(struct bitmap *bitmap, sector_t offset, unsigned long sectors, int behind) |
32a7627c | 1321 | { |
ac2f40be N |
1322 | if (!bitmap) |
1323 | return 0; | |
4b6d287f N |
1324 | |
1325 | if (behind) { | |
696fcd53 | 1326 | int bw; |
4b6d287f | 1327 | atomic_inc(&bitmap->behind_writes); |
696fcd53 PC |
1328 | bw = atomic_read(&bitmap->behind_writes); |
1329 | if (bw > bitmap->behind_writes_used) | |
1330 | bitmap->behind_writes_used = bw; | |
1331 | ||
36a4e1fe N |
1332 | pr_debug("inc write-behind count %d/%lu\n", |
1333 | bw, bitmap->mddev->bitmap_info.max_write_behind); | |
4b6d287f N |
1334 | } |
1335 | ||
32a7627c | 1336 | while (sectors) { |
57dab0bd | 1337 | sector_t blocks; |
32a7627c N |
1338 | bitmap_counter_t *bmc; |
1339 | ||
1340 | spin_lock_irq(&bitmap->lock); | |
1341 | bmc = bitmap_get_counter(bitmap, offset, &blocks, 1); | |
1342 | if (!bmc) { | |
1343 | spin_unlock_irq(&bitmap->lock); | |
1344 | return 0; | |
1345 | } | |
1346 | ||
27d5ea04 | 1347 | if (unlikely(COUNTER(*bmc) == COUNTER_MAX)) { |
da6e1a32 NB |
1348 | DEFINE_WAIT(__wait); |
1349 | /* note that it is safe to do the prepare_to_wait | |
1350 | * after the test as long as we do it before dropping | |
1351 | * the spinlock. | |
1352 | */ | |
1353 | prepare_to_wait(&bitmap->overflow_wait, &__wait, | |
1354 | TASK_UNINTERRUPTIBLE); | |
1355 | spin_unlock_irq(&bitmap->lock); | |
7eaceacc | 1356 | io_schedule(); |
da6e1a32 NB |
1357 | finish_wait(&bitmap->overflow_wait, &__wait); |
1358 | continue; | |
1359 | } | |
1360 | ||
ac2f40be | 1361 | switch (*bmc) { |
32a7627c N |
1362 | case 0: |
1363 | bitmap_file_set_bit(bitmap, offset); | |
ac2f40be | 1364 | bitmap_count_page(bitmap, offset, 1); |
32a7627c N |
1365 | /* fall through */ |
1366 | case 1: | |
1367 | *bmc = 2; | |
1368 | } | |
da6e1a32 | 1369 | |
32a7627c N |
1370 | (*bmc)++; |
1371 | ||
1372 | spin_unlock_irq(&bitmap->lock); | |
1373 | ||
1374 | offset += blocks; | |
1375 | if (sectors > blocks) | |
1376 | sectors -= blocks; | |
ac2f40be N |
1377 | else |
1378 | sectors = 0; | |
32a7627c N |
1379 | } |
1380 | return 0; | |
1381 | } | |
ac2f40be | 1382 | EXPORT_SYMBOL(bitmap_startwrite); |
32a7627c N |
1383 | |
1384 | void bitmap_endwrite(struct bitmap *bitmap, sector_t offset, unsigned long sectors, | |
4b6d287f | 1385 | int success, int behind) |
32a7627c | 1386 | { |
ac2f40be N |
1387 | if (!bitmap) |
1388 | return; | |
4b6d287f | 1389 | if (behind) { |
e555190d N |
1390 | if (atomic_dec_and_test(&bitmap->behind_writes)) |
1391 | wake_up(&bitmap->behind_wait); | |
36a4e1fe N |
1392 | pr_debug("dec write-behind count %d/%lu\n", |
1393 | atomic_read(&bitmap->behind_writes), | |
1394 | bitmap->mddev->bitmap_info.max_write_behind); | |
4b6d287f N |
1395 | } |
1396 | ||
32a7627c | 1397 | while (sectors) { |
57dab0bd | 1398 | sector_t blocks; |
32a7627c N |
1399 | unsigned long flags; |
1400 | bitmap_counter_t *bmc; | |
1401 | ||
1402 | spin_lock_irqsave(&bitmap->lock, flags); | |
1403 | bmc = bitmap_get_counter(bitmap, offset, &blocks, 0); | |
1404 | if (!bmc) { | |
1405 | spin_unlock_irqrestore(&bitmap->lock, flags); | |
1406 | return; | |
1407 | } | |
1408 | ||
961902c0 | 1409 | if (success && !bitmap->mddev->degraded && |
a0da84f3 NB |
1410 | bitmap->events_cleared < bitmap->mddev->events) { |
1411 | bitmap->events_cleared = bitmap->mddev->events; | |
1412 | bitmap->need_sync = 1; | |
5ff5afff | 1413 | sysfs_notify_dirent_safe(bitmap->sysfs_can_clear); |
a0da84f3 NB |
1414 | } |
1415 | ||
27d5ea04 | 1416 | if (!success && !NEEDED(*bmc)) |
32a7627c N |
1417 | *bmc |= NEEDED_MASK; |
1418 | ||
27d5ea04 | 1419 | if (COUNTER(*bmc) == COUNTER_MAX) |
da6e1a32 NB |
1420 | wake_up(&bitmap->overflow_wait); |
1421 | ||
32a7627c | 1422 | (*bmc)--; |
2585f3ef | 1423 | if (*bmc <= 2) { |
bf07bb7d | 1424 | bitmap_set_pending(bitmap, offset); |
2585f3ef N |
1425 | bitmap->allclean = 0; |
1426 | } | |
32a7627c N |
1427 | spin_unlock_irqrestore(&bitmap->lock, flags); |
1428 | offset += blocks; | |
1429 | if (sectors > blocks) | |
1430 | sectors -= blocks; | |
ac2f40be N |
1431 | else |
1432 | sectors = 0; | |
32a7627c N |
1433 | } |
1434 | } | |
ac2f40be | 1435 | EXPORT_SYMBOL(bitmap_endwrite); |
32a7627c | 1436 | |
57dab0bd | 1437 | static int __bitmap_start_sync(struct bitmap *bitmap, sector_t offset, sector_t *blocks, |
1187cf0a | 1438 | int degraded) |
32a7627c N |
1439 | { |
1440 | bitmap_counter_t *bmc; | |
1441 | int rv; | |
1442 | if (bitmap == NULL) {/* FIXME or bitmap set as 'failed' */ | |
1443 | *blocks = 1024; | |
1444 | return 1; /* always resync if no bitmap */ | |
1445 | } | |
1446 | spin_lock_irq(&bitmap->lock); | |
1447 | bmc = bitmap_get_counter(bitmap, offset, blocks, 0); | |
1448 | rv = 0; | |
1449 | if (bmc) { | |
1450 | /* locked */ | |
1451 | if (RESYNC(*bmc)) | |
1452 | rv = 1; | |
1453 | else if (NEEDED(*bmc)) { | |
1454 | rv = 1; | |
6a806c51 N |
1455 | if (!degraded) { /* don't set/clear bits if degraded */ |
1456 | *bmc |= RESYNC_MASK; | |
1457 | *bmc &= ~NEEDED_MASK; | |
1458 | } | |
32a7627c N |
1459 | } |
1460 | } | |
1461 | spin_unlock_irq(&bitmap->lock); | |
1462 | return rv; | |
1463 | } | |
1464 | ||
57dab0bd | 1465 | int bitmap_start_sync(struct bitmap *bitmap, sector_t offset, sector_t *blocks, |
1187cf0a N |
1466 | int degraded) |
1467 | { | |
1468 | /* bitmap_start_sync must always report on multiples of whole | |
1469 | * pages, otherwise resync (which is very PAGE_SIZE based) will | |
1470 | * get confused. | |
1471 | * So call __bitmap_start_sync repeatedly (if needed) until | |
1472 | * At least PAGE_SIZE>>9 blocks are covered. | |
1473 | * Return the 'or' of the result. | |
1474 | */ | |
1475 | int rv = 0; | |
57dab0bd | 1476 | sector_t blocks1; |
1187cf0a N |
1477 | |
1478 | *blocks = 0; | |
1479 | while (*blocks < (PAGE_SIZE>>9)) { | |
1480 | rv |= __bitmap_start_sync(bitmap, offset, | |
1481 | &blocks1, degraded); | |
1482 | offset += blocks1; | |
1483 | *blocks += blocks1; | |
1484 | } | |
1485 | return rv; | |
1486 | } | |
ac2f40be | 1487 | EXPORT_SYMBOL(bitmap_start_sync); |
1187cf0a | 1488 | |
57dab0bd | 1489 | void bitmap_end_sync(struct bitmap *bitmap, sector_t offset, sector_t *blocks, int aborted) |
32a7627c N |
1490 | { |
1491 | bitmap_counter_t *bmc; | |
1492 | unsigned long flags; | |
ac2f40be N |
1493 | |
1494 | if (bitmap == NULL) { | |
32a7627c N |
1495 | *blocks = 1024; |
1496 | return; | |
1497 | } | |
1498 | spin_lock_irqsave(&bitmap->lock, flags); | |
1499 | bmc = bitmap_get_counter(bitmap, offset, blocks, 0); | |
1500 | if (bmc == NULL) | |
1501 | goto unlock; | |
1502 | /* locked */ | |
32a7627c N |
1503 | if (RESYNC(*bmc)) { |
1504 | *bmc &= ~RESYNC_MASK; | |
1505 | ||
1506 | if (!NEEDED(*bmc) && aborted) | |
1507 | *bmc |= NEEDED_MASK; | |
1508 | else { | |
2585f3ef | 1509 | if (*bmc <= 2) { |
bf07bb7d | 1510 | bitmap_set_pending(bitmap, offset); |
2585f3ef N |
1511 | bitmap->allclean = 0; |
1512 | } | |
32a7627c N |
1513 | } |
1514 | } | |
1515 | unlock: | |
1516 | spin_unlock_irqrestore(&bitmap->lock, flags); | |
1517 | } | |
ac2f40be | 1518 | EXPORT_SYMBOL(bitmap_end_sync); |
32a7627c N |
1519 | |
1520 | void bitmap_close_sync(struct bitmap *bitmap) | |
1521 | { | |
1522 | /* Sync has finished, and any bitmap chunks that weren't synced | |
1523 | * properly have been aborted. It remains to us to clear the | |
1524 | * RESYNC bit wherever it is still on | |
1525 | */ | |
1526 | sector_t sector = 0; | |
57dab0bd | 1527 | sector_t blocks; |
b47490c9 N |
1528 | if (!bitmap) |
1529 | return; | |
32a7627c N |
1530 | while (sector < bitmap->mddev->resync_max_sectors) { |
1531 | bitmap_end_sync(bitmap, sector, &blocks, 0); | |
b47490c9 N |
1532 | sector += blocks; |
1533 | } | |
1534 | } | |
ac2f40be | 1535 | EXPORT_SYMBOL(bitmap_close_sync); |
b47490c9 N |
1536 | |
1537 | void bitmap_cond_end_sync(struct bitmap *bitmap, sector_t sector) | |
1538 | { | |
1539 | sector_t s = 0; | |
57dab0bd | 1540 | sector_t blocks; |
b47490c9 N |
1541 | |
1542 | if (!bitmap) | |
1543 | return; | |
1544 | if (sector == 0) { | |
1545 | bitmap->last_end_sync = jiffies; | |
1546 | return; | |
1547 | } | |
1548 | if (time_before(jiffies, (bitmap->last_end_sync | |
1b04be96 | 1549 | + bitmap->mddev->bitmap_info.daemon_sleep))) |
b47490c9 N |
1550 | return; |
1551 | wait_event(bitmap->mddev->recovery_wait, | |
1552 | atomic_read(&bitmap->mddev->recovery_active) == 0); | |
1553 | ||
75d3da43 | 1554 | bitmap->mddev->curr_resync_completed = sector; |
070dc6dd | 1555 | set_bit(MD_CHANGE_CLEAN, &bitmap->mddev->flags); |
61a0d80c | 1556 | sector &= ~((1ULL << bitmap->chunkshift) - 1); |
b47490c9 N |
1557 | s = 0; |
1558 | while (s < sector && s < bitmap->mddev->resync_max_sectors) { | |
1559 | bitmap_end_sync(bitmap, s, &blocks, 0); | |
1560 | s += blocks; | |
32a7627c | 1561 | } |
b47490c9 | 1562 | bitmap->last_end_sync = jiffies; |
acb180b0 | 1563 | sysfs_notify(&bitmap->mddev->kobj, NULL, "sync_completed"); |
32a7627c | 1564 | } |
ac2f40be | 1565 | EXPORT_SYMBOL(bitmap_cond_end_sync); |
32a7627c | 1566 | |
6a07997f | 1567 | static void bitmap_set_memory_bits(struct bitmap *bitmap, sector_t offset, int needed) |
32a7627c N |
1568 | { |
1569 | /* For each chunk covered by any of these sectors, set the | |
ef99bf48 | 1570 | * counter to 2 and possibly set resync_needed. They should all |
32a7627c N |
1571 | * be 0 at this point |
1572 | */ | |
193f1c93 | 1573 | |
57dab0bd | 1574 | sector_t secs; |
193f1c93 N |
1575 | bitmap_counter_t *bmc; |
1576 | spin_lock_irq(&bitmap->lock); | |
1577 | bmc = bitmap_get_counter(bitmap, offset, &secs, 1); | |
1578 | if (!bmc) { | |
32a7627c | 1579 | spin_unlock_irq(&bitmap->lock); |
193f1c93 | 1580 | return; |
32a7627c | 1581 | } |
ac2f40be | 1582 | if (!*bmc) { |
915c420d | 1583 | *bmc = 2 | (needed ? NEEDED_MASK : 0); |
193f1c93 | 1584 | bitmap_count_page(bitmap, offset, 1); |
bf07bb7d | 1585 | bitmap_set_pending(bitmap, offset); |
2585f3ef | 1586 | bitmap->allclean = 0; |
193f1c93 N |
1587 | } |
1588 | spin_unlock_irq(&bitmap->lock); | |
32a7627c N |
1589 | } |
1590 | ||
9b1d1dac PC |
1591 | /* dirty the memory and file bits for bitmap chunks "s" to "e" */ |
1592 | void bitmap_dirty_bits(struct bitmap *bitmap, unsigned long s, unsigned long e) | |
1593 | { | |
1594 | unsigned long chunk; | |
1595 | ||
1596 | for (chunk = s; chunk <= e; chunk++) { | |
61a0d80c | 1597 | sector_t sec = (sector_t)chunk << bitmap->chunkshift; |
9b1d1dac | 1598 | bitmap_set_memory_bits(bitmap, sec, 1); |
7c8f4247 | 1599 | spin_lock_irq(&bitmap->lock); |
9b1d1dac | 1600 | bitmap_file_set_bit(bitmap, sec); |
7c8f4247 | 1601 | spin_unlock_irq(&bitmap->lock); |
ffa23322 N |
1602 | if (sec < bitmap->mddev->recovery_cp) |
1603 | /* We are asserting that the array is dirty, | |
1604 | * so move the recovery_cp address back so | |
1605 | * that it is obvious that it is dirty | |
1606 | */ | |
1607 | bitmap->mddev->recovery_cp = sec; | |
9b1d1dac PC |
1608 | } |
1609 | } | |
1610 | ||
6b8b3e8a N |
1611 | /* |
1612 | * flush out any pending updates | |
1613 | */ | |
fd01b88c | 1614 | void bitmap_flush(struct mddev *mddev) |
6b8b3e8a N |
1615 | { |
1616 | struct bitmap *bitmap = mddev->bitmap; | |
42a04b50 | 1617 | long sleep; |
6b8b3e8a N |
1618 | |
1619 | if (!bitmap) /* there was no bitmap */ | |
1620 | return; | |
1621 | ||
1622 | /* run the daemon_work three time to ensure everything is flushed | |
1623 | * that can be | |
1624 | */ | |
1b04be96 | 1625 | sleep = mddev->bitmap_info.daemon_sleep * 2; |
42a04b50 | 1626 | bitmap->daemon_lastrun -= sleep; |
aa5cbd10 | 1627 | bitmap_daemon_work(mddev); |
42a04b50 | 1628 | bitmap->daemon_lastrun -= sleep; |
aa5cbd10 | 1629 | bitmap_daemon_work(mddev); |
42a04b50 | 1630 | bitmap->daemon_lastrun -= sleep; |
aa5cbd10 | 1631 | bitmap_daemon_work(mddev); |
6b8b3e8a N |
1632 | bitmap_update_sb(bitmap); |
1633 | } | |
1634 | ||
32a7627c N |
1635 | /* |
1636 | * free memory that was allocated | |
1637 | */ | |
3178b0db | 1638 | static void bitmap_free(struct bitmap *bitmap) |
32a7627c N |
1639 | { |
1640 | unsigned long k, pages; | |
1641 | struct bitmap_page *bp; | |
32a7627c N |
1642 | |
1643 | if (!bitmap) /* there was no bitmap */ | |
1644 | return; | |
1645 | ||
32a7627c N |
1646 | /* release the bitmap file and kill the daemon */ |
1647 | bitmap_file_put(bitmap); | |
1648 | ||
1649 | bp = bitmap->bp; | |
1650 | pages = bitmap->pages; | |
1651 | ||
1652 | /* free all allocated memory */ | |
1653 | ||
32a7627c N |
1654 | if (bp) /* deallocate the page memory */ |
1655 | for (k = 0; k < pages; k++) | |
1656 | if (bp[k].map && !bp[k].hijacked) | |
1657 | kfree(bp[k].map); | |
1658 | kfree(bp); | |
1659 | kfree(bitmap); | |
1660 | } | |
aa5cbd10 | 1661 | |
fd01b88c | 1662 | void bitmap_destroy(struct mddev *mddev) |
3178b0db N |
1663 | { |
1664 | struct bitmap *bitmap = mddev->bitmap; | |
1665 | ||
1666 | if (!bitmap) /* there was no bitmap */ | |
1667 | return; | |
1668 | ||
c3d9714e | 1669 | mutex_lock(&mddev->bitmap_info.mutex); |
3178b0db | 1670 | mddev->bitmap = NULL; /* disconnect from the md device */ |
c3d9714e | 1671 | mutex_unlock(&mddev->bitmap_info.mutex); |
b15c2e57 N |
1672 | if (mddev->thread) |
1673 | mddev->thread->timeout = MAX_SCHEDULE_TIMEOUT; | |
3178b0db | 1674 | |
ece5cff0 N |
1675 | if (bitmap->sysfs_can_clear) |
1676 | sysfs_put(bitmap->sysfs_can_clear); | |
1677 | ||
3178b0db N |
1678 | bitmap_free(bitmap); |
1679 | } | |
32a7627c N |
1680 | |
1681 | /* | |
1682 | * initialize the bitmap structure | |
1683 | * if this returns an error, bitmap_destroy must be called to do clean up | |
1684 | */ | |
fd01b88c | 1685 | int bitmap_create(struct mddev *mddev) |
32a7627c N |
1686 | { |
1687 | struct bitmap *bitmap; | |
1f593903 | 1688 | sector_t blocks = mddev->resync_max_sectors; |
32a7627c N |
1689 | unsigned long chunks; |
1690 | unsigned long pages; | |
c3d9714e | 1691 | struct file *file = mddev->bitmap_info.file; |
32a7627c | 1692 | int err; |
5ff5afff | 1693 | struct sysfs_dirent *bm = NULL; |
32a7627c | 1694 | |
5f6e3c83 | 1695 | BUILD_BUG_ON(sizeof(bitmap_super_t) != 256); |
32a7627c | 1696 | |
c3d9714e | 1697 | BUG_ON(file && mddev->bitmap_info.offset); |
a654b9d8 | 1698 | |
9ffae0cf | 1699 | bitmap = kzalloc(sizeof(*bitmap), GFP_KERNEL); |
32a7627c N |
1700 | if (!bitmap) |
1701 | return -ENOMEM; | |
1702 | ||
32a7627c | 1703 | spin_lock_init(&bitmap->lock); |
ce25c31b N |
1704 | atomic_set(&bitmap->pending_writes, 0); |
1705 | init_waitqueue_head(&bitmap->write_wait); | |
da6e1a32 | 1706 | init_waitqueue_head(&bitmap->overflow_wait); |
e555190d | 1707 | init_waitqueue_head(&bitmap->behind_wait); |
ce25c31b | 1708 | |
32a7627c | 1709 | bitmap->mddev = mddev; |
32a7627c | 1710 | |
5ff5afff N |
1711 | if (mddev->kobj.sd) |
1712 | bm = sysfs_get_dirent(mddev->kobj.sd, NULL, "bitmap"); | |
ece5cff0 | 1713 | if (bm) { |
3ff195b0 | 1714 | bitmap->sysfs_can_clear = sysfs_get_dirent(bm, NULL, "can_clear"); |
ece5cff0 N |
1715 | sysfs_put(bm); |
1716 | } else | |
1717 | bitmap->sysfs_can_clear = NULL; | |
1718 | ||
32a7627c | 1719 | bitmap->file = file; |
ce25c31b N |
1720 | if (file) { |
1721 | get_file(file); | |
ae8fa283 N |
1722 | /* As future accesses to this file will use bmap, |
1723 | * and bypass the page cache, we must sync the file | |
1724 | * first. | |
1725 | */ | |
8018ab05 | 1726 | vfs_fsync(file, 1); |
ce25c31b | 1727 | } |
42a04b50 | 1728 | /* read superblock from bitmap file (this sets mddev->bitmap_info.chunksize) */ |
9c81075f JB |
1729 | if (!mddev->bitmap_info.external) { |
1730 | /* | |
1731 | * If 'MD_ARRAY_FIRST_USE' is set, then device-mapper is | |
1732 | * instructing us to create a new on-disk bitmap instance. | |
1733 | */ | |
1734 | if (test_and_clear_bit(MD_ARRAY_FIRST_USE, &mddev->flags)) | |
1735 | err = bitmap_new_disk_sb(bitmap); | |
1736 | else | |
1737 | err = bitmap_read_sb(bitmap); | |
1738 | } else { | |
ece5cff0 N |
1739 | err = 0; |
1740 | if (mddev->bitmap_info.chunksize == 0 || | |
1741 | mddev->bitmap_info.daemon_sleep == 0) | |
1742 | /* chunksize and time_base need to be | |
1743 | * set first. */ | |
1744 | err = -EINVAL; | |
1745 | } | |
32a7627c | 1746 | if (err) |
3178b0db | 1747 | goto error; |
32a7627c | 1748 | |
624ce4f5 | 1749 | bitmap->daemon_lastrun = jiffies; |
61a0d80c N |
1750 | bitmap->chunkshift = (ffz(~mddev->bitmap_info.chunksize) |
1751 | - BITMAP_BLOCK_SHIFT); | |
32a7627c | 1752 | |
b16b1b6c | 1753 | chunks = (blocks + (1 << bitmap->chunkshift) - 1) >> |
61a0d80c | 1754 | bitmap->chunkshift; |
ac2f40be | 1755 | pages = (chunks + PAGE_COUNTER_RATIO - 1) / PAGE_COUNTER_RATIO; |
32a7627c N |
1756 | |
1757 | BUG_ON(!pages); | |
1758 | ||
1759 | bitmap->chunks = chunks; | |
1760 | bitmap->pages = pages; | |
1761 | bitmap->missing_pages = pages; | |
32a7627c | 1762 | |
9ffae0cf | 1763 | bitmap->bp = kzalloc(pages * sizeof(*bitmap->bp), GFP_KERNEL); |
29d3247e | 1764 | |
3178b0db | 1765 | err = -ENOMEM; |
32a7627c | 1766 | if (!bitmap->bp) |
3178b0db | 1767 | goto error; |
32a7627c | 1768 | |
69e51b44 N |
1769 | printk(KERN_INFO "created bitmap (%lu pages) for device %s\n", |
1770 | pages, bmname(bitmap)); | |
1771 | ||
1772 | mddev->bitmap = bitmap; | |
1773 | ||
1774 | ||
1775 | return (bitmap->flags & BITMAP_WRITE_ERROR) ? -EIO : 0; | |
1776 | ||
1777 | error: | |
1778 | bitmap_free(bitmap); | |
1779 | return err; | |
1780 | } | |
1781 | ||
fd01b88c | 1782 | int bitmap_load(struct mddev *mddev) |
69e51b44 N |
1783 | { |
1784 | int err = 0; | |
3520fa4d | 1785 | sector_t start = 0; |
69e51b44 N |
1786 | sector_t sector = 0; |
1787 | struct bitmap *bitmap = mddev->bitmap; | |
1788 | ||
1789 | if (!bitmap) | |
1790 | goto out; | |
1791 | ||
1792 | /* Clear out old bitmap info first: Either there is none, or we | |
1793 | * are resuming after someone else has possibly changed things, | |
1794 | * so we should forget old cached info. | |
1795 | * All chunks should be clean, but some might need_sync. | |
1796 | */ | |
1797 | while (sector < mddev->resync_max_sectors) { | |
57dab0bd | 1798 | sector_t blocks; |
69e51b44 N |
1799 | bitmap_start_sync(bitmap, sector, &blocks, 0); |
1800 | sector += blocks; | |
1801 | } | |
1802 | bitmap_close_sync(bitmap); | |
1803 | ||
3520fa4d JB |
1804 | if (mddev->degraded == 0 |
1805 | || bitmap->events_cleared == mddev->events) | |
1806 | /* no need to keep dirty bits to optimise a | |
1807 | * re-add of a missing device */ | |
1808 | start = mddev->recovery_cp; | |
1809 | ||
afbaa90b | 1810 | mutex_lock(&mddev->bitmap_info.mutex); |
3520fa4d | 1811 | err = bitmap_init_from_disk(bitmap, start); |
afbaa90b | 1812 | mutex_unlock(&mddev->bitmap_info.mutex); |
3520fa4d | 1813 | |
32a7627c | 1814 | if (err) |
69e51b44 | 1815 | goto out; |
ef99bf48 N |
1816 | bitmap_mask_state(bitmap, BITMAP_STALE, MASK_UNSET); |
1817 | ||
1818 | /* Kick recovery in case any bits were set */ | |
1819 | set_bit(MD_RECOVERY_NEEDED, &bitmap->mddev->recovery); | |
3178b0db | 1820 | |
1b04be96 | 1821 | mddev->thread->timeout = mddev->bitmap_info.daemon_sleep; |
9cd30fdc | 1822 | md_wakeup_thread(mddev->thread); |
b15c2e57 | 1823 | |
4ad13663 N |
1824 | bitmap_update_sb(bitmap); |
1825 | ||
69e51b44 N |
1826 | if (bitmap->flags & BITMAP_WRITE_ERROR) |
1827 | err = -EIO; | |
1828 | out: | |
3178b0db | 1829 | return err; |
32a7627c | 1830 | } |
69e51b44 | 1831 | EXPORT_SYMBOL_GPL(bitmap_load); |
32a7627c | 1832 | |
57148964 N |
1833 | void bitmap_status(struct seq_file *seq, struct bitmap *bitmap) |
1834 | { | |
1835 | unsigned long chunk_kb; | |
1836 | unsigned long flags; | |
1837 | ||
1838 | if (!bitmap) | |
1839 | return; | |
1840 | ||
1841 | spin_lock_irqsave(&bitmap->lock, flags); | |
1842 | chunk_kb = bitmap->mddev->bitmap_info.chunksize >> 10; | |
1843 | seq_printf(seq, "bitmap: %lu/%lu pages [%luKB], " | |
1844 | "%lu%s chunk", | |
1845 | bitmap->pages - bitmap->missing_pages, | |
1846 | bitmap->pages, | |
1847 | (bitmap->pages - bitmap->missing_pages) | |
1848 | << (PAGE_SHIFT - 10), | |
1849 | chunk_kb ? chunk_kb : bitmap->mddev->bitmap_info.chunksize, | |
1850 | chunk_kb ? "KB" : "B"); | |
1851 | if (bitmap->file) { | |
1852 | seq_printf(seq, ", file: "); | |
1853 | seq_path(seq, &bitmap->file->f_path, " \t\n"); | |
1854 | } | |
1855 | ||
1856 | seq_printf(seq, "\n"); | |
1857 | spin_unlock_irqrestore(&bitmap->lock, flags); | |
1858 | } | |
1859 | ||
43a70507 | 1860 | static ssize_t |
fd01b88c | 1861 | location_show(struct mddev *mddev, char *page) |
43a70507 N |
1862 | { |
1863 | ssize_t len; | |
ac2f40be | 1864 | if (mddev->bitmap_info.file) |
43a70507 | 1865 | len = sprintf(page, "file"); |
ac2f40be | 1866 | else if (mddev->bitmap_info.offset) |
43a70507 | 1867 | len = sprintf(page, "%+lld", (long long)mddev->bitmap_info.offset); |
ac2f40be | 1868 | else |
43a70507 N |
1869 | len = sprintf(page, "none"); |
1870 | len += sprintf(page+len, "\n"); | |
1871 | return len; | |
1872 | } | |
1873 | ||
1874 | static ssize_t | |
fd01b88c | 1875 | location_store(struct mddev *mddev, const char *buf, size_t len) |
43a70507 N |
1876 | { |
1877 | ||
1878 | if (mddev->pers) { | |
1879 | if (!mddev->pers->quiesce) | |
1880 | return -EBUSY; | |
1881 | if (mddev->recovery || mddev->sync_thread) | |
1882 | return -EBUSY; | |
1883 | } | |
1884 | ||
1885 | if (mddev->bitmap || mddev->bitmap_info.file || | |
1886 | mddev->bitmap_info.offset) { | |
1887 | /* bitmap already configured. Only option is to clear it */ | |
1888 | if (strncmp(buf, "none", 4) != 0) | |
1889 | return -EBUSY; | |
1890 | if (mddev->pers) { | |
1891 | mddev->pers->quiesce(mddev, 1); | |
1892 | bitmap_destroy(mddev); | |
1893 | mddev->pers->quiesce(mddev, 0); | |
1894 | } | |
1895 | mddev->bitmap_info.offset = 0; | |
1896 | if (mddev->bitmap_info.file) { | |
1897 | struct file *f = mddev->bitmap_info.file; | |
1898 | mddev->bitmap_info.file = NULL; | |
1899 | restore_bitmap_write_access(f); | |
1900 | fput(f); | |
1901 | } | |
1902 | } else { | |
1903 | /* No bitmap, OK to set a location */ | |
1904 | long long offset; | |
1905 | if (strncmp(buf, "none", 4) == 0) | |
1906 | /* nothing to be done */; | |
1907 | else if (strncmp(buf, "file:", 5) == 0) { | |
1908 | /* Not supported yet */ | |
1909 | return -EINVAL; | |
1910 | } else { | |
1911 | int rv; | |
1912 | if (buf[0] == '+') | |
1913 | rv = strict_strtoll(buf+1, 10, &offset); | |
1914 | else | |
1915 | rv = strict_strtoll(buf, 10, &offset); | |
1916 | if (rv) | |
1917 | return rv; | |
1918 | if (offset == 0) | |
1919 | return -EINVAL; | |
ece5cff0 N |
1920 | if (mddev->bitmap_info.external == 0 && |
1921 | mddev->major_version == 0 && | |
43a70507 N |
1922 | offset != mddev->bitmap_info.default_offset) |
1923 | return -EINVAL; | |
1924 | mddev->bitmap_info.offset = offset; | |
1925 | if (mddev->pers) { | |
1926 | mddev->pers->quiesce(mddev, 1); | |
1927 | rv = bitmap_create(mddev); | |
4474ca42 N |
1928 | if (!rv) |
1929 | rv = bitmap_load(mddev); | |
43a70507 N |
1930 | if (rv) { |
1931 | bitmap_destroy(mddev); | |
1932 | mddev->bitmap_info.offset = 0; | |
1933 | } | |
1934 | mddev->pers->quiesce(mddev, 0); | |
1935 | if (rv) | |
1936 | return rv; | |
1937 | } | |
1938 | } | |
1939 | } | |
1940 | if (!mddev->external) { | |
1941 | /* Ensure new bitmap info is stored in | |
1942 | * metadata promptly. | |
1943 | */ | |
1944 | set_bit(MD_CHANGE_DEVS, &mddev->flags); | |
1945 | md_wakeup_thread(mddev->thread); | |
1946 | } | |
1947 | return len; | |
1948 | } | |
1949 | ||
1950 | static struct md_sysfs_entry bitmap_location = | |
1951 | __ATTR(location, S_IRUGO|S_IWUSR, location_show, location_store); | |
1952 | ||
6409bb05 N |
1953 | /* 'bitmap/space' is the space available at 'location' for the |
1954 | * bitmap. This allows the kernel to know when it is safe to | |
1955 | * resize the bitmap to match a resized array. | |
1956 | */ | |
1957 | static ssize_t | |
1958 | space_show(struct mddev *mddev, char *page) | |
1959 | { | |
1960 | return sprintf(page, "%lu\n", mddev->bitmap_info.space); | |
1961 | } | |
1962 | ||
1963 | static ssize_t | |
1964 | space_store(struct mddev *mddev, const char *buf, size_t len) | |
1965 | { | |
1966 | unsigned long sectors; | |
1967 | int rv; | |
1968 | ||
1969 | rv = kstrtoul(buf, 10, §ors); | |
1970 | if (rv) | |
1971 | return rv; | |
1972 | ||
1973 | if (sectors == 0) | |
1974 | return -EINVAL; | |
1975 | ||
1976 | if (mddev->bitmap && | |
1977 | sectors < ((mddev->bitmap->file_pages - 1) * PAGE_SIZE | |
1978 | + mddev->bitmap->last_page_size + 511) >> 9) | |
1979 | return -EFBIG; /* Bitmap is too big for this small space */ | |
1980 | ||
1981 | /* could make sure it isn't too big, but that isn't really | |
1982 | * needed - user-space should be careful. | |
1983 | */ | |
1984 | mddev->bitmap_info.space = sectors; | |
1985 | return len; | |
1986 | } | |
1987 | ||
1988 | static struct md_sysfs_entry bitmap_space = | |
1989 | __ATTR(space, S_IRUGO|S_IWUSR, space_show, space_store); | |
1990 | ||
43a70507 | 1991 | static ssize_t |
fd01b88c | 1992 | timeout_show(struct mddev *mddev, char *page) |
43a70507 N |
1993 | { |
1994 | ssize_t len; | |
1995 | unsigned long secs = mddev->bitmap_info.daemon_sleep / HZ; | |
1996 | unsigned long jifs = mddev->bitmap_info.daemon_sleep % HZ; | |
ac2f40be | 1997 | |
43a70507 N |
1998 | len = sprintf(page, "%lu", secs); |
1999 | if (jifs) | |
2000 | len += sprintf(page+len, ".%03u", jiffies_to_msecs(jifs)); | |
2001 | len += sprintf(page+len, "\n"); | |
2002 | return len; | |
2003 | } | |
2004 | ||
2005 | static ssize_t | |
fd01b88c | 2006 | timeout_store(struct mddev *mddev, const char *buf, size_t len) |
43a70507 N |
2007 | { |
2008 | /* timeout can be set at any time */ | |
2009 | unsigned long timeout; | |
2010 | int rv = strict_strtoul_scaled(buf, &timeout, 4); | |
2011 | if (rv) | |
2012 | return rv; | |
2013 | ||
2014 | /* just to make sure we don't overflow... */ | |
2015 | if (timeout >= LONG_MAX / HZ) | |
2016 | return -EINVAL; | |
2017 | ||
2018 | timeout = timeout * HZ / 10000; | |
2019 | ||
2020 | if (timeout >= MAX_SCHEDULE_TIMEOUT) | |
2021 | timeout = MAX_SCHEDULE_TIMEOUT-1; | |
2022 | if (timeout < 1) | |
2023 | timeout = 1; | |
2024 | mddev->bitmap_info.daemon_sleep = timeout; | |
2025 | if (mddev->thread) { | |
2026 | /* if thread->timeout is MAX_SCHEDULE_TIMEOUT, then | |
2027 | * the bitmap is all clean and we don't need to | |
2028 | * adjust the timeout right now | |
2029 | */ | |
2030 | if (mddev->thread->timeout < MAX_SCHEDULE_TIMEOUT) { | |
2031 | mddev->thread->timeout = timeout; | |
2032 | md_wakeup_thread(mddev->thread); | |
2033 | } | |
2034 | } | |
2035 | return len; | |
2036 | } | |
2037 | ||
2038 | static struct md_sysfs_entry bitmap_timeout = | |
2039 | __ATTR(time_base, S_IRUGO|S_IWUSR, timeout_show, timeout_store); | |
2040 | ||
2041 | static ssize_t | |
fd01b88c | 2042 | backlog_show(struct mddev *mddev, char *page) |
43a70507 N |
2043 | { |
2044 | return sprintf(page, "%lu\n", mddev->bitmap_info.max_write_behind); | |
2045 | } | |
2046 | ||
2047 | static ssize_t | |
fd01b88c | 2048 | backlog_store(struct mddev *mddev, const char *buf, size_t len) |
43a70507 N |
2049 | { |
2050 | unsigned long backlog; | |
2051 | int rv = strict_strtoul(buf, 10, &backlog); | |
2052 | if (rv) | |
2053 | return rv; | |
2054 | if (backlog > COUNTER_MAX) | |
2055 | return -EINVAL; | |
2056 | mddev->bitmap_info.max_write_behind = backlog; | |
2057 | return len; | |
2058 | } | |
2059 | ||
2060 | static struct md_sysfs_entry bitmap_backlog = | |
2061 | __ATTR(backlog, S_IRUGO|S_IWUSR, backlog_show, backlog_store); | |
2062 | ||
2063 | static ssize_t | |
fd01b88c | 2064 | chunksize_show(struct mddev *mddev, char *page) |
43a70507 N |
2065 | { |
2066 | return sprintf(page, "%lu\n", mddev->bitmap_info.chunksize); | |
2067 | } | |
2068 | ||
2069 | static ssize_t | |
fd01b88c | 2070 | chunksize_store(struct mddev *mddev, const char *buf, size_t len) |
43a70507 N |
2071 | { |
2072 | /* Can only be changed when no bitmap is active */ | |
2073 | int rv; | |
2074 | unsigned long csize; | |
2075 | if (mddev->bitmap) | |
2076 | return -EBUSY; | |
2077 | rv = strict_strtoul(buf, 10, &csize); | |
2078 | if (rv) | |
2079 | return rv; | |
2080 | if (csize < 512 || | |
2081 | !is_power_of_2(csize)) | |
2082 | return -EINVAL; | |
2083 | mddev->bitmap_info.chunksize = csize; | |
2084 | return len; | |
2085 | } | |
2086 | ||
2087 | static struct md_sysfs_entry bitmap_chunksize = | |
2088 | __ATTR(chunksize, S_IRUGO|S_IWUSR, chunksize_show, chunksize_store); | |
2089 | ||
fd01b88c | 2090 | static ssize_t metadata_show(struct mddev *mddev, char *page) |
ece5cff0 N |
2091 | { |
2092 | return sprintf(page, "%s\n", (mddev->bitmap_info.external | |
2093 | ? "external" : "internal")); | |
2094 | } | |
2095 | ||
fd01b88c | 2096 | static ssize_t metadata_store(struct mddev *mddev, const char *buf, size_t len) |
ece5cff0 N |
2097 | { |
2098 | if (mddev->bitmap || | |
2099 | mddev->bitmap_info.file || | |
2100 | mddev->bitmap_info.offset) | |
2101 | return -EBUSY; | |
2102 | if (strncmp(buf, "external", 8) == 0) | |
2103 | mddev->bitmap_info.external = 1; | |
2104 | else if (strncmp(buf, "internal", 8) == 0) | |
2105 | mddev->bitmap_info.external = 0; | |
2106 | else | |
2107 | return -EINVAL; | |
2108 | return len; | |
2109 | } | |
2110 | ||
2111 | static struct md_sysfs_entry bitmap_metadata = | |
2112 | __ATTR(metadata, S_IRUGO|S_IWUSR, metadata_show, metadata_store); | |
2113 | ||
fd01b88c | 2114 | static ssize_t can_clear_show(struct mddev *mddev, char *page) |
ece5cff0 N |
2115 | { |
2116 | int len; | |
2117 | if (mddev->bitmap) | |
2118 | len = sprintf(page, "%s\n", (mddev->bitmap->need_sync ? | |
2119 | "false" : "true")); | |
2120 | else | |
2121 | len = sprintf(page, "\n"); | |
2122 | return len; | |
2123 | } | |
2124 | ||
fd01b88c | 2125 | static ssize_t can_clear_store(struct mddev *mddev, const char *buf, size_t len) |
ece5cff0 N |
2126 | { |
2127 | if (mddev->bitmap == NULL) | |
2128 | return -ENOENT; | |
2129 | if (strncmp(buf, "false", 5) == 0) | |
2130 | mddev->bitmap->need_sync = 1; | |
2131 | else if (strncmp(buf, "true", 4) == 0) { | |
2132 | if (mddev->degraded) | |
2133 | return -EBUSY; | |
2134 | mddev->bitmap->need_sync = 0; | |
2135 | } else | |
2136 | return -EINVAL; | |
2137 | return len; | |
2138 | } | |
2139 | ||
2140 | static struct md_sysfs_entry bitmap_can_clear = | |
2141 | __ATTR(can_clear, S_IRUGO|S_IWUSR, can_clear_show, can_clear_store); | |
2142 | ||
696fcd53 | 2143 | static ssize_t |
fd01b88c | 2144 | behind_writes_used_show(struct mddev *mddev, char *page) |
696fcd53 PC |
2145 | { |
2146 | if (mddev->bitmap == NULL) | |
2147 | return sprintf(page, "0\n"); | |
2148 | return sprintf(page, "%lu\n", | |
2149 | mddev->bitmap->behind_writes_used); | |
2150 | } | |
2151 | ||
2152 | static ssize_t | |
fd01b88c | 2153 | behind_writes_used_reset(struct mddev *mddev, const char *buf, size_t len) |
696fcd53 PC |
2154 | { |
2155 | if (mddev->bitmap) | |
2156 | mddev->bitmap->behind_writes_used = 0; | |
2157 | return len; | |
2158 | } | |
2159 | ||
2160 | static struct md_sysfs_entry max_backlog_used = | |
2161 | __ATTR(max_backlog_used, S_IRUGO | S_IWUSR, | |
2162 | behind_writes_used_show, behind_writes_used_reset); | |
2163 | ||
43a70507 N |
2164 | static struct attribute *md_bitmap_attrs[] = { |
2165 | &bitmap_location.attr, | |
6409bb05 | 2166 | &bitmap_space.attr, |
43a70507 N |
2167 | &bitmap_timeout.attr, |
2168 | &bitmap_backlog.attr, | |
2169 | &bitmap_chunksize.attr, | |
ece5cff0 N |
2170 | &bitmap_metadata.attr, |
2171 | &bitmap_can_clear.attr, | |
696fcd53 | 2172 | &max_backlog_used.attr, |
43a70507 N |
2173 | NULL |
2174 | }; | |
2175 | struct attribute_group md_bitmap_group = { | |
2176 | .name = "bitmap", | |
2177 | .attrs = md_bitmap_attrs, | |
2178 | }; | |
2179 |