]> git.proxmox.com Git - mirror_ubuntu-artful-kernel.git/blame - drivers/md/bitmap.c
Merge tag 'for-linus-20170825' of git://git.infradead.org/linux-mtd
[mirror_ubuntu-artful-kernel.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>
581dbd94 30#include <trace/events/block.h>
43b2e5d8 31#include "md.h"
ef740c37 32#include "bitmap.h"
32a7627c 33
ac2f40be 34static inline char *bmname(struct bitmap *bitmap)
32a7627c
N
35{
36 return bitmap->mddev ? mdname(bitmap->mddev) : "mdX";
37}
38
32a7627c
N
39/*
40 * check a page and, if necessary, allocate it (or hijack it if the alloc fails)
41 *
42 * 1) check to see if this page is allocated, if it's not then try to alloc
43 * 2) if the alloc fails, set the page's hijacked flag so we'll use the
44 * page pointer directly as a counter
45 *
46 * if we find our page, we increment the page's refcount so that it stays
47 * allocated while we're using it
48 */
40cffcc0 49static int bitmap_checkpage(struct bitmap_counts *bitmap,
c9d65032 50 unsigned long page, int create, int no_hijack)
ee305ace
N
51__releases(bitmap->lock)
52__acquires(bitmap->lock)
32a7627c
N
53{
54 unsigned char *mappage;
55
56 if (page >= bitmap->pages) {
1187cf0a
N
57 /* This can happen if bitmap_start_sync goes beyond
58 * End-of-device while looking for a whole page.
59 * It is harmless.
60 */
32a7627c
N
61 return -EINVAL;
62 }
63
32a7627c
N
64 if (bitmap->bp[page].hijacked) /* it's hijacked, don't try to alloc */
65 return 0;
66
67 if (bitmap->bp[page].map) /* page is already allocated, just return */
68 return 0;
69
70 if (!create)
71 return -ENOENT;
72
32a7627c
N
73 /* this page has not been allocated yet */
74
ac2f40be 75 spin_unlock_irq(&bitmap->lock);
d9590143
N
76 /* It is possible that this is being called inside a
77 * prepare_to_wait/finish_wait loop from raid5c:make_request().
78 * In general it is not permitted to sleep in that context as it
79 * can cause the loop to spin freely.
80 * That doesn't apply here as we can only reach this point
81 * once with any loop.
82 * When this function completes, either bp[page].map or
83 * bp[page].hijacked. In either case, this function will
84 * abort before getting to this point again. So there is
85 * no risk of a free-spin, and so it is safe to assert
86 * that sleeping here is allowed.
87 */
88 sched_annotate_sleep();
792a1d4b 89 mappage = kzalloc(PAGE_SIZE, GFP_NOIO);
ac2f40be
N
90 spin_lock_irq(&bitmap->lock);
91
92 if (mappage == NULL) {
40cffcc0 93 pr_debug("md/bitmap: map page allocation failed, hijacking\n");
c9d65032
GJ
94 /* We don't support hijack for cluster raid */
95 if (no_hijack)
96 return -ENOMEM;
32a7627c
N
97 /* failed - set the hijacked flag so that we can use the
98 * pointer as a counter */
32a7627c
N
99 if (!bitmap->bp[page].map)
100 bitmap->bp[page].hijacked = 1;
ac2f40be
N
101 } else if (bitmap->bp[page].map ||
102 bitmap->bp[page].hijacked) {
32a7627c 103 /* somebody beat us to getting the page */
792a1d4b 104 kfree(mappage);
ac2f40be 105 } else {
32a7627c 106
ac2f40be 107 /* no page was in place and we have one, so install it */
32a7627c 108
ac2f40be
N
109 bitmap->bp[page].map = mappage;
110 bitmap->missing_pages--;
111 }
32a7627c
N
112 return 0;
113}
114
32a7627c
N
115/* if page is completely empty, put it back on the free list, or dealloc it */
116/* if page was hijacked, unmark the flag so it might get alloced next time */
117/* Note: lock should be held when calling this */
40cffcc0 118static void bitmap_checkfree(struct bitmap_counts *bitmap, unsigned long page)
32a7627c
N
119{
120 char *ptr;
121
122 if (bitmap->bp[page].count) /* page is still busy */
123 return;
124
125 /* page is no longer in use, it can be released */
126
127 if (bitmap->bp[page].hijacked) { /* page was hijacked, undo this now */
128 bitmap->bp[page].hijacked = 0;
129 bitmap->bp[page].map = NULL;
ac2f40be
N
130 } else {
131 /* normal case, free the page */
132 ptr = bitmap->bp[page].map;
133 bitmap->bp[page].map = NULL;
134 bitmap->missing_pages++;
792a1d4b 135 kfree(ptr);
32a7627c 136 }
32a7627c
N
137}
138
32a7627c
N
139/*
140 * bitmap file handling - read and write the bitmap file and its superblock
141 */
142
32a7627c
N
143/*
144 * basic page I/O operations
145 */
146
a654b9d8 147/* IO operations when bitmap is stored near all superblocks */
27581e5a
N
148static int read_sb_page(struct mddev *mddev, loff_t offset,
149 struct page *page,
150 unsigned long index, int size)
a654b9d8
N
151{
152 /* choose a good rdev and read the page from there */
153
3cb03002 154 struct md_rdev *rdev;
a654b9d8 155 sector_t target;
a654b9d8 156
dafb20fa 157 rdev_for_each(rdev, mddev) {
b2d444d7 158 if (! test_bit(In_sync, &rdev->flags)
4aaf7694
GJ
159 || test_bit(Faulty, &rdev->flags)
160 || test_bit(Bitmap_sync, &rdev->flags))
ab904d63
N
161 continue;
162
ccebd4c4 163 target = offset + index * (PAGE_SIZE/512);
a654b9d8 164
2b193363 165 if (sync_page_io(rdev, target,
e1defc4f 166 roundup(size, bdev_logical_block_size(rdev->bdev)),
796a5cf0 167 page, REQ_OP_READ, 0, true)) {
ab904d63 168 page->index = index;
27581e5a 169 return 0;
ab904d63
N
170 }
171 }
27581e5a 172 return -EIO;
a654b9d8
N
173}
174
fd01b88c 175static struct md_rdev *next_active_rdev(struct md_rdev *rdev, struct mddev *mddev)
b2d2c4ce
N
176{
177 /* Iterate the disks of an mddev, using rcu to protect access to the
178 * linked list, and raising the refcount of devices we return to ensure
179 * they don't disappear while in use.
180 * As devices are only added or removed when raid_disk is < 0 and
181 * nr_pending is 0 and In_sync is clear, the entries we return will
182 * still be in the same position on the list when we re-enter
fd177481 183 * list_for_each_entry_continue_rcu.
8532e343
N
184 *
185 * Note that if entered with 'rdev == NULL' to start at the
186 * beginning, we temporarily assign 'rdev' to an address which
187 * isn't really an rdev, but which can be used by
188 * list_for_each_entry_continue_rcu() to find the first entry.
b2d2c4ce 189 */
b2d2c4ce
N
190 rcu_read_lock();
191 if (rdev == NULL)
192 /* start at the beginning */
8532e343 193 rdev = list_entry(&mddev->disks, struct md_rdev, same_set);
b2d2c4ce
N
194 else {
195 /* release the previous rdev and start from there. */
196 rdev_dec_pending(rdev, mddev);
b2d2c4ce 197 }
fd177481 198 list_for_each_entry_continue_rcu(rdev, &mddev->disks, same_set) {
b2d2c4ce 199 if (rdev->raid_disk >= 0 &&
b2d2c4ce
N
200 !test_bit(Faulty, &rdev->flags)) {
201 /* this is a usable devices */
202 atomic_inc(&rdev->nr_pending);
203 rcu_read_unlock();
204 return rdev;
205 }
206 }
207 rcu_read_unlock();
208 return NULL;
209}
210
ab6085c7 211static int write_sb_page(struct bitmap *bitmap, struct page *page, int wait)
a654b9d8 212{
46533ff7 213 struct md_rdev *rdev;
a6ff7e08 214 struct block_device *bdev;
fd01b88c 215 struct mddev *mddev = bitmap->mddev;
1ec885cd 216 struct bitmap_storage *store = &bitmap->storage;
a654b9d8 217
46533ff7
N
218restart:
219 rdev = NULL;
b2d2c4ce 220 while ((rdev = next_active_rdev(rdev, mddev)) != NULL) {
ac2f40be
N
221 int size = PAGE_SIZE;
222 loff_t offset = mddev->bitmap_info.offset;
a6ff7e08
JB
223
224 bdev = (rdev->meta_bdev) ? rdev->meta_bdev : rdev->bdev;
225
9b1215c1
N
226 if (page->index == store->file_pages-1) {
227 int last_page_size = store->bytes & (PAGE_SIZE-1);
228 if (last_page_size == 0)
229 last_page_size = PAGE_SIZE;
230 size = roundup(last_page_size,
a6ff7e08 231 bdev_logical_block_size(bdev));
9b1215c1 232 }
ac2f40be
N
233 /* Just make sure we aren't corrupting data or
234 * metadata
235 */
236 if (mddev->external) {
237 /* Bitmap could be anywhere. */
238 if (rdev->sb_start + offset + (page->index
239 * (PAGE_SIZE/512))
240 > rdev->data_offset
241 &&
242 rdev->sb_start + offset
243 < (rdev->data_offset + mddev->dev_sectors
244 + (PAGE_SIZE/512)))
245 goto bad_alignment;
246 } else if (offset < 0) {
247 /* DATA BITMAP METADATA */
248 if (offset
249 + (long)(page->index * (PAGE_SIZE/512))
250 + size/512 > 0)
251 /* bitmap runs in to metadata */
252 goto bad_alignment;
253 if (rdev->data_offset + mddev->dev_sectors
254 > rdev->sb_start + offset)
255 /* data runs in to bitmap */
256 goto bad_alignment;
257 } else if (rdev->sb_start < rdev->data_offset) {
258 /* METADATA BITMAP DATA */
259 if (rdev->sb_start
260 + offset
261 + page->index*(PAGE_SIZE/512) + size/512
262 > rdev->data_offset)
263 /* bitmap runs in to data */
264 goto bad_alignment;
265 } else {
266 /* DATA METADATA BITMAP - no problems */
267 }
268 md_super_write(mddev, rdev,
269 rdev->sb_start + offset
270 + page->index * (PAGE_SIZE/512),
271 size,
272 page);
b2d2c4ce 273 }
a654b9d8 274
46533ff7
N
275 if (wait && md_super_wait(mddev) < 0)
276 goto restart;
a654b9d8 277 return 0;
4b80991c
N
278
279 bad_alignment:
4b80991c 280 return -EINVAL;
a654b9d8
N
281}
282
4ad13663 283static void bitmap_file_kick(struct bitmap *bitmap);
32a7627c 284/*
a654b9d8 285 * write out a page to a file
32a7627c 286 */
4ad13663 287static void write_page(struct bitmap *bitmap, struct page *page, int wait)
32a7627c 288{
d785a06a 289 struct buffer_head *bh;
32a7627c 290
1ec885cd 291 if (bitmap->storage.file == NULL) {
f0d76d70
N
292 switch (write_sb_page(bitmap, page, wait)) {
293 case -EINVAL:
b405fe91 294 set_bit(BITMAP_WRITE_ERROR, &bitmap->flags);
f0d76d70 295 }
4ad13663 296 } else {
a654b9d8 297
4ad13663 298 bh = page_buffers(page);
c708443c 299
4ad13663
N
300 while (bh && bh->b_blocknr) {
301 atomic_inc(&bitmap->pending_writes);
302 set_buffer_locked(bh);
303 set_buffer_mapped(bh);
2a222ca9 304 submit_bh(REQ_OP_WRITE, REQ_SYNC, bh);
4ad13663
N
305 bh = bh->b_this_page;
306 }
d785a06a 307
ac2f40be 308 if (wait)
4ad13663
N
309 wait_event(bitmap->write_wait,
310 atomic_read(&bitmap->pending_writes)==0);
8a5e9cf1 311 }
b405fe91 312 if (test_bit(BITMAP_WRITE_ERROR, &bitmap->flags))
4ad13663 313 bitmap_file_kick(bitmap);
d785a06a
N
314}
315
316static void end_bitmap_write(struct buffer_head *bh, int uptodate)
317{
318 struct bitmap *bitmap = bh->b_private;
32a7627c 319
b405fe91
N
320 if (!uptodate)
321 set_bit(BITMAP_WRITE_ERROR, &bitmap->flags);
d785a06a
N
322 if (atomic_dec_and_test(&bitmap->pending_writes))
323 wake_up(&bitmap->write_wait);
324}
32a7627c 325
d785a06a
N
326/* copied from buffer.c */
327static void
328__clear_page_buffers(struct page *page)
329{
330 ClearPagePrivate(page);
331 set_page_private(page, 0);
09cbfeaf 332 put_page(page);
d785a06a
N
333}
334static void free_buffers(struct page *page)
335{
27581e5a 336 struct buffer_head *bh;
77ad4bc7 337
27581e5a
N
338 if (!PagePrivate(page))
339 return;
340
341 bh = page_buffers(page);
d785a06a
N
342 while (bh) {
343 struct buffer_head *next = bh->b_this_page;
344 free_buffer_head(bh);
345 bh = next;
77ad4bc7 346 }
d785a06a
N
347 __clear_page_buffers(page);
348 put_page(page);
32a7627c
N
349}
350
d785a06a
N
351/* read a page from a file.
352 * We both read the page, and attach buffers to the page to record the
353 * address of each block (using bmap). These addresses will be used
354 * to write the block later, completely bypassing the filesystem.
355 * This usage is similar to how swap files are handled, and allows us
356 * to write to a file with no concerns of memory allocation failing.
357 */
27581e5a
N
358static int read_page(struct file *file, unsigned long index,
359 struct bitmap *bitmap,
360 unsigned long count,
361 struct page *page)
32a7627c 362{
27581e5a 363 int ret = 0;
496ad9aa 364 struct inode *inode = file_inode(file);
d785a06a
N
365 struct buffer_head *bh;
366 sector_t block;
32a7627c 367
36a4e1fe
N
368 pr_debug("read bitmap file (%dB @ %llu)\n", (int)PAGE_SIZE,
369 (unsigned long long)index << PAGE_SHIFT);
32a7627c 370
d785a06a
N
371 bh = alloc_page_buffers(page, 1<<inode->i_blkbits, 0);
372 if (!bh) {
27581e5a 373 ret = -ENOMEM;
32a7627c
N
374 goto out;
375 }
d785a06a
N
376 attach_page_buffers(page, bh);
377 block = index << (PAGE_SHIFT - inode->i_blkbits);
378 while (bh) {
379 if (count == 0)
380 bh->b_blocknr = 0;
381 else {
382 bh->b_blocknr = bmap(inode, block);
383 if (bh->b_blocknr == 0) {
384 /* Cannot use this file! */
27581e5a 385 ret = -EINVAL;
d785a06a
N
386 goto out;
387 }
388 bh->b_bdev = inode->i_sb->s_bdev;
389 if (count < (1<<inode->i_blkbits))
390 count = 0;
391 else
392 count -= (1<<inode->i_blkbits);
393
394 bh->b_end_io = end_bitmap_write;
395 bh->b_private = bitmap;
ce25c31b
N
396 atomic_inc(&bitmap->pending_writes);
397 set_buffer_locked(bh);
398 set_buffer_mapped(bh);
2a222ca9 399 submit_bh(REQ_OP_READ, 0, bh);
d785a06a
N
400 }
401 block++;
402 bh = bh->b_this_page;
403 }
d785a06a 404 page->index = index;
ce25c31b
N
405
406 wait_event(bitmap->write_wait,
407 atomic_read(&bitmap->pending_writes)==0);
b405fe91 408 if (test_bit(BITMAP_WRITE_ERROR, &bitmap->flags))
27581e5a 409 ret = -EIO;
32a7627c 410out:
27581e5a 411 if (ret)
ec0cc226
N
412 pr_err("md: bitmap read error: (%dB @ %llu): %d\n",
413 (int)PAGE_SIZE,
414 (unsigned long long)index << PAGE_SHIFT,
415 ret);
27581e5a 416 return ret;
32a7627c
N
417}
418
419/*
420 * bitmap file superblock operations
421 */
422
85c9ccd4
N
423/*
424 * bitmap_wait_writes() should be called before writing any bitmap
425 * blocks, to ensure previous writes, particularly from
426 * bitmap_daemon_work(), have completed.
427 */
428static void bitmap_wait_writes(struct bitmap *bitmap)
429{
430 if (bitmap->storage.file)
431 wait_event(bitmap->write_wait,
432 atomic_read(&bitmap->pending_writes)==0);
433 else
46533ff7
N
434 /* Note that we ignore the return value. The writes
435 * might have failed, but that would just mean that
436 * some bits which should be cleared haven't been,
437 * which is safe. The relevant bitmap blocks will
438 * probably get written again, but there is no great
439 * loss if they aren't.
440 */
85c9ccd4
N
441 md_super_wait(bitmap->mddev);
442}
443
444
32a7627c 445/* update the event counter and sync the superblock to disk */
4ad13663 446void bitmap_update_sb(struct bitmap *bitmap)
32a7627c
N
447{
448 bitmap_super_t *sb;
32a7627c
N
449
450 if (!bitmap || !bitmap->mddev) /* no bitmap for this array */
4ad13663 451 return;
ece5cff0
N
452 if (bitmap->mddev->bitmap_info.external)
453 return;
1ec885cd 454 if (!bitmap->storage.sb_page) /* no superblock */
4ad13663 455 return;
1ec885cd 456 sb = kmap_atomic(bitmap->storage.sb_page);
32a7627c 457 sb->events = cpu_to_le64(bitmap->mddev->events);
8258c532 458 if (bitmap->mddev->events < bitmap->events_cleared)
a0da84f3
NB
459 /* rocking back to read-only */
460 bitmap->events_cleared = bitmap->mddev->events;
8258c532
N
461 sb->events_cleared = cpu_to_le64(bitmap->events_cleared);
462 sb->state = cpu_to_le32(bitmap->flags);
43a70507
N
463 /* Just in case these have been changed via sysfs: */
464 sb->daemon_sleep = cpu_to_le32(bitmap->mddev->bitmap_info.daemon_sleep/HZ);
465 sb->write_behind = cpu_to_le32(bitmap->mddev->bitmap_info.max_write_behind);
b81a0404
N
466 /* This might have been changed by a reshape */
467 sb->sync_size = cpu_to_le64(bitmap->mddev->resync_max_sectors);
468 sb->chunksize = cpu_to_le32(bitmap->mddev->bitmap_info.chunksize);
c4ce867f 469 sb->nodes = cpu_to_le32(bitmap->mddev->bitmap_info.nodes);
1dff2b87
N
470 sb->sectors_reserved = cpu_to_le32(bitmap->mddev->
471 bitmap_info.space);
b2f46e68 472 kunmap_atomic(sb);
1ec885cd 473 write_page(bitmap, bitmap->storage.sb_page, 1);
32a7627c 474}
b98938d1 475EXPORT_SYMBOL(bitmap_update_sb);
32a7627c
N
476
477/* print out the bitmap file superblock */
478void bitmap_print_sb(struct bitmap *bitmap)
479{
480 bitmap_super_t *sb;
481
1ec885cd 482 if (!bitmap || !bitmap->storage.sb_page)
32a7627c 483 return;
1ec885cd 484 sb = kmap_atomic(bitmap->storage.sb_page);
ec0cc226
N
485 pr_debug("%s: bitmap file superblock:\n", bmname(bitmap));
486 pr_debug(" magic: %08x\n", le32_to_cpu(sb->magic));
487 pr_debug(" version: %d\n", le32_to_cpu(sb->version));
488 pr_debug(" uuid: %08x.%08x.%08x.%08x\n",
4179bc30
KK
489 le32_to_cpu(*(__u32 *)(sb->uuid+0)),
490 le32_to_cpu(*(__u32 *)(sb->uuid+4)),
491 le32_to_cpu(*(__u32 *)(sb->uuid+8)),
492 le32_to_cpu(*(__u32 *)(sb->uuid+12)));
ec0cc226
N
493 pr_debug(" events: %llu\n",
494 (unsigned long long) le64_to_cpu(sb->events));
495 pr_debug("events cleared: %llu\n",
496 (unsigned long long) le64_to_cpu(sb->events_cleared));
497 pr_debug(" state: %08x\n", le32_to_cpu(sb->state));
498 pr_debug(" chunksize: %d B\n", le32_to_cpu(sb->chunksize));
499 pr_debug(" daemon sleep: %ds\n", le32_to_cpu(sb->daemon_sleep));
500 pr_debug(" sync size: %llu KB\n",
501 (unsigned long long)le64_to_cpu(sb->sync_size)/2);
502 pr_debug("max write behind: %d\n", le32_to_cpu(sb->write_behind));
b2f46e68 503 kunmap_atomic(sb);
32a7627c
N
504}
505
9c81075f
JB
506/*
507 * bitmap_new_disk_sb
508 * @bitmap
509 *
510 * This function is somewhat the reverse of bitmap_read_sb. bitmap_read_sb
511 * reads and verifies the on-disk bitmap superblock and populates bitmap_info.
512 * This function verifies 'bitmap_info' and populates the on-disk bitmap
513 * structure, which is to be written to disk.
514 *
515 * Returns: 0 on success, -Exxx on error
516 */
517static int bitmap_new_disk_sb(struct bitmap *bitmap)
518{
519 bitmap_super_t *sb;
520 unsigned long chunksize, daemon_sleep, write_behind;
9c81075f 521
d3b178ad 522 bitmap->storage.sb_page = alloc_page(GFP_KERNEL | __GFP_ZERO);
582e2e05
JM
523 if (bitmap->storage.sb_page == NULL)
524 return -ENOMEM;
1ec885cd 525 bitmap->storage.sb_page->index = 0;
9c81075f 526
1ec885cd 527 sb = kmap_atomic(bitmap->storage.sb_page);
9c81075f
JB
528
529 sb->magic = cpu_to_le32(BITMAP_MAGIC);
530 sb->version = cpu_to_le32(BITMAP_MAJOR_HI);
531
532 chunksize = bitmap->mddev->bitmap_info.chunksize;
533 BUG_ON(!chunksize);
534 if (!is_power_of_2(chunksize)) {
b2f46e68 535 kunmap_atomic(sb);
ec0cc226 536 pr_warn("bitmap chunksize not a power of 2\n");
9c81075f
JB
537 return -EINVAL;
538 }
539 sb->chunksize = cpu_to_le32(chunksize);
540
541 daemon_sleep = bitmap->mddev->bitmap_info.daemon_sleep;
c97e0602 542 if (!daemon_sleep || (daemon_sleep > MAX_SCHEDULE_TIMEOUT)) {
ec0cc226 543 pr_debug("Choosing daemon_sleep default (5 sec)\n");
9c81075f
JB
544 daemon_sleep = 5 * HZ;
545 }
546 sb->daemon_sleep = cpu_to_le32(daemon_sleep);
547 bitmap->mddev->bitmap_info.daemon_sleep = daemon_sleep;
548
549 /*
550 * FIXME: write_behind for RAID1. If not specified, what
551 * is a good choice? We choose COUNTER_MAX / 2 arbitrarily.
552 */
553 write_behind = bitmap->mddev->bitmap_info.max_write_behind;
554 if (write_behind > COUNTER_MAX)
555 write_behind = COUNTER_MAX / 2;
556 sb->write_behind = cpu_to_le32(write_behind);
557 bitmap->mddev->bitmap_info.max_write_behind = write_behind;
558
559 /* keep the array size field of the bitmap superblock up to date */
560 sb->sync_size = cpu_to_le64(bitmap->mddev->resync_max_sectors);
561
562 memcpy(sb->uuid, bitmap->mddev->uuid, 16);
563
b405fe91 564 set_bit(BITMAP_STALE, &bitmap->flags);
84e92345 565 sb->state = cpu_to_le32(bitmap->flags);
9c81075f
JB
566 bitmap->events_cleared = bitmap->mddev->events;
567 sb->events_cleared = cpu_to_le64(bitmap->mddev->events);
d3b178ad 568 bitmap->mddev->bitmap_info.nodes = 0;
9c81075f 569
b2f46e68 570 kunmap_atomic(sb);
9c81075f
JB
571
572 return 0;
573}
574
32a7627c
N
575/* read the superblock from the bitmap file and initialize some bitmap fields */
576static int bitmap_read_sb(struct bitmap *bitmap)
577{
578 char *reason = NULL;
579 bitmap_super_t *sb;
4b6d287f 580 unsigned long chunksize, daemon_sleep, write_behind;
32a7627c 581 unsigned long long events;
c4ce867f 582 int nodes = 0;
1dff2b87 583 unsigned long sectors_reserved = 0;
32a7627c 584 int err = -EINVAL;
27581e5a 585 struct page *sb_page;
33e38ac6 586 loff_t offset = bitmap->mddev->bitmap_info.offset;
32a7627c 587
1ec885cd 588 if (!bitmap->storage.file && !bitmap->mddev->bitmap_info.offset) {
ef99bf48
N
589 chunksize = 128 * 1024 * 1024;
590 daemon_sleep = 5 * HZ;
591 write_behind = 0;
b405fe91 592 set_bit(BITMAP_STALE, &bitmap->flags);
ef99bf48
N
593 err = 0;
594 goto out_no_sb;
595 }
32a7627c 596 /* page 0 is the superblock, read it... */
27581e5a
N
597 sb_page = alloc_page(GFP_KERNEL);
598 if (!sb_page)
599 return -ENOMEM;
1ec885cd 600 bitmap->storage.sb_page = sb_page;
27581e5a 601
b97e9257 602re_read:
f9209a32
GR
603 /* If cluster_slot is set, the cluster is setup */
604 if (bitmap->cluster_slot >= 0) {
3b0e6aac 605 sector_t bm_blocks = bitmap->mddev->resync_max_sectors;
f9209a32 606
3b0e6aac
SR
607 sector_div(bm_blocks,
608 bitmap->mddev->bitmap_info.chunksize >> 9);
124eb761
GR
609 /* bits to bytes */
610 bm_blocks = ((bm_blocks+7) >> 3) + sizeof(bitmap_super_t);
611 /* to 4k blocks */
935f3d4f 612 bm_blocks = DIV_ROUND_UP_SECTOR_T(bm_blocks, 4096);
33e38ac6 613 offset = bitmap->mddev->bitmap_info.offset + (bitmap->cluster_slot * (bm_blocks << 3));
ec0cc226 614 pr_debug("%s:%d bm slot: %d offset: %llu\n", __func__, __LINE__,
33e38ac6 615 bitmap->cluster_slot, offset);
f9209a32
GR
616 }
617
1ec885cd
N
618 if (bitmap->storage.file) {
619 loff_t isize = i_size_read(bitmap->storage.file->f_mapping->host);
f49d5e62
N
620 int bytes = isize > PAGE_SIZE ? PAGE_SIZE : isize;
621
1ec885cd 622 err = read_page(bitmap->storage.file, 0,
27581e5a 623 bitmap, bytes, sb_page);
f49d5e62 624 } else {
27581e5a 625 err = read_sb_page(bitmap->mddev,
33e38ac6 626 offset,
27581e5a
N
627 sb_page,
628 0, sizeof(bitmap_super_t));
a654b9d8 629 }
27581e5a 630 if (err)
32a7627c 631 return err;
32a7627c 632
b97e9257 633 err = -EINVAL;
27581e5a 634 sb = kmap_atomic(sb_page);
32a7627c 635
32a7627c 636 chunksize = le32_to_cpu(sb->chunksize);
1b04be96 637 daemon_sleep = le32_to_cpu(sb->daemon_sleep) * HZ;
4b6d287f 638 write_behind = le32_to_cpu(sb->write_behind);
1dff2b87 639 sectors_reserved = le32_to_cpu(sb->sectors_reserved);
3c462c88
GR
640 /* Setup nodes/clustername only if bitmap version is
641 * cluster-compatible
d3b178ad 642 */
3c462c88 643 if (sb->version == cpu_to_le32(BITMAP_MAJOR_CLUSTERED)) {
d3b178ad
GR
644 nodes = le32_to_cpu(sb->nodes);
645 strlcpy(bitmap->mddev->bitmap_info.cluster_name,
646 sb->cluster_name, 64);
647 }
32a7627c
N
648
649 /* verify that the bitmap-specific fields are valid */
650 if (sb->magic != cpu_to_le32(BITMAP_MAGIC))
651 reason = "bad magic";
bd926c63 652 else if (le32_to_cpu(sb->version) < BITMAP_MAJOR_LO ||
3c462c88 653 le32_to_cpu(sb->version) > BITMAP_MAJOR_CLUSTERED)
32a7627c 654 reason = "unrecognized superblock version";
1187cf0a 655 else if (chunksize < 512)
7dd5d34c 656 reason = "bitmap chunksize too small";
d744540c 657 else if (!is_power_of_2(chunksize))
32a7627c 658 reason = "bitmap chunksize not a power of 2";
1b04be96 659 else if (daemon_sleep < 1 || daemon_sleep > MAX_SCHEDULE_TIMEOUT)
7dd5d34c 660 reason = "daemon sleep period out of range";
4b6d287f
N
661 else if (write_behind > COUNTER_MAX)
662 reason = "write-behind limit out of range (0 - 16383)";
32a7627c 663 if (reason) {
ec0cc226 664 pr_warn("%s: invalid bitmap file superblock: %s\n",
32a7627c
N
665 bmname(bitmap), reason);
666 goto out;
667 }
668
669 /* keep the array size field of the bitmap superblock up to date */
670 sb->sync_size = cpu_to_le64(bitmap->mddev->resync_max_sectors);
671
278c1ca2
N
672 if (bitmap->mddev->persistent) {
673 /*
674 * We have a persistent array superblock, so compare the
675 * bitmap's UUID and event counter to the mddev's
676 */
677 if (memcmp(sb->uuid, bitmap->mddev->uuid, 16)) {
ec0cc226
N
678 pr_warn("%s: bitmap superblock UUID mismatch\n",
679 bmname(bitmap));
278c1ca2
N
680 goto out;
681 }
682 events = le64_to_cpu(sb->events);
b97e9257 683 if (!nodes && (events < bitmap->mddev->events)) {
ec0cc226
N
684 pr_warn("%s: bitmap file is out of date (%llu < %llu) -- forcing full recovery\n",
685 bmname(bitmap), events,
686 (unsigned long long) bitmap->mddev->events);
b405fe91 687 set_bit(BITMAP_STALE, &bitmap->flags);
278c1ca2 688 }
32a7627c 689 }
278c1ca2 690
32a7627c 691 /* assign fields using values from superblock */
4f2e639a 692 bitmap->flags |= le32_to_cpu(sb->state);
bd926c63 693 if (le32_to_cpu(sb->version) == BITMAP_MAJOR_HOSTENDIAN)
b405fe91 694 set_bit(BITMAP_HOSTENDIAN, &bitmap->flags);
32a7627c 695 bitmap->events_cleared = le64_to_cpu(sb->events_cleared);
cf921cc1 696 strlcpy(bitmap->mddev->bitmap_info.cluster_name, sb->cluster_name, 64);
32a7627c 697 err = 0;
b97e9257 698
32a7627c 699out:
b2f46e68 700 kunmap_atomic(sb);
3560741e 701 /* Assigning chunksize is required for "re_read" */
f9209a32 702 bitmap->mddev->bitmap_info.chunksize = chunksize;
f7357273 703 if (err == 0 && nodes && (bitmap->cluster_slot < 0)) {
b97e9257
GR
704 err = md_setup_cluster(bitmap->mddev, nodes);
705 if (err) {
ec0cc226
N
706 pr_warn("%s: Could not setup cluster service (%d)\n",
707 bmname(bitmap), err);
b97e9257
GR
708 goto out_no_sb;
709 }
710 bitmap->cluster_slot = md_cluster_ops->slot_number(bitmap->mddev);
b97e9257
GR
711 goto re_read;
712 }
713
714
ef99bf48 715out_no_sb:
b405fe91 716 if (test_bit(BITMAP_STALE, &bitmap->flags))
ef99bf48
N
717 bitmap->events_cleared = bitmap->mddev->events;
718 bitmap->mddev->bitmap_info.chunksize = chunksize;
719 bitmap->mddev->bitmap_info.daemon_sleep = daemon_sleep;
720 bitmap->mddev->bitmap_info.max_write_behind = write_behind;
c4ce867f 721 bitmap->mddev->bitmap_info.nodes = nodes;
1dff2b87
N
722 if (bitmap->mddev->bitmap_info.space == 0 ||
723 bitmap->mddev->bitmap_info.space > sectors_reserved)
724 bitmap->mddev->bitmap_info.space = sectors_reserved;
b97e9257 725 if (err) {
32a7627c 726 bitmap_print_sb(bitmap);
f9209a32 727 if (bitmap->cluster_slot < 0)
b97e9257
GR
728 md_cluster_stop(bitmap->mddev);
729 }
32a7627c
N
730 return err;
731}
732
32a7627c
N
733/*
734 * general bitmap file operations
735 */
736
ece5cff0
N
737/*
738 * on-disk bitmap:
739 *
740 * Use one bit per "chunk" (block set). We do the disk I/O on the bitmap
741 * file a page at a time. There's a superblock at the start of the file.
742 */
32a7627c 743/* calculate the index of the page that contains this bit */
1ec885cd
N
744static inline unsigned long file_page_index(struct bitmap_storage *store,
745 unsigned long chunk)
32a7627c 746{
1ec885cd 747 if (store->sb_page)
ece5cff0
N
748 chunk += sizeof(bitmap_super_t) << 3;
749 return chunk >> PAGE_BIT_SHIFT;
32a7627c
N
750}
751
752/* calculate the (bit) offset of this bit within a page */
1ec885cd
N
753static inline unsigned long file_page_offset(struct bitmap_storage *store,
754 unsigned long chunk)
32a7627c 755{
1ec885cd 756 if (store->sb_page)
ece5cff0
N
757 chunk += sizeof(bitmap_super_t) << 3;
758 return chunk & (PAGE_BITS - 1);
32a7627c
N
759}
760
761/*
762 * return a pointer to the page in the filemap that contains the given bit
763 *
32a7627c 764 */
1ec885cd 765static inline struct page *filemap_get_page(struct bitmap_storage *store,
3520fa4d 766 unsigned long chunk)
32a7627c 767{
1ec885cd 768 if (file_page_index(store, chunk) >= store->file_pages)
ac2f40be 769 return NULL;
f2e06c58 770 return store->filemap[file_page_index(store, chunk)];
32a7627c
N
771}
772
d1244cb0 773static int bitmap_storage_alloc(struct bitmap_storage *store,
b97e9257
GR
774 unsigned long chunks, int with_super,
775 int slot_number)
d1244cb0 776{
b97e9257 777 int pnum, offset = 0;
d1244cb0
N
778 unsigned long num_pages;
779 unsigned long bytes;
780
781 bytes = DIV_ROUND_UP(chunks, 8);
782 if (with_super)
783 bytes += sizeof(bitmap_super_t);
784
785 num_pages = DIV_ROUND_UP(bytes, PAGE_SIZE);
7f86ffed 786 offset = slot_number * num_pages;
d1244cb0
N
787
788 store->filemap = kmalloc(sizeof(struct page *)
789 * num_pages, GFP_KERNEL);
790 if (!store->filemap)
791 return -ENOMEM;
792
793 if (with_super && !store->sb_page) {
d60b479d 794 store->sb_page = alloc_page(GFP_KERNEL|__GFP_ZERO);
d1244cb0
N
795 if (store->sb_page == NULL)
796 return -ENOMEM;
d1244cb0 797 }
b97e9257 798
d1244cb0
N
799 pnum = 0;
800 if (store->sb_page) {
801 store->filemap[0] = store->sb_page;
802 pnum = 1;
b97e9257 803 store->sb_page->index = offset;
d1244cb0 804 }
b97e9257 805
d1244cb0 806 for ( ; pnum < num_pages; pnum++) {
d60b479d 807 store->filemap[pnum] = alloc_page(GFP_KERNEL|__GFP_ZERO);
d1244cb0
N
808 if (!store->filemap[pnum]) {
809 store->file_pages = pnum;
810 return -ENOMEM;
811 }
b97e9257 812 store->filemap[pnum]->index = pnum + offset;
d1244cb0
N
813 }
814 store->file_pages = pnum;
815
816 /* We need 4 bits per page, rounded up to a multiple
817 * of sizeof(unsigned long) */
818 store->filemap_attr = kzalloc(
819 roundup(DIV_ROUND_UP(num_pages*4, 8), sizeof(unsigned long)),
820 GFP_KERNEL);
821 if (!store->filemap_attr)
822 return -ENOMEM;
823
824 store->bytes = bytes;
825
826 return 0;
827}
828
fae7d326 829static void bitmap_file_unmap(struct bitmap_storage *store)
32a7627c
N
830{
831 struct page **map, *sb_page;
32a7627c 832 int pages;
fae7d326 833 struct file *file;
32a7627c 834
fae7d326 835 file = store->file;
1ec885cd 836 map = store->filemap;
1ec885cd 837 pages = store->file_pages;
1ec885cd 838 sb_page = store->sb_page;
32a7627c
N
839
840 while (pages--)
ece5cff0 841 if (map[pages] != sb_page) /* 0 is sb_page, release it below */
d785a06a 842 free_buffers(map[pages]);
32a7627c 843 kfree(map);
fae7d326 844 kfree(store->filemap_attr);
32a7627c 845
d785a06a
N
846 if (sb_page)
847 free_buffers(sb_page);
32a7627c 848
d785a06a 849 if (file) {
496ad9aa 850 struct inode *inode = file_inode(file);
fc0ecff6 851 invalidate_mapping_pages(inode->i_mapping, 0, -1);
32a7627c 852 fput(file);
d785a06a 853 }
32a7627c
N
854}
855
32a7627c
N
856/*
857 * bitmap_file_kick - if an error occurs while manipulating the bitmap file
858 * then it is no longer reliable, so we stop using it and we mark the file
859 * as failed in the superblock
860 */
861static void bitmap_file_kick(struct bitmap *bitmap)
862{
863 char *path, *ptr = NULL;
864
b405fe91 865 if (!test_and_set_bit(BITMAP_STALE, &bitmap->flags)) {
4ad13663 866 bitmap_update_sb(bitmap);
32a7627c 867
1ec885cd 868 if (bitmap->storage.file) {
4ad13663
N
869 path = kmalloc(PAGE_SIZE, GFP_KERNEL);
870 if (path)
9bf39ab2 871 ptr = file_path(bitmap->storage.file,
1ec885cd 872 path, PAGE_SIZE);
6bcfd601 873
ec0cc226
N
874 pr_warn("%s: kicking failed bitmap file %s from array!\n",
875 bmname(bitmap), IS_ERR(ptr) ? "" : ptr);
32a7627c 876
4ad13663
N
877 kfree(path);
878 } else
ec0cc226
N
879 pr_warn("%s: disabling internal bitmap due to errors\n",
880 bmname(bitmap));
a654b9d8 881 }
32a7627c
N
882}
883
884enum bitmap_page_attr {
ac2f40be 885 BITMAP_PAGE_DIRTY = 0, /* there are set bits that need to be synced */
5a537df4
N
886 BITMAP_PAGE_PENDING = 1, /* there are bits that are being cleaned.
887 * i.e. counter is 1 or 2. */
ac2f40be 888 BITMAP_PAGE_NEEDWRITE = 2, /* there are cleared bits that need to be synced */
32a7627c
N
889};
890
d189122d
N
891static inline void set_page_attr(struct bitmap *bitmap, int pnum,
892 enum bitmap_page_attr attr)
32a7627c 893{
bdfd1140 894 set_bit((pnum<<2) + attr, bitmap->storage.filemap_attr);
32a7627c
N
895}
896
d189122d
N
897static inline void clear_page_attr(struct bitmap *bitmap, int pnum,
898 enum bitmap_page_attr attr)
32a7627c 899{
bdfd1140 900 clear_bit((pnum<<2) + attr, bitmap->storage.filemap_attr);
32a7627c
N
901}
902
bdfd1140
N
903static inline int test_page_attr(struct bitmap *bitmap, int pnum,
904 enum bitmap_page_attr attr)
32a7627c 905{
1ec885cd 906 return test_bit((pnum<<2) + attr, bitmap->storage.filemap_attr);
32a7627c
N
907}
908
bdfd1140
N
909static inline int test_and_clear_page_attr(struct bitmap *bitmap, int pnum,
910 enum bitmap_page_attr attr)
911{
912 return test_and_clear_bit((pnum<<2) + attr,
913 bitmap->storage.filemap_attr);
914}
32a7627c
N
915/*
916 * bitmap_file_set_bit -- called before performing a write to the md device
917 * to set (and eventually sync) a particular bit in the bitmap file
918 *
919 * we set the bit immediately, then we record the page number so that
920 * when an unplug occurs, we can flush the dirty pages out to disk
921 */
922static void bitmap_file_set_bit(struct bitmap *bitmap, sector_t block)
923{
924 unsigned long bit;
3520fa4d 925 struct page *page;
32a7627c 926 void *kaddr;
40cffcc0 927 unsigned long chunk = block >> bitmap->counts.chunkshift;
23cea66a
GJ
928 struct bitmap_storage *store = &bitmap->storage;
929 unsigned long node_offset = 0;
930
931 if (mddev_is_clustered(bitmap->mddev))
932 node_offset = bitmap->cluster_slot * store->file_pages;
32a7627c 933
1ec885cd 934 page = filemap_get_page(&bitmap->storage, chunk);
3520fa4d
JB
935 if (!page)
936 return;
1ec885cd 937 bit = file_page_offset(&bitmap->storage, chunk);
32a7627c 938
3520fa4d 939 /* set the bit */
b2f46e68 940 kaddr = kmap_atomic(page);
b405fe91 941 if (test_bit(BITMAP_HOSTENDIAN, &bitmap->flags))
3520fa4d
JB
942 set_bit(bit, kaddr);
943 else
3f810b6c 944 set_bit_le(bit, kaddr);
b2f46e68 945 kunmap_atomic(kaddr);
36a4e1fe 946 pr_debug("set file bit %lu page %lu\n", bit, page->index);
32a7627c 947 /* record page number so it gets flushed to disk when unplug occurs */
23cea66a 948 set_page_attr(bitmap, page->index - node_offset, BITMAP_PAGE_DIRTY);
32a7627c
N
949}
950
ef99bf48
N
951static void bitmap_file_clear_bit(struct bitmap *bitmap, sector_t block)
952{
953 unsigned long bit;
954 struct page *page;
955 void *paddr;
40cffcc0 956 unsigned long chunk = block >> bitmap->counts.chunkshift;
23cea66a
GJ
957 struct bitmap_storage *store = &bitmap->storage;
958 unsigned long node_offset = 0;
959
960 if (mddev_is_clustered(bitmap->mddev))
961 node_offset = bitmap->cluster_slot * store->file_pages;
ef99bf48 962
1ec885cd 963 page = filemap_get_page(&bitmap->storage, chunk);
ef99bf48
N
964 if (!page)
965 return;
1ec885cd 966 bit = file_page_offset(&bitmap->storage, chunk);
ef99bf48 967 paddr = kmap_atomic(page);
b405fe91 968 if (test_bit(BITMAP_HOSTENDIAN, &bitmap->flags))
ef99bf48
N
969 clear_bit(bit, paddr);
970 else
3f810b6c 971 clear_bit_le(bit, paddr);
ef99bf48 972 kunmap_atomic(paddr);
23cea66a
GJ
973 if (!test_page_attr(bitmap, page->index - node_offset, BITMAP_PAGE_NEEDWRITE)) {
974 set_page_attr(bitmap, page->index - node_offset, BITMAP_PAGE_PENDING);
ef99bf48
N
975 bitmap->allclean = 0;
976 }
977}
978
11dd35da
GR
979static int bitmap_file_test_bit(struct bitmap *bitmap, sector_t block)
980{
981 unsigned long bit;
982 struct page *page;
983 void *paddr;
984 unsigned long chunk = block >> bitmap->counts.chunkshift;
985 int set = 0;
986
987 page = filemap_get_page(&bitmap->storage, chunk);
988 if (!page)
989 return -EINVAL;
990 bit = file_page_offset(&bitmap->storage, chunk);
991 paddr = kmap_atomic(page);
992 if (test_bit(BITMAP_HOSTENDIAN, &bitmap->flags))
993 set = test_bit(bit, paddr);
994 else
995 set = test_bit_le(bit, paddr);
996 kunmap_atomic(paddr);
997 return set;
998}
999
1000
32a7627c
N
1001/* this gets called when the md device is ready to unplug its underlying
1002 * (slave) device queues -- before we let any writes go down, we need to
1003 * sync the dirty pages of the bitmap file to disk */
4ad13663 1004void bitmap_unplug(struct bitmap *bitmap)
32a7627c 1005{
74667123 1006 unsigned long i;
ec7a3197 1007 int dirty, need_write;
85c9ccd4 1008 int writing = 0;
32a7627c 1009
62f82faa
N
1010 if (!bitmap || !bitmap->storage.filemap ||
1011 test_bit(BITMAP_STALE, &bitmap->flags))
4ad13663 1012 return;
32a7627c
N
1013
1014 /* look at each page to see if there are any set bits that need to be
1015 * flushed out to disk */
1ec885cd 1016 for (i = 0; i < bitmap->storage.file_pages; i++) {
bdfd1140 1017 if (!bitmap->storage.filemap)
4ad13663 1018 return;
bdfd1140
N
1019 dirty = test_and_clear_page_attr(bitmap, i, BITMAP_PAGE_DIRTY);
1020 need_write = test_and_clear_page_attr(bitmap, i,
1021 BITMAP_PAGE_NEEDWRITE);
1022 if (dirty || need_write) {
581dbd94 1023 if (!writing) {
85c9ccd4 1024 bitmap_wait_writes(bitmap);
581dbd94
N
1025 if (bitmap->mddev->queue)
1026 blk_add_trace_msg(bitmap->mddev->queue,
1027 "md bitmap_unplug");
1028 }
d189122d 1029 clear_page_attr(bitmap, i, BITMAP_PAGE_PENDING);
bdfd1140 1030 write_page(bitmap, bitmap->storage.filemap[i], 0);
85c9ccd4 1031 writing = 1;
bdfd1140 1032 }
32a7627c 1033 }
85c9ccd4
N
1034 if (writing)
1035 bitmap_wait_writes(bitmap);
4b5060dd 1036
b405fe91 1037 if (test_bit(BITMAP_WRITE_ERROR, &bitmap->flags))
d785a06a 1038 bitmap_file_kick(bitmap);
32a7627c 1039}
ac2f40be 1040EXPORT_SYMBOL(bitmap_unplug);
32a7627c 1041
6a07997f 1042static void bitmap_set_memory_bits(struct bitmap *bitmap, sector_t offset, int needed);
32a7627c
N
1043/* * bitmap_init_from_disk -- called at bitmap_create time to initialize
1044 * the in-memory bitmap from the on-disk bitmap -- also, sets up the
1045 * memory mapping of the bitmap file
1046 * Special cases:
1047 * if there's no bitmap file, or if the bitmap file had been
1048 * previously kicked from the array, we mark all the bits as
1049 * 1's in order to cause a full resync.
6a07997f
N
1050 *
1051 * We ignore all bits for sectors that end earlier than 'start'.
1052 * This is used when reading an out-of-date bitmap...
32a7627c 1053 */
6a07997f 1054static int bitmap_init_from_disk(struct bitmap *bitmap, sector_t start)
32a7627c 1055{
b97e9257 1056 unsigned long i, chunks, index, oldindex, bit, node_offset = 0;
27581e5a 1057 struct page *page = NULL;
d1244cb0 1058 unsigned long bit_cnt = 0;
32a7627c 1059 struct file *file;
d1244cb0 1060 unsigned long offset;
32a7627c
N
1061 int outofdate;
1062 int ret = -ENOSPC;
ea03aff9 1063 void *paddr;
1ec885cd 1064 struct bitmap_storage *store = &bitmap->storage;
32a7627c 1065
40cffcc0 1066 chunks = bitmap->counts.chunks;
1ec885cd 1067 file = store->file;
32a7627c 1068
ef99bf48
N
1069 if (!file && !bitmap->mddev->bitmap_info.offset) {
1070 /* No permanent bitmap - fill with '1s'. */
1ec885cd
N
1071 store->filemap = NULL;
1072 store->file_pages = 0;
ef99bf48
N
1073 for (i = 0; i < chunks ; i++) {
1074 /* if the disk bit is set, set the memory bit */
40cffcc0 1075 int needed = ((sector_t)(i+1) << (bitmap->counts.chunkshift)
ef99bf48
N
1076 >= start);
1077 bitmap_set_memory_bits(bitmap,
40cffcc0 1078 (sector_t)i << bitmap->counts.chunkshift,
ef99bf48
N
1079 needed);
1080 }
1081 return 0;
1082 }
32a7627c 1083
b405fe91 1084 outofdate = test_bit(BITMAP_STALE, &bitmap->flags);
32a7627c 1085 if (outofdate)
ec0cc226 1086 pr_warn("%s: bitmap file is out of date, doing full recovery\n", bmname(bitmap));
32a7627c 1087
d1244cb0 1088 if (file && i_size_read(file->f_mapping->host) < store->bytes) {
ec0cc226
N
1089 pr_warn("%s: bitmap file too short %lu < %lu\n",
1090 bmname(bitmap),
1091 (unsigned long) i_size_read(file->f_mapping->host),
1092 store->bytes);
4ad13663 1093 goto err;
32a7627c 1094 }
bc7f77de 1095
d1244cb0 1096 oldindex = ~0L;
27581e5a 1097 offset = 0;
d1244cb0 1098 if (!bitmap->mddev->bitmap_info.external)
27581e5a 1099 offset = sizeof(bitmap_super_t);
32a7627c 1100
b97e9257
GR
1101 if (mddev_is_clustered(bitmap->mddev))
1102 node_offset = bitmap->cluster_slot * (DIV_ROUND_UP(store->bytes, PAGE_SIZE));
1103
32a7627c 1104 for (i = 0; i < chunks; i++) {
bd926c63 1105 int b;
1ec885cd
N
1106 index = file_page_index(&bitmap->storage, i);
1107 bit = file_page_offset(&bitmap->storage, i);
32a7627c 1108 if (index != oldindex) { /* this is a new page, read it in */
d785a06a 1109 int count;
32a7627c 1110 /* unmap the old page, we're done with it */
d1244cb0
N
1111 if (index == store->file_pages-1)
1112 count = store->bytes - index * PAGE_SIZE;
d785a06a
N
1113 else
1114 count = PAGE_SIZE;
1ec885cd 1115 page = store->filemap[index];
27581e5a
N
1116 if (file)
1117 ret = read_page(file, index, bitmap,
1118 count, page);
1119 else
1120 ret = read_sb_page(
1121 bitmap->mddev,
1122 bitmap->mddev->bitmap_info.offset,
1123 page,
b97e9257 1124 index + node_offset, count);
27581e5a
N
1125
1126 if (ret)
4ad13663 1127 goto err;
a654b9d8 1128
32a7627c 1129 oldindex = index;
32a7627c
N
1130
1131 if (outofdate) {
1132 /*
1133 * if bitmap is out of date, dirty the
ac2f40be 1134 * whole page and write it out
32a7627c 1135 */
b2f46e68 1136 paddr = kmap_atomic(page);
ea03aff9 1137 memset(paddr + offset, 0xff,
6a07997f 1138 PAGE_SIZE - offset);
b2f46e68 1139 kunmap_atomic(paddr);
4ad13663
N
1140 write_page(bitmap, page, 1);
1141
1142 ret = -EIO;
b405fe91
N
1143 if (test_bit(BITMAP_WRITE_ERROR,
1144 &bitmap->flags))
4ad13663 1145 goto err;
32a7627c 1146 }
32a7627c 1147 }
b2f46e68 1148 paddr = kmap_atomic(page);
b405fe91 1149 if (test_bit(BITMAP_HOSTENDIAN, &bitmap->flags))
ea03aff9 1150 b = test_bit(bit, paddr);
bd926c63 1151 else
6b33aff3 1152 b = test_bit_le(bit, paddr);
b2f46e68 1153 kunmap_atomic(paddr);
bd926c63 1154 if (b) {
32a7627c 1155 /* if the disk bit is set, set the memory bit */
40cffcc0 1156 int needed = ((sector_t)(i+1) << bitmap->counts.chunkshift
db305e50
N
1157 >= start);
1158 bitmap_set_memory_bits(bitmap,
40cffcc0 1159 (sector_t)i << bitmap->counts.chunkshift,
db305e50 1160 needed);
32a7627c
N
1161 bit_cnt++;
1162 }
27581e5a 1163 offset = 0;
32a7627c
N
1164 }
1165
ec0cc226
N
1166 pr_debug("%s: bitmap initialized from disk: read %lu pages, set %lu of %lu bits\n",
1167 bmname(bitmap), store->file_pages,
1168 bit_cnt, chunks);
4ad13663
N
1169
1170 return 0;
32a7627c 1171
4ad13663 1172 err:
ec0cc226
N
1173 pr_warn("%s: bitmap initialisation failed: %d\n",
1174 bmname(bitmap), ret);
32a7627c
N
1175 return ret;
1176}
1177
a654b9d8
N
1178void bitmap_write_all(struct bitmap *bitmap)
1179{
1180 /* We don't actually write all bitmap blocks here,
1181 * just flag them as needing to be written
1182 */
ec7a3197 1183 int i;
a654b9d8 1184
1ec885cd 1185 if (!bitmap || !bitmap->storage.filemap)
ef99bf48 1186 return;
1ec885cd 1187 if (bitmap->storage.file)
ef99bf48
N
1188 /* Only one copy, so nothing needed */
1189 return;
1190
1ec885cd 1191 for (i = 0; i < bitmap->storage.file_pages; i++)
d189122d 1192 set_page_attr(bitmap, i,
ec7a3197 1193 BITMAP_PAGE_NEEDWRITE);
2585f3ef 1194 bitmap->allclean = 0;
a654b9d8
N
1195}
1196
40cffcc0
N
1197static void bitmap_count_page(struct bitmap_counts *bitmap,
1198 sector_t offset, int inc)
32a7627c 1199{
61a0d80c 1200 sector_t chunk = offset >> bitmap->chunkshift;
32a7627c
N
1201 unsigned long page = chunk >> PAGE_COUNTER_SHIFT;
1202 bitmap->bp[page].count += inc;
32a7627c
N
1203 bitmap_checkfree(bitmap, page);
1204}
bf07bb7d 1205
40cffcc0 1206static void bitmap_set_pending(struct bitmap_counts *bitmap, sector_t offset)
bf07bb7d
N
1207{
1208 sector_t chunk = offset >> bitmap->chunkshift;
1209 unsigned long page = chunk >> PAGE_COUNTER_SHIFT;
1210 struct bitmap_page *bp = &bitmap->bp[page];
1211
1212 if (!bp->pending)
1213 bp->pending = 1;
1214}
1215
40cffcc0 1216static bitmap_counter_t *bitmap_get_counter(struct bitmap_counts *bitmap,
57dab0bd 1217 sector_t offset, sector_t *blocks,
32a7627c
N
1218 int create);
1219
1220/*
1221 * bitmap daemon -- periodically wakes up to clean bits and flush pages
1222 * out to disk
1223 */
1224
fd01b88c 1225void bitmap_daemon_work(struct mddev *mddev)
32a7627c 1226{
aa5cbd10 1227 struct bitmap *bitmap;
aa3163f8 1228 unsigned long j;
bf07bb7d 1229 unsigned long nextpage;
57dab0bd 1230 sector_t blocks;
40cffcc0 1231 struct bitmap_counts *counts;
32a7627c 1232
aa5cbd10
N
1233 /* Use a mutex to guard daemon_work against
1234 * bitmap_destroy.
1235 */
c3d9714e 1236 mutex_lock(&mddev->bitmap_info.mutex);
aa5cbd10
N
1237 bitmap = mddev->bitmap;
1238 if (bitmap == NULL) {
c3d9714e 1239 mutex_unlock(&mddev->bitmap_info.mutex);
4ad13663 1240 return;
aa5cbd10 1241 }
42a04b50 1242 if (time_before(jiffies, bitmap->daemon_lastrun
2e61ebbc 1243 + mddev->bitmap_info.daemon_sleep))
7be3dfec
N
1244 goto done;
1245
32a7627c 1246 bitmap->daemon_lastrun = jiffies;
8311c29d 1247 if (bitmap->allclean) {
2e61ebbc 1248 mddev->thread->timeout = MAX_SCHEDULE_TIMEOUT;
aa5cbd10 1249 goto done;
8311c29d
N
1250 }
1251 bitmap->allclean = 1;
32a7627c 1252
581dbd94
N
1253 if (bitmap->mddev->queue)
1254 blk_add_trace_msg(bitmap->mddev->queue,
1255 "md bitmap_daemon_work");
1256
bf07bb7d
N
1257 /* Any file-page which is PENDING now needs to be written.
1258 * So set NEEDWRITE now, then after we make any last-minute changes
1259 * we will write it.
1260 */
1ec885cd 1261 for (j = 0; j < bitmap->storage.file_pages; j++)
bdfd1140
N
1262 if (test_and_clear_page_attr(bitmap, j,
1263 BITMAP_PAGE_PENDING))
d189122d 1264 set_page_attr(bitmap, j,
bf07bb7d 1265 BITMAP_PAGE_NEEDWRITE);
bf07bb7d
N
1266
1267 if (bitmap->need_sync &&
1268 mddev->bitmap_info.external == 0) {
1269 /* Arrange for superblock update as well as
1270 * other changes */
1271 bitmap_super_t *sb;
1272 bitmap->need_sync = 0;
1ec885cd
N
1273 if (bitmap->storage.filemap) {
1274 sb = kmap_atomic(bitmap->storage.sb_page);
ef99bf48
N
1275 sb->events_cleared =
1276 cpu_to_le64(bitmap->events_cleared);
1277 kunmap_atomic(sb);
d189122d 1278 set_page_attr(bitmap, 0,
ef99bf48
N
1279 BITMAP_PAGE_NEEDWRITE);
1280 }
bf07bb7d
N
1281 }
1282 /* Now look at the bitmap counters and if any are '2' or '1',
1283 * decrement and handle accordingly.
1284 */
40cffcc0
N
1285 counts = &bitmap->counts;
1286 spin_lock_irq(&counts->lock);
bf07bb7d 1287 nextpage = 0;
40cffcc0 1288 for (j = 0; j < counts->chunks; j++) {
32a7627c 1289 bitmap_counter_t *bmc;
40cffcc0 1290 sector_t block = (sector_t)j << counts->chunkshift;
3520fa4d 1291
bf07bb7d
N
1292 if (j == nextpage) {
1293 nextpage += PAGE_COUNTER_RATIO;
40cffcc0 1294 if (!counts->bp[j >> PAGE_COUNTER_SHIFT].pending) {
bf07bb7d 1295 j |= PAGE_COUNTER_MASK;
aa3163f8
N
1296 continue;
1297 }
40cffcc0 1298 counts->bp[j >> PAGE_COUNTER_SHIFT].pending = 0;
32a7627c 1299 }
40cffcc0 1300 bmc = bitmap_get_counter(counts,
ef99bf48 1301 block,
db305e50 1302 &blocks, 0);
bf07bb7d
N
1303
1304 if (!bmc) {
5a537df4 1305 j |= PAGE_COUNTER_MASK;
bf07bb7d
N
1306 continue;
1307 }
1308 if (*bmc == 1 && !bitmap->need_sync) {
1309 /* We can clear the bit */
bf07bb7d 1310 *bmc = 0;
40cffcc0 1311 bitmap_count_page(counts, block, -1);
ef99bf48 1312 bitmap_file_clear_bit(bitmap, block);
bf07bb7d
N
1313 } else if (*bmc && *bmc <= 2) {
1314 *bmc = 1;
40cffcc0 1315 bitmap_set_pending(counts, block);
bf07bb7d 1316 bitmap->allclean = 0;
5a537df4 1317 }
32a7627c 1318 }
40cffcc0 1319 spin_unlock_irq(&counts->lock);
32a7627c 1320
85c9ccd4 1321 bitmap_wait_writes(bitmap);
bf07bb7d
N
1322 /* Now start writeout on any page in NEEDWRITE that isn't DIRTY.
1323 * DIRTY pages need to be written by bitmap_unplug so it can wait
1324 * for them.
1325 * If we find any DIRTY page we stop there and let bitmap_unplug
1326 * handle all the rest. This is important in the case where
1327 * the first blocking holds the superblock and it has been updated.
1328 * We mustn't write any other blocks before the superblock.
1329 */
62f82faa
N
1330 for (j = 0;
1331 j < bitmap->storage.file_pages
1332 && !test_bit(BITMAP_STALE, &bitmap->flags);
1333 j++) {
d189122d 1334 if (test_page_attr(bitmap, j,
bf07bb7d
N
1335 BITMAP_PAGE_DIRTY))
1336 /* bitmap_unplug will handle the rest */
1337 break;
bdfd1140
N
1338 if (test_and_clear_page_attr(bitmap, j,
1339 BITMAP_PAGE_NEEDWRITE)) {
1ec885cd 1340 write_page(bitmap, bitmap->storage.filemap[j], 0);
32a7627c 1341 }
32a7627c
N
1342 }
1343
7be3dfec 1344 done:
8311c29d 1345 if (bitmap->allclean == 0)
2e61ebbc
N
1346 mddev->thread->timeout =
1347 mddev->bitmap_info.daemon_sleep;
c3d9714e 1348 mutex_unlock(&mddev->bitmap_info.mutex);
32a7627c
N
1349}
1350
40cffcc0 1351static bitmap_counter_t *bitmap_get_counter(struct bitmap_counts *bitmap,
57dab0bd 1352 sector_t offset, sector_t *blocks,
32a7627c 1353 int create)
ee305ace
N
1354__releases(bitmap->lock)
1355__acquires(bitmap->lock)
32a7627c
N
1356{
1357 /* If 'create', we might release the lock and reclaim it.
1358 * The lock must have been taken with interrupts enabled.
1359 * If !create, we don't release the lock.
1360 */
61a0d80c 1361 sector_t chunk = offset >> bitmap->chunkshift;
32a7627c
N
1362 unsigned long page = chunk >> PAGE_COUNTER_SHIFT;
1363 unsigned long pageoff = (chunk & PAGE_COUNTER_MASK) << COUNTER_BYTE_SHIFT;
1364 sector_t csize;
ef425673 1365 int err;
32a7627c 1366
c9d65032 1367 err = bitmap_checkpage(bitmap, page, create, 0);
ef425673
N
1368
1369 if (bitmap->bp[page].hijacked ||
1370 bitmap->bp[page].map == NULL)
61a0d80c 1371 csize = ((sector_t)1) << (bitmap->chunkshift +
ef425673
N
1372 PAGE_COUNTER_SHIFT - 1);
1373 else
61a0d80c 1374 csize = ((sector_t)1) << bitmap->chunkshift;
ef425673
N
1375 *blocks = csize - (offset & (csize - 1));
1376
1377 if (err < 0)
32a7627c 1378 return NULL;
ef425673 1379
32a7627c
N
1380 /* now locked ... */
1381
1382 if (bitmap->bp[page].hijacked) { /* hijacked pointer */
1383 /* should we use the first or second counter field
1384 * of the hijacked pointer? */
1385 int hi = (pageoff > PAGE_COUNTER_MASK);
32a7627c
N
1386 return &((bitmap_counter_t *)
1387 &bitmap->bp[page].map)[hi];
ef425673 1388 } else /* page is allocated */
32a7627c
N
1389 return (bitmap_counter_t *)
1390 &(bitmap->bp[page].map[pageoff]);
32a7627c
N
1391}
1392
4b6d287f 1393int bitmap_startwrite(struct bitmap *bitmap, sector_t offset, unsigned long sectors, int behind)
32a7627c 1394{
ac2f40be
N
1395 if (!bitmap)
1396 return 0;
4b6d287f
N
1397
1398 if (behind) {
696fcd53 1399 int bw;
4b6d287f 1400 atomic_inc(&bitmap->behind_writes);
696fcd53
PC
1401 bw = atomic_read(&bitmap->behind_writes);
1402 if (bw > bitmap->behind_writes_used)
1403 bitmap->behind_writes_used = bw;
1404
36a4e1fe
N
1405 pr_debug("inc write-behind count %d/%lu\n",
1406 bw, bitmap->mddev->bitmap_info.max_write_behind);
4b6d287f
N
1407 }
1408
32a7627c 1409 while (sectors) {
57dab0bd 1410 sector_t blocks;
32a7627c
N
1411 bitmap_counter_t *bmc;
1412
40cffcc0
N
1413 spin_lock_irq(&bitmap->counts.lock);
1414 bmc = bitmap_get_counter(&bitmap->counts, offset, &blocks, 1);
32a7627c 1415 if (!bmc) {
40cffcc0 1416 spin_unlock_irq(&bitmap->counts.lock);
32a7627c
N
1417 return 0;
1418 }
1419
27d5ea04 1420 if (unlikely(COUNTER(*bmc) == COUNTER_MAX)) {
da6e1a32
NB
1421 DEFINE_WAIT(__wait);
1422 /* note that it is safe to do the prepare_to_wait
1423 * after the test as long as we do it before dropping
1424 * the spinlock.
1425 */
1426 prepare_to_wait(&bitmap->overflow_wait, &__wait,
1427 TASK_UNINTERRUPTIBLE);
40cffcc0 1428 spin_unlock_irq(&bitmap->counts.lock);
f54a9d0e 1429 schedule();
da6e1a32
NB
1430 finish_wait(&bitmap->overflow_wait, &__wait);
1431 continue;
1432 }
1433
ac2f40be 1434 switch (*bmc) {
32a7627c
N
1435 case 0:
1436 bitmap_file_set_bit(bitmap, offset);
40cffcc0 1437 bitmap_count_page(&bitmap->counts, offset, 1);
32a7627c
N
1438 /* fall through */
1439 case 1:
1440 *bmc = 2;
1441 }
da6e1a32 1442
32a7627c
N
1443 (*bmc)++;
1444
40cffcc0 1445 spin_unlock_irq(&bitmap->counts.lock);
32a7627c
N
1446
1447 offset += blocks;
1448 if (sectors > blocks)
1449 sectors -= blocks;
ac2f40be
N
1450 else
1451 sectors = 0;
32a7627c
N
1452 }
1453 return 0;
1454}
ac2f40be 1455EXPORT_SYMBOL(bitmap_startwrite);
32a7627c
N
1456
1457void bitmap_endwrite(struct bitmap *bitmap, sector_t offset, unsigned long sectors,
4b6d287f 1458 int success, int behind)
32a7627c 1459{
ac2f40be
N
1460 if (!bitmap)
1461 return;
4b6d287f 1462 if (behind) {
e555190d
N
1463 if (atomic_dec_and_test(&bitmap->behind_writes))
1464 wake_up(&bitmap->behind_wait);
36a4e1fe
N
1465 pr_debug("dec write-behind count %d/%lu\n",
1466 atomic_read(&bitmap->behind_writes),
1467 bitmap->mddev->bitmap_info.max_write_behind);
4b6d287f
N
1468 }
1469
32a7627c 1470 while (sectors) {
57dab0bd 1471 sector_t blocks;
32a7627c
N
1472 unsigned long flags;
1473 bitmap_counter_t *bmc;
1474
40cffcc0
N
1475 spin_lock_irqsave(&bitmap->counts.lock, flags);
1476 bmc = bitmap_get_counter(&bitmap->counts, offset, &blocks, 0);
32a7627c 1477 if (!bmc) {
40cffcc0 1478 spin_unlock_irqrestore(&bitmap->counts.lock, flags);
32a7627c
N
1479 return;
1480 }
1481
961902c0 1482 if (success && !bitmap->mddev->degraded &&
a0da84f3
NB
1483 bitmap->events_cleared < bitmap->mddev->events) {
1484 bitmap->events_cleared = bitmap->mddev->events;
1485 bitmap->need_sync = 1;
5ff5afff 1486 sysfs_notify_dirent_safe(bitmap->sysfs_can_clear);
a0da84f3
NB
1487 }
1488
27d5ea04 1489 if (!success && !NEEDED(*bmc))
32a7627c
N
1490 *bmc |= NEEDED_MASK;
1491
27d5ea04 1492 if (COUNTER(*bmc) == COUNTER_MAX)
da6e1a32
NB
1493 wake_up(&bitmap->overflow_wait);
1494
32a7627c 1495 (*bmc)--;
2585f3ef 1496 if (*bmc <= 2) {
40cffcc0 1497 bitmap_set_pending(&bitmap->counts, offset);
2585f3ef
N
1498 bitmap->allclean = 0;
1499 }
40cffcc0 1500 spin_unlock_irqrestore(&bitmap->counts.lock, flags);
32a7627c
N
1501 offset += blocks;
1502 if (sectors > blocks)
1503 sectors -= blocks;
ac2f40be
N
1504 else
1505 sectors = 0;
32a7627c
N
1506 }
1507}
ac2f40be 1508EXPORT_SYMBOL(bitmap_endwrite);
32a7627c 1509
57dab0bd 1510static int __bitmap_start_sync(struct bitmap *bitmap, sector_t offset, sector_t *blocks,
1187cf0a 1511 int degraded)
32a7627c
N
1512{
1513 bitmap_counter_t *bmc;
1514 int rv;
1515 if (bitmap == NULL) {/* FIXME or bitmap set as 'failed' */
1516 *blocks = 1024;
1517 return 1; /* always resync if no bitmap */
1518 }
40cffcc0
N
1519 spin_lock_irq(&bitmap->counts.lock);
1520 bmc = bitmap_get_counter(&bitmap->counts, offset, blocks, 0);
32a7627c
N
1521 rv = 0;
1522 if (bmc) {
1523 /* locked */
1524 if (RESYNC(*bmc))
1525 rv = 1;
1526 else if (NEEDED(*bmc)) {
1527 rv = 1;
6a806c51
N
1528 if (!degraded) { /* don't set/clear bits if degraded */
1529 *bmc |= RESYNC_MASK;
1530 *bmc &= ~NEEDED_MASK;
1531 }
32a7627c
N
1532 }
1533 }
40cffcc0 1534 spin_unlock_irq(&bitmap->counts.lock);
32a7627c
N
1535 return rv;
1536}
1537
57dab0bd 1538int bitmap_start_sync(struct bitmap *bitmap, sector_t offset, sector_t *blocks,
1187cf0a
N
1539 int degraded)
1540{
1541 /* bitmap_start_sync must always report on multiples of whole
1542 * pages, otherwise resync (which is very PAGE_SIZE based) will
1543 * get confused.
1544 * So call __bitmap_start_sync repeatedly (if needed) until
1545 * At least PAGE_SIZE>>9 blocks are covered.
1546 * Return the 'or' of the result.
1547 */
1548 int rv = 0;
57dab0bd 1549 sector_t blocks1;
1187cf0a
N
1550
1551 *blocks = 0;
1552 while (*blocks < (PAGE_SIZE>>9)) {
1553 rv |= __bitmap_start_sync(bitmap, offset,
1554 &blocks1, degraded);
1555 offset += blocks1;
1556 *blocks += blocks1;
1557 }
1558 return rv;
1559}
ac2f40be 1560EXPORT_SYMBOL(bitmap_start_sync);
1187cf0a 1561
57dab0bd 1562void bitmap_end_sync(struct bitmap *bitmap, sector_t offset, sector_t *blocks, int aborted)
32a7627c
N
1563{
1564 bitmap_counter_t *bmc;
1565 unsigned long flags;
ac2f40be
N
1566
1567 if (bitmap == NULL) {
32a7627c
N
1568 *blocks = 1024;
1569 return;
1570 }
40cffcc0
N
1571 spin_lock_irqsave(&bitmap->counts.lock, flags);
1572 bmc = bitmap_get_counter(&bitmap->counts, offset, blocks, 0);
32a7627c
N
1573 if (bmc == NULL)
1574 goto unlock;
1575 /* locked */
32a7627c
N
1576 if (RESYNC(*bmc)) {
1577 *bmc &= ~RESYNC_MASK;
1578
1579 if (!NEEDED(*bmc) && aborted)
1580 *bmc |= NEEDED_MASK;
1581 else {
2585f3ef 1582 if (*bmc <= 2) {
40cffcc0 1583 bitmap_set_pending(&bitmap->counts, offset);
2585f3ef
N
1584 bitmap->allclean = 0;
1585 }
32a7627c
N
1586 }
1587 }
1588 unlock:
40cffcc0 1589 spin_unlock_irqrestore(&bitmap->counts.lock, flags);
32a7627c 1590}
ac2f40be 1591EXPORT_SYMBOL(bitmap_end_sync);
32a7627c
N
1592
1593void bitmap_close_sync(struct bitmap *bitmap)
1594{
1595 /* Sync has finished, and any bitmap chunks that weren't synced
1596 * properly have been aborted. It remains to us to clear the
1597 * RESYNC bit wherever it is still on
1598 */
1599 sector_t sector = 0;
57dab0bd 1600 sector_t blocks;
b47490c9
N
1601 if (!bitmap)
1602 return;
32a7627c
N
1603 while (sector < bitmap->mddev->resync_max_sectors) {
1604 bitmap_end_sync(bitmap, sector, &blocks, 0);
b47490c9
N
1605 sector += blocks;
1606 }
1607}
ac2f40be 1608EXPORT_SYMBOL(bitmap_close_sync);
b47490c9 1609
c40f341f 1610void bitmap_cond_end_sync(struct bitmap *bitmap, sector_t sector, bool force)
b47490c9
N
1611{
1612 sector_t s = 0;
57dab0bd 1613 sector_t blocks;
b47490c9
N
1614
1615 if (!bitmap)
1616 return;
1617 if (sector == 0) {
1618 bitmap->last_end_sync = jiffies;
1619 return;
1620 }
c40f341f 1621 if (!force && time_before(jiffies, (bitmap->last_end_sync
1b04be96 1622 + bitmap->mddev->bitmap_info.daemon_sleep)))
b47490c9
N
1623 return;
1624 wait_event(bitmap->mddev->recovery_wait,
1625 atomic_read(&bitmap->mddev->recovery_active) == 0);
1626
75d3da43 1627 bitmap->mddev->curr_resync_completed = sector;
2953079c 1628 set_bit(MD_SB_CHANGE_CLEAN, &bitmap->mddev->sb_flags);
40cffcc0 1629 sector &= ~((1ULL << bitmap->counts.chunkshift) - 1);
b47490c9
N
1630 s = 0;
1631 while (s < sector && s < bitmap->mddev->resync_max_sectors) {
1632 bitmap_end_sync(bitmap, s, &blocks, 0);
1633 s += blocks;
32a7627c 1634 }
b47490c9 1635 bitmap->last_end_sync = jiffies;
acb180b0 1636 sysfs_notify(&bitmap->mddev->kobj, NULL, "sync_completed");
32a7627c 1637}
ac2f40be 1638EXPORT_SYMBOL(bitmap_cond_end_sync);
32a7627c 1639
18c9ff7f
GJ
1640void bitmap_sync_with_cluster(struct mddev *mddev,
1641 sector_t old_lo, sector_t old_hi,
1642 sector_t new_lo, sector_t new_hi)
1643{
1644 struct bitmap *bitmap = mddev->bitmap;
1645 sector_t sector, blocks = 0;
1646
1647 for (sector = old_lo; sector < new_lo; ) {
1648 bitmap_end_sync(bitmap, sector, &blocks, 0);
1649 sector += blocks;
1650 }
1651 WARN((blocks > new_lo) && old_lo, "alignment is not correct for lo\n");
1652
1653 for (sector = old_hi; sector < new_hi; ) {
1654 bitmap_start_sync(bitmap, sector, &blocks, 0);
1655 sector += blocks;
1656 }
1657 WARN((blocks > new_hi) && old_hi, "alignment is not correct for hi\n");
1658}
1659EXPORT_SYMBOL(bitmap_sync_with_cluster);
1660
6a07997f 1661static void bitmap_set_memory_bits(struct bitmap *bitmap, sector_t offset, int needed)
32a7627c
N
1662{
1663 /* For each chunk covered by any of these sectors, set the
ef99bf48 1664 * counter to 2 and possibly set resync_needed. They should all
32a7627c
N
1665 * be 0 at this point
1666 */
193f1c93 1667
57dab0bd 1668 sector_t secs;
193f1c93 1669 bitmap_counter_t *bmc;
40cffcc0
N
1670 spin_lock_irq(&bitmap->counts.lock);
1671 bmc = bitmap_get_counter(&bitmap->counts, offset, &secs, 1);
193f1c93 1672 if (!bmc) {
40cffcc0 1673 spin_unlock_irq(&bitmap->counts.lock);
193f1c93 1674 return;
32a7627c 1675 }
ac2f40be 1676 if (!*bmc) {
11dd35da 1677 *bmc = 2;
40cffcc0
N
1678 bitmap_count_page(&bitmap->counts, offset, 1);
1679 bitmap_set_pending(&bitmap->counts, offset);
2585f3ef 1680 bitmap->allclean = 0;
193f1c93 1681 }
11dd35da
GR
1682 if (needed)
1683 *bmc |= NEEDED_MASK;
40cffcc0 1684 spin_unlock_irq(&bitmap->counts.lock);
32a7627c
N
1685}
1686
9b1d1dac
PC
1687/* dirty the memory and file bits for bitmap chunks "s" to "e" */
1688void bitmap_dirty_bits(struct bitmap *bitmap, unsigned long s, unsigned long e)
1689{
1690 unsigned long chunk;
1691
1692 for (chunk = s; chunk <= e; chunk++) {
40cffcc0 1693 sector_t sec = (sector_t)chunk << bitmap->counts.chunkshift;
9b1d1dac
PC
1694 bitmap_set_memory_bits(bitmap, sec, 1);
1695 bitmap_file_set_bit(bitmap, sec);
ffa23322
N
1696 if (sec < bitmap->mddev->recovery_cp)
1697 /* We are asserting that the array is dirty,
1698 * so move the recovery_cp address back so
1699 * that it is obvious that it is dirty
1700 */
1701 bitmap->mddev->recovery_cp = sec;
9b1d1dac
PC
1702 }
1703}
1704
6b8b3e8a
N
1705/*
1706 * flush out any pending updates
1707 */
fd01b88c 1708void bitmap_flush(struct mddev *mddev)
6b8b3e8a
N
1709{
1710 struct bitmap *bitmap = mddev->bitmap;
42a04b50 1711 long sleep;
6b8b3e8a
N
1712
1713 if (!bitmap) /* there was no bitmap */
1714 return;
1715
1716 /* run the daemon_work three time to ensure everything is flushed
1717 * that can be
1718 */
1b04be96 1719 sleep = mddev->bitmap_info.daemon_sleep * 2;
42a04b50 1720 bitmap->daemon_lastrun -= sleep;
aa5cbd10 1721 bitmap_daemon_work(mddev);
42a04b50 1722 bitmap->daemon_lastrun -= sleep;
aa5cbd10 1723 bitmap_daemon_work(mddev);
42a04b50 1724 bitmap->daemon_lastrun -= sleep;
aa5cbd10 1725 bitmap_daemon_work(mddev);
6b8b3e8a
N
1726 bitmap_update_sb(bitmap);
1727}
1728
32a7627c
N
1729/*
1730 * free memory that was allocated
1731 */
b98938d1 1732void bitmap_free(struct bitmap *bitmap)
32a7627c
N
1733{
1734 unsigned long k, pages;
1735 struct bitmap_page *bp;
32a7627c
N
1736
1737 if (!bitmap) /* there was no bitmap */
1738 return;
1739
f9a67b11
GJ
1740 if (bitmap->sysfs_can_clear)
1741 sysfs_put(bitmap->sysfs_can_clear);
1742
f9209a32
GR
1743 if (mddev_is_clustered(bitmap->mddev) && bitmap->mddev->cluster_info &&
1744 bitmap->cluster_slot == md_cluster_ops->slot_number(bitmap->mddev))
b97e9257
GR
1745 md_cluster_stop(bitmap->mddev);
1746
fae7d326
N
1747 /* Shouldn't be needed - but just in case.... */
1748 wait_event(bitmap->write_wait,
1749 atomic_read(&bitmap->pending_writes) == 0);
1750
1751 /* release the bitmap file */
1752 bitmap_file_unmap(&bitmap->storage);
32a7627c 1753
40cffcc0
N
1754 bp = bitmap->counts.bp;
1755 pages = bitmap->counts.pages;
32a7627c
N
1756
1757 /* free all allocated memory */
1758
32a7627c
N
1759 if (bp) /* deallocate the page memory */
1760 for (k = 0; k < pages; k++)
1761 if (bp[k].map && !bp[k].hijacked)
1762 kfree(bp[k].map);
1763 kfree(bp);
1764 kfree(bitmap);
1765}
b98938d1 1766EXPORT_SYMBOL(bitmap_free);
aa5cbd10 1767
48df498d
GJ
1768void bitmap_wait_behind_writes(struct mddev *mddev)
1769{
1770 struct bitmap *bitmap = mddev->bitmap;
1771
1772 /* wait for behind writes to complete */
1773 if (bitmap && atomic_read(&bitmap->behind_writes) > 0) {
1774 pr_debug("md:%s: behind writes in progress - waiting to stop.\n",
1775 mdname(mddev));
1776 /* need to kick something here to make sure I/O goes? */
1777 wait_event(bitmap->behind_wait,
1778 atomic_read(&bitmap->behind_writes) == 0);
1779 }
1780}
1781
fd01b88c 1782void bitmap_destroy(struct mddev *mddev)
3178b0db
N
1783{
1784 struct bitmap *bitmap = mddev->bitmap;
1785
1786 if (!bitmap) /* there was no bitmap */
1787 return;
1788
48df498d
GJ
1789 bitmap_wait_behind_writes(mddev);
1790
c3d9714e 1791 mutex_lock(&mddev->bitmap_info.mutex);
978a7a47 1792 spin_lock(&mddev->lock);
3178b0db 1793 mddev->bitmap = NULL; /* disconnect from the md device */
978a7a47 1794 spin_unlock(&mddev->lock);
c3d9714e 1795 mutex_unlock(&mddev->bitmap_info.mutex);
b15c2e57
N
1796 if (mddev->thread)
1797 mddev->thread->timeout = MAX_SCHEDULE_TIMEOUT;
3178b0db
N
1798
1799 bitmap_free(bitmap);
1800}
32a7627c
N
1801
1802/*
1803 * initialize the bitmap structure
1804 * if this returns an error, bitmap_destroy must be called to do clean up
f9a67b11 1805 * once mddev->bitmap is set
32a7627c 1806 */
f9209a32 1807struct bitmap *bitmap_create(struct mddev *mddev, int slot)
32a7627c
N
1808{
1809 struct bitmap *bitmap;
1f593903 1810 sector_t blocks = mddev->resync_max_sectors;
c3d9714e 1811 struct file *file = mddev->bitmap_info.file;
32a7627c 1812 int err;
324a56e1 1813 struct kernfs_node *bm = NULL;
32a7627c 1814
5f6e3c83 1815 BUILD_BUG_ON(sizeof(bitmap_super_t) != 256);
32a7627c 1816
c3d9714e 1817 BUG_ON(file && mddev->bitmap_info.offset);
a654b9d8 1818
9ffae0cf 1819 bitmap = kzalloc(sizeof(*bitmap), GFP_KERNEL);
32a7627c 1820 if (!bitmap)
f9209a32 1821 return ERR_PTR(-ENOMEM);
32a7627c 1822
40cffcc0 1823 spin_lock_init(&bitmap->counts.lock);
ce25c31b
N
1824 atomic_set(&bitmap->pending_writes, 0);
1825 init_waitqueue_head(&bitmap->write_wait);
da6e1a32 1826 init_waitqueue_head(&bitmap->overflow_wait);
e555190d 1827 init_waitqueue_head(&bitmap->behind_wait);
ce25c31b 1828
32a7627c 1829 bitmap->mddev = mddev;
f9209a32 1830 bitmap->cluster_slot = slot;
32a7627c 1831
5ff5afff 1832 if (mddev->kobj.sd)
388975cc 1833 bm = sysfs_get_dirent(mddev->kobj.sd, "bitmap");
ece5cff0 1834 if (bm) {
388975cc 1835 bitmap->sysfs_can_clear = sysfs_get_dirent(bm, "can_clear");
ece5cff0
N
1836 sysfs_put(bm);
1837 } else
1838 bitmap->sysfs_can_clear = NULL;
1839
1ec885cd 1840 bitmap->storage.file = file;
ce25c31b
N
1841 if (file) {
1842 get_file(file);
ae8fa283
N
1843 /* As future accesses to this file will use bmap,
1844 * and bypass the page cache, we must sync the file
1845 * first.
1846 */
8018ab05 1847 vfs_fsync(file, 1);
ce25c31b 1848 }
42a04b50 1849 /* read superblock from bitmap file (this sets mddev->bitmap_info.chunksize) */
9c81075f
JB
1850 if (!mddev->bitmap_info.external) {
1851 /*
1852 * If 'MD_ARRAY_FIRST_USE' is set, then device-mapper is
1853 * instructing us to create a new on-disk bitmap instance.
1854 */
1855 if (test_and_clear_bit(MD_ARRAY_FIRST_USE, &mddev->flags))
1856 err = bitmap_new_disk_sb(bitmap);
1857 else
1858 err = bitmap_read_sb(bitmap);
1859 } else {
ece5cff0
N
1860 err = 0;
1861 if (mddev->bitmap_info.chunksize == 0 ||
1862 mddev->bitmap_info.daemon_sleep == 0)
1863 /* chunksize and time_base need to be
1864 * set first. */
1865 err = -EINVAL;
1866 }
32a7627c 1867 if (err)
3178b0db 1868 goto error;
32a7627c 1869
624ce4f5 1870 bitmap->daemon_lastrun = jiffies;
d60b479d
N
1871 err = bitmap_resize(bitmap, blocks, mddev->bitmap_info.chunksize, 1);
1872 if (err)
3178b0db 1873 goto error;
32a7627c 1874
ec0cc226
N
1875 pr_debug("created bitmap (%lu pages) for device %s\n",
1876 bitmap->counts.pages, bmname(bitmap));
69e51b44 1877
f9209a32
GR
1878 err = test_bit(BITMAP_WRITE_ERROR, &bitmap->flags) ? -EIO : 0;
1879 if (err)
1880 goto error;
69e51b44 1881
f9209a32 1882 return bitmap;
69e51b44
N
1883 error:
1884 bitmap_free(bitmap);
f9209a32 1885 return ERR_PTR(err);
69e51b44
N
1886}
1887
fd01b88c 1888int bitmap_load(struct mddev *mddev)
69e51b44
N
1889{
1890 int err = 0;
3520fa4d 1891 sector_t start = 0;
69e51b44
N
1892 sector_t sector = 0;
1893 struct bitmap *bitmap = mddev->bitmap;
1894
1895 if (!bitmap)
1896 goto out;
1897
51e453ae
GJ
1898 if (mddev_is_clustered(mddev))
1899 md_cluster_ops->load_bitmaps(mddev, mddev->bitmap_info.nodes);
1900
69e51b44
N
1901 /* Clear out old bitmap info first: Either there is none, or we
1902 * are resuming after someone else has possibly changed things,
1903 * so we should forget old cached info.
1904 * All chunks should be clean, but some might need_sync.
1905 */
1906 while (sector < mddev->resync_max_sectors) {
57dab0bd 1907 sector_t blocks;
69e51b44
N
1908 bitmap_start_sync(bitmap, sector, &blocks, 0);
1909 sector += blocks;
1910 }
1911 bitmap_close_sync(bitmap);
1912
3520fa4d
JB
1913 if (mddev->degraded == 0
1914 || bitmap->events_cleared == mddev->events)
1915 /* no need to keep dirty bits to optimise a
1916 * re-add of a missing device */
1917 start = mddev->recovery_cp;
1918
afbaa90b 1919 mutex_lock(&mddev->bitmap_info.mutex);
3520fa4d 1920 err = bitmap_init_from_disk(bitmap, start);
afbaa90b 1921 mutex_unlock(&mddev->bitmap_info.mutex);
3520fa4d 1922
32a7627c 1923 if (err)
69e51b44 1924 goto out;
b405fe91 1925 clear_bit(BITMAP_STALE, &bitmap->flags);
ef99bf48
N
1926
1927 /* Kick recovery in case any bits were set */
1928 set_bit(MD_RECOVERY_NEEDED, &bitmap->mddev->recovery);
3178b0db 1929
1b04be96 1930 mddev->thread->timeout = mddev->bitmap_info.daemon_sleep;
9cd30fdc 1931 md_wakeup_thread(mddev->thread);
b15c2e57 1932
4ad13663
N
1933 bitmap_update_sb(bitmap);
1934
b405fe91 1935 if (test_bit(BITMAP_WRITE_ERROR, &bitmap->flags))
69e51b44
N
1936 err = -EIO;
1937out:
3178b0db 1938 return err;
32a7627c 1939}
69e51b44 1940EXPORT_SYMBOL_GPL(bitmap_load);
32a7627c 1941
b98938d1
GJ
1942struct bitmap *get_bitmap_from_slot(struct mddev *mddev, int slot)
1943{
1944 int rv = 0;
1945 struct bitmap *bitmap;
1946
1947 bitmap = bitmap_create(mddev, slot);
1948 if (IS_ERR(bitmap)) {
1949 rv = PTR_ERR(bitmap);
1950 return ERR_PTR(rv);
1951 }
1952
1953 rv = bitmap_init_from_disk(bitmap, 0);
1954 if (rv) {
1955 bitmap_free(bitmap);
1956 return ERR_PTR(rv);
1957 }
1958
1959 return bitmap;
1960}
1961EXPORT_SYMBOL(get_bitmap_from_slot);
1962
11dd35da
GR
1963/* Loads the bitmap associated with slot and copies the resync information
1964 * to our bitmap
1965 */
1966int bitmap_copy_from_slot(struct mddev *mddev, int slot,
97f6cd39 1967 sector_t *low, sector_t *high, bool clear_bits)
11dd35da
GR
1968{
1969 int rv = 0, i, j;
1970 sector_t block, lo = 0, hi = 0;
1971 struct bitmap_counts *counts;
b98938d1 1972 struct bitmap *bitmap;
11dd35da 1973
b98938d1
GJ
1974 bitmap = get_bitmap_from_slot(mddev, slot);
1975 if (IS_ERR(bitmap)) {
1976 pr_err("%s can't get bitmap from slot %d\n", __func__, slot);
1977 return -1;
1978 }
11dd35da
GR
1979
1980 counts = &bitmap->counts;
1981 for (j = 0; j < counts->chunks; j++) {
1982 block = (sector_t)j << counts->chunkshift;
1983 if (bitmap_file_test_bit(bitmap, block)) {
1984 if (!lo)
1985 lo = block;
1986 hi = block;
1987 bitmap_file_clear_bit(bitmap, block);
1988 bitmap_set_memory_bits(mddev->bitmap, block, 1);
1989 bitmap_file_set_bit(mddev->bitmap, block);
1990 }
1991 }
1992
97f6cd39
GR
1993 if (clear_bits) {
1994 bitmap_update_sb(bitmap);
c84400c8
GJ
1995 /* BITMAP_PAGE_PENDING is set, but bitmap_unplug needs
1996 * BITMAP_PAGE_DIRTY or _NEEDWRITE to write ... */
97f6cd39 1997 for (i = 0; i < bitmap->storage.file_pages; i++)
c84400c8
GJ
1998 if (test_page_attr(bitmap, i, BITMAP_PAGE_PENDING))
1999 set_page_attr(bitmap, i, BITMAP_PAGE_NEEDWRITE);
97f6cd39
GR
2000 bitmap_unplug(bitmap);
2001 }
c84400c8 2002 bitmap_unplug(mddev->bitmap);
11dd35da
GR
2003 *low = lo;
2004 *high = hi;
b98938d1 2005
11dd35da
GR
2006 return rv;
2007}
2008EXPORT_SYMBOL_GPL(bitmap_copy_from_slot);
2009
2010
57148964
N
2011void bitmap_status(struct seq_file *seq, struct bitmap *bitmap)
2012{
2013 unsigned long chunk_kb;
40cffcc0 2014 struct bitmap_counts *counts;
57148964
N
2015
2016 if (!bitmap)
2017 return;
2018
40cffcc0
N
2019 counts = &bitmap->counts;
2020
57148964
N
2021 chunk_kb = bitmap->mddev->bitmap_info.chunksize >> 10;
2022 seq_printf(seq, "bitmap: %lu/%lu pages [%luKB], "
2023 "%lu%s chunk",
40cffcc0
N
2024 counts->pages - counts->missing_pages,
2025 counts->pages,
2026 (counts->pages - counts->missing_pages)
57148964
N
2027 << (PAGE_SHIFT - 10),
2028 chunk_kb ? chunk_kb : bitmap->mddev->bitmap_info.chunksize,
2029 chunk_kb ? "KB" : "B");
1ec885cd 2030 if (bitmap->storage.file) {
57148964 2031 seq_printf(seq, ", file: ");
2726d566 2032 seq_file_path(seq, bitmap->storage.file, " \t\n");
57148964
N
2033 }
2034
2035 seq_printf(seq, "\n");
57148964
N
2036}
2037
d60b479d
N
2038int bitmap_resize(struct bitmap *bitmap, sector_t blocks,
2039 int chunksize, int init)
2040{
2041 /* If chunk_size is 0, choose an appropriate chunk size.
2042 * Then possibly allocate new storage space.
2043 * Then quiesce, copy bits, replace bitmap, and re-start
2044 *
2045 * This function is called both to set up the initial bitmap
2046 * and to resize the bitmap while the array is active.
2047 * If this happens as a result of the array being resized,
2048 * chunksize will be zero, and we need to choose a suitable
2049 * chunksize, otherwise we use what we are given.
2050 */
2051 struct bitmap_storage store;
2052 struct bitmap_counts old_counts;
2053 unsigned long chunks;
2054 sector_t block;
2055 sector_t old_blocks, new_blocks;
2056 int chunkshift;
2057 int ret = 0;
2058 long pages;
2059 struct bitmap_page *new_bp;
2060
2061 if (chunksize == 0) {
2062 /* If there is enough space, leave the chunk size unchanged,
2063 * else increase by factor of two until there is enough space.
2064 */
2065 long bytes;
2066 long space = bitmap->mddev->bitmap_info.space;
2067
2068 if (space == 0) {
2069 /* We don't know how much space there is, so limit
2070 * to current size - in sectors.
2071 */
2072 bytes = DIV_ROUND_UP(bitmap->counts.chunks, 8);
2073 if (!bitmap->mddev->bitmap_info.external)
2074 bytes += sizeof(bitmap_super_t);
2075 space = DIV_ROUND_UP(bytes, 512);
2076 bitmap->mddev->bitmap_info.space = space;
2077 }
2078 chunkshift = bitmap->counts.chunkshift;
2079 chunkshift--;
2080 do {
2081 /* 'chunkshift' is shift from block size to chunk size */
2082 chunkshift++;
2083 chunks = DIV_ROUND_UP_SECTOR_T(blocks, 1 << chunkshift);
2084 bytes = DIV_ROUND_UP(chunks, 8);
2085 if (!bitmap->mddev->bitmap_info.external)
2086 bytes += sizeof(bitmap_super_t);
2087 } while (bytes > (space << 9));
2088 } else
2089 chunkshift = ffz(~chunksize) - BITMAP_BLOCK_SHIFT;
2090
2091 chunks = DIV_ROUND_UP_SECTOR_T(blocks, 1 << chunkshift);
2092 memset(&store, 0, sizeof(store));
2093 if (bitmap->mddev->bitmap_info.offset || bitmap->mddev->bitmap_info.file)
2094 ret = bitmap_storage_alloc(&store, chunks,
b97e9257 2095 !bitmap->mddev->bitmap_info.external,
da6fb7a9
N
2096 mddev_is_clustered(bitmap->mddev)
2097 ? bitmap->cluster_slot : 0);
cbb38732
GJ
2098 if (ret) {
2099 bitmap_file_unmap(&store);
d60b479d 2100 goto err;
cbb38732 2101 }
d60b479d
N
2102
2103 pages = DIV_ROUND_UP(chunks, PAGE_COUNTER_RATIO);
2104
2105 new_bp = kzalloc(pages * sizeof(*new_bp), GFP_KERNEL);
2106 ret = -ENOMEM;
2107 if (!new_bp) {
2108 bitmap_file_unmap(&store);
2109 goto err;
2110 }
2111
2112 if (!init)
2113 bitmap->mddev->pers->quiesce(bitmap->mddev, 1);
2114
2115 store.file = bitmap->storage.file;
2116 bitmap->storage.file = NULL;
2117
2118 if (store.sb_page && bitmap->storage.sb_page)
2119 memcpy(page_address(store.sb_page),
2120 page_address(bitmap->storage.sb_page),
2121 sizeof(bitmap_super_t));
2122 bitmap_file_unmap(&bitmap->storage);
2123 bitmap->storage = store;
2124
2125 old_counts = bitmap->counts;
2126 bitmap->counts.bp = new_bp;
2127 bitmap->counts.pages = pages;
2128 bitmap->counts.missing_pages = pages;
2129 bitmap->counts.chunkshift = chunkshift;
2130 bitmap->counts.chunks = chunks;
2131 bitmap->mddev->bitmap_info.chunksize = 1 << (chunkshift +
2132 BITMAP_BLOCK_SHIFT);
2133
2134 blocks = min(old_counts.chunks << old_counts.chunkshift,
2135 chunks << chunkshift);
2136
2137 spin_lock_irq(&bitmap->counts.lock);
c9d65032
GJ
2138 /* For cluster raid, need to pre-allocate bitmap */
2139 if (mddev_is_clustered(bitmap->mddev)) {
2140 unsigned long page;
2141 for (page = 0; page < pages; page++) {
2142 ret = bitmap_checkpage(&bitmap->counts, page, 1, 1);
2143 if (ret) {
2144 unsigned long k;
2145
2146 /* deallocate the page memory */
2147 for (k = 0; k < page; k++) {
bc47e842 2148 kfree(new_bp[k].map);
c9d65032
GJ
2149 }
2150
2151 /* restore some fields from old_counts */
2152 bitmap->counts.bp = old_counts.bp;
2153 bitmap->counts.pages = old_counts.pages;
2154 bitmap->counts.missing_pages = old_counts.pages;
2155 bitmap->counts.chunkshift = old_counts.chunkshift;
2156 bitmap->counts.chunks = old_counts.chunks;
2157 bitmap->mddev->bitmap_info.chunksize = 1 << (old_counts.chunkshift +
2158 BITMAP_BLOCK_SHIFT);
2159 blocks = old_counts.chunks << old_counts.chunkshift;
ec0cc226 2160 pr_warn("Could not pre-allocate in-memory bitmap for cluster raid\n");
c9d65032
GJ
2161 break;
2162 } else
2163 bitmap->counts.bp[page].count += 1;
2164 }
2165 }
2166
d60b479d
N
2167 for (block = 0; block < blocks; ) {
2168 bitmap_counter_t *bmc_old, *bmc_new;
2169 int set;
2170
2171 bmc_old = bitmap_get_counter(&old_counts, block,
2172 &old_blocks, 0);
2173 set = bmc_old && NEEDED(*bmc_old);
2174
2175 if (set) {
2176 bmc_new = bitmap_get_counter(&bitmap->counts, block,
2177 &new_blocks, 1);
2178 if (*bmc_new == 0) {
2179 /* need to set on-disk bits too. */
2180 sector_t end = block + new_blocks;
2181 sector_t start = block >> chunkshift;
2182 start <<= chunkshift;
2183 while (start < end) {
2184 bitmap_file_set_bit(bitmap, block);
2185 start += 1 << chunkshift;
2186 }
2187 *bmc_new = 2;
2188 bitmap_count_page(&bitmap->counts,
2189 block, 1);
2190 bitmap_set_pending(&bitmap->counts,
2191 block);
2192 }
2193 *bmc_new |= NEEDED_MASK;
2194 if (new_blocks < old_blocks)
2195 old_blocks = new_blocks;
2196 }
2197 block += old_blocks;
2198 }
2199
2200 if (!init) {
2201 int i;
2202 while (block < (chunks << chunkshift)) {
2203 bitmap_counter_t *bmc;
2204 bmc = bitmap_get_counter(&bitmap->counts, block,
2205 &new_blocks, 1);
2206 if (bmc) {
2207 /* new space. It needs to be resynced, so
2208 * we set NEEDED_MASK.
2209 */
2210 if (*bmc == 0) {
2211 *bmc = NEEDED_MASK | 2;
2212 bitmap_count_page(&bitmap->counts,
2213 block, 1);
2214 bitmap_set_pending(&bitmap->counts,
2215 block);
2216 }
2217 }
2218 block += new_blocks;
2219 }
2220 for (i = 0; i < bitmap->storage.file_pages; i++)
2221 set_page_attr(bitmap, i, BITMAP_PAGE_DIRTY);
2222 }
2223 spin_unlock_irq(&bitmap->counts.lock);
2224
2225 if (!init) {
2226 bitmap_unplug(bitmap);
2227 bitmap->mddev->pers->quiesce(bitmap->mddev, 0);
2228 }
2229 ret = 0;
2230err:
2231 return ret;
2232}
2233EXPORT_SYMBOL_GPL(bitmap_resize);
2234
43a70507 2235static ssize_t
fd01b88c 2236location_show(struct mddev *mddev, char *page)
43a70507
N
2237{
2238 ssize_t len;
ac2f40be 2239 if (mddev->bitmap_info.file)
43a70507 2240 len = sprintf(page, "file");
ac2f40be 2241 else if (mddev->bitmap_info.offset)
43a70507 2242 len = sprintf(page, "%+lld", (long long)mddev->bitmap_info.offset);
ac2f40be 2243 else
43a70507
N
2244 len = sprintf(page, "none");
2245 len += sprintf(page+len, "\n");
2246 return len;
2247}
2248
2249static ssize_t
fd01b88c 2250location_store(struct mddev *mddev, const char *buf, size_t len)
43a70507 2251{
d9dd26b2 2252 int rv;
43a70507 2253
d9dd26b2
SL
2254 rv = mddev_lock(mddev);
2255 if (rv)
2256 return rv;
43a70507 2257 if (mddev->pers) {
d9dd26b2
SL
2258 if (!mddev->pers->quiesce) {
2259 rv = -EBUSY;
2260 goto out;
2261 }
2262 if (mddev->recovery || mddev->sync_thread) {
2263 rv = -EBUSY;
2264 goto out;
2265 }
43a70507
N
2266 }
2267
2268 if (mddev->bitmap || mddev->bitmap_info.file ||
2269 mddev->bitmap_info.offset) {
2270 /* bitmap already configured. Only option is to clear it */
d9dd26b2
SL
2271 if (strncmp(buf, "none", 4) != 0) {
2272 rv = -EBUSY;
2273 goto out;
2274 }
43a70507
N
2275 if (mddev->pers) {
2276 mddev->pers->quiesce(mddev, 1);
2277 bitmap_destroy(mddev);
2278 mddev->pers->quiesce(mddev, 0);
2279 }
2280 mddev->bitmap_info.offset = 0;
2281 if (mddev->bitmap_info.file) {
2282 struct file *f = mddev->bitmap_info.file;
2283 mddev->bitmap_info.file = NULL;
43a70507
N
2284 fput(f);
2285 }
2286 } else {
2287 /* No bitmap, OK to set a location */
2288 long long offset;
2289 if (strncmp(buf, "none", 4) == 0)
2290 /* nothing to be done */;
2291 else if (strncmp(buf, "file:", 5) == 0) {
2292 /* Not supported yet */
d9dd26b2
SL
2293 rv = -EINVAL;
2294 goto out;
43a70507 2295 } else {
43a70507 2296 if (buf[0] == '+')
b29bebd6 2297 rv = kstrtoll(buf+1, 10, &offset);
43a70507 2298 else
b29bebd6 2299 rv = kstrtoll(buf, 10, &offset);
43a70507 2300 if (rv)
d9dd26b2
SL
2301 goto out;
2302 if (offset == 0) {
2303 rv = -EINVAL;
2304 goto out;
2305 }
ece5cff0
N
2306 if (mddev->bitmap_info.external == 0 &&
2307 mddev->major_version == 0 &&
d9dd26b2
SL
2308 offset != mddev->bitmap_info.default_offset) {
2309 rv = -EINVAL;
2310 goto out;
2311 }
43a70507
N
2312 mddev->bitmap_info.offset = offset;
2313 if (mddev->pers) {
f9209a32 2314 struct bitmap *bitmap;
43a70507 2315 mddev->pers->quiesce(mddev, 1);
f9209a32
GR
2316 bitmap = bitmap_create(mddev, -1);
2317 if (IS_ERR(bitmap))
2318 rv = PTR_ERR(bitmap);
2319 else {
2320 mddev->bitmap = bitmap;
4474ca42 2321 rv = bitmap_load(mddev);
f9a67b11 2322 if (rv)
f9209a32 2323 mddev->bitmap_info.offset = 0;
43a70507
N
2324 }
2325 mddev->pers->quiesce(mddev, 0);
f9a67b11
GJ
2326 if (rv) {
2327 bitmap_destroy(mddev);
d9dd26b2 2328 goto out;
f9a67b11 2329 }
43a70507
N
2330 }
2331 }
2332 }
2333 if (!mddev->external) {
2334 /* Ensure new bitmap info is stored in
2335 * metadata promptly.
2336 */
2953079c 2337 set_bit(MD_SB_CHANGE_DEVS, &mddev->sb_flags);
43a70507
N
2338 md_wakeup_thread(mddev->thread);
2339 }
d9dd26b2
SL
2340 rv = 0;
2341out:
2342 mddev_unlock(mddev);
2343 if (rv)
2344 return rv;
43a70507
N
2345 return len;
2346}
2347
2348static struct md_sysfs_entry bitmap_location =
2349__ATTR(location, S_IRUGO|S_IWUSR, location_show, location_store);
2350
6409bb05
N
2351/* 'bitmap/space' is the space available at 'location' for the
2352 * bitmap. This allows the kernel to know when it is safe to
2353 * resize the bitmap to match a resized array.
2354 */
2355static ssize_t
2356space_show(struct mddev *mddev, char *page)
2357{
2358 return sprintf(page, "%lu\n", mddev->bitmap_info.space);
2359}
2360
2361static ssize_t
2362space_store(struct mddev *mddev, const char *buf, size_t len)
2363{
2364 unsigned long sectors;
2365 int rv;
2366
2367 rv = kstrtoul(buf, 10, &sectors);
2368 if (rv)
2369 return rv;
2370
2371 if (sectors == 0)
2372 return -EINVAL;
2373
2374 if (mddev->bitmap &&
9b1215c1 2375 sectors < (mddev->bitmap->storage.bytes + 511) >> 9)
6409bb05
N
2376 return -EFBIG; /* Bitmap is too big for this small space */
2377
2378 /* could make sure it isn't too big, but that isn't really
2379 * needed - user-space should be careful.
2380 */
2381 mddev->bitmap_info.space = sectors;
2382 return len;
2383}
2384
2385static struct md_sysfs_entry bitmap_space =
2386__ATTR(space, S_IRUGO|S_IWUSR, space_show, space_store);
2387
43a70507 2388static ssize_t
fd01b88c 2389timeout_show(struct mddev *mddev, char *page)
43a70507
N
2390{
2391 ssize_t len;
2392 unsigned long secs = mddev->bitmap_info.daemon_sleep / HZ;
2393 unsigned long jifs = mddev->bitmap_info.daemon_sleep % HZ;
ac2f40be 2394
43a70507
N
2395 len = sprintf(page, "%lu", secs);
2396 if (jifs)
2397 len += sprintf(page+len, ".%03u", jiffies_to_msecs(jifs));
2398 len += sprintf(page+len, "\n");
2399 return len;
2400}
2401
2402static ssize_t
fd01b88c 2403timeout_store(struct mddev *mddev, const char *buf, size_t len)
43a70507
N
2404{
2405 /* timeout can be set at any time */
2406 unsigned long timeout;
2407 int rv = strict_strtoul_scaled(buf, &timeout, 4);
2408 if (rv)
2409 return rv;
2410
2411 /* just to make sure we don't overflow... */
2412 if (timeout >= LONG_MAX / HZ)
2413 return -EINVAL;
2414
2415 timeout = timeout * HZ / 10000;
2416
2417 if (timeout >= MAX_SCHEDULE_TIMEOUT)
2418 timeout = MAX_SCHEDULE_TIMEOUT-1;
2419 if (timeout < 1)
2420 timeout = 1;
2421 mddev->bitmap_info.daemon_sleep = timeout;
2422 if (mddev->thread) {
2423 /* if thread->timeout is MAX_SCHEDULE_TIMEOUT, then
2424 * the bitmap is all clean and we don't need to
2425 * adjust the timeout right now
2426 */
2427 if (mddev->thread->timeout < MAX_SCHEDULE_TIMEOUT) {
2428 mddev->thread->timeout = timeout;
2429 md_wakeup_thread(mddev->thread);
2430 }
2431 }
2432 return len;
2433}
2434
2435static struct md_sysfs_entry bitmap_timeout =
2436__ATTR(time_base, S_IRUGO|S_IWUSR, timeout_show, timeout_store);
2437
2438static ssize_t
fd01b88c 2439backlog_show(struct mddev *mddev, char *page)
43a70507
N
2440{
2441 return sprintf(page, "%lu\n", mddev->bitmap_info.max_write_behind);
2442}
2443
2444static ssize_t
fd01b88c 2445backlog_store(struct mddev *mddev, const char *buf, size_t len)
43a70507
N
2446{
2447 unsigned long backlog;
b29bebd6 2448 int rv = kstrtoul(buf, 10, &backlog);
43a70507
N
2449 if (rv)
2450 return rv;
2451 if (backlog > COUNTER_MAX)
2452 return -EINVAL;
2453 mddev->bitmap_info.max_write_behind = backlog;
2454 return len;
2455}
2456
2457static struct md_sysfs_entry bitmap_backlog =
2458__ATTR(backlog, S_IRUGO|S_IWUSR, backlog_show, backlog_store);
2459
2460static ssize_t
fd01b88c 2461chunksize_show(struct mddev *mddev, char *page)
43a70507
N
2462{
2463 return sprintf(page, "%lu\n", mddev->bitmap_info.chunksize);
2464}
2465
2466static ssize_t
fd01b88c 2467chunksize_store(struct mddev *mddev, const char *buf, size_t len)
43a70507
N
2468{
2469 /* Can only be changed when no bitmap is active */
2470 int rv;
2471 unsigned long csize;
2472 if (mddev->bitmap)
2473 return -EBUSY;
b29bebd6 2474 rv = kstrtoul(buf, 10, &csize);
43a70507
N
2475 if (rv)
2476 return rv;
2477 if (csize < 512 ||
2478 !is_power_of_2(csize))
2479 return -EINVAL;
2480 mddev->bitmap_info.chunksize = csize;
2481 return len;
2482}
2483
2484static struct md_sysfs_entry bitmap_chunksize =
2485__ATTR(chunksize, S_IRUGO|S_IWUSR, chunksize_show, chunksize_store);
2486
fd01b88c 2487static ssize_t metadata_show(struct mddev *mddev, char *page)
ece5cff0 2488{
c4ce867f
GR
2489 if (mddev_is_clustered(mddev))
2490 return sprintf(page, "clustered\n");
ece5cff0
N
2491 return sprintf(page, "%s\n", (mddev->bitmap_info.external
2492 ? "external" : "internal"));
2493}
2494
fd01b88c 2495static ssize_t metadata_store(struct mddev *mddev, const char *buf, size_t len)
ece5cff0
N
2496{
2497 if (mddev->bitmap ||
2498 mddev->bitmap_info.file ||
2499 mddev->bitmap_info.offset)
2500 return -EBUSY;
2501 if (strncmp(buf, "external", 8) == 0)
2502 mddev->bitmap_info.external = 1;
c4ce867f
GR
2503 else if ((strncmp(buf, "internal", 8) == 0) ||
2504 (strncmp(buf, "clustered", 9) == 0))
ece5cff0
N
2505 mddev->bitmap_info.external = 0;
2506 else
2507 return -EINVAL;
2508 return len;
2509}
2510
2511static struct md_sysfs_entry bitmap_metadata =
2512__ATTR(metadata, S_IRUGO|S_IWUSR, metadata_show, metadata_store);
2513
fd01b88c 2514static ssize_t can_clear_show(struct mddev *mddev, char *page)
ece5cff0
N
2515{
2516 int len;
b7b17c9b 2517 spin_lock(&mddev->lock);
ece5cff0
N
2518 if (mddev->bitmap)
2519 len = sprintf(page, "%s\n", (mddev->bitmap->need_sync ?
2520 "false" : "true"));
2521 else
2522 len = sprintf(page, "\n");
b7b17c9b 2523 spin_unlock(&mddev->lock);
ece5cff0
N
2524 return len;
2525}
2526
fd01b88c 2527static ssize_t can_clear_store(struct mddev *mddev, const char *buf, size_t len)
ece5cff0
N
2528{
2529 if (mddev->bitmap == NULL)
2530 return -ENOENT;
2531 if (strncmp(buf, "false", 5) == 0)
2532 mddev->bitmap->need_sync = 1;
2533 else if (strncmp(buf, "true", 4) == 0) {
2534 if (mddev->degraded)
2535 return -EBUSY;
2536 mddev->bitmap->need_sync = 0;
2537 } else
2538 return -EINVAL;
2539 return len;
2540}
2541
2542static struct md_sysfs_entry bitmap_can_clear =
2543__ATTR(can_clear, S_IRUGO|S_IWUSR, can_clear_show, can_clear_store);
2544
696fcd53 2545static ssize_t
fd01b88c 2546behind_writes_used_show(struct mddev *mddev, char *page)
696fcd53 2547{
b7b17c9b
N
2548 ssize_t ret;
2549 spin_lock(&mddev->lock);
696fcd53 2550 if (mddev->bitmap == NULL)
b7b17c9b
N
2551 ret = sprintf(page, "0\n");
2552 else
2553 ret = sprintf(page, "%lu\n",
2554 mddev->bitmap->behind_writes_used);
2555 spin_unlock(&mddev->lock);
2556 return ret;
696fcd53
PC
2557}
2558
2559static ssize_t
fd01b88c 2560behind_writes_used_reset(struct mddev *mddev, const char *buf, size_t len)
696fcd53
PC
2561{
2562 if (mddev->bitmap)
2563 mddev->bitmap->behind_writes_used = 0;
2564 return len;
2565}
2566
2567static struct md_sysfs_entry max_backlog_used =
2568__ATTR(max_backlog_used, S_IRUGO | S_IWUSR,
2569 behind_writes_used_show, behind_writes_used_reset);
2570
43a70507
N
2571static struct attribute *md_bitmap_attrs[] = {
2572 &bitmap_location.attr,
6409bb05 2573 &bitmap_space.attr,
43a70507
N
2574 &bitmap_timeout.attr,
2575 &bitmap_backlog.attr,
2576 &bitmap_chunksize.attr,
ece5cff0
N
2577 &bitmap_metadata.attr,
2578 &bitmap_can_clear.attr,
696fcd53 2579 &max_backlog_used.attr,
43a70507
N
2580 NULL
2581};
2582struct attribute_group md_bitmap_group = {
2583 .name = "bitmap",
2584 .attrs = md_bitmap_attrs,
2585};
2586