bitmap.c 55.6 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 "md.h"
31
#include "bitmap.h"
32

33
static inline char *bmname(struct bitmap *bitmap)
34 35 36 37 38 39 40 41 42 43 44 45 46 47
{
	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
 */
48 49
static int bitmap_checkpage(struct bitmap *bitmap,
			    unsigned long page, int create)
50 51
__releases(bitmap->lock)
__acquires(bitmap->lock)
52 53 54 55
{
	unsigned char *mappage;

	if (page >= bitmap->pages) {
56 57 58 59
		/* This can happen if bitmap_start_sync goes beyond
		 * End-of-device while looking for a whole page.
		 * It is harmless.
		 */
60 61 62 63 64 65 66 67 68 69 70 71 72 73
		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 */

74
	spin_unlock_irq(&bitmap->lock);
75
	mappage = kzalloc(PAGE_SIZE, GFP_NOIO);
76 77 78
	spin_lock_irq(&bitmap->lock);

	if (mappage == NULL) {
79 80
		pr_debug("%s: bitmap map page allocation failed, hijacking\n",
			 bmname(bitmap));
81 82 83 84
		/* 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;
85 86
	} else if (bitmap->bp[page].map ||
		   bitmap->bp[page].hijacked) {
87
		/* somebody beat us to getting the page */
88
		kfree(mappage);
89
		return 0;
90
	} else {
91

92
		/* no page was in place and we have one, so install it */
93

94 95 96
		bitmap->bp[page].map = mappage;
		bitmap->missing_pages--;
	}
97 98 99 100 101 102
	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 */
103
static void bitmap_checkfree(struct bitmap *bitmap, unsigned long page)
104 105 106 107 108 109 110 111 112 113 114
{
	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;
115 116 117 118 119
	} else {
		/* normal case, free the page */
		ptr = bitmap->bp[page].map;
		bitmap->bp[page].map = NULL;
		bitmap->missing_pages++;
120
		kfree(ptr);
121 122 123 124 125 126 127 128 129 130 131
	}
}

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

/*
 * basic page I/O operations
 */

132
/* IO operations when bitmap is stored near all superblocks */
133 134 135
static int read_sb_page(struct mddev *mddev, loff_t offset,
			struct page *page,
			unsigned long index, int size)
136 137 138
{
	/* choose a good rdev and read the page from there */

139
	struct md_rdev *rdev;
140 141
	sector_t target;

N
NeilBrown 已提交
142
	rdev_for_each(rdev, mddev) {
143 144
		if (! test_bit(In_sync, &rdev->flags)
		    || test_bit(Faulty, &rdev->flags))
145 146
			continue;

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

149
		if (sync_page_io(rdev, target,
150
				 roundup(size, bdev_logical_block_size(rdev->bdev)),
J
Jonathan Brassow 已提交
151
				 page, READ, true)) {
152
			page->index = index;
153
			return 0;
154 155
		}
	}
156
	return -EIO;
157 158
}

159
static struct md_rdev *next_active_rdev(struct md_rdev *rdev, struct mddev *mddev)
160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179
{
	/* 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
	 * list_for_each_continue_rcu.
	 */
	struct list_head *pos;
	rcu_read_lock();
	if (rdev == NULL)
		/* start at the beginning */
		pos = &mddev->disks;
	else {
		/* release the previous rdev and start from there. */
		rdev_dec_pending(rdev, mddev);
		pos = &rdev->same_set;
	}
	list_for_each_continue_rcu(pos, &mddev->disks) {
180
		rdev = list_entry(pos, struct md_rdev, same_set);
181 182 183 184 185 186 187 188 189 190 191 192
		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;
}

193
static int write_sb_page(struct bitmap *bitmap, struct page *page, int wait)
194
{
195
	struct md_rdev *rdev = NULL;
196
	struct block_device *bdev;
197
	struct mddev *mddev = bitmap->mddev;
198
	struct bitmap_storage *store = &bitmap->storage;
199

200
	while ((rdev = next_active_rdev(rdev, mddev)) != NULL) {
201 202
		int size = PAGE_SIZE;
		loff_t offset = mddev->bitmap_info.offset;
203 204 205

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

206 207 208 209 210
		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,
211
				       bdev_logical_block_size(bdev));
212
		}
213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252
		/* 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);
253
	}
254 255

	if (wait)
256
		md_super_wait(mddev);
257
	return 0;
258 259 260

 bad_alignment:
	return -EINVAL;
261 262
}

263
static void bitmap_file_kick(struct bitmap *bitmap);
264
/*
265
 * write out a page to a file
266
 */
267
static void write_page(struct bitmap *bitmap, struct page *page, int wait)
268
{
269
	struct buffer_head *bh;
270

271
	if (bitmap->storage.file == NULL) {
272 273
		switch (write_sb_page(bitmap, page, wait)) {
		case -EINVAL:
274
			set_bit(BITMAP_WRITE_ERROR, &bitmap->flags);
275
		}
276
	} else {
277

278
		bh = page_buffers(page);
279

280 281 282 283
		while (bh && bh->b_blocknr) {
			atomic_inc(&bitmap->pending_writes);
			set_buffer_locked(bh);
			set_buffer_mapped(bh);
J
Jens Axboe 已提交
284
			submit_bh(WRITE | REQ_SYNC, bh);
285 286
			bh = bh->b_this_page;
		}
287

288
		if (wait)
289 290
			wait_event(bitmap->write_wait,
				   atomic_read(&bitmap->pending_writes)==0);
291
	}
292
	if (test_bit(BITMAP_WRITE_ERROR, &bitmap->flags))
293
		bitmap_file_kick(bitmap);
294 295 296 297 298
}

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

300 301
	if (!uptodate)
		set_bit(BITMAP_WRITE_ERROR, &bitmap->flags);
302 303 304
	if (atomic_dec_and_test(&bitmap->pending_writes))
		wake_up(&bitmap->write_wait);
}
305

306 307 308 309 310 311 312 313 314 315
/* copied from buffer.c */
static void
__clear_page_buffers(struct page *page)
{
	ClearPagePrivate(page);
	set_page_private(page, 0);
	page_cache_release(page);
}
static void free_buffers(struct page *page)
{
316
	struct buffer_head *bh;
317

318 319 320 321
	if (!PagePrivate(page))
		return;

	bh = page_buffers(page);
322 323 324 325
	while (bh) {
		struct buffer_head *next = bh->b_this_page;
		free_buffer_head(bh);
		bh = next;
326
	}
327 328
	__clear_page_buffers(page);
	put_page(page);
329 330
}

331 332 333 334 335 336 337
/* 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.
 */
338 339 340 341
static int read_page(struct file *file, unsigned long index,
		     struct bitmap *bitmap,
		     unsigned long count,
		     struct page *page)
342
{
343
	int ret = 0;
J
Josef Sipek 已提交
344
	struct inode *inode = file->f_path.dentry->d_inode;
345 346
	struct buffer_head *bh;
	sector_t block;
347

348 349
	pr_debug("read bitmap file (%dB @ %llu)\n", (int)PAGE_SIZE,
		 (unsigned long long)index << PAGE_SHIFT);
350

351 352
	bh = alloc_page_buffers(page, 1<<inode->i_blkbits, 0);
	if (!bh) {
353
		ret = -ENOMEM;
354 355
		goto out;
	}
356 357 358 359 360 361 362 363 364
	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! */
365
				ret = -EINVAL;
366 367 368 369 370 371 372 373 374 375
				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;
376 377 378 379
			atomic_inc(&bitmap->pending_writes);
			set_buffer_locked(bh);
			set_buffer_mapped(bh);
			submit_bh(READ, bh);
380 381 382 383 384
		}
		block++;
		bh = bh->b_this_page;
	}
	page->index = index;
385 386 387

	wait_event(bitmap->write_wait,
		   atomic_read(&bitmap->pending_writes)==0);
388
	if (test_bit(BITMAP_WRITE_ERROR, &bitmap->flags))
389
		ret = -EIO;
390
out:
391 392
	if (ret)
		printk(KERN_ALERT "md: bitmap read error: (%dB @ %llu): %d\n",
393 394
			(int)PAGE_SIZE,
			(unsigned long long)index << PAGE_SHIFT,
395 396
			ret);
	return ret;
397 398 399 400 401 402 403
}

