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

	if (mappage == NULL) {
92
		pr_debug("md/bitmap: map page allocation failed, hijacking\n");
93 94 95 96
		/* 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;
97 98
	} else if (bitmap->bp[page].map ||
		   bitmap->bp[page].hijacked) {
99
		/* somebody beat us to getting the page */
100
		kfree(mappage);
101
		return 0;
102
	} else {
103

104
		/* no page was in place and we have one, so install it */
105

106 107 108
		bitmap->bp[page].map = mappage;
		bitmap->missing_pages--;
	}
109 110 111 112 113 114
	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 */
115
static void bitmap_checkfree(struct bitmap_counts *bitmap, unsigned long page)
116 117 118 119 120 121 122 123 124 125 126
{
	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;
127 128 129 130 131
	} else {
		/* normal case, free the page */
		ptr = bitmap->bp[page].map;
		bitmap->bp[page].map = NULL;
		bitmap->missing_pages++;
132
		kfree(ptr);
133 134 135 136 137 138 139 140 141 142 143
	}
}

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

/*
 * basic page I/O operations
 */

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

151
	struct md_rdev *rdev;
152 153
	sector_t target;

N
NeilBrown 已提交
154
	rdev_for_each(rdev, mddev) {
155 156
		if (! test_bit(In_sync, &rdev->flags)
		    || test_bit(Faulty, &rdev->flags))
157 158
			continue;

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

161
		if (sync_page_io(rdev, target,
162
				 roundup(size, bdev_logical_block_size(rdev->bdev)),
J
Jonathan Brassow 已提交
163
				 page, READ, true)) {
164
			page->index = index;
165
			return 0;
166 167
		}
	}
168
	return -EIO;
169 170
}

171
static struct md_rdev *next_active_rdev(struct md_rdev *rdev, struct mddev *mddev)
172 173 174 175 176 177 178
{
	/* 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
179
	 * list_for_each_entry_continue_rcu.
180 181 182 183
	 */
	rcu_read_lock();
	if (rdev == NULL)
		/* start at the beginning */
184
		rdev = list_entry_rcu(&mddev->disks, struct md_rdev, same_set);
185 186 187 188
	else {
		/* release the previous rdev and start from there. */
		rdev_dec_pending(rdev, mddev);
	}
189
	list_for_each_entry_continue_rcu(rdev, &mddev->disks, same_set) {
190 191 192 193 194 195 196 197 198 199 200 201
		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;
}

202
static int write_sb_page(struct bitmap *bitmap, struct page *page, int wait)
203
{
204
	struct md_rdev *rdev = NULL;
205
	struct block_device *bdev;
206
	struct mddev *mddev = bitmap->mddev;
207
	struct bitmap_storage *store = &bitmap->storage;
208

209
	while ((rdev = next_active_rdev(rdev, mddev)) != NULL) {
210 211
		int size = PAGE_SIZE;
		loff_t offset = mddev->bitmap_info.offset;
212 213 214

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

215 216 217 218 219
		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,
220
				       bdev_logical_block_size(bdev));
221
		}
222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261
		/* 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);
262
	}
263 264

	if (wait)
265
		md_super_wait(mddev);
266
	return 0;
267 268 269

 bad_alignment:
	return -EINVAL;
270 271
}

272
static void bitmap_file_kick(struct bitmap *bitmap);
273
/*
274
 * write out a page to a file
275
 */
276
static void write_page(struct bitmap *bitmap, struct page *page, int wait)
277
{
278
	struct buffer_head *bh;
279

280
	if (bitmap->storage.file == NULL) {
281 282
		switch (write_sb_page(bitmap, page, wait)) {
		case -EINVAL:
283
			set_bit(BITMAP_WRITE_ERROR, &bitmap->flags);
284
		}
285
	} else {
286

287
		bh = page_buffers(page);
288

289 290 291 292
		while (bh && bh->b_blocknr) {
			atomic_inc(&bitmap->pending_writes);
			set_buffer_locked(bh);
			set_buffer_mapped(bh);
J
Jens Axboe 已提交
293
			submit_bh(WRITE | REQ_SYNC, bh);
294 295
			bh = bh->b_this_page;
		}
296

297
		if (wait)
298 299
			wait_event(bitmap->write_wait,
				   atomic_read(&bitmap->pending_writes)==0);
300
	}
301
	if (test_bit(BITMAP_WRITE_ERROR, &bitmap->flags))
302
		bitmap_file_kick(bitmap);
303 304 305 306 307
}

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

309 310
	if (!uptodate)
		set_bit(BITMAP_WRITE_ERROR, &bitmap->flags);
311 312 313
	if (atomic_dec_and_test(&bitmap->pending_writes))
		wake_up(&bitmap->write_wait);
}
314

315 316 317 318 319 320 321 322 323 324
/* 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)
{
325
	struct buffer_head *bh;
326

327 328 329 330
	if (!PagePrivate(page))
		return;

	bh = page_buffers(page);
331 332 333 334
	while (bh) {
		struct buffer_head *next = bh->b_this_page;
		free_buffer_head(bh);
		bh = next;
335
	}
336 337
	__clear_page_buffers(page);
	put_page(page);
338 339
}

340 341 342 343 344 345 346
/* 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.
 */
347 348 349 350
static int read_page(struct file *file, unsigned long index,
		     struct bitmap *bitmap,
		     unsigned long count,
		     struct page *page)
351
{
352
	int ret = 0;
A
Al Viro 已提交
353
	struct inode *inode = file_inode(file);
354 355
	struct buffer_head *bh;
	sector_t block;
356

357 358
	pr_debug("read bitmap file (%dB @ %llu)\n", (int)PAGE_SIZE,
		 (unsigned long long)index << PAGE_SHIFT);
359

360 361
	bh = alloc_page_buffers(page, 1<<inode->i_blkbits, 0);
	if (!bh) {
362
		ret = -ENOMEM;
363 364
		goto out;
	}
365 366 367 368 369 370 371 372 373
	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! */
374
				ret = -EINVAL;
375 376 377 378 379 380 381 382 383 384
				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;
385 386 387 388
			atomic_inc(&bitmap->pending_writes);
			set_buffer_locked(bh);
			set_buffer_mapped(bh);
			submit_bh(READ, bh);
389 390 391 392 393
		}
		block++;
		bh = bh->b_this_page;
	}
	page->index = index;
