bitmap.c 59.7 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
static int bitmap_checkpage(struct bitmap_counts *bitmap,
49
			    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
		pr_debug("md/bitmap: map page allocation failed, hijacking\n");
80 81 82 83
		/* 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;
84 85
	} else if (bitmap->bp[page].map ||
		   bitmap->bp[page].hijacked) {
86
		/* somebody beat us to getting the page */
87
		kfree(mappage);
88
		return 0;
89
	} else {
90

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

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

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

/*
 * basic page I/O operations
 */

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

138
	struct md_rdev *rdev;
139 140
	sector_t target;

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

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

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

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

189
static int write_sb_page(struct bitmap *bitmap, struct page *page, int wait)
190
{
191
	struct md_rdev *rdev = NULL;
192
	struct block_device *bdev;
193
	struct mddev *mddev = bitmap->mddev;
194
	struct bitmap_storage *store = &bitmap->storage;
195

196
	while ((rdev = next_active_rdev(rdev, mddev)) != NULL) {
197 198
		int size = PAGE_SIZE;
		loff_t offset = mddev->bitmap_info.offset;
199 200 201

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

202 203 204 205 206
		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,
207
				       bdev_logical_block_size(bdev));
208
		}
209 210 211 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
		/* 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);
249
	}
250 251

	if (wait)
252
		md_super_wait(mddev);
253
	return 0;
254 255 256

 bad_alignment:
	return -EINVAL;
257 258
}

259
static void bitmap_file_kick(struct bitmap *bitmap);
260
/*
261
 * write out a page to a file
262
 */
263
static void write_page(struct bitmap *bitmap, struct page *page, int wait)
264
{
265
	struct buffer_head *bh;
266

267
	if (bitmap->storage.file == NULL) {
268 269
		switch (write_sb_page(bitmap, page, wait)) {
		case -EINVAL:
270
			set_bit(BITMAP_WRITE_ERROR, &bitmap->flags);
271
		}
272
	} else {
273

274
		bh = page_buffers(page);
275

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

284
		if (wait)
285 286
			wait_event(bitmap->write_wait,
				   atomic_read(&bitmap->pending_writes)==0);
287
	}
288
	if (test_bit(BITMAP_WRITE_ERROR, &bitmap->flags))
289
		bitmap_file_kick(bitmap);
290 291 292 293 294
}

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

296 297
	if (!uptodate)
		set_bit(BITMAP_WRITE_ERROR, &bitmap->flags);
298 299 300
	if (atomic_dec_and_test(&bitmap->pending_writes))
		wake_up(&bitmap->write_wait);
}
301

302 303 304 305 306 307 308 309 310 311
/* 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)
{
312
	struct buffer_head *bh;
313

314 315 316 317
	if (!PagePrivate(page))
		return;

	bh = page_buffers(page);
318 319 320 321
	while (bh) {
		struct buffer_head *next = bh->b_this_page;
		free_buffer_head(bh);
		bh = next;
322
	}
323 324
	__clear_page_buffers(page);
	put_page(page);
325 326
}

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

344 345
	pr_debug("read bitmap file (%dB @ %llu)\n", (int)PAGE_SIZE,
		 (unsigned long long)index << PAGE_SHIFT);
346

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

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

/*
 * bitmap file superblock operations
 */

/* update the event counter and sync the superblock to disk */
400
void bitmap_update_sb(struct bitmap *bitmap)
401 402 403 404
{
	bitmap_super_t *sb;

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

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

434
	if (!bitmap || !bitmap->storage.sb_page)
435
		return;
436
	sb = kmap_atomic(bitmap->storage.sb_page);
437
	printk(KERN_DEBUG "%s: bitmap file superblock:\n", bmname(bitmap));
438 439 440
	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",
441 442 443 444
					*(__u32 *)(sb->uuid+0),
					*(__u32 *)(sb->uuid+4),
					*(__u32 *)(sb->uuid+8),
					*(__u32 *)(sb->uuid+12));
445
	printk(KERN_DEBUG "        events: %llu\n",
446
			(unsigned long long) le64_to_cpu(sb->events));
447
	printk(KERN_DEBUG "events cleared: %llu\n",
448
			(unsigned long long) le64_to_cpu(sb->events_cleared));
449 450 451 452 453
	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);
454
	printk(KERN_DEBUG "max write behind: %d\n", le32_to_cpu(sb->write_behind));
455
	kunmap_atomic(sb);
456 457
}

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

475 476 477 478
	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;
479 480
		return err;
	}
481
	bitmap->storage.sb_page->index = 0;
482

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

	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)) {
491
		kunmap_atomic(sb);
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 520
		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);

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

526
	kunmap_atomic(sb);
527 528 529 530

	return 0;
}

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

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

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

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

571
	sb = kmap_atomic(sb_page);
572 573

	chunksize = le32_to_cpu(sb->chunksize);
574
	daemon_sleep = le32_to_cpu(sb->daemon_sleep) * HZ;
575
	write_behind = le32_to_cpu(sb->write_behind);
576
	sectors_reserved = le32_to_cpu(sb->sectors_reserved);
577 578 579 580

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

601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618
	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);
619
			set_bit(BITMAP_STALE, &bitmap->flags);
620
		}
621
	}
622

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

/*
 * general bitmap file operations
 */

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

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

/*
 * 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
 */
680
static inline struct page *filemap_get_page(struct bitmap_storage *store,
681
					    unsigned long chunk)
682
{
683
	if (file_page_index(store, chunk) >= store->file_pages)
684
		return NULL;
685 686
	return store->filemap[file_page_index(store, chunk)
			      - file_page_index(store, 0)];
687 688
}

689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707
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) {
708
		store->sb_page = alloc_page(GFP_KERNEL|__GFP_ZERO);
709 710 711 712 713 714 715 716 717 718
		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++) {
719
		store->filemap[pnum] = alloc_page(GFP_KERNEL|__GFP_ZERO);
720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740
		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;
}