/*
 * bitmap file superblock operations
 */

/* update the event counter and sync the superblock to disk */
404
void bitmap_update_sb(struct bitmap *bitmap)
405 406 407 408
{
	bitmap_super_t *sb;

	if (!bitmap || !bitmap->mddev) /* no bitmap for this array */
409
		return;
410 411
	if (bitmap->mddev->bitmap_info.external)
		return;
412
	if (!bitmap->storage.sb_page) /* no superblock */
413
		return;
414
	sb = kmap_atomic(bitmap->storage.sb_page);
415
	sb->events = cpu_to_le64(bitmap->mddev->events);
416
	if (bitmap->mddev->events < bitmap->events_cleared)
417 418
		/* rocking back to read-only */
		bitmap->events_cleared = bitmap->mddev->events;
419 420
	sb->events_cleared = cpu_to_le64(bitmap->events_cleared);
	sb->state = cpu_to_le32(bitmap->flags);
421 422 423
	/* 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);
424
	kunmap_atomic(sb);
425
	write_page(bitmap, bitmap->storage.sb_page, 1);
426 427 428 429 430 431 432
}

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

433
	if (!bitmap || !bitmap->storage.sb_page)
434
		return;
435
	sb = kmap_atomic(bitmap->storage.sb_page);
436
	printk(KERN_DEBUG "%s: bitmap file superblock:\n", bmname(bitmap));
437 438 439
	printk(KERN_DEBUG "         magic: %08x\n", le32_to_cpu(sb->magic));
	printk(KERN_DEBUG "       version: %d\n", le32_to_cpu(sb->version));
	printk(KERN_DEBUG "          uuid: %08x.%08x.%08x.%08x\n",
440 441 442 443
					*(__u32 *)(sb->uuid+0),
					*(__u32 *)(sb->uuid+4),
					*(__u32 *)(sb->uuid+8),
					*(__u32 *)(sb->uuid+12));
444
	printk(KERN_DEBUG "        events: %llu\n",
445
			(unsigned long long) le64_to_cpu(sb->events));
446
	printk(KERN_DEBUG "events cleared: %llu\n",
447
			(unsigned long long) le64_to_cpu(sb->events_cleared));
448 449 450 451 452
	printk(KERN_DEBUG "         state: %08x\n", le32_to_cpu(sb->state));
	printk(KERN_DEBUG "     chunksize: %d B\n", le32_to_cpu(sb->chunksize));
	printk(KERN_DEBUG "  daemon sleep: %ds\n", le32_to_cpu(sb->daemon_sleep));
	printk(KERN_DEBUG "     sync size: %llu KB\n",
			(unsigned long long)le64_to_cpu(sb->sync_size)/2);
453
	printk(KERN_DEBUG "max write behind: %d\n", le32_to_cpu(sb->write_behind));
454
	kunmap_atomic(sb);
455 456
}

457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473
/*
 * 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;
	int err = -EINVAL;

474 475 476 477
	bitmap->storage.sb_page = alloc_page(GFP_KERNEL);
	if (IS_ERR(bitmap->storage.sb_page)) {
		err = PTR_ERR(bitmap->storage.sb_page);
		bitmap->storage.sb_page = NULL;
478 479
		return err;
	}
480
	bitmap->storage.sb_page->index = 0;
481

482
	sb = kmap_atomic(bitmap->storage.sb_page);
483 484 485 486 487 488 489

	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)) {
490
		kunmap_atomic(sb);
491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519
		printk(KERN_ERR "bitmap chunksize not a power of 2\n");
		return -EINVAL;
	}
	sb->chunksize = cpu_to_le32(chunksize);

	daemon_sleep = bitmap->mddev->bitmap_info.daemon_sleep;
	if (!daemon_sleep ||
	    (daemon_sleep < 1) || (daemon_sleep > MAX_SCHEDULE_TIMEOUT)) {
		printk(KERN_INFO "Choosing daemon_sleep default (5 sec)\n");
		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);

520
	set_bit(BITMAP_STALE, &bitmap->flags);
521
	sb->state = cpu_to_le32(bitmap->flags);
522 523 524
	bitmap->events_cleared = bitmap->mddev->events;
	sb->events_cleared = cpu_to_le64(bitmap->mddev->events);

525
	kunmap_atomic(sb);
526 527 528 529

	return 0;
}

530 531 532 533 534
/* 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;
535
	unsigned long chunksize, daemon_sleep, write_behind;
536 537
	unsigned long long events;
	int err = -EINVAL;
538
	struct page *sb_page;
539

540
	if (!bitmap->storage.file && !bitmap->mddev->bitmap_info.offset) {
541 542 543
		chunksize = 128 * 1024 * 1024;
		daemon_sleep = 5 * HZ;
		write_behind = 0;
544
		set_bit(BITMAP_STALE, &bitmap->flags);
545 546 547
		err = 0;
		goto out_no_sb;
	}
548
	/* page 0 is the superblock, read it... */
549 550 551
	sb_page = alloc_page(GFP_KERNEL);
	if (!sb_page)
		return -ENOMEM;
552
	bitmap->storage.sb_page = sb_page;
553

554 555
	if (bitmap->storage.file) {
		loff_t isize = i_size_read(bitmap->storage.file->f_mapping->host);
556 557
		int bytes = isize > PAGE_SIZE ? PAGE_SIZE : isize;

558
		err = read_page(bitmap->storage.file, 0,
559
				bitmap, bytes, sb_page);
560
	} else {
561 562 563 564
		err = read_sb_page(bitmap->mddev,
				   bitmap->mddev->bitmap_info.offset,
				   sb_page,
				   0, sizeof(bitmap_super_t));
565
	}
566
	if (err)
567 568
		return err;

569
	sb = kmap_atomic(sb_page);
570 571

	chunksize = le32_to_cpu(sb->chunksize);
572
	daemon_sleep = le32_to_cpu(sb->daemon_sleep) * HZ;
573
	write_behind = le32_to_cpu(sb->write_behind);
574 575 576 577

	/* verify that the bitmap-specific fields are valid */
	if (sb->magic != cpu_to_le32(BITMAP_MAGIC))
		reason = "bad magic";
578 579
	else if (le32_to_cpu(sb->version) < BITMAP_MAJOR_LO ||
		 le32_to_cpu(sb->version) > BITMAP_MAJOR_HI)
580
		reason = "unrecognized superblock version";
581
	else if (chunksize < 512)
582
		reason = "bitmap chunksize too small";
J
Jonathan Brassow 已提交
583
	else if (!is_power_of_2(chunksize))
584
		reason = "bitmap chunksize not a power of 2";
585
	else if (daemon_sleep < 1 || daemon_sleep > MAX_SCHEDULE_TIMEOUT)
586
		reason = "daemon sleep period out of range";
587 588
	else if (write_behind > COUNTER_MAX)
		reason = "write-behind limit out of range (0 - 16383)";
589 590 591 592 593 594 595 596 597
	if (reason) {
		printk(KERN_INFO "%s: invalid bitmap file superblock: %s\n",
			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);

598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615
	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)) {
			printk(KERN_INFO
			       "%s: bitmap superblock UUID mismatch\n",
			       bmname(bitmap));
			goto out;
		}
		events = le64_to_cpu(sb->events);
		if (events < bitmap->mddev->events) {
			printk(KERN_INFO
			       "%s: bitmap file is out of date (%llu < %llu) "
			       "-- forcing full recovery\n",
			       bmname(bitmap), events,
			       (unsigned long long) bitmap->mddev->events);
616
			set_bit(BITMAP_STALE, &bitmap->flags);
617
		}
618
	}
619

620
	/* assign fields using values from superblock */
621
	bitmap->flags |= le32_to_cpu(sb->state);