394 395 396

	wait_event(bitmap->write_wait,
		   atomic_read(&bitmap->pending_writes)==0);
397
	if (test_bit(BITMAP_WRITE_ERROR, &bitmap->flags))
398
		ret = -EIO;
399
out:
400 401
	if (ret)
		printk(KERN_ALERT "md: bitmap read error: (%dB @ %llu): %d\n",
402 403
			(int)PAGE_SIZE,
			(unsigned long long)index << PAGE_SHIFT,
404 405
			ret);
	return ret;
406 407 408 409 410 411 412
}

/*
 * bitmap file superblock operations
 */

/* update the event counter and sync the superblock to disk */
413
void bitmap_update_sb(struct bitmap *bitmap)
414 415 416 417
{
	bitmap_super_t *sb;

	if (!bitmap || !bitmap->mddev) /* no bitmap for this array */
418
		return;
419 420
	if (bitmap->mddev->bitmap_info.external)
		return;
421
	if (!bitmap->storage.sb_page) /* no superblock */
422
		return;
423
	sb = kmap_atomic(bitmap->storage.sb_page);
424
	sb->events = cpu_to_le64(bitmap->mddev->events);
425
	if (bitmap->mddev->events < bitmap->events_cleared)
426 427
		/* rocking back to read-only */
		bitmap->events_cleared = bitmap->mddev->events;
428 429
	sb->events_cleared = cpu_to_le64(bitmap->events_cleared);
	sb->state = cpu_to_le32(bitmap->flags);
430 431 432
	/* 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);
433 434 435
	/* This might have been changed by a reshape */
	sb->sync_size = cpu_to_le64(bitmap->mddev->resync_max_sectors);
	sb->chunksize = cpu_to_le32(bitmap->mddev->bitmap_info.chunksize);
G
Goldwyn Rodrigues 已提交
436
	sb->nodes = cpu_to_le32(bitmap->mddev->bitmap_info.nodes);
437 438
	sb->sectors_reserved = cpu_to_le32(bitmap->mddev->
					   bitmap_info.space);
439
	kunmap_atomic(sb);
440
	write_page(bitmap, bitmap->storage.sb_page, 1);
441 442 443 444 445 446 447
}

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

448
	if (!bitmap || !bitmap->storage.sb_page)
449
		return;
450
	sb = kmap_atomic(bitmap->storage.sb_page);
451
	printk(KERN_DEBUG "%s: bitmap file superblock:\n", bmname(bitmap));
452 453 454
	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",
455 456 457 458
					*(__u32 *)(sb->uuid+0),
					*(__u32 *)(sb->uuid+4),
					*(__u32 *)(sb->uuid+8),
					*(__u32 *)(sb->uuid+12));
459
	printk(KERN_DEBUG "        events: %llu\n",
460
			(unsigned long long) le64_to_cpu(sb->events));
461
	printk(KERN_DEBUG "events cleared: %llu\n",
462
			(unsigned long long) le64_to_cpu(sb->events_cleared));
463 464 465 466 467
	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);
468
	printk(KERN_DEBUG "max write behind: %d\n", le32_to_cpu(sb->write_behind));
469
	kunmap_atomic(sb);
470 471
}

472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487
/*
 * 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;

488
	bitmap->storage.sb_page = alloc_page(GFP_KERNEL);
489 490
	if (bitmap->storage.sb_page == NULL)
		return -ENOMEM;
491
	bitmap->storage.sb_page->index = 0;
492

493
	sb = kmap_atomic(bitmap->storage.sb_page);
494 495 496 497 498 499 500

	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)) {
501
		kunmap_atomic(sb);
502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530
		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);

531
	set_bit(BITMAP_STALE, &bitmap->flags);
532
	sb->state = cpu_to_le32(bitmap->flags);
533 534 535
	bitmap->events_cleared = bitmap->mddev->events;
	sb->events_cleared = cpu_to_le64(bitmap->mddev->events);

536
	kunmap_atomic(sb);
537 538 539 540

	return 0;
}

541 542 543 544 545
/* 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;
546
	unsigned long chunksize, daemon_sleep, write_behind;
547
	unsigned long long events;
G
Goldwyn Rodrigues 已提交
548
	int nodes = 0;
549
	unsigned long sectors_reserved = 0;
550
	int err = -EINVAL;
551
	struct page *sb_page;
552

553
	if (!bitmap->storage.file && !bitmap->mddev->bitmap_info.offset) {
554 555 556
		chunksize = 128 * 1024 * 1024;
		daemon_sleep = 5 * HZ;
		write_behind = 0;
557
		set_bit(BITMAP_STALE, &bitmap->flags);
558 559 560
		err = 0;
		goto out_no_sb;
	}
561
	/* page 0 is the superblock, read it... */
562 563 564
	sb_page = alloc_page(GFP_KERNEL);
	if (!sb_page)
		return -ENOMEM;
565
	bitmap->storage.sb_page = sb_page;
566

567 568
	if (bitmap->storage.file) {
		loff_t isize = i_size_read(bitmap->storage.file->f_mapping->host);
569 570
		int bytes = isize > PAGE_SIZE ? PAGE_SIZE : isize;

571
		err = read_page(bitmap->storage.file, 0,
572
				bitmap, bytes, sb_page);
573
	} else {
574 575 576 577
		err = read_sb_page(bitmap->mddev,
				   bitmap->mddev->bitmap_info.offset,
				   sb_page,
				   0, sizeof(bitmap_super_t));
578
	}
579
	if (err)
580 581
		return err;

582
	sb = kmap_atomic(sb_page);
