bitmap.c 59.5 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;
A
Al Viro 已提交
340
	struct inode *inode = file_inode(file);
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
/*
 * 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;

474
	bitmap->storage.sb_page = alloc_page(GFP_KERNEL);
475 476
	if (bitmap->storage.sb_page == NULL)
		return -ENOMEM;
477
	bitmap->storage.sb_page->index = 0;
478

479
	sb = kmap_atomic(bitmap->storage.sb_page);
480 481 482 483 484 485 486

	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)) {
487
		kunmap_atomic(sb);
488 489 490 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
		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);

517
	set_bit(BITMAP_STALE, &bitmap->flags);
518
	sb->state = cpu_to_le32(bitmap->flags);
519 520 521
	bitmap->events_cleared = bitmap->mddev->events;
	sb->events_cleared = cpu_to_le64(bitmap->mddev->events);

522
	kunmap_atomic(sb);
523 524 525 526

	return 0;
}

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

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

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

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

567
	sb = kmap_atomic(sb_page);
568 569

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

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

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

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

/*
 * general bitmap file operations
 */

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

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

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

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

737
static void bitmap_file_unmap(struct bitmap_storage *store)
738 739 740
{
	struct page **map, *sb_page;
	int pages;
741
	struct file *file;
742

743
	file = store->file;
744 745 746
	map = store->filemap;
	pages = store->file_pages;
	sb_page = store->sb_page;
747 748

	while (pages--)
749
		if (map[pages] != sb_page) /* 0 is sb_page, release it below */
750
			free_buffers(map[pages]);
751
	kfree(map);
752
	kfree(store->filemap_attr);
753

754 755
	if (sb_page)
		free_buffers(sb_page);
756

757
	if (file) {
A
Al Viro 已提交
758
		struct inode *inode = file_inode(file);
759
		invalidate_mapping_pages(inode->i_mapping, 0, -1);
760
		fput(file);
761
	}
762 763 764 765 766 767 768 769 770 771 772
}

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

773
	if (!test_and_set_bit(BITMAP_STALE, &bitmap->flags)) {
774
		bitmap_update_sb(bitmap);
775

776
		if (bitmap->storage.file) {
777 778
			path = kmalloc(PAGE_SIZE, GFP_KERNEL);
			if (path)
779 780
				ptr = d_path(&bitmap->storage.file->f_path,
					     path, PAGE_SIZE);
C
Christoph Hellwig 已提交
781

782 783
			printk(KERN_ALERT
			      "%s: kicking failed bitmap file %s from array!\n",
C
Christoph Hellwig 已提交
784
			      bmname(bitmap), IS_ERR(ptr) ? "" : ptr);
785

786 787 788 789 790
			kfree(path);
		} else
			printk(KERN_ALERT
			       "%s: disabling internal bitmap due to errors\n",
			       bmname(bitmap));
791
	}
792 793 794
}

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

801 802
static inline void set_page_attr(struct bitmap *bitmap, int pnum,
				 enum bitmap_page_attr attr)
803
{
804
	set_bit((pnum<<2) + attr, bitmap->storage.filemap_attr);
805 806
}

807 808
static inline void clear_page_attr(struct bitmap *bitmap, int pnum,
				   enum bitmap_page_attr attr)
809
{
810
	clear_bit((pnum<<2) + attr, bitmap->storage.filemap_attr);
811 812
}

813 814
static inline int test_page_attr(struct bitmap *bitmap, int pnum,
				 enum bitmap_page_attr attr)
815
{
816
	return test_bit((pnum<<2) + attr, bitmap->storage.filemap_attr);
817 818
}

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

839
	page = filemap_get_page(&bitmap->storage, chunk);
840 841
	if (!page)
		return;
842
	bit = file_page_offset(&bitmap->storage, chunk);
843

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

856 857 858 859 860
static void bitmap_file_clear_bit(struct bitmap *bitmap, sector_t block)
{
	unsigned long bit;
	struct page *page;
	void *paddr;
861
	unsigned long chunk = block >> bitmap->counts.chunkshift;
862

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

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

888 889
	if (!bitmap || !bitmap->storage.filemap ||
	    test_bit(BITMAP_STALE, &bitmap->flags))
890
		return;
891 892 893

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

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

943
	chunks = bitmap->counts.chunks;
944
	file = store->file;
945

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

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

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

974
	oldindex = ~0L;
975
	offset = 0;
976
	if (!bitmap->mddev->bitmap_info.external)
977
		offset = sizeof(bitmap_super_t);
978 979

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

1004 1005 1006 1007 1008
			oldindex = index;

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

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

	printk(KERN_INFO "%s: bitmap initialized from disk: "
1042
	       "read %lu pages, set %lu of %lu bits\n",
1043
	       bmname(bitmap), store->file_pages,
1044
	       bit_cnt, chunks);
1045 1046

	return 0;
1047

1048 1049 1050
 err:
	printk(KERN_INFO "%s: bitmap initialisation failed: %d\n",
	       bmname(bitmap), ret);
1051 1052 1053
	return ret;
}

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

