bitmap.c 68.4 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17
/*
 * bitmap.c two-level bitmap (C) Peter T. Breuer (ptb@ot.uc3m.es) 2003
 *
 * bitmap_create  - sets up the bitmap structure
 * bitmap_destroy - destroys the bitmap structure
 *
 * additions, Copyright (C) 2003-2004, Paul Clements, SteelEye Technology, Inc.:
 * - added disk storage for bitmap
 * - changes to allow various bitmap chunk sizes
 */

/*
 * Still to do:
 *
 * flush after percent set rather than just time based. (maybe both).
 */

18
#include <linux/blkdev.h>
19 20 21 22 23 24 25 26 27 28
#include <linux/module.h>
#include <linux/errno.h>
#include <linux/slab.h>
#include <linux/init.h>
#include <linux/timer.h>
#include <linux/sched.h>
#include <linux/list.h>
#include <linux/file.h>
#include <linux/mount.h>
#include <linux/buffer_head.h>
29
#include <linux/seq_file.h>
30
#include <trace/events/block.h>
31
#include "md.h"
32
#include "bitmap.h"
33

34
static inline char *bmname(struct bitmap *bitmap)
35 36 37 38 39 40 41 42 43 44 45 46 47 48
{
	return bitmap->mddev ? mdname(bitmap->mddev) : "mdX";
}

/*
 * check a page and, if necessary, allocate it (or hijack it if the alloc fails)
 *
 * 1) check to see if this page is allocated, if it's not then try to alloc
 * 2) if the alloc fails, set the page's hijacked flag so we'll use the
 *    page pointer directly as a counter
 *
 * if we find our page, we increment the page's refcount so that it stays
 * allocated while we're using it
 */
49
static int bitmap_checkpage(struct bitmap_counts *bitmap,
50
			    unsigned long page, int create, int no_hijack)
51 52
__releases(bitmap->lock)
__acquires(bitmap->lock)
53 54 55 56
{
	unsigned char *mappage;

	if (page >= bitmap->pages) {
57 58 59 60
		/* This can happen if bitmap_start_sync goes beyond
		 * End-of-device while looking for a whole page.
		 * It is harmless.
		 */
61 62 63 64 65 66 67 68 69 70 71 72 73 74
		return -EINVAL;
	}

	if (bitmap->bp[page].hijacked) /* it's hijacked, don't try to alloc */
		return 0;

	if (bitmap->bp[page].map) /* page is already allocated, just return */
		return 0;

	if (!create)
		return -ENOENT;

	/* this page has not been allocated yet */

75
	spin_unlock_irq(&bitmap->lock);
76 77 78 79 80 81 82 83 84 85 86 87 88
	/* It is possible that this is being called inside a
	 * prepare_to_wait/finish_wait loop from raid5c:make_request().
	 * In general it is not permitted to sleep in that context as it
	 * can cause the loop to spin freely.
	 * That doesn't apply here as we can only reach this point
	 * once with any loop.
	 * When this function completes, either bp[page].map or
	 * bp[page].hijacked.  In either case, this function will
	 * abort before getting to this point again.  So there is
	 * no risk of a free-spin, and so it is safe to assert
	 * that sleeping here is allowed.
	 */
	sched_annotate_sleep();
89
	mappage = kzalloc(PAGE_SIZE, GFP_NOIO);
90 91 92
	spin_lock_irq(&bitmap->lock);

	if (mappage == NULL) {
93
		pr_debug("md/bitmap: map page allocation failed, hijacking\n");
94 95 96
		/* We don't support hijack for cluster raid */
		if (no_hijack)
			return -ENOMEM;
97 98 99 100
		/* failed - set the hijacked flag so that we can use the
		 * pointer as a counter */
		if (!bitmap->bp[page].map)
			bitmap->bp[page].hijacked = 1;
101 102
	} else if (bitmap->bp[page].map ||
		   bitmap->bp[page].hijacked) {
103
		/* somebody beat us to getting the page */
104
		kfree(mappage);
105
	} else {
106

107
		/* no page was in place and we have one, so install it */
108

109 110 111
		bitmap->bp[page].map = mappage;
		bitmap->missing_pages--;
	}
112 113 114 115 116 117
	return 0;
}

/* if page is completely empty, put it back on the free list, or dealloc it */
/* if page was hijacked, unmark the flag so it might get alloced next time */
/* Note: lock should be held when calling this */
118
static void bitmap_checkfree(struct bitmap_counts *bitmap, unsigned long page)
119 120 121 122 123 124 125 126 127 128 129
{
	char *ptr;

	if (bitmap->bp[page].count) /* page is still busy */
		return;

	/* page is no longer in use, it can be released */

	if (bitmap->bp[page].hijacked) { /* page was hijacked, undo this now */
		bitmap->bp[page].hijacked = 0;
		bitmap->bp[page].map = NULL;
130 131 132 133 134
	} else {
		/* normal case, free the page */
		ptr = bitmap->bp[page].map;
		bitmap->bp[page].map = NULL;
		bitmap->missing_pages++;
135
		kfree(ptr);
136 137 138 139 140 141 142 143 144 145 146
	}
}

/*
 * bitmap file handling - read and write the bitmap file and its superblock
 */

/*
 * basic page I/O operations
 */

147
/* IO operations when bitmap is stored near all superblocks */
148 149 150
static int read_sb_page(struct mddev *mddev, loff_t offset,
			struct page *page,
			unsigned long index, int size)
151 152 153
{
	/* choose a good rdev and read the page from there */

154
	struct md_rdev *rdev;
155 156
	sector_t target;

N
NeilBrown 已提交
157
	rdev_for_each(rdev, mddev) {
158
		if (! test_bit(In_sync, &rdev->flags)
159 160
		    || test_bit(Faulty, &rdev->flags)
		    || test_bit(Bitmap_sync, &rdev->flags))
161 162
			continue;

J
Jonathan Brassow 已提交
163
		target = offset + index * (PAGE_SIZE/512);
164

165
		if (sync_page_io(rdev, target,
166
				 roundup(size, bdev_logical_block_size(rdev->bdev)),
M
Mike Christie 已提交
167
				 page, REQ_OP_READ, 0, true)) {
168
			page->index = index;
169
			return 0;
170 171
		}
	}
172
	return -EIO;
173 174
}

175
static struct md_rdev *next_active_rdev(struct md_rdev *rdev, struct mddev *mddev)
176 177 178 179 180 181 182
{
	/* Iterate the disks of an mddev, using rcu to protect access to the
	 * linked list, and raising the refcount of devices we return to ensure
	 * they don't disappear while in use.
	 * As devices are only added or removed when raid_disk is < 0 and
	 * nr_pending is 0 and In_sync is clear, the entries we return will
	 * still be in the same position on the list when we re-enter
183
	 * list_for_each_entry_continue_rcu.
184 185 186 187 188
	 *
	 * Note that if entered with 'rdev == NULL' to start at the
	 * beginning, we temporarily assign 'rdev' to an address which
	 * isn't really an rdev, but which can be used by
	 * list_for_each_entry_continue_rcu() to find the first entry.
189 190 191 192
	 */
	rcu_read_lock();
	if (rdev == NULL)
		/* start at the beginning */
193
		rdev = list_entry(&mddev->disks, struct md_rdev, same_set);
194 195 196 197
	else {
		/* release the previous rdev and start from there. */
		rdev_dec_pending(rdev, mddev);
	}
198
	list_for_each_entry_continue_rcu(rdev, &mddev->disks, same_set) {
199 200 201 202 203 204 205 206 207 208 209 210
		if (rdev->raid_disk >= 0 &&
		    !test_bit(Faulty, &rdev->flags)) {
			/* this is a usable devices */
			atomic_inc(&rdev->nr_pending);
			rcu_read_unlock();
			return rdev;
		}
	}
	rcu_read_unlock();
	return NULL;
}

211
static int write_sb_page(struct bitmap *bitmap, struct page *page, int wait)
212
{
213
	struct md_rdev *rdev;
214
	struct block_device *bdev;
215
	struct mddev *mddev = bitmap->mddev;
216
	struct bitmap_storage *store = &bitmap->storage;
217

218 219
restart:
	rdev = NULL;
220
	while ((rdev = next_active_rdev(rdev, mddev)) != NULL) {
221 222
		int size = PAGE_SIZE;
		loff_t offset = mddev->bitmap_info.offset;
223 224 225

		bdev = (rdev->meta_bdev) ? rdev->meta_bdev : rdev->bdev;

226 227 228 229 230
		if (page->index == store->file_pages-1) {
			int last_page_size = store->bytes & (PAGE_SIZE-1);
			if (last_page_size == 0)
				last_page_size = PAGE_SIZE;
			size = roundup(last_page_size,
231
				       bdev_logical_block_size(bdev));
232
		}
233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272
		/* Just make sure we aren't corrupting data or
		 * metadata
		 */
		if (mddev->external) {
			/* Bitmap could be anywhere. */
			if (rdev->sb_start + offset + (page->index
						       * (PAGE_SIZE/512))
			    > rdev->data_offset
			    &&
			    rdev->sb_start + offset
			    < (rdev->data_offset + mddev->dev_sectors
			     + (PAGE_SIZE/512)))
				goto bad_alignment;
		} else if (offset < 0) {
			/* DATA  BITMAP METADATA  */
			if (offset
			    + (long)(page->index * (PAGE_SIZE/512))
			    + size/512 > 0)
				/* bitmap runs in to metadata */
				goto bad_alignment;
			if (rdev->data_offset + mddev->dev_sectors
			    > rdev->sb_start + offset)
				/* data runs in to bitmap */
				goto bad_alignment;
		} else if (rdev->sb_start < rdev->data_offset) {
			/* METADATA BITMAP DATA */
			if (rdev->sb_start
			    + offset
			    + page->index*(PAGE_SIZE/512) + size/512
			    > rdev->data_offset)
				/* bitmap runs in to data */
				goto bad_alignment;
		} else {
			/* DATA METADATA BITMAP - no problems */
		}
		md_super_write(mddev, rdev,
			       rdev->sb_start + offset
			       + page->index * (PAGE_SIZE/512),
			       size,
			       page);
273
	}
274

275 276
	if (wait && md_super_wait(mddev) < 0)
		goto restart;
277
	return 0;
278 279 280

 bad_alignment:
	return -EINVAL;
281 282
}

283
static void bitmap_file_kick(struct bitmap *bitmap);
284
/*
285
 * write out a page to a file
286
 */
287
static void write_page(struct bitmap *bitmap, struct page *page, int wait)
288
{
289
	struct buffer_head *bh;
290

291
	if (bitmap->storage.file == NULL) {
292 293
		switch (write_sb_page(bitmap, page, wait)) {
		case -EINVAL:
294
			set_bit(BITMAP_WRITE_ERROR, &bitmap->flags);
295
		}
296
	} else {
297

298
		bh = page_buffers(page);
299

300 301 302 303
		while (bh && bh->b_blocknr) {
			atomic_inc(&bitmap->pending_writes);
			set_buffer_locked(bh);
			set_buffer_mapped(bh);
304
			submit_bh(REQ_OP_WRITE, REQ_SYNC, bh);
305 306
			bh = bh->b_this_page;
		}
307

308
		if (wait)
309 310
			wait_event(bitmap->write_wait,
				   atomic_read(&bitmap->pending_writes)==0);
311
	}
312
	if (test_bit(BITMAP_WRITE_ERROR, &bitmap->flags))
313
		bitmap_file_kick(bitmap);
314 315 316 317 318
}

static void end_bitmap_write(struct buffer_head *bh, int uptodate)
{
	struct bitmap *bitmap = bh->b_private;
319

320 321
	if (!uptodate)
		set_bit(BITMAP_WRITE_ERROR, &bitmap->flags);
322 323 324
	if (atomic_dec_and_test(&bitmap->pending_writes))
		wake_up(&bitmap->write_wait);
}
325

326 327 328 329 330 331
/* copied from buffer.c */
static void
__clear_page_buffers(struct page *page)
{
	ClearPagePrivate(page);
	set_page_private(page, 0);
332
	put_page(page);
333 334 335
}
static void free_buffers(struct page *page)
{
336
	struct buffer_head *bh;
337

338 339 340 341
	if (!PagePrivate(page))
		return;

	bh = page_buffers(page);
342 343 344 345
	while (bh) {
		struct buffer_head *next = bh->b_this_page;
		free_buffer_head(bh);
		bh = next;
346
	}
347 348
	__clear_page_buffers(page);
	put_page(page);
349 350
}

351 352 353 354 355 356 357
/* read a page from a file.
 * We both read the page, and attach buffers to the page to record the
 * address of each block (using bmap).  These addresses will be used
 * to write the block later, completely bypassing the filesystem.
 * This usage is similar to how swap files are handled, and allows us
 * to write to a file with no concerns of memory allocation failing.
 */
358 359 360 361
static int read_page(struct file *file, unsigned long index,
		     struct bitmap *bitmap,
		     unsigned long count,
		     struct page *page)
