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