583 584

	chunksize = le32_to_cpu(sb->chunksize);
585
	daemon_sleep = le32_to_cpu(sb->daemon_sleep) * HZ;
586
	write_behind = le32_to_cpu(sb->write_behind);
587
	sectors_reserved = le32_to_cpu(sb->sectors_reserved);
G
Goldwyn Rodrigues 已提交
588
	nodes = le32_to_cpu(sb->nodes);
589 590 591 592

	/* verify that the bitmap-specific fields are valid */
	if (sb->magic != cpu_to_le32(BITMAP_MAGIC))
		reason = "bad magic";
593 594
	else if (le32_to_cpu(sb->version) < BITMAP_MAJOR_LO ||
		 le32_to_cpu(sb->version) > BITMAP_MAJOR_HI)
595
		reason = "unrecognized superblock version";
596
	else if (chunksize < 512)
597
		reason = "bitmap chunksize too small";
J
Jonathan Brassow 已提交
598
	else if (!is_power_of_2(chunksize))
599
		reason = "bitmap chunksize not a power of 2";
600
	else if (daemon_sleep < 1 || daemon_sleep > MAX_SCHEDULE_TIMEOUT)
601
		reason = "daemon sleep period out of range";
602 603
	else if (write_behind > COUNTER_MAX)
		reason = "write-behind limit out of range (0 - 16383)";
604 605 606 607 608 609 610 611 612
	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);

613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630
	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);
631
			set_bit(BITMAP_STALE, &bitmap->flags);
632
		}
633
	}
634

635
	/* assign fields using values from superblock */
636
	bitmap->flags |= le32_to_cpu(sb->state);
637
	if (le32_to_cpu(sb->version) == BITMAP_MAJOR_HOSTENDIAN)
638
		set_bit(BITMAP_HOSTENDIAN, &bitmap->flags);
639
	bitmap->events_cleared = le64_to_cpu(sb->events_cleared);
G
Goldwyn Rodrigues 已提交
640
	strlcpy(bitmap->mddev->bitmap_info.cluster_name, sb->cluster_name, 64);
641 642
	err = 0;
out:
643
	kunmap_atomic(sb);
644
out_no_sb:
645
	if (test_bit(BITMAP_STALE, &bitmap->flags))
646 647 648 649
		bitmap->events_cleared = bitmap->mddev->events;
	bitmap->mddev->bitmap_info.chunksize = chunksize;
	bitmap->mddev->bitmap_info.daemon_sleep = daemon_sleep;
	bitmap->mddev->bitmap_info.max_write_behind = write_behind;
G
Goldwyn Rodrigues 已提交
650
	bitmap->mddev->bitmap_info.nodes = nodes;
651 652 653
	if (bitmap->mddev->bitmap_info.space == 0 ||
	    bitmap->mddev->bitmap_info.space > sectors_reserved)
		bitmap->mddev->bitmap_info.space = sectors_reserved;
654 655 656 657 658 659 660 661 662
	if (err)
		bitmap_print_sb(bitmap);
	return err;
}

/*
 * general bitmap file operations
 */

663 664 665 666 667 668
/*
 * 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.
 */
669
/* calculate the index of the page that contains this bit */
670 671
static inline unsigned long file_page_index(struct bitmap_storage *store,
					    unsigned long chunk)
672
{
673
	if (store->sb_page)
674 675
		chunk += sizeof(bitmap_super_t) << 3;
	return chunk >> PAGE_BIT_SHIFT;
676 677 678
}

/* calculate the (bit) offset of this bit within a page */
679 680
static inline unsigned long file_page_offset(struct bitmap_storage *store,
					     unsigned long chunk)
681
{
682
	if (store->sb_page)
683 684
		chunk += sizeof(bitmap_super_t) << 3;
	return chunk & (PAGE_BITS - 1);
685 686 687 688 689 690
}

/*
 * return a pointer to the page in the filemap that contains the given bit
 *
 */
691
static inline struct page *filemap_get_page(struct bitmap_storage *store,
692
					    unsigned long chunk)
693
{
694
	if (file_page_index(store, chunk) >= store->file_pages)
695
		return NULL;
696
	return store->filemap[file_page_index(store, chunk)];
697 698
}

699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717
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) {
718
		store->sb_page = alloc_page(GFP_KERNEL|__GFP_ZERO);
719 720 721 722 723 724 725 726 727 728
		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++) {
729
		store->filemap[pnum] = alloc_page(GFP_KERNEL|__GFP_ZERO);
730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750
		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;
}

751
static void bitmap_file_unmap(struct bitmap_storage *store)
752 753 754
{
	struct page **map, *sb_page;
	int pages;
755
	struct file *file;
756

757
	file = store->file;
758 759 760
	map = store->filemap;
	pages = store->file_pages;
	sb_page = store->sb_page;
761 762

	while (pages--)
763
		if (map[pages] != sb_page) /* 0 is sb_page, release it below */
764
			free_buffers(map[pages]);
765
	kfree(map);
766
	kfree(store->filemap_attr);
767

768 769
	if (sb_page)
		free_buffers(sb_page);
770

771
	if (file) {
A
Al Viro 已提交
772
		struct inode *inode = file_inode(file);
773
		invalidate_mapping_pages(inode->i_mapping, 0, -1);
774
		fput(file);
775
	}
776 777 778 779 780 781 782 783 784 785 786
}

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

787
	if (!test_and_set_bit(BITMAP_STALE, &bitmap->flags)) {
788
		bitmap_update_sb(bitmap);
789

790
		if (bitmap->storage.file) {
791 792
			path = kmalloc(PAGE_SIZE, GFP_KERNEL);
			if (path)
793 794
				ptr = d_path(&bitmap->storage.file->f_path,
					     path, PAGE_SIZE);
C
Christoph Hellwig 已提交
795

796 797
			printk(KERN_ALERT
			      "%s: kicking failed bitmap file %s from array!\n",
C
Christoph Hellwig 已提交
798
			      bmname(bitmap), IS_ERR(ptr) ? "" : ptr);
799

800 801 802 803 804
			kfree(path);
		} else
			printk(KERN_ALERT
			       "%s: disabling internal bitmap due to errors\n",
			       bmname(bitmap));
805
	}
