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