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