362
{
363
	int ret = 0;
A
Al Viro 已提交
364
	struct inode *inode = file_inode(file);
365 366
	struct buffer_head *bh;
	sector_t block;
367

368 369
	pr_debug("read bitmap file (%dB @ %llu)\n", (int)PAGE_SIZE,
		 (unsigned long long)index << PAGE_SHIFT);
370

371
	bh = alloc_page_buffers(page, 1<<inode->i_blkbits, false);
372
	if (!bh) {
373
		ret = -ENOMEM;
374 375
		goto out;
	}
376 377 378 379 380 381 382 383 384
	attach_page_buffers(page, bh);
	block = index << (PAGE_SHIFT - inode->i_blkbits);
	while (bh) {
		if (count == 0)
			bh->b_blocknr = 0;
		else {
			bh->b_blocknr = bmap(inode, block);
			if (bh->b_blocknr == 0) {
				/* Cannot use this file! */
385
				ret = -EINVAL;
386 387 388 389 390 391 392 393 394 395
				goto out;
			}
			bh->b_bdev = inode->i_sb->s_bdev;
			if (count < (1<<inode->i_blkbits))
				count = 0;
			else
				count -= (1<<inode->i_blkbits);

			bh->b_end_io = end_bitmap_write;
			bh->b_private = bitmap;
396 397 398
			atomic_inc(&bitmap->pending_writes);
			set_buffer_locked(bh);
			set_buffer_mapped(bh);
399
			submit_bh(REQ_OP_READ, 0, bh);
400 401 402 403 404
		}
		block++;
		bh = bh->b_this_page;
	}
	page->index = index;
405 406 407

	wait_event(bitmap->write_wait,
		   atomic_read(&bitmap->pending_writes)==0);
408
	if (test_bit(BITMAP_WRITE_ERROR, &bitmap->flags))
409
		ret = -EIO;
410
out:
411
	if (ret)
412 413 414 415
		pr_err("md: bitmap read error: (%dB @ %llu): %d\n",
		       (int)PAGE_SIZE,
		       (unsigned long long)index << PAGE_SHIFT,
		       ret);
416
	return ret;
417 418 419 420 421 422
}

/*
 * bitmap file superblock operations
 */

423 424 425 426 427 428 429 430 431 432 433
/*
 * bitmap_wait_writes() should be called before writing any bitmap
 * blocks, to ensure previous writes, particularly from
 * bitmap_daemon_work(), have completed.
 */
static void bitmap_wait_writes(struct bitmap *bitmap)
{
	if (bitmap->storage.file)
		wait_event(bitmap->write_wait,
			   atomic_read(&bitmap->pending_writes)==0);
	else
434 435 436 437 438 439 440
		/* Note that we ignore the return value.  The writes
		 * might have failed, but that would just mean that
		 * some bits which should be cleared haven't been,
		 * which is safe.  The relevant bitmap blocks will
		 * probably get written again, but there is no great
		 * loss if they aren't.
		 */
441 442 443 444
		md_super_wait(bitmap->mddev);
}


445
/* update the event counter and sync the superblock to disk */
446
void bitmap_update_sb(struct bitmap *bitmap)
447 448 449 450
{
	bitmap_super_t *sb;

	if (!bitmap || !bitmap->mddev) /* no bitmap for this array */
451
		return;
452 453
	if (bitmap->mddev->bitmap_info.external)
		return;
454
	if (!bitmap->storage.sb_page) /* no superblock */
455
		return;
456
	sb = kmap_atomic(bitmap->storage.sb_page);
457
	sb->events = cpu_to_le64(bitmap->mddev->events);
458
	if (bitmap->mddev->events < bitmap->events_cleared)
459 460
		/* rocking back to read-only */
		bitmap->events_cleared = bitmap->mddev->events;
461 462
	sb->events_cleared = cpu_to_le64(bitmap->events_cleared);
	sb->state = cpu_to_le32(bitmap->flags);
463 464 465
	/* Just in case these have been changed via sysfs: */
	sb->daemon_sleep = cpu_to_le32(bitmap->mddev->bitmap_info.daemon_sleep/HZ);
	sb->write_behind = cpu_to_le32(bitmap->mddev->bitmap_info.max_write_behind);
466 467 468
	/* This might have been changed by a reshape */
	sb->sync_size = cpu_to_le64(bitmap->mddev->resync_max_sectors);
	sb->chunksize = cpu_to_le32(bitmap->mddev->bitmap_info.chunksize);
G
Goldwyn Rodrigues 已提交
469
	sb->nodes = cpu_to_le32(bitmap->mddev->bitmap_info.nodes);
470 471
	sb->sectors_reserved = cpu_to_le32(bitmap->mddev->
					   bitmap_info.space);
472
	kunmap_atomic(sb);
473
	write_page(bitmap, bitmap->storage.sb_page, 1);
474
}
475
EXPORT_SYMBOL(bitmap_update_sb);
476 477 478 479 480 481

/* print out the bitmap file superblock */
void bitmap_print_sb(struct bitmap *bitmap)
{
	bitmap_super_t *sb;

482
	if (!bitmap || !bitmap->storage.sb_page)
483
		return;
484
	sb = kmap_atomic(bitmap->storage.sb_page);
485 486 487 488
	pr_debug("%s: bitmap file superblock:\n", bmname(bitmap));
	pr_debug("         magic: %08x\n", le32_to_cpu(sb->magic));
	pr_debug("       version: %d\n", le32_to_cpu(sb->version));
	pr_debug("          uuid: %08x.%08x.%08x.%08x\n",
489 490 491 492
		 le32_to_cpu(*(__u32 *)(sb->uuid+0)),
		 le32_to_cpu(*(__u32 *)(sb->uuid+4)),
		 le32_to_cpu(*(__u32 *)(sb->uuid+8)),
		 le32_to_cpu(*(__u32 *)(sb->uuid+12)));
493 494 495 496 497 498 499 500 501 502
	pr_debug("        events: %llu\n",
		 (unsigned long long) le64_to_cpu(sb->events));
	pr_debug("events cleared: %llu\n",
		 (unsigned long long) le64_to_cpu(sb->events_cleared));
	pr_debug("         state: %08x\n", le32_to_cpu(sb->state));
	pr_debug("     chunksize: %d B\n", le32_to_cpu(sb->chunksize));
	pr_debug("  daemon sleep: %ds\n", le32_to_cpu(sb->daemon_sleep));
	pr_debug("     sync size: %llu KB\n",
		 (unsigned long long)le64_to_cpu(sb->sync_size)/2);
	pr_debug("max write behind: %d\n", le32_to_cpu(sb->write_behind));
503
	kunmap_atomic(sb);
504 505
}

506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521
/*
 * bitmap_new_disk_sb
 * @bitmap
 *
 * This function is somewhat the reverse of bitmap_read_sb.  bitmap_read_sb
 * reads and verifies the on-disk bitmap superblock and populates bitmap_info.
 * This function verifies 'bitmap_info' and populates the on-disk bitmap
 * structure, which is to be written to disk.
 *
 * Returns: 0 on success, -Exxx on error
 */
static int bitmap_new_disk_sb(struct bitmap *bitmap)
{
	bitmap_super_t *sb;
	unsigned long chunksize, daemon_sleep, write_behind;

522
	bitmap->storage.sb_page = alloc_page(GFP_KERNEL | __GFP_ZERO);
523 524
	if (bitmap->storage.sb_page == NULL)
		return -ENOMEM;
525
	bitmap->storage.sb_page->index = 0;
526

527
	sb = kmap_atomic(bitmap->storage.sb_page);
528 529 530 531 532 533 534

	sb->magic = cpu_to_le32(BITMAP_MAGIC);
	sb->version = cpu_to_le32(BITMAP_MAJOR_HI);

	chunksize = bitmap->mddev->bitmap_info.chunksize;
	BUG_ON(!chunksize);
	if (!is_power_of_2(chunksize)) {
535
		kunmap_atomic(sb);
536
		pr_warn("bitmap chunksize not a power of 2\n");
537 538 539 540 541
		return -EINVAL;
	}
	sb->chunksize = cpu_to_le32(chunksize);

	daemon_sleep = bitmap->mddev->bitmap_info.daemon_sleep;
542
	if (!daemon_sleep || (daemon_sleep > MAX_SCHEDULE_TIMEOUT)) {
543
		pr_debug("Choosing daemon_sleep default (5 sec)\n");
544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563
		daemon_sleep = 5 * HZ;
	}
	sb->daemon_sleep = cpu_to_le32(daemon_sleep);
	bitmap->mddev->bitmap_info.daemon_sleep = daemon_sleep;

	/*
	 * FIXME: write_behind for RAID1.  If not specified, what
	 * is a good choice?  We choose COUNTER_MAX / 2 arbitrarily.
	 */
	write_behind = bitmap->mddev->bitmap_info.max_write_behind;
	if (write_behind > COUNTER_MAX)
		write_behind = COUNTER_MAX / 2;
	sb->write_behind = cpu_to_le32(write_behind);
	bitmap->mddev->bitmap_info.max_write_behind = write_behind;

	/* keep the array size field of the bitmap superblock up to date */
	sb->sync_size = cpu_to_le64(bitmap->mddev->resync_max_sectors);

	memcpy(sb->uuid, bitmap->mddev->uuid, 16);

564
	set_bit(BITMAP_STALE, &bitmap->flags);
565
	sb->state = cpu_to_le32(bitmap->flags);
566 567
	bitmap->events_cleared = bitmap->mddev->events;
	sb->events_cleared = cpu_to_le64(bitmap->mddev->events);
568
	bitmap->mddev->bitmap_info.nodes = 0;
569

570
	kunmap_atomic(sb);
571 572 573 574

	return 0;
}

