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