741
static void bitmap_file_unmap(struct bitmap_storage *store)
742 743 744
{
	struct page **map, *sb_page;
	int pages;
745
	struct file *file;
746

747
	file = store->file;
748 749 750
	map = store->filemap;
	pages = store->file_pages;
	sb_page = store->sb_page;
751 752

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

758 759
	if (sb_page)
		free_buffers(sb_page);
760

761
	if (file) {
J
Josef Sipek 已提交
762
		struct inode *inode = file->f_path.dentry->d_inode;
763
		invalidate_mapping_pages(inode->i_mapping, 0, -1);
764
		fput(file);
765
	}
766 767 768 769 770 771 772 773 774 775 776
}

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

777
	if (!test_and_set_bit(BITMAP_STALE, &bitmap->flags)) {
778
		bitmap_update_sb(bitmap);
779

780
		if (bitmap->storage.file) {
781 782
			path = kmalloc(PAGE_SIZE, GFP_KERNEL);
			if (path)
783 784
				ptr = d_path(&bitmap->storage.file->f_path,
					     path, PAGE_SIZE);
C
Christoph Hellwig 已提交
785

786 787
			printk(KERN_ALERT
			      "%s: kicking failed bitmap file %s from array!\n",
C
Christoph Hellwig 已提交
788
			      bmname(bitmap), IS_ERR(ptr) ? "" : ptr);
789

790 791 792 793 794
			kfree(path);
		} else
			printk(KERN_ALERT
			       "%s: disabling internal bitmap due to errors\n",
			       bmname(bitmap));
795
	}
796 797 798
}

enum bitmap_page_attr {
799
	BITMAP_PAGE_DIRTY = 0,     /* there are set bits that need to be synced */
800 801
	BITMAP_PAGE_PENDING = 1,   /* there are bits that are being cleaned.
				    * i.e. counter is 1 or 2. */
802
	BITMAP_PAGE_NEEDWRITE = 2, /* there are cleared bits that need to be synced */
803 804
};

805 806
static inline void set_page_attr(struct bitmap *bitmap, int pnum,
				 enum bitmap_page_attr attr)
807
{
808
	set_bit((pnum<<2) + attr, bitmap->storage.filemap_attr);
809 810
}

811 812
static inline void clear_page_attr(struct bitmap *bitmap, int pnum,
				   enum bitmap_page_attr attr)
813
{
814
	clear_bit((pnum<<2) + attr, bitmap->storage.filemap_attr);
815 816
}

817 818
static inline int test_page_attr(struct bitmap *bitmap, int pnum,
				 enum bitmap_page_attr attr)
819
{
820
	return test_bit((pnum<<2) + attr, bitmap->storage.filemap_attr);
821 822
}

823 824 825 826 827 828
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);
}
829 830 831 832 833 834 835 836 837 838
/*
 * 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;
839
	struct page *page;
840
	void *kaddr;
841
	unsigned long chunk = block >> bitmap->counts.chunkshift;
842

843
	page = filemap_get_page(&bitmap->storage, chunk);
844 845
	if (!page)
		return;
846
	bit = file_page_offset(&bitmap->storage, chunk);
847

848
	/* set the bit */
849
	kaddr = kmap_atomic(page);
850
	if (test_bit(BITMAP_HOSTENDIAN, &bitmap->flags))
851 852
		set_bit(bit, kaddr);
	else
853
		test_and_set_bit_le(bit, kaddr);
854
	kunmap_atomic(kaddr);
855
	pr_debug("set file bit %lu page %lu\n", bit, page->index);
856
	/* record page number so it gets flushed to disk when unplug occurs */
857
	set_page_attr(bitmap, page->index, BITMAP_PAGE_DIRTY);
858 859
}

860 861 862 863 864
static void bitmap_file_clear_bit(struct bitmap *bitmap, sector_t block)
{
	unsigned long bit;
	struct page *page;
	void *paddr;
865
	unsigned long chunk = block >> bitmap->counts.chunkshift;
866

867
	page = filemap_get_page(&bitmap->storage, chunk);
868 869
	if (!page)
		return;
870
	bit = file_page_offset(&bitmap->storage, chunk);
871
	paddr = kmap_atomic(page);
872
	if (test_bit(BITMAP_HOSTENDIAN, &bitmap->flags))
873 874
		clear_bit(bit, paddr);
	else
875
		test_and_clear_bit_le(bit, paddr);
876
	kunmap_atomic(paddr);
877 878
	if (!test_page_attr(bitmap, page->index, BITMAP_PAGE_NEEDWRITE)) {
		set_page_attr(bitmap, page->index, BITMAP_PAGE_PENDING);
879 880 881 882
		bitmap->allclean = 0;
	}
}

883 884 885
/* 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 */
886
void bitmap_unplug(struct bitmap *bitmap)
887
{
888
	unsigned long i;
889
	int dirty, need_write;
890 891
	int wait = 0;

892 893
	if (!bitmap || !bitmap->storage.filemap ||
	    test_bit(BITMAP_STALE, &bitmap->flags))
894
		return;
895 896 897

	/* look at each page to see if there are any set bits that need to be
	 * flushed out to disk */
898
	for (i = 0; i < bitmap->storage.file_pages; i++) {
899
		if (!bitmap->storage.filemap)
900
			return;
901 902 903 904
		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) {
905
			clear_page_attr(bitmap, i, BITMAP_PAGE_PENDING);
906 907
			write_page(bitmap, bitmap->storage.filemap[i], 0);
		}
908
		if (dirty)
909 910 911
			wait = 1;
	}
	if (wait) { /* if any writes were performed, we need to wait on them */
912
		if (bitmap->storage.file)
913 914
			wait_event(bitmap->write_wait,
				   atomic_read(&bitmap->pending_writes)==0);
915
		else
916
			md_super_wait(bitmap->mddev);
917
	}
