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