622
	if (le32_to_cpu(sb->version) == BITMAP_MAJOR_HOSTENDIAN)
623
		set_bit(BITMAP_HOSTENDIAN, &bitmap->flags);
624 625 626
	bitmap->events_cleared = le64_to_cpu(sb->events_cleared);
	err = 0;
out:
627
	kunmap_atomic(sb);
628
out_no_sb:
629
	if (test_bit(BITMAP_STALE, &bitmap->flags))
630 631 632 633
		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;
634 635 636 637 638 639 640 641 642
	if (err)
		bitmap_print_sb(bitmap);
	return err;
}

/*
 * general bitmap file operations
 */

643 644 645 646 647 648
/*
 * 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.
 */
649
/* calculate the index of the page that contains this bit */
650 651
static inline unsigned long file_page_index(struct bitmap_storage *store,
					    unsigned long chunk)
652
{
653
	if (store->sb_page)
654 655
		chunk += sizeof(bitmap_super_t) << 3;
	return chunk >> PAGE_BIT_SHIFT;
656 657 658
}

/* calculate the (bit) offset of this bit within a page */
659 660
static inline unsigned long file_page_offset(struct bitmap_storage *store,
					     unsigned long chunk)
661
{
662
	if (store->sb_page)
663 664
		chunk += sizeof(bitmap_super_t) << 3;
	return chunk & (PAGE_BITS - 1);
665 666 667 668 669 670 671 672 673
}

/*
 * return a pointer to the page in the filemap that contains the given bit
 *
 * this lookup is complicated by the fact that the bitmap sb might be exactly
 * 1 page (e.g., x86) or less than 1 page -- so the bitmap might start on page
 * 0 or page 1
 */
674
static inline struct page *filemap_get_page(struct bitmap_storage *store,
675
					    unsigned long chunk)
676
{
677
	if (file_page_index(store, chunk) >= store->file_pages)
678
		return NULL;
679 680
	return store->filemap[file_page_index(store, chunk)
			      - file_page_index(store, 0)];
681 682
}

683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734
static int bitmap_storage_alloc(struct bitmap_storage *store,
				unsigned long chunks, int with_super)
{
	int pnum;
	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);

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

	if (with_super && !store->sb_page) {
		store->sb_page = alloc_page(GFP_KERNEL);
		if (store->sb_page == NULL)
			return -ENOMEM;
		store->sb_page->index = 0;
	}
	pnum = 0;
	if (store->sb_page) {
		store->filemap[0] = store->sb_page;
		pnum = 1;
	}
	for ( ; pnum < num_pages; pnum++) {
		store->filemap[pnum] = alloc_page(GFP_KERNEL);
		if (!store->filemap[pnum]) {
			store->file_pages = pnum;
			return -ENOMEM;
		}
		store->filemap[pnum]->index = pnum;
	}
	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;
}

735 736 737 738 739
static void bitmap_file_unmap(struct bitmap *bitmap)
{
	struct page **map, *sb_page;
	unsigned long *attr;
	int pages;
740
	struct bitmap_storage *store = &bitmap->storage;
741

742
	spin_lock_irq(&bitmap->lock);
743 744 745 746 747 748 749 750
	map = store->filemap;
	store->filemap = NULL;
	attr = store->filemap_attr;
	store->filemap_attr = NULL;
	pages = store->file_pages;
	store->file_pages = 0;
	sb_page = store->sb_page;
	store->sb_page = NULL;
751
	spin_unlock_irq(&bitmap->lock);
752 753

	while (pages--)
754
		if (map[pages] != sb_page) /* 0 is sb_page, release it below */
755
			free_buffers(map[pages]);
756 757 758
	kfree(map);
	kfree(attr);

759 760
	if (sb_page)
		free_buffers(sb_page);
761 762 763 764 765 766
}

static void bitmap_file_put(struct bitmap *bitmap)
{
	struct file *file;

767
	spin_lock_irq(&bitmap->lock);
768 769
	file = bitmap->storage.file;
	bitmap->storage.file = NULL;
770
	spin_unlock_irq(&bitmap->lock);
771

772 773 774
	if (file)
		wait_event(bitmap->write_wait,
			   atomic_read(&bitmap->pending_writes)==0);
775 776
	bitmap_file_unmap(bitmap);

777
	if (file) {
J
Josef Sipek 已提交
778
		struct inode *inode = file->f_path.dentry->d_inode;
779
		invalidate_mapping_pages(inode->i_mapping, 0, -1);
780
		fput(file);
781
	}
782 783 784 785 786 787 788 789 790 791 792
}

/*
 * 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;

793
	if (!test_and_set_bit(BITMAP_STALE, &bitmap->flags)) {
794
		bitmap_update_sb(bitmap);
795

796
		if (bitmap->storage.file) {
797 798
			path = kmalloc(PAGE_SIZE, GFP_KERNEL);
			if (path)
799 800
				ptr = d_path(&bitmap->storage.file->f_path,
					     path, PAGE_SIZE);
C
Christoph Hellwig 已提交
801

802 803
			printk(KERN_ALERT
			      "%s: kicking failed bitmap file %s from array!\n",
C
Christoph Hellwig 已提交
804
			      bmname(bitmap), IS_ERR(ptr) ? "" : ptr);
805

806 807 808 809 810
			kfree(path);
		} else
			printk(KERN_ALERT
			       "%s: disabling internal bitmap due to errors\n",
			       bmname(bitmap));
811
	}
812 813 814 815 816 817 818

	bitmap_file_put(bitmap);

	return;
}

enum bitmap_page_attr {
819
	BITMAP_PAGE_DIRTY = 0,     /* there are set bits that need to be synced */
820 821
	BITMAP_PAGE_PENDING = 1,   /* there are bits that are being cleaned.
				    * i.e. counter is 1 or 2. */
822
	BITMAP_PAGE_NEEDWRITE = 2, /* there are cleared bits that need to be synced */
823 824
};

825 826
static inline void set_page_attr(struct bitmap *bitmap, int pnum,
				 enum bitmap_page_attr attr)
827
{
828
	__set_bit((pnum<<2) + attr, bitmap->storage.filemap_attr);
829 830
}

831 832
static inline void clear_page_attr(struct bitmap *bitmap, int pnum,
				   enum bitmap_page_attr attr)
833
{
834
	__clear_bit((pnum<<2) + attr, bitmap->storage.filemap_attr);
835 836
}

837
static inline unsigned long test_page_attr(struct bitmap *bitmap, int pnum,
838
					   enum bitmap_page_attr attr)
839
{
840
	return test_bit((pnum<<2) + attr, bitmap->storage.filemap_attr);
841 842 843 844 845 846 847 848 849 850 851 852
}

/*
 * 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;
853
	struct page *page;
854
	void *kaddr;
855
	unsigned long chunk = block >> bitmap->chunkshift;
856

857
	page = filemap_get_page(&bitmap->storage, chunk);
858 859
	if (!page)
		return;
860
	bit = file_page_offset(&bitmap->storage, chunk);
861

862
	/* set the bit */
863
	kaddr = kmap_atomic(page);
864
	if (test_bit(BITMAP_HOSTENDIAN, &bitmap->flags))
865 866 867
		set_bit(bit, kaddr);
	else
		__set_bit_le(bit, kaddr);
868
	kunmap_atomic(kaddr);
869
	pr_debug("set file bit %lu page %lu\n", bit, page->index);
870
	/* record page number so it gets flushed to disk when unplug occurs */
871
	set_page_attr(bitmap, page->index, BITMAP_PAGE_DIRTY);
872 873
}