1061
	if (!bitmap || !bitmap->storage.filemap)
1062
		return;
1063
	if (bitmap->storage.file)
1064 1065 1066
		/* Only one copy, so nothing needed */
		return;

1067
	for (i = 0; i < bitmap->storage.file_pages; i++)
1068
		set_page_attr(bitmap, i,
1069
			      BITMAP_PAGE_NEEDWRITE);
1070
	bitmap->allclean = 0;
1071 1072
}

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

1082
static void bitmap_set_pending(struct bitmap_counts *bitmap, sector_t offset)
1083 1084 1085 1086 1087 1088 1089 1090 1091
{
	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;
}

1092
static bitmap_counter_t *bitmap_get_counter(struct bitmap_counts *bitmap,
N
NeilBrown 已提交
1093
					    sector_t offset, sector_t *blocks,
1094 1095 1096 1097 1098 1099 1100
					    int create);

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

1101
void bitmap_daemon_work(struct mddev *mddev)
1102
{
1103
	struct bitmap *bitmap;
1104
	unsigned long j;
1105
	unsigned long nextpage;
N
NeilBrown 已提交
1106
	sector_t blocks;
1107
	struct bitmap_counts *counts;
1108

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

1122
	bitmap->daemon_lastrun = jiffies;
1123
	if (bitmap->allclean) {
N
NeilBrown 已提交
1124
		mddev->thread->timeout = MAX_SCHEDULE_TIMEOUT;
1125
		goto done;
1126 1127
	}
	bitmap->allclean = 1;
1128

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

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

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

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

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

1216
 done:
1217
	if (bitmap->allclean == 0)
N
NeilBrown 已提交
1218 1219
		mddev->thread->timeout =
			mddev->bitmap_info.daemon_sleep;
1220
	mutex_unlock(&mddev->bitmap_info.mutex);
1221 1222
}

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

1239 1240 1241 1242
	err = bitmap_checkpage(bitmap, page, create);

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

	if (err < 0)
1250
		return NULL;
1251

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

1265
int bitmap_startwrite(struct bitmap *bitmap, sector_t offset, unsigned long sectors, int behind)
1266
{
1267 1268
	if (!bitmap)
		return 0;
1269 1270

	if (behind) {
1271
		int bw;
1272
		atomic_inc(&bitmap->behind_writes);
1273 1274 1275 1276
		bw = atomic_read(&bitmap->behind_writes);
		if (bw > bitmap->behind_writes_used)
			bitmap->behind_writes_used = bw;

1277 1278
		pr_debug("inc write-behind count %d/%lu\n",
			 bw, bitmap->mddev->bitmap_info.max_write_behind);
1279 1280
	}

1281
	while (sectors) {
N
NeilBrown 已提交
1282
		sector_t blocks;
1283 1284
		bitmap_counter_t *bmc;

1285 1286
		spin_lock_irq(&bitmap->counts.lock);
		bmc = bitmap_get_counter(&bitmap->counts, offset, &blocks, 1);
1287
		if (!bmc) {
1288
			spin_unlock_irq(&bitmap->counts.lock);
1289 1290 1291
			return 0;
		}

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

1306
		switch (*bmc) {
1307 1308
		case 0:
			bitmap_file_set_bit(bitmap, offset);
1309
			bitmap_count_page(&bitmap->counts, offset, 1);
1310 1311 1312 1313
			/* fall through */
		case 1:
			*bmc = 2;
		}
1314

1315 1316
		(*bmc)++;

1317
		spin_unlock_irq(&bitmap->counts.lock);
1318 1319 1320 1321

		offset += blocks;
		if (sectors > blocks)
			sectors -= blocks;
1322 1323
		else
			sectors = 0;
1324 1325 1326
	}
	return 0;
}
1327
EXPORT_SYMBOL(bitmap_startwrite);
1328 1329

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