806 807 808
}

enum bitmap_page_attr {
809
	BITMAP_PAGE_DIRTY = 0,     /* there are set bits that need to be synced */
810 811
	BITMAP_PAGE_PENDING = 1,   /* there are bits that are being cleaned.
				    * i.e. counter is 1 or 2. */
812
	BITMAP_PAGE_NEEDWRITE = 2, /* there are cleared bits that need to be synced */
813 814
};

815 816
static inline void set_page_attr(struct bitmap *bitmap, int pnum,
				 enum bitmap_page_attr attr)
817
{
818
	set_bit((pnum<<2) + attr, bitmap->storage.filemap_attr);
819 820
}

821 822
static inline void clear_page_attr(struct bitmap *bitmap, int pnum,
				   enum bitmap_page_attr attr)
823
{
824
	clear_bit((pnum<<2) + attr, bitmap->storage.filemap_attr);
825 826
}

827 828
static inline int test_page_attr(struct bitmap *bitmap, int pnum,
				 enum bitmap_page_attr attr)
829
{
830
	return test_bit((pnum<<2) + attr, bitmap->storage.filemap_attr);
831 832
}

833 834 835 836 837 838
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);
}
839 840 841 842 843 844 845 846 847 848
/*
 * 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;
849
	struct page *page;
850
	void *kaddr;
851
	unsigned long chunk = block >> bitmap->counts.chunkshift;
852

853
	page = filemap_get_page(&bitmap->storage, chunk);
854 855
	if (!page)
		return;
856
	bit = file_page_offset(&bitmap->storage, chunk);
857

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

870 871 872 873 874
static void bitmap_file_clear_bit(struct bitmap *bitmap, sector_t block)
{
	unsigned long bit;
	struct page *page;
	void *paddr;
875
	unsigned long chunk = block >> bitmap->counts.chunkshift;
876

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

893 894 895
/* 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 */
896
void bitmap_unplug(struct bitmap *bitmap)
897
{
898
	unsigned long i;
899
	int dirty, need_write;
900

901 902
	if (!bitmap || !bitmap->storage.filemap ||
	    test_bit(BITMAP_STALE, &bitmap->flags))
903
		return;
904 905 906

	/* look at each page to see if there are any set bits that need to be
	 * flushed out to disk */
907
	for (i = 0; i < bitmap->storage.file_pages; i++) {
908
		if (!bitmap->storage.filemap)
909
			return;
910 911 912 913
		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) {
914
			clear_page_attr(bitmap, i, BITMAP_PAGE_PENDING);
915 916
			write_page(bitmap, bitmap->storage.filemap[i], 0);
		}
917
	}
918 919 920 921 922 923
	if (bitmap->storage.file)
		wait_event(bitmap->write_wait,
			   atomic_read(&bitmap->pending_writes)==0);
	else
		md_super_wait(bitmap->mddev);

924
	if (test_bit(BITMAP_WRITE_ERROR, &bitmap->flags))
925
		bitmap_file_kick(bitmap);
926
}
927
EXPORT_SYMBOL(bitmap_unplug);
928

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

953
	chunks = bitmap->counts.chunks;
954
	file = store->file;
955

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

971
	outofdate = test_bit(BITMAP_STALE, &bitmap->flags);
972 973 974 975
	if (outofdate)
		printk(KERN_INFO "%s: bitmap file is out of date, doing full "
			"recovery\n", bmname(bitmap));

976
	if (file && i_size_read(file->f_mapping->host) < store->bytes) {
977
		printk(KERN_INFO "%s: bitmap file too short %lu < %lu\n",
978 979 980
		       bmname(bitmap),
		       (unsigned long) i_size_read(file->f_mapping->host),
		       store->bytes);
981
		goto err;
982
	}
983

984
	oldindex = ~0L;
985
	offset = 0;
986
	if (!bitmap->mddev->bitmap_info.external)
987
		offset = sizeof(bitmap_super_t);
988 989

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

1014 1015 1016 1017 1018
			oldindex = index;

			if (outofdate) {
				/*
				 * if bitmap is out of date, dirty the
1019
				 * whole page and write it out
1020
				 */
1021
				paddr = kmap_atomic(page);
1022
				memset(paddr + offset, 0xff,
1023
				       PAGE_SIZE - offset);
1024
				kunmap_atomic(paddr);
1025 1026 1027
				write_page(bitmap, page, 1);

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

	printk(KERN_INFO "%s: bitmap initialized from disk: "
1052
	       "read %lu pages, set %lu of %lu bits\n",
1053
	       bmname(bitmap), store->file_pages,
1054
	       bit_cnt, chunks);
1055 1056

	return 0;
1057

1058 1059 1060
 err:
	printk(KERN_INFO "%s: bitmap initialisation failed: %d\n",
	       bmname(bitmap), ret);
1061 1062 1063
	return ret;
}

1064 1065 1066 1067 1068
void bitmap_write_all(struct bitmap *bitmap)
{
	/* We don't actually write all bitmap blocks here,
	 * just flag them as needing to be written
	 */
1069
	int i;
1070

1071
	if (!bitmap || !bitmap->storage.filemap)
1072
		return;
1073
	if (bitmap->storage.file)
1074 1075 1076
		/* Only one copy, so nothing needed */
		return;

1077
	for (i = 0; i < bitmap->storage.file_pages; i++)
1078
		set_page_attr(bitmap, i,
1079
			      BITMAP_PAGE_NEEDWRITE);
1080
	bitmap->allclean = 0;
1081 1082
}

1083 1084
static void bitmap_count_page(struct bitmap_counts *bitmap,
			      sector_t offset, int inc)