575 576 577 578 579
/* read the superblock from the bitmap file and initialize some bitmap fields */
static int bitmap_read_sb(struct bitmap *bitmap)
{
	char *reason = NULL;
	bitmap_super_t *sb;
580
	unsigned long chunksize, daemon_sleep, write_behind;
581
	unsigned long long events;
G
Goldwyn Rodrigues 已提交
582
	int nodes = 0;
583
	unsigned long sectors_reserved = 0;
584
	int err = -EINVAL;
585
	struct page *sb_page;
586
	loff_t offset = bitmap->mddev->bitmap_info.offset;
587

588
	if (!bitmap->storage.file && !bitmap->mddev->bitmap_info.offset) {
589 590 591
		chunksize = 128 * 1024 * 1024;
		daemon_sleep = 5 * HZ;
		write_behind = 0;
592
		set_bit(BITMAP_STALE, &bitmap->flags);
593 594 595
		err = 0;
		goto out_no_sb;
	}
596
	/* page 0 is the superblock, read it... */
597 598 599
	sb_page = alloc_page(GFP_KERNEL);
	if (!sb_page)
		return -ENOMEM;
600
	bitmap->storage.sb_page = sb_page;
601

602
re_read:
603 604
	/* If cluster_slot is set, the cluster is setup */
	if (bitmap->cluster_slot >= 0) {
605
		sector_t bm_blocks = bitmap->mddev->resync_max_sectors;
606

607 608
		sector_div(bm_blocks,
			   bitmap->mddev->bitmap_info.chunksize >> 9);
609 610 611
		/* bits to bytes */
		bm_blocks = ((bm_blocks+7) >> 3) + sizeof(bitmap_super_t);
		/* to 4k blocks */
612
		bm_blocks = DIV_ROUND_UP_SECTOR_T(bm_blocks, 4096);
613
		offset = bitmap->mddev->bitmap_info.offset + (bitmap->cluster_slot * (bm_blocks << 3));
614
		pr_debug("%s:%d bm slot: %d offset: %llu\n", __func__, __LINE__,
615
			bitmap->cluster_slot, offset);
616 617
	}

618 619
	if (bitmap->storage.file) {
		loff_t isize = i_size_read(bitmap->storage.file->f_mapping->host);
620 621
		int bytes = isize > PAGE_SIZE ? PAGE_SIZE : isize;

622
		err = read_page(bitmap->storage.file, 0,
623
				bitmap, bytes, sb_page);
624
	} else {
625
		err = read_sb_page(bitmap->mddev,
626
				   offset,
627
				   sb_page,
628
				   0, PAGE_SIZE);
629
	}
630
	if (err)
631 632
		return err;

633
	err = -EINVAL;
634
	sb = kmap_atomic(sb_page);
635 636

	chunksize = le32_to_cpu(sb->chunksize);
637
	daemon_sleep = le32_to_cpu(sb->daemon_sleep) * HZ;
638
	write_behind = le32_to_cpu(sb->write_behind);
639
	sectors_reserved = le32_to_cpu(sb->sectors_reserved);
640 641
	/* Setup nodes/clustername only if bitmap version is
	 * cluster-compatible
642
	 */
643
	if (sb->version == cpu_to_le32(BITMAP_MAJOR_CLUSTERED)) {
644 645 646 647
		nodes = le32_to_cpu(sb->nodes);
		strlcpy(bitmap->mddev->bitmap_info.cluster_name,
				sb->cluster_name, 64);
	}
648 649 650 651

	/* verify that the bitmap-specific fields are valid */
	if (sb->magic != cpu_to_le32(BITMAP_MAGIC))
		reason = "bad magic";
652
	else if (le32_to_cpu(sb->version) < BITMAP_MAJOR_LO ||
653
		 le32_to_cpu(sb->version) > BITMAP_MAJOR_CLUSTERED)
654
		reason = "unrecognized superblock version";
655
	else if (chunksize < 512)
656
		reason = "bitmap chunksize too small";
J
Jonathan Brassow 已提交
657
	else if (!is_power_of_2(chunksize))
658
		reason = "bitmap chunksize not a power of 2";
659
	else if (daemon_sleep < 1 || daemon_sleep > MAX_SCHEDULE_TIMEOUT)
660
		reason = "daemon sleep period out of range";
661 662
	else if (write_behind > COUNTER_MAX)
		reason = "write-behind limit out of range (0 - 16383)";
663
	if (reason) {
664
		pr_warn("%s: invalid bitmap file superblock: %s\n",
665 666 667 668 669 670 671
			bmname(bitmap), reason);
		goto out;
	}

	/* keep the array size field of the bitmap superblock up to date */
	sb->sync_size = cpu_to_le64(bitmap->mddev->resync_max_sectors);

672 673 674 675 676 677
	if (bitmap->mddev->persistent) {
		/*
		 * We have a persistent array superblock, so compare the
		 * bitmap's UUID and event counter to the mddev's
		 */
		if (memcmp(sb->uuid, bitmap->mddev->uuid, 16)) {
678 679
			pr_warn("%s: bitmap superblock UUID mismatch\n",
				bmname(bitmap));
680 681 682
			goto out;
		}
		events = le64_to_cpu(sb->events);
683
		if (!nodes && (events < bitmap->mddev->events)) {
684 685 686
			pr_warn("%s: bitmap file is out of date (%llu < %llu) -- forcing full recovery\n",
				bmname(bitmap), events,
				(unsigned long long) bitmap->mddev->events);
687
			set_bit(BITMAP_STALE, &bitmap->flags);
688
		}
689
	}
690

691
	/* assign fields using values from superblock */
692
	bitmap->flags |= le32_to_cpu(sb->state);
693
	if (le32_to_cpu(sb->version) == BITMAP_MAJOR_HOSTENDIAN)
694
		set_bit(BITMAP_HOSTENDIAN, &bitmap->flags);
695
	bitmap->events_cleared = le64_to_cpu(sb->events_cleared);
G
Goldwyn Rodrigues 已提交
696
	strlcpy(bitmap->mddev->bitmap_info.cluster_name, sb->cluster_name, 64);
697
	err = 0;
698

699
out:
700
	kunmap_atomic(sb);
701
	/* Assigning chunksize is required for "re_read" */
702
	bitmap->mddev->bitmap_info.chunksize = chunksize;
703
	if (err == 0 && nodes && (bitmap->cluster_slot < 0)) {
704 705
		err = md_setup_cluster(bitmap->mddev, nodes);
		if (err) {
706 707
			pr_warn("%s: Could not setup cluster service (%d)\n",
				bmname(bitmap), err);
708 709 710 711 712 713 714
			goto out_no_sb;
		}
		bitmap->cluster_slot = md_cluster_ops->slot_number(bitmap->mddev);
		goto re_read;
	}


715
out_no_sb:
716
	if (test_bit(BITMAP_STALE, &bitmap->flags))
717 718 719 720
		bitmap->events_cleared = bitmap->mddev->events;
	bitmap->mddev->bitmap_info.chunksize = chunksize;
	bitmap->mddev->bitmap_info.daemon_sleep = daemon_sleep;
	bitmap->mddev->bitmap_info.max_write_behind = write_behind;
G
Goldwyn Rodrigues 已提交
721
	bitmap->mddev->bitmap_info.nodes = nodes;
722 723 724
	if (bitmap->mddev->bitmap_info.space == 0 ||
	    bitmap->mddev->bitmap_info.space > sectors_reserved)
		bitmap->mddev->bitmap_info.space = sectors_reserved;
725
	if (err) {
726
		bitmap_print_sb(bitmap);
727
		if (bitmap->cluster_slot < 0)
728 729
			md_cluster_stop(bitmap->mddev);
	}
730 731 732 733 734 735 736
	return err;
}

/*
 * general bitmap file operations
 */

737 738 739 740 741 742
/*
 * on-disk bitmap:
 *
 * Use one bit per "chunk" (block set). We do the disk I/O on the bitmap
 * file a page at a time. There's a superblock at the start of the file.
 */
743
/* calculate the index of the page that contains this bit */
744 745
static inline unsigned long file_page_index(struct bitmap_storage *store,
					    unsigned long chunk)
746
{
747
	if (store->sb_page)
748 749
		chunk += sizeof(bitmap_super_t) << 3;
	return chunk >> PAGE_BIT_SHIFT;
750 751 752
}

/* calculate the (bit) offset of this bit within a page */
753 754
static inline unsigned long file_page_offset(struct bitmap_storage *store,
					     unsigned long chunk)
755
{
756
	if (store->sb_page)
757 758
		chunk += sizeof(bitmap_super_t) << 3;
	return chunk & (PAGE_BITS - 1);
759 760 761 762 763 764
}

/*
 * return a pointer to the page in the filemap that contains the given bit
 *
 */
765
static inline struct page *filemap_get_page(struct bitmap_storage *store,
766
					    unsigned long chunk)
767
{
768
	if (file_page_index(store, chunk) >= store->file_pages)
769
		return NULL;
770
	return store->filemap[file_page_index(store, chunk)];
771 772
}

773
static int bitmap_storage_alloc(struct bitmap_storage *store,
774 775
				unsigned long chunks, int with_super,
				int slot_number)
776
{
777
	int pnum, offset = 0;
778 779 780 781 782 783 784 785
	unsigned long num_pages;
	unsigned long bytes;

	bytes = DIV_ROUND_UP(chunks, 8);
	if (with_super)
		bytes += sizeof(bitmap_super_t);

	num_pages = DIV_ROUND_UP(bytes, PAGE_SIZE);
786
	offset = slot_number * num_pages;
787 788 789 790 791 792 793

	store->filemap = kmalloc(sizeof(struct page *)
				 * num_pages, GFP_KERNEL);
	if (!store->filemap)
		return -ENOMEM;

	if (with_super && !store->sb_page) {
794
		store->sb_page = alloc_page(GFP_KERNEL|__GFP_ZERO);
795 796 797
		if (store->sb_page == NULL)
			return -ENOMEM;
	}
798

799 800 801 802
	pnum = 0;
	if (store->sb_page) {
		store->filemap[0] = store->sb_page;
		pnum = 1;
803
		store->sb_page->index = offset;
804
	}
805

806
	for ( ; pnum < num_pages; pnum++) {
807
		store->filemap[pnum] = alloc_page(GFP_KERNEL|__GFP_ZERO);
808 809 810 811
		if (!store->filemap[pnum]) {
			store->file_pages = pnum;
			return -ENOMEM;
		}
812
		store->filemap[pnum]->index = pnum + offset;
813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828
	}
	store->file_pages = pnum;

	/* We need 4 bits per page, rounded up to a multiple
	 * of sizeof(unsigned long) */
	store->filemap_attr = kzalloc(
		roundup(DIV_ROUND_UP(num_pages*4, 8), sizeof(unsigned long)),
		GFP_KERNEL);
	if (!store->filemap_attr)
		return -ENOMEM;

	store->bytes = bytes;

	return 0;
}

829
static void bitmap_file_unmap(struct bitmap_storage *store)
830 831 832
{
	struct page **map, *sb_page;
	int pages;
833
	struct file *file;
834

835
	file = store->file;
836 837 838
	map = store->filemap;
	pages = store->file_pages;
	sb_page = store->sb_page;
839 840

	while (pages--)
841
		if (map[pages] != sb_page) /* 0 is sb_page, release it below */
842
			free_buffers(map[pages]);
843
	kfree(map);
844
	kfree(store->filemap_attr);
845

846 847
	if (sb_page)
		free_buffers(sb_page);
848

849
	if (file) {
A
Al Viro 已提交
850
		struct inode *inode = file_inode(file);
851
		invalidate_mapping_pages(inode->i_mapping, 0, -1);
852
		fput(file);
853
	}
854 855 856 857 858 859 860 861 862 863 864
}

/*
 * bitmap_file_kick - if an error occurs while manipulating the bitmap file
 * then it is no longer reliable, so we stop using it and we mark the file
 * as failed in the superblock
 */
static void bitmap_file_kick(struct bitmap *bitmap)
{
	char *path, *ptr = NULL;

865
	if (!test_and_set_bit(BITMAP_STALE, &bitmap->flags)) {
866
		bitmap_update_sb(bitmap);
867

868
		if (bitmap->storage.file) {
869 870
			path = kmalloc(PAGE_SIZE, GFP_KERNEL);
			if (path)
M
Miklos Szeredi 已提交
871
				ptr = file_path(bitmap->storage.file,
872
					     path, PAGE_SIZE);
C
Christoph Hellwig 已提交
873

874 875
			pr_warn("%s: kicking failed bitmap file %s from array!\n",
				bmname(bitmap), IS_ERR(ptr) ? "" : ptr);
876

877 878
			kfree(path);
		} else
879 880
			pr_warn("%s: disabling internal bitmap due to errors\n",
				bmname(bitmap));
881
	}
882 883 884
}

enum bitmap_page_attr {
885
	BITMAP_PAGE_DIRTY = 0,     /* there are set bits that need to be synced */
886 887
	BITMAP_PAGE_PENDING = 1,   /* there are bits that are being cleaned.
				    * i.e. counter is 1 or 2. */
888
	BITMAP_PAGE_NEEDWRITE = 2, /* there are cleared bits that need to be synced */
889 890
};

891 892
static inline void set_page_attr(struct bitmap *bitmap, int pnum,
				 enum bitmap_page_attr attr)
893
{
894
	set_bit((pnum<<2) + attr, bitmap->storage.filemap_attr);
895 896
}

897 898
static inline void clear_page_attr(struct bitmap *bitmap, int pnum,
				   enum bitmap_page_attr attr)
899
{
900
	clear_bit((pnum<<2) + attr, bitmap->storage.filemap_attr);
901 902
}

903 904
static inline int test_page_attr(struct bitmap *bitmap, int pnum,
				 enum bitmap_page_attr attr)
905
{
906
	return test_bit((pnum<<2) + attr, bitmap->storage.filemap_attr);
907 908
}

909 910 911 912 913 914
static inline int test_and_clear_page_attr(struct bitmap *bitmap, int pnum,
					   enum bitmap_page_attr attr)
{
	return test_and_clear_bit((pnum<<2) + attr,
				  bitmap->storage.filemap_attr);
}
915 916 917 918 919 920 921 922 923 924
/*
 * bitmap_file_set_bit -- called before performing a write to the md device
 * to set (and eventually sync) a particular bit in the bitmap file
 *
 * we set the bit immediately, then we record the page number so that
 * when an unplug occurs, we can flush the dirty pages out to disk
 */
static void bitmap_file_set_bit(struct bitmap *bitmap, sector_t block)
{
	unsigned long bit;
925
	struct page *page;
926
	void *kaddr;
927
	unsigned long chunk = block >> bitmap->counts.chunkshift;
928 929 930 931 932
	struct bitmap_storage *store = &bitmap->storage;
	unsigned long node_offset = 0;

	if (mddev_is_clustered(bitmap->mddev))
		node_offset = bitmap->cluster_slot * store->file_pages;
933

934
	page = filemap_get_page(&bitmap->storage, chunk);
935 936
	if (!page)
		return;
937
	bit = file_page_offset(&bitmap->storage, chunk);
938

939
	/* set the bit */
940
	kaddr = kmap_atomic(page);
941
	if (test_bit(BITMAP_HOSTENDIAN, &bitmap->flags))
942 943
		set_bit(bit, kaddr);
	else
944
		set_bit_le(bit, kaddr);
945
	kunmap_atomic(kaddr);
946
	pr_debug("set file bit %lu page %lu\n", bit, page->index);
947
	/* record page number so it gets flushed to disk when unplug occurs */
948
	set_page_attr(bitmap, page->index - node_offset, BITMAP_PAGE_DIRTY);
949 950
}

951 952 953 954 955
static void bitmap_file_clear_bit(struct bitmap *bitmap, sector_t block)
{
	unsigned long bit;
	struct page *page;
	void *paddr;
956
	unsigned long chunk = block >> bitmap->counts.chunkshift;
957 958 959 960 961
	struct bitmap_storage *store = &bitmap->storage;
	unsigned long node_offset = 0;

	if (mddev_is_clustered(bitmap->mddev))
		node_offset = bitmap->cluster_slot * store->file_pages;
962

963
	page = filemap_get_page(&bitmap->storage, chunk);
964 965
	if (!page)
		return;
966
	bit = file_page_offset(&bitmap->storage, chunk);
967
	paddr = kmap_atomic(page);
968
	if (test_bit(BITMAP_HOSTENDIAN, &bitmap->flags))
969 970
		clear_bit(bit, paddr);
	else
971
		clear_bit_le(bit, paddr);
972
	kunmap_atomic(paddr);
973 974
	if (!test_page_attr(bitmap, page->index - node_offset, BITMAP_PAGE_NEEDWRITE)) {
		set_page_attr(bitmap, page->index - node_offset, BITMAP_PAGE_PENDING);
975 976 977 978
		bitmap->allclean = 0;
	}
}