1342
	while (sectors) {
N
NeilBrown 已提交
1343
		sector_t blocks;
1344 1345 1346
		unsigned long flags;
		bitmap_counter_t *bmc;

1347 1348
		spin_lock_irqsave(&bitmap->counts.lock, flags);
		bmc = bitmap_get_counter(&bitmap->counts, offset, &blocks, 0);
1349
		if (!bmc) {
1350
			spin_unlock_irqrestore(&bitmap->counts.lock, flags);
1351 1352 1353
			return;
		}

1354
		if (success && !bitmap->mddev->degraded &&
1355 1356 1357
		    bitmap->events_cleared < bitmap->mddev->events) {
			bitmap->events_cleared = bitmap->mddev->events;
			bitmap->need_sync = 1;
1358
			sysfs_notify_dirent_safe(bitmap->sysfs_can_clear);
1359 1360
		}

1361
		if (!success && !NEEDED(*bmc))
1362 1363
			*bmc |= NEEDED_MASK;

1364
		if (COUNTER(*bmc) == COUNTER_MAX)
1365 1366
			wake_up(&bitmap->overflow_wait);

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

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

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

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

N
NeilBrown 已提交
1434
void bitmap_end_sync(struct bitmap *bitmap, sector_t offset, sector_t *blocks, int aborted)
1435 1436 1437
{
	bitmap_counter_t *bmc;
	unsigned long flags;
1438 1439

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

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

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

void bitmap_cond_end_sync(struct bitmap *bitmap, sector_t sector)
{
	sector_t s = 0;
N
NeilBrown 已提交
1485
	sector_t blocks;
N
NeilBrown 已提交
1486 1487 1488 1489 1490 1491 1492 1493

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

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

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

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

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

1554 1555 1556
/*
 * flush out any pending updates
 */
1557
void bitmap_flush(struct mddev *mddev)
1558 1559
{
	struct bitmap *bitmap = mddev->bitmap;
1560
	long sleep;
1561 1562 1563 1564 1565 1566 1567

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

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

1578 1579 1580
/*
 * free memory that was allocated
 */
1581
static void bitmap_free(struct bitmap *bitmap)
1582 1583 1584 1585 1586 1587 1588
{
	unsigned long k, pages;
	struct bitmap_page *bp;

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

1589 1590 1591 1592 1593 1594
	/* 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);
1595

1596 1597
	bp = bitmap->counts.bp;
	pages = bitmap->counts.pages;
1598 1599 1600 1601 1602 1603 1604 1605 1606 1607

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

1609
void bitmap_destroy(struct mddev *mddev)
1610 1611 1612 1613 1614 1615
{
	struct bitmap *bitmap = mddev->bitmap;

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

1616
	mutex_lock(&mddev->bitmap_info.mutex);
1617
	mddev->bitmap = NULL; /* disconnect from the md device */
1618
	mutex_unlock(&mddev->bitmap_info.mutex);
1619 1620
	if (mddev->thread)
		mddev->thread->timeout = MAX_SCHEDULE_TIMEOUT;
1621

1622 1623 1624
	if (bitmap->sysfs_can_clear)
		sysfs_put(bitmap->sysfs_can_clear);

1625 1626
	bitmap_free(bitmap);
}
1627 1628 1629 1630 1631

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

A
Alexey Dobriyan 已提交
1640
	BUILD_BUG_ON(sizeof(bitmap_super_t) != 256);
1641

1642
	BUG_ON(file && mddev->bitmap_info.offset);
1643

1644
	bitmap = kzalloc(sizeof(*bitmap), GFP_KERNEL);
1645 1646 1647
	if (!bitmap)
		return -ENOMEM;

1648
	spin_lock_init(&bitmap->counts.lock);
1649 1650
	atomic_set(&bitmap->pending_writes, 0);
	init_waitqueue_head(&bitmap->write_wait);
1651
	init_waitqueue_head(&bitmap->overflow_wait);
1652
	init_waitqueue_head(&bitmap->behind_wait);
1653

1654 1655
	bitmap->mddev = mddev;

1656
	if (mddev->kobj.sd)
T
Tejun Heo 已提交
1657
		bm = sysfs_get_dirent(mddev->kobj.sd, "bitmap");
1658
	if (bm) {
T
Tejun Heo 已提交
1659
		bitmap->sysfs_can_clear = sysfs_get_dirent(bm, "can_clear");
1660 1661 1662 1663
		sysfs_put(bm);
	} else
		bitmap->sysfs_can_clear = NULL;

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

1694
	bitmap->daemon_lastrun = jiffies;
1695 1696
	err = bitmap_resize(bitmap, blocks, mddev->bitmap_info.chunksize, 1);
	if (err)
1697
		goto error;
1698

1699
	printk(KERN_INFO "created bitmap (%lu pages) for device %s\n",
1700
	       bitmap->counts.pages, bmname(bitmap));
1701 1702

	mddev->bitmap = bitmap;
1703
	return test_bit(BITMAP_WRITE_ERROR, &bitmap->flags) ? -EIO : 0;
1704 1705 1706 1707 1708 1709

 error:
	bitmap_free(bitmap);
	return err;
}

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

1732 1733 1734 1735 1736 1737
	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;

1738
	mutex_lock(&mddev->bitmap_info.mutex);
1739
	err = bitmap_init_from_disk(bitmap, start);
1740
	mutex_unlock(&mddev->bitmap_info.mutex);
1741

1742
	if (err)
1743
		goto out;
1744
	clear_bit(BITMAP_STALE, &bitmap->flags);
1745 1746 1747

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

1749
	mddev->thread->timeout = mddev->bitmap_info.daemon_sleep;
1750
	md_wakeup_thread(mddev->thread);
1751

1752 1753
	bitmap_update_sb(bitmap);

1754
	if (test_bit(BITMAP_WRITE_ERROR, &bitmap->flags))
1755 1756
		err = -EIO;
out:
1757
	return err;
1758
}
1759
EXPORT_SYMBOL_GPL(bitmap_load);
1760

1761 1762 1763
void bitmap_status(struct seq_file *seq, struct bitmap *bitmap)
{
	unsigned long chunk_kb;
1764
	struct bitmap_counts *counts;
1765 1766 1767 1768

	if (!bitmap)
		return;

1769 1770
	counts = &bitmap->counts;

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

	seq_printf(seq, "\n");
}

1788 1789 1790 1791 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
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);

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

static ssize_t
1967
location_store(struct mddev *mddev, const char *buf, size_t len)
1968 1969 1970 1971 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
{

	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] == '+')