1085
{
1086
	sector_t chunk = offset >> bitmap->chunkshift;
1087 1088 1089 1090
	unsigned long page = chunk >> PAGE_COUNTER_SHIFT;
	bitmap->bp[page].count += inc;
	bitmap_checkfree(bitmap, page);
}
1091

1092
static void bitmap_set_pending(struct bitmap_counts *bitmap, sector_t offset)
1093 1094 1095 1096 1097 1098 1099 1100 1101
{
	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;
}

1102
static bitmap_counter_t *bitmap_get_counter(struct bitmap_counts *bitmap,
N
NeilBrown 已提交
1103
					    sector_t offset, sector_t *blocks,
1104 1105 1106 1107 1108 1109 1110
					    int create);

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

1111
void bitmap_daemon_work(struct mddev *mddev)
1112
{
1113
	struct bitmap *bitmap;
1114
	unsigned long j;
1115
	unsigned long nextpage;
N
NeilBrown 已提交
1116
	sector_t blocks;
1117
	struct bitmap_counts *counts;
1118

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

1132
	bitmap->daemon_lastrun = jiffies;
1133
	if (bitmap->allclean) {
N
NeilBrown 已提交
1134
		mddev->thread->timeout = MAX_SCHEDULE_TIMEOUT;
1135
		goto done;
1136 1137
	}
	bitmap->allclean = 1;
1138

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

1174 1175
		if (j == nextpage) {
			nextpage += PAGE_COUNTER_RATIO;
1176
			if (!counts->bp[j >> PAGE_COUNTER_SHIFT].pending) {
1177
				j |= PAGE_COUNTER_MASK;
1178 1179
				continue;
			}
1180
			counts->bp[j >> PAGE_COUNTER_SHIFT].pending = 0;
1181
		}
1182
		bmc = bitmap_get_counter(counts,
1183
					 block,
1184
					 &blocks, 0);
1185 1186

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

1203 1204 1205 1206 1207 1208 1209 1210
	/* 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.
	 */
1211 1212 1213 1214
	for (j = 0;
	     j < bitmap->storage.file_pages
		     && !test_bit(BITMAP_STALE, &bitmap->flags);
	     j++) {
1215

1216
		if (test_page_attr(bitmap, j,
1217 1218 1219
				   BITMAP_PAGE_DIRTY))
			/* bitmap_unplug will handle the rest */
			break;
1220 1221
		if (test_and_clear_page_attr(bitmap, j,
					     BITMAP_PAGE_NEEDWRITE)) {
1222
			write_page(bitmap, bitmap->storage.filemap[j], 0);
1223 1224 1225
		}
	}

1226
 done:
1227
	if (bitmap->allclean == 0)
N
NeilBrown 已提交
1228 1229
		mddev->thread->timeout =
			mddev->bitmap_info.daemon_sleep;
1230
	mutex_unlock(&mddev->bitmap_info.mutex);
1231 1232
}

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

1249 1250 1251 1252
	err = bitmap_checkpage(bitmap, page, create);

	if (bitmap->bp[page].hijacked ||
	    bitmap->bp[page].map == NULL)
1253
		csize = ((sector_t)1) << (bitmap->chunkshift +
1254 1255
					  PAGE_COUNTER_SHIFT - 1);
	else
1256
		csize = ((sector_t)1) << bitmap->chunkshift;
1257 1258 1259
	*blocks = csize - (offset & (csize - 1));

	if (err < 0)
1260
		return NULL;
1261

1262 1263 1264 1265 1266 1267 1268 1269
	/* 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];
1270
	} else /* page is allocated */
1271 1272 1273 1274
		return (bitmap_counter_t *)
			&(bitmap->bp[page].map[pageoff]);
}

1275
int bitmap_startwrite(struct bitmap *bitmap, sector_t offset, unsigned long sectors, int behind)
1276
{
1277 1278
	if (!bitmap)
		return 0;
1279 1280

	if (behind) {
1281
		int bw;
1282
		atomic_inc(&bitmap->behind_writes);
1283 1284 1285 1286
		bw = atomic_read(&bitmap->behind_writes);
		if (bw > bitmap->behind_writes_used)
			bitmap->behind_writes_used = bw;

1287 1288
		pr_debug("inc write-behind count %d/%lu\n",
			 bw, bitmap->mddev->bitmap_info.max_write_behind);
1289 1290
	}

1291
	while (sectors) {
N
NeilBrown 已提交
1292
		sector_t blocks;
1293 1294
		bitmap_counter_t *bmc;

1295 1296
		spin_lock_irq(&bitmap->counts.lock);
		bmc = bitmap_get_counter(&bitmap->counts, offset, &blocks, 1);
1297
		if (!bmc) {
1298
			spin_unlock_irq(&bitmap->counts.lock);
1299 1300 1301
			return 0;
		}

1302
		if (unlikely(COUNTER(*bmc) == COUNTER_MAX)) {
1303 1304 1305 1306 1307 1308 1309
			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);
1310
			spin_unlock_irq(&bitmap->counts.lock);
1311
			schedule();
1312 1313 1314 1315
			finish_wait(&bitmap->overflow_wait, &__wait);
			continue;
		}

1316
		switch (*bmc) {
1317 1318
		case 0:
			bitmap_file_set_bit(bitmap, offset);
1319
			bitmap_count_page(&bitmap->counts, offset, 1);
1320 1321 1322 1323
			/* fall through */
		case 1:
			*bmc = 2;
		}
1324

1325 1326
		(*bmc)++;

1327
		spin_unlock_irq(&bitmap->counts.lock);
1328 1329 1330 1331

		offset += blocks;
		if (sectors > blocks)
			sectors -= blocks;
1332 1333
		else
			sectors = 0;
1334 1335 1336
	}
	return 0;
}
1337
EXPORT_SYMBOL(bitmap_startwrite);
1338 1339

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