874 875 876 877 878 879 880
static void bitmap_file_clear_bit(struct bitmap *bitmap, sector_t block)
{
	unsigned long bit;
	struct page *page;
	void *paddr;
	unsigned long chunk = block >> bitmap->chunkshift;

881
	page = filemap_get_page(&bitmap->storage, chunk);
882 883
	if (!page)
		return;
884
	bit = file_page_offset(&bitmap->storage, chunk);
885
	paddr = kmap_atomic(page);
886
	if (test_bit(BITMAP_HOSTENDIAN, &bitmap->flags))
887 888 889 890
		clear_bit(bit, paddr);
	else
		__clear_bit_le(bit, paddr);
	kunmap_atomic(paddr);
891 892
	if (!test_page_attr(bitmap, page->index, BITMAP_PAGE_NEEDWRITE)) {
		set_page_attr(bitmap, page->index, BITMAP_PAGE_PENDING);
893 894 895 896
		bitmap->allclean = 0;
	}
}

897 898 899
/* 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 */
900
void bitmap_unplug(struct bitmap *bitmap)
901
{
902
	unsigned long i;
903
	int dirty, need_write;
904 905
	int wait = 0;

906
	if (!bitmap || !bitmap->storage.filemap)
907
		return;
908 909 910

	/* look at each page to see if there are any set bits that need to be
	 * flushed out to disk */
911
	for (i = 0; i < bitmap->storage.file_pages; i++) {
912
		spin_lock_irq(&bitmap->lock);
913
		if (!bitmap->storage.filemap) {
914
			spin_unlock_irq(&bitmap->lock);
915
			return;
916
		}
917 918 919 920
		dirty = test_page_attr(bitmap, i, BITMAP_PAGE_DIRTY);
		need_write = test_page_attr(bitmap, i, BITMAP_PAGE_NEEDWRITE);
		clear_page_attr(bitmap, i, BITMAP_PAGE_DIRTY);
		clear_page_attr(bitmap, i, BITMAP_PAGE_NEEDWRITE);
921
		if (dirty || need_write)
922
			clear_page_attr(bitmap, i, BITMAP_PAGE_PENDING);
923
		if (dirty)
924
			wait = 1;
925
		spin_unlock_irq(&bitmap->lock);
926

927
		if (dirty || need_write)
928
			write_page(bitmap, bitmap->storage.filemap[i], 0);
929 930
	}
	if (wait) { /* if any writes were performed, we need to wait on them */
931
		if (bitmap->storage.file)
932 933
			wait_event(bitmap->write_wait,
				   atomic_read(&bitmap->pending_writes)==0);
934
		else
935
			md_super_wait(bitmap->mddev);
936
	}
937
	if (test_bit(BITMAP_WRITE_ERROR, &bitmap->flags))
938
		bitmap_file_kick(bitmap);
939
}
940
EXPORT_SYMBOL(bitmap_unplug);
941

942
static void bitmap_set_memory_bits(struct bitmap *bitmap, sector_t offset, int needed);
943 944 945 946 947 948 949
/* * 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.
950 951 952
 *
 * We ignore all bits for sectors that end earlier than 'start'.
 * This is used when reading an out-of-date bitmap...
953
 */
954
static int bitmap_init_from_disk(struct bitmap *bitmap, sector_t start)
955 956
{
	unsigned long i, chunks, index, oldindex, bit;
957
	struct page *page = NULL;
958
	unsigned long bit_cnt = 0;
959
	struct file *file;
960
	unsigned long offset;
961 962
	int outofdate;
	int ret = -ENOSPC;
963
	void *paddr;
964
	struct bitmap_storage *store = &bitmap->storage;
965 966

	chunks = bitmap->chunks;
967
	file = store->file;
968

969 970
	if (!file && !bitmap->mddev->bitmap_info.offset) {
		/* No permanent bitmap - fill with '1s'. */
971 972
		store->filemap = NULL;
		store->file_pages = 0;
973 974 975 976 977 978 979 980 981 982
		for (i = 0; i < chunks ; i++) {
			/* if the disk bit is set, set the memory bit */
			int needed = ((sector_t)(i+1) << (bitmap->chunkshift)
				      >= start);
			bitmap_set_memory_bits(bitmap,
					       (sector_t)i << bitmap->chunkshift,
					       needed);
		}
		return 0;
	}
983

984
	outofdate = test_bit(BITMAP_STALE, &bitmap->flags);
985 986 987 988
	if (outofdate)
		printk(KERN_INFO "%s: bitmap file is out of date, doing full "
			"recovery\n", bmname(bitmap));

989
	if (file && i_size_read(file->f_mapping->host) < store->bytes) {
990
		printk(KERN_INFO "%s: bitmap file too short %lu < %lu\n",
991 992 993
		       bmname(bitmap),
		       (unsigned long) i_size_read(file->f_mapping->host),
		       store->bytes);
994
		goto err;
995
	}
996

997
	oldindex = ~0L;
998
	offset = 0;
999
	if (!bitmap->mddev->bitmap_info.external)
1000
		offset = sizeof(bitmap_super_t);
1001 1002

	for (i = 0; i < chunks; i++) {
1003
		int b;
1004 1005
		index = file_page_index(&bitmap->storage, i);
		bit = file_page_offset(&bitmap->storage, i);
1006
		if (index != oldindex) { /* this is a new page, read it in */
1007
			int count;
1008
			/* unmap the old page, we're done with it */
1009 1010
			if (index == store->file_pages-1)
				count = store->bytes - index * PAGE_SIZE;
1011 1012
			else
				count = PAGE_SIZE;
1013
			page = store->filemap[index];
1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024
			if (file)
				ret = read_page(file, index, bitmap,
						count, page);
			else
				ret = read_sb_page(
					bitmap->mddev,
					bitmap->mddev->bitmap_info.offset,
					page,
					index, count);

			if (ret)
1025
				goto err;
1026

1027 1028 1029 1030 1031
			oldindex = index;

			if (outofdate) {
				/*
				 * if bitmap is out of date, dirty the
1032
				 * whole page and write it out
1033
				 */
1034
				paddr = kmap_atomic(page);
1035
				memset(paddr + offset, 0xff,
1036
				       PAGE_SIZE - offset);
1037
				kunmap_atomic(paddr);
1038 1039 1040
				write_page(bitmap, page, 1);

				ret = -EIO;
1041 1042
				if (test_bit(BITMAP_WRITE_ERROR,
					     &bitmap->flags))
1043
					goto err;
1044 1045
			}
		}
1046
		paddr = kmap_atomic(page);
1047
		if (test_bit(BITMAP_HOSTENDIAN, &bitmap->flags))
1048
			b = test_bit(bit, paddr);
1049
		else
A
Akinobu Mita 已提交
1050
			b = test_bit_le(bit, paddr);
1051
		kunmap_atomic(paddr);
1052
		if (b) {
1053
			/* if the disk bit is set, set the memory bit */
1054
			int needed = ((sector_t)(i+1) << bitmap->chunkshift
1055 1056
				      >= start);
			bitmap_set_memory_bits(bitmap,
1057
					       (sector_t)i << bitmap->chunkshift,
1058
					       needed);
1059 1060
			bit_cnt++;
		}
1061
		offset = 0;
1062 1063 1064
	}

	printk(KERN_INFO "%s: bitmap initialized from disk: "
1065
	       "read %lu pages, set %lu of %lu bits\n",
1066
	       bmname(bitmap), store->file_pages,
1067
	       bit_cnt, chunks);
1068 1069

	return 0;
1070

1071 1072 1073
 err:
	printk(KERN_INFO "%s: bitmap initialisation failed: %d\n",
	       bmname(bitmap), ret);
1074 1075 1076
	return ret;
}

1077 1078 1079 1080 1081
void bitmap_write_all(struct bitmap *bitmap)
{
	/* We don't actually write all bitmap blocks here,
	 * just flag them as needing to be written
	 */
1082
	int i;
1083

1084
	if (!bitmap || !bitmap->storage.filemap)
1085
		return;
1086
	if (bitmap->storage.file)
1087 1088 1089
		/* Only one copy, so nothing needed */
		return;

1090
	spin_lock_irq(&bitmap->lock);
1091
	for (i = 0; i < bitmap->storage.file_pages; i++)
1092
		set_page_attr(bitmap, i,
1093
			      BITMAP_PAGE_NEEDWRITE);
1094
	bitmap->allclean = 0;
1095
	spin_unlock_irq(&bitmap->lock);
1096 1097
}