918
	if (test_bit(BITMAP_WRITE_ERROR, &bitmap->flags))
919
		bitmap_file_kick(bitmap);
920
}
921
EXPORT_SYMBOL(bitmap_unplug);
922

923
static void bitmap_set_memory_bits(struct bitmap *bitmap, sector_t offset, int needed);
924 925 926 927 928 929 930
/* * 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.
931 932 933
 *
 * We ignore all bits for sectors that end earlier than 'start'.
 * This is used when reading an out-of-date bitmap...
934
 */
935
static int bitmap_init_from_disk(struct bitmap *bitmap, sector_t start)
936 937
{
	unsigned long i, chunks, index, oldindex, bit;
938
	struct page *page = NULL;
939
	unsigned long bit_cnt = 0;
940
	struct file *file;
941
	unsigned long offset;
942 943
	int outofdate;
	int ret = -ENOSPC;
944
	void *paddr;
945
	struct bitmap_storage *store = &bitmap->storage;
946

947
	chunks = bitmap->counts.chunks;
948
	file = store->file;
949

950 951
	if (!file && !bitmap->mddev->bitmap_info.offset) {
		/* No permanent bitmap - fill with '1s'. */
952 953
		store->filemap = NULL;
		store->file_pages = 0;
954 955
		for (i = 0; i < chunks ; i++) {
			/* if the disk bit is set, set the memory bit */
956
			int needed = ((sector_t)(i+1) << (bitmap->counts.chunkshift)
957 958
				      >= start);
			bitmap_set_memory_bits(bitmap,
959
					       (sector_t)i << bitmap->counts.chunkshift,
960 961 962 963
					       needed);
		}
		return 0;
	}
964

965
	outofdate = test_bit(BITMAP_STALE, &bitmap->flags);
966 967 968 969
	if (outofdate)
		printk(KERN_INFO "%s: bitmap file is out of date, doing full "
			"recovery\n", bmname(bitmap));

970
	if (file && i_size_read(file->f_mapping->host) < store->bytes) {
971
		printk(KERN_INFO "%s: bitmap file too short %lu < %lu\n",
972 973 974
		       bmname(bitmap),
		       (unsigned long) i_size_read(file->f_mapping->host),
		       store->bytes);
975
		goto err;
976
	}
977

978
	oldindex = ~0L;
979
	offset = 0;
980
	if (!bitmap->mddev->bitmap_info.external)
981
		offset = sizeof(bitmap_super_t);
982 983

	for (i = 0; i < chunks; i++) {
984
		int b;
985 986
		index = file_page_index(&bitmap->storage, i);
		bit = file_page_offset(&bitmap->storage, i);
987
		if (index != oldindex) { /* this is a new page, read it in */
988
			int count;
989
			/* unmap the old page, we're done with it */
990 991
			if (index == store->file_pages-1)
				count = store->bytes - index * PAGE_SIZE;
992 993
			else
				count = PAGE_SIZE;
994
			page = store->filemap[index];
995 996 997 998 999 1000 1001 1002 1003 1004 1005
			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)
1006
				goto err;
1007

1008 1009 1010 1011 1012
			oldindex = index;

			if (outofdate) {
				/*
				 * if bitmap is out of date, dirty the
1013
				 * whole page and write it out
1014
				 */
1015
				paddr = kmap_atomic(page);
1016
				memset(paddr + offset, 0xff,
1017
				       PAGE_SIZE - offset);
1018
				kunmap_atomic(paddr);
1019 1020 1021
				write_page(bitmap, page, 1);

				ret = -EIO;
1022 1023
				if (test_bit(BITMAP_WRITE_ERROR,
					     &bitmap->flags))
1024
					goto err;
1025 1026
			}
		}
1027
		paddr = kmap_atomic(page);
1028
		if (test_bit(BITMAP_HOSTENDIAN, &bitmap->flags))
1029
			b = test_bit(bit, paddr);
1030
		else
A
Akinobu Mita 已提交
1031
			b = test_bit_le(bit, paddr);
1032
		kunmap_atomic(paddr);
1033
		if (b) {
1034
			/* if the disk bit is set, set the memory bit */
1035
			int needed = ((sector_t)(i+1) << bitmap->counts.chunkshift
1036 1037
				      >= start);
			bitmap_set_memory_bits(bitmap,
1038
					       (sector_t)i << bitmap->counts.chunkshift,
1039
					       needed);
1040 1041
			bit_cnt++;
		}
1042
		offset = 0;
1043 1044 1045
	}

	printk(KERN_INFO "%s: bitmap initialized from disk: "
1046
	       "read %lu pages, set %lu of %lu bits\n",
1047
	       bmname(bitmap), store->file_pages,
1048
	       bit_cnt, chunks);
1049 1050

	return 0;
1051

1052 1053 1054
 err:
	printk(KERN_INFO "%s: bitmap initialisation failed: %d\n",
	       bmname(bitmap), ret);
1055 1056 1057
	return ret;
}

1058 1059 1060 1061 1062
void bitmap_write_all(struct bitmap *bitmap)
{
	/* We don't actually write all bitmap blocks here,
	 * just flag them as needing to be written
	 */
1063
	int i;
1064

1065
	if (!bitmap || !bitmap->storage.filemap)
1066
		return;
1067
	if (bitmap->storage.file)
1068 1069 1070
		/* Only one copy, so nothing needed */
		return;

1071
	for (i = 0; i < bitmap->storage.file_pages; i++)
1072
		set_page_attr(bitmap, i,
1073
			      BITMAP_PAGE_NEEDWRITE);
1074
	bitmap->allclean = 0;
1075 1076
}

1077 1078
static void bitmap_count_page(struct bitmap_counts *bitmap,
			      sector_t offset, int inc)