1352
	while (sectors) {
N
NeilBrown 已提交
1353
		sector_t blocks;
1354 1355 1356
		unsigned long flags;
		bitmap_counter_t *bmc;

1357 1358
		spin_lock_irqsave(&bitmap->counts.lock, flags);
		bmc = bitmap_get_counter(&bitmap->counts, offset, &blocks, 0);
1359
		if (!bmc) {
1360
			spin_unlock_irqrestore(&bitmap->counts.lock, flags);
1361 1362 1363
			return;
		}

1364
		if (success && !bitmap->mddev->degraded &&
1365 1366 1367
		    bitmap->events_cleared < bitmap->mddev->events) {
			bitmap->events_cleared = bitmap->mddev->events;
			bitmap->need_sync = 1;
1368
			sysfs_notify_dirent_safe(bitmap->sysfs_can_clear);
1369 1370
		}

1371
		if (!success && !NEEDED(*bmc))
1372 1373
			*bmc |= NEEDED_MASK;

1374
		if (COUNTER(*bmc) == COUNTER_MAX)
1375 1376
			wake_up(&bitmap->overflow_wait);

1377
		(*bmc)--;
1378
		if (*bmc <= 2) {
1379
			bitmap_set_pending(&bitmap->counts, offset);
1380 1381
			bitmap->allclean = 0;
		}
1382
		spin_unlock_irqrestore(&bitmap->counts.lock, flags);
1383 1384 1385
		offset += blocks;
		if (sectors > blocks)
			sectors -= blocks;
1386 1387
		else
			sectors = 0;
1388 1389
	}
}
1390
EXPORT_SYMBOL(bitmap_endwrite);
1391

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

N
NeilBrown 已提交
1420
int bitmap_start_sync(struct bitmap *bitmap, sector_t offset, sector_t *blocks,
1421 1422 1423 1424 1425 1426 1427 1428 1429 1430
		      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 已提交
1431
	sector_t blocks1;
1432 1433 1434 1435 1436 1437 1438 1439 1440 1441

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

N
NeilBrown 已提交
1444
void bitmap_end_sync(struct bitmap *bitmap, sector_t offset, sector_t *blocks, int aborted)
1445 1446 1447
{
	bitmap_counter_t *bmc;
	unsigned long flags;
1448 1449

	if (bitmap == NULL) {
1450 1451 1452
		*blocks = 1024;
		return;
	}
1453 1454
	spin_lock_irqsave(&bitmap->counts.lock, flags);
	bmc = bitmap_get_counter(&bitmap->counts, offset, blocks, 0);
1455 1456 1457 1458 1459 1460 1461 1462 1463
	if (bmc == NULL)
		goto unlock;
	/* locked */
	if (RESYNC(*bmc)) {
		*bmc &= ~RESYNC_MASK;

		if (!NEEDED(*bmc) && aborted)
			*bmc |= NEEDED_MASK;
		else {
1464
			if (*bmc <= 2) {
1465
				bitmap_set_pending(&bitmap->counts, offset);
1466 1467
				bitmap->allclean = 0;
			}
1468 1469 1470
		}
	}
 unlock:
1471
	spin_unlock_irqrestore(&bitmap->counts.lock, flags);
1472
}
1473
EXPORT_SYMBOL(bitmap_end_sync);
1474 1475 1476 1477 1478 1479 1480 1481

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 已提交
1482
	sector_t blocks;
N
NeilBrown 已提交
1483 1484
	if (!bitmap)
		return;
1485 1486
	while (sector < bitmap->mddev->resync_max_sectors) {
		bitmap_end_sync(bitmap, sector, &blocks, 0);
N
NeilBrown 已提交
1487 1488 1489
		sector += blocks;
	}
}
1490
EXPORT_SYMBOL(bitmap_close_sync);
N
NeilBrown 已提交
1491 1492 1493 1494