979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000
static int bitmap_file_test_bit(struct bitmap *bitmap, sector_t block)
{
	unsigned long bit;
	struct page *page;
	void *paddr;
	unsigned long chunk = block >> bitmap->counts.chunkshift;
	int set = 0;

	page = filemap_get_page(&bitmap->storage, chunk);
	if (!page)
		return -EINVAL;
	bit = file_page_offset(&bitmap->storage, chunk);
	paddr = kmap_atomic(page);
	if (test_bit(BITMAP_HOSTENDIAN, &bitmap->flags))
		set = test_bit(bit, paddr);
	else
		set = test_bit_le(bit, paddr);
	kunmap_atomic(paddr);
	return set;
}


1001 1002 1003
/* this gets called when the md device is ready to unplug its underlying
 * (slave) device queues -- before we let any writes go down, we need to
 * sync the dirty pages of the bitmap file to disk */
1004
void bitmap_unplug(struct bitmap *bitmap)
1005
{
1006
	unsigned long i;
1007
	int dirty, need_write;
1008
	int writing = 0;
1009

1010 1011
	if (!bitmap || !bitmap->storage.filemap ||
	    test_bit(BITMAP_STALE, &bitmap->flags))
1012
		return;
1013 1014 1015

	/* look at each page to see if there are any set bits that need to be
	 * flushed out to disk */
1016
	for (i = 0; i < bitmap->storage.file_pages; i++) {
1017
		if (!bitmap->storage.filemap)
1018
			return;
1019 1020 1021 1022
		dirty = test_and_clear_page_attr(bitmap, i, BITMAP_PAGE_DIRTY);
		need_write = test_and_clear_page_attr(bitmap, i,
						      BITMAP_PAGE_NEEDWRITE);
		if (dirty || need_write) {
1023
			if (!writing) {
1024
				bitmap_wait_writes(bitmap);
1025 1026 1027 1028
				if (bitmap->mddev->queue)
					blk_add_trace_msg(bitmap->mddev->queue,
							  "md bitmap_unplug");
			}
1029
			clear_page_attr(bitmap, i, BITMAP_PAGE_PENDING);
1030
			write_page(bitmap, bitmap->storage.filemap[i], 0);
1031
			writing = 1;
1032
		}
1033
	}
1034 1035
	if (writing)
		bitmap_wait_writes(bitmap);
1036

1037
	if (test_bit(BITMAP_WRITE_ERROR, &bitmap->flags))
1038
		bitmap_file_kick(bitmap);
1039
}
1040
EXPORT_SYMBOL(bitmap_unplug);
1041

1042
static void bitmap_set_memory_bits(struct bitmap *bitmap, sector_t offset, int needed);
1043 1044 1045 1046 1047 1048 1049
/* * bitmap_init_from_disk -- called at bitmap_create time to initialize
 * the in-memory bitmap from the on-disk bitmap -- also, sets up the
 * memory mapping of the bitmap file
 * Special cases:
 *   if there's no bitmap file, or if the bitmap file had been
 *   previously kicked from the array, we mark all the bits as
 *   1's in order to cause a full resync.
1050 1051 1052
 *
 * We ignore all bits for sectors that end earlier than 'start'.
 * This is used when reading an out-of-date bitmap...
1053
 */
1054
static int bitmap_init_from_disk(struct bitmap *bitmap, sector_t start)
1055
{
1056
	unsigned long i, chunks, index, oldindex, bit, node_offset = 0;
1057
	struct page *page = NULL;
1058
	unsigned long bit_cnt = 0;
1059
	struct file *file;
1060
	unsigned long offset;
1061 1062
	int outofdate;
	int ret = -ENOSPC;
1063
	void *paddr;
1064
	struct bitmap_storage *store = &bitmap->storage;
1065

1066
	chunks = bitmap->counts.chunks;
1067
	file = store->file;
1068

1069 1070
	if (!file && !bitmap->mddev->bitmap_info.offset) {
		/* No permanent bitmap - fill with '1s'. */
1071 1072
		store->filemap = NULL;
		store->file_pages = 0;
1073 1074
		for (i = 0; i < chunks ; i++) {
			/* if the disk bit is set, set the memory bit */
1075
			int needed = ((sector_t)(i+1) << (bitmap->counts.chunkshift)
1076 1077
				      >= start);
			bitmap_set_memory_bits(bitmap,
1078
					       (sector_t)i << bitmap->counts.chunkshift,
1079 1080 1081 1082
					       needed);
		}
		return 0;
	}
1083

1084
	outofdate = test_bit(BITMAP_STALE, &bitmap->flags);
1085
	if (outofdate)
1086
		pr_warn("%s: bitmap file is out of date, doing full recovery\n", bmname(bitmap));
1087

1088
	if (file && i_size_read(file->f_mapping->host) < store->bytes) {
1089 1090 1091 1092
		pr_warn("%s: bitmap file too short %lu < %lu\n",
			bmname(bitmap),
			(unsigned long) i_size_read(file->f_mapping->host),
			store->bytes);
1093
		goto err;
1094
	}
1095

1096
	oldindex = ~0L;
1097
	offset = 0;
1098
	if (!bitmap->mddev->bitmap_info.external)
1099
		offset = sizeof(bitmap_super_t);
1100

1101 1102 1103
	if (mddev_is_clustered(bitmap->mddev))
		node_offset = bitmap->cluster_slot * (DIV_ROUND_UP(store->bytes, PAGE_SIZE));

1104
	for (i = 0; i < chunks; i++) {
1105
		int b;
1106 1107
		index = file_page_index(&bitmap->storage, i);
		bit = file_page_offset(&bitmap->storage, i);
1108
		if (index != oldindex) { /* this is a new page, read it in */
1109
			int count;
1110
			/* unmap the old page, we're done with it */
1111 1112
			if (index == store->file_pages-1)
				count = store->bytes - index * PAGE_SIZE;
1113 1114
			else
				count = PAGE_SIZE;
1115
			page = store->filemap[index];
1116 1117 1118 1119 1120 1121 1122 1123
			if (file)
				ret = read_page(file, index, bitmap,
						count, page);
			else
				ret = read_sb_page(
					bitmap->mddev,
					bitmap->mddev->bitmap_info.offset,
					page,
1124
					index + node_offset, count);
1125 1126

			if (ret)
1127
				goto err;
1128

1129 1130 1131 1132 1133
			oldindex = index;

			if (outofdate) {
				/*
				 * if bitmap is out of date, dirty the
1134
				 * whole page and write it out
1135
				 */
1136
				paddr = kmap_atomic(page);
1137
				memset(paddr + offset, 0xff,
1138
				       PAGE_SIZE - offset);
1139
				kunmap_atomic(paddr);
1140 1141 1142
				write_page(bitmap, page, 1);

				ret = -EIO;
1143 1144
				if (test_bit(BITMAP_WRITE_ERROR,
					     &bitmap->flags))
1145
					goto err;
1146 1147
			}
		}
1148
		paddr = kmap_atomic(page);
1149
		if (test_bit(BITMAP_HOSTENDIAN, &bitmap->flags))
1150
			b = test_bit(bit, paddr);
1151
		else
A
Akinobu Mita 已提交
1152
			b = test_bit_le(bit, paddr);
1153
		kunmap_atomic(paddr);
1154
		if (b) {
1155
			/* if the disk bit is set, set the memory bit */
1156
			int needed = ((sector_t)(i+1) << bitmap->counts.chunkshift
1157 1158
				      >= start);
			bitmap_set_memory_bits(bitmap,
1159
					       (sector_t)i << bitmap->counts.chunkshift,
1160
					       needed);
1161 1162
			bit_cnt++;
		}
1163
		offset = 0;
1164 1165
	}

1166 1167 1168
	pr_debug("%s: bitmap initialized from disk: read %lu pages, set %lu of %lu bits\n",
		 bmname(bitmap), store->file_pages,
		 bit_cnt, chunks);
1169 1170

	return 0;
1171

1172
 err:
1173 1174
	pr_warn("%s: bitmap initialisation failed: %d\n",
		bmname(bitmap), ret);
1175 1176 1177
	return ret;
}

1178 1179 1180 1181 1182
void bitmap_write_all(struct bitmap *bitmap)
{
	/* We don't actually write all bitmap blocks here,
	 * just flag them as needing to be written
	 */
1183
	int i;
1184

1185
	if (!bitmap || !bitmap->storage.filemap)
1186
		return;
1187
	if (bitmap->storage.file)
1188 1189 1190
		/* Only one copy, so nothing needed */
		return;

1191
	for (i = 0; i < bitmap->storage.file_pages; i++)
1192
		set_page_attr(bitmap, i,
1193
			      BITMAP_PAGE_NEEDWRITE);
1194
	bitmap->allclean = 0;
1195 1196
}

1197 1198
static void bitmap_count_page(struct bitmap_counts *bitmap,
			      sector_t offset, int inc)
1199
{
1200
	sector_t chunk = offset >> bitmap->chunkshift;
1201 1202 1203 1204
	unsigned long page = chunk >> PAGE_COUNTER_SHIFT;
	bitmap->bp[page].count += inc;
	bitmap_checkfree(bitmap, page);
}
1205

1206
static void bitmap_set_pending(struct bitmap_counts *bitmap, sector_t offset)
1207 1208 1209 1210 1211 1212 1213 1214 1215
{
	sector_t chunk = offset >> bitmap->chunkshift;
	unsigned long page = chunk >> PAGE_COUNTER_SHIFT;
	struct bitmap_page *bp = &bitmap->bp[page];

	if (!bp->pending)
		bp->pending = 1;
}

1216
static bitmap_counter_t *bitmap_get_counter(struct bitmap_counts *bitmap,
N
NeilBrown 已提交
1217
					    sector_t offset, sector_t *blocks,
1218 1219 1220 1221 1222 1223 1224
					    int create);

/*
 * bitmap daemon -- periodically wakes up to clean bits and flush pages
 *			out to disk
 */

