2 * bitmap.c two-level bitmap (C) Peter T. Breuer (ptb@ot.uc3m.es) 2003
4 * bitmap_create - sets up the bitmap structure
5 * bitmap_destroy - destroys the bitmap structure
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
15 * flush after percent set rather than just time based. (maybe both).
18 #include <linux/blkdev.h>
19 #include <linux/module.h>
20 #include <linux/errno.h>
21 #include <linux/slab.h>
22 #include <linux/init.h>
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>
29 #include <linux/seq_file.h>
30 #include <trace/events/block.h>
34 static inline char *bmname(struct bitmap
*bitmap
)
36 return bitmap
->mddev
? mdname(bitmap
->mddev
) : "mdX";
40 * check a page and, if necessary, allocate it (or hijack it if the alloc fails)
42 * 1) check to see if this page is allocated, if it's not then try to alloc
43 * 2) if the alloc fails, set the page's hijacked flag so we'll use the
44 * page pointer directly as a counter
46 * if we find our page, we increment the page's refcount so that it stays
47 * allocated while we're using it
49 static int bitmap_checkpage(struct bitmap_counts
*bitmap
,
50 unsigned long page
, int create
, int no_hijack
)
51 __releases(bitmap
->lock
)
52 __acquires(bitmap
->lock
)
54 unsigned char *mappage
;
56 if (page
>= bitmap
->pages
) {
57 /* This can happen if bitmap_start_sync goes beyond
58 * End-of-device while looking for a whole page.
64 if (bitmap
->bp
[page
].hijacked
) /* it's hijacked, don't try to alloc */
67 if (bitmap
->bp
[page
].map
) /* page is already allocated, just return */
73 /* this page has not been allocated yet */
75 spin_unlock_irq(&bitmap
->lock
);
76 /* It is possible that this is being called inside a
77 * prepare_to_wait/finish_wait loop from raid5c:make_request().
78 * In general it is not permitted to sleep in that context as it
79 * can cause the loop to spin freely.
80 * That doesn't apply here as we can only reach this point
82 * When this function completes, either bp[page].map or
83 * bp[page].hijacked. In either case, this function will
84 * abort before getting to this point again. So there is
85 * no risk of a free-spin, and so it is safe to assert
86 * that sleeping here is allowed.
88 sched_annotate_sleep();
89 mappage
= kzalloc(PAGE_SIZE
, GFP_NOIO
);
90 spin_lock_irq(&bitmap
->lock
);
92 if (mappage
== NULL
) {
93 pr_debug("md/bitmap: map page allocation failed, hijacking\n");
94 /* We don't support hijack for cluster raid */
97 /* failed - set the hijacked flag so that we can use the
98 * pointer as a counter */
99 if (!bitmap
->bp
[page
].map
)
100 bitmap
->bp
[page
].hijacked
= 1;
101 } else if (bitmap
->bp
[page
].map
||
102 bitmap
->bp
[page
].hijacked
) {
103 /* somebody beat us to getting the page */
107 /* no page was in place and we have one, so install it */
109 bitmap
->bp
[page
].map
= mappage
;
110 bitmap
->missing_pages
--;
115 /* if page is completely empty, put it back on the free list, or dealloc it */
116 /* if page was hijacked, unmark the flag so it might get alloced next time */
117 /* Note: lock should be held when calling this */
118 static void bitmap_checkfree(struct bitmap_counts
*bitmap
, unsigned long page
)
122 if (bitmap
->bp
[page
].count
) /* page is still busy */
125 /* page is no longer in use, it can be released */
127 if (bitmap
->bp
[page
].hijacked
) { /* page was hijacked, undo this now */
128 bitmap
->bp
[page
].hijacked
= 0;
129 bitmap
->bp
[page
].map
= NULL
;
131 /* normal case, free the page */
132 ptr
= bitmap
->bp
[page
].map
;
133 bitmap
->bp
[page
].map
= NULL
;
134 bitmap
->missing_pages
++;
140 * bitmap file handling - read and write the bitmap file and its superblock
144 * basic page I/O operations
147 /* IO operations when bitmap is stored near all superblocks */
148 static int read_sb_page(struct mddev
*mddev
, loff_t offset
,
150 unsigned long index
, int size
)
152 /* choose a good rdev and read the page from there */
154 struct md_rdev
*rdev
;
157 rdev_for_each(rdev
, mddev
) {
158 if (! test_bit(In_sync
, &rdev
->flags
)
159 || test_bit(Faulty
, &rdev
->flags
)
160 || test_bit(Bitmap_sync
, &rdev
->flags
))
163 target
= offset
+ index
* (PAGE_SIZE
/512);
165 if (sync_page_io(rdev
, target
,
166 roundup(size
, bdev_logical_block_size(rdev
->bdev
)),
167 page
, REQ_OP_READ
, 0, true)) {
175 static struct md_rdev
*next_active_rdev(struct md_rdev
*rdev
, struct mddev
*mddev
)
177 /* Iterate the disks of an mddev, using rcu to protect access to the
178 * linked list, and raising the refcount of devices we return to ensure
179 * they don't disappear while in use.
180 * As devices are only added or removed when raid_disk is < 0 and
181 * nr_pending is 0 and In_sync is clear, the entries we return will
182 * still be in the same position on the list when we re-enter
183 * list_for_each_entry_continue_rcu.
185 * Note that if entered with 'rdev == NULL' to start at the
186 * beginning, we temporarily assign 'rdev' to an address which
187 * isn't really an rdev, but which can be used by
188 * list_for_each_entry_continue_rcu() to find the first entry.
192 /* start at the beginning */
193 rdev
= list_entry(&mddev
->disks
, struct md_rdev
, same_set
);
195 /* release the previous rdev and start from there. */
196 rdev_dec_pending(rdev
, mddev
);
198 list_for_each_entry_continue_rcu(rdev
, &mddev
->disks
, same_set
) {
199 if (rdev
->raid_disk
>= 0 &&
200 !test_bit(Faulty
, &rdev
->flags
)) {
201 /* this is a usable devices */
202 atomic_inc(&rdev
->nr_pending
);
211 static int write_sb_page(struct bitmap
*bitmap
, struct page
*page
, int wait
)
213 struct md_rdev
*rdev
;
214 struct block_device
*bdev
;
215 struct mddev
*mddev
= bitmap
->mddev
;
216 struct bitmap_storage
*store
= &bitmap
->storage
;
220 while ((rdev
= next_active_rdev(rdev
, mddev
)) != NULL
) {
221 int size
= PAGE_SIZE
;
222 loff_t offset
= mddev
->bitmap_info
.offset
;
224 bdev
= (rdev
->meta_bdev
) ? rdev
->meta_bdev
: rdev
->bdev
;
226 if (page
->index
== store
->file_pages
-1) {
227 int last_page_size
= store
->bytes
& (PAGE_SIZE
-1);
228 if (last_page_size
== 0)
229 last_page_size
= PAGE_SIZE
;
230 size
= roundup(last_page_size
,
231 bdev_logical_block_size(bdev
));
233 /* Just make sure we aren't corrupting data or
236 if (mddev
->external
) {
237 /* Bitmap could be anywhere. */
238 if (rdev
->sb_start
+ offset
+ (page
->index
242 rdev
->sb_start
+ offset
243 < (rdev
->data_offset
+ mddev
->dev_sectors
246 } else if (offset
< 0) {
247 /* DATA BITMAP METADATA */
249 + (long)(page
->index
* (PAGE_SIZE
/512))
251 /* bitmap runs in to metadata */
253 if (rdev
->data_offset
+ mddev
->dev_sectors
254 > rdev
->sb_start
+ offset
)
255 /* data runs in to bitmap */
257 } else if (rdev
->sb_start
< rdev
->data_offset
) {
258 /* METADATA BITMAP DATA */
261 + page
->index
*(PAGE_SIZE
/512) + size
/512
263 /* bitmap runs in to data */
266 /* DATA METADATA BITMAP - no problems */
268 md_super_write(mddev
, rdev
,
269 rdev
->sb_start
+ offset
270 + page
->index
* (PAGE_SIZE
/512),
275 if (wait
&& md_super_wait(mddev
) < 0)
283 static void bitmap_file_kick(struct bitmap
*bitmap
);
285 * write out a page to a file
287 static void write_page(struct bitmap
*bitmap
, struct page
*page
, int wait
)
289 struct buffer_head
*bh
;
291 if (bitmap
->storage
.file
== NULL
) {
292 switch (write_sb_page(bitmap
, page
, wait
)) {
294 set_bit(BITMAP_WRITE_ERROR
, &bitmap
->flags
);
298 bh
= page_buffers(page
);
300 while (bh
&& bh
->b_blocknr
) {
301 atomic_inc(&bitmap
->pending_writes
);
302 set_buffer_locked(bh
);
303 set_buffer_mapped(bh
);
304 submit_bh(REQ_OP_WRITE
, REQ_SYNC
, bh
);
305 bh
= bh
->b_this_page
;
309 wait_event(bitmap
->write_wait
,
310 atomic_read(&bitmap
->pending_writes
)==0);
312 if (test_bit(BITMAP_WRITE_ERROR
, &bitmap
->flags
))
313 bitmap_file_kick(bitmap
);
316 static void end_bitmap_write(struct buffer_head
*bh
, int uptodate
)
318 struct bitmap
*bitmap
= bh
->b_private
;
321 set_bit(BITMAP_WRITE_ERROR
, &bitmap
->flags
);
322 if (atomic_dec_and_test(&bitmap
->pending_writes
))
323 wake_up(&bitmap
->write_wait
);
326 /* copied from buffer.c */
328 __clear_page_buffers(struct page
*page
)
330 ClearPagePrivate(page
);
331 set_page_private(page
, 0);
334 static void free_buffers(struct page
*page
)
336 struct buffer_head
*bh
;
338 if (!PagePrivate(page
))
341 bh
= page_buffers(page
);
343 struct buffer_head
*next
= bh
->b_this_page
;
344 free_buffer_head(bh
);
347 __clear_page_buffers(page
);
351 /* read a page from a file.
352 * We both read the page, and attach buffers to the page to record the
353 * address of each block (using bmap). These addresses will be used
354 * to write the block later, completely bypassing the filesystem.
355 * This usage is similar to how swap files are handled, and allows us
356 * to write to a file with no concerns of memory allocation failing.
358 static int read_page(struct file
*file
, unsigned long index
,
359 struct bitmap
*bitmap
,
364 struct inode
*inode
= file_inode(file
);
365 struct buffer_head
*bh
;
368 pr_debug("read bitmap file (%dB @ %llu)\n", (int)PAGE_SIZE
,
369 (unsigned long long)index
<< PAGE_SHIFT
);
371 bh
= alloc_page_buffers(page
, 1<<inode
->i_blkbits
, 0);
376 attach_page_buffers(page
, bh
);
377 block
= index
<< (PAGE_SHIFT
- inode
->i_blkbits
);
382 bh
->b_blocknr
= bmap(inode
, block
);
383 if (bh
->b_blocknr
== 0) {
384 /* Cannot use this file! */
388 bh
->b_bdev
= inode
->i_sb
->s_bdev
;
389 if (count
< (1<<inode
->i_blkbits
))
392 count
-= (1<<inode
->i_blkbits
);
394 bh
->b_end_io
= end_bitmap_write
;
395 bh
->b_private
= bitmap
;
396 atomic_inc(&bitmap
->pending_writes
);
397 set_buffer_locked(bh
);
398 set_buffer_mapped(bh
);
399 submit_bh(REQ_OP_READ
, 0, bh
);
402 bh
= bh
->b_this_page
;
406 wait_event(bitmap
->write_wait
,
407 atomic_read(&bitmap
->pending_writes
)==0);
408 if (test_bit(BITMAP_WRITE_ERROR
, &bitmap
->flags
))
412 pr_err("md: bitmap read error: (%dB @ %llu): %d\n",
414 (unsigned long long)index
<< PAGE_SHIFT
,
420 * bitmap file superblock operations
424 * bitmap_wait_writes() should be called before writing any bitmap
425 * blocks, to ensure previous writes, particularly from
426 * bitmap_daemon_work(), have completed.
428 static void bitmap_wait_writes(struct bitmap
*bitmap
)
430 if (bitmap
->storage
.file
)
431 wait_event(bitmap
->write_wait
,
432 atomic_read(&bitmap
->pending_writes
)==0);
434 /* Note that we ignore the return value. The writes
435 * might have failed, but that would just mean that
436 * some bits which should be cleared haven't been,
437 * which is safe. The relevant bitmap blocks will
438 * probably get written again, but there is no great
439 * loss if they aren't.
441 md_super_wait(bitmap
->mddev
);
445 /* update the event counter and sync the superblock to disk */
446 void bitmap_update_sb(struct bitmap
*bitmap
)
450 if (!bitmap
|| !bitmap
->mddev
) /* no bitmap for this array */
452 if (bitmap
->mddev
->bitmap_info
.external
)
454 if (!bitmap
->storage
.sb_page
) /* no superblock */
456 sb
= kmap_atomic(bitmap
->storage
.sb_page
);
457 sb
->events
= cpu_to_le64(bitmap
->mddev
->events
);
458 if (bitmap
->mddev
->events
< bitmap
->events_cleared
)
459 /* rocking back to read-only */
460 bitmap
->events_cleared
= bitmap
->mddev
->events
;
461 sb
->events_cleared
= cpu_to_le64(bitmap
->events_cleared
);
462 sb
->state
= cpu_to_le32(bitmap
->flags
);
463 /* Just in case these have been changed via sysfs: */
464 sb
->daemon_sleep
= cpu_to_le32(bitmap
->mddev
->bitmap_info
.daemon_sleep
/HZ
);
465 sb
->write_behind
= cpu_to_le32(bitmap
->mddev
->bitmap_info
.max_write_behind
);
466 /* This might have been changed by a reshape */
467 sb
->sync_size
= cpu_to_le64(bitmap
->mddev
->resync_max_sectors
);
468 sb
->chunksize
= cpu_to_le32(bitmap
->mddev
->bitmap_info
.chunksize
);
469 sb
->nodes
= cpu_to_le32(bitmap
->mddev
->bitmap_info
.nodes
);
470 sb
->sectors_reserved
= cpu_to_le32(bitmap
->mddev
->
473 write_page(bitmap
, bitmap
->storage
.sb_page
, 1);
475 EXPORT_SYMBOL(bitmap_update_sb
);
477 /* print out the bitmap file superblock */
478 void bitmap_print_sb(struct bitmap
*bitmap
)
482 if (!bitmap
|| !bitmap
->storage
.sb_page
)
484 sb
= kmap_atomic(bitmap
->storage
.sb_page
);
485 pr_debug("%s: bitmap file superblock:\n", bmname(bitmap
));
486 pr_debug(" magic: %08x\n", le32_to_cpu(sb
->magic
));
487 pr_debug(" version: %d\n", le32_to_cpu(sb
->version
));
488 pr_debug(" uuid: %08x.%08x.%08x.%08x\n",
489 le32_to_cpu(*(__u32
*)(sb
->uuid
+0)),
490 le32_to_cpu(*(__u32
*)(sb
->uuid
+4)),
491 le32_to_cpu(*(__u32
*)(sb
->uuid
+8)),
492 le32_to_cpu(*(__u32
*)(sb
->uuid
+12)));
493 pr_debug(" events: %llu\n",
494 (unsigned long long) le64_to_cpu(sb
->events
));
495 pr_debug("events cleared: %llu\n",
496 (unsigned long long) le64_to_cpu(sb
->events_cleared
));
497 pr_debug(" state: %08x\n", le32_to_cpu(sb
->state
));
498 pr_debug(" chunksize: %d B\n", le32_to_cpu(sb
->chunksize
));
499 pr_debug(" daemon sleep: %ds\n", le32_to_cpu(sb
->daemon_sleep
));
500 pr_debug(" sync size: %llu KB\n",
501 (unsigned long long)le64_to_cpu(sb
->sync_size
)/2);
502 pr_debug("max write behind: %d\n", le32_to_cpu(sb
->write_behind
));
510 * This function is somewhat the reverse of bitmap_read_sb. bitmap_read_sb
511 * reads and verifies the on-disk bitmap superblock and populates bitmap_info.
512 * This function verifies 'bitmap_info' and populates the on-disk bitmap
513 * structure, which is to be written to disk.
515 * Returns: 0 on success, -Exxx on error
517 static int bitmap_new_disk_sb(struct bitmap
*bitmap
)
520 unsigned long chunksize
, daemon_sleep
, write_behind
;
522 bitmap
->storage
.sb_page
= alloc_page(GFP_KERNEL
| __GFP_ZERO
);
523 if (bitmap
->storage
.sb_page
== NULL
)
525 bitmap
->storage
.sb_page
->index
= 0;
527 sb
= kmap_atomic(bitmap
->storage
.sb_page
);
529 sb
->magic
= cpu_to_le32(BITMAP_MAGIC
);
530 sb
->version
= cpu_to_le32(BITMAP_MAJOR_HI
);
532 chunksize
= bitmap
->mddev
->bitmap_info
.chunksize
;
534 if (!is_power_of_2(chunksize
)) {
536 pr_warn("bitmap chunksize not a power of 2\n");
539 sb
->chunksize
= cpu_to_le32(chunksize
);
541 daemon_sleep
= bitmap
->mddev
->bitmap_info
.daemon_sleep
;
542 if (!daemon_sleep
|| (daemon_sleep
> MAX_SCHEDULE_TIMEOUT
)) {
543 pr_debug("Choosing daemon_sleep default (5 sec)\n");
544 daemon_sleep
= 5 * HZ
;
546 sb
->daemon_sleep
= cpu_to_le32(daemon_sleep
);
547 bitmap
->mddev
->bitmap_info
.daemon_sleep
= daemon_sleep
;
550 * FIXME: write_behind for RAID1. If not specified, what
551 * is a good choice? We choose COUNTER_MAX / 2 arbitrarily.
553 write_behind
= bitmap
->mddev
->bitmap_info
.max_write_behind
;
554 if (write_behind
> COUNTER_MAX
)
555 write_behind
= COUNTER_MAX
/ 2;
556 sb
->write_behind
= cpu_to_le32(write_behind
);
557 bitmap
->mddev
->bitmap_info
.max_write_behind
= write_behind
;
559 /* keep the array size field of the bitmap superblock up to date */
560 sb
->sync_size
= cpu_to_le64(bitmap
->mddev
->resync_max_sectors
);
562 memcpy(sb
->uuid
, bitmap
->mddev
->uuid
, 16);
564 set_bit(BITMAP_STALE
, &bitmap
->flags
);
565 sb
->state
= cpu_to_le32(bitmap
->flags
);
566 bitmap
->events_cleared
= bitmap
->mddev
->events
;
567 sb
->events_cleared
= cpu_to_le64(bitmap
->mddev
->events
);
568 bitmap
->mddev
->bitmap_info
.nodes
= 0;
575 /* read the superblock from the bitmap file and initialize some bitmap fields */
576 static int bitmap_read_sb(struct bitmap
*bitmap
)
580 unsigned long chunksize
, daemon_sleep
, write_behind
;
581 unsigned long long events
;
583 unsigned long sectors_reserved
= 0;
585 struct page
*sb_page
;
586 loff_t offset
= bitmap
->mddev
->bitmap_info
.offset
;
588 if (!bitmap
->storage
.file
&& !bitmap
->mddev
->bitmap_info
.offset
) {
589 chunksize
= 128 * 1024 * 1024;
590 daemon_sleep
= 5 * HZ
;
592 set_bit(BITMAP_STALE
, &bitmap
->flags
);
596 /* page 0 is the superblock, read it... */
597 sb_page
= alloc_page(GFP_KERNEL
);
600 bitmap
->storage
.sb_page
= sb_page
;
603 /* If cluster_slot is set, the cluster is setup */
604 if (bitmap
->cluster_slot
>= 0) {
605 sector_t bm_blocks
= bitmap
->mddev
->resync_max_sectors
;
607 sector_div(bm_blocks
,
608 bitmap
->mddev
->bitmap_info
.chunksize
>> 9);
610 bm_blocks
= ((bm_blocks
+7) >> 3) + sizeof(bitmap_super_t
);
612 bm_blocks
= DIV_ROUND_UP_SECTOR_T(bm_blocks
, 4096);
613 offset
= bitmap
->mddev
->bitmap_info
.offset
+ (bitmap
->cluster_slot
* (bm_blocks
<< 3));
614 pr_debug("%s:%d bm slot: %d offset: %llu\n", __func__
, __LINE__
,
615 bitmap
->cluster_slot
, offset
);
618 if (bitmap
->storage
.file
) {
619 loff_t isize
= i_size_read(bitmap
->storage
.file
->f_mapping
->host
);
620 int bytes
= isize
> PAGE_SIZE
? PAGE_SIZE
: isize
;
622 err
= read_page(bitmap
->storage
.file
, 0,
623 bitmap
, bytes
, sb_page
);
625 err
= read_sb_page(bitmap
->mddev
,
628 0, sizeof(bitmap_super_t
));
634 sb
= kmap_atomic(sb_page
);
636 chunksize
= le32_to_cpu(sb
->chunksize
);
637 daemon_sleep
= le32_to_cpu(sb
->daemon_sleep
) * HZ
;
638 write_behind
= le32_to_cpu(sb
->write_behind
);
639 sectors_reserved
= le32_to_cpu(sb
->sectors_reserved
);
640 /* Setup nodes/clustername only if bitmap version is
643 if (sb
->version
== cpu_to_le32(BITMAP_MAJOR_CLUSTERED
)) {
644 nodes
= le32_to_cpu(sb
->nodes
);
645 strlcpy(bitmap
->mddev
->bitmap_info
.cluster_name
,
646 sb
->cluster_name
, 64);
649 /* verify that the bitmap-specific fields are valid */
650 if (sb
->magic
!= cpu_to_le32(BITMAP_MAGIC
))
651 reason
= "bad magic";
652 else if (le32_to_cpu(sb
->version
) < BITMAP_MAJOR_LO
||
653 le32_to_cpu(sb
->version
) > BITMAP_MAJOR_CLUSTERED
)
654 reason
= "unrecognized superblock version";
655 else if (chunksize
< 512)
656 reason
= "bitmap chunksize too small";
657 else if (!is_power_of_2(chunksize
))
658 reason
= "bitmap chunksize not a power of 2";
659 else if (daemon_sleep
< 1 || daemon_sleep
> MAX_SCHEDULE_TIMEOUT
)
660 reason
= "daemon sleep period out of range";
661 else if (write_behind
> COUNTER_MAX
)
662 reason
= "write-behind limit out of range (0 - 16383)";
664 pr_warn("%s: invalid bitmap file superblock: %s\n",
665 bmname(bitmap
), reason
);
669 /* keep the array size field of the bitmap superblock up to date */
670 sb
->sync_size
= cpu_to_le64(bitmap
->mddev
->resync_max_sectors
);
672 if (bitmap
->mddev
->persistent
) {
674 * We have a persistent array superblock, so compare the
675 * bitmap's UUID and event counter to the mddev's
677 if (memcmp(sb
->uuid
, bitmap
->mddev
->uuid
, 16)) {
678 pr_warn("%s: bitmap superblock UUID mismatch\n",
682 events
= le64_to_cpu(sb
->events
);
683 if (!nodes
&& (events
< bitmap
->mddev
->events
)) {
684 pr_warn("%s: bitmap file is out of date (%llu < %llu) -- forcing full recovery\n",
685 bmname(bitmap
), events
,
686 (unsigned long long) bitmap
->mddev
->events
);
687 set_bit(BITMAP_STALE
, &bitmap
->flags
);
691 /* assign fields using values from superblock */
692 bitmap
->flags
|= le32_to_cpu(sb
->state
);
693 if (le32_to_cpu(sb
->version
) == BITMAP_MAJOR_HOSTENDIAN
)
694 set_bit(BITMAP_HOSTENDIAN
, &bitmap
->flags
);
695 bitmap
->events_cleared
= le64_to_cpu(sb
->events_cleared
);
696 strlcpy(bitmap
->mddev
->bitmap_info
.cluster_name
, sb
->cluster_name
, 64);
701 /* Assigning chunksize is required for "re_read" */
702 bitmap
->mddev
->bitmap_info
.chunksize
= chunksize
;
703 if (err
== 0 && nodes
&& (bitmap
->cluster_slot
< 0)) {
704 err
= md_setup_cluster(bitmap
->mddev
, nodes
);
706 pr_warn("%s: Could not setup cluster service (%d)\n",
707 bmname(bitmap
), err
);
710 bitmap
->cluster_slot
= md_cluster_ops
->slot_number(bitmap
->mddev
);
716 if (test_bit(BITMAP_STALE
, &bitmap
->flags
))
717 bitmap
->events_cleared
= bitmap
->mddev
->events
;
718 bitmap
->mddev
->bitmap_info
.chunksize
= chunksize
;
719 bitmap
->mddev
->bitmap_info
.daemon_sleep
= daemon_sleep
;
720 bitmap
->mddev
->bitmap_info
.max_write_behind
= write_behind
;
721 bitmap
->mddev
->bitmap_info
.nodes
= nodes
;
722 if (bitmap
->mddev
->bitmap_info
.space
== 0 ||
723 bitmap
->mddev
->bitmap_info
.space
> sectors_reserved
)
724 bitmap
->mddev
->bitmap_info
.space
= sectors_reserved
;
726 bitmap_print_sb(bitmap
);
727 if (bitmap
->cluster_slot
< 0)
728 md_cluster_stop(bitmap
->mddev
);
734 * general bitmap file operations
740 * Use one bit per "chunk" (block set). We do the disk I/O on the bitmap
741 * file a page at a time. There's a superblock at the start of the file.
743 /* calculate the index of the page that contains this bit */
744 static inline unsigned long file_page_index(struct bitmap_storage
*store
,
748 chunk
+= sizeof(bitmap_super_t
) << 3;
749 return chunk
>> PAGE_BIT_SHIFT
;
752 /* calculate the (bit) offset of this bit within a page */
753 static inline unsigned long file_page_offset(struct bitmap_storage
*store
,
757 chunk
+= sizeof(bitmap_super_t
) << 3;
758 return chunk
& (PAGE_BITS
- 1);
762 * return a pointer to the page in the filemap that contains the given bit
765 static inline struct page
*filemap_get_page(struct bitmap_storage
*store
,
768 if (file_page_index(store
, chunk
) >= store
->file_pages
)
770 return store
->filemap
[file_page_index(store
, chunk
)];
773 static int bitmap_storage_alloc(struct bitmap_storage
*store
,
774 unsigned long chunks
, int with_super
,
777 int pnum
, offset
= 0;
778 unsigned long num_pages
;
781 bytes
= DIV_ROUND_UP(chunks
, 8);
783 bytes
+= sizeof(bitmap_super_t
);
785 num_pages
= DIV_ROUND_UP(bytes
, PAGE_SIZE
);
786 offset
= slot_number
* num_pages
;
788 store
->filemap
= kmalloc(sizeof(struct page
*)
789 * num_pages
, GFP_KERNEL
);
793 if (with_super
&& !store
->sb_page
) {
794 store
->sb_page
= alloc_page(GFP_KERNEL
|__GFP_ZERO
);
795 if (store
->sb_page
== NULL
)
800 if (store
->sb_page
) {
801 store
->filemap
[0] = store
->sb_page
;
803 store
->sb_page
->index
= offset
;
806 for ( ; pnum
< num_pages
; pnum
++) {
807 store
->filemap
[pnum
] = alloc_page(GFP_KERNEL
|__GFP_ZERO
);
808 if (!store
->filemap
[pnum
]) {
809 store
->file_pages
= pnum
;
812 store
->filemap
[pnum
]->index
= pnum
+ offset
;
814 store
->file_pages
= pnum
;
816 /* We need 4 bits per page, rounded up to a multiple
817 * of sizeof(unsigned long) */
818 store
->filemap_attr
= kzalloc(
819 roundup(DIV_ROUND_UP(num_pages
*4, 8), sizeof(unsigned long)),
821 if (!store
->filemap_attr
)
824 store
->bytes
= bytes
;
829 static void bitmap_file_unmap(struct bitmap_storage
*store
)
831 struct page
**map
, *sb_page
;
836 map
= store
->filemap
;
837 pages
= store
->file_pages
;
838 sb_page
= store
->sb_page
;
841 if (map
[pages
] != sb_page
) /* 0 is sb_page, release it below */
842 free_buffers(map
[pages
]);
844 kfree(store
->filemap_attr
);
847 free_buffers(sb_page
);
850 struct inode
*inode
= file_inode(file
);
851 invalidate_mapping_pages(inode
->i_mapping
, 0, -1);
857 * bitmap_file_kick - if an error occurs while manipulating the bitmap file
858 * then it is no longer reliable, so we stop using it and we mark the file
859 * as failed in the superblock
861 static void bitmap_file_kick(struct bitmap
*bitmap
)
863 char *path
, *ptr
= NULL
;
865 if (!test_and_set_bit(BITMAP_STALE
, &bitmap
->flags
)) {
866 bitmap_update_sb(bitmap
);
868 if (bitmap
->storage
.file
) {
869 path
= kmalloc(PAGE_SIZE
, GFP_KERNEL
);
871 ptr
= file_path(bitmap
->storage
.file
,
874 pr_warn("%s: kicking failed bitmap file %s from array!\n",
875 bmname(bitmap
), IS_ERR(ptr
) ? "" : ptr
);
879 pr_warn("%s: disabling internal bitmap due to errors\n",
884 enum bitmap_page_attr
{
885 BITMAP_PAGE_DIRTY
= 0, /* there are set bits that need to be synced */
886 BITMAP_PAGE_PENDING
= 1, /* there are bits that are being cleaned.
887 * i.e. counter is 1 or 2. */
888 BITMAP_PAGE_NEEDWRITE
= 2, /* there are cleared bits that need to be synced */
891 static inline void set_page_attr(struct bitmap
*bitmap
, int pnum
,
892 enum bitmap_page_attr attr
)
894 set_bit((pnum
<<2) + attr
, bitmap
->storage
.filemap_attr
);
897 static inline void clear_page_attr(struct bitmap
*bitmap
, int pnum
,
898 enum bitmap_page_attr attr
)
900 clear_bit((pnum
<<2) + attr
, bitmap
->storage
.filemap_attr
);
903 static inline int test_page_attr(struct bitmap
*bitmap
, int pnum
,
904 enum bitmap_page_attr attr
)
906 return test_bit((pnum
<<2) + attr
, bitmap
->storage
.filemap_attr
);
909 static inline int test_and_clear_page_attr(struct bitmap
*bitmap
, int pnum
,
910 enum bitmap_page_attr attr
)
912 return test_and_clear_bit((pnum
<<2) + attr
,
913 bitmap
->storage
.filemap_attr
);
916 * bitmap_file_set_bit -- called before performing a write to the md device
917 * to set (and eventually sync) a particular bit in the bitmap file
919 * we set the bit immediately, then we record the page number so that
920 * when an unplug occurs, we can flush the dirty pages out to disk
922 static void bitmap_file_set_bit(struct bitmap
*bitmap
, sector_t block
)
927 unsigned long chunk
= block
>> bitmap
->counts
.chunkshift
;
928 struct bitmap_storage
*store
= &bitmap
->storage
;
929 unsigned long node_offset
= 0;
931 if (mddev_is_clustered(bitmap
->mddev
))
932 node_offset
= bitmap
->cluster_slot
* store
->file_pages
;
934 page
= filemap_get_page(&bitmap
->storage
, chunk
);
937 bit
= file_page_offset(&bitmap
->storage
, chunk
);
940 kaddr
= kmap_atomic(page
);
941 if (test_bit(BITMAP_HOSTENDIAN
, &bitmap
->flags
))
944 set_bit_le(bit
, kaddr
);
945 kunmap_atomic(kaddr
);
946 pr_debug("set file bit %lu page %lu\n", bit
, page
->index
);
947 /* record page number so it gets flushed to disk when unplug occurs */
948 set_page_attr(bitmap
, page
->index
- node_offset
, BITMAP_PAGE_DIRTY
);
951 static void bitmap_file_clear_bit(struct bitmap
*bitmap
, sector_t block
)
956 unsigned long chunk
= block
>> bitmap
->counts
.chunkshift
;
957 struct bitmap_storage
*store
= &bitmap
->storage
;
958 unsigned long node_offset
= 0;
960 if (mddev_is_clustered(bitmap
->mddev
))
961 node_offset
= bitmap
->cluster_slot
* store
->file_pages
;
963 page
= filemap_get_page(&bitmap
->storage
, chunk
);
966 bit
= file_page_offset(&bitmap
->storage
, chunk
);
967 paddr
= kmap_atomic(page
);
968 if (test_bit(BITMAP_HOSTENDIAN
, &bitmap
->flags
))
969 clear_bit(bit
, paddr
);
971 clear_bit_le(bit
, paddr
);
972 kunmap_atomic(paddr
);
973 if (!test_page_attr(bitmap
, page
->index
- node_offset
, BITMAP_PAGE_NEEDWRITE
)) {
974 set_page_attr(bitmap
, page
->index
- node_offset
, BITMAP_PAGE_PENDING
);
975 bitmap
->allclean
= 0;
979 static int bitmap_file_test_bit(struct bitmap
*bitmap
, sector_t block
)
984 unsigned long chunk
= block
>> bitmap
->counts
.chunkshift
;
987 page
= filemap_get_page(&bitmap
->storage
, chunk
);
990 bit
= file_page_offset(&bitmap
->storage
, chunk
);
991 paddr
= kmap_atomic(page
);
992 if (test_bit(BITMAP_HOSTENDIAN
, &bitmap
->flags
))
993 set
= test_bit(bit
, paddr
);
995 set
= test_bit_le(bit
, paddr
);
996 kunmap_atomic(paddr
);
1001 /* this gets called when the md device is ready to unplug its underlying
1002 * (slave) device queues -- before we let any writes go down, we need to
1003 * sync the dirty pages of the bitmap file to disk */
1004 void bitmap_unplug(struct bitmap
*bitmap
)
1007 int dirty
, need_write
;
1010 if (!bitmap
|| !bitmap
->storage
.filemap
||
1011 test_bit(BITMAP_STALE
, &bitmap
->flags
))
1014 /* look at each page to see if there are any set bits that need to be
1015 * flushed out to disk */
1016 for (i
= 0; i
< bitmap
->storage
.file_pages
; i
++) {
1017 if (!bitmap
->storage
.filemap
)
1019 dirty
= test_and_clear_page_attr(bitmap
, i
, BITMAP_PAGE_DIRTY
);
1020 need_write
= test_and_clear_page_attr(bitmap
, i
,
1021 BITMAP_PAGE_NEEDWRITE
);
1022 if (dirty
|| need_write
) {
1024 bitmap_wait_writes(bitmap
);
1025 if (bitmap
->mddev
->queue
)
1026 blk_add_trace_msg(bitmap
->mddev
->queue
,
1027 "md bitmap_unplug");
1029 clear_page_attr(bitmap
, i
, BITMAP_PAGE_PENDING
);
1030 write_page(bitmap
, bitmap
->storage
.filemap
[i
], 0);
1035 bitmap_wait_writes(bitmap
);
1037 if (test_bit(BITMAP_WRITE_ERROR
, &bitmap
->flags
))
1038 bitmap_file_kick(bitmap
);
1040 EXPORT_SYMBOL(bitmap_unplug
);
1042 static void bitmap_set_memory_bits(struct bitmap
*bitmap
, sector_t offset
, int needed
);
1043 /* * bitmap_init_from_disk -- called at bitmap_create time to initialize
1044 * the in-memory bitmap from the on-disk bitmap -- also, sets up the
1045 * memory mapping of the bitmap file
1047 * if there's no bitmap file, or if the bitmap file had been
1048 * previously kicked from the array, we mark all the bits as
1049 * 1's in order to cause a full resync.
1051 * We ignore all bits for sectors that end earlier than 'start'.
1052 * This is used when reading an out-of-date bitmap...
1054 static int bitmap_init_from_disk(struct bitmap
*bitmap
, sector_t start
)
1056 unsigned long i
, chunks
, index
, oldindex
, bit
, node_offset
= 0;
1057 struct page
*page
= NULL
;
1058 unsigned long bit_cnt
= 0;
1060 unsigned long offset
;
1064 struct bitmap_storage
*store
= &bitmap
->storage
;
1066 chunks
= bitmap
->counts
.chunks
;
1069 if (!file
&& !bitmap
->mddev
->bitmap_info
.offset
) {
1070 /* No permanent bitmap - fill with '1s'. */
1071 store
->filemap
= NULL
;
1072 store
->file_pages
= 0;
1073 for (i
= 0; i
< chunks
; i
++) {
1074 /* if the disk bit is set, set the memory bit */
1075 int needed
= ((sector_t
)(i
+1) << (bitmap
->counts
.chunkshift
)
1077 bitmap_set_memory_bits(bitmap
,
1078 (sector_t
)i
<< bitmap
->counts
.chunkshift
,
1084 outofdate
= test_bit(BITMAP_STALE
, &bitmap
->flags
);
1086 pr_warn("%s: bitmap file is out of date, doing full recovery\n", bmname(bitmap
));
1088 if (file
&& i_size_read(file
->f_mapping
->host
) < store
->bytes
) {
1089 pr_warn("%s: bitmap file too short %lu < %lu\n",
1091 (unsigned long) i_size_read(file
->f_mapping
->host
),
1098 if (!bitmap
->mddev
->bitmap_info
.external
)
1099 offset
= sizeof(bitmap_super_t
);
1101 if (mddev_is_clustered(bitmap
->mddev
))
1102 node_offset
= bitmap
->cluster_slot
* (DIV_ROUND_UP(store
->bytes
, PAGE_SIZE
));
1104 for (i
= 0; i
< chunks
; i
++) {
1106 index
= file_page_index(&bitmap
->storage
, i
);
1107 bit
= file_page_offset(&bitmap
->storage
, i
);
1108 if (index
!= oldindex
) { /* this is a new page, read it in */
1110 /* unmap the old page, we're done with it */
1111 if (index
== store
->file_pages
-1)
1112 count
= store
->bytes
- index
* PAGE_SIZE
;
1115 page
= store
->filemap
[index
];
1117 ret
= read_page(file
, index
, bitmap
,
1122 bitmap
->mddev
->bitmap_info
.offset
,
1124 index
+ node_offset
, count
);
1133 * if bitmap is out of date, dirty the
1134 * whole page and write it out
1136 paddr
= kmap_atomic(page
);
1137 memset(paddr
+ offset
, 0xff,
1138 PAGE_SIZE
- offset
);
1139 kunmap_atomic(paddr
);
1140 write_page(bitmap
, page
, 1);
1143 if (test_bit(BITMAP_WRITE_ERROR
,
1148 paddr
= kmap_atomic(page
);
1149 if (test_bit(BITMAP_HOSTENDIAN
, &bitmap
->flags
))
1150 b
= test_bit(bit
, paddr
);
1152 b
= test_bit_le(bit
, paddr
);
1153 kunmap_atomic(paddr
);
1155 /* if the disk bit is set, set the memory bit */
1156 int needed
= ((sector_t
)(i
+1) << bitmap
->counts
.chunkshift
1158 bitmap_set_memory_bits(bitmap
,
1159 (sector_t
)i
<< bitmap
->counts
.chunkshift
,
1166 pr_debug("%s: bitmap initialized from disk: read %lu pages, set %lu of %lu bits\n",
1167 bmname(bitmap
), store
->file_pages
,
1173 pr_warn("%s: bitmap initialisation failed: %d\n",
1174 bmname(bitmap
), ret
);
1178 void bitmap_write_all(struct bitmap
*bitmap
)
1180 /* We don't actually write all bitmap blocks here,
1181 * just flag them as needing to be written
1185 if (!bitmap
|| !bitmap
->storage
.filemap
)
1187 if (bitmap
->storage
.file
)
1188 /* Only one copy, so nothing needed */
1191 for (i
= 0; i
< bitmap
->storage
.file_pages
; i
++)
1192 set_page_attr(bitmap
, i
,
1193 BITMAP_PAGE_NEEDWRITE
);
1194 bitmap
->allclean
= 0;
1197 static void bitmap_count_page(struct bitmap_counts
*bitmap
,
1198 sector_t offset
, int inc
)
1200 sector_t chunk
= offset
>> bitmap
->chunkshift
;
1201 unsigned long page
= chunk
>> PAGE_COUNTER_SHIFT
;
1202 bitmap
->bp
[page
].count
+= inc
;
1203 bitmap_checkfree(bitmap
, page
);
1206 static void bitmap_set_pending(struct bitmap_counts
*bitmap
, sector_t offset
)
1208 sector_t chunk
= offset
>> bitmap
->chunkshift
;
1209 unsigned long page
= chunk
>> PAGE_COUNTER_SHIFT
;
1210 struct bitmap_page
*bp
= &bitmap
->bp
[page
];
1216 static bitmap_counter_t
*bitmap_get_counter(struct bitmap_counts
*bitmap
,
1217 sector_t offset
, sector_t
*blocks
,
1221 * bitmap daemon -- periodically wakes up to clean bits and flush pages
1225 void bitmap_daemon_work(struct mddev
*mddev
)
1227 struct bitmap
*bitmap
;
1229 unsigned long nextpage
;
1231 struct bitmap_counts
*counts
;
1233 /* Use a mutex to guard daemon_work against
1236 mutex_lock(&mddev
->bitmap_info
.mutex
);
1237 bitmap
= mddev
->bitmap
;
1238 if (bitmap
== NULL
) {
1239 mutex_unlock(&mddev
->bitmap_info
.mutex
);
1242 if (time_before(jiffies
, bitmap
->daemon_lastrun
1243 + mddev
->bitmap_info
.daemon_sleep
))
1246 bitmap
->daemon_lastrun
= jiffies
;
1247 if (bitmap
->allclean
) {
1248 mddev
->thread
->timeout
= MAX_SCHEDULE_TIMEOUT
;
1251 bitmap
->allclean
= 1;
1253 if (bitmap
->mddev
->queue
)
1254 blk_add_trace_msg(bitmap
->mddev
->queue
,
1255 "md bitmap_daemon_work");
1257 /* Any file-page which is PENDING now needs to be written.
1258 * So set NEEDWRITE now, then after we make any last-minute changes
1261 for (j
= 0; j
< bitmap
->storage
.file_pages
; j
++)
1262 if (test_and_clear_page_attr(bitmap
, j
,
1263 BITMAP_PAGE_PENDING
))
1264 set_page_attr(bitmap
, j
,
1265 BITMAP_PAGE_NEEDWRITE
);
1267 if (bitmap
->need_sync
&&
1268 mddev
->bitmap_info
.external
== 0) {
1269 /* Arrange for superblock update as well as
1272 bitmap
->need_sync
= 0;
1273 if (bitmap
->storage
.filemap
) {
1274 sb
= kmap_atomic(bitmap
->storage
.sb_page
);
1275 sb
->events_cleared
=
1276 cpu_to_le64(bitmap
->events_cleared
);
1278 set_page_attr(bitmap
, 0,
1279 BITMAP_PAGE_NEEDWRITE
);
1282 /* Now look at the bitmap counters and if any are '2' or '1',
1283 * decrement and handle accordingly.
1285 counts
= &bitmap
->counts
;
1286 spin_lock_irq(&counts
->lock
);
1288 for (j
= 0; j
< counts
->chunks
; j
++) {
1289 bitmap_counter_t
*bmc
;
1290 sector_t block
= (sector_t
)j
<< counts
->chunkshift
;
1292 if (j
== nextpage
) {
1293 nextpage
+= PAGE_COUNTER_RATIO
;
1294 if (!counts
->bp
[j
>> PAGE_COUNTER_SHIFT
].pending
) {
1295 j
|= PAGE_COUNTER_MASK
;
1298 counts
->bp
[j
>> PAGE_COUNTER_SHIFT
].pending
= 0;
1300 bmc
= bitmap_get_counter(counts
,
1305 j
|= PAGE_COUNTER_MASK
;
1308 if (*bmc
== 1 && !bitmap
->need_sync
) {
1309 /* We can clear the bit */
1311 bitmap_count_page(counts
, block
, -1);
1312 bitmap_file_clear_bit(bitmap
, block
);
1313 } else if (*bmc
&& *bmc
<= 2) {
1315 bitmap_set_pending(counts
, block
);
1316 bitmap
->allclean
= 0;
1319 spin_unlock_irq(&counts
->lock
);
1321 bitmap_wait_writes(bitmap
);
1322 /* Now start writeout on any page in NEEDWRITE that isn't DIRTY.
1323 * DIRTY pages need to be written by bitmap_unplug so it can wait
1325 * If we find any DIRTY page we stop there and let bitmap_unplug
1326 * handle all the rest. This is important in the case where
1327 * the first blocking holds the superblock and it has been updated.
1328 * We mustn't write any other blocks before the superblock.
1331 j
< bitmap
->storage
.file_pages
1332 && !test_bit(BITMAP_STALE
, &bitmap
->flags
);
1334 if (test_page_attr(bitmap
, j
,
1336 /* bitmap_unplug will handle the rest */
1338 if (test_and_clear_page_attr(bitmap
, j
,
1339 BITMAP_PAGE_NEEDWRITE
)) {
1340 write_page(bitmap
, bitmap
->storage
.filemap
[j
], 0);
1345 if (bitmap
->allclean
== 0)
1346 mddev
->thread
->timeout
=
1347 mddev
->bitmap_info
.daemon_sleep
;
1348 mutex_unlock(&mddev
->bitmap_info
.mutex
);
1351 static bitmap_counter_t
*bitmap_get_counter(struct bitmap_counts
*bitmap
,
1352 sector_t offset
, sector_t
*blocks
,
1354 __releases(bitmap
->lock
)
1355 __acquires(bitmap
->lock
)
1357 /* If 'create', we might release the lock and reclaim it.
1358 * The lock must have been taken with interrupts enabled.
1359 * If !create, we don't release the lock.
1361 sector_t chunk
= offset
>> bitmap
->chunkshift
;
1362 unsigned long page
= chunk
>> PAGE_COUNTER_SHIFT
;
1363 unsigned long pageoff
= (chunk
& PAGE_COUNTER_MASK
) << COUNTER_BYTE_SHIFT
;
1367 err
= bitmap_checkpage(bitmap
, page
, create
, 0);
1369 if (bitmap
->bp
[page
].hijacked
||
1370 bitmap
->bp
[page
].map
== NULL
)
1371 csize
= ((sector_t
)1) << (bitmap
->chunkshift
+
1372 PAGE_COUNTER_SHIFT
- 1);
1374 csize
= ((sector_t
)1) << bitmap
->chunkshift
;
1375 *blocks
= csize
- (offset
& (csize
- 1));
1380 /* now locked ... */
1382 if (bitmap
->bp
[page
].hijacked
) { /* hijacked pointer */
1383 /* should we use the first or second counter field
1384 * of the hijacked pointer? */
1385 int hi
= (pageoff
> PAGE_COUNTER_MASK
);
1386 return &((bitmap_counter_t
*)
1387 &bitmap
->bp
[page
].map
)[hi
];
1388 } else /* page is allocated */
1389 return (bitmap_counter_t
*)
1390 &(bitmap
->bp
[page
].map
[pageoff
]);
1393 int bitmap_startwrite(struct bitmap
*bitmap
, sector_t offset
, unsigned long sectors
, int behind
)
1400 atomic_inc(&bitmap
->behind_writes
);
1401 bw
= atomic_read(&bitmap
->behind_writes
);
1402 if (bw
> bitmap
->behind_writes_used
)
1403 bitmap
->behind_writes_used
= bw
;
1405 pr_debug("inc write-behind count %d/%lu\n",
1406 bw
, bitmap
->mddev
->bitmap_info
.max_write_behind
);
1411 bitmap_counter_t
*bmc
;
1413 spin_lock_irq(&bitmap
->counts
.lock
);
1414 bmc
= bitmap_get_counter(&bitmap
->counts
, offset
, &blocks
, 1);
1416 spin_unlock_irq(&bitmap
->counts
.lock
);
1420 if (unlikely(COUNTER(*bmc
) == COUNTER_MAX
)) {
1421 DEFINE_WAIT(__wait
);
1422 /* note that it is safe to do the prepare_to_wait
1423 * after the test as long as we do it before dropping
1426 prepare_to_wait(&bitmap
->overflow_wait
, &__wait
,
1427 TASK_UNINTERRUPTIBLE
);
1428 spin_unlock_irq(&bitmap
->counts
.lock
);
1430 finish_wait(&bitmap
->overflow_wait
, &__wait
);
1436 bitmap_file_set_bit(bitmap
, offset
);
1437 bitmap_count_page(&bitmap
->counts
, offset
, 1);
1445 spin_unlock_irq(&bitmap
->counts
.lock
);
1448 if (sectors
> blocks
)
1455 EXPORT_SYMBOL(bitmap_startwrite
);
1457 void bitmap_endwrite(struct bitmap
*bitmap
, sector_t offset
, unsigned long sectors
,
1458 int success
, int behind
)
1463 if (atomic_dec_and_test(&bitmap
->behind_writes
))
1464 wake_up(&bitmap
->behind_wait
);
1465 pr_debug("dec write-behind count %d/%lu\n",
1466 atomic_read(&bitmap
->behind_writes
),
1467 bitmap
->mddev
->bitmap_info
.max_write_behind
);
1472 unsigned long flags
;
1473 bitmap_counter_t
*bmc
;
1475 spin_lock_irqsave(&bitmap
->counts
.lock
, flags
);
1476 bmc
= bitmap_get_counter(&bitmap
->counts
, offset
, &blocks
, 0);
1478 spin_unlock_irqrestore(&bitmap
->counts
.lock
, flags
);
1482 if (success
&& !bitmap
->mddev
->degraded
&&
1483 bitmap
->events_cleared
< bitmap
->mddev
->events
) {
1484 bitmap
->events_cleared
= bitmap
->mddev
->events
;
1485 bitmap
->need_sync
= 1;
1486 sysfs_notify_dirent_safe(bitmap
->sysfs_can_clear
);
1489 if (!success
&& !NEEDED(*bmc
))
1490 *bmc
|= NEEDED_MASK
;
1492 if (COUNTER(*bmc
) == COUNTER_MAX
)
1493 wake_up(&bitmap
->overflow_wait
);
1497 bitmap_set_pending(&bitmap
->counts
, offset
);
1498 bitmap
->allclean
= 0;
1500 spin_unlock_irqrestore(&bitmap
->counts
.lock
, flags
);
1502 if (sectors
> blocks
)
1508 EXPORT_SYMBOL(bitmap_endwrite
);
1510 static int __bitmap_start_sync(struct bitmap
*bitmap
, sector_t offset
, sector_t
*blocks
,
1513 bitmap_counter_t
*bmc
;
1515 if (bitmap
== NULL
) {/* FIXME or bitmap set as 'failed' */
1517 return 1; /* always resync if no bitmap */
1519 spin_lock_irq(&bitmap
->counts
.lock
);
1520 bmc
= bitmap_get_counter(&bitmap
->counts
, offset
, blocks
, 0);
1526 else if (NEEDED(*bmc
)) {
1528 if (!degraded
) { /* don't set/clear bits if degraded */
1529 *bmc
|= RESYNC_MASK
;
1530 *bmc
&= ~NEEDED_MASK
;
1534 spin_unlock_irq(&bitmap
->counts
.lock
);
1538 int bitmap_start_sync(struct bitmap
*bitmap
, sector_t offset
, sector_t
*blocks
,
1541 /* bitmap_start_sync must always report on multiples of whole
1542 * pages, otherwise resync (which is very PAGE_SIZE based) will
1544 * So call __bitmap_start_sync repeatedly (if needed) until
1545 * At least PAGE_SIZE>>9 blocks are covered.
1546 * Return the 'or' of the result.
1552 while (*blocks
< (PAGE_SIZE
>>9)) {
1553 rv
|= __bitmap_start_sync(bitmap
, offset
,
1554 &blocks1
, degraded
);
1560 EXPORT_SYMBOL(bitmap_start_sync
);
1562 void bitmap_end_sync(struct bitmap
*bitmap
, sector_t offset
, sector_t
*blocks
, int aborted
)
1564 bitmap_counter_t
*bmc
;
1565 unsigned long flags
;
1567 if (bitmap
== NULL
) {
1571 spin_lock_irqsave(&bitmap
->counts
.lock
, flags
);
1572 bmc
= bitmap_get_counter(&bitmap
->counts
, offset
, blocks
, 0);
1577 *bmc
&= ~RESYNC_MASK
;
1579 if (!NEEDED(*bmc
) && aborted
)
1580 *bmc
|= NEEDED_MASK
;
1583 bitmap_set_pending(&bitmap
->counts
, offset
);
1584 bitmap
->allclean
= 0;
1589 spin_unlock_irqrestore(&bitmap
->counts
.lock
, flags
);
1591 EXPORT_SYMBOL(bitmap_end_sync
);
1593 void bitmap_close_sync(struct bitmap
*bitmap
)
1595 /* Sync has finished, and any bitmap chunks that weren't synced
1596 * properly have been aborted. It remains to us to clear the
1597 * RESYNC bit wherever it is still on
1599 sector_t sector
= 0;
1603 while (sector
< bitmap
->mddev
->resync_max_sectors
) {
1604 bitmap_end_sync(bitmap
, sector
, &blocks
, 0);
1608 EXPORT_SYMBOL(bitmap_close_sync
);
1610 void bitmap_cond_end_sync(struct bitmap
*bitmap
, sector_t sector
, bool force
)
1618 bitmap
->last_end_sync
= jiffies
;
1621 if (!force
&& time_before(jiffies
, (bitmap
->last_end_sync
1622 + bitmap
->mddev
->bitmap_info
.daemon_sleep
)))
1624 wait_event(bitmap
->mddev
->recovery_wait
,
1625 atomic_read(&bitmap
->mddev
->recovery_active
) == 0);
1627 bitmap
->mddev
->curr_resync_completed
= sector
;
1628 set_bit(MD_SB_CHANGE_CLEAN
, &bitmap
->mddev
->sb_flags
);
1629 sector
&= ~((1ULL << bitmap
->counts
.chunkshift
) - 1);
1631 while (s
< sector
&& s
< bitmap
->mddev
->resync_max_sectors
) {
1632 bitmap_end_sync(bitmap
, s
, &blocks
, 0);
1635 bitmap
->last_end_sync
= jiffies
;
1636 sysfs_notify(&bitmap
->mddev
->kobj
, NULL
, "sync_completed");
1638 EXPORT_SYMBOL(bitmap_cond_end_sync
);
1640 void bitmap_sync_with_cluster(struct mddev
*mddev
,
1641 sector_t old_lo
, sector_t old_hi
,
1642 sector_t new_lo
, sector_t new_hi
)
1644 struct bitmap
*bitmap
= mddev
->bitmap
;
1645 sector_t sector
, blocks
= 0;
1647 for (sector
= old_lo
; sector
< new_lo
; ) {
1648 bitmap_end_sync(bitmap
, sector
, &blocks
, 0);
1651 WARN((blocks
> new_lo
) && old_lo
, "alignment is not correct for lo\n");
1653 for (sector
= old_hi
; sector
< new_hi
; ) {
1654 bitmap_start_sync(bitmap
, sector
, &blocks
, 0);
1657 WARN((blocks
> new_hi
) && old_hi
, "alignment is not correct for hi\n");
1659 EXPORT_SYMBOL(bitmap_sync_with_cluster
);
1661 static void bitmap_set_memory_bits(struct bitmap
*bitmap
, sector_t offset
, int needed
)
1663 /* For each chunk covered by any of these sectors, set the
1664 * counter to 2 and possibly set resync_needed. They should all
1665 * be 0 at this point
1669 bitmap_counter_t
*bmc
;
1670 spin_lock_irq(&bitmap
->counts
.lock
);
1671 bmc
= bitmap_get_counter(&bitmap
->counts
, offset
, &secs
, 1);
1673 spin_unlock_irq(&bitmap
->counts
.lock
);
1678 bitmap_count_page(&bitmap
->counts
, offset
, 1);
1679 bitmap_set_pending(&bitmap
->counts
, offset
);
1680 bitmap
->allclean
= 0;
1683 *bmc
|= NEEDED_MASK
;
1684 spin_unlock_irq(&bitmap
->counts
.lock
);
1687 /* dirty the memory and file bits for bitmap chunks "s" to "e" */
1688 void bitmap_dirty_bits(struct bitmap
*bitmap
, unsigned long s
, unsigned long e
)
1690 unsigned long chunk
;
1692 for (chunk
= s
; chunk
<= e
; chunk
++) {
1693 sector_t sec
= (sector_t
)chunk
<< bitmap
->counts
.chunkshift
;
1694 bitmap_set_memory_bits(bitmap
, sec
, 1);
1695 bitmap_file_set_bit(bitmap
, sec
);
1696 if (sec
< bitmap
->mddev
->recovery_cp
)
1697 /* We are asserting that the array is dirty,
1698 * so move the recovery_cp address back so
1699 * that it is obvious that it is dirty
1701 bitmap
->mddev
->recovery_cp
= sec
;
1706 * flush out any pending updates
1708 void bitmap_flush(struct mddev
*mddev
)
1710 struct bitmap
*bitmap
= mddev
->bitmap
;
1713 if (!bitmap
) /* there was no bitmap */
1716 /* run the daemon_work three time to ensure everything is flushed
1719 sleep
= mddev
->bitmap_info
.daemon_sleep
* 2;
1720 bitmap
->daemon_lastrun
-= sleep
;
1721 bitmap_daemon_work(mddev
);
1722 bitmap
->daemon_lastrun
-= sleep
;
1723 bitmap_daemon_work(mddev
);
1724 bitmap
->daemon_lastrun
-= sleep
;
1725 bitmap_daemon_work(mddev
);
1726 bitmap_update_sb(bitmap
);
1730 * free memory that was allocated
1732 void bitmap_free(struct bitmap
*bitmap
)
1734 unsigned long k
, pages
;
1735 struct bitmap_page
*bp
;
1737 if (!bitmap
) /* there was no bitmap */
1740 if (bitmap
->sysfs_can_clear
)
1741 sysfs_put(bitmap
->sysfs_can_clear
);
1743 if (mddev_is_clustered(bitmap
->mddev
) && bitmap
->mddev
->cluster_info
&&
1744 bitmap
->cluster_slot
== md_cluster_ops
->slot_number(bitmap
->mddev
))
1745 md_cluster_stop(bitmap
->mddev
);
1747 /* Shouldn't be needed - but just in case.... */
1748 wait_event(bitmap
->write_wait
,
1749 atomic_read(&bitmap
->pending_writes
) == 0);
1751 /* release the bitmap file */
1752 bitmap_file_unmap(&bitmap
->storage
);
1754 bp
= bitmap
->counts
.bp
;
1755 pages
= bitmap
->counts
.pages
;
1757 /* free all allocated memory */
1759 if (bp
) /* deallocate the page memory */
1760 for (k
= 0; k
< pages
; k
++)
1761 if (bp
[k
].map
&& !bp
[k
].hijacked
)
1766 EXPORT_SYMBOL(bitmap_free
);
1768 void bitmap_wait_behind_writes(struct mddev
*mddev
)
1770 struct bitmap
*bitmap
= mddev
->bitmap
;
1772 /* wait for behind writes to complete */
1773 if (bitmap
&& atomic_read(&bitmap
->behind_writes
) > 0) {
1774 pr_debug("md:%s: behind writes in progress - waiting to stop.\n",
1776 /* need to kick something here to make sure I/O goes? */
1777 wait_event(bitmap
->behind_wait
,
1778 atomic_read(&bitmap
->behind_writes
) == 0);
1782 void bitmap_destroy(struct mddev
*mddev
)
1784 struct bitmap
*bitmap
= mddev
->bitmap
;
1786 if (!bitmap
) /* there was no bitmap */
1789 bitmap_wait_behind_writes(mddev
);
1791 mutex_lock(&mddev
->bitmap_info
.mutex
);
1792 spin_lock(&mddev
->lock
);
1793 mddev
->bitmap
= NULL
; /* disconnect from the md device */
1794 spin_unlock(&mddev
->lock
);
1795 mutex_unlock(&mddev
->bitmap_info
.mutex
);
1797 mddev
->thread
->timeout
= MAX_SCHEDULE_TIMEOUT
;
1799 bitmap_free(bitmap
);
1803 * initialize the bitmap structure
1804 * if this returns an error, bitmap_destroy must be called to do clean up
1805 * once mddev->bitmap is set
1807 struct bitmap
*bitmap_create(struct mddev
*mddev
, int slot
)
1809 struct bitmap
*bitmap
;
1810 sector_t blocks
= mddev
->resync_max_sectors
;
1811 struct file
*file
= mddev
->bitmap_info
.file
;
1813 struct kernfs_node
*bm
= NULL
;
1815 BUILD_BUG_ON(sizeof(bitmap_super_t
) != 256);
1817 BUG_ON(file
&& mddev
->bitmap_info
.offset
);
1819 if (test_bit(MD_HAS_JOURNAL
, &mddev
->flags
)) {
1820 pr_notice("md/raid:%s: array with journal cannot have bitmap\n",
1822 return ERR_PTR(-EBUSY
);
1825 bitmap
= kzalloc(sizeof(*bitmap
), GFP_KERNEL
);
1827 return ERR_PTR(-ENOMEM
);
1829 spin_lock_init(&bitmap
->counts
.lock
);
1830 atomic_set(&bitmap
->pending_writes
, 0);
1831 init_waitqueue_head(&bitmap
->write_wait
);
1832 init_waitqueue_head(&bitmap
->overflow_wait
);
1833 init_waitqueue_head(&bitmap
->behind_wait
);
1835 bitmap
->mddev
= mddev
;
1836 bitmap
->cluster_slot
= slot
;
1839 bm
= sysfs_get_dirent(mddev
->kobj
.sd
, "bitmap");
1841 bitmap
->sysfs_can_clear
= sysfs_get_dirent(bm
, "can_clear");
1844 bitmap
->sysfs_can_clear
= NULL
;
1846 bitmap
->storage
.file
= file
;
1849 /* As future accesses to this file will use bmap,
1850 * and bypass the page cache, we must sync the file
1855 /* read superblock from bitmap file (this sets mddev->bitmap_info.chunksize) */
1856 if (!mddev
->bitmap_info
.external
) {
1858 * If 'MD_ARRAY_FIRST_USE' is set, then device-mapper is
1859 * instructing us to create a new on-disk bitmap instance.
1861 if (test_and_clear_bit(MD_ARRAY_FIRST_USE
, &mddev
->flags
))
1862 err
= bitmap_new_disk_sb(bitmap
);
1864 err
= bitmap_read_sb(bitmap
);
1867 if (mddev
->bitmap_info
.chunksize
== 0 ||
1868 mddev
->bitmap_info
.daemon_sleep
== 0)
1869 /* chunksize and time_base need to be
1876 bitmap
->daemon_lastrun
= jiffies
;
1877 err
= bitmap_resize(bitmap
, blocks
, mddev
->bitmap_info
.chunksize
, 1);
1881 pr_debug("created bitmap (%lu pages) for device %s\n",
1882 bitmap
->counts
.pages
, bmname(bitmap
));
1884 err
= test_bit(BITMAP_WRITE_ERROR
, &bitmap
->flags
) ? -EIO
: 0;
1890 bitmap_free(bitmap
);
1891 return ERR_PTR(err
);
1894 int bitmap_load(struct mddev
*mddev
)
1898 sector_t sector
= 0;
1899 struct bitmap
*bitmap
= mddev
->bitmap
;
1904 if (mddev_is_clustered(mddev
))
1905 md_cluster_ops
->load_bitmaps(mddev
, mddev
->bitmap_info
.nodes
);
1907 /* Clear out old bitmap info first: Either there is none, or we
1908 * are resuming after someone else has possibly changed things,
1909 * so we should forget old cached info.
1910 * All chunks should be clean, but some might need_sync.
1912 while (sector
< mddev
->resync_max_sectors
) {
1914 bitmap_start_sync(bitmap
, sector
, &blocks
, 0);
1917 bitmap_close_sync(bitmap
);
1919 if (mddev
->degraded
== 0
1920 || bitmap
->events_cleared
== mddev
->events
)
1921 /* no need to keep dirty bits to optimise a
1922 * re-add of a missing device */
1923 start
= mddev
->recovery_cp
;
1925 mutex_lock(&mddev
->bitmap_info
.mutex
);
1926 err
= bitmap_init_from_disk(bitmap
, start
);
1927 mutex_unlock(&mddev
->bitmap_info
.mutex
);
1931 clear_bit(BITMAP_STALE
, &bitmap
->flags
);
1933 /* Kick recovery in case any bits were set */
1934 set_bit(MD_RECOVERY_NEEDED
, &bitmap
->mddev
->recovery
);
1936 mddev
->thread
->timeout
= mddev
->bitmap_info
.daemon_sleep
;
1937 md_wakeup_thread(mddev
->thread
);
1939 bitmap_update_sb(bitmap
);
1941 if (test_bit(BITMAP_WRITE_ERROR
, &bitmap
->flags
))
1946 EXPORT_SYMBOL_GPL(bitmap_load
);
1948 struct bitmap
*get_bitmap_from_slot(struct mddev
*mddev
, int slot
)
1951 struct bitmap
*bitmap
;
1953 bitmap
= bitmap_create(mddev
, slot
);
1954 if (IS_ERR(bitmap
)) {
1955 rv
= PTR_ERR(bitmap
);
1959 rv
= bitmap_init_from_disk(bitmap
, 0);
1961 bitmap_free(bitmap
);
1967 EXPORT_SYMBOL(get_bitmap_from_slot
);
1969 /* Loads the bitmap associated with slot and copies the resync information
1972 int bitmap_copy_from_slot(struct mddev
*mddev
, int slot
,
1973 sector_t
*low
, sector_t
*high
, bool clear_bits
)
1976 sector_t block
, lo
= 0, hi
= 0;
1977 struct bitmap_counts
*counts
;
1978 struct bitmap
*bitmap
;
1980 bitmap
= get_bitmap_from_slot(mddev
, slot
);
1981 if (IS_ERR(bitmap
)) {
1982 pr_err("%s can't get bitmap from slot %d\n", __func__
, slot
);
1986 counts
= &bitmap
->counts
;
1987 for (j
= 0; j
< counts
->chunks
; j
++) {
1988 block
= (sector_t
)j
<< counts
->chunkshift
;
1989 if (bitmap_file_test_bit(bitmap
, block
)) {
1993 bitmap_file_clear_bit(bitmap
, block
);
1994 bitmap_set_memory_bits(mddev
->bitmap
, block
, 1);
1995 bitmap_file_set_bit(mddev
->bitmap
, block
);
2000 bitmap_update_sb(bitmap
);
2001 /* BITMAP_PAGE_PENDING is set, but bitmap_unplug needs
2002 * BITMAP_PAGE_DIRTY or _NEEDWRITE to write ... */
2003 for (i
= 0; i
< bitmap
->storage
.file_pages
; i
++)
2004 if (test_page_attr(bitmap
, i
, BITMAP_PAGE_PENDING
))
2005 set_page_attr(bitmap
, i
, BITMAP_PAGE_NEEDWRITE
);
2006 bitmap_unplug(bitmap
);
2008 bitmap_unplug(mddev
->bitmap
);
2014 EXPORT_SYMBOL_GPL(bitmap_copy_from_slot
);
2017 void bitmap_status(struct seq_file
*seq
, struct bitmap
*bitmap
)
2019 unsigned long chunk_kb
;
2020 struct bitmap_counts
*counts
;
2025 counts
= &bitmap
->counts
;
2027 chunk_kb
= bitmap
->mddev
->bitmap_info
.chunksize
>> 10;
2028 seq_printf(seq
, "bitmap: %lu/%lu pages [%luKB], "
2030 counts
->pages
- counts
->missing_pages
,
2032 (counts
->pages
- counts
->missing_pages
)
2033 << (PAGE_SHIFT
- 10),
2034 chunk_kb
? chunk_kb
: bitmap
->mddev
->bitmap_info
.chunksize
,
2035 chunk_kb
? "KB" : "B");
2036 if (bitmap
->storage
.file
) {
2037 seq_printf(seq
, ", file: ");
2038 seq_file_path(seq
, bitmap
->storage
.file
, " \t\n");
2041 seq_printf(seq
, "\n");
2044 int bitmap_resize(struct bitmap
*bitmap
, sector_t blocks
,
2045 int chunksize
, int init
)
2047 /* If chunk_size is 0, choose an appropriate chunk size.
2048 * Then possibly allocate new storage space.
2049 * Then quiesce, copy bits, replace bitmap, and re-start
2051 * This function is called both to set up the initial bitmap
2052 * and to resize the bitmap while the array is active.
2053 * If this happens as a result of the array being resized,
2054 * chunksize will be zero, and we need to choose a suitable
2055 * chunksize, otherwise we use what we are given.
2057 struct bitmap_storage store
;
2058 struct bitmap_counts old_counts
;
2059 unsigned long chunks
;
2061 sector_t old_blocks
, new_blocks
;
2065 struct bitmap_page
*new_bp
;
2067 if (bitmap
->storage
.file
&& !init
) {
2068 pr_info("md: cannot resize file-based bitmap\n");
2072 if (chunksize
== 0) {
2073 /* If there is enough space, leave the chunk size unchanged,
2074 * else increase by factor of two until there is enough space.
2077 long space
= bitmap
->mddev
->bitmap_info
.space
;
2080 /* We don't know how much space there is, so limit
2081 * to current size - in sectors.
2083 bytes
= DIV_ROUND_UP(bitmap
->counts
.chunks
, 8);
2084 if (!bitmap
->mddev
->bitmap_info
.external
)
2085 bytes
+= sizeof(bitmap_super_t
);
2086 space
= DIV_ROUND_UP(bytes
, 512);
2087 bitmap
->mddev
->bitmap_info
.space
= space
;
2089 chunkshift
= bitmap
->counts
.chunkshift
;
2092 /* 'chunkshift' is shift from block size to chunk size */
2094 chunks
= DIV_ROUND_UP_SECTOR_T(blocks
, 1 << chunkshift
);
2095 bytes
= DIV_ROUND_UP(chunks
, 8);
2096 if (!bitmap
->mddev
->bitmap_info
.external
)
2097 bytes
+= sizeof(bitmap_super_t
);
2098 } while (bytes
> (space
<< 9));
2100 chunkshift
= ffz(~chunksize
) - BITMAP_BLOCK_SHIFT
;
2102 chunks
= DIV_ROUND_UP_SECTOR_T(blocks
, 1 << chunkshift
);
2103 memset(&store
, 0, sizeof(store
));
2104 if (bitmap
->mddev
->bitmap_info
.offset
|| bitmap
->mddev
->bitmap_info
.file
)
2105 ret
= bitmap_storage_alloc(&store
, chunks
,
2106 !bitmap
->mddev
->bitmap_info
.external
,
2107 mddev_is_clustered(bitmap
->mddev
)
2108 ? bitmap
->cluster_slot
: 0);
2110 bitmap_file_unmap(&store
);
2114 pages
= DIV_ROUND_UP(chunks
, PAGE_COUNTER_RATIO
);
2116 new_bp
= kzalloc(pages
* sizeof(*new_bp
), GFP_KERNEL
);
2119 bitmap_file_unmap(&store
);
2124 bitmap
->mddev
->pers
->quiesce(bitmap
->mddev
, 1);
2126 store
.file
= bitmap
->storage
.file
;
2127 bitmap
->storage
.file
= NULL
;
2129 if (store
.sb_page
&& bitmap
->storage
.sb_page
)
2130 memcpy(page_address(store
.sb_page
),
2131 page_address(bitmap
->storage
.sb_page
),
2132 sizeof(bitmap_super_t
));
2133 bitmap_file_unmap(&bitmap
->storage
);
2134 bitmap
->storage
= store
;
2136 old_counts
= bitmap
->counts
;
2137 bitmap
->counts
.bp
= new_bp
;
2138 bitmap
->counts
.pages
= pages
;
2139 bitmap
->counts
.missing_pages
= pages
;
2140 bitmap
->counts
.chunkshift
= chunkshift
;
2141 bitmap
->counts
.chunks
= chunks
;
2142 bitmap
->mddev
->bitmap_info
.chunksize
= 1 << (chunkshift
+
2143 BITMAP_BLOCK_SHIFT
);
2145 blocks
= min(old_counts
.chunks
<< old_counts
.chunkshift
,
2146 chunks
<< chunkshift
);
2148 spin_lock_irq(&bitmap
->counts
.lock
);
2149 /* For cluster raid, need to pre-allocate bitmap */
2150 if (mddev_is_clustered(bitmap
->mddev
)) {
2152 for (page
= 0; page
< pages
; page
++) {
2153 ret
= bitmap_checkpage(&bitmap
->counts
, page
, 1, 1);
2157 /* deallocate the page memory */
2158 for (k
= 0; k
< page
; k
++) {
2159 kfree(new_bp
[k
].map
);
2163 /* restore some fields from old_counts */
2164 bitmap
->counts
.bp
= old_counts
.bp
;
2165 bitmap
->counts
.pages
= old_counts
.pages
;
2166 bitmap
->counts
.missing_pages
= old_counts
.pages
;
2167 bitmap
->counts
.chunkshift
= old_counts
.chunkshift
;
2168 bitmap
->counts
.chunks
= old_counts
.chunks
;
2169 bitmap
->mddev
->bitmap_info
.chunksize
= 1 << (old_counts
.chunkshift
+
2170 BITMAP_BLOCK_SHIFT
);
2171 blocks
= old_counts
.chunks
<< old_counts
.chunkshift
;
2172 pr_warn("Could not pre-allocate in-memory bitmap for cluster raid\n");
2175 bitmap
->counts
.bp
[page
].count
+= 1;
2179 for (block
= 0; block
< blocks
; ) {
2180 bitmap_counter_t
*bmc_old
, *bmc_new
;
2183 bmc_old
= bitmap_get_counter(&old_counts
, block
,
2185 set
= bmc_old
&& NEEDED(*bmc_old
);
2188 bmc_new
= bitmap_get_counter(&bitmap
->counts
, block
,
2190 if (*bmc_new
== 0) {
2191 /* need to set on-disk bits too. */
2192 sector_t end
= block
+ new_blocks
;
2193 sector_t start
= block
>> chunkshift
;
2194 start
<<= chunkshift
;
2195 while (start
< end
) {
2196 bitmap_file_set_bit(bitmap
, block
);
2197 start
+= 1 << chunkshift
;
2200 bitmap_count_page(&bitmap
->counts
,
2202 bitmap_set_pending(&bitmap
->counts
,
2205 *bmc_new
|= NEEDED_MASK
;
2206 if (new_blocks
< old_blocks
)
2207 old_blocks
= new_blocks
;
2209 block
+= old_blocks
;
2212 if (bitmap
->counts
.bp
!= old_counts
.bp
) {
2214 for (k
= 0; k
< old_counts
.pages
; k
++)
2215 if (!old_counts
.bp
[k
].hijacked
)
2216 kfree(old_counts
.bp
[k
].map
);
2217 kfree(old_counts
.bp
);
2222 while (block
< (chunks
<< chunkshift
)) {
2223 bitmap_counter_t
*bmc
;
2224 bmc
= bitmap_get_counter(&bitmap
->counts
, block
,
2227 /* new space. It needs to be resynced, so
2228 * we set NEEDED_MASK.
2231 *bmc
= NEEDED_MASK
| 2;
2232 bitmap_count_page(&bitmap
->counts
,
2234 bitmap_set_pending(&bitmap
->counts
,
2238 block
+= new_blocks
;
2240 for (i
= 0; i
< bitmap
->storage
.file_pages
; i
++)
2241 set_page_attr(bitmap
, i
, BITMAP_PAGE_DIRTY
);
2243 spin_unlock_irq(&bitmap
->counts
.lock
);
2246 bitmap_unplug(bitmap
);
2247 bitmap
->mddev
->pers
->quiesce(bitmap
->mddev
, 0);
2253 EXPORT_SYMBOL_GPL(bitmap_resize
);
2256 location_show(struct mddev
*mddev
, char *page
)
2259 if (mddev
->bitmap_info
.file
)
2260 len
= sprintf(page
, "file");
2261 else if (mddev
->bitmap_info
.offset
)
2262 len
= sprintf(page
, "%+lld", (long long)mddev
->bitmap_info
.offset
);
2264 len
= sprintf(page
, "none");
2265 len
+= sprintf(page
+len
, "\n");
2270 location_store(struct mddev
*mddev
, const char *buf
, size_t len
)
2274 rv
= mddev_lock(mddev
);
2278 if (!mddev
->pers
->quiesce
) {
2282 if (mddev
->recovery
|| mddev
->sync_thread
) {
2288 if (mddev
->bitmap
|| mddev
->bitmap_info
.file
||
2289 mddev
->bitmap_info
.offset
) {
2290 /* bitmap already configured. Only option is to clear it */
2291 if (strncmp(buf
, "none", 4) != 0) {
2296 mddev
->pers
->quiesce(mddev
, 1);
2297 bitmap_destroy(mddev
);
2298 mddev
->pers
->quiesce(mddev
, 0);
2300 mddev
->bitmap_info
.offset
= 0;
2301 if (mddev
->bitmap_info
.file
) {
2302 struct file
*f
= mddev
->bitmap_info
.file
;
2303 mddev
->bitmap_info
.file
= NULL
;
2307 /* No bitmap, OK to set a location */
2309 if (strncmp(buf
, "none", 4) == 0)
2310 /* nothing to be done */;
2311 else if (strncmp(buf
, "file:", 5) == 0) {
2312 /* Not supported yet */
2317 rv
= kstrtoll(buf
+1, 10, &offset
);
2319 rv
= kstrtoll(buf
, 10, &offset
);
2326 if (mddev
->bitmap_info
.external
== 0 &&
2327 mddev
->major_version
== 0 &&
2328 offset
!= mddev
->bitmap_info
.default_offset
) {
2332 mddev
->bitmap_info
.offset
= offset
;
2334 struct bitmap
*bitmap
;
2335 mddev
->pers
->quiesce(mddev
, 1);
2336 bitmap
= bitmap_create(mddev
, -1);
2338 rv
= PTR_ERR(bitmap
);
2340 mddev
->bitmap
= bitmap
;
2341 rv
= bitmap_load(mddev
);
2343 mddev
->bitmap_info
.offset
= 0;
2345 mddev
->pers
->quiesce(mddev
, 0);
2347 bitmap_destroy(mddev
);
2353 if (!mddev
->external
) {
2354 /* Ensure new bitmap info is stored in
2355 * metadata promptly.
2357 set_bit(MD_SB_CHANGE_DEVS
, &mddev
->sb_flags
);
2358 md_wakeup_thread(mddev
->thread
);
2362 mddev_unlock(mddev
);
2368 static struct md_sysfs_entry bitmap_location
=
2369 __ATTR(location
, S_IRUGO
|S_IWUSR
, location_show
, location_store
);
2371 /* 'bitmap/space' is the space available at 'location' for the
2372 * bitmap. This allows the kernel to know when it is safe to
2373 * resize the bitmap to match a resized array.
2376 space_show(struct mddev
*mddev
, char *page
)
2378 return sprintf(page
, "%lu\n", mddev
->bitmap_info
.space
);
2382 space_store(struct mddev
*mddev
, const char *buf
, size_t len
)
2384 unsigned long sectors
;
2387 rv
= kstrtoul(buf
, 10, §ors
);
2394 if (mddev
->bitmap
&&
2395 sectors
< (mddev
->bitmap
->storage
.bytes
+ 511) >> 9)
2396 return -EFBIG
; /* Bitmap is too big for this small space */
2398 /* could make sure it isn't too big, but that isn't really
2399 * needed - user-space should be careful.
2401 mddev
->bitmap_info
.space
= sectors
;
2405 static struct md_sysfs_entry bitmap_space
=
2406 __ATTR(space
, S_IRUGO
|S_IWUSR
, space_show
, space_store
);
2409 timeout_show(struct mddev
*mddev
, char *page
)
2412 unsigned long secs
= mddev
->bitmap_info
.daemon_sleep
/ HZ
;
2413 unsigned long jifs
= mddev
->bitmap_info
.daemon_sleep
% HZ
;
2415 len
= sprintf(page
, "%lu", secs
);
2417 len
+= sprintf(page
+len
, ".%03u", jiffies_to_msecs(jifs
));
2418 len
+= sprintf(page
+len
, "\n");
2423 timeout_store(struct mddev
*mddev
, const char *buf
, size_t len
)
2425 /* timeout can be set at any time */
2426 unsigned long timeout
;
2427 int rv
= strict_strtoul_scaled(buf
, &timeout
, 4);
2431 /* just to make sure we don't overflow... */
2432 if (timeout
>= LONG_MAX
/ HZ
)
2435 timeout
= timeout
* HZ
/ 10000;
2437 if (timeout
>= MAX_SCHEDULE_TIMEOUT
)
2438 timeout
= MAX_SCHEDULE_TIMEOUT
-1;
2441 mddev
->bitmap_info
.daemon_sleep
= timeout
;
2442 if (mddev
->thread
) {
2443 /* if thread->timeout is MAX_SCHEDULE_TIMEOUT, then
2444 * the bitmap is all clean and we don't need to
2445 * adjust the timeout right now
2447 if (mddev
->thread
->timeout
< MAX_SCHEDULE_TIMEOUT
) {
2448 mddev
->thread
->timeout
= timeout
;
2449 md_wakeup_thread(mddev
->thread
);
2455 static struct md_sysfs_entry bitmap_timeout
=
2456 __ATTR(time_base
, S_IRUGO
|S_IWUSR
, timeout_show
, timeout_store
);
2459 backlog_show(struct mddev
*mddev
, char *page
)
2461 return sprintf(page
, "%lu\n", mddev
->bitmap_info
.max_write_behind
);
2465 backlog_store(struct mddev
*mddev
, const char *buf
, size_t len
)
2467 unsigned long backlog
;
2468 int rv
= kstrtoul(buf
, 10, &backlog
);
2471 if (backlog
> COUNTER_MAX
)
2473 mddev
->bitmap_info
.max_write_behind
= backlog
;
2477 static struct md_sysfs_entry bitmap_backlog
=
2478 __ATTR(backlog
, S_IRUGO
|S_IWUSR
, backlog_show
, backlog_store
);
2481 chunksize_show(struct mddev
*mddev
, char *page
)
2483 return sprintf(page
, "%lu\n", mddev
->bitmap_info
.chunksize
);
2487 chunksize_store(struct mddev
*mddev
, const char *buf
, size_t len
)
2489 /* Can only be changed when no bitmap is active */
2491 unsigned long csize
;
2494 rv
= kstrtoul(buf
, 10, &csize
);
2498 !is_power_of_2(csize
))
2500 mddev
->bitmap_info
.chunksize
= csize
;
2504 static struct md_sysfs_entry bitmap_chunksize
=
2505 __ATTR(chunksize
, S_IRUGO
|S_IWUSR
, chunksize_show
, chunksize_store
);
2507 static ssize_t
metadata_show(struct mddev
*mddev
, char *page
)
2509 if (mddev_is_clustered(mddev
))
2510 return sprintf(page
, "clustered\n");
2511 return sprintf(page
, "%s\n", (mddev
->bitmap_info
.external
2512 ? "external" : "internal"));
2515 static ssize_t
metadata_store(struct mddev
*mddev
, const char *buf
, size_t len
)
2517 if (mddev
->bitmap
||
2518 mddev
->bitmap_info
.file
||
2519 mddev
->bitmap_info
.offset
)
2521 if (strncmp(buf
, "external", 8) == 0)
2522 mddev
->bitmap_info
.external
= 1;
2523 else if ((strncmp(buf
, "internal", 8) == 0) ||
2524 (strncmp(buf
, "clustered", 9) == 0))
2525 mddev
->bitmap_info
.external
= 0;
2531 static struct md_sysfs_entry bitmap_metadata
=
2532 __ATTR(metadata
, S_IRUGO
|S_IWUSR
, metadata_show
, metadata_store
);
2534 static ssize_t
can_clear_show(struct mddev
*mddev
, char *page
)
2537 spin_lock(&mddev
->lock
);
2539 len
= sprintf(page
, "%s\n", (mddev
->bitmap
->need_sync
?
2542 len
= sprintf(page
, "\n");
2543 spin_unlock(&mddev
->lock
);
2547 static ssize_t
can_clear_store(struct mddev
*mddev
, const char *buf
, size_t len
)
2549 if (mddev
->bitmap
== NULL
)
2551 if (strncmp(buf
, "false", 5) == 0)
2552 mddev
->bitmap
->need_sync
= 1;
2553 else if (strncmp(buf
, "true", 4) == 0) {
2554 if (mddev
->degraded
)
2556 mddev
->bitmap
->need_sync
= 0;
2562 static struct md_sysfs_entry bitmap_can_clear
=
2563 __ATTR(can_clear
, S_IRUGO
|S_IWUSR
, can_clear_show
, can_clear_store
);
2566 behind_writes_used_show(struct mddev
*mddev
, char *page
)
2569 spin_lock(&mddev
->lock
);
2570 if (mddev
->bitmap
== NULL
)
2571 ret
= sprintf(page
, "0\n");
2573 ret
= sprintf(page
, "%lu\n",
2574 mddev
->bitmap
->behind_writes_used
);
2575 spin_unlock(&mddev
->lock
);
2580 behind_writes_used_reset(struct mddev
*mddev
, const char *buf
, size_t len
)
2583 mddev
->bitmap
->behind_writes_used
= 0;
2587 static struct md_sysfs_entry max_backlog_used
=
2588 __ATTR(max_backlog_used
, S_IRUGO
| S_IWUSR
,
2589 behind_writes_used_show
, behind_writes_used_reset
);
2591 static struct attribute
*md_bitmap_attrs
[] = {
2592 &bitmap_location
.attr
,
2594 &bitmap_timeout
.attr
,
2595 &bitmap_backlog
.attr
,
2596 &bitmap_chunksize
.attr
,
2597 &bitmap_metadata
.attr
,
2598 &bitmap_can_clear
.attr
,
2599 &max_backlog_used
.attr
,
2602 struct attribute_group md_bitmap_group
= {
2604 .attrs
= md_bitmap_attrs
,