void bitmap_cond_end_sync(struct bitmap *bitmap, sector_t sector)
{
	sector_t s = 0;
N
NeilBrown 已提交
1495
	sector_t blocks;
N
NeilBrown 已提交
1496 1497 1498 1499 1500 1501 1502 1503

	if (!bitmap)
		return;
	if (sector == 0) {
		bitmap->last_end_sync = jiffies;
		return;
	}
	if (time_before(jiffies, (bitmap->last_end_sync
1504
				  + bitmap->mddev->bitmap_info.daemon_sleep)))
N
NeilBrown 已提交
1505 1506 1507 1508
		return;
	wait_event(bitmap->mddev->recovery_wait,
		   atomic_read(&bitmap->mddev->recovery_active) == 0);

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

1522
static void bitmap_set_memory_bits(struct bitmap *bitmap, sector_t offset, int needed)
1523 1524
{
	/* For each chunk covered by any of these sectors, set the
1525
	 * counter to 2 and possibly set resync_needed.  They should all
1526 1527
	 * be 0 at this point
	 */
1528

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

1546 1547 1548 1549 1550 1551
/* 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++) {
1552
		sector_t sec = (sector_t)chunk << bitmap->counts.chunkshift;
1553 1554
		bitmap_set_memory_bits(bitmap, sec, 1);
		bitmap_file_set_bit(bitmap, sec);
1555 1556 1557 1558 1559 1560
		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;
1561 1562 1563
	}
}

1564 1565 1566
/*
 * flush out any pending updates
 */
1567
void bitmap_flush(struct mddev *mddev)
1568 1569
{
	struct bitmap *bitmap = mddev->bitmap;
1570
	long sleep;
1571 1572 1573 1574 1575 1576 1577

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

	/* run the daemon_work three time to ensure everything is flushed
	 * that can be
	 */
1578
	sleep = mddev->bitmap_info.daemon_sleep * 2;
1579
	bitmap->daemon_lastrun -= sleep;
1580
	bitmap_daemon_work(mddev);
1581
	bitmap->daemon_lastrun -= sleep;
1582
	bitmap_daemon_work(mddev);
1583
	bitmap->daemon_lastrun -= sleep;
1584
	bitmap_daemon_work(mddev);
1585 1586 1587
	bitmap_update_sb(bitmap);
}

1588 1589 1590
/*
 * free memory that was allocated
 */
1591
static void bitmap_free(struct bitmap *bitmap)
1592 1593 1594 1595 1596 1597 1598
{
	unsigned long k, pages;
	struct bitmap_page *bp;

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

1599 1600 1601 1602 1603 1604
	/* 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);
1605

1606 1607
	bp = bitmap->counts.bp;
	pages = bitmap->counts.pages;
1608 1609 1610 1611 1612 1613 1614 1615 1616 1617

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

1619
void bitmap_destroy(struct mddev *mddev)
1620 1621 1622 1623 1624 1625
{
	struct bitmap *bitmap = mddev->bitmap;

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

1626
	mutex_lock(&mddev->bitmap_info.mutex);
1627
	spin_lock(&mddev->lock);
1628
	mddev->bitmap = NULL; /* disconnect from the md device */
1629
	spin_unlock(&mddev->lock);
1630
	mutex_unlock(&mddev->bitmap_info.mutex);
1631 1632
	if (mddev->thread)
		mddev->thread->timeout = MAX_SCHEDULE_TIMEOUT;
1633

1634 1635 1636
	if (bitmap->sysfs_can_clear)
		sysfs_put(bitmap->sysfs_can_clear);

1637 1638
	bitmap_free(bitmap);
}
1639 1640 1641 1642 1643

/*
 * initialize the bitmap structure
 * if this returns an error, bitmap_destroy must be called to do clean up
 */
1644
int bitmap_create(struct mddev *mddev)
1645 1646
{
	struct bitmap *bitmap;
1647
	sector_t blocks = mddev->resync_max_sectors;
1648
	struct file *file = mddev->bitmap_info.file;
1649
	int err;
1650
	struct kernfs_node *bm = NULL;
1651

A
Alexey Dobriyan 已提交
1652
	BUILD_BUG_ON(sizeof(bitmap_super_t) != 256);
1653

1654
	BUG_ON(file && mddev->bitmap_info.offset);
1655

1656
	bitmap = kzalloc(sizeof(*bitmap), GFP_KERNEL);
1657 1658 1659
	if (!bitmap)
		return -ENOMEM;

1660
	spin_lock_init(&bitmap->counts.lock);
1661 1662
	atomic_set(&bitmap->pending_writes, 0);
	init_waitqueue_head(&bitmap->write_wait);
1663
	init_waitqueue_head(&bitmap->overflow_wait);
1664
	init_waitqueue_head(&bitmap->behind_wait);
1665

1666 1667
	bitmap->mddev = mddev;

1668
	if (mddev->kobj.sd)
T
Tejun Heo 已提交
1669
		bm = sysfs_get_dirent(mddev->kobj.sd, "bitmap");
1670
	if (bm) {
T
Tejun Heo 已提交
1671
		bitmap->sysfs_can_clear = sysfs_get_dirent(bm, "can_clear");
1672 1673 1674 1675
		sysfs_put(bm);
	} else
		bitmap->sysfs_can_clear = NULL;

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

1706
	bitmap->daemon_lastrun = jiffies;
1707 1708
	err = bitmap_resize(bitmap, blocks, mddev->bitmap_info.chunksize, 1);
	if (err)
1709
		goto error;
1710

1711
	printk(KERN_INFO "created bitmap (%lu pages) for device %s\n",
1712
	       bitmap->counts.pages, bmname(bitmap));
1713 1714

	mddev->bitmap = bitmap;
1715
	return test_bit(BITMAP_WRITE_ERROR, &bitmap->flags) ? -EIO : 0;
1716 1717 1718 1719 1720 1721

 error:
	bitmap_free(bitmap);
	return err;
}

1722
int bitmap_load(struct mddev *mddev)
1723 1724
{
	int err = 0;
1725
	sector_t start = 0;
1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737
	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 已提交
1738
		sector_t blocks;
1739 1740 1741 1742 1743
		bitmap_start_sync(bitmap, sector, &blocks, 0);
		sector += blocks;
	}
	bitmap_close_sync(bitmap);

1744 1745 1746 1747 1748 1749
	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;

1750
	mutex_lock(&mddev->bitmap_info.mutex);
1751
	err = bitmap_init_from_disk(bitmap, start);
1752
	mutex_unlock(&mddev->bitmap_info.mutex);
1753

1754
	if (err)
1755
		goto out;
1756
	clear_bit(BITMAP_STALE, &bitmap->flags);
1757 1758 1759

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

1761
	mddev->thread->timeout = mddev->bitmap_info.daemon_sleep;
1762
	md_wakeup_thread(mddev->thread);
1763

1764 1765
	bitmap_update_sb(bitmap);

1766
	if (test_bit(BITMAP_WRITE_ERROR, &bitmap->flags))
1767 1768
		err = -EIO;
out:
1769
	return err;
1770
}
1771
EXPORT_SYMBOL_GPL(bitmap_load);
1772

1773 1774 1775
void bitmap_status(struct seq_file *seq, struct bitmap *bitmap)
{
	unsigned long chunk_kb;
1776
	struct bitmap_counts *counts;
1777 1778 1779 1780

	if (!bitmap)
		return;

1781 1782
	counts = &bitmap->counts;

1783 1784 1785
	chunk_kb = bitmap->mddev->bitmap_info.chunksize >> 10;
	seq_printf(seq, "bitmap: %lu/%lu pages [%luKB], "
		   "%lu%s chunk",
1786 1787 1788
		   counts->pages - counts->missing_pages,
		   counts->pages,
		   (counts->pages - counts->missing_pages)
1789 1790 1791
		   << (PAGE_SHIFT - 10),
		   chunk_kb ? chunk_kb : bitmap->mddev->bitmap_info.chunksize,
		   chunk_kb ? "KB" : "B");
1792
	if (bitmap->storage.file) {
1793
		seq_printf(seq, ", file: ");
1794
		seq_path(seq, &bitmap->storage.file->f_path, " \t\n");
1795 1796 1797 1798 1799
	}

	seq_printf(seq, "\n");
}

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 1956 1957 1958 1959 1960 1961 1962 1963
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);