1225
void bitmap_daemon_work(struct mddev *mddev)
1226
{
1227
	struct bitmap *bitmap;
1228
	unsigned long j;
1229
	unsigned long nextpage;
N
NeilBrown 已提交
1230
	sector_t blocks;
1231
	struct bitmap_counts *counts;
1232

1233 1234 1235
	/* Use a mutex to guard daemon_work against
	 * bitmap_destroy.
	 */
1236
	mutex_lock(&mddev->bitmap_info.mutex);
1237 1238
	bitmap = mddev->bitmap;
	if (bitmap == NULL) {
1239
		mutex_unlock(&mddev->bitmap_info.mutex);
1240
		return;
1241
	}
1242
	if (time_before(jiffies, bitmap->daemon_lastrun
N
NeilBrown 已提交
1243
			+ mddev->bitmap_info.daemon_sleep))
1244 1245
		goto done;

1246
	bitmap->daemon_lastrun = jiffies;
1247
	if (bitmap->allclean) {
N
NeilBrown 已提交
1248
		mddev->thread->timeout = MAX_SCHEDULE_TIMEOUT;
1249
		goto done;
1250 1251
	}
	bitmap->allclean = 1;
1252

1253 1254 1255 1256
	if (bitmap->mddev->queue)
		blk_add_trace_msg(bitmap->mddev->queue,
				  "md bitmap_daemon_work");

1257 1258 1259 1260
	/* Any file-page which is PENDING now needs to be written.
	 * So set NEEDWRITE now, then after we make any last-minute changes
	 * we will write it.
	 */
1261
	for (j = 0; j < bitmap->storage.file_pages; j++)
1262 1263
		if (test_and_clear_page_attr(bitmap, j,
					     BITMAP_PAGE_PENDING))
1264
			set_page_attr(bitmap, j,
1265 1266 1267 1268 1269 1270 1271 1272
				      BITMAP_PAGE_NEEDWRITE);

	if (bitmap->need_sync &&
	    mddev->bitmap_info.external == 0) {
		/* Arrange for superblock update as well as
		 * other changes */
		bitmap_super_t *sb;
		bitmap->need_sync = 0;
1273 1274
		if (bitmap->storage.filemap) {
			sb = kmap_atomic(bitmap->storage.sb_page);
1275 1276 1277
			sb->events_cleared =
				cpu_to_le64(bitmap->events_cleared);
			kunmap_atomic(sb);
1278
			set_page_attr(bitmap, 0,
1279 1280
				      BITMAP_PAGE_NEEDWRITE);
		}
1281 1282 1283 1284
	}
	/* Now look at the bitmap counters and if any are '2' or '1',
	 * decrement and handle accordingly.
	 */
1285 1286
	counts = &bitmap->counts;
	spin_lock_irq(&counts->lock);
1287
	nextpage = 0;
1288
	for (j = 0; j < counts->chunks; j++) {
1289
		bitmap_counter_t *bmc;
1290
		sector_t  block = (sector_t)j << counts->chunkshift;
1291

1292 1293
		if (j == nextpage) {
			nextpage += PAGE_COUNTER_RATIO;
1294
			if (!counts->bp[j >> PAGE_COUNTER_SHIFT].pending) {
1295
				j |= PAGE_COUNTER_MASK;
1296 1297
				continue;
			}
1298
			counts->bp[j >> PAGE_COUNTER_SHIFT].pending = 0;
1299
		}
1300
		bmc = bitmap_get_counter(counts,
1301
					 block,
1302
					 &blocks, 0);
1303 1304

		if (!bmc) {
1305
			j |= PAGE_COUNTER_MASK;
1306 1307 1308 1309 1310
			continue;
		}
		if (*bmc == 1 && !bitmap->need_sync) {
			/* We can clear the bit */
			*bmc = 0;
1311
			bitmap_count_page(counts, block, -1);
1312
			bitmap_file_clear_bit(bitmap, block);
1313 1314
		} else if (*bmc && *bmc <= 2) {
			*bmc = 1;
1315
			bitmap_set_pending(counts, block);
1316
			bitmap->allclean = 0;
1317
		}
1318
	}
1319
	spin_unlock_irq(&counts->lock);
1320

1321
	bitmap_wait_writes(bitmap);
1322 1323 1324 1325 1326 1327 1328 1329
	/* Now start writeout on any page in NEEDWRITE that isn't DIRTY.
	 * DIRTY pages need to be written by bitmap_unplug so it can wait
	 * for them.
	 * If we find any DIRTY page we stop there and let bitmap_unplug
	 * handle all the rest.  This is important in the case where
	 * the first blocking holds the superblock and it has been updated.
	 * We mustn't write any other blocks before the superblock.
	 */
1330 1331 1332 1333
	for (j = 0;
	     j < bitmap->storage.file_pages
		     && !test_bit(BITMAP_STALE, &bitmap->flags);
	     j++) {
1334
		if (test_page_attr(bitmap, j,
1335 1336 1337
				   BITMAP_PAGE_DIRTY))
			/* bitmap_unplug will handle the rest */
			break;
1338 1339
		if (test_and_clear_page_attr(bitmap, j,
					     BITMAP_PAGE_NEEDWRITE)) {
1340
			write_page(bitmap, bitmap->storage.filemap[j], 0);
1341 1342 1343
		}
	}

1344
 done:
1345
	if (bitmap->allclean == 0)
N
NeilBrown 已提交
1346 1347
		mddev->thread->timeout =
			mddev->bitmap_info.daemon_sleep;
1348
	mutex_unlock(&mddev->bitmap_info.mutex);
1349 1350
}

1351
static bitmap_counter_t *bitmap_get_counter(struct bitmap_counts *bitmap,
N
NeilBrown 已提交
1352
					    sector_t offset, sector_t *blocks,
1353
					    int create)
1354 1355
__releases(bitmap->lock)
__acquires(bitmap->lock)
1356 1357 1358 1359 1360
{
	/* If 'create', we might release the lock and reclaim it.
	 * The lock must have been taken with interrupts enabled.
	 * If !create, we don't release the lock.
	 */
1361
	sector_t chunk = offset >> bitmap->chunkshift;
1362 1363 1364
	unsigned long page = chunk >> PAGE_COUNTER_SHIFT;
	unsigned long pageoff = (chunk & PAGE_COUNTER_MASK) << COUNTER_BYTE_SHIFT;
	sector_t csize;
1365
	int err;
1366

1367
	err = bitmap_checkpage(bitmap, page, create, 0);
1368 1369 1370

	if (bitmap->bp[page].hijacked ||
	    bitmap->bp[page].map == NULL)
1371
		csize = ((sector_t)1) << (bitmap->chunkshift +
1372 1373
					  PAGE_COUNTER_SHIFT - 1);
	else
1374
		csize = ((sector_t)1) << bitmap->chunkshift;
1375 1376 1377
	*blocks = csize - (offset & (csize - 1));

	if (err < 0)
1378
		return NULL;
1379

1380 1381 1382 1383 1384 1385 1386 1387
	/* now locked ... */

	if (bitmap->bp[page].hijacked) { /* hijacked pointer */
		/* should we use the first or second counter field
		 * of the hijacked pointer? */
		int hi = (pageoff > PAGE_COUNTER_MASK);
		return  &((bitmap_counter_t *)
			  &bitmap->bp[page].map)[hi];
1388
	} else /* page is allocated */
1389 1390 1391 1392
		return (bitmap_counter_t *)
			&(bitmap->bp[page].map[pageoff]);
}

1393
int bitmap_startwrite(struct bitmap *bitmap, sector_t offset, unsigned long sectors, int behind)
1394
{
1395 1396
	if (!bitmap)
		return 0;
1397 1398

	if (behind) {
1399
		int bw;
1400
		atomic_inc(&bitmap->behind_writes);
1401 1402 1403 1404
		bw = atomic_read(&bitmap->behind_writes);
		if (bw > bitmap->behind_writes_used)
			bitmap->behind_writes_used = bw;

1405 1406
		pr_debug("inc write-behind count %d/%lu\n",
			 bw, bitmap->mddev->bitmap_info.max_write_behind);
1407 1408
	}

1409
	while (sectors) {
N
NeilBrown 已提交
1410
		sector_t blocks;
1411 1412
		bitmap_counter_t *bmc;

1413 1414
		spin_lock_irq(&bitmap->counts.lock);
		bmc = bitmap_get_counter(&bitmap->counts, offset, &blocks, 1);
1415
		if (!bmc) {
1416
			spin_unlock_irq(&bitmap->counts.lock);
1417 1418 1419
			return 0;
		}

1420
		if (unlikely(COUNTER(*bmc) == COUNTER_MAX)) {
1421 1422 1423 1424 1425 1426 1427
			DEFINE_WAIT(__wait);
			/* note that it is safe to do the prepare_to_wait
			 * after the test as long as we do it before dropping
			 * the spinlock.
			 */
			prepare_to_wait(&bitmap->overflow_wait, &__wait,
					TASK_UNINTERRUPTIBLE);
1428
			spin_unlock_irq(&bitmap->counts.lock);
1429
			schedule();
1430 1431 1432 1433
			finish_wait(&bitmap->overflow_wait, &__wait);
			continue;
		}

1434
		switch (*bmc) {
1435 1436
		case 0:
			bitmap_file_set_bit(bitmap, offset);
1437
			bitmap_count_page(&bitmap->counts, offset, 1);
1438 1439 1440 1441
			/* fall through */
		case 1:
			*bmc = 2;
		}
1442

1443 1444
		(*bmc)++;

1445
		spin_unlock_irq(&bitmap->counts.lock);
1446 1447 1448 1449

		offset += blocks;
		if (sectors > blocks)
			sectors -= blocks;
1450 1451
		else
			sectors = 0;
1452 1453 1454
	}
	return 0;
}
1455
EXPORT_SYMBOL(bitmap_startwrite);
1456 1457

void bitmap_endwrite(struct bitmap *bitmap, sector_t offset, unsigned long sectors,
1458
		     int success, int behind)
1459
{
1460 1461
	if (!bitmap)
		return;
1462
	if (behind) {
1463 1464
		if (atomic_dec_and_test(&bitmap->behind_writes))
			wake_up(&bitmap->behind_wait);
1465 1466 1467
		pr_debug("dec write-behind count %d/%lu\n",
			 atomic_read(&bitmap->behind_writes),
			 bitmap->mddev->bitmap_info.max_write_behind);
1468 1469
	}

1470
	while (sectors) {
N
NeilBrown 已提交
1471
		sector_t blocks;
1472 1473 1474
		unsigned long flags;
		bitmap_counter_t *bmc;

1475 1476
		spin_lock_irqsave(&bitmap->counts.lock, flags);
		bmc = bitmap_get_counter(&bitmap->counts, offset, &blocks, 0);
1477
		if (!bmc) {
1478
			spin_unlock_irqrestore(&bitmap->counts.lock, flags);
1479 1480 1481
			return;
		}

1482
		if (success && !bitmap->mddev->degraded &&
1483 1484 1485
		    bitmap->events_cleared < bitmap->mddev->events) {
			bitmap->events_cleared = bitmap->mddev->events;
			bitmap->need_sync = 1;
1486
			sysfs_notify_dirent_safe(bitmap->sysfs_can_clear);
1487 1488
		}

1489
		if (!success && !NEEDED(*bmc))
1490 1491
			*bmc |= NEEDED_MASK;

1492
		if (COUNTER(*bmc) == COUNTER_MAX)
1493 1494
			wake_up(&bitmap->overflow_wait);

1495
		(*bmc)--;
1496
		if (*bmc <= 2) {
1497
			bitmap_set_pending(&bitmap->counts, offset);
1498 1499
			bitmap->allclean = 0;
		}
1500
		spin_unlock_irqrestore(&bitmap->counts.lock, flags);
1501 1502 1503
		offset += blocks;
		if (sectors > blocks)
			sectors -= blocks;
1504 1505
		else
			sectors = 0;
1506 1507
	}
}
1508
EXPORT_SYMBOL(bitmap_endwrite);
1509

N
NeilBrown 已提交
1510
static int __bitmap_start_sync(struct bitmap *bitmap, sector_t offset, sector_t *blocks,
1511
			       int degraded)
1512 1513 1514 1515 1516 1517 1518
{
	bitmap_counter_t *bmc;
	int rv;
	if (bitmap == NULL) {/* FIXME or bitmap set as 'failed' */
		*blocks = 1024;
		return 1; /* always resync if no bitmap */
	}
1519 1520
	spin_lock_irq(&bitmap->counts.lock);
	bmc = bitmap_get_counter(&bitmap->counts, offset, blocks, 0);
1521 1522 1523 1524 1525 1526 1527
	rv = 0;
	if (bmc) {
		/* locked */
		if (RESYNC(*bmc))
			rv = 1;
		else if (NEEDED(*bmc)) {
			rv = 1;
1528 1529 1530 1531
			if (!degraded) { /* don't set/clear bits if degraded */
				*bmc |= RESYNC_MASK;
				*bmc &= ~NEEDED_MASK;
			}
1532 1533
		}
	}
1534
	spin_unlock_irq(&bitmap->counts.lock);
1535 1536 1537
	return rv;
}

N
NeilBrown 已提交
1538
int bitmap_start_sync(struct bitmap *bitmap, sector_t offset, sector_t *blocks,
1539 1540 1541 1542 1543 1544 1545 1546 1547 1548
		      int degraded)
{
	/* bitmap_start_sync must always report on multiples of whole
	 * pages, otherwise resync (which is very PAGE_SIZE based) will
	 * get confused.
	 * So call __bitmap_start_sync repeatedly (if needed) until
	 * At least PAGE_SIZE>>9 blocks are covered.
	 * Return the 'or' of the result.
	 */
	int rv = 0;
N
NeilBrown 已提交
1549
	sector_t blocks1;
1550 1551 1552 1553 1554 1555 1556 1557 1558 1559

	*blocks = 0;
	while (*blocks < (PAGE_SIZE>>9)) {
		rv |= __bitmap_start_sync(bitmap, offset,
					  &blocks1, degraded);
		offset += blocks1;
		*blocks += blocks1;
	}
	return rv;
}
1560
EXPORT_SYMBOL(bitmap_start_sync);
1561

N
NeilBrown 已提交
1562
void bitmap_end_sync(struct bitmap *bitmap, sector_t offset, sector_t *blocks, int aborted)
1563 1564 1565
{
	bitmap_counter_t *bmc;
	unsigned long flags;
1566 1567

	if (bitmap == NULL) {
1568 1569 1570
		*blocks = 1024;
		return;
	}
1571 1572
	spin_lock_irqsave(&bitmap->counts.lock, flags);
	bmc = bitmap_get_counter(&bitmap->counts, offset, blocks, 0);
1573 1574 1575 1576 1577 1578 1579 1580 1581
	if (bmc == NULL)
		goto unlock;
	/* locked */
	if (RESYNC(*bmc)) {
		*bmc &= ~RESYNC_MASK;

		if (!NEEDED(*bmc) && aborted)
			*bmc |= NEEDED_MASK;
		else {
1582
			if (*bmc <= 2) {
1583
				bitmap_set_pending(&bitmap->counts, offset);
1584 1585
				bitmap->allclean = 0;
			}
1586 1587 1588
		}
	}
 unlock:
1589
	spin_unlock_irqrestore(&bitmap->counts.lock, flags);
1590
}
1591
EXPORT_SYMBOL(bitmap_end_sync);
1592 1593 1594 1595 1596 1597 1598 1599