1079
{
1080
	sector_t chunk = offset >> bitmap->chunkshift;
1081 1082 1083 1084
	unsigned long page = chunk >> PAGE_COUNTER_SHIFT;
	bitmap->bp[page].count += inc;
	bitmap_checkfree(bitmap, page);
}
1085

1086
static void bitmap_set_pending(struct bitmap_counts *bitmap, sector_t offset)
1087 1088 1089 1090 1091 1092 1093 1094 1095
{
	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;
}

1096
static bitmap_counter_t *bitmap_get_counter(struct bitmap_counts *bitmap,
N
NeilBrown 已提交
1097
					    sector_t offset, sector_t *blocks,
1098 1099 1100 1101 1102 1103 1104
					    int create);

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

1105
void bitmap_daemon_work(struct mddev *mddev)
1106
{
1107
	struct bitmap *bitmap;
1108
	unsigned long j;
1109
	unsigned long nextpage;
N
NeilBrown 已提交
1110
	sector_t blocks;
1111
	struct bitmap_counts *counts;
1112

1113 1114 1115
	/* Use a mutex to guard daemon_work against
	 * bitmap_destroy.
	 */
1116
	mutex_lock(&mddev->bitmap_info.mutex);
1117 1118
	bitmap = mddev->bitmap;
	if (bitmap == NULL) {
1119
		mutex_unlock(&mddev->bitmap_info.mutex);
1120
		return;
1121
	}
1122
	if (time_before(jiffies, bitmap->daemon_lastrun
N
NeilBrown 已提交
1123
			+ mddev->bitmap_info.daemon_sleep))
1124 1125
		goto done;

1126
	bitmap->daemon_lastrun = jiffies;
1127
	if (bitmap->allclean) {
N
NeilBrown 已提交
1128
		mddev->thread->timeout = MAX_SCHEDULE_TIMEOUT;
1129
		goto done;
1130 1131
	}
	bitmap->allclean = 1;
1132

1133 1134 1135 1136
	/* 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.
	 */
1137
	for (j = 0; j < bitmap->storage.file_pages; j++)
1138 1139
		if (test_and_clear_page_attr(bitmap, j,
					     BITMAP_PAGE_PENDING))
1140
			set_page_attr(bitmap, j,
1141 1142 1143 1144 1145 1146 1147 1148
				      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;
1149 1150
		if (bitmap->storage.filemap) {
			sb = kmap_atomic(bitmap->storage.sb_page);
1151 1152 1153
			sb->events_cleared =
				cpu_to_le64(bitmap->events_cleared);
			kunmap_atomic(sb);
1154
			set_page_attr(bitmap, 0,
1155 1156
				      BITMAP_PAGE_NEEDWRITE);
		}
1157 1158 1159 1160
	}
	/* Now look at the bitmap counters and if any are '2' or '1',
	 * decrement and handle accordingly.
	 */
1161 1162
	counts = &bitmap->counts;
	spin_lock_irq(&counts->lock);
1163
	nextpage = 0;
1164
	for (j = 0; j < counts->chunks; j++) {
1165
		bitmap_counter_t *bmc;
1166
		sector_t  block = (sector_t)j << counts->chunkshift;
1167

1168 1169
		if (j == nextpage) {
			nextpage += PAGE_COUNTER_RATIO;
1170
			if (!counts->bp[j >> PAGE_COUNTER_SHIFT].pending) {
1171
				j |= PAGE_COUNTER_MASK;
1172 1173
				continue;
			}
1174
			counts->bp[j >> PAGE_COUNTER_SHIFT].pending = 0;
1175
		}
1176
		bmc = bitmap_get_counter(counts,
1177
					 block,
1178
					 &blocks, 0);
1179 1180

		if (!bmc) {
1181
			j |= PAGE_COUNTER_MASK;
1182 1183 1184 1185 1186
			continue;
		}
		if (*bmc == 1 && !bitmap->need_sync) {
			/* We can clear the bit */
			*bmc = 0;
1187
			bitmap_count_page(counts, block, -1);
1188
			bitmap_file_clear_bit(bitmap, block);
1189 1190
		} else if (*bmc && *bmc <= 2) {
			*bmc = 1;
1191
			bitmap_set_pending(counts, block);
1192
			bitmap->allclean = 0;
1193
		}
1194
	}
1195
	spin_unlock_irq(&counts->lock);
1196

1197 1198 1199 1200 1201 1202 1203 1204
	/* 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.
	 */
1205 1206 1207 1208
	for (j = 0;
	     j < bitmap->storage.file_pages
		     && !test_bit(BITMAP_STALE, &bitmap->flags);
	     j++) {
1209

1210
		if (test_page_attr(bitmap, j,
1211 1212 1213
				   BITMAP_PAGE_DIRTY))
			/* bitmap_unplug will handle the rest */
			break;
1214 1215
		if (test_and_clear_page_attr(bitmap, j,
					     BITMAP_PAGE_NEEDWRITE)) {
1216
			write_page(bitmap, bitmap->storage.filemap[j], 0);
1217 1218 1219
		}
	}

1220
 done:
1221
	if (bitmap->allclean == 0)
N
NeilBrown 已提交
1222 1223
		mddev->thread->timeout =
			mddev->bitmap_info.daemon_sleep;
1224
	mutex_unlock(&mddev->bitmap_info.mutex);
1225 1226
}

1227
static bitmap_counter_t *bitmap_get_counter(struct bitmap_counts *bitmap,
N
NeilBrown 已提交
1228
					    sector_t offset, sector_t *blocks,
1229
					    int create)