1098 1099
static void bitmap_count_page(struct bitmap *bitmap, sector_t offset, int inc)
{
1100
	sector_t chunk = offset >> bitmap->chunkshift;
1101 1102 1103 1104
	unsigned long page = chunk >> PAGE_COUNTER_SHIFT;
	bitmap->bp[page].count += inc;
	bitmap_checkfree(bitmap, page);
}
1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115

static void bitmap_set_pending(struct bitmap *bitmap, sector_t offset)
{
	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;
}

1116
static bitmap_counter_t *bitmap_get_counter(struct bitmap *bitmap,
N
NeilBrown 已提交
1117
					    sector_t offset, sector_t *blocks,
1118 1119 1120 1121 1122 1123 1124
					    int create);

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

1125
void bitmap_daemon_work(struct mddev *mddev)
1126
{
1127
	struct bitmap *bitmap;
1128
	unsigned long j;
1129
	unsigned long nextpage;
N
NeilBrown 已提交
1130
	sector_t blocks;
1131

1132 1133 1134
	/* Use a mutex to guard daemon_work against
	 * bitmap_destroy.
	 */
1135
	mutex_lock(&mddev->bitmap_info.mutex);
1136 1137
	bitmap = mddev->bitmap;
	if (bitmap == NULL) {
1138
		mutex_unlock(&mddev->bitmap_info.mutex);
1139
		return;
1140
	}
1141
	if (time_before(jiffies, bitmap->daemon_lastrun
N
NeilBrown 已提交
1142
			+ mddev->bitmap_info.daemon_sleep))
1143 1144
		goto done;

1145
	bitmap->daemon_lastrun = jiffies;
1146
	if (bitmap->allclean) {
N
NeilBrown 已提交
1147
		mddev->thread->timeout = MAX_SCHEDULE_TIMEOUT;
1148
		goto done;
1149 1150
	}
	bitmap->allclean = 1;
1151

1152 1153 1154 1155
	/* 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.
	 */
1156
	spin_lock_irq(&bitmap->lock);
1157
	for (j = 0; j < bitmap->storage.file_pages; j++)
1158
		if (test_page_attr(bitmap, j,
1159
				   BITMAP_PAGE_PENDING)) {
1160
			set_page_attr(bitmap, j,
1161
				      BITMAP_PAGE_NEEDWRITE);
1162
			clear_page_attr(bitmap, j,
1163 1164 1165 1166 1167 1168 1169 1170 1171
					BITMAP_PAGE_PENDING);
		}

	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;
1172 1173
		if (bitmap->storage.filemap) {
			sb = kmap_atomic(bitmap->storage.sb_page);
1174 1175 1176
			sb->events_cleared =
				cpu_to_le64(bitmap->events_cleared);
			kunmap_atomic(sb);
1177
			set_page_attr(bitmap, 0,
1178 1179
				      BITMAP_PAGE_NEEDWRITE);
		}
1180 1181 1182 1183 1184
	}
	/* Now look at the bitmap counters and if any are '2' or '1',
	 * decrement and handle accordingly.
	 */
	nextpage = 0;
1185 1186
	for (j = 0; j < bitmap->chunks; j++) {
		bitmap_counter_t *bmc;
1187
		sector_t  block = (sector_t)j << bitmap->chunkshift;
1188

1189 1190 1191 1192
		if (j == nextpage) {
			nextpage += PAGE_COUNTER_RATIO;
			if (!bitmap->bp[j >> PAGE_COUNTER_SHIFT].pending) {
				j |= PAGE_COUNTER_MASK;
1193 1194
				continue;
			}
1195
			bitmap->bp[j >> PAGE_COUNTER_SHIFT].pending = 0;
1196
		}
1197
		bmc = bitmap_get_counter(bitmap,
1198
					 block,
1199
					 &blocks, 0);
1200 1201

		if (!bmc) {
1202
			j |= PAGE_COUNTER_MASK;
1203 1204 1205 1206 1207
			continue;
		}
		if (*bmc == 1 && !bitmap->need_sync) {
			/* We can clear the bit */
			*bmc = 0;
1208 1209
			bitmap_count_page(bitmap, block, -1);
			bitmap_file_clear_bit(bitmap, block);
1210 1211
		} else if (*bmc && *bmc <= 2) {
			*bmc = 1;
1212
			bitmap_set_pending(bitmap, block);
1213
			bitmap->allclean = 0;
1214
		}
1215 1216
	}

1217 1218 1219 1220 1221 1222 1223 1224
	/* 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.
	 */
1225
	for (j = 0; j < bitmap->storage.file_pages; j++) {
1226

1227
		if (test_page_attr(bitmap, j,
1228 1229 1230
				   BITMAP_PAGE_DIRTY))
			/* bitmap_unplug will handle the rest */
			break;
1231
		if (test_page_attr(bitmap, j,
1232
				   BITMAP_PAGE_NEEDWRITE)) {
1233
			clear_page_attr(bitmap, j,
1234
					BITMAP_PAGE_NEEDWRITE);
1235
			spin_unlock_irq(&bitmap->lock);
1236
			write_page(bitmap, bitmap->storage.filemap[j], 0);
1237
			spin_lock_irq(&bitmap->lock);
1238
			if (!bitmap->storage.filemap)
1239
				break;
1240 1241
		}
	}
1242
	spin_unlock_irq(&bitmap->lock);
1243

1244
 done:
1245
	if (bitmap->allclean == 0)
N
NeilBrown 已提交
1246 1247
		mddev->thread->timeout =
			mddev->bitmap_info.daemon_sleep;
1248
	mutex_unlock(&mddev->bitmap_info.mutex);
1249 1250 1251
}

static bitmap_counter_t *bitmap_get_counter(struct bitmap *bitmap,
N
NeilBrown 已提交
1252
					    sector_t offset, sector_t *blocks,
1253
					    int create)
1254 1255
__releases(bitmap->lock)
__acquires(bitmap->lock)
1256 1257 1258 1259 1260
{
	/* 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.
	 */
1261
	sector_t chunk = offset >> bitmap->chunkshift;
1262 1263 1264
	unsigned long page = chunk >> PAGE_COUNTER_SHIFT;
	unsigned long pageoff = (chunk & PAGE_COUNTER_MASK) << COUNTER_BYTE_SHIFT;
	sector_t csize;
1265
	int err;
1266

1267 1268 1269 1270
	err = bitmap_checkpage(bitmap, page, create);

	if (bitmap->bp[page].hijacked ||
	    bitmap->bp[page].map == NULL)
1271
		csize = ((sector_t)1) << (bitmap->chunkshift +
1272 1273
					  PAGE_COUNTER_SHIFT - 1);
	else
1274
		csize = ((sector_t)1) << bitmap->chunkshift;
1275 1276 1277
	*blocks = csize - (offset & (csize - 1));

	if (err < 0)
1278
		return NULL;
1279

1280 1281 1282 1283 1284 1285 1286 1287
	/* 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];
1288
	} else /* page is allocated */
1289 1290 1291 1292
		return (bitmap_counter_t *)
			&(bitmap->bp[page].map[pageoff]);
}

