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