1230 1231
__releases(bitmap->lock)
__acquires(bitmap->lock)
1232 1233 1234 1235 1236
{
	/* 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.
	 */
1237
	sector_t chunk = offset >> bitmap->chunkshift;
1238 1239 1240
	unsigned long page = chunk >> PAGE_COUNTER_SHIFT;
	unsigned long pageoff = (chunk & PAGE_COUNTER_MASK) << COUNTER_BYTE_SHIFT;
	sector_t csize;
1241
	int err;
1242

1243 1244 1245 1246
	err = bitmap_checkpage(bitmap, page, create);

	if (bitmap->bp[page].hijacked ||
	    bitmap->bp[page].map == NULL)
1247
		csize = ((sector_t)1) << (bitmap->chunkshift +
1248 1249
					  PAGE_COUNTER_SHIFT - 1);
	else
1250
		csize = ((sector_t)1) << bitmap->chunkshift;
1251 1252 1253
	*blocks = csize - (offset & (csize - 1));

	if (err < 0)
1254
		return NULL;
1255

1256 1257 1258 1259 1260 1261 1262 1263
	/* 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];
1264
	} else /* page is allocated */
1265 1266 1267 1268
		return (bitmap_counter_t *)
			&(bitmap->bp[page].map[pageoff]);
}

1269
int bitmap_startwrite(struct bitmap *bitmap, sector_t offset, unsigned long sectors, int behind)
1270
{
1271 1272
	if (!bitmap)
		return 0;
1273 1274

	if (behind) {
1275
		int bw;
1276
		atomic_inc(&bitmap->behind_writes);
1277 1278 1279 1280
		bw = atomic_read(&bitmap->behind_writes);
		if (bw > bitmap->behind_writes_used)
			bitmap->behind_writes_used = bw;

1281 1282
		pr_debug("inc write-behind count %d/%lu\n",
			 bw, bitmap->mddev->bitmap_info.max_write_behind);
1283 1284
	}

1285
	while (sectors) {
N
NeilBrown 已提交
1286
		sector_t blocks;
1287 1288
		bitmap_counter_t *bmc;

1289 1290
		spin_lock_irq(&bitmap->counts.lock);
		bmc = bitmap_get_counter(&bitmap->counts, offset, &blocks, 1);
1291
		if (!bmc) {
1292
			spin_unlock_irq(&bitmap->counts.lock);
1293 1294 1295
			return 0;
		}

1296
		if (unlikely(COUNTER(*bmc) == COUNTER_MAX)) {
1297 1298 1299 1300 1301 1302 1303
			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);
1304
			spin_unlock_irq(&bitmap->counts.lock);
1305
			schedule();
1306 1307 1308 1309
			finish_wait(&bitmap->overflow_wait, &__wait);
			continue;
		}

1310
		switch (*bmc) {
1311 1312
		case 0:
			bitmap_file_set_bit(bitmap, offset);
1313
			bitmap_count_page(&bitmap->counts, offset, 1);
1314 1315 1316 1317
			/* fall through */
		case 1:
			*bmc = 2;
		}
1318

1319 1320
		(*bmc)++;

1321
		spin_unlock_irq(&bitmap->counts.lock);
1322 1323 1324 1325

		offset += blocks;
		if (sectors > blocks)
			sectors -= blocks;
1326 1327
		else
			sectors = 0;
1328 1329 1330
	}
	return 0;
}
1331
EXPORT_SYMBOL(bitmap_startwrite);
1332 1333

void bitmap_endwrite(struct bitmap *bitmap, sector_t offset, unsigned long sectors,
1334
		     int success, int behind)
1335
{
1336 1337
	if (!bitmap)
		return;
1338
	if (behind) {
1339 1340
		if (atomic_dec_and_test(&bitmap->behind_writes))
			wake_up(&bitmap->behind_wait);
1341 1342 1343
		pr_debug("dec write-behind count %d/%lu\n",
			 atomic_read(&bitmap->behind_writes),
			 bitmap->mddev->bitmap_info.max_write_behind);
1344 1345
	}

1346
	while (sectors) {
N
NeilBrown 已提交
1347
		sector_t blocks;
1348 1349 1350
		unsigned long flags;
		bitmap_counter_t *bmc;

1351 1352
		spin_lock_irqsave(&bitmap->counts.lock, flags);
		bmc = bitmap_get_counter(&bitmap->counts, offset, &blocks, 0);
1353
		if (!bmc) {
1354
			spin_unlock_irqrestore(&bitmap->counts.lock, flags);
1355 1356 1357
			return;
		}

1358
		if (success && !bitmap->mddev->degraded &&
1359 1360 1361
		    bitmap->events_cleared < bitmap->mddev->events) {
			bitmap->events_cleared = bitmap->mddev->events;
			bitmap->need_sync = 1;
1362
			sysfs_notify_dirent_safe(bitmap->sysfs_can_clear);
1363 1364
		}

1365
		if (!success && !NEEDED(*bmc))
1366 1367
			*bmc |= NEEDED_MASK;

1368
		if (COUNTER(*bmc) == COUNTER_MAX)
1369 1370
			wake_up(&bitmap->overflow_wait);

1371
		(*bmc)--;
1372
		if (*bmc <= 2) {
1373
			bitmap_set_pending(&bitmap->counts, offset);
1374 1375
			bitmap->allclean = 0;
		}
1376
		spin_unlock_irqrestore(&bitmap->counts.lock, flags);
1377 1378 1379
		offset += blocks;
		if (sectors > blocks)
			sectors -= blocks;
1380 1381
		else
			sectors = 0;
1382 1383
	}
}
1384
EXPORT_SYMBOL(bitmap_endwrite);
1385

N
NeilBrown 已提交
1386
static int __bitmap_start_sync(struct bitmap *bitmap, sector_t offset, sector_t *blocks,
1387
			       int degraded)