1293
int bitmap_startwrite(struct bitmap *bitmap, sector_t offset, unsigned long sectors, int behind)
1294
{
1295 1296
	if (!bitmap)
		return 0;
1297 1298

	if (behind) {
1299
		int bw;
1300
		atomic_inc(&bitmap->behind_writes);
1301 1302 1303 1304
		bw = atomic_read(&bitmap->behind_writes);
		if (bw > bitmap->behind_writes_used)
			bitmap->behind_writes_used = bw;

1305 1306
		pr_debug("inc write-behind count %d/%lu\n",
			 bw, bitmap->mddev->bitmap_info.max_write_behind);
1307 1308
	}

1309
	while (sectors) {
N
NeilBrown 已提交
1310
		sector_t blocks;
1311 1312 1313 1314 1315 1316 1317 1318 1319
		bitmap_counter_t *bmc;

		spin_lock_irq(&bitmap->lock);
		bmc = bitmap_get_counter(bitmap, offset, &blocks, 1);
		if (!bmc) {
			spin_unlock_irq(&bitmap->lock);
			return 0;
		}

1320
		if (unlikely(COUNTER(*bmc) == COUNTER_MAX)) {
1321 1322 1323 1324 1325 1326 1327 1328
			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);
			spin_unlock_irq(&bitmap->lock);
J
Jens Axboe 已提交
1329
			io_schedule();
1330 1331 1332 1333
			finish_wait(&bitmap->overflow_wait, &__wait);
			continue;
		}

1334
		switch (*bmc) {
1335 1336
		case 0:
			bitmap_file_set_bit(bitmap, offset);
1337
			bitmap_count_page(bitmap, offset, 1);
1338 1339 1340 1341
			/* fall through */
		case 1:
			*bmc = 2;
		}
1342

1343 1344 1345 1346 1347 1348 1349
		(*bmc)++;

		spin_unlock_irq(&bitmap->lock);

		offset += blocks;
		if (sectors > blocks)
			sectors -= blocks;
1350 1351
		else
			sectors = 0;
1352 1353 1354
	}
	return 0;
}
1355
EXPORT_SYMBOL(bitmap_startwrite);
1356 1357

void bitmap_endwrite(struct bitmap *bitmap, sector_t offset, unsigned long sectors,
1358
		     int success, int behind)
1359
{
1360 1361
	if (!bitmap)
		return;
1362
	if (behind) {
1363 1364
		if (atomic_dec_and_test(&bitmap->behind_writes))
			wake_up(&bitmap->behind_wait);
1365 1366 1367
		pr_debug("dec write-behind count %d/%lu\n",
			 atomic_read(&bitmap->behind_writes),
			 bitmap->mddev->bitmap_info.max_write_behind);
1368 1369
	}

1370
	while (sectors) {
N
NeilBrown 已提交
1371
		sector_t blocks;
1372 1373 1374 1375 1376 1377 1378 1379 1380 1381
		unsigned long flags;
		bitmap_counter_t *bmc;

		spin_lock_irqsave(&bitmap->lock, flags);
		bmc = bitmap_get_counter(bitmap, offset, &blocks, 0);
		if (!bmc) {
			spin_unlock_irqrestore(&bitmap->lock, flags);
			return;
		}

1382
		if (success && !bitmap->mddev->degraded &&
1383 1384 1385
		    bitmap->events_cleared < bitmap->mddev->events) {
			bitmap->events_cleared = bitmap->mddev->events;
			bitmap->need_sync = 1;
1386
			sysfs_notify_dirent_safe(bitmap->sysfs_can_clear);
1387 1388
		}

1389
		if (!success && !NEEDED(*bmc))
1390 1391
			*bmc |= NEEDED_MASK;

1392
		if (COUNTER(*bmc) == COUNTER_MAX)
1393 1394
			wake_up(&bitmap->overflow_wait);

1395
		(*bmc)--;
1396
		if (*bmc <= 2) {
1397
			bitmap_set_pending(bitmap, offset);
1398 1399
			bitmap->allclean = 0;
		}
1400 1401 1402 1403
		spin_unlock_irqrestore(&bitmap->lock, flags);
		offset += blocks;
		if (sectors > blocks)
			sectors -= blocks;
1404 1405
		else
			sectors = 0;
1406 1407
	}
}
1408
EXPORT_SYMBOL(bitmap_endwrite);
1409

N
NeilBrown 已提交
1410
static int __bitmap_start_sync(struct bitmap *bitmap, sector_t offset, sector_t *blocks,
1411
			       int degraded)
1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427
{
	bitmap_counter_t *bmc;
	int rv;
	if (bitmap == NULL) {/* FIXME or bitmap set as 'failed' */
		*blocks = 1024;
		return 1; /* always resync if no bitmap */
	}
	spin_lock_irq(&bitmap->lock);
	bmc = bitmap_get_counter(bitmap, offset, blocks, 0);
	rv = 0;
	if (bmc) {
		/* locked */
		if (RESYNC(*bmc))
			rv = 1;
		else if (NEEDED(*bmc)) {
			rv = 1;
1428 1429 1430 1431
			if (!degraded) { /* don't set/clear bits if degraded */
				*bmc |= RESYNC_MASK;
				*bmc &= ~NEEDED_MASK;
			}
1432 1433 1434 1435 1436 1437
		}
	}
	spin_unlock_irq(&bitmap->lock);
	return rv;
}

N
NeilBrown 已提交
1438
int bitmap_start_sync(struct bitmap *bitmap, sector_t offset, sector_t *blocks,
1439 1440 1441 1442 1443 1444 1445 1446 1447 1448
		      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 已提交
1449
	sector_t blocks1;
1450 1451 1452 1453 1454 1455 1456 1457 1458 1459

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

N
NeilBrown 已提交
1462
void bitmap_end_sync(struct bitmap *bitmap, sector_t offset, sector_t *blocks, int aborted)
1463 1464 1465
{
	bitmap_counter_t *bmc;
	unsigned long flags;
1466 1467

	if (bitmap == NULL) {
1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481
		*blocks = 1024;
		return;
	}
	spin_lock_irqsave(&bitmap->lock, flags);
	bmc = bitmap_get_counter(bitmap, offset, blocks, 0);
	if (bmc == NULL)
		goto unlock;
	/* locked */
	if (RESYNC(*bmc)) {
		*bmc &= ~RESYNC_MASK;

		if (!NEEDED(*bmc) && aborted)
			*bmc |= NEEDED_MASK;
		else {
1482
			if (*bmc <= 2) {
1483
				bitmap_set_pending(bitmap, offset);
1484 1485
				bitmap->allclean = 0;
			}
1486 1487 1488 1489 1490
		}
	}
 unlock:
	spin_unlock_irqrestore(&bitmap->lock, flags);
}
1491
EXPORT_SYMBOL(bitmap_end_sync);
1492 1493 1494 1495 1496 1497 1498 1499

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 已提交
1500
	sector_t blocks;
N
NeilBrown 已提交
1501 1502
	if (!bitmap)
		return;
1503 1504
	while (sector < bitmap->mddev->resync_max_sectors) {
		bitmap_end_sync(bitmap, sector, &blocks, 0);
N
NeilBrown 已提交
1505 1506 1507
		sector += blocks;
	}
}
1508
EXPORT_SYMBOL(bitmap_close_sync);
N
NeilBrown 已提交
1509 1510 1511 1512

void bitmap_cond_end_sync(struct bitmap *bitmap, sector_t sector)
{
	sector_t s = 0;
N
NeilBrown 已提交
1513
	sector_t blocks;
N
NeilBrown 已提交
1514 1515 1516 1517 1518 1519 1520 1521

	if (!bitmap)
		return;
	if (sector == 0) {
		bitmap->last_end_sync = jiffies;
		return;
	}
	if (time_before(jiffies, (bitmap->last_end_sync
1522
				  + bitmap->mddev->bitmap_info.daemon_sleep)))
N
NeilBrown 已提交
1523 1524 1525 1526
		return;
	wait_event(bitmap->mddev->recovery_wait,
		   atomic_read(&bitmap->mddev->recovery_active) == 0);

1527
	bitmap->mddev->curr_resync_completed = sector;
1528
	set_bit(MD_CHANGE_CLEAN, &bitmap->mddev->flags);
1529
	sector &= ~((1ULL << bitmap->chunkshift) - 1);
N
NeilBrown 已提交
1530 1531 1532 1533
	s = 0;
	while (s < sector && s < bitmap->mddev->resync_max_sectors) {
		bitmap_end_sync(bitmap, s, &blocks, 0);
		s += blocks;
1534
	}
N
NeilBrown 已提交
1535
	bitmap->last_end_sync = jiffies;
1536
	sysfs_notify(&bitmap->mddev->kobj, NULL, "sync_completed");
1537
}
1538
EXPORT_SYMBOL(bitmap_cond_end_sync);
1539