void bitmap_close_sync(struct bitmap *bitmap)
{
	/* Sync has finished, and any bitmap chunks that weren't synced
	 * properly have been aborted.  It remains to us to clear the
	 * RESYNC bit wherever it is still on
	 */
	sector_t sector = 0;
N
NeilBrown 已提交
1600
	sector_t blocks;
N
NeilBrown 已提交
1601 1602
	if (!bitmap)
		return;
1603 1604
	while (sector < bitmap->mddev->resync_max_sectors) {
		bitmap_end_sync(bitmap, sector, &blocks, 0);
N
NeilBrown 已提交
1605 1606 1607
		sector += blocks;
	}
}
1608
EXPORT_SYMBOL(bitmap_close_sync);
N
NeilBrown 已提交
1609

1610
void bitmap_cond_end_sync(struct bitmap *bitmap, sector_t sector, bool force)
N
NeilBrown 已提交
1611 1612
{
	sector_t s = 0;
N
NeilBrown 已提交
1613
	sector_t blocks;
N
NeilBrown 已提交
1614 1615 1616 1617 1618 1619 1620

	if (!bitmap)
		return;
	if (sector == 0) {
		bitmap->last_end_sync = jiffies;
		return;
	}
1621
	if (!force && time_before(jiffies, (bitmap->last_end_sync
1622
				  + bitmap->mddev->bitmap_info.daemon_sleep)))
N
NeilBrown 已提交
1623 1624 1625 1626
		return;
	wait_event(bitmap->mddev->recovery_wait,
		   atomic_read(&bitmap->mddev->recovery_active) == 0);

1627
	bitmap->mddev->curr_resync_completed = sector;
1628
	set_bit(MD_SB_CHANGE_CLEAN, &bitmap->mddev->sb_flags);
1629
	sector &= ~((1ULL << bitmap->counts.chunkshift) - 1);
N
NeilBrown 已提交
1630 1631 1632 1633
	s = 0;
	while (s < sector && s < bitmap->mddev->resync_max_sectors) {
		bitmap_end_sync(bitmap, s, &blocks, 0);
		s += blocks;
1634
	}
N
NeilBrown 已提交
1635
	bitmap->last_end_sync = jiffies;
1636
	sysfs_notify(&bitmap->mddev->kobj, NULL, "sync_completed");
1637
}
1638
EXPORT_SYMBOL(bitmap_cond_end_sync);
1639

1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660
void bitmap_sync_with_cluster(struct mddev *mddev,
			      sector_t old_lo, sector_t old_hi,
			      sector_t new_lo, sector_t new_hi)
{
	struct bitmap *bitmap = mddev->bitmap;
	sector_t sector, blocks = 0;

	for (sector = old_lo; sector < new_lo; ) {
		bitmap_end_sync(bitmap, sector, &blocks, 0);
		sector += blocks;
	}
	WARN((blocks > new_lo) && old_lo, "alignment is not correct for lo\n");

	for (sector = old_hi; sector < new_hi; ) {
		bitmap_start_sync(bitmap, sector, &blocks, 0);
		sector += blocks;
	}
	WARN((blocks > new_hi) && old_hi, "alignment is not correct for hi\n");
}
EXPORT_SYMBOL(bitmap_sync_with_cluster);

1661
static void bitmap_set_memory_bits(struct bitmap *bitmap, sector_t offset, int needed)
1662 1663
{
	/* For each chunk covered by any of these sectors, set the
1664
	 * counter to 2 and possibly set resync_needed.  They should all
1665 1666
	 * be 0 at this point
	 */
1667

N
NeilBrown 已提交
1668
	sector_t secs;
1669
	bitmap_counter_t *bmc;
1670 1671
	spin_lock_irq(&bitmap->counts.lock);
	bmc = bitmap_get_counter(&bitmap->counts, offset, &secs, 1);
1672
	if (!bmc) {
1673
		spin_unlock_irq(&bitmap->counts.lock);
1674
		return;
1675
	}
1676
	if (!*bmc) {
1677
		*bmc = 2;
1678 1679
		bitmap_count_page(&bitmap->counts, offset, 1);
		bitmap_set_pending(&bitmap->counts, offset);
1680
		bitmap->allclean = 0;
1681
	}
1682 1683
	if (needed)
		*bmc |= NEEDED_MASK;
1684
	spin_unlock_irq(&bitmap->counts.lock);
1685 1686
}

1687 1688 1689 1690 1691 1692
/* dirty the memory and file bits for bitmap chunks "s" to "e" */
void bitmap_dirty_bits(struct bitmap *bitmap, unsigned long s, unsigned long e)
{
	unsigned long chunk;

	for (chunk = s; chunk <= e; chunk++) {
1693
		sector_t sec = (sector_t)chunk << bitmap->counts.chunkshift;
1694 1695
		bitmap_set_memory_bits(bitmap, sec, 1);
		bitmap_file_set_bit(bitmap, sec);
1696 1697 1698 1699 1700 1701
		if (sec < bitmap->mddev->recovery_cp)
			/* We are asserting that the array is dirty,
			 * so move the recovery_cp address back so
			 * that it is obvious that it is dirty
			 */
			bitmap->mddev->recovery_cp = sec;
1702 1703 1704
	}
}

1705 1706 1707
/*
 * flush out any pending updates
 */
1708
void bitmap_flush(struct mddev *mddev)
1709 1710
{
	struct bitmap *bitmap = mddev->bitmap;
1711
	long sleep;
1712 1713 1714 1715 1716 1717 1718

	if (!bitmap) /* there was no bitmap */
		return;

	/* run the daemon_work three time to ensure everything is flushed
	 * that can be
	 */
1719
	sleep = mddev->bitmap_info.daemon_sleep * 2;
1720
	bitmap->daemon_lastrun -= sleep;
1721
	bitmap_daemon_work(mddev);
1722
	bitmap->daemon_lastrun -= sleep;
1723
	bitmap_daemon_work(mddev);
1724
	bitmap->daemon_lastrun -= sleep;
1725
	bitmap_daemon_work(mddev);
1726 1727 1728
	bitmap_update_sb(bitmap);
}

1729 1730 1731
/*
 * free memory that was allocated
 */
1732
void bitmap_free(struct bitmap *bitmap)
1733 1734 1735 1736 1737 1738 1739
{
	unsigned long k, pages;
	struct bitmap_page *bp;

	if (!bitmap) /* there was no bitmap */
		return;

1740 1741 1742
	if (bitmap->sysfs_can_clear)
		sysfs_put(bitmap->sysfs_can_clear);

1743 1744
	if (mddev_is_clustered(bitmap->mddev) && bitmap->mddev->cluster_info &&
		bitmap->cluster_slot == md_cluster_ops->slot_number(bitmap->mddev))
1745 1746
		md_cluster_stop(bitmap->mddev);

1747 1748 1749 1750 1751 1752
	/* Shouldn't be needed - but just in case.... */
	wait_event(bitmap->write_wait,
		   atomic_read(&bitmap->pending_writes) == 0);

	/* release the bitmap file  */
	bitmap_file_unmap(&bitmap->storage);
1753

1754 1755
	bp = bitmap->counts.bp;
	pages = bitmap->counts.pages;
1756 1757 1758 1759 1760 1761 1762 1763 1764 1765

	/* free all allocated memory */

	if (bp) /* deallocate the page memory */
		for (k = 0; k < pages; k++)
			if (bp[k].map && !bp[k].hijacked)
				kfree(bp[k].map);
	kfree(bp);
	kfree(bitmap);
}
1766
EXPORT_SYMBOL(bitmap_free);
1767

1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781
void bitmap_wait_behind_writes(struct mddev *mddev)
{
	struct bitmap *bitmap = mddev->bitmap;

	/* wait for behind writes to complete */
	if (bitmap && atomic_read(&bitmap->behind_writes) > 0) {
		pr_debug("md:%s: behind writes in progress - waiting to stop.\n",
			 mdname(mddev));
		/* need to kick something here to make sure I/O goes? */
		wait_event(bitmap->behind_wait,
			   atomic_read(&bitmap->behind_writes) == 0);
	}
}

1782
void bitmap_destroy(struct mddev *mddev)
1783 1784 1785 1786 1787 1788
{
	struct bitmap *bitmap = mddev->bitmap;

	if (!bitmap) /* there was no bitmap */
		return;

1789 1790
	bitmap_wait_behind_writes(mddev);

1791
	mutex_lock(&mddev->bitmap_info.mutex);
1792
	spin_lock(&mddev->lock);
1793
	mddev->bitmap = NULL; /* disconnect from the md device */
1794
	spin_unlock(&mddev->lock);
1795
	mutex_unlock(&mddev->bitmap_info.mutex);
1796 1797
	if (mddev->thread)
		mddev->thread->timeout = MAX_SCHEDULE_TIMEOUT;
1798 1799 1800

	bitmap_free(bitmap);
}
1801 1802 1803 1804

/*
 * initialize the bitmap structure
 * if this returns an error, bitmap_destroy must be called to do clean up
1805
 * once mddev->bitmap is set
1806
 */
1807
struct bitmap *bitmap_create(struct mddev *mddev, int slot)
1808 1809
{
	struct bitmap *bitmap;
1810
	sector_t blocks = mddev->resync_max_sectors;
1811
	struct file *file = mddev->bitmap_info.file;
1812
	int err;
1813
	struct kernfs_node *bm = NULL;
1814

A
Alexey Dobriyan 已提交
1815
	BUILD_BUG_ON(sizeof(bitmap_super_t) != 256);
1816

1817
	BUG_ON(file && mddev->bitmap_info.offset);
1818

1819
	bitmap = kzalloc(sizeof(*bitmap), GFP_KERNEL);
1820
	if (!bitmap)
1821
		return ERR_PTR(-ENOMEM);
1822

1823
	spin_lock_init(&bitmap->counts.lock);
1824 1825
	atomic_set(&bitmap->pending_writes, 0);
	init_waitqueue_head(&bitmap->write_wait);
1826
	init_waitqueue_head(&bitmap->overflow_wait);
1827
	init_waitqueue_head(&bitmap->behind_wait);
1828

1829
	bitmap->mddev = mddev;
1830
	bitmap->cluster_slot = slot;
1831

1832
	if (mddev->kobj.sd)
T
Tejun Heo 已提交
1833
		bm = sysfs_get_dirent(mddev->kobj.sd, "bitmap");
1834
	if (bm) {
T
Tejun Heo 已提交
1835
		bitmap->sysfs_can_clear = sysfs_get_dirent(bm, "can_clear");
1836 1837 1838 1839
		sysfs_put(bm);
	} else
		bitmap->sysfs_can_clear = NULL;

1840
	bitmap->storage.file = file;
1841 1842
	if (file) {
		get_file(file);
1843 1844 1845 1846
		/* As future accesses to this file will use bmap,
		 * and bypass the page cache, we must sync the file
		 * first.
		 */
1847
		vfs_fsync(file, 1);
1848
	}
1849
	/* read superblock from bitmap file (this sets mddev->bitmap_info.chunksize) */
1850 1851 1852 1853 1854 1855 1856 1857 1858 1859
	if (!mddev->bitmap_info.external) {
		/*
		 * If 'MD_ARRAY_FIRST_USE' is set, then device-mapper is
		 * instructing us to create a new on-disk bitmap instance.
		 */
		if (test_and_clear_bit(MD_ARRAY_FIRST_USE, &mddev->flags))
			err = bitmap_new_disk_sb(bitmap);
		else
			err = bitmap_read_sb(bitmap);
	} else {
1860 1861 1862 1863 1864 1865 1866
		err = 0;
		if (mddev->bitmap_info.chunksize == 0 ||
		    mddev->bitmap_info.daemon_sleep == 0)
			/* chunksize and time_base need to be
			 * set first. */
			err = -EINVAL;
	}
1867
	if (err)
1868
		goto error;
1869

1870
	bitmap->daemon_lastrun = jiffies;
1871 1872
	err = bitmap_resize(bitmap, blocks, mddev->bitmap_info.chunksize, 1);
	if (err)
1873
		goto error;
1874

1875 1876
	pr_debug("created bitmap (%lu pages) for device %s\n",
		 bitmap->counts.pages, bmname(bitmap));
1877

1878 1879 1880
	err = test_bit(BITMAP_WRITE_ERROR, &bitmap->flags) ? -EIO : 0;
	if (err)
		goto error;
1881

1882
	return bitmap;
1883 1884
 error:
	bitmap_free(bitmap);
1885
	return ERR_PTR(err);
1886 1887
}