1388 1389 1390 1391 1392 1393 1394
{
	bitmap_counter_t *bmc;
	int rv;
	if (bitmap == NULL) {/* FIXME or bitmap set as 'failed' */
		*blocks = 1024;
		return 1; /* always resync if no bitmap */
	}
1395 1396
	spin_lock_irq(&bitmap->counts.lock);
	bmc = bitmap_get_counter(&bitmap->counts, offset, blocks, 0);
1397 1398 1399 1400 1401 1402 1403
	rv = 0;
	if (bmc) {
		/* locked */
		if (RESYNC(*bmc))
			rv = 1;
		else if (NEEDED(*bmc)) {
			rv = 1;
1404 1405 1406 1407
			if (!degraded) { /* don't set/clear bits if degraded */
				*bmc |= RESYNC_MASK;
				*bmc &= ~NEEDED_MASK;
			}
1408 1409
		}
	}
1410
	spin_unlock_irq(&bitmap->counts.lock);
1411 1412 1413
	return rv;
}

N
NeilBrown 已提交
1414
int bitmap_start_sync(struct bitmap *bitmap, sector_t offset, sector_t *blocks,
1415 1416 1417 1418 1419 1420 1421 1422 1423 1424
		      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 已提交
1425
	sector_t blocks1;
1426 1427 1428 1429 1430 1431 1432 1433 1434 1435

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

N
NeilBrown 已提交
1438
void bitmap_end_sync(struct bitmap *bitmap, sector_t offset, sector_t *blocks, int aborted)
1439 1440 1441
{
	bitmap_counter_t *bmc;
	unsigned long flags;
1442 1443

	if (bitmap == NULL) {
1444 1445 1446
		*blocks = 1024;
		return;
	}
1447 1448
	spin_lock_irqsave(&bitmap->counts.lock, flags);
	bmc = bitmap_get_counter(&bitmap->counts, offset, blocks, 0);
1449 1450 1451 1452 1453 1454 1455 1456 1457
	if (bmc == NULL)
		goto unlock;
	/* locked */
	if (RESYNC(*bmc)) {
		*bmc &= ~RESYNC_MASK;

		if (!NEEDED(*bmc) && aborted)
			*bmc |= NEEDED_MASK;
		else {
1458
			if (*bmc <= 2) {
1459
				bitmap_set_pending(&bitmap->counts, offset);
1460 1461
				bitmap->allclean = 0;
			}
1462 1463 1464
		}
	}
 unlock:
1465
	spin_unlock_irqrestore(&bitmap->counts.lock, flags);
1466
}
1467
EXPORT_SYMBOL(bitmap_end_sync);
1468 1469 1470 1471 1472 1473 1474 1475

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 已提交
1476
	sector_t blocks;
N
NeilBrown 已提交
1477 1478
	if (!bitmap)
		return;
1479 1480
	while (sector < bitmap->mddev->resync_max_sectors) {
		bitmap_end_sync(bitmap, sector, &blocks, 0);
N
NeilBrown 已提交
1481 1482 1483
		sector += blocks;
	}
}
1484
EXPORT_SYMBOL(bitmap_close_sync);
N
NeilBrown 已提交
1485 1486 1487 1488

void bitmap_cond_end_sync(struct bitmap *bitmap, sector_t sector)
{
	sector_t s = 0;
N
NeilBrown 已提交
1489
	sector_t blocks;
N
NeilBrown 已提交
1490 1491 1492 1493 1494 1495 1496 1497

	if (!bitmap)
		return;
	if (sector == 0) {
		bitmap->last_end_sync = jiffies;
		return;
	}
	if (time_before(jiffies, (bitmap->last_end_sync
1498
				  + bitmap->mddev->bitmap_info.daemon_sleep)))
N
NeilBrown 已提交
1499 1500 1501 1502
		return;
	wait_event(bitmap->mddev->recovery_wait,
		   atomic_read(&bitmap->mddev->recovery_active) == 0);

1503
	bitmap->mddev->curr_resync_completed = sector;
1504
	set_bit(MD_CHANGE_CLEAN, &bitmap->mddev->flags);
1505
	sector &= ~((1ULL << bitmap->counts.chunkshift) - 1);
N
NeilBrown 已提交
1506 1507 1508 1509
	s = 0;
	while (s < sector && s < bitmap->mddev->resync_max_sectors) {
		bitmap_end_sync(bitmap, s, &blocks, 0);
		s += blocks;
1510
	}
N
NeilBrown 已提交
1511
	bitmap->last_end_sync = jiffies;
1512
	sysfs_notify(&bitmap->mddev->kobj, NULL, "sync_completed");
1513
}
1514
EXPORT_SYMBOL(bitmap_cond_end_sync);
1515

1516
static void bitmap_set_memory_bits(struct bitmap *bitmap, sector_t offset, int needed)
1517 1518
{
	/* For each chunk covered by any of these sectors, set the
1519
	 * counter to 2 and possibly set resync_needed.  They should all
1520 1521
	 * be 0 at this point
	 */
1522

N
NeilBrown 已提交
1523
	sector_t secs;
1524
	bitmap_counter_t *bmc;
1525 1526
	spin_lock_irq(&bitmap->counts.lock);
	bmc = bitmap_get_counter(&bitmap->counts, offset, &secs, 1);
1527
	if (!bmc) {
1528
		spin_unlock_irq(&bitmap->counts.lock);
1529
		return;
1530
	}
1531
	if (!*bmc) {
1532
		*bmc = 2 | (needed ? NEEDED_MASK : 0);
1533 1534
		bitmap_count_page(&bitmap->counts, offset, 1);
		bitmap_set_pending(&bitmap->counts, offset);
1535
		bitmap->allclean = 0;
1536
	}
1537
	spin_unlock_irq(&bitmap->counts.lock);
1538 1539
}

1540 1541 1542 1543 1544 1545
/* 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++) {
1546
		sector_t sec = (sector_t)chunk << bitmap->counts.chunkshift;
1547 1548
		bitmap_set_memory_bits(bitmap, sec, 1);
		bitmap_file_set_bit(bitmap, sec);
1549 1550 1551 1552 1553 1554
		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;
1555 1556 1557
	}
}

1558 1559 1560
/*
 * flush out any pending updates
 */