1540
static void bitmap_set_memory_bits(struct bitmap *bitmap, sector_t offset, int needed)
1541 1542
{
	/* For each chunk covered by any of these sectors, set the
1543
	 * counter to 2 and possibly set resync_needed.  They should all
1544 1545
	 * be 0 at this point
	 */
1546

N
NeilBrown 已提交
1547
	sector_t secs;
1548 1549 1550 1551
	bitmap_counter_t *bmc;
	spin_lock_irq(&bitmap->lock);
	bmc = bitmap_get_counter(bitmap, offset, &secs, 1);
	if (!bmc) {
1552
		spin_unlock_irq(&bitmap->lock);
1553
		return;
1554
	}
1555
	if (!*bmc) {
1556
		*bmc = 2 | (needed ? NEEDED_MASK : 0);
1557
		bitmap_count_page(bitmap, offset, 1);
1558
		bitmap_set_pending(bitmap, offset);
1559
		bitmap->allclean = 0;
1560 1561
	}
	spin_unlock_irq(&bitmap->lock);
1562 1563
}

1564 1565 1566 1567 1568 1569
/* 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++) {
1570
		sector_t sec = (sector_t)chunk << bitmap->chunkshift;
1571
		bitmap_set_memory_bits(bitmap, sec, 1);
1572
		spin_lock_irq(&bitmap->lock);
1573
		bitmap_file_set_bit(bitmap, sec);
1574
		spin_unlock_irq(&bitmap->lock);
1575 1576 1577 1578 1579 1580
		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;
1581 1582 1583
	}
}

1584 1585 1586
/*
 * flush out any pending updates
 */
1587
void bitmap_flush(struct mddev *mddev)
1588 1589
{
	struct bitmap *bitmap = mddev->bitmap;
1590
	long sleep;
1591 1592 1593 1594 1595 1596 1597

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

	/* run the daemon_work three time to ensure everything is flushed
	 * that can be
	 */
1598
	sleep = mddev->bitmap_info.daemon_sleep * 2;
1599
	bitmap->daemon_lastrun -= sleep;
1600
	bitmap_daemon_work(mddev);
1601
	bitmap->daemon_lastrun -= sleep;
1602
	bitmap_daemon_work(mddev);
1603
	bitmap->daemon_lastrun -= sleep;
1604
	bitmap_daemon_work(mddev);
1605 1606 1607
	bitmap_update_sb(bitmap);
}

1608 1609 1610
/*
 * free memory that was allocated
 */
1611
static void bitmap_free(struct bitmap *bitmap)
1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633
{
	unsigned long k, pages;
	struct bitmap_page *bp;

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

	/* release the bitmap file and kill the daemon */
	bitmap_file_put(bitmap);

	bp = bitmap->bp;
	pages = bitmap->pages;

	/* 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);
}
1634

1635
void bitmap_destroy(struct mddev *mddev)
1636 1637 1638 1639 1640 1641
{
	struct bitmap *bitmap = mddev->bitmap;

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

1642
	mutex_lock(&mddev->bitmap_info.mutex);
1643
	mddev->bitmap = NULL; /* disconnect from the md device */
1644
	mutex_unlock(&mddev->bitmap_info.mutex);
1645 1646
	if (mddev->thread)
		mddev->thread->timeout = MAX_SCHEDULE_TIMEOUT;
1647

1648 1649 1650
	if (bitmap->sysfs_can_clear)
		sysfs_put(bitmap->sysfs_can_clear);

1651 1652
	bitmap_free(bitmap);
}
1653 1654 1655 1656 1657

/*
 * initialize the bitmap structure
 * if this returns an error, bitmap_destroy must be called to do clean up
 */
1658
int bitmap_create(struct mddev *mddev)
1659 1660
{
	struct bitmap *bitmap;
1661
	sector_t blocks = mddev->resync_max_sectors;
1662 1663
	unsigned long chunks;
	unsigned long pages;
1664
	struct file *file = mddev->bitmap_info.file;
1665
	int err;
1666
	struct sysfs_dirent *bm = NULL;
1667

A
Alexey Dobriyan 已提交
1668
	BUILD_BUG_ON(sizeof(bitmap_super_t) != 256);
1669

1670
	BUG_ON(file && mddev->bitmap_info.offset);
1671

1672
	bitmap = kzalloc(sizeof(*bitmap), GFP_KERNEL);
1673 1674 1675 1676
	if (!bitmap)
		return -ENOMEM;

	spin_lock_init(&bitmap->lock);
1677 1678
	atomic_set(&bitmap->pending_writes, 0);
	init_waitqueue_head(&bitmap->write_wait);
1679
	init_waitqueue_head(&bitmap->overflow_wait);
1680
	init_waitqueue_head(&bitmap->behind_wait);
1681

1682 1683
	bitmap->mddev = mddev;

1684 1685
	if (mddev->kobj.sd)
		bm = sysfs_get_dirent(mddev->kobj.sd, NULL, "bitmap");
1686
	if (bm) {
1687
		bitmap->sysfs_can_clear = sysfs_get_dirent(bm, NULL, "can_clear");
1688 1689 1690 1691
		sysfs_put(bm);
	} else
		bitmap->sysfs_can_clear = NULL;

1692
	bitmap->storage.file = file;
1693 1694
	if (file) {
		get_file(file);
1695 1696 1697 1698
		/* As future accesses to this file will use bmap,
		 * and bypass the page cache, we must sync the file
		 * first.
		 */
1699
		vfs_fsync(file, 1);
1700
	}
1701
	/* read superblock from bitmap file (this sets mddev->bitmap_info.chunksize) */
1702 1703 1704 1705 1706 1707 1708 1709 1710 1711
	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 {
1712 1713 1714 1715 1716 1717 1718
		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;
	}
1719
	if (err)
1720
		goto error;
1721

1722
	bitmap->daemon_lastrun = jiffies;
1723 1724
	bitmap->chunkshift = (ffz(~mddev->bitmap_info.chunksize)
			      - BITMAP_BLOCK_SHIFT);
1725

1726
	chunks = (blocks + (1 << bitmap->chunkshift) - 1) >>
1727
			bitmap->chunkshift;
1728
	pages = (chunks + PAGE_COUNTER_RATIO - 1) / PAGE_COUNTER_RATIO;
1729 1730 1731 1732 1733 1734 1735

	BUG_ON(!pages);

	bitmap->chunks = chunks;
	bitmap->pages = pages;
	bitmap->missing_pages = pages;

1736
	bitmap->bp = kzalloc(pages * sizeof(*bitmap->bp), GFP_KERNEL);
1737

1738
	err = -ENOMEM;
1739
	if (!bitmap->bp)
1740
		goto error;
1741

1742 1743 1744 1745 1746 1747
	if (file || mddev->bitmap_info.offset) {
		err = bitmap_storage_alloc(&bitmap->storage, bitmap->chunks,
					   !mddev->bitmap_info.external);
		if (err)
			goto error;
	}
1748 1749 1750 1751 1752 1753
	printk(KERN_INFO "created bitmap (%lu pages) for device %s\n",
		pages, bmname(bitmap));

	mddev->bitmap = bitmap;


1754
	return test_bit(BITMAP_WRITE_ERROR, &bitmap->flags) ? -EIO : 0;
1755 1756 1757 1758 1759 1760

 error:
	bitmap_free(bitmap);
	return err;
}