1964
static ssize_t
1965
location_show(struct mddev *mddev, char *page)
1966 1967
{
	ssize_t len;
1968
	if (mddev->bitmap_info.file)
1969
		len = sprintf(page, "file");
1970
	else if (mddev->bitmap_info.offset)
1971
		len = sprintf(page, "%+lld", (long long)mddev->bitmap_info.offset);
1972
	else
1973 1974 1975 1976 1977 1978
		len = sprintf(page, "none");
	len += sprintf(page+len, "\n");
	return len;
}

static ssize_t
1979
location_store(struct mddev *mddev, const char *buf, size_t len)
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;
			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] == '+')
2016
				rv = kstrtoll(buf+1, 10, &offset);
2017
			else
2018
				rv = kstrtoll(buf, 10, &offset);
2019 2020 2021 2022
			if (rv)
				return rv;
			if (offset == 0)
				return -EINVAL;
2023 2024
			if (mddev->bitmap_info.external == 0 &&
			    mddev->major_version == 0 &&
2025 2026 2027 2028 2029 2030
			    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);
2031 2032
				if (!rv)
					rv = bitmap_load(mddev);
2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055
				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);

2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079
/* '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 &&
2080
	    sectors < (mddev->bitmap->storage.bytes + 511) >> 9)
2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092
		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);

2093
static ssize_t
2094
timeout_show(struct mddev *mddev, char *page)
2095 2096 2097 2098
{
	ssize_t len;
	unsigned long secs = mddev->bitmap_info.daemon_sleep / HZ;
	unsigned long jifs = mddev->bitmap_info.daemon_sleep % HZ;
2099

2100 2101 2102 2103 2104 2105 2106 2107
	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
2108
timeout_store(struct mddev *mddev, const char *buf, size_t len)
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 2137 2138 2139 2140 2141 2142 2143
{
	/* 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
2144
backlog_show(struct mddev *mddev, char *page)
2145 2146 2147 2148 2149
{
	return sprintf(page, "%lu\n", mddev->bitmap_info.max_write_behind);
}

static ssize_t
2150
backlog_store(struct mddev *mddev, const char *buf, size_t len)
2151 2152
{
	unsigned long backlog;
2153
	int rv = kstrtoul(buf, 10, &backlog);
2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165
	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
2166
chunksize_show(struct mddev *mddev, char *page)
2167 2168 2169 2170 2171
{
	return sprintf(page, "%lu\n", mddev->bitmap_info.chunksize);
}

static ssize_t
2172
chunksize_store(struct mddev *mddev, const char *buf, size_t len)
2173 2174 2175 2176 2177 2178
{
	/* Can only be changed when no bitmap is active */
	int rv;
	unsigned long csize;
	if (mddev->bitmap)
		return -EBUSY;
2179
	rv = kstrtoul(buf, 10, &csize);
2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191
	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);

2192
static ssize_t metadata_show(struct mddev *mddev, char *page)
2193
{
G
Goldwyn Rodrigues 已提交
2194 2195
	if (mddev_is_clustered(mddev))
		return sprintf(page, "clustered\n");
2196 2197 2198 2199
	return sprintf(page, "%s\n", (mddev->bitmap_info.external
				      ? "external" : "internal"));
}

2200
static ssize_t metadata_store(struct mddev *mddev, const char *buf, size_t len)
2201 2202 2203 2204 2205 2206 2207
{
	if (mddev->bitmap ||
	    mddev->bitmap_info.file ||
	    mddev->bitmap_info.offset)
		return -EBUSY;
	if (strncmp(buf, "external", 8) == 0)
		mddev->bitmap_info.external = 1;
G
Goldwyn Rodrigues 已提交
2208 2209
	else if ((strncmp(buf, "internal", 8) == 0) ||
			(strncmp(buf, "clustered", 9) == 0))
2210 2211 2212 2213 2214 2215 2216 2217 2218
		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);

2219
static ssize_t can_clear_show(struct mddev *mddev, char *page)
2220 2221
{
	int len;
2222
	spin_lock(&mddev->lock);
2223 2224 2225 2226 2227
	if (mddev->bitmap)
		len = sprintf(page, "%s\n", (mddev->bitmap->need_sync ?
					     "false" : "true"));
	else
		len = sprintf(page, "\n");
2228
	spin_unlock(&mddev->lock);
2229 2230 2231
	return len;
}

2232
static ssize_t can_clear_store(struct mddev *mddev, const char *buf, size_t len)
2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249
{
	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);

2250
static ssize_t
2251
behind_writes_used_show(struct mddev *mddev, char *page)
2252
{
2253 2254
	ssize_t ret;
	spin_lock(&mddev->lock);
2255
	if (mddev->bitmap == NULL)
2256 2257 2258 2259 2260 2261
		ret = sprintf(page, "0\n");
	else
		ret = sprintf(page, "%lu\n",
			      mddev->bitmap->behind_writes_used);
	spin_unlock(&mddev->lock);
	return ret;
2262 2263 2264
}

static ssize_t
2265
behind_writes_used_reset(struct mddev *mddev, const char *buf, size_t len)
2266 2267 2268 2269 2270 2271 2272 2273 2274 2275
{
	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);

2276 2277
static struct attribute *md_bitmap_attrs[] = {
	&bitmap_location.attr,
2278
	&bitmap_space.attr,
2279 2280 2281
	&bitmap_timeout.attr,
	&bitmap_backlog.attr,
	&bitmap_chunksize.attr,
2282 2283
	&bitmap_metadata.attr,
	&bitmap_can_clear.attr,
2284
	&max_backlog_used.attr,
2285 2286 2287 2288 2289 2290 2291
	NULL
};
struct attribute_group md_bitmap_group = {
	.name = "bitmap",
	.attrs = md_bitmap_attrs,
};