1561
void bitmap_flush(struct mddev *mddev)
1562 1563
{
	struct bitmap *bitmap = mddev->bitmap;
1564
	long sleep;
1565 1566 1567 1568 1569 1570 1571

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

	/* run the daemon_work three time to ensure everything is flushed
	 * that can be
	 */
1572
	sleep = mddev->bitmap_info.daemon_sleep * 2;
1573
	bitmap->daemon_lastrun -= sleep;
1574
	bitmap_daemon_work(mddev);
1575
	bitmap->daemon_lastrun -= sleep;
1576
	bitmap_daemon_work(mddev);
1577
	bitmap->daemon_lastrun -= sleep;
1578
	bitmap_daemon_work(mddev);
1579 1580 1581
	bitmap_update_sb(bitmap);
}

1582 1583 1584
/*
 * free memory that was allocated
 */
1585
static void bitmap_free(struct bitmap *bitmap)
1586 1587 1588 1589 1590 1591 1592
{
	unsigned long k, pages;
	struct bitmap_page *bp;

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

1593 1594 1595 1596 1597 1598
	/* 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);
1599

1600 1601
	bp = bitmap->counts.bp;
	pages = bitmap->counts.pages;
1602 1603 1604 1605 1606 1607 1608 1609 1610 1611

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

1613
void bitmap_destroy(struct mddev *mddev)
1614 1615 1616 1617 1618 1619
{
	struct bitmap *bitmap = mddev->bitmap;

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

1620
	mutex_lock(&mddev->bitmap_info.mutex);
1621
	mddev->bitmap = NULL; /* disconnect from the md device */
1622
	mutex_unlock(&mddev->bitmap_info.mutex);
1623 1624
	if (mddev->thread)
		mddev->thread->timeout = MAX_SCHEDULE_TIMEOUT;
1625

1626 1627 1628
	if (bitmap->sysfs_can_clear)
		sysfs_put(bitmap->sysfs_can_clear);

1629 1630
	bitmap_free(bitmap);
}
1631 1632 1633 1634 1635

/*
 * initialize the bitmap structure
 * if this returns an error, bitmap_destroy must be called to do clean up
 */
1636
int bitmap_create(struct mddev *mddev)
1637 1638
{
	struct bitmap *bitmap;
1639
	sector_t blocks = mddev->resync_max_sectors;
1640
	struct file *file = mddev->bitmap_info.file;
1641
	int err;
1642
	struct sysfs_dirent *bm = NULL;
1643

A
Alexey Dobriyan 已提交
1644
	BUILD_BUG_ON(sizeof(bitmap_super_t) != 256);
1645

1646
	BUG_ON(file && mddev->bitmap_info.offset);
1647

1648
	bitmap = kzalloc(sizeof(*bitmap), GFP_KERNEL);
1649 1650 1651
	if (!bitmap)
		return -ENOMEM;

1652
	spin_lock_init(&bitmap->counts.lock);
1653 1654
	atomic_set(&bitmap->pending_writes, 0);
	init_waitqueue_head(&bitmap->write_wait);
1655
	init_waitqueue_head(&bitmap->overflow_wait);
1656
	init_waitqueue_head(&bitmap->behind_wait);
1657

1658 1659
	bitmap->mddev = mddev;

1660 1661
	if (mddev->kobj.sd)
		bm = sysfs_get_dirent(mddev->kobj.sd, NULL, "bitmap");
1662
	if (bm) {
1663
		bitmap->sysfs_can_clear = sysfs_get_dirent(bm, NULL, "can_clear");
1664 1665 1666 1667
		sysfs_put(bm);
	} else
		bitmap->sysfs_can_clear = NULL;

1668
	bitmap->storage.file = file;
1669 1670
	if (file) {
		get_file(file);
1671 1672 1673 1674
		/* As future accesses to this file will use bmap,
		 * and bypass the page cache, we must sync the file
		 * first.
		 */
1675
		vfs_fsync(file, 1);
1676
	}
1677
	/* read superblock from bitmap file (this sets mddev->bitmap_info.chunksize) */
1678 1679 1680 1681 1682 1683 1684 1685 1686 1687
	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 {
1688 1689 1690 1691 1692 1693 1694
		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;
	}
1695
	if (err)
1696
		goto error;
1697

1698
	bitmap->daemon_lastrun = jiffies;
1699 1700
	err = bitmap_resize(bitmap, blocks, mddev->bitmap_info.chunksize, 1);
	if (err)
1701
		goto error;
1702

1703
	printk(KERN_INFO "created bitmap (%lu pages) for device %s\n",
1704
	       bitmap->counts.pages, bmname(bitmap));
1705 1706

	mddev->bitmap = bitmap;
1707
	return test_bit(BITMAP_WRITE_ERROR, &bitmap->flags) ? -EIO : 0;
1708 1709 1710 1711 1712 1713

 error:
	bitmap_free(bitmap);
	return err;
}

1714
int bitmap_load(struct mddev *mddev)
1715 1716
{
	int err = 0;
1717
	sector_t start = 0;
1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729
	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 已提交
1730
		sector_t blocks;
1731 1732 1733 1734 1735
		bitmap_start_sync(bitmap, sector, &blocks, 0);
		sector += blocks;
	}
	bitmap_close_sync(bitmap);

1736 1737 1738 1739 1740 1741
	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;

1742
	mutex_lock(&mddev->bitmap_info.mutex);
1743
	err = bitmap_init_from_disk(bitmap, start);
1744
	mutex_unlock(&mddev->bitmap_info.mutex);
1745

1746
	if (err)
1747
		goto out;
1748
	clear_bit(BITMAP_STALE, &bitmap->flags);
1749 1750 1751

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

1753
	mddev->thread->timeout = mddev->bitmap_info.daemon_sleep;