1761
int bitmap_load(struct mddev *mddev)
1762 1763
{
	int err = 0;
1764
	sector_t start = 0;
1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776
	sector_t sector = 0;
	struct bitmap *bitmap = mddev->bitmap;

	if (!bitmap)
		goto out;

	/* 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 已提交
1777
		sector_t blocks;
1778 1779 1780 1781 1782
		bitmap_start_sync(bitmap, sector, &blocks, 0);
		sector += blocks;
	}
	bitmap_close_sync(bitmap);

1783 1784 1785 1786 1787 1788
	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;

1789
	mutex_lock(&mddev->bitmap_info.mutex);
1790
	err = bitmap_init_from_disk(bitmap, start);
1791
	mutex_unlock(&mddev->bitmap_info.mutex);
1792

1793
	if (err)
1794
		goto out;
1795
	clear_bit(BITMAP_STALE, &bitmap->flags);
1796 1797 1798

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

1800
	mddev->thread->timeout = mddev->bitmap_info.daemon_sleep;
1801
	md_wakeup_thread(mddev->thread);
1802

1803 1804
	bitmap_update_sb(bitmap);

1805
	if (test_bit(BITMAP_WRITE_ERROR, &bitmap->flags))
1806 1807
		err = -EIO;
out:
1808
	return err;
1809
}
1810
EXPORT_SYMBOL_GPL(bitmap_load);
1811

1812 1813 1814 1815 1816 1817 1818
void bitmap_status(struct seq_file *seq, struct bitmap *bitmap)
{
	unsigned long chunk_kb;

	if (!bitmap)
		return;

1819
	spin_lock_irq(&bitmap->lock);
1820 1821 1822 1823 1824 1825 1826 1827 1828
	chunk_kb = bitmap->mddev->bitmap_info.chunksize >> 10;
	seq_printf(seq, "bitmap: %lu/%lu pages [%luKB], "
		   "%lu%s chunk",
		   bitmap->pages - bitmap->missing_pages,
		   bitmap->pages,
		   (bitmap->pages - bitmap->missing_pages)
		   << (PAGE_SHIFT - 10),
		   chunk_kb ? chunk_kb : bitmap->mddev->bitmap_info.chunksize,
		   chunk_kb ? "KB" : "B");
1829
	if (bitmap->storage.file) {
1830
		seq_printf(seq, ", file: ");
1831
		seq_path(seq, &bitmap->storage.file->f_path, " \t\n");
1832 1833 1834
	}

	seq_printf(seq, "\n");
1835
	spin_unlock_irq(&bitmap->lock);
1836 1837
}

1838
static ssize_t
1839
location_show(struct mddev *mddev, char *page)
1840 1841
{
	ssize_t len;
1842
	if (mddev->bitmap_info.file)
1843
		len = sprintf(page, "file");
1844
	else if (mddev->bitmap_info.offset)
1845
		len = sprintf(page, "%+lld", (long long)mddev->bitmap_info.offset);
1846
	else
1847 1848 1849 1850 1851 1852
		len = sprintf(page, "none");
	len += sprintf(page+len, "\n");
	return len;
}

static ssize_t
1853
location_store(struct mddev *mddev, const char *buf, size_t len)
1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897
{

	if (mddev->pers) {
		if (!mddev->pers->quiesce)
			return -EBUSY;
		if (mddev->recovery || mddev->sync_thread)
			return -EBUSY;
	}

	if (mddev->bitmap || mddev->bitmap_info.file ||
	    mddev->bitmap_info.offset) {
		/* bitmap already configured.  Only option is to clear it */
		if (strncmp(buf, "none", 4) != 0)
			return -EBUSY;
		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;
			restore_bitmap_write_access(f);
			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 */
			return -EINVAL;
		} else {
			int rv;
			if (buf[0] == '+')
				rv = strict_strtoll(buf+1, 10, &offset);
			else
				rv = strict_strtoll(buf, 10, &offset);
			if (rv)
				return rv;
			if (offset == 0)
				return -EINVAL;
1898 1899
			if (mddev->bitmap_info.external == 0 &&
			    mddev->major_version == 0 &&
1900 1901 1902 1903 1904 1905
			    offset != mddev->bitmap_info.default_offset)
				return -EINVAL;
			mddev->bitmap_info.offset = offset;
			if (mddev->pers) {
				mddev->pers->quiesce(mddev, 1);
				rv = bitmap_create(mddev);
1906 1907
				if (!rv)
					rv = bitmap_load(mddev);
1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930
				if (rv) {
					bitmap_destroy(mddev);
					mddev->bitmap_info.offset = 0;
				}
				mddev->pers->quiesce(mddev, 0);
				if (rv)
					return rv;
			}
		}
	}
	if (!mddev->external) {
		/* Ensure new bitmap info is stored in
		 * metadata promptly.
		 */
		set_bit(MD_CHANGE_DEVS, &mddev->flags);
		md_wakeup_thread(mddev->thread);
	}
	return len;
}

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

1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954
/* '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 &&
1955
	    sectors < (mddev->bitmap->storage.bytes + 511) >> 9)
1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967
		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);

1968
static ssize_t
1969
timeout_show(struct mddev *mddev, char *page)
1970 1971 1972 1973
{
	ssize_t len;
	unsigned long secs = mddev->bitmap_info.daemon_sleep / HZ;
	unsigned long jifs = mddev->bitmap_info.daemon_sleep % HZ;
1974

1975 1976 1977 1978 1979 1980 1981 1982
	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
1983
timeout_store(struct mddev *mddev, const char *buf, size_t len)
1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018
{
	/* 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
2019
backlog_show(struct mddev *mddev, char *page)
2020 2021 2022 2023 2024
{
	return sprintf(page, "%lu\n", mddev->bitmap_info.max_write_behind);
}

static ssize_t
2025
backlog_store(struct mddev *mddev, const char *buf, size_t len)
2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040
{
	unsigned long backlog;
	int rv = strict_strtoul(buf, 10, &backlog);
	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
2041
chunksize_show(struct mddev *mddev, char *page)
2042 2043 2044 2045 2046
{
	return sprintf(page, "%lu\n", mddev->bitmap_info.chunksize);
}

static ssize_t
2047
chunksize_store(struct mddev *mddev, const char *buf, size_t len)
2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066
{
	/* Can only be changed when no bitmap is active */
	int rv;
	unsigned long csize;
	if (mddev->bitmap)
		return -EBUSY;
	rv = strict_strtoul(buf, 10, &csize);
	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);

2067
static ssize_t metadata_show(struct mddev *mddev, char *page)
2068 2069 2070 2071 2072
{
	return sprintf(page, "%s\n", (mddev->bitmap_info.external
				      ? "external" : "internal"));
}

2073
static ssize_t metadata_store(struct mddev *mddev, const char *buf, size_t len)
2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090
{
	if (mddev->bitmap ||
	    mddev->bitmap_info.file ||
	    mddev->bitmap_info.offset)
		return -EBUSY;
	if (strncmp(buf, "external", 8) == 0)
		mddev->bitmap_info.external = 1;
	else if (strncmp(buf, "internal", 8) == 0)
		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);

2091
static ssize_t can_clear_show(struct mddev *mddev, char *page)
2092 2093 2094 2095 2096 2097 2098 2099 2100 2101
{
	int len;
	if (mddev->bitmap)
		len = sprintf(page, "%s\n", (mddev->bitmap->need_sync ?
					     "false" : "true"));
	else
		len = sprintf(page, "\n");
	return len;
}

2102
static ssize_t can_clear_store(struct mddev *mddev, const char *buf, size_t len)
2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119
{
	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);

2120
static ssize_t
2121
behind_writes_used_show(struct mddev *mddev, char *page)
2122 2123 2124 2125 2126 2127 2128 2129
{
	if (mddev->bitmap == NULL)
		return sprintf(page, "0\n");
	return sprintf(page, "%lu\n",
		       mddev->bitmap->behind_writes_used);
}

static ssize_t
2130
behind_writes_used_reset(struct mddev *mddev, const char *buf, size_t len)
2131 2132 2133 2134 2135 2136 2137 2138 2139 2140
{
	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);

2141 2142
static struct attribute *md_bitmap_attrs[] = {
	&bitmap_location.attr,
2143
	&bitmap_space.attr,
2144 2145 2146
	&bitmap_timeout.attr,
	&bitmap_backlog.attr,
	&bitmap_chunksize.attr,
2147 2148
	&bitmap_metadata.attr,
	&bitmap_can_clear.attr,
2149
	&max_backlog_used.attr,
2150 2151 2152 2153 2154 2155 2156
	NULL
};
struct attribute_group md_bitmap_group = {
	.name = "bitmap",
	.attrs = md_bitmap_attrs,
};