1888
int bitmap_load(struct mddev *mddev)
1889 1890
{
	int err = 0;
1891
	sector_t start = 0;
1892 1893 1894 1895 1896 1897
	sector_t sector = 0;
	struct bitmap *bitmap = mddev->bitmap;

	if (!bitmap)
		goto out;

1898 1899 1900
	if (mddev_is_clustered(mddev))
		md_cluster_ops->load_bitmaps(mddev, mddev->bitmap_info.nodes);

1901 1902 1903 1904 1905 1906
	/* Clear out old bitmap info first:  Either there is none, or we
	 * are resuming after someone else has possibly changed things,
	 * so we should forget old cached info.
	 * All chunks should be clean, but some might need_sync.
	 */
	while (sector < mddev->resync_max_sectors) {
N
NeilBrown 已提交
1907
		sector_t blocks;
1908 1909 1910 1911 1912
		bitmap_start_sync(bitmap, sector, &blocks, 0);
		sector += blocks;
	}
	bitmap_close_sync(bitmap);

1913 1914 1915 1916 1917 1918
	if (mddev->degraded == 0
	    || bitmap->events_cleared == mddev->events)
		/* no need to keep dirty bits to optimise a
		 * re-add of a missing device */
		start = mddev->recovery_cp;

1919
	mutex_lock(&mddev->bitmap_info.mutex);
1920
	err = bitmap_init_from_disk(bitmap, start);
1921
	mutex_unlock(&mddev->bitmap_info.mutex);
1922

1923
	if (err)
1924
		goto out;
1925
	clear_bit(BITMAP_STALE, &bitmap->flags);
1926 1927 1928

	/* Kick recovery in case any bits were set */
	set_bit(MD_RECOVERY_NEEDED, &bitmap->mddev->recovery);
1929

1930
	mddev->thread->timeout = mddev->bitmap_info.daemon_sleep;
1931
	md_wakeup_thread(mddev->thread);
1932

1933 1934
	bitmap_update_sb(bitmap);

1935
	if (test_bit(BITMAP_WRITE_ERROR, &bitmap->flags))
1936 1937
		err = -EIO;
out:
1938
	return err;
1939
}
1940
EXPORT_SYMBOL_GPL(bitmap_load);
1941

1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962
struct bitmap *get_bitmap_from_slot(struct mddev *mddev, int slot)
{
	int rv = 0;
	struct bitmap *bitmap;

	bitmap = bitmap_create(mddev, slot);
	if (IS_ERR(bitmap)) {
		rv = PTR_ERR(bitmap);
		return ERR_PTR(rv);
	}

	rv = bitmap_init_from_disk(bitmap, 0);
	if (rv) {
		bitmap_free(bitmap);
		return ERR_PTR(rv);
	}

	return bitmap;
}
EXPORT_SYMBOL(get_bitmap_from_slot);

1963 1964 1965 1966
/* Loads the bitmap associated with slot and copies the resync information
 * to our bitmap
 */
int bitmap_copy_from_slot(struct mddev *mddev, int slot,
1967
		sector_t *low, sector_t *high, bool clear_bits)
1968 1969 1970 1971
{
	int rv = 0, i, j;
	sector_t block, lo = 0, hi = 0;
	struct bitmap_counts *counts;
1972
	struct bitmap *bitmap;
1973

1974 1975 1976 1977 1978
	bitmap = get_bitmap_from_slot(mddev, slot);
	if (IS_ERR(bitmap)) {
		pr_err("%s can't get bitmap from slot %d\n", __func__, slot);
		return -1;
	}
1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992

	counts = &bitmap->counts;
	for (j = 0; j < counts->chunks; j++) {
		block = (sector_t)j << counts->chunkshift;
		if (bitmap_file_test_bit(bitmap, block)) {
			if (!lo)
				lo = block;
			hi = block;
			bitmap_file_clear_bit(bitmap, block);
			bitmap_set_memory_bits(mddev->bitmap, block, 1);
			bitmap_file_set_bit(mddev->bitmap, block);
		}
	}

1993 1994
	if (clear_bits) {
		bitmap_update_sb(bitmap);
1995 1996
		/* BITMAP_PAGE_PENDING is set, but bitmap_unplug needs
		 * BITMAP_PAGE_DIRTY or _NEEDWRITE to write ... */
1997
		for (i = 0; i < bitmap->storage.file_pages; i++)
1998 1999
			if (test_page_attr(bitmap, i, BITMAP_PAGE_PENDING))
				set_page_attr(bitmap, i, BITMAP_PAGE_NEEDWRITE);
2000 2001
		bitmap_unplug(bitmap);
	}
2002
	bitmap_unplug(mddev->bitmap);
2003 2004
	*low = lo;
	*high = hi;
2005

2006 2007 2008 2009 2010
	return rv;
}
EXPORT_SYMBOL_GPL(bitmap_copy_from_slot);


2011 2012 2013
void bitmap_status(struct seq_file *seq, struct bitmap *bitmap)
{
	unsigned long chunk_kb;
2014
	struct bitmap_counts *counts;
2015 2016 2017 2018

	if (!bitmap)
		return;

2019 2020
	counts = &bitmap->counts;

2021 2022 2023
	chunk_kb = bitmap->mddev->bitmap_info.chunksize >> 10;
	seq_printf(seq, "bitmap: %lu/%lu pages [%luKB], "
		   "%lu%s chunk",
2024 2025 2026
		   counts->pages - counts->missing_pages,
		   counts->pages,
		   (counts->pages - counts->missing_pages)
2027 2028 2029
		   << (PAGE_SHIFT - 10),
		   chunk_kb ? chunk_kb : bitmap->mddev->bitmap_info.chunksize,
		   chunk_kb ? "KB" : "B");
2030
	if (bitmap->storage.file) {
2031
		seq_printf(seq, ", file: ");
M
Miklos Szeredi 已提交
2032
		seq_file_path(seq, bitmap->storage.file, " \t\n");
2033 2034 2035 2036 2037
	}

	seq_printf(seq, "\n");
}

2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060
int bitmap_resize(struct bitmap *bitmap, sector_t blocks,
		  int chunksize, int init)
{
	/* If chunk_size is 0, choose an appropriate chunk size.
	 * Then possibly allocate new storage space.
	 * Then quiesce, copy bits, replace bitmap, and re-start
	 *
	 * This function is called both to set up the initial bitmap
	 * and to resize the bitmap while the array is active.
	 * If this happens as a result of the array being resized,
	 * chunksize will be zero, and we need to choose a suitable
	 * chunksize, otherwise we use what we are given.
	 */
	struct bitmap_storage store;
	struct bitmap_counts old_counts;
	unsigned long chunks;
	sector_t block;
	sector_t old_blocks, new_blocks;
	int chunkshift;
	int ret = 0;
	long pages;
	struct bitmap_page *new_bp;

2061 2062 2063 2064 2065
	if (bitmap->storage.file && !init) {
		pr_info("md: cannot resize file-based bitmap\n");
		return -EINVAL;
	}

2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099
	if (chunksize == 0) {
		/* If there is enough space, leave the chunk size unchanged,
		 * else increase by factor of two until there is enough space.
		 */
		long bytes;
		long space = bitmap->mddev->bitmap_info.space;

		if (space == 0) {
			/* We don't know how much space there is, so limit
			 * to current size - in sectors.
			 */
			bytes = DIV_ROUND_UP(bitmap->counts.chunks, 8);
			if (!bitmap->mddev->bitmap_info.external)
				bytes += sizeof(bitmap_super_t);
			space = DIV_ROUND_UP(bytes, 512);
			bitmap->mddev->bitmap_info.space = space;
		}
		chunkshift = bitmap->counts.chunkshift;
		chunkshift--;
		do {
			/* 'chunkshift' is shift from block size to chunk size */
			chunkshift++;
			chunks = DIV_ROUND_UP_SECTOR_T(blocks, 1 << chunkshift);
			bytes = DIV_ROUND_UP(chunks, 8);
			if (!bitmap->mddev->bitmap_info.external)
				bytes += sizeof(bitmap_super_t);
		} while (bytes > (space << 9));
	} else
		chunkshift = ffz(~chunksize) - BITMAP_BLOCK_SHIFT;

	chunks = DIV_ROUND_UP_SECTOR_T(blocks, 1 << chunkshift);
	memset(&store, 0, sizeof(store));
	if (bitmap->mddev->bitmap_info.offset || bitmap->mddev->bitmap_info.file)
		ret = bitmap_storage_alloc(&store, chunks,
2100
					   !bitmap->mddev->bitmap_info.external,
2101 2102
					   mddev_is_clustered(bitmap->mddev)
					   ? bitmap->cluster_slot : 0);
2103 2104
	if (ret) {
		bitmap_file_unmap(&store);
2105
		goto err;
2106
	}
2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125

	pages = DIV_ROUND_UP(chunks, PAGE_COUNTER_RATIO);

	new_bp = kzalloc(pages * sizeof(*new_bp), GFP_KERNEL);
	ret = -ENOMEM;
	if (!new_bp) {
		bitmap_file_unmap(&store);
		goto err;
	}

	if (!init)
		bitmap->mddev->pers->quiesce(bitmap->mddev, 1);

	store.file = bitmap->storage.file;
	bitmap->storage.file = NULL;

	if (store.sb_page && bitmap->storage.sb_page)
		memcpy(page_address(store.sb_page),
		       page_address(bitmap->storage.sb_page),
2126
		       PAGE_SIZE);
2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142
	bitmap_file_unmap(&bitmap->storage);
	bitmap->storage = store;

	old_counts = bitmap->counts;
	bitmap->counts.bp = new_bp;
	bitmap->counts.pages = pages;
	bitmap->counts.missing_pages = pages;
	bitmap->counts.chunkshift = chunkshift;
	bitmap->counts.chunks = chunks;
	bitmap->mddev->bitmap_info.chunksize = 1 << (chunkshift +
						     BITMAP_BLOCK_SHIFT);

	blocks = min(old_counts.chunks << old_counts.chunkshift,
		     chunks << chunkshift);

	spin_lock_irq(&bitmap->counts.lock);
2143 2144 2145 2146 2147 2148 2149 2150 2151 2152
	/* For cluster raid, need to pre-allocate bitmap */
	if (mddev_is_clustered(bitmap->mddev)) {
		unsigned long page;
		for (page = 0; page < pages; page++) {
			ret = bitmap_checkpage(&bitmap->counts, page, 1, 1);
			if (ret) {
				unsigned long k;

				/* deallocate the page memory */
				for (k = 0; k < page; k++) {
2153
					kfree(new_bp[k].map);
2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164
				}

				/* restore some fields from old_counts */
				bitmap->counts.bp = old_counts.bp;
				bitmap->counts.pages = old_counts.pages;
				bitmap->counts.missing_pages = old_counts.pages;
				bitmap->counts.chunkshift = old_counts.chunkshift;
				bitmap->counts.chunks = old_counts.chunks;
				bitmap->mddev->bitmap_info.chunksize = 1 << (old_counts.chunkshift +
									     BITMAP_BLOCK_SHIFT);
				blocks = old_counts.chunks << old_counts.chunkshift;
2165
				pr_warn("Could not pre-allocate in-memory bitmap for cluster raid\n");
2166 2167 2168 2169 2170 2171
				break;
			} else
				bitmap->counts.bp[page].count += 1;
		}
	}

2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239
	for (block = 0; block < blocks; ) {
		bitmap_counter_t *bmc_old, *bmc_new;
		int set;

		bmc_old = bitmap_get_counter(&old_counts, block,
					     &old_blocks, 0);
		set = bmc_old && NEEDED(*bmc_old);

		if (set) {
			bmc_new = bitmap_get_counter(&bitmap->counts, block,
						     &new_blocks, 1);
			if (*bmc_new == 0) {
				/* need to set on-disk bits too. */
				sector_t end = block + new_blocks;
				sector_t start = block >> chunkshift;
				start <<= chunkshift;
				while (start < end) {
					bitmap_file_set_bit(bitmap, block);
					start += 1 << chunkshift;
				}
				*bmc_new = 2;
				bitmap_count_page(&bitmap->counts,
						  block, 1);
				bitmap_set_pending(&bitmap->counts,
						   block);
			}
			*bmc_new |= NEEDED_MASK;
			if (new_blocks < old_blocks)
				old_blocks = new_blocks;
		}
		block += old_blocks;
	}

	if (!init) {
		int i;
		while (block < (chunks << chunkshift)) {
			bitmap_counter_t *bmc;
			bmc = bitmap_get_counter(&bitmap->counts, block,
						 &new_blocks, 1);
			if (bmc) {
				/* new space.  It needs to be resynced, so
				 * we set NEEDED_MASK.
				 */
				if (*bmc == 0) {
					*bmc = NEEDED_MASK | 2;
					bitmap_count_page(&bitmap->counts,
							  block, 1);
					bitmap_set_pending(&bitmap->counts,
							   block);
				}
			}
			block += new_blocks;
		}
		for (i = 0; i < bitmap->storage.file_pages; i++)
			set_page_attr(bitmap, i, BITMAP_PAGE_DIRTY);
	}
	spin_unlock_irq(&bitmap->counts.lock);

	if (!init) {
		bitmap_unplug(bitmap);
		bitmap->mddev->pers->quiesce(bitmap->mddev, 0);
	}
	ret = 0;
err:
	return ret;
}
EXPORT_SYMBOL_GPL(bitmap_resize);

2240
static ssize_t
2241
location_show(struct mddev *mddev, char *page)
2242 2243
{
	ssize_t len;
2244
	if (mddev->bitmap_info.file)
2245
		len = sprintf(page, "file");
2246
	else if (mddev->bitmap_info.offset)
2247
		len = sprintf(page, "%+lld", (long long)mddev->bitmap_info.offset);
2248
	else
2249 2250 2251 2252 2253 2254
		len = sprintf(page, "none");
	len += sprintf(page+len, "\n");
	return len;
}