1754
	md_wakeup_thread(mddev->thread);
1755

1756 1757
	bitmap_update_sb(bitmap);

1758
	if (test_bit(BITMAP_WRITE_ERROR, &bitmap->flags))
1759 1760
		err = -EIO;
out:
1761
	return err;
1762
}
1763
EXPORT_SYMBOL_GPL(bitmap_load);
1764

1765 1766 1767
void bitmap_status(struct seq_file *seq, struct bitmap *bitmap)
{
	unsigned long chunk_kb;
1768
	struct bitmap_counts *counts;
1769 1770 1771 1772

	if (!bitmap)
		return;

1773 1774
	counts = &bitmap->counts;

1775 1776 1777
	chunk_kb = bitmap->mddev->bitmap_info.chunksize >> 10;
	seq_printf(seq, "bitmap: %lu/%lu pages [%luKB], "
		   "%lu%s chunk",
1778 1779 1780
		   counts->pages - counts->missing_pages,
		   counts->pages,
		   (counts->pages - counts->missing_pages)
1781 1782 1783
		   << (PAGE_SHIFT - 10),
		   chunk_kb ? chunk_kb : bitmap->mddev->bitmap_info.chunksize,
		   chunk_kb ? "KB" : "B");
1784
	if (bitmap->storage.file) {
1785
		seq_printf(seq, ", file: ");
1786
		seq_path(seq, &bitmap->storage.file->f_path, " \t\n");
1787 1788 1789 1790 1791
	}

	seq_printf(seq, "\n");
}

1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 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 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955
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;

	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,
					   !bitmap->mddev->bitmap_info.external);
	if (ret)
		goto err;

	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),
		       sizeof(bitmap_super_t));
	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);
	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);

1956
static ssize_t
1957
location_show(struct mddev *mddev, char *page)
1958 1959
{
	ssize_t len;
1960
	if (mddev->bitmap_info.file)
1961
		len = sprintf(page, "file");
1962
	else if (mddev->bitmap_info.offset)
1963
		len = sprintf(page, "%+lld", (long long)mddev->bitmap_info.offset);
1964
	else
1965 1966 1967 1968 1969 1970
		len = sprintf(page, "none");
	len += sprintf(page+len, "\n");
	return len;
}

static ssize_t
1971
location_store(struct mddev *mddev, const char *buf, size_t len)
1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 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
{

	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;
2016 2017
			if (mddev->bitmap_info.external == 0 &&
			    mddev->major_version == 0 &&
2018 2019 2020 2021 2022 2023
			    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);
2024 2025
				if (!rv)
					rv = bitmap_load(mddev);
2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048
				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);

2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072
/* '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 &&
2073
	    sectors < (mddev->bitmap->storage.bytes + 511) >> 9)
2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085
		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);

2086
static ssize_t
2087
timeout_show(struct mddev *mddev, char *page)
2088 2089 2090 2091
{
	ssize_t len;
	unsigned long secs = mddev->bitmap_info.daemon_sleep / HZ;
	unsigned long jifs = mddev->bitmap_info.daemon_sleep % HZ;
2092

2093 2094 2095 2096 2097 2098 2099 2100
	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
2101
timeout_store(struct mddev *mddev, const char *buf, size_t len)
2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136
{
	/* 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
2137
backlog_show(struct mddev *mddev, char *page)
2138 2139 2140 2141 2142
{
	return sprintf(page, "%lu\n", mddev->bitmap_info.max_write_behind);
}

static ssize_t
2143
backlog_store(struct mddev *mddev, const char *buf, size_t len)
2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158
{
	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
2159
chunksize_show(struct mddev *mddev, char *page)
2160 2161 2162 2163 2164
{
	return sprintf(page, "%lu\n", mddev->bitmap_info.chunksize);
}

static ssize_t
2165
chunksize_store(struct mddev *mddev, const char *buf, size_t len)
2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184
{
	/* 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);

2185
static ssize_t metadata_show(struct mddev *mddev, char *page)
2186 2187 2188 2189 2190
{
	return sprintf(page, "%s\n", (mddev->bitmap_info.external
				      ? "external" : "internal"));
}

2191
static ssize_t metadata_store(struct mddev *mddev, const char *buf, size_t len)
2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208
{
	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);

2209
static ssize_t can_clear_show(struct mddev *mddev, char *page)
2210 2211 2212 2213 2214 2215 2216 2217 2218 2219
{
	int len;
	if (mddev->bitmap)
		len = sprintf(page, "%s\n", (mddev->bitmap->need_sync ?
					     "false" : "true"));
	else
		len = sprintf(page, "\n");
	return len;
}

2220
static ssize_t can_clear_store(struct mddev *mddev, const char *buf, size_t len)
2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237
{
	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);

2238
static ssize_t
2239
behind_writes_used_show(struct mddev *mddev, char *page)
2240 2241 2242 2243 2244 2245 2246 2247
{
	if (mddev->bitmap == NULL)
		return sprintf(page, "0\n");
	return sprintf(page, "%lu\n",
		       mddev->bitmap->behind_writes_used);
}

static ssize_t
2248
behind_writes_used_reset(struct mddev *mddev, const char *buf, size_t len)
2249 2250 2251 2252 2253 2254 2255 2256 2257 2258
{
	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);

2259 2260
static struct attribute *md_bitmap_attrs[] = {
	&bitmap_location.attr,
2261
	&bitmap_space.attr,
2262 2263 2264
	&bitmap_timeout.attr,
	&bitmap_backlog.attr,
	&bitmap_chunksize.attr,
2265 2266
	&bitmap_metadata.attr,
	&bitmap_can_clear.attr,
2267
	&max_backlog_used.attr,
2268 2269 2270 2271 2272 2273 2274
	NULL
};
struct attribute_group md_bitmap_group = {
	.name = "bitmap",
	.attrs = md_bitmap_attrs,
};