md/bitmap: convert some spin_lock_irqsave to spin_lock_irq
[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
32a7627c
N
735static void bitmap_file_unmap(struct bitmap *bitmap)
736{
737 struct page **map, *sb_page;
738 unsigned long *attr;
739 int pages;
1ec885cd 740 struct bitmap_storage *store = &bitmap->storage;
32a7627c 741
74667123 742 spin_lock_irq(&bitmap->lock);
1ec885cd
N
743 map = store->filemap;
744 store->filemap = NULL;
745 attr = store->filemap_attr;
746 store->filemap_attr = NULL;
747 pages = store->file_pages;
748 store->file_pages = 0;
749 sb_page = store->sb_page;
750 store->sb_page = NULL;
74667123 751 spin_unlock_irq(&bitmap->lock);
32a7627c
N
752
753 while (pages--)
ece5cff0 754 if (map[pages] != sb_page) /* 0 is sb_page, release it below */
d785a06a 755 free_buffers(map[pages]);
32a7627c
N
756 kfree(map);
757 kfree(attr);
758
d785a06a
N
759 if (sb_page)
760 free_buffers(sb_page);
32a7627c
N
761}
762
763static void bitmap_file_put(struct bitmap *bitmap)
764{
765 struct file *file;
32a7627c 766
74667123 767 spin_lock_irq(&bitmap->lock);
1ec885cd
N
768 file = bitmap->storage.file;
769 bitmap->storage.file = NULL;
74667123 770 spin_unlock_irq(&bitmap->lock);
32a7627c 771
d785a06a
N
772 if (file)
773 wait_event(bitmap->write_wait,
774 atomic_read(&bitmap->pending_writes)==0);
32a7627c
N
775 bitmap_file_unmap(bitmap);
776
d785a06a 777 if (file) {
c649bb9c 778 struct inode *inode = file->f_path.dentry->d_inode;
fc0ecff6 779 invalidate_mapping_pages(inode->i_mapping, 0, -1);
32a7627c 780 fput(file);
d785a06a 781 }
32a7627c
N
782}
783
32a7627c
N
784/*
785 * bitmap_file_kick - if an error occurs while manipulating the bitmap file
786 * then it is no longer reliable, so we stop using it and we mark the file
787 * as failed in the superblock
788 */
789static void bitmap_file_kick(struct bitmap *bitmap)
790{
791 char *path, *ptr = NULL;
792
b405fe91 793 if (!test_and_set_bit(BITMAP_STALE, &bitmap->flags)) {
4ad13663 794 bitmap_update_sb(bitmap);
32a7627c 795
1ec885cd 796 if (bitmap->storage.file) {
4ad13663
N
797 path = kmalloc(PAGE_SIZE, GFP_KERNEL);
798 if (path)
1ec885cd
N
799 ptr = d_path(&bitmap->storage.file->f_path,
800 path, PAGE_SIZE);
6bcfd601 801
4ad13663
N
802 printk(KERN_ALERT
803 "%s: kicking failed bitmap file %s from array!\n",
6bcfd601 804 bmname(bitmap), IS_ERR(ptr) ? "" : ptr);
32a7627c 805
4ad13663
N
806 kfree(path);
807 } else
808 printk(KERN_ALERT
809 "%s: disabling internal bitmap due to errors\n",
810 bmname(bitmap));
a654b9d8 811 }
32a7627c
N
812
813 bitmap_file_put(bitmap);
814
815 return;
816}
817
818enum bitmap_page_attr {
ac2f40be 819 BITMAP_PAGE_DIRTY = 0, /* there are set bits that need to be synced */
5a537df4
N
820 BITMAP_PAGE_PENDING = 1, /* there are bits that are being cleaned.
821 * i.e. counter is 1 or 2. */
ac2f40be 822 BITMAP_PAGE_NEEDWRITE = 2, /* there are cleared bits that need to be synced */
32a7627c
N
823};
824
d189122d
N
825static inline void set_page_attr(struct bitmap *bitmap, int pnum,
826 enum bitmap_page_attr attr)
32a7627c 827{
1ec885cd 828 __set_bit((pnum<<2) + attr, bitmap->storage.filemap_attr);
32a7627c
N
829}
830
d189122d
N
831static inline void clear_page_attr(struct bitmap *bitmap, int pnum,
832 enum bitmap_page_attr attr)
32a7627c 833{
1ec885cd 834 __clear_bit((pnum<<2) + attr, bitmap->storage.filemap_attr);
32a7627c
N
835}
836
d189122d 837static inline unsigned long test_page_attr(struct bitmap *bitmap, int pnum,
ec7a3197 838 enum bitmap_page_attr attr)
32a7627c 839{
1ec885cd 840 return test_bit((pnum<<2) + attr, bitmap->storage.filemap_attr);
32a7627c
N
841}
842
843/*
844 * bitmap_file_set_bit -- called before performing a write to the md device
845 * to set (and eventually sync) a particular bit in the bitmap file
846 *
847 * we set the bit immediately, then we record the page number so that
848 * when an unplug occurs, we can flush the dirty pages out to disk
849 */
850static void bitmap_file_set_bit(struct bitmap *bitmap, sector_t block)
851{
852 unsigned long bit;
3520fa4d 853 struct page *page;
32a7627c 854 void *kaddr;
61a0d80c 855 unsigned long chunk = block >> bitmap->chunkshift;
32a7627c 856
1ec885cd 857 page = filemap_get_page(&bitmap->storage, chunk);
3520fa4d
JB
858 if (!page)
859 return;
1ec885cd 860 bit = file_page_offset(&bitmap->storage, chunk);
32a7627c 861
3520fa4d 862 /* set the bit */
b2f46e68 863 kaddr = kmap_atomic(page);
b405fe91 864 if (test_bit(BITMAP_HOSTENDIAN, &bitmap->flags))
3520fa4d
JB
865 set_bit(bit, kaddr);
866 else
867 __set_bit_le(bit, kaddr);
b2f46e68 868 kunmap_atomic(kaddr);
36a4e1fe 869 pr_debug("set file bit %lu page %lu\n", bit, page->index);
32a7627c 870 /* record page number so it gets flushed to disk when unplug occurs */
d189122d 871 set_page_attr(bitmap, page->index, BITMAP_PAGE_DIRTY);
32a7627c
N
872}
873
ef99bf48
N
874static void bitmap_file_clear_bit(struct bitmap *bitmap, sector_t block)
875{
876 unsigned long bit;
877 struct page *page;
878 void *paddr;
879 unsigned long chunk = block >> bitmap->chunkshift;
880
1ec885cd 881 page = filemap_get_page(&bitmap->storage, chunk);
ef99bf48
N
882 if (!page)
883 return;
1ec885cd 884 bit = file_page_offset(&bitmap->storage, chunk);
ef99bf48 885 paddr = kmap_atomic(page);
b405fe91 886 if (test_bit(BITMAP_HOSTENDIAN, &bitmap->flags))
ef99bf48
N
887 clear_bit(bit, paddr);
888 else
889 __clear_bit_le(bit, paddr);
890 kunmap_atomic(paddr);
d189122d
N
891 if (!test_page_attr(bitmap, page->index, BITMAP_PAGE_NEEDWRITE)) {
892 set_page_attr(bitmap, page->index, BITMAP_PAGE_PENDING);
ef99bf48
N
893 bitmap->allclean = 0;
894 }
895}
896
32a7627c
N
897/* this gets called when the md device is ready to unplug its underlying
898 * (slave) device queues -- before we let any writes go down, we need to
899 * sync the dirty pages of the bitmap file to disk */
4ad13663 900void bitmap_unplug(struct bitmap *bitmap)
32a7627c 901{
74667123 902 unsigned long i;
ec7a3197 903 int dirty, need_write;
32a7627c
N
904 int wait = 0;
905
1ec885cd 906 if (!bitmap || !bitmap->storage.filemap)
4ad13663 907 return;
32a7627c
N
908
909 /* look at each page to see if there are any set bits that need to be
910 * flushed out to disk */
1ec885cd 911 for (i = 0; i < bitmap->storage.file_pages; i++) {
74667123 912 spin_lock_irq(&bitmap->lock);
1ec885cd 913 if (!bitmap->storage.filemap) {
74667123 914 spin_unlock_irq(&bitmap->lock);
4ad13663 915 return;
32a7627c 916 }
d189122d
N
917 dirty = test_page_attr(bitmap, i, BITMAP_PAGE_DIRTY);
918 need_write = test_page_attr(bitmap, i, BITMAP_PAGE_NEEDWRITE);
919 clear_page_attr(bitmap, i, BITMAP_PAGE_DIRTY);
920 clear_page_attr(bitmap, i, BITMAP_PAGE_NEEDWRITE);
bf07bb7d 921 if (dirty || need_write)
d189122d 922 clear_page_attr(bitmap, i, BITMAP_PAGE_PENDING);
ec7a3197 923 if (dirty)
32a7627c 924 wait = 1;
74667123 925 spin_unlock_irq(&bitmap->lock);
32a7627c 926
ac2f40be 927 if (dirty || need_write)
1ec885cd 928 write_page(bitmap, bitmap->storage.filemap[i], 0);
32a7627c
N
929 }
930 if (wait) { /* if any writes were performed, we need to wait on them */
1ec885cd 931 if (bitmap->storage.file)
d785a06a
N
932 wait_event(bitmap->write_wait,
933 atomic_read(&bitmap->pending_writes)==0);
0b79ccf0 934 else
a9701a30 935 md_super_wait(bitmap->mddev);
32a7627c 936 }
b405fe91 937 if (test_bit(BITMAP_WRITE_ERROR, &bitmap->flags))
d785a06a 938 bitmap_file_kick(bitmap);
32a7627c 939}
ac2f40be 940EXPORT_SYMBOL(bitmap_unplug);
32a7627c 941
6a07997f 942static void bitmap_set_memory_bits(struct bitmap *bitmap, sector_t offset, int needed);
32a7627c
N
943/* * bitmap_init_from_disk -- called at bitmap_create time to initialize
944 * the in-memory bitmap from the on-disk bitmap -- also, sets up the
945 * memory mapping of the bitmap file
946 * Special cases:
947 * if there's no bitmap file, or if the bitmap file had been
948 * previously kicked from the array, we mark all the bits as
949 * 1's in order to cause a full resync.
6a07997f
N
950 *
951 * We ignore all bits for sectors that end earlier than 'start'.
952 * This is used when reading an out-of-date bitmap...
32a7627c 953 */
6a07997f 954static int bitmap_init_from_disk(struct bitmap *bitmap, sector_t start)
32a7627c
N
955{
956 unsigned long i, chunks, index, oldindex, bit;
27581e5a 957 struct page *page = NULL;
d1244cb0 958 unsigned long bit_cnt = 0;
32a7627c 959 struct file *file;
d1244cb0 960 unsigned long offset;
32a7627c
N
961 int outofdate;
962 int ret = -ENOSPC;
ea03aff9 963 void *paddr;
1ec885cd 964 struct bitmap_storage *store = &bitmap->storage;
32a7627c
N
965
966 chunks = bitmap->chunks;
1ec885cd 967 file = store->file;
32a7627c 968
ef99bf48
N
969 if (!file && !bitmap->mddev->bitmap_info.offset) {
970 /* No permanent bitmap - fill with '1s'. */
1ec885cd
N
971 store->filemap = NULL;
972 store->file_pages = 0;
ef99bf48
N
973 for (i = 0; i < chunks ; i++) {
974 /* if the disk bit is set, set the memory bit */
975 int needed = ((sector_t)(i+1) << (bitmap->chunkshift)
976 >= start);
977 bitmap_set_memory_bits(bitmap,
978 (sector_t)i << bitmap->chunkshift,
979 needed);
980 }
981 return 0;
982 }
32a7627c 983
b405fe91 984 outofdate = test_bit(BITMAP_STALE, &bitmap->flags);
32a7627c
N
985 if (outofdate)
986 printk(KERN_INFO "%s: bitmap file is out of date, doing full "
987 "recovery\n", bmname(bitmap));
988
d1244cb0 989 if (file && i_size_read(file->f_mapping->host) < store->bytes) {
32a7627c 990 printk(KERN_INFO "%s: bitmap file too short %lu < %lu\n",
d1244cb0
N
991 bmname(bitmap),
992 (unsigned long) i_size_read(file->f_mapping->host),
993 store->bytes);
4ad13663 994 goto err;
32a7627c 995 }
bc7f77de 996
d1244cb0 997 oldindex = ~0L;
27581e5a 998 offset = 0;
d1244cb0 999 if (!bitmap->mddev->bitmap_info.external)
27581e5a 1000 offset = sizeof(bitmap_super_t);
32a7627c
N
1001
1002 for (i = 0; i < chunks; i++) {
bd926c63 1003 int b;
1ec885cd
N
1004 index = file_page_index(&bitmap->storage, i);
1005 bit = file_page_offset(&bitmap->storage, i);
32a7627c 1006 if (index != oldindex) { /* this is a new page, read it in */
d785a06a 1007 int count;
32a7627c 1008 /* unmap the old page, we're done with it */
d1244cb0
N
1009 if (index == store->file_pages-1)
1010 count = store->bytes - index * PAGE_SIZE;
d785a06a
N
1011 else
1012 count = PAGE_SIZE;
1ec885cd 1013 page = store->filemap[index];
27581e5a
N
1014 if (file)
1015 ret = read_page(file, index, bitmap,
1016 count, page);
1017 else
1018 ret = read_sb_page(
1019 bitmap->mddev,
1020 bitmap->mddev->bitmap_info.offset,
1021 page,
1022 index, count);
1023
1024 if (ret)
4ad13663 1025 goto err;
a654b9d8 1026
32a7627c 1027 oldindex = index;
32a7627c
N
1028
1029 if (outofdate) {
1030 /*
1031 * if bitmap is out of date, dirty the
ac2f40be 1032 * whole page and write it out
32a7627c 1033 */
b2f46e68 1034 paddr = kmap_atomic(page);
ea03aff9 1035 memset(paddr + offset, 0xff,
6a07997f 1036 PAGE_SIZE - offset);
b2f46e68 1037 kunmap_atomic(paddr);
4ad13663
N
1038 write_page(bitmap, page, 1);
1039
1040 ret = -EIO;
b405fe91
N
1041 if (test_bit(BITMAP_WRITE_ERROR,
1042 &bitmap->flags))
4ad13663 1043 goto err;
32a7627c 1044 }
32a7627c 1045 }
b2f46e68 1046 paddr = kmap_atomic(page);
b405fe91 1047 if (test_bit(BITMAP_HOSTENDIAN, &bitmap->flags))
ea03aff9 1048 b = test_bit(bit, paddr);
bd926c63 1049 else
6b33aff3 1050 b = test_bit_le(bit, paddr);
b2f46e68 1051 kunmap_atomic(paddr);
bd926c63 1052 if (b) {
32a7627c 1053 /* if the disk bit is set, set the memory bit */
61a0d80c 1054 int needed = ((sector_t)(i+1) << bitmap->chunkshift
db305e50
N
1055 >= start);
1056 bitmap_set_memory_bits(bitmap,
61a0d80c 1057 (sector_t)i << bitmap->chunkshift,
db305e50 1058 needed);
32a7627c
N
1059 bit_cnt++;
1060 }
27581e5a 1061 offset = 0;
32a7627c
N
1062 }
1063
32a7627c 1064 printk(KERN_INFO "%s: bitmap initialized from disk: "
d1244cb0 1065 "read %lu pages, set %lu of %lu bits\n",
1ec885cd 1066 bmname(bitmap), store->file_pages,
d1244cb0 1067 bit_cnt, chunks);
4ad13663
N
1068
1069 return 0;
32a7627c 1070
4ad13663
N
1071 err:
1072 printk(KERN_INFO "%s: bitmap initialisation failed: %d\n",
1073 bmname(bitmap), ret);
32a7627c
N
1074 return ret;
1075}
1076
a654b9d8
N
1077void bitmap_write_all(struct bitmap *bitmap)
1078{
1079 /* We don't actually write all bitmap blocks here,
1080 * just flag them as needing to be written
1081 */
ec7a3197 1082 int i;
a654b9d8 1083
1ec885cd 1084 if (!bitmap || !bitmap->storage.filemap)
ef99bf48 1085 return;
1ec885cd 1086 if (bitmap->storage.file)
ef99bf48
N
1087 /* Only one copy, so nothing needed */
1088 return;
1089
7c8f4247 1090 spin_lock_irq(&bitmap->lock);
1ec885cd 1091 for (i = 0; i < bitmap->storage.file_pages; i++)
d189122d 1092 set_page_attr(bitmap, i,
ec7a3197 1093 BITMAP_PAGE_NEEDWRITE);
2585f3ef 1094 bitmap->allclean = 0;
7c8f4247 1095 spin_unlock_irq(&bitmap->lock);
a654b9d8
N
1096}
1097
32a7627c
N
1098static void bitmap_count_page(struct bitmap *bitmap, sector_t offset, int inc)
1099{
61a0d80c 1100 sector_t chunk = offset >> bitmap->chunkshift;
32a7627c
N
1101 unsigned long page = chunk >> PAGE_COUNTER_SHIFT;
1102 bitmap->bp[page].count += inc;
32a7627c
N
1103 bitmap_checkfree(bitmap, page);
1104}
bf07bb7d
N
1105
1106static void bitmap_set_pending(struct bitmap *bitmap, sector_t offset)
1107{
1108 sector_t chunk = offset >> bitmap->chunkshift;
1109 unsigned long page = chunk >> PAGE_COUNTER_SHIFT;
1110 struct bitmap_page *bp = &bitmap->bp[page];
1111
1112 if (!bp->pending)
1113 bp->pending = 1;
1114}
1115
32a7627c 1116static bitmap_counter_t *bitmap_get_counter(struct bitmap *bitmap,
57dab0bd 1117 sector_t offset, sector_t *blocks,
32a7627c
N
1118 int create);
1119
1120/*
1121 * bitmap daemon -- periodically wakes up to clean bits and flush pages
1122 * out to disk
1123 */
1124
fd01b88c 1125void bitmap_daemon_work(struct mddev *mddev)
32a7627c 1126{
aa5cbd10 1127 struct bitmap *bitmap;
aa3163f8 1128 unsigned long j;
bf07bb7d 1129 unsigned long nextpage;
57dab0bd 1130 sector_t blocks;
32a7627c 1131
aa5cbd10
N
1132 /* Use a mutex to guard daemon_work against
1133 * bitmap_destroy.
1134 */
c3d9714e 1135 mutex_lock(&mddev->bitmap_info.mutex);
aa5cbd10
N
1136 bitmap = mddev->bitmap;
1137 if (bitmap == NULL) {
c3d9714e 1138 mutex_unlock(&mddev->bitmap_info.mutex);
4ad13663 1139 return;
aa5cbd10 1140 }
42a04b50 1141 if (time_before(jiffies, bitmap->daemon_lastrun
2e61ebbc 1142 + mddev->bitmap_info.daemon_sleep))
7be3dfec
N
1143 goto done;
1144
32a7627c 1145 bitmap->daemon_lastrun = jiffies;
8311c29d 1146 if (bitmap->allclean) {
2e61ebbc 1147 mddev->thread->timeout = MAX_SCHEDULE_TIMEOUT;
aa5cbd10 1148 goto done;
8311c29d
N
1149 }
1150 bitmap->allclean = 1;
32a7627c 1151
bf07bb7d
N
1152 /* Any file-page which is PENDING now needs to be written.
1153 * So set NEEDWRITE now, then after we make any last-minute changes
1154 * we will write it.
1155 */
74667123 1156 spin_lock_irq(&bitmap->lock);
1ec885cd 1157 for (j = 0; j < bitmap->storage.file_pages; j++)
d189122d 1158 if (test_page_attr(bitmap, j,
bf07bb7d 1159 BITMAP_PAGE_PENDING)) {
d189122d 1160 set_page_attr(bitmap, j,
bf07bb7d 1161 BITMAP_PAGE_NEEDWRITE);
d189122d 1162 clear_page_attr(bitmap, j,
bf07bb7d
N
1163 BITMAP_PAGE_PENDING);
1164 }
1165
1166 if (bitmap->need_sync &&
1167 mddev->bitmap_info.external == 0) {
1168 /* Arrange for superblock update as well as
1169 * other changes */
1170 bitmap_super_t *sb;
1171 bitmap->need_sync = 0;
1ec885cd
N
1172 if (bitmap->storage.filemap) {
1173 sb = kmap_atomic(bitmap->storage.sb_page);
ef99bf48
N
1174 sb->events_cleared =
1175 cpu_to_le64(bitmap->events_cleared);
1176 kunmap_atomic(sb);
d189122d 1177 set_page_attr(bitmap, 0,
ef99bf48
N
1178 BITMAP_PAGE_NEEDWRITE);
1179 }
bf07bb7d
N
1180 }
1181 /* Now look at the bitmap counters and if any are '2' or '1',
1182 * decrement and handle accordingly.
1183 */
1184 nextpage = 0;
32a7627c
N
1185 for (j = 0; j < bitmap->chunks; j++) {
1186 bitmap_counter_t *bmc;
ef99bf48 1187 sector_t block = (sector_t)j << bitmap->chunkshift;
3520fa4d 1188
bf07bb7d
N
1189 if (j == nextpage) {
1190 nextpage += PAGE_COUNTER_RATIO;
1191 if (!bitmap->bp[j >> PAGE_COUNTER_SHIFT].pending) {
1192 j |= PAGE_COUNTER_MASK;
aa3163f8
N
1193 continue;
1194 }
bf07bb7d 1195 bitmap->bp[j >> PAGE_COUNTER_SHIFT].pending = 0;
32a7627c 1196 }
db305e50 1197 bmc = bitmap_get_counter(bitmap,
ef99bf48 1198 block,
db305e50 1199 &blocks, 0);
bf07bb7d
N
1200
1201 if (!bmc) {
5a537df4 1202 j |= PAGE_COUNTER_MASK;
bf07bb7d
N
1203 continue;
1204 }
1205 if (*bmc == 1 && !bitmap->need_sync) {
1206 /* We can clear the bit */
bf07bb7d 1207 *bmc = 0;
ef99bf48
N
1208 bitmap_count_page(bitmap, block, -1);
1209 bitmap_file_clear_bit(bitmap, block);
bf07bb7d
N
1210 } else if (*bmc && *bmc <= 2) {
1211 *bmc = 1;
ef99bf48 1212 bitmap_set_pending(bitmap, block);
bf07bb7d 1213 bitmap->allclean = 0;
5a537df4 1214 }
32a7627c
N
1215 }
1216
bf07bb7d
N
1217 /* Now start writeout on any page in NEEDWRITE that isn't DIRTY.
1218 * DIRTY pages need to be written by bitmap_unplug so it can wait
1219 * for them.
1220 * If we find any DIRTY page we stop there and let bitmap_unplug
1221 * handle all the rest. This is important in the case where
1222 * the first blocking holds the superblock and it has been updated.
1223 * We mustn't write any other blocks before the superblock.
1224 */
1ec885cd 1225 for (j = 0; j < bitmap->storage.file_pages; j++) {
bf07bb7d 1226
d189122d 1227 if (test_page_attr(bitmap, j,
bf07bb7d
N
1228 BITMAP_PAGE_DIRTY))
1229 /* bitmap_unplug will handle the rest */
1230 break;
d189122d 1231 if (test_page_attr(bitmap, j,
bf07bb7d 1232 BITMAP_PAGE_NEEDWRITE)) {
d189122d 1233 clear_page_attr(bitmap, j,
bf07bb7d 1234 BITMAP_PAGE_NEEDWRITE);
74667123 1235 spin_unlock_irq(&bitmap->lock);
1ec885cd 1236 write_page(bitmap, bitmap->storage.filemap[j], 0);
74667123 1237 spin_lock_irq(&bitmap->lock);
1ec885cd 1238 if (!bitmap->storage.filemap)
bf07bb7d 1239 break;
32a7627c 1240 }
32a7627c 1241 }
74667123 1242 spin_unlock_irq(&bitmap->lock);
32a7627c 1243
7be3dfec 1244 done:
8311c29d 1245 if (bitmap->allclean == 0)
2e61ebbc
N
1246 mddev->thread->timeout =
1247 mddev->bitmap_info.daemon_sleep;
c3d9714e 1248 mutex_unlock(&mddev->bitmap_info.mutex);
32a7627c
N
1249}
1250
32a7627c 1251static bitmap_counter_t *bitmap_get_counter(struct bitmap *bitmap,
57dab0bd 1252 sector_t offset, sector_t *blocks,
32a7627c 1253 int create)
ee305ace
N
1254__releases(bitmap->lock)
1255__acquires(bitmap->lock)
32a7627c
N
1256{
1257 /* If 'create', we might release the lock and reclaim it.
1258 * The lock must have been taken with interrupts enabled.
1259 * If !create, we don't release the lock.
1260 */
61a0d80c 1261 sector_t chunk = offset >> bitmap->chunkshift;
32a7627c
N
1262 unsigned long page = chunk >> PAGE_COUNTER_SHIFT;
1263 unsigned long pageoff = (chunk & PAGE_COUNTER_MASK) << COUNTER_BYTE_SHIFT;
1264 sector_t csize;
ef425673 1265 int err;
32a7627c 1266
ef425673
N
1267 err = bitmap_checkpage(bitmap, page, create);
1268
1269 if (bitmap->bp[page].hijacked ||
1270 bitmap->bp[page].map == NULL)
61a0d80c 1271 csize = ((sector_t)1) << (bitmap->chunkshift +
ef425673
N
1272 PAGE_COUNTER_SHIFT - 1);
1273 else
61a0d80c 1274 csize = ((sector_t)1) << bitmap->chunkshift;
ef425673
N
1275 *blocks = csize - (offset & (csize - 1));
1276
1277 if (err < 0)
32a7627c 1278 return NULL;
ef425673 1279
32a7627c
N
1280 /* now locked ... */
1281
1282 if (bitmap->bp[page].hijacked) { /* hijacked pointer */
1283 /* should we use the first or second counter field
1284 * of the hijacked pointer? */
1285 int hi = (pageoff > PAGE_COUNTER_MASK);
32a7627c
N
1286 return &((bitmap_counter_t *)
1287 &bitmap->bp[page].map)[hi];
ef425673 1288 } else /* page is allocated */
32a7627c
N
1289 return (bitmap_counter_t *)
1290 &(bitmap->bp[page].map[pageoff]);
32a7627c
N
1291}
1292
4b6d287f 1293int bitmap_startwrite(struct bitmap *bitmap, sector_t offset, unsigned long sectors, int behind)
32a7627c 1294{
ac2f40be
N
1295 if (!bitmap)
1296 return 0;
4b6d287f
N
1297
1298 if (behind) {
696fcd53 1299 int bw;
4b6d287f 1300 atomic_inc(&bitmap->behind_writes);
696fcd53
PC
1301 bw = atomic_read(&bitmap->behind_writes);
1302 if (bw > bitmap->behind_writes_used)
1303 bitmap->behind_writes_used = bw;
1304
36a4e1fe
N
1305 pr_debug("inc write-behind count %d/%lu\n",
1306 bw, bitmap->mddev->bitmap_info.max_write_behind);
4b6d287f
N
1307 }
1308
32a7627c 1309 while (sectors) {
57dab0bd 1310 sector_t blocks;
32a7627c
N
1311 bitmap_counter_t *bmc;
1312
1313 spin_lock_irq(&bitmap->lock);
1314 bmc = bitmap_get_counter(bitmap, offset, &blocks, 1);
1315 if (!bmc) {
1316 spin_unlock_irq(&bitmap->lock);
1317 return 0;
1318 }
1319
27d5ea04 1320 if (unlikely(COUNTER(*bmc) == COUNTER_MAX)) {
da6e1a32
NB
1321 DEFINE_WAIT(__wait);
1322 /* note that it is safe to do the prepare_to_wait
1323 * after the test as long as we do it before dropping
1324 * the spinlock.
1325 */
1326 prepare_to_wait(&bitmap->overflow_wait, &__wait,
1327 TASK_UNINTERRUPTIBLE);
1328 spin_unlock_irq(&bitmap->lock);
7eaceacc 1329 io_schedule();
da6e1a32
NB
1330 finish_wait(&bitmap->overflow_wait, &__wait);
1331 continue;
1332 }
1333
ac2f40be 1334 switch (*bmc) {
32a7627c
N
1335 case 0:
1336 bitmap_file_set_bit(bitmap, offset);
ac2f40be 1337 bitmap_count_page(bitmap, offset, 1);
32a7627c
N
1338 /* fall through */
1339 case 1:
1340 *bmc = 2;
1341 }
da6e1a32 1342
32a7627c
N
1343 (*bmc)++;
1344
1345 spin_unlock_irq(&bitmap->lock);
1346
1347 offset += blocks;
1348 if (sectors > blocks)
1349 sectors -= blocks;
ac2f40be
N
1350 else
1351 sectors = 0;
32a7627c
N
1352 }
1353 return 0;
1354}
ac2f40be 1355EXPORT_SYMBOL(bitmap_startwrite);
32a7627c
N
1356
1357void bitmap_endwrite(struct bitmap *bitmap, sector_t offset, unsigned long sectors,
4b6d287f 1358 int success, int behind)
32a7627c 1359{
ac2f40be
N
1360 if (!bitmap)
1361 return;
4b6d287f 1362 if (behind) {
e555190d
N
1363 if (atomic_dec_and_test(&bitmap->behind_writes))
1364 wake_up(&bitmap->behind_wait);
36a4e1fe
N
1365 pr_debug("dec write-behind count %d/%lu\n",
1366 atomic_read(&bitmap->behind_writes),
1367 bitmap->mddev->bitmap_info.max_write_behind);
4b6d287f
N
1368 }
1369
32a7627c 1370 while (sectors) {
57dab0bd 1371 sector_t blocks;
32a7627c
N
1372 unsigned long flags;
1373 bitmap_counter_t *bmc;
1374
1375 spin_lock_irqsave(&bitmap->lock, flags);
1376 bmc = bitmap_get_counter(bitmap, offset, &blocks, 0);
1377 if (!bmc) {
1378 spin_unlock_irqrestore(&bitmap->lock, flags);
1379 return;
1380 }
1381
961902c0 1382 if (success && !bitmap->mddev->degraded &&
a0da84f3
NB
1383 bitmap->events_cleared < bitmap->mddev->events) {
1384 bitmap->events_cleared = bitmap->mddev->events;
1385 bitmap->need_sync = 1;
5ff5afff 1386 sysfs_notify_dirent_safe(bitmap->sysfs_can_clear);
a0da84f3
NB
1387 }
1388
27d5ea04 1389 if (!success && !NEEDED(*bmc))
32a7627c
N
1390 *bmc |= NEEDED_MASK;
1391
27d5ea04 1392 if (COUNTER(*bmc) == COUNTER_MAX)
da6e1a32
NB
1393 wake_up(&bitmap->overflow_wait);
1394
32a7627c 1395 (*bmc)--;
2585f3ef 1396 if (*bmc <= 2) {
bf07bb7d 1397 bitmap_set_pending(bitmap, offset);
2585f3ef
N
1398 bitmap->allclean = 0;
1399 }
32a7627c
N
1400 spin_unlock_irqrestore(&bitmap->lock, flags);
1401 offset += blocks;
1402 if (sectors > blocks)
1403 sectors -= blocks;
ac2f40be
N
1404 else
1405 sectors = 0;
32a7627c
N
1406 }
1407}
ac2f40be 1408EXPORT_SYMBOL(bitmap_endwrite);
32a7627c 1409
57dab0bd 1410static int __bitmap_start_sync(struct bitmap *bitmap, sector_t offset, sector_t *blocks,
1187cf0a 1411 int degraded)
32a7627c
N
1412{
1413 bitmap_counter_t *bmc;
1414 int rv;
1415 if (bitmap == NULL) {/* FIXME or bitmap set as 'failed' */
1416 *blocks = 1024;
1417 return 1; /* always resync if no bitmap */
1418 }
1419 spin_lock_irq(&bitmap->lock);
1420 bmc = bitmap_get_counter(bitmap, offset, blocks, 0);
1421 rv = 0;
1422 if (bmc) {
1423 /* locked */
1424 if (RESYNC(*bmc))
1425 rv = 1;
1426 else if (NEEDED(*bmc)) {
1427 rv = 1;
6a806c51
N
1428 if (!degraded) { /* don't set/clear bits if degraded */
1429 *bmc |= RESYNC_MASK;
1430 *bmc &= ~NEEDED_MASK;
1431 }
32a7627c
N
1432 }
1433 }
1434 spin_unlock_irq(&bitmap->lock);
1435 return rv;
1436}
1437
57dab0bd 1438int bitmap_start_sync(struct bitmap *bitmap, sector_t offset, sector_t *blocks,
1187cf0a
N
1439 int degraded)
1440{
1441 /* bitmap_start_sync must always report on multiples of whole
1442 * pages, otherwise resync (which is very PAGE_SIZE based) will
1443 * get confused.
1444 * So call __bitmap_start_sync repeatedly (if needed) until
1445 * At least PAGE_SIZE>>9 blocks are covered.
1446 * Return the 'or' of the result.
1447 */
1448 int rv = 0;
57dab0bd 1449 sector_t blocks1;
1187cf0a
N
1450
1451 *blocks = 0;
1452 while (*blocks < (PAGE_SIZE>>9)) {
1453 rv |= __bitmap_start_sync(bitmap, offset,
1454 &blocks1, degraded);
1455 offset += blocks1;
1456 *blocks += blocks1;
1457 }
1458 return rv;
1459}
ac2f40be 1460EXPORT_SYMBOL(bitmap_start_sync);
1187cf0a 1461
57dab0bd 1462void bitmap_end_sync(struct bitmap *bitmap, sector_t offset, sector_t *blocks, int aborted)
32a7627c
N
1463{
1464 bitmap_counter_t *bmc;
1465 unsigned long flags;
ac2f40be
N
1466
1467 if (bitmap == NULL) {
32a7627c
N
1468 *blocks = 1024;
1469 return;
1470 }
1471 spin_lock_irqsave(&bitmap->lock, flags);
1472 bmc = bitmap_get_counter(bitmap, offset, blocks, 0);
1473 if (bmc == NULL)
1474 goto unlock;
1475 /* locked */
32a7627c
N
1476 if (RESYNC(*bmc)) {
1477 *bmc &= ~RESYNC_MASK;
1478
1479 if (!NEEDED(*bmc) && aborted)
1480 *bmc |= NEEDED_MASK;
1481 else {
2585f3ef 1482 if (*bmc <= 2) {
bf07bb7d 1483 bitmap_set_pending(bitmap, offset);
2585f3ef
N
1484 bitmap->allclean = 0;
1485 }
32a7627c
N
1486 }
1487 }
1488 unlock:
1489 spin_unlock_irqrestore(&bitmap->lock, flags);
1490}
ac2f40be 1491EXPORT_SYMBOL(bitmap_end_sync);
32a7627c
N
1492
1493void bitmap_close_sync(struct bitmap *bitmap)
1494{
1495 /* Sync has finished, and any bitmap chunks that weren't synced
1496 * properly have been aborted. It remains to us to clear the
1497 * RESYNC bit wherever it is still on
1498 */
1499 sector_t sector = 0;
57dab0bd 1500 sector_t blocks;
b47490c9
N
1501 if (!bitmap)
1502 return;
32a7627c
N
1503 while (sector < bitmap->mddev->resync_max_sectors) {
1504 bitmap_end_sync(bitmap, sector, &blocks, 0);
b47490c9
N
1505 sector += blocks;
1506 }
1507}
ac2f40be 1508EXPORT_SYMBOL(bitmap_close_sync);
b47490c9
N
1509
1510void bitmap_cond_end_sync(struct bitmap *bitmap, sector_t sector)
1511{
1512 sector_t s = 0;
57dab0bd 1513 sector_t blocks;
b47490c9
N
1514
1515 if (!bitmap)
1516 return;
1517 if (sector == 0) {
1518 bitmap->last_end_sync = jiffies;
1519 return;
1520 }
1521 if (time_before(jiffies, (bitmap->last_end_sync
1b04be96 1522 + bitmap->mddev->bitmap_info.daemon_sleep)))
b47490c9
N
1523 return;
1524 wait_event(bitmap->mddev->recovery_wait,
1525 atomic_read(&bitmap->mddev->recovery_active) == 0);
1526
75d3da43 1527 bitmap->mddev->curr_resync_completed = sector;
070dc6dd 1528 set_bit(MD_CHANGE_CLEAN, &bitmap->mddev->flags);
61a0d80c 1529 sector &= ~((1ULL << bitmap->chunkshift) - 1);
b47490c9
N
1530 s = 0;
1531 while (s < sector && s < bitmap->mddev->resync_max_sectors) {
1532 bitmap_end_sync(bitmap, s, &blocks, 0);
1533 s += blocks;
32a7627c 1534 }
b47490c9 1535 bitmap->last_end_sync = jiffies;
acb180b0 1536 sysfs_notify(&bitmap->mddev->kobj, NULL, "sync_completed");
32a7627c 1537}
ac2f40be 1538EXPORT_SYMBOL(bitmap_cond_end_sync);
32a7627c 1539
6a07997f 1540static void bitmap_set_memory_bits(struct bitmap *bitmap, sector_t offset, int needed)
32a7627c
N
1541{
1542 /* For each chunk covered by any of these sectors, set the
ef99bf48 1543 * counter to 2 and possibly set resync_needed. They should all
32a7627c
N
1544 * be 0 at this point
1545 */
193f1c93 1546
57dab0bd 1547 sector_t secs;
193f1c93
N
1548 bitmap_counter_t *bmc;
1549 spin_lock_irq(&bitmap->lock);
1550 bmc = bitmap_get_counter(bitmap, offset, &secs, 1);
1551 if (!bmc) {
32a7627c 1552 spin_unlock_irq(&bitmap->lock);
193f1c93 1553 return;
32a7627c 1554 }
ac2f40be 1555 if (!*bmc) {
915c420d 1556 *bmc = 2 | (needed ? NEEDED_MASK : 0);
193f1c93 1557 bitmap_count_page(bitmap, offset, 1);
bf07bb7d 1558 bitmap_set_pending(bitmap, offset);
2585f3ef 1559 bitmap->allclean = 0;
193f1c93
N
1560 }
1561 spin_unlock_irq(&bitmap->lock);
32a7627c
N
1562}
1563
9b1d1dac
PC
1564/* dirty the memory and file bits for bitmap chunks "s" to "e" */
1565void bitmap_dirty_bits(struct bitmap *bitmap, unsigned long s, unsigned long e)
1566{
1567 unsigned long chunk;
1568
1569 for (chunk = s; chunk <= e; chunk++) {
61a0d80c 1570 sector_t sec = (sector_t)chunk << bitmap->chunkshift;
9b1d1dac 1571 bitmap_set_memory_bits(bitmap, sec, 1);
7c8f4247 1572 spin_lock_irq(&bitmap->lock);
9b1d1dac 1573 bitmap_file_set_bit(bitmap, sec);
7c8f4247 1574 spin_unlock_irq(&bitmap->lock);
ffa23322
N
1575 if (sec < bitmap->mddev->recovery_cp)
1576 /* We are asserting that the array is dirty,
1577 * so move the recovery_cp address back so
1578 * that it is obvious that it is dirty
1579 */
1580 bitmap->mddev->recovery_cp = sec;
9b1d1dac
PC
1581 }
1582}
1583
6b8b3e8a
N
1584/*
1585 * flush out any pending updates
1586 */
fd01b88c 1587void bitmap_flush(struct mddev *mddev)
6b8b3e8a
N
1588{
1589 struct bitmap *bitmap = mddev->bitmap;
42a04b50 1590 long sleep;
6b8b3e8a
N
1591
1592 if (!bitmap) /* there was no bitmap */
1593 return;
1594
1595 /* run the daemon_work three time to ensure everything is flushed
1596 * that can be
1597 */
1b04be96 1598 sleep = mddev->bitmap_info.daemon_sleep * 2;
42a04b50 1599 bitmap->daemon_lastrun -= sleep;
aa5cbd10 1600 bitmap_daemon_work(mddev);
42a04b50 1601 bitmap->daemon_lastrun -= sleep;
aa5cbd10 1602 bitmap_daemon_work(mddev);
42a04b50 1603 bitmap->daemon_lastrun -= sleep;
aa5cbd10 1604 bitmap_daemon_work(mddev);
6b8b3e8a
N
1605 bitmap_update_sb(bitmap);
1606}
1607
32a7627c
N
1608/*
1609 * free memory that was allocated
1610 */
3178b0db 1611static void bitmap_free(struct bitmap *bitmap)
32a7627c
N
1612{
1613 unsigned long k, pages;
1614 struct bitmap_page *bp;
32a7627c
N
1615
1616 if (!bitmap) /* there was no bitmap */
1617 return;
1618
32a7627c
N
1619 /* release the bitmap file and kill the daemon */
1620 bitmap_file_put(bitmap);
1621
1622 bp = bitmap->bp;
1623 pages = bitmap->pages;
1624
1625 /* free all allocated memory */
1626
32a7627c
N
1627 if (bp) /* deallocate the page memory */
1628 for (k = 0; k < pages; k++)
1629 if (bp[k].map && !bp[k].hijacked)
1630 kfree(bp[k].map);
1631 kfree(bp);
1632 kfree(bitmap);
1633}
aa5cbd10 1634
fd01b88c 1635void bitmap_destroy(struct mddev *mddev)
3178b0db
N
1636{
1637 struct bitmap *bitmap = mddev->bitmap;
1638
1639 if (!bitmap) /* there was no bitmap */
1640 return;
1641
c3d9714e 1642 mutex_lock(&mddev->bitmap_info.mutex);
3178b0db 1643 mddev->bitmap = NULL; /* disconnect from the md device */
c3d9714e 1644 mutex_unlock(&mddev->bitmap_info.mutex);
b15c2e57
N
1645 if (mddev->thread)
1646 mddev->thread->timeout = MAX_SCHEDULE_TIMEOUT;
3178b0db 1647
ece5cff0
N
1648 if (bitmap->sysfs_can_clear)
1649 sysfs_put(bitmap->sysfs_can_clear);
1650
3178b0db
N
1651 bitmap_free(bitmap);
1652}
32a7627c
N
1653
1654/*
1655 * initialize the bitmap structure
1656 * if this returns an error, bitmap_destroy must be called to do clean up
1657 */
fd01b88c 1658int bitmap_create(struct mddev *mddev)
32a7627c
N
1659{
1660 struct bitmap *bitmap;
1f593903 1661 sector_t blocks = mddev->resync_max_sectors;
32a7627c
N
1662 unsigned long chunks;
1663 unsigned long pages;
c3d9714e 1664 struct file *file = mddev->bitmap_info.file;
32a7627c 1665 int err;
5ff5afff 1666 struct sysfs_dirent *bm = NULL;
32a7627c 1667
5f6e3c83 1668 BUILD_BUG_ON(sizeof(bitmap_super_t) != 256);
32a7627c 1669
c3d9714e 1670 BUG_ON(file && mddev->bitmap_info.offset);
a654b9d8 1671
9ffae0cf 1672 bitmap = kzalloc(sizeof(*bitmap), GFP_KERNEL);
32a7627c
N
1673 if (!bitmap)
1674 return -ENOMEM;
1675
32a7627c 1676 spin_lock_init(&bitmap->lock);
ce25c31b
N
1677 atomic_set(&bitmap->pending_writes, 0);
1678 init_waitqueue_head(&bitmap->write_wait);
da6e1a32 1679 init_waitqueue_head(&bitmap->overflow_wait);
e555190d 1680 init_waitqueue_head(&bitmap->behind_wait);
ce25c31b 1681
32a7627c 1682 bitmap->mddev = mddev;
32a7627c 1683
5ff5afff
N
1684 if (mddev->kobj.sd)
1685 bm = sysfs_get_dirent(mddev->kobj.sd, NULL, "bitmap");
ece5cff0 1686 if (bm) {
3ff195b0 1687 bitmap->sysfs_can_clear = sysfs_get_dirent(bm, NULL, "can_clear");
ece5cff0
N
1688 sysfs_put(bm);
1689 } else
1690 bitmap->sysfs_can_clear = NULL;
1691
1ec885cd 1692 bitmap->storage.file = file;
ce25c31b
N
1693 if (file) {
1694 get_file(file);
ae8fa283
N
1695 /* As future accesses to this file will use bmap,
1696 * and bypass the page cache, we must sync the file
1697 * first.
1698 */
8018ab05 1699 vfs_fsync(file, 1);
ce25c31b 1700 }
42a04b50 1701 /* read superblock from bitmap file (this sets mddev->bitmap_info.chunksize) */
9c81075f
JB
1702 if (!mddev->bitmap_info.external) {
1703 /*
1704 * If 'MD_ARRAY_FIRST_USE' is set, then device-mapper is
1705 * instructing us to create a new on-disk bitmap instance.
1706 */
1707 if (test_and_clear_bit(MD_ARRAY_FIRST_USE, &mddev->flags))
1708 err = bitmap_new_disk_sb(bitmap);
1709 else
1710 err = bitmap_read_sb(bitmap);
1711 } else {
ece5cff0
N
1712 err = 0;
1713 if (mddev->bitmap_info.chunksize == 0 ||
1714 mddev->bitmap_info.daemon_sleep == 0)
1715 /* chunksize and time_base need to be
1716 * set first. */
1717 err = -EINVAL;
1718 }
32a7627c 1719 if (err)
3178b0db 1720 goto error;
32a7627c 1721
624ce4f5 1722 bitmap->daemon_lastrun = jiffies;
61a0d80c
N
1723 bitmap->chunkshift = (ffz(~mddev->bitmap_info.chunksize)
1724 - BITMAP_BLOCK_SHIFT);
32a7627c 1725
b16b1b6c 1726 chunks = (blocks + (1 << bitmap->chunkshift) - 1) >>
61a0d80c 1727 bitmap->chunkshift;
ac2f40be 1728 pages = (chunks + PAGE_COUNTER_RATIO - 1) / PAGE_COUNTER_RATIO;
32a7627c
N
1729
1730 BUG_ON(!pages);
1731
1732 bitmap->chunks = chunks;
1733 bitmap->pages = pages;
1734 bitmap->missing_pages = pages;
32a7627c 1735
9ffae0cf 1736 bitmap->bp = kzalloc(pages * sizeof(*bitmap->bp), GFP_KERNEL);
29d3247e 1737
3178b0db 1738 err = -ENOMEM;
32a7627c 1739 if (!bitmap->bp)
3178b0db 1740 goto error;
32a7627c 1741
bc9891a8
N
1742 if (file || mddev->bitmap_info.offset) {
1743 err = bitmap_storage_alloc(&bitmap->storage, bitmap->chunks,
1744 !mddev->bitmap_info.external);
1745 if (err)
1746 goto error;
1747 }
69e51b44
N
1748 printk(KERN_INFO "created bitmap (%lu pages) for device %s\n",
1749 pages, bmname(bitmap));
1750
1751 mddev->bitmap = bitmap;
1752
1753
b405fe91 1754 return test_bit(BITMAP_WRITE_ERROR, &bitmap->flags) ? -EIO : 0;
69e51b44
N
1755
1756 error:
1757 bitmap_free(bitmap);
1758 return err;
1759}
1760
fd01b88c 1761int bitmap_load(struct mddev *mddev)
69e51b44
N
1762{
1763 int err = 0;
3520fa4d 1764 sector_t start = 0;
69e51b44
N
1765 sector_t sector = 0;
1766 struct bitmap *bitmap = mddev->bitmap;
1767
1768 if (!bitmap)
1769 goto out;
1770
1771 /* Clear out old bitmap info first: Either there is none, or we
1772 * are resuming after someone else has possibly changed things,
1773 * so we should forget old cached info.
1774 * All chunks should be clean, but some might need_sync.
1775 */
1776 while (sector < mddev->resync_max_sectors) {
57dab0bd 1777 sector_t blocks;
69e51b44
N
1778 bitmap_start_sync(bitmap, sector, &blocks, 0);
1779 sector += blocks;
1780 }
1781 bitmap_close_sync(bitmap);
1782
3520fa4d
JB
1783 if (mddev->degraded == 0
1784 || bitmap->events_cleared == mddev->events)
1785 /* no need to keep dirty bits to optimise a
1786 * re-add of a missing device */
1787 start = mddev->recovery_cp;
1788
afbaa90b 1789 mutex_lock(&mddev->bitmap_info.mutex);
3520fa4d 1790 err = bitmap_init_from_disk(bitmap, start);
afbaa90b 1791 mutex_unlock(&mddev->bitmap_info.mutex);
3520fa4d 1792
32a7627c 1793 if (err)
69e51b44 1794 goto out;
b405fe91 1795 clear_bit(BITMAP_STALE, &bitmap->flags);
ef99bf48
N
1796
1797 /* Kick recovery in case any bits were set */
1798 set_bit(MD_RECOVERY_NEEDED, &bitmap->mddev->recovery);
3178b0db 1799
1b04be96 1800 mddev->thread->timeout = mddev->bitmap_info.daemon_sleep;
9cd30fdc 1801 md_wakeup_thread(mddev->thread);
b15c2e57 1802
4ad13663
N
1803 bitmap_update_sb(bitmap);
1804
b405fe91 1805 if (test_bit(BITMAP_WRITE_ERROR, &bitmap->flags))
69e51b44
N
1806 err = -EIO;
1807out:
3178b0db 1808 return err;
32a7627c 1809}
69e51b44 1810EXPORT_SYMBOL_GPL(bitmap_load);
32a7627c 1811
57148964
N
1812void bitmap_status(struct seq_file *seq, struct bitmap *bitmap)
1813{
1814 unsigned long chunk_kb;
57148964
N
1815
1816 if (!bitmap)
1817 return;
1818
74667123 1819 spin_lock_irq(&bitmap->lock);
57148964
N
1820 chunk_kb = bitmap->mddev->bitmap_info.chunksize >> 10;
1821 seq_printf(seq, "bitmap: %lu/%lu pages [%luKB], "
1822 "%lu%s chunk",
1823 bitmap->pages - bitmap->missing_pages,
1824 bitmap->pages,
1825 (bitmap->pages - bitmap->missing_pages)
1826 << (PAGE_SHIFT - 10),
1827 chunk_kb ? chunk_kb : bitmap->mddev->bitmap_info.chunksize,
1828 chunk_kb ? "KB" : "B");
1ec885cd 1829 if (bitmap->storage.file) {
57148964 1830 seq_printf(seq, ", file: ");
1ec885cd 1831 seq_path(seq, &bitmap->storage.file->f_path, " \t\n");
57148964
N
1832 }
1833
1834 seq_printf(seq, "\n");
74667123 1835 spin_unlock_irq(&bitmap->lock);
57148964
N
1836}
1837
43a70507 1838static ssize_t
fd01b88c 1839location_show(struct mddev *mddev, char *page)
43a70507
N
1840{
1841 ssize_t len;
ac2f40be 1842 if (mddev->bitmap_info.file)
43a70507 1843 len = sprintf(page, "file");
ac2f40be 1844 else if (mddev->bitmap_info.offset)
43a70507 1845 len = sprintf(page, "%+lld", (long long)mddev->bitmap_info.offset);
ac2f40be 1846 else
43a70507
N
1847 len = sprintf(page, "none");
1848 len += sprintf(page+len, "\n");
1849 return len;
1850}
1851
1852static ssize_t
fd01b88c 1853location_store(struct mddev *mddev, const char *buf, size_t len)
43a70507
N
1854{
1855
1856 if (mddev->pers) {
1857 if (!mddev->pers->quiesce)
1858 return -EBUSY;
1859 if (mddev->recovery || mddev->sync_thread)
1860 return -EBUSY;
1861 }
1862
1863 if (mddev->bitmap || mddev->bitmap_info.file ||
1864 mddev->bitmap_info.offset) {
1865 /* bitmap already configured. Only option is to clear it */
1866 if (strncmp(buf, "none", 4) != 0)
1867 return -EBUSY;
1868 if (mddev->pers) {
1869 mddev->pers->quiesce(mddev, 1);
1870 bitmap_destroy(mddev);
1871 mddev->pers->quiesce(mddev, 0);
1872 }
1873 mddev->bitmap_info.offset = 0;
1874 if (mddev->bitmap_info.file) {
1875 struct file *f = mddev->bitmap_info.file;
1876 mddev->bitmap_info.file = NULL;
1877 restore_bitmap_write_access(f);
1878 fput(f);
1879 }
1880 } else {
1881 /* No bitmap, OK to set a location */
1882 long long offset;
1883 if (strncmp(buf, "none", 4) == 0)
1884 /* nothing to be done */;
1885 else if (strncmp(buf, "file:", 5) == 0) {
1886 /* Not supported yet */
1887 return -EINVAL;
1888 } else {
1889 int rv;
1890 if (buf[0] == '+')
1891 rv = strict_strtoll(buf+1, 10, &offset);
1892 else
1893 rv = strict_strtoll(buf, 10, &offset);
1894 if (rv)
1895 return rv;
1896 if (offset == 0)
1897 return -EINVAL;
ece5cff0
N
1898 if (mddev->bitmap_info.external == 0 &&
1899 mddev->major_version == 0 &&
43a70507
N
1900 offset != mddev->bitmap_info.default_offset)
1901 return -EINVAL;
1902 mddev->bitmap_info.offset = offset;
1903 if (mddev->pers) {
1904 mddev->pers->quiesce(mddev, 1);
1905 rv = bitmap_create(mddev);
4474ca42
N
1906 if (!rv)
1907 rv = bitmap_load(mddev);
43a70507
N
1908 if (rv) {
1909 bitmap_destroy(mddev);
1910 mddev->bitmap_info.offset = 0;
1911 }
1912 mddev->pers->quiesce(mddev, 0);
1913 if (rv)
1914 return rv;
1915 }
1916 }
1917 }
1918 if (!mddev->external) {
1919 /* Ensure new bitmap info is stored in
1920 * metadata promptly.
1921 */
1922 set_bit(MD_CHANGE_DEVS, &mddev->flags);
1923 md_wakeup_thread(mddev->thread);
1924 }
1925 return len;
1926}
1927
1928static struct md_sysfs_entry bitmap_location =
1929__ATTR(location, S_IRUGO|S_IWUSR, location_show, location_store);
1930
6409bb05
N
1931/* 'bitmap/space' is the space available at 'location' for the
1932 * bitmap. This allows the kernel to know when it is safe to
1933 * resize the bitmap to match a resized array.
1934 */
1935static ssize_t
1936space_show(struct mddev *mddev, char *page)
1937{
1938 return sprintf(page, "%lu\n", mddev->bitmap_info.space);
1939}
1940
1941static ssize_t
1942space_store(struct mddev *mddev, const char *buf, size_t len)
1943{
1944 unsigned long sectors;
1945 int rv;
1946
1947 rv = kstrtoul(buf, 10, &sectors);
1948 if (rv)
1949 return rv;
1950
1951 if (sectors == 0)
1952 return -EINVAL;
1953
1954 if (mddev->bitmap &&
9b1215c1 1955 sectors < (mddev->bitmap->storage.bytes + 511) >> 9)
6409bb05
N
1956 return -EFBIG; /* Bitmap is too big for this small space */
1957
1958 /* could make sure it isn't too big, but that isn't really
1959 * needed - user-space should be careful.
1960 */
1961 mddev->bitmap_info.space = sectors;
1962 return len;
1963}
1964
1965static struct md_sysfs_entry bitmap_space =
1966__ATTR(space, S_IRUGO|S_IWUSR, space_show, space_store);
1967
43a70507 1968static ssize_t
fd01b88c 1969timeout_show(struct mddev *mddev, char *page)
43a70507
N
1970{
1971 ssize_t len;
1972 unsigned long secs = mddev->bitmap_info.daemon_sleep / HZ;
1973 unsigned long jifs = mddev->bitmap_info.daemon_sleep % HZ;
ac2f40be 1974
43a70507
N
1975 len = sprintf(page, "%lu", secs);
1976 if (jifs)
1977 len += sprintf(page+len, ".%03u", jiffies_to_msecs(jifs));
1978 len += sprintf(page+len, "\n");
1979 return len;
1980}
1981
1982static ssize_t
fd01b88c 1983timeout_store(struct mddev *mddev, const char *buf, size_t len)
43a70507
N
1984{
1985 /* timeout can be set at any time */
1986 unsigned long timeout;
1987 int rv = strict_strtoul_scaled(buf, &timeout, 4);
1988 if (rv)
1989 return rv;
1990
1991 /* just to make sure we don't overflow... */
1992 if (timeout >= LONG_MAX / HZ)
1993 return -EINVAL;
1994
1995 timeout = timeout * HZ / 10000;
1996
1997 if (timeout >= MAX_SCHEDULE_TIMEOUT)
1998 timeout = MAX_SCHEDULE_TIMEOUT-1;
1999 if (timeout < 1)
2000 timeout = 1;
2001 mddev->bitmap_info.daemon_sleep = timeout;
2002 if (mddev->thread) {
2003 /* if thread->timeout is MAX_SCHEDULE_TIMEOUT, then
2004 * the bitmap is all clean and we don't need to
2005 * adjust the timeout right now
2006 */
2007 if (mddev->thread->timeout < MAX_SCHEDULE_TIMEOUT) {
2008 mddev->thread->timeout = timeout;
2009 md_wakeup_thread(mddev->thread);
2010 }
2011 }
2012 return len;
2013}
2014
2015static struct md_sysfs_entry bitmap_timeout =
2016__ATTR(time_base, S_IRUGO|S_IWUSR, timeout_show, timeout_store);
2017
2018static ssize_t
fd01b88c 2019backlog_show(struct mddev *mddev, char *page)
43a70507
N
2020{
2021 return sprintf(page, "%lu\n", mddev->bitmap_info.max_write_behind);
2022}
2023
2024static ssize_t
fd01b88c 2025backlog_store(struct mddev *mddev, const char *buf, size_t len)
43a70507
N
2026{
2027 unsigned long backlog;
2028 int rv = strict_strtoul(buf, 10, &backlog);
2029 if (rv)
2030 return rv;
2031 if (backlog > COUNTER_MAX)
2032 return -EINVAL;
2033 mddev->bitmap_info.max_write_behind = backlog;
2034 return len;
2035}
2036
2037static struct md_sysfs_entry bitmap_backlog =
2038__ATTR(backlog, S_IRUGO|S_IWUSR, backlog_show, backlog_store);
2039
2040static ssize_t
fd01b88c 2041chunksize_show(struct mddev *mddev, char *page)
43a70507
N
2042{
2043 return sprintf(page, "%lu\n", mddev->bitmap_info.chunksize);
2044}
2045
2046static ssize_t
fd01b88c 2047chunksize_store(struct mddev *mddev, const char *buf, size_t len)
43a70507
N
2048{
2049 /* Can only be changed when no bitmap is active */
2050 int rv;
2051 unsigned long csize;
2052 if (mddev->bitmap)
2053 return -EBUSY;
2054 rv = strict_strtoul(buf, 10, &csize);
2055 if (rv)
2056 return rv;
2057 if (csize < 512 ||
2058 !is_power_of_2(csize))
2059 return -EINVAL;
2060 mddev->bitmap_info.chunksize = csize;
2061 return len;
2062}
2063
2064static struct md_sysfs_entry bitmap_chunksize =
2065__ATTR(chunksize, S_IRUGO|S_IWUSR, chunksize_show, chunksize_store);
2066
fd01b88c 2067static ssize_t metadata_show(struct mddev *mddev, char *page)
ece5cff0
N
2068{
2069 return sprintf(page, "%s\n", (mddev->bitmap_info.external
2070 ? "external" : "internal"));
2071}
2072
fd01b88c 2073static ssize_t metadata_store(struct mddev *mddev, const char *buf, size_t len)
ece5cff0
N
2074{
2075 if (mddev->bitmap ||
2076 mddev->bitmap_info.file ||
2077 mddev->bitmap_info.offset)
2078 return -EBUSY;
2079 if (strncmp(buf, "external", 8) == 0)
2080 mddev->bitmap_info.external = 1;
2081 else if (strncmp(buf, "internal", 8) == 0)
2082 mddev->bitmap_info.external = 0;
2083 else
2084 return -EINVAL;
2085 return len;
2086}
2087
2088static struct md_sysfs_entry bitmap_metadata =
2089__ATTR(metadata, S_IRUGO|S_IWUSR, metadata_show, metadata_store);
2090
fd01b88c 2091static ssize_t can_clear_show(struct mddev *mddev, char *page)
ece5cff0
N
2092{
2093 int len;
2094 if (mddev->bitmap)
2095 len = sprintf(page, "%s\n", (mddev->bitmap->need_sync ?
2096 "false" : "true"));
2097 else
2098 len = sprintf(page, "\n");
2099 return len;
2100}
2101
fd01b88c 2102static ssize_t can_clear_store(struct mddev *mddev, const char *buf, size_t len)
ece5cff0
N
2103{
2104 if (mddev->bitmap == NULL)
2105 return -ENOENT;
2106 if (strncmp(buf, "false", 5) == 0)
2107 mddev->bitmap->need_sync = 1;
2108 else if (strncmp(buf, "true", 4) == 0) {
2109 if (mddev->degraded)
2110 return -EBUSY;
2111 mddev->bitmap->need_sync = 0;
2112 } else
2113 return -EINVAL;
2114 return len;
2115}
2116
2117static struct md_sysfs_entry bitmap_can_clear =
2118__ATTR(can_clear, S_IRUGO|S_IWUSR, can_clear_show, can_clear_store);
2119
696fcd53 2120static ssize_t
fd01b88c 2121behind_writes_used_show(struct mddev *mddev, char *page)
696fcd53
PC
2122{
2123 if (mddev->bitmap == NULL)
2124 return sprintf(page, "0\n");
2125 return sprintf(page, "%lu\n",
2126 mddev->bitmap->behind_writes_used);
2127}
2128
2129static ssize_t
fd01b88c 2130behind_writes_used_reset(struct mddev *mddev, const char *buf, size_t len)
696fcd53
PC
2131{
2132 if (mddev->bitmap)
2133 mddev->bitmap->behind_writes_used = 0;
2134 return len;
2135}
2136
2137static struct md_sysfs_entry max_backlog_used =
2138__ATTR(max_backlog_used, S_IRUGO | S_IWUSR,
2139 behind_writes_used_show, behind_writes_used_reset);
2140
43a70507
N
2141static struct attribute *md_bitmap_attrs[] = {
2142 &bitmap_location.attr,
6409bb05 2143 &bitmap_space.attr,
43a70507
N
2144 &bitmap_timeout.attr,
2145 &bitmap_backlog.attr,
2146 &bitmap_chunksize.attr,
ece5cff0
N
2147 &bitmap_metadata.attr,
2148 &bitmap_can_clear.attr,
696fcd53 2149 &max_backlog_used.attr,
43a70507
N
2150 NULL
2151};
2152struct attribute_group md_bitmap_group = {
2153 .name = "bitmap",
2154 .attrs = md_bitmap_attrs,
2155};
2156
This page took 0.724923 seconds and 5 git commands to generate.