static ssize_t
2255
location_store(struct mddev *mddev, const char *buf, size_t len)
2256
{
2257
	int rv;
2258

2259 2260 2261
	rv = mddev_lock(mddev);
	if (rv)
		return rv;
2262
	if (mddev->pers) {
2263 2264 2265 2266 2267 2268 2269 2270
		if (!mddev->pers->quiesce) {
			rv = -EBUSY;
			goto out;
		}
		if (mddev->recovery || mddev->sync_thread) {
			rv = -EBUSY;
			goto out;
		}
2271 2272 2273 2274 2275
	}

	if (mddev->bitmap || mddev->bitmap_info.file ||
	    mddev->bitmap_info.offset) {
		/* bitmap already configured.  Only option is to clear it */
2276 2277 2278 2279
		if (strncmp(buf, "none", 4) != 0) {
			rv = -EBUSY;
			goto out;
		}
2280 2281 2282 2283 2284 2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297
		if (mddev->pers) {
			mddev->pers->quiesce(mddev, 1);
			bitmap_destroy(mddev);
			mddev->pers->quiesce(mddev, 0);
		}
		mddev->bitmap_info.offset = 0;
		if (mddev->bitmap_info.file) {
			struct file *f = mddev->bitmap_info.file;
			mddev->bitmap_info.file = NULL;
			fput(f);
		}
	} else {
		/* No bitmap, OK to set a location */
		long long offset;
		if (strncmp(buf, "none", 4) == 0)
			/* nothing to be done */;
		else if (strncmp(buf, "file:", 5) == 0) {
			/* Not supported yet */
2298 2299
			rv = -EINVAL;
			goto out;
2300 2301
		} else {
			if (buf[0] == '+')
2302
				rv = kstrtoll(buf+1, 10, &offset);
2303
			else
2304
				rv = kstrtoll(buf, 10, &offset);
2305
			if (rv)
2306 2307 2308 2309 2310
				goto out;
			if (offset == 0) {
				rv = -EINVAL;
				goto out;
			}
2311 2312
			if (mddev->bitmap_info.external == 0 &&
			    mddev->major_version == 0 &&
2313 2314 2315 2316
			    offset != mddev->bitmap_info.default_offset) {
				rv = -EINVAL;
				goto out;
			}
2317 2318
			mddev->bitmap_info.offset = offset;
			if (mddev->pers) {
2319
				struct bitmap *bitmap;
2320
				mddev->pers->quiesce(mddev, 1);
2321 2322 2323 2324 2325
				bitmap = bitmap_create(mddev, -1);
				if (IS_ERR(bitmap))
					rv = PTR_ERR(bitmap);
				else {
					mddev->bitmap = bitmap;
2326
					rv = bitmap_load(mddev);
2327
					if (rv)
2328
						mddev->bitmap_info.offset = 0;
2329 2330
				}
				mddev->pers->quiesce(mddev, 0);
2331 2332
				if (rv) {
					bitmap_destroy(mddev);
2333
					goto out;
2334
				}
2335 2336 2337 2338 2339 2340 2341
			}
		}
	}
	if (!mddev->external) {
		/* Ensure new bitmap info is stored in
		 * metadata promptly.
		 */
2342
		set_bit(MD_SB_CHANGE_DEVS, &mddev->sb_flags);
2343 2344
		md_wakeup_thread(mddev->thread);
	}
2345 2346 2347 2348 2349
	rv = 0;
out:
	mddev_unlock(mddev);
	if (rv)
		return rv;
2350 2351 2352 2353 2354 2355
	return len;
}

static struct md_sysfs_entry bitmap_location =
__ATTR(location, S_IRUGO|S_IWUSR, location_show, location_store);

2356 2357 2358 2359 2360 2361 2362 2363 2364 2365 2366 2367 2368 2369 2370 2371 2372 2373 2374 2375 2376 2377 2378 2379
/* 'bitmap/space' is the space available at 'location' for the
 * bitmap.  This allows the kernel to know when it is safe to
 * resize the bitmap to match a resized array.
 */
static ssize_t
space_show(struct mddev *mddev, char *page)
{
	return sprintf(page, "%lu\n", mddev->bitmap_info.space);
}

static ssize_t
space_store(struct mddev *mddev, const char *buf, size_t len)
{
	unsigned long sectors;
	int rv;

	rv = kstrtoul(buf, 10, &sectors);
	if (rv)
		return rv;

	if (sectors == 0)
		return -EINVAL;

	if (mddev->bitmap &&
2380
	    sectors < (mddev->bitmap->storage.bytes + 511) >> 9)
2381 2382 2383 2384 2385 2386 2387 2388 2389 2390 2391 2392
		return -EFBIG; /* Bitmap is too big for this small space */

	/* could make sure it isn't too big, but that isn't really
	 * needed - user-space should be careful.
	 */
	mddev->bitmap_info.space = sectors;
	return len;
}

static struct md_sysfs_entry bitmap_space =
__ATTR(space, S_IRUGO|S_IWUSR, space_show, space_store);

2393
static ssize_t
2394
timeout_show(struct mddev *mddev, char *page)
2395 2396 2397 2398
{
	ssize_t len;
	unsigned long secs = mddev->bitmap_info.daemon_sleep / HZ;
	unsigned long jifs = mddev->bitmap_info.daemon_sleep % HZ;
2399

2400 2401 2402 2403 2404 2405 2406 2407
	len = sprintf(page, "%lu", secs);
	if (jifs)
		len += sprintf(page+len, ".%03u", jiffies_to_msecs(jifs));
	len += sprintf(page+len, "\n");
	return len;
}

static ssize_t
2408
timeout_store(struct mddev *mddev, const char *buf, size_t len)
2409 2410 2411 2412 2413 2414 2415 2416 2417 2418 2419 2420 2421 2422 2423 2424 2425 2426 2427 2428 2429 2430 2431 2432 2433 2434 2435 2436 2437 2438 2439 2440 2441 2442 2443
{
	/* timeout can be set at any time */
	unsigned long timeout;
	int rv = strict_strtoul_scaled(buf, &timeout, 4);
	if (rv)
		return rv;

	/* just to make sure we don't overflow... */
	if (timeout >= LONG_MAX / HZ)
		return -EINVAL;

	timeout = timeout * HZ / 10000;

	if (timeout >= MAX_SCHEDULE_TIMEOUT)
		timeout = MAX_SCHEDULE_TIMEOUT-1;
	if (timeout < 1)
		timeout = 1;
	mddev->bitmap_info.daemon_sleep = timeout;
	if (mddev->thread) {
		/* if thread->timeout is MAX_SCHEDULE_TIMEOUT, then
		 * the bitmap is all clean and we don't need to
		 * adjust the timeout right now
		 */
		if (mddev->thread->timeout < MAX_SCHEDULE_TIMEOUT) {
			mddev->thread->timeout = timeout;
			md_wakeup_thread(mddev->thread);
		}
	}
	return len;
}

static struct md_sysfs_entry bitmap_timeout =
__ATTR(time_base, S_IRUGO|S_IWUSR, timeout_show, timeout_store);

static ssize_t
2444
backlog_show(struct mddev *mddev, char *page)
2445 2446 2447 2448 2449
{
	return sprintf(page, "%lu\n", mddev->bitmap_info.max_write_behind);
}

static ssize_t
2450
backlog_store(struct mddev *mddev, const char *buf, size_t len)
2451 2452
{
	unsigned long backlog;
2453
	int rv = kstrtoul(buf, 10, &backlog);
2454 2455 2456 2457 2458 2459 2460 2461 2462 2463 2464 2465
	if (rv)
		return rv;
	if (backlog > COUNTER_MAX)
		return -EINVAL;
	mddev->bitmap_info.max_write_behind = backlog;
	return len;
}

static struct md_sysfs_entry bitmap_backlog =
__ATTR(backlog, S_IRUGO|S_IWUSR, backlog_show, backlog_store);

static ssize_t
2466
chunksize_show(struct mddev *mddev, char *page)
2467 2468 2469 2470 2471
{
	return sprintf(page, "%lu\n", mddev->bitmap_info.chunksize);
}

static ssize_t
2472
chunksize_store(struct mddev *mddev, const char *buf, size_t len)
2473 2474 2475 2476 2477 2478
{
	/* Can only be changed when no bitmap is active */
	int rv;
	unsigned long csize;
	if (mddev->bitmap)
		return -EBUSY;
2479
	rv = kstrtoul(buf, 10, &csize);
2480 2481 2482 2483 2484 2485 2486 2487 2488 2489 2490 2491
	if (rv)
		return rv;
	if (csize < 512 ||
	    !is_power_of_2(csize))
		return -EINVAL;
	mddev->bitmap_info.chunksize = csize;
	return len;
}

static struct md_sysfs_entry bitmap_chunksize =
__ATTR(chunksize, S_IRUGO|S_IWUSR, chunksize_show, chunksize_store);

2492
static ssize_t metadata_show(struct mddev *mddev, char *page)
2493
{
G
Goldwyn Rodrigues 已提交
2494 2495
	if (mddev_is_clustered(mddev))
		return sprintf(page, "clustered\n");
2496 2497 2498 2499
	return sprintf(page, "%s\n", (mddev->bitmap_info.external
				      ? "external" : "internal"));
}

2500
static ssize_t metadata_store(struct mddev *mddev, const char *buf, size_t len)
2501 2502 2503 2504 2505 2506 2507
{
	if (mddev->bitmap ||
	    mddev->bitmap_info.file ||
	    mddev->bitmap_info.offset)
		return -EBUSY;
	if (strncmp(buf, "external", 8) == 0)
		mddev->bitmap_info.external = 1;
G
Goldwyn Rodrigues 已提交
2508 2509
	else if ((strncmp(buf, "internal", 8) == 0) ||
			(strncmp(buf, "clustered", 9) == 0))
2510 2511 2512 2513 2514 2515 2516 2517 2518
		mddev->bitmap_info.external = 0;
	else
		return -EINVAL;
	return len;
}

static struct md_sysfs_entry bitmap_metadata =
__ATTR(metadata, S_IRUGO|S_IWUSR, metadata_show, metadata_store);

2519
static ssize_t can_clear_show(struct mddev *mddev, char *page)
2520 2521
{
	int len;
2522
	spin_lock(&mddev->lock);
2523 2524 2525 2526 2527
	if (mddev->bitmap)
		len = sprintf(page, "%s\n", (mddev->bitmap->need_sync ?
					     "false" : "true"));
	else
		len = sprintf(page, "\n");
2528
	spin_unlock(&mddev->lock);
2529 2530 2531
	return len;
}

2532
static ssize_t can_clear_store(struct mddev *mddev, const char *buf, size_t len)
2533 2534 2535 2536 2537 2538 2539 2540 2541 2542 2543 2544 2545 2546 2547 2548 2549
{
	if (mddev->bitmap == NULL)
		return -ENOENT;
	if (strncmp(buf, "false", 5) == 0)
		mddev->bitmap->need_sync = 1;
	else if (strncmp(buf, "true", 4) == 0) {
		if (mddev->degraded)
			return -EBUSY;
		mddev->bitmap->need_sync = 0;
	} else
		return -EINVAL;
	return len;
}

static struct md_sysfs_entry bitmap_can_clear =
__ATTR(can_clear, S_IRUGO|S_IWUSR, can_clear_show, can_clear_store);

2550
static ssize_t
2551
behind_writes_used_show(struct mddev *mddev, char *page)
2552
{
2553 2554
	ssize_t ret;
	spin_lock(&mddev->lock);
2555
	if (mddev->bitmap == NULL)
2556 2557 2558 2559 2560 2561
		ret = sprintf(page, "0\n");
	else
		ret = sprintf(page, "%lu\n",
			      mddev->bitmap->behind_writes_used);
	spin_unlock(&mddev->lock);
	return ret;
2562 2563 2564
}

static ssize_t
2565
behind_writes_used_reset(struct mddev *mddev, const char *buf, size_t len)
2566 2567 2568 2569 2570 2571 2572 2573 2574 2575
{
	if (mddev->bitmap)
		mddev->bitmap->behind_writes_used = 0;
	return len;
}

static struct md_sysfs_entry max_backlog_used =
__ATTR(max_backlog_used, S_IRUGO | S_IWUSR,
       behind_writes_used_show, behind_writes_used_reset);

2576 2577
static struct attribute *md_bitmap_attrs[] = {
	&bitmap_location.attr,
2578
	&bitmap_space.attr,
2579 2580 2581
	&bitmap_timeout.attr,
	&bitmap_backlog.attr,
	&bitmap_chunksize.attr,
2582 2583
	&bitmap_metadata.attr,
	&bitmap_can_clear.attr,
2584
	&max_backlog_used.attr,
2585 2586 2587 2588 2589 2590 2591
	NULL
};
struct attribute_group md_bitmap_group = {
	.name = "bitmap",
	.attrs = md_bitmap_attrs,
};