2005
				rv = kstrtoll(buf+1, 10, &offset);
2006
			else
2007
				rv = kstrtoll(buf, 10, &offset);
2008 2009 2010 2011
			if (rv)
				return rv;
			if (offset == 0)
				return -EINVAL;
2012 2013
			if (mddev->bitmap_info.external == 0 &&
			    mddev->major_version == 0 &&
2014 2015 2016 2017 2018 2019
			    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);
2020 2021
				if (!rv)
					rv = bitmap_load(mddev);
2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044
				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);

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

2082
static ssize_t
2083
timeout_show(struct mddev *mddev, char *page)
2084 2085 2086 2087
{
	ssize_t len;
	unsigned long secs = mddev->bitmap_info.daemon_sleep / HZ;
	unsigned long jifs = mddev->bitmap_info.daemon_sleep % HZ;
2088

2089 2090 2091 2092 2093 2094 2095 2096
	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
2097
timeout_store(struct mddev *mddev, const char *buf, size_t len)
2098 2099 2100 2101 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
{
	/* 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
2133
backlog_show(struct mddev *mddev, char *page)
2134 2135 2136 2137 2138
{
	return sprintf(page, "%lu\n", mddev->bitmap_info.max_write_behind);
}

static ssize_t
2139
backlog_store(struct mddev *mddev, const char *buf, size_t len)
2140 2141
{
	unsigned long backlog;
2142
	int rv = kstrtoul(buf, 10, &backlog);
2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154
	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
2155
chunksize_show(struct mddev *mddev, char *page)
2156 2157 2158 2159 2160
{
	return sprintf(page, "%lu\n", mddev->bitmap_info.chunksize);
}

static ssize_t
2161
chunksize_store(struct mddev *mddev, const char *buf, size_t len)
2162 2163 2164 2165 2166 2167
{
	/* Can only be changed when no bitmap is active */
	int rv;
	unsigned long csize;
	if (mddev->bitmap)
		return -EBUSY;
2168
	rv = kstrtoul(buf, 10, &csize);
2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180
	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);

2181
static ssize_t metadata_show(struct mddev *mddev, char *page)
2182 2183 2184 2185 2186
{
	return sprintf(page, "%s\n", (mddev->bitmap_info.external
				      ? "external" : "internal"));
}

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

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

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

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

static ssize_t
2244
behind_writes_used_reset(struct mddev *mddev, const char *buf, size_t len)
2245 2246 2247 2248 2249 2250 2251 2252 2253 2254
{
	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);

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