bitmap.c 62.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 210 211
	int node_offset = 0;

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

213
	while ((rdev = next_active_rdev(rdev, mddev)) != NULL) {
214 215
		int size = PAGE_SIZE;
		loff_t offset = mddev->bitmap_info.offset;
216 217 218

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

219 220 221 222 223
		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,
224
				       bdev_logical_block_size(bdev));
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 262 263 264 265
		/* 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);
266
	}
267 268

	if (wait)
269
		md_super_wait(mddev);
270
	return 0;
271 272 273

 bad_alignment:
	return -EINVAL;
274 275
}

276
static void bitmap_file_kick(struct bitmap *bitmap);
277
/*
278
 * write out a page to a file
279
 */
280
static void write_page(struct bitmap *bitmap, struct page *page, int wait)
281
{
282
	struct buffer_head *bh;
283

284
	if (bitmap->storage.file == NULL) {
285 286
		switch (write_sb_page(bitmap, page, wait)) {
		case -EINVAL:
287
			set_bit(BITMAP_WRITE_ERROR, &bitmap->flags);
288
		}
289
	} else {
290

291
		bh = page_buffers(page);
292

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

301
		if (wait)
302 303
			wait_event(bitmap->write_wait,
				   atomic_read(&bitmap->pending_writes)==0);
304
	}
305
	if (test_bit(BITMAP_WRITE_ERROR, &bitmap->flags))
306
		bitmap_file_kick(bitmap);
307 308 309 310 311
}

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

313 314
	if (!uptodate)
		set_bit(BITMAP_WRITE_ERROR, &bitmap->flags);
315 316 317
	if (atomic_dec_and_test(&bitmap->pending_writes))
		wake_up(&bitmap->write_wait);
}
318

319 320 321 322 323 324 325 326 327 328
/* 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)
{
329
	struct buffer_head *bh;
330

331 332 333 334
	if (!PagePrivate(page))
		return;

	bh = page_buffers(page);
335 336 337 338
	while (bh) {
		struct buffer_head *next = bh->b_this_page;
		free_buffer_head(bh);
		bh = next;
339
	}
340 341
	__clear_page_buffers(page);
	put_page(page);
342 343
}

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

361 362
	pr_debug("read bitmap file (%dB @ %llu)\n", (int)PAGE_SIZE,
		 (unsigned long long)index << PAGE_SHIFT);
363

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

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

/*
 * bitmap file superblock operations
 */

/* update the event counter and sync the superblock to disk */
417
void bitmap_update_sb(struct bitmap *bitmap)
418 419 420 421
{
	bitmap_super_t *sb;

	if (!bitmap || !bitmap->mddev) /* no bitmap for this array */
422
		return;
423 424
	if (bitmap->mddev->bitmap_info.external)
		return;
425
	if (!bitmap->storage.sb_page) /* no superblock */
426
		return;
427
	sb = kmap_atomic(bitmap->storage.sb_page);
428
	sb->events = cpu_to_le64(bitmap->mddev->events);
429
	if (bitmap->mddev->events < bitmap->events_cleared)
430 431
		/* rocking back to read-only */
		bitmap->events_cleared = bitmap->mddev->events;
432 433
	sb->events_cleared = cpu_to_le64(bitmap->events_cleared);
	sb->state = cpu_to_le32(bitmap->flags);
434 435 436
	/* 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);
437 438 439
	/* 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 已提交
440
	sb->nodes = cpu_to_le32(bitmap->mddev->bitmap_info.nodes);
441 442
	sb->sectors_reserved = cpu_to_le32(bitmap->mddev->
					   bitmap_info.space);
443
	kunmap_atomic(sb);
444
	write_page(bitmap, bitmap->storage.sb_page, 1);
445 446 447 448 449 450 451
}

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

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

476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491
/*
 * 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;

492
	bitmap->storage.sb_page = alloc_page(GFP_KERNEL);
493 494
	if (bitmap->storage.sb_page == NULL)
		return -ENOMEM;
495
	bitmap->storage.sb_page->index = 0;
496

497
	sb = kmap_atomic(bitmap->storage.sb_page);
498 499 500 501 502 503 504

	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)) {
505
		kunmap_atomic(sb);
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 531 532 533 534
		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);

535
	set_bit(BITMAP_STALE, &bitmap->flags);
536
	sb->state = cpu_to_le32(bitmap->flags);
537 538 539
	bitmap->events_cleared = bitmap->mddev->events;
	sb->events_cleared = cpu_to_le64(bitmap->mddev->events);

540
	kunmap_atomic(sb);
541 542 543 544

	return 0;
}

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

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

571
re_read:
572 573 574 575 576 577 578 579 580 581 582 583
	/* If cluster_slot is set, the cluster is setup */
	if (bitmap->cluster_slot >= 0) {
		long long bm_blocks;

		bm_blocks = bitmap->mddev->resync_max_sectors / (bitmap->mddev->bitmap_info.chunksize >> 9);
		bm_blocks = bm_blocks << 3;
		bm_blocks = DIV_ROUND_UP(bm_blocks, 4096);
		bitmap->mddev->bitmap_info.offset += bitmap->cluster_slot * (bm_blocks << 3);
		pr_info("%s:%d bm slot: %d offset: %llu\n", __func__, __LINE__,
			bitmap->cluster_slot, (unsigned long long)bitmap->mddev->bitmap_info.offset);
	}

584 585
	if (bitmap->storage.file) {
		loff_t isize = i_size_read(bitmap->storage.file->f_mapping->host);
586 587
		int bytes = isize > PAGE_SIZE ? PAGE_SIZE : isize;

588
		err = read_page(bitmap->storage.file, 0,
589
				bitmap, bytes, sb_page);
590
	} else {
591 592 593 594
		err = read_sb_page(bitmap->mddev,
				   bitmap->mddev->bitmap_info.offset,
				   sb_page,
				   0, sizeof(bitmap_super_t));
595
	}
596
	if (err)
597 598
		return err;

599
	err = -EINVAL;
600
	sb = kmap_atomic(sb_page);
601 602

	chunksize = le32_to_cpu(sb->chunksize);
603
	daemon_sleep = le32_to_cpu(sb->daemon_sleep) * HZ;
604
	write_behind = le32_to_cpu(sb->write_behind);
605
	sectors_reserved = le32_to_cpu(sb->sectors_reserved);
G
Goldwyn Rodrigues 已提交
606
	nodes = le32_to_cpu(sb->nodes);
607
	strlcpy(bitmap->mddev->bitmap_info.cluster_name, sb->cluster_name, 64);
608 609 610 611

	/* verify that the bitmap-specific fields are valid */
	if (sb->magic != cpu_to_le32(BITMAP_MAGIC))
		reason = "bad magic";
612 613
	else if (le32_to_cpu(sb->version) < BITMAP_MAJOR_LO ||
		 le32_to_cpu(sb->version) > BITMAP_MAJOR_HI)
614
		reason = "unrecognized superblock version";
615
	else if (chunksize < 512)
616
		reason = "bitmap chunksize too small";
J
Jonathan Brassow 已提交
617
	else if (!is_power_of_2(chunksize))
618
		reason = "bitmap chunksize not a power of 2";
619
	else if (daemon_sleep < 1 || daemon_sleep > MAX_SCHEDULE_TIMEOUT)
620
		reason = "daemon sleep period out of range";
621 622
	else if (write_behind > COUNTER_MAX)
		reason = "write-behind limit out of range (0 - 16383)";
623 624 625 626 627 628 629 630 631
	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);

632 633 634 635 636 637 638 639 640 641 642 643
	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);
644
		if (!nodes && (events < bitmap->mddev->events)) {
645 646 647 648 649
			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);
650
			set_bit(BITMAP_STALE, &bitmap->flags);
651
		}
652
	}
653

654
	/* assign fields using values from superblock */
655
	bitmap->flags |= le32_to_cpu(sb->state);
656
	if (le32_to_cpu(sb->version) == BITMAP_MAJOR_HOSTENDIAN)
657
		set_bit(BITMAP_HOSTENDIAN, &bitmap->flags);
658
	bitmap->events_cleared = le64_to_cpu(sb->events_cleared);
G
Goldwyn Rodrigues 已提交
659
	strlcpy(bitmap->mddev->bitmap_info.cluster_name, sb->cluster_name, 64);
660
	err = 0;
661

662
out:
663
	kunmap_atomic(sb);
664 665 666
	/* Assiging chunksize is required for "re_read" */
	bitmap->mddev->bitmap_info.chunksize = chunksize;
	if (nodes && (bitmap->cluster_slot < 0)) {
667 668 669 670 671 672 673 674 675 676 677 678 679 680
		err = md_setup_cluster(bitmap->mddev, nodes);
		if (err) {
			pr_err("%s: Could not setup cluster service (%d)\n",
					bmname(bitmap), err);
			goto out_no_sb;
		}
		bitmap->cluster_slot = md_cluster_ops->slot_number(bitmap->mddev);
		pr_info("%s:%d bm slot: %d offset: %llu\n", __func__, __LINE__,
			bitmap->cluster_slot,
			(unsigned long long)bitmap->mddev->bitmap_info.offset);
		goto re_read;
	}


681
out_no_sb:
682
	if (test_bit(BITMAP_STALE, &bitmap->flags))
683 684 685 686
		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 已提交
687
	bitmap->mddev->bitmap_info.nodes = nodes;
688 689 690
	if (bitmap->mddev->bitmap_info.space == 0 ||
	    bitmap->mddev->bitmap_info.space > sectors_reserved)
		bitmap->mddev->bitmap_info.space = sectors_reserved;
691
	if (err) {
692
		bitmap_print_sb(bitmap);
693
		if (bitmap->cluster_slot < 0)
694 695
			md_cluster_stop(bitmap->mddev);
	}
696 697 698 699 700 701 702
	return err;
}

/*
 * general bitmap file operations
 */

703 704 705 706 707 708
/*
 * 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.
 */
709
/* calculate the index of the page that contains this bit */
710 711
static inline unsigned long file_page_index(struct bitmap_storage *store,
					    unsigned long chunk)
712
{
713
	if (store->sb_page)
714 715
		chunk += sizeof(bitmap_super_t) << 3;
	return chunk >> PAGE_BIT_SHIFT;
716 717 718
}

/* calculate the (bit) offset of this bit within a page */
719 720
static inline unsigned long file_page_offset(struct bitmap_storage *store,
					     unsigned long chunk)
721
{
722
	if (store->sb_page)
723 724
		chunk += sizeof(bitmap_super_t) << 3;
	return chunk & (PAGE_BITS - 1);
725 726 727 728 729 730
}

/*
 * return a pointer to the page in the filemap that contains the given bit
 *
 */
731
static inline struct page *filemap_get_page(struct bitmap_storage *store,
732
					    unsigned long chunk)
733
{
734
	if (file_page_index(store, chunk) >= store->file_pages)
735
		return NULL;
736
	return store->filemap[file_page_index(store, chunk)];
737 738
}

739
static int bitmap_storage_alloc(struct bitmap_storage *store,
740 741
				unsigned long chunks, int with_super,
				int slot_number)
742
{
743
	int pnum, offset = 0;
744 745 746 747 748 749 750 751
	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);
752
	offset = slot_number * (num_pages - 1);
753 754 755 756 757 758 759

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

	if (with_super && !store->sb_page) {
760
		store->sb_page = alloc_page(GFP_KERNEL|__GFP_ZERO);
761 762 763
		if (store->sb_page == NULL)
			return -ENOMEM;
	}
764

765 766 767 768
	pnum = 0;
	if (store->sb_page) {
		store->filemap[0] = store->sb_page;
		pnum = 1;
769
		store->sb_page->index = offset;
770
	}
771

772
	for ( ; pnum < num_pages; pnum++) {
773
		store->filemap[pnum] = alloc_page(GFP_KERNEL|__GFP_ZERO);
774 775 776 777
		if (!store->filemap[pnum]) {
			store->file_pages = pnum;
			return -ENOMEM;
		}
778
		store->filemap[pnum]->index = pnum + offset;
779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794
	}
	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;
}

795
static void bitmap_file_unmap(struct bitmap_storage *store)
796 797 798
{
	struct page **map, *sb_page;
	int pages;
799
	struct file *file;
800

801
	file = store->file;
802 803 804
	map = store->filemap;
	pages = store->file_pages;
	sb_page = store->sb_page;
805 806

	while (pages--)
807
		if (map[pages] != sb_page) /* 0 is sb_page, release it below */
808
			free_buffers(map[pages]);
809
	kfree(map);
810
	kfree(store->filemap_attr);
811

812 813
	if (sb_page)
		free_buffers(sb_page);
814

815
	if (file) {
A
Al Viro 已提交
816
		struct inode *inode = file_inode(file);
817
		invalidate_mapping_pages(inode->i_mapping, 0, -1);
818
		fput(file);
819
	}
820 821 822 823 824 825 826 827 828 829 830
}

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

831
	if (!test_and_set_bit(BITMAP_STALE, &bitmap->flags)) {
832
		bitmap_update_sb(bitmap);
833

834
		if (bitmap->storage.file) {
835 836
			path = kmalloc(PAGE_SIZE, GFP_KERNEL);
			if (path)
837 838
				ptr = d_path(&bitmap->storage.file->f_path,
					     path, PAGE_SIZE);
C
Christoph Hellwig 已提交
839

840 841
			printk(KERN_ALERT
			      "%s: kicking failed bitmap file %s from array!\n",
C
Christoph Hellwig 已提交
842
			      bmname(bitmap), IS_ERR(ptr) ? "" : ptr);
843

844 845 846 847 848
			kfree(path);
		} else
			printk(KERN_ALERT
			       "%s: disabling internal bitmap due to errors\n",
			       bmname(bitmap));
849
	}
850 851 852
}

enum bitmap_page_attr {
853
	BITMAP_PAGE_DIRTY = 0,     /* there are set bits that need to be synced */
854 855
	BITMAP_PAGE_PENDING = 1,   /* there are bits that are being cleaned.
				    * i.e. counter is 1 or 2. */
856
	BITMAP_PAGE_NEEDWRITE = 2, /* there are cleared bits that need to be synced */
857 858
};

859 860
static inline void set_page_attr(struct bitmap *bitmap, int pnum,
				 enum bitmap_page_attr attr)
861
{
862
	set_bit((pnum<<2) + attr, bitmap->storage.filemap_attr);
863 864
}

865 866
static inline void clear_page_attr(struct bitmap *bitmap, int pnum,
				   enum bitmap_page_attr attr)
867
{
868
	clear_bit((pnum<<2) + attr, bitmap->storage.filemap_attr);
869 870
}

871 872
static inline int test_page_attr(struct bitmap *bitmap, int pnum,
				 enum bitmap_page_attr attr)
873
{
874
	return test_bit((pnum<<2) + attr, bitmap->storage.filemap_attr);
875 876
}

877 878 879 880 881 882
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);
}
883 884 885 886 887 888 889 890 891 892
/*
 * 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;
893
	struct page *page;
894
	void *kaddr;
895
	unsigned long chunk = block >> bitmap->counts.chunkshift;
896

897
	page = filemap_get_page(&bitmap->storage, chunk);
898 899
	if (!page)
		return;
900
	bit = file_page_offset(&bitmap->storage, chunk);
901

902
	/* set the bit */
903
	kaddr = kmap_atomic(page);
904
	if (test_bit(BITMAP_HOSTENDIAN, &bitmap->flags))
905 906
		set_bit(bit, kaddr);
	else
907
		set_bit_le(bit, kaddr);
908
	kunmap_atomic(kaddr);
909
	pr_debug("set file bit %lu page %lu\n", bit, page->index);
910
	/* record page number so it gets flushed to disk when unplug occurs */
911
	set_page_attr(bitmap, page->index, BITMAP_PAGE_DIRTY);
912 913
}

914 915 916 917 918
static void bitmap_file_clear_bit(struct bitmap *bitmap, sector_t block)
{
	unsigned long bit;
	struct page *page;
	void *paddr;
919
	unsigned long chunk = block >> bitmap->counts.chunkshift;
920

921
	page = filemap_get_page(&bitmap->storage, chunk);
922 923
	if (!page)
		return;
924
	bit = file_page_offset(&bitmap->storage, chunk);
925
	paddr = kmap_atomic(page);
926
	if (test_bit(BITMAP_HOSTENDIAN, &bitmap->flags))
927 928
		clear_bit(bit, paddr);
	else
929
		clear_bit_le(bit, paddr);
930
	kunmap_atomic(paddr);
931 932
	if (!test_page_attr(bitmap, page->index, BITMAP_PAGE_NEEDWRITE)) {
		set_page_attr(bitmap, page->index, BITMAP_PAGE_PENDING);
933 934 935 936
		bitmap->allclean = 0;
	}
}

937 938 939
/* 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 */
940
void bitmap_unplug(struct bitmap *bitmap)
941
{
942
	unsigned long i;
943
	int dirty, need_write;
944

945 946
	if (!bitmap || !bitmap->storage.filemap ||
	    test_bit(BITMAP_STALE, &bitmap->flags))
947
		return;
948 949 950

	/* look at each page to see if there are any set bits that need to be
	 * flushed out to disk */
951
	for (i = 0; i < bitmap->storage.file_pages; i++) {
952
		if (!bitmap->storage.filemap)
953
			return;
954 955 956 957
		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) {
958
			clear_page_attr(bitmap, i, BITMAP_PAGE_PENDING);
959 960
			write_page(bitmap, bitmap->storage.filemap[i], 0);
		}
961
	}
962 963 964 965 966 967
	if (bitmap->storage.file)
		wait_event(bitmap->write_wait,
			   atomic_read(&bitmap->pending_writes)==0);
	else
		md_super_wait(bitmap->mddev);

968
	if (test_bit(BITMAP_WRITE_ERROR, &bitmap->flags))
969
		bitmap_file_kick(bitmap);
970
}
971
EXPORT_SYMBOL(bitmap_unplug);
972

973
static void bitmap_set_memory_bits(struct bitmap *bitmap, sector_t offset, int needed);
974 975 976 977 978 979 980
/* * 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.
981 982 983
 *
 * We ignore all bits for sectors that end earlier than 'start'.
 * This is used when reading an out-of-date bitmap...
984
 */
985
static int bitmap_init_from_disk(struct bitmap *bitmap, sector_t start)
986
{
987
	unsigned long i, chunks, index, oldindex, bit, node_offset = 0;
988
	struct page *page = NULL;
989
	unsigned long bit_cnt = 0;
990
	struct file *file;
991
	unsigned long offset;
992 993
	int outofdate;
	int ret = -ENOSPC;
994
	void *paddr;
995
	struct bitmap_storage *store = &bitmap->storage;
996

997
	chunks = bitmap->counts.chunks;
998
	file = store->file;
999

1000 1001
	if (!file && !bitmap->mddev->bitmap_info.offset) {
		/* No permanent bitmap - fill with '1s'. */
1002 1003
		store->filemap = NULL;
		store->file_pages = 0;
1004 1005
		for (i = 0; i < chunks ; i++) {
			/* if the disk bit is set, set the memory bit */
1006
			int needed = ((sector_t)(i+1) << (bitmap->counts.chunkshift)
1007 1008
				      >= start);
			bitmap_set_memory_bits(bitmap,
1009
					       (sector_t)i << bitmap->counts.chunkshift,
1010 1011 1012 1013
					       needed);
		}
		return 0;
	}
1014

1015
	outofdate = test_bit(BITMAP_STALE, &bitmap->flags);
1016 1017 1018 1019
	if (outofdate)
		printk(KERN_INFO "%s: bitmap file is out of date, doing full "
			"recovery\n", bmname(bitmap));

1020
	if (file && i_size_read(file->f_mapping->host) < store->bytes) {
1021
		printk(KERN_INFO "%s: bitmap file too short %lu < %lu\n",
1022 1023 1024
		       bmname(bitmap),
		       (unsigned long) i_size_read(file->f_mapping->host),
		       store->bytes);
1025
		goto err;
1026
	}
1027

1028
	oldindex = ~0L;
1029
	offset = 0;
1030
	if (!bitmap->mddev->bitmap_info.external)
1031
		offset = sizeof(bitmap_super_t);
1032

1033 1034 1035
	if (mddev_is_clustered(bitmap->mddev))
		node_offset = bitmap->cluster_slot * (DIV_ROUND_UP(store->bytes, PAGE_SIZE));

1036
	for (i = 0; i < chunks; i++) {
1037
		int b;
1038 1039
		index = file_page_index(&bitmap->storage, i);
		bit = file_page_offset(&bitmap->storage, i);
1040
		if (index != oldindex) { /* this is a new page, read it in */
1041
			int count;
1042
			/* unmap the old page, we're done with it */
1043 1044
			if (index == store->file_pages-1)
				count = store->bytes - index * PAGE_SIZE;
1045 1046
			else
				count = PAGE_SIZE;
1047
			page = store->filemap[index];
1048 1049 1050 1051 1052 1053 1054 1055
			if (file)
				ret = read_page(file, index, bitmap,
						count, page);
			else
				ret = read_sb_page(
					bitmap->mddev,
					bitmap->mddev->bitmap_info.offset,
					page,
1056
					index + node_offset, count);
1057 1058

			if (ret)
1059
				goto err;
1060

1061 1062 1063 1064 1065
			oldindex = index;

			if (outofdate) {
				/*
				 * if bitmap is out of date, dirty the
1066
				 * whole page and write it out
1067
				 */
1068
				paddr = kmap_atomic(page);
1069
				memset(paddr + offset, 0xff,
1070
				       PAGE_SIZE - offset);
1071
				kunmap_atomic(paddr);
1072 1073 1074
				write_page(bitmap, page, 1);

				ret = -EIO;
1075 1076
				if (test_bit(BITMAP_WRITE_ERROR,
					     &bitmap->flags))
1077
					goto err;
1078 1079
			}
		}
1080
		paddr = kmap_atomic(page);
1081
		if (test_bit(BITMAP_HOSTENDIAN, &bitmap->flags))
1082
			b = test_bit(bit, paddr);
1083
		else
A
Akinobu Mita 已提交
1084
			b = test_bit_le(bit, paddr);
1085
		kunmap_atomic(paddr);
1086
		if (b) {
1087
			/* if the disk bit is set, set the memory bit */
1088
			int needed = ((sector_t)(i+1) << bitmap->counts.chunkshift
1089 1090
				      >= start);
			bitmap_set_memory_bits(bitmap,
1091
					       (sector_t)i << bitmap->counts.chunkshift,
1092
					       needed);
1093 1094
			bit_cnt++;
		}
1095
		offset = 0;
1096 1097 1098
	}

	printk(KERN_INFO "%s: bitmap initialized from disk: "
1099
	       "read %lu pages, set %lu of %lu bits\n",
1100
	       bmname(bitmap), store->file_pages,
1101
	       bit_cnt, chunks);
1102 1103

	return 0;
1104

1105 1106 1107
 err:
	printk(KERN_INFO "%s: bitmap initialisation failed: %d\n",
	       bmname(bitmap), ret);
1108 1109 1110
	return ret;
}

1111 1112 1113 1114 1115
void bitmap_write_all(struct bitmap *bitmap)
{
	/* We don't actually write all bitmap blocks here,
	 * just flag them as needing to be written
	 */
1116
	int i;
1117

1118
	if (!bitmap || !bitmap->storage.filemap)
1119
		return;
1120
	if (bitmap->storage.file)
1121 1122 1123
		/* Only one copy, so nothing needed */
		return;

1124
	for (i = 0; i < bitmap->storage.file_pages; i++)
1125
		set_page_attr(bitmap, i,
1126
			      BITMAP_PAGE_NEEDWRITE);
1127
	bitmap->allclean = 0;
1128 1129
}

1130 1131
static void bitmap_count_page(struct bitmap_counts *bitmap,
			      sector_t offset, int inc)
1132
{
1133
	sector_t chunk = offset >> bitmap->chunkshift;
1134 1135 1136 1137
	unsigned long page = chunk >> PAGE_COUNTER_SHIFT;
	bitmap->bp[page].count += inc;
	bitmap_checkfree(bitmap, page);
}
1138

1139
static void bitmap_set_pending(struct bitmap_counts *bitmap, sector_t offset)
1140 1141 1142 1143 1144 1145 1146 1147 1148
{
	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;
}

1149
static bitmap_counter_t *bitmap_get_counter(struct bitmap_counts *bitmap,
N
NeilBrown 已提交
1150
					    sector_t offset, sector_t *blocks,
1151 1152 1153 1154 1155 1156 1157
					    int create);

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

1158
void bitmap_daemon_work(struct mddev *mddev)
1159
{
1160
	struct bitmap *bitmap;
1161
	unsigned long j;
1162
	unsigned long nextpage;
N
NeilBrown 已提交
1163
	sector_t blocks;
1164
	struct bitmap_counts *counts;
1165

1166 1167 1168
	/* Use a mutex to guard daemon_work against
	 * bitmap_destroy.
	 */
1169
	mutex_lock(&mddev->bitmap_info.mutex);
1170 1171
	bitmap = mddev->bitmap;
	if (bitmap == NULL) {
1172
		mutex_unlock(&mddev->bitmap_info.mutex);
1173
		return;
1174
	}
1175
	if (time_before(jiffies, bitmap->daemon_lastrun
N
NeilBrown 已提交
1176
			+ mddev->bitmap_info.daemon_sleep))
1177 1178
		goto done;

1179
	bitmap->daemon_lastrun = jiffies;
1180
	if (bitmap->allclean) {
N
NeilBrown 已提交
1181
		mddev->thread->timeout = MAX_SCHEDULE_TIMEOUT;
1182
		goto done;
1183 1184
	}
	bitmap->allclean = 1;
1185

1186 1187 1188 1189
	/* 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.
	 */
1190
	for (j = 0; j < bitmap->storage.file_pages; j++)
1191 1192
		if (test_and_clear_page_attr(bitmap, j,
					     BITMAP_PAGE_PENDING))
1193
			set_page_attr(bitmap, j,
1194 1195 1196 1197 1198 1199 1200 1201
				      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;
1202 1203
		if (bitmap->storage.filemap) {
			sb = kmap_atomic(bitmap->storage.sb_page);
1204 1205 1206
			sb->events_cleared =
				cpu_to_le64(bitmap->events_cleared);
			kunmap_atomic(sb);
1207
			set_page_attr(bitmap, 0,
1208 1209
				      BITMAP_PAGE_NEEDWRITE);
		}
1210 1211 1212 1213
	}
	/* Now look at the bitmap counters and if any are '2' or '1',
	 * decrement and handle accordingly.
	 */
1214 1215
	counts = &bitmap->counts;
	spin_lock_irq(&counts->lock);
1216
	nextpage = 0;
1217
	for (j = 0; j < counts->chunks; j++) {
1218
		bitmap_counter_t *bmc;
1219
		sector_t  block = (sector_t)j << counts->chunkshift;
1220

1221 1222
		if (j == nextpage) {
			nextpage += PAGE_COUNTER_RATIO;
1223
			if (!counts->bp[j >> PAGE_COUNTER_SHIFT].pending) {
1224
				j |= PAGE_COUNTER_MASK;
1225 1226
				continue;
			}
1227
			counts->bp[j >> PAGE_COUNTER_SHIFT].pending = 0;
1228
		}
1229
		bmc = bitmap_get_counter(counts,
1230
					 block,
1231
					 &blocks, 0);
1232 1233

		if (!bmc) {
1234
			j |= PAGE_COUNTER_MASK;
1235 1236 1237 1238 1239
			continue;
		}
		if (*bmc == 1 && !bitmap->need_sync) {
			/* We can clear the bit */
			*bmc = 0;
1240
			bitmap_count_page(counts, block, -1);
1241
			bitmap_file_clear_bit(bitmap, block);
1242 1243
		} else if (*bmc && *bmc <= 2) {
			*bmc = 1;
1244
			bitmap_set_pending(counts, block);
1245
			bitmap->allclean = 0;
1246
		}
1247
	}
1248
	spin_unlock_irq(&counts->lock);
1249

1250 1251 1252 1253 1254 1255 1256 1257
	/* 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.
	 */
1258 1259 1260 1261
	for (j = 0;
	     j < bitmap->storage.file_pages
		     && !test_bit(BITMAP_STALE, &bitmap->flags);
	     j++) {
1262
		if (test_page_attr(bitmap, j,
1263 1264 1265
				   BITMAP_PAGE_DIRTY))
			/* bitmap_unplug will handle the rest */
			break;
1266 1267
		if (test_and_clear_page_attr(bitmap, j,
					     BITMAP_PAGE_NEEDWRITE)) {
1268
			write_page(bitmap, bitmap->storage.filemap[j], 0);
1269 1270 1271
		}
	}

1272
 done:
1273
	if (bitmap->allclean == 0)
N
NeilBrown 已提交
1274 1275
		mddev->thread->timeout =
			mddev->bitmap_info.daemon_sleep;
1276
	mutex_unlock(&mddev->bitmap_info.mutex);
1277 1278
}

1279
static bitmap_counter_t *bitmap_get_counter(struct bitmap_counts *bitmap,
N
NeilBrown 已提交
1280
					    sector_t offset, sector_t *blocks,
1281
					    int create)
1282 1283
__releases(bitmap->lock)
__acquires(bitmap->lock)
1284 1285 1286 1287 1288
{
	/* 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.
	 */
1289
	sector_t chunk = offset >> bitmap->chunkshift;
1290 1291 1292
	unsigned long page = chunk >> PAGE_COUNTER_SHIFT;
	unsigned long pageoff = (chunk & PAGE_COUNTER_MASK) << COUNTER_BYTE_SHIFT;
	sector_t csize;
1293
	int err;
1294

1295 1296 1297 1298
	err = bitmap_checkpage(bitmap, page, create);

	if (bitmap->bp[page].hijacked ||
	    bitmap->bp[page].map == NULL)
1299
		csize = ((sector_t)1) << (bitmap->chunkshift +
1300 1301
					  PAGE_COUNTER_SHIFT - 1);
	else
1302
		csize = ((sector_t)1) << bitmap->chunkshift;
1303 1304 1305
	*blocks = csize - (offset & (csize - 1));

	if (err < 0)
1306
		return NULL;
1307

1308 1309 1310 1311 1312 1313 1314 1315
	/* 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];
1316
	} else /* page is allocated */
1317 1318 1319 1320
		return (bitmap_counter_t *)
			&(bitmap->bp[page].map[pageoff]);
}

1321
int bitmap_startwrite(struct bitmap *bitmap, sector_t offset, unsigned long sectors, int behind)
1322
{
1323 1324
	if (!bitmap)
		return 0;
1325 1326

	if (behind) {
1327
		int bw;
1328
		atomic_inc(&bitmap->behind_writes);
1329 1330 1331 1332
		bw = atomic_read(&bitmap->behind_writes);
		if (bw > bitmap->behind_writes_used)
			bitmap->behind_writes_used = bw;

1333 1334
		pr_debug("inc write-behind count %d/%lu\n",
			 bw, bitmap->mddev->bitmap_info.max_write_behind);
1335 1336
	}

1337
	while (sectors) {
N
NeilBrown 已提交
1338
		sector_t blocks;
1339 1340
		bitmap_counter_t *bmc;

1341 1342
		spin_lock_irq(&bitmap->counts.lock);
		bmc = bitmap_get_counter(&bitmap->counts, offset, &blocks, 1);
1343
		if (!bmc) {
1344
			spin_unlock_irq(&bitmap->counts.lock);
1345 1346 1347
			return 0;
		}

1348
		if (unlikely(COUNTER(*bmc) == COUNTER_MAX)) {
1349 1350 1351 1352 1353 1354 1355
			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);
1356
			spin_unlock_irq(&bitmap->counts.lock);
1357
			schedule();
1358 1359 1360 1361
			finish_wait(&bitmap->overflow_wait, &__wait);
			continue;
		}

1362
		switch (*bmc) {
1363 1364
		case 0:
			bitmap_file_set_bit(bitmap, offset);
1365
			bitmap_count_page(&bitmap->counts, offset, 1);
1366 1367 1368 1369
			/* fall through */
		case 1:
			*bmc = 2;
		}
1370

1371 1372
		(*bmc)++;

1373
		spin_unlock_irq(&bitmap->counts.lock);
1374 1375 1376 1377

		offset += blocks;
		if (sectors > blocks)
			sectors -= blocks;
1378 1379
		else
			sectors = 0;
1380 1381 1382
	}
	return 0;
}
1383
EXPORT_SYMBOL(bitmap_startwrite);
1384 1385

void bitmap_endwrite(struct bitmap *bitmap, sector_t offset, unsigned long sectors,
1386
		     int success, int behind)
1387
{
1388 1389
	if (!bitmap)
		return;
1390
	if (behind) {
1391 1392
		if (atomic_dec_and_test(&bitmap->behind_writes))
			wake_up(&bitmap->behind_wait);
1393 1394 1395
		pr_debug("dec write-behind count %d/%lu\n",
			 atomic_read(&bitmap->behind_writes),
			 bitmap->mddev->bitmap_info.max_write_behind);
1396 1397
	}

1398
	while (sectors) {
N
NeilBrown 已提交
1399
		sector_t blocks;
1400 1401 1402
		unsigned long flags;
		bitmap_counter_t *bmc;

1403 1404
		spin_lock_irqsave(&bitmap->counts.lock, flags);
		bmc = bitmap_get_counter(&bitmap->counts, offset, &blocks, 0);
1405
		if (!bmc) {
1406
			spin_unlock_irqrestore(&bitmap->counts.lock, flags);
1407 1408 1409
			return;
		}

1410
		if (success && !bitmap->mddev->degraded &&
1411 1412 1413
		    bitmap->events_cleared < bitmap->mddev->events) {
			bitmap->events_cleared = bitmap->mddev->events;
			bitmap->need_sync = 1;
1414
			sysfs_notify_dirent_safe(bitmap->sysfs_can_clear);
1415 1416
		}

1417
		if (!success && !NEEDED(*bmc))
1418 1419
			*bmc |= NEEDED_MASK;

1420
		if (COUNTER(*bmc) == COUNTER_MAX)
1421 1422
			wake_up(&bitmap->overflow_wait);

1423
		(*bmc)--;
1424
		if (*bmc <= 2) {
1425
			bitmap_set_pending(&bitmap->counts, offset);
1426 1427
			bitmap->allclean = 0;
		}
1428
		spin_unlock_irqrestore(&bitmap->counts.lock, flags);
1429 1430 1431
		offset += blocks;
		if (sectors > blocks)
			sectors -= blocks;
1432 1433
		else
			sectors = 0;
1434 1435
	}
}
1436
EXPORT_SYMBOL(bitmap_endwrite);
1437

N
NeilBrown 已提交
1438
static int __bitmap_start_sync(struct bitmap *bitmap, sector_t offset, sector_t *blocks,
1439
			       int degraded)
1440 1441 1442 1443 1444 1445 1446
{
	bitmap_counter_t *bmc;
	int rv;
	if (bitmap == NULL) {/* FIXME or bitmap set as 'failed' */
		*blocks = 1024;
		return 1; /* always resync if no bitmap */
	}
1447 1448
	spin_lock_irq(&bitmap->counts.lock);
	bmc = bitmap_get_counter(&bitmap->counts, offset, blocks, 0);
1449 1450 1451 1452 1453 1454 1455
	rv = 0;
	if (bmc) {
		/* locked */
		if (RESYNC(*bmc))
			rv = 1;
		else if (NEEDED(*bmc)) {
			rv = 1;
1456 1457 1458 1459
			if (!degraded) { /* don't set/clear bits if degraded */
				*bmc |= RESYNC_MASK;
				*bmc &= ~NEEDED_MASK;
			}
1460 1461
		}
	}
1462
	spin_unlock_irq(&bitmap->counts.lock);
1463 1464 1465
	return rv;
}

N
NeilBrown 已提交
1466
int bitmap_start_sync(struct bitmap *bitmap, sector_t offset, sector_t *blocks,
1467 1468 1469 1470 1471 1472 1473 1474 1475 1476
		      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 已提交
1477
	sector_t blocks1;
1478 1479 1480 1481 1482 1483 1484 1485 1486 1487

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

N
NeilBrown 已提交
1490
void bitmap_end_sync(struct bitmap *bitmap, sector_t offset, sector_t *blocks, int aborted)
1491 1492 1493
{
	bitmap_counter_t *bmc;
	unsigned long flags;
1494 1495

	if (bitmap == NULL) {
1496 1497 1498
		*blocks = 1024;
		return;
	}
1499 1500
	spin_lock_irqsave(&bitmap->counts.lock, flags);
	bmc = bitmap_get_counter(&bitmap->counts, offset, blocks, 0);
1501 1502 1503 1504 1505 1506 1507 1508 1509
	if (bmc == NULL)
		goto unlock;
	/* locked */
	if (RESYNC(*bmc)) {
		*bmc &= ~RESYNC_MASK;

		if (!NEEDED(*bmc) && aborted)
			*bmc |= NEEDED_MASK;
		else {
1510
			if (*bmc <= 2) {
1511
				bitmap_set_pending(&bitmap->counts, offset);
1512 1513
				bitmap->allclean = 0;
			}
1514 1515 1516
		}
	}
 unlock:
1517
	spin_unlock_irqrestore(&bitmap->counts.lock, flags);
1518
}
1519
EXPORT_SYMBOL(bitmap_end_sync);
1520 1521 1522 1523 1524 1525 1526 1527

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 已提交
1528
	sector_t blocks;
N
NeilBrown 已提交
1529 1530
	if (!bitmap)
		return;
1531 1532
	while (sector < bitmap->mddev->resync_max_sectors) {
		bitmap_end_sync(bitmap, sector, &blocks, 0);
N
NeilBrown 已提交
1533 1534 1535
		sector += blocks;
	}
}
1536
EXPORT_SYMBOL(bitmap_close_sync);
N
NeilBrown 已提交
1537 1538 1539 1540

void bitmap_cond_end_sync(struct bitmap *bitmap, sector_t sector)
{
	sector_t s = 0;
N
NeilBrown 已提交
1541
	sector_t blocks;
N
NeilBrown 已提交
1542 1543 1544 1545 1546 1547 1548 1549

	if (!bitmap)
		return;
	if (sector == 0) {
		bitmap->last_end_sync = jiffies;
		return;
	}
	if (time_before(jiffies, (bitmap->last_end_sync
1550
				  + bitmap->mddev->bitmap_info.daemon_sleep)))
N
NeilBrown 已提交
1551 1552 1553 1554
		return;
	wait_event(bitmap->mddev->recovery_wait,
		   atomic_read(&bitmap->mddev->recovery_active) == 0);

1555
	bitmap->mddev->curr_resync_completed = sector;
1556
	set_bit(MD_CHANGE_CLEAN, &bitmap->mddev->flags);
1557
	sector &= ~((1ULL << bitmap->counts.chunkshift) - 1);
N
NeilBrown 已提交
1558 1559 1560 1561
	s = 0;
	while (s < sector && s < bitmap->mddev->resync_max_sectors) {
		bitmap_end_sync(bitmap, s, &blocks, 0);
		s += blocks;
1562
	}
N
NeilBrown 已提交
1563
	bitmap->last_end_sync = jiffies;
1564
	sysfs_notify(&bitmap->mddev->kobj, NULL, "sync_completed");
1565
}
1566
EXPORT_SYMBOL(bitmap_cond_end_sync);
1567

1568
static void bitmap_set_memory_bits(struct bitmap *bitmap, sector_t offset, int needed)
1569 1570
{
	/* For each chunk covered by any of these sectors, set the
1571
	 * counter to 2 and possibly set resync_needed.  They should all
1572 1573
	 * be 0 at this point
	 */
1574

N
NeilBrown 已提交
1575
	sector_t secs;
1576
	bitmap_counter_t *bmc;
1577 1578
	spin_lock_irq(&bitmap->counts.lock);
	bmc = bitmap_get_counter(&bitmap->counts, offset, &secs, 1);
1579
	if (!bmc) {
1580
		spin_unlock_irq(&bitmap->counts.lock);
1581
		return;
1582
	}
1583
	if (!*bmc) {
1584
		*bmc = 2 | (needed ? NEEDED_MASK : 0);
1585 1586
		bitmap_count_page(&bitmap->counts, offset, 1);
		bitmap_set_pending(&bitmap->counts, offset);
1587
		bitmap->allclean = 0;
1588
	}
1589
	spin_unlock_irq(&bitmap->counts.lock);
1590 1591
}

1592 1593 1594 1595 1596 1597
/* 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++) {
1598
		sector_t sec = (sector_t)chunk << bitmap->counts.chunkshift;
1599 1600
		bitmap_set_memory_bits(bitmap, sec, 1);
		bitmap_file_set_bit(bitmap, sec);
1601 1602 1603 1604 1605 1606
		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;
1607 1608 1609
	}
}

1610 1611 1612
/*
 * flush out any pending updates
 */
1613
void bitmap_flush(struct mddev *mddev)
1614 1615
{
	struct bitmap *bitmap = mddev->bitmap;
1616
	long sleep;
1617 1618 1619 1620 1621 1622 1623

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

	/* run the daemon_work three time to ensure everything is flushed
	 * that can be
	 */
1624
	sleep = mddev->bitmap_info.daemon_sleep * 2;
1625
	bitmap->daemon_lastrun -= sleep;
1626
	bitmap_daemon_work(mddev);
1627
	bitmap->daemon_lastrun -= sleep;
1628
	bitmap_daemon_work(mddev);
1629
	bitmap->daemon_lastrun -= sleep;
1630
	bitmap_daemon_work(mddev);
1631 1632 1633
	bitmap_update_sb(bitmap);
}

1634 1635 1636
/*
 * free memory that was allocated
 */
1637
static void bitmap_free(struct bitmap *bitmap)
1638 1639 1640 1641 1642 1643 1644
{
	unsigned long k, pages;
	struct bitmap_page *bp;

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

1645 1646
	if (mddev_is_clustered(bitmap->mddev) && bitmap->mddev->cluster_info &&
		bitmap->cluster_slot == md_cluster_ops->slot_number(bitmap->mddev))
1647 1648
		md_cluster_stop(bitmap->mddev);

1649 1650 1651 1652 1653 1654
	/* 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);
1655

1656 1657
	bp = bitmap->counts.bp;
	pages = bitmap->counts.pages;
1658 1659 1660 1661 1662 1663 1664 1665 1666 1667

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

1669
void bitmap_destroy(struct mddev *mddev)
1670 1671 1672 1673 1674 1675
{
	struct bitmap *bitmap = mddev->bitmap;

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

1676
	mutex_lock(&mddev->bitmap_info.mutex);
1677
	spin_lock(&mddev->lock);
1678
	mddev->bitmap = NULL; /* disconnect from the md device */
1679
	spin_unlock(&mddev->lock);
1680
	mutex_unlock(&mddev->bitmap_info.mutex);
1681 1682
	if (mddev->thread)
		mddev->thread->timeout = MAX_SCHEDULE_TIMEOUT;
1683

1684 1685 1686
	if (bitmap->sysfs_can_clear)
		sysfs_put(bitmap->sysfs_can_clear);

1687 1688
	bitmap_free(bitmap);
}
1689 1690 1691 1692 1693

/*
 * initialize the bitmap structure
 * if this returns an error, bitmap_destroy must be called to do clean up
 */
1694
struct bitmap *bitmap_create(struct mddev *mddev, int slot)
1695 1696
{
	struct bitmap *bitmap;
1697
	sector_t blocks = mddev->resync_max_sectors;
1698
	struct file *file = mddev->bitmap_info.file;
1699
	int err;
1700
	struct kernfs_node *bm = NULL;
1701

A
Alexey Dobriyan 已提交
1702
	BUILD_BUG_ON(sizeof(bitmap_super_t) != 256);
1703

1704
	BUG_ON(file && mddev->bitmap_info.offset);
1705

1706
	bitmap = kzalloc(sizeof(*bitmap), GFP_KERNEL);
1707
	if (!bitmap)
1708
		return ERR_PTR(-ENOMEM);
1709

1710
	spin_lock_init(&bitmap->counts.lock);
1711 1712
	atomic_set(&bitmap->pending_writes, 0);
	init_waitqueue_head(&bitmap->write_wait);
1713
	init_waitqueue_head(&bitmap->overflow_wait);
1714
	init_waitqueue_head(&bitmap->behind_wait);
1715

1716
	bitmap->mddev = mddev;
1717
	bitmap->cluster_slot = slot;
1718

1719
	if (mddev->kobj.sd)
T
Tejun Heo 已提交
1720
		bm = sysfs_get_dirent(mddev->kobj.sd, "bitmap");
1721
	if (bm) {
T
Tejun Heo 已提交
1722
		bitmap->sysfs_can_clear = sysfs_get_dirent(bm, "can_clear");
1723 1724 1725 1726
		sysfs_put(bm);
	} else
		bitmap->sysfs_can_clear = NULL;

1727
	bitmap->storage.file = file;
1728 1729
	if (file) {
		get_file(file);
1730 1731 1732 1733
		/* As future accesses to this file will use bmap,
		 * and bypass the page cache, we must sync the file
		 * first.
		 */
1734
		vfs_fsync(file, 1);
1735
	}
1736
	/* read superblock from bitmap file (this sets mddev->bitmap_info.chunksize) */
1737 1738 1739 1740 1741 1742 1743 1744 1745 1746
	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 {
1747 1748 1749 1750 1751 1752 1753
		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;
	}
1754
	if (err)
1755
		goto error;
1756

1757
	bitmap->daemon_lastrun = jiffies;
1758 1759
	err = bitmap_resize(bitmap, blocks, mddev->bitmap_info.chunksize, 1);
	if (err)
1760
		goto error;
1761

1762
	printk(KERN_INFO "created bitmap (%lu pages) for device %s\n",
1763
	       bitmap->counts.pages, bmname(bitmap));
1764

1765 1766 1767
	err = test_bit(BITMAP_WRITE_ERROR, &bitmap->flags) ? -EIO : 0;
	if (err)
		goto error;
1768

1769
	return bitmap;
1770 1771
 error:
	bitmap_free(bitmap);
1772
	return ERR_PTR(err);
1773 1774
}

1775
int bitmap_load(struct mddev *mddev)
1776 1777
{
	int err = 0;
1778
	sector_t start = 0;
1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790
	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 已提交
1791
		sector_t blocks;
1792 1793 1794 1795 1796
		bitmap_start_sync(bitmap, sector, &blocks, 0);
		sector += blocks;
	}
	bitmap_close_sync(bitmap);

1797 1798 1799 1800 1801 1802
	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;

1803
	mutex_lock(&mddev->bitmap_info.mutex);
1804
	err = bitmap_init_from_disk(bitmap, start);
1805
	mutex_unlock(&mddev->bitmap_info.mutex);
1806

1807
	if (err)
1808
		goto out;
1809
	clear_bit(BITMAP_STALE, &bitmap->flags);
1810 1811 1812

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

1814
	mddev->thread->timeout = mddev->bitmap_info.daemon_sleep;
1815
	md_wakeup_thread(mddev->thread);
1816

1817 1818
	bitmap_update_sb(bitmap);

1819
	if (test_bit(BITMAP_WRITE_ERROR, &bitmap->flags))
1820 1821
		err = -EIO;
out:
1822
	return err;
1823
}
1824
EXPORT_SYMBOL_GPL(bitmap_load);
1825

1826 1827 1828
void bitmap_status(struct seq_file *seq, struct bitmap *bitmap)
{
	unsigned long chunk_kb;
1829
	struct bitmap_counts *counts;
1830 1831 1832 1833

	if (!bitmap)
		return;

1834 1835
	counts = &bitmap->counts;

1836 1837 1838
	chunk_kb = bitmap->mddev->bitmap_info.chunksize >> 10;
	seq_printf(seq, "bitmap: %lu/%lu pages [%luKB], "
		   "%lu%s chunk",
1839 1840 1841
		   counts->pages - counts->missing_pages,
		   counts->pages,
		   (counts->pages - counts->missing_pages)
1842 1843 1844
		   << (PAGE_SHIFT - 10),
		   chunk_kb ? chunk_kb : bitmap->mddev->bitmap_info.chunksize,
		   chunk_kb ? "KB" : "B");
1845
	if (bitmap->storage.file) {
1846
		seq_printf(seq, ", file: ");
1847
		seq_path(seq, &bitmap->storage.file->f_path, " \t\n");
1848 1849 1850 1851 1852
	}

	seq_printf(seq, "\n");
}

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
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,
1910 1911
					   !bitmap->mddev->bitmap_info.external,
					   bitmap->cluster_slot);
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 1964 1965 1966 1967 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 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017
	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);

2018
static ssize_t
2019
location_show(struct mddev *mddev, char *page)
2020 2021
{
	ssize_t len;
2022
	if (mddev->bitmap_info.file)
2023
		len = sprintf(page, "file");
2024
	else if (mddev->bitmap_info.offset)
2025
		len = sprintf(page, "%+lld", (long long)mddev->bitmap_info.offset);
2026
	else
2027 2028 2029 2030 2031 2032
		len = sprintf(page, "none");
	len += sprintf(page+len, "\n");
	return len;
}

static ssize_t
2033
location_store(struct mddev *mddev, const char *buf, size_t len)
2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069
{

	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] == '+')
2070
				rv = kstrtoll(buf+1, 10, &offset);
2071
			else
2072
				rv = kstrtoll(buf, 10, &offset);
2073 2074 2075 2076
			if (rv)
				return rv;
			if (offset == 0)
				return -EINVAL;
2077 2078
			if (mddev->bitmap_info.external == 0 &&
			    mddev->major_version == 0 &&
2079 2080 2081 2082
			    offset != mddev->bitmap_info.default_offset)
				return -EINVAL;
			mddev->bitmap_info.offset = offset;
			if (mddev->pers) {
2083
				struct bitmap *bitmap;
2084
				mddev->pers->quiesce(mddev, 1);
2085 2086 2087 2088 2089
				bitmap = bitmap_create(mddev, -1);
				if (IS_ERR(bitmap))
					rv = PTR_ERR(bitmap);
				else {
					mddev->bitmap = bitmap;
2090
					rv = bitmap_load(mddev);
2091 2092 2093 2094
					if (rv) {
						bitmap_destroy(mddev);
						mddev->bitmap_info.offset = 0;
					}
2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114
				}
				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);

2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138
/* '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 &&
2139
	    sectors < (mddev->bitmap->storage.bytes + 511) >> 9)
2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151
		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);

2152
static ssize_t
2153
timeout_show(struct mddev *mddev, char *page)
2154 2155 2156 2157
{
	ssize_t len;
	unsigned long secs = mddev->bitmap_info.daemon_sleep / HZ;
	unsigned long jifs = mddev->bitmap_info.daemon_sleep % HZ;
2158

2159 2160 2161 2162 2163 2164 2165 2166
	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
2167
timeout_store(struct mddev *mddev, const char *buf, size_t len)
2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202
{
	/* 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
2203
backlog_show(struct mddev *mddev, char *page)
2204 2205 2206 2207 2208
{
	return sprintf(page, "%lu\n", mddev->bitmap_info.max_write_behind);
}

static ssize_t
2209
backlog_store(struct mddev *mddev, const char *buf, size_t len)
2210 2211
{
	unsigned long backlog;
2212
	int rv = kstrtoul(buf, 10, &backlog);
2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224
	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
2225
chunksize_show(struct mddev *mddev, char *page)
2226 2227 2228 2229 2230
{
	return sprintf(page, "%lu\n", mddev->bitmap_info.chunksize);
}

static ssize_t
2231
chunksize_store(struct mddev *mddev, const char *buf, size_t len)
2232 2233 2234 2235 2236 2237
{
	/* Can only be changed when no bitmap is active */
	int rv;
	unsigned long csize;
	if (mddev->bitmap)
		return -EBUSY;
2238
	rv = kstrtoul(buf, 10, &csize);
2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250
	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);

2251
static ssize_t metadata_show(struct mddev *mddev, char *page)
2252
{
G
Goldwyn Rodrigues 已提交
2253 2254
	if (mddev_is_clustered(mddev))
		return sprintf(page, "clustered\n");
2255 2256 2257 2258
	return sprintf(page, "%s\n", (mddev->bitmap_info.external
				      ? "external" : "internal"));
}

2259
static ssize_t metadata_store(struct mddev *mddev, const char *buf, size_t len)
2260 2261 2262 2263 2264 2265 2266
{
	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 已提交
2267 2268
	else if ((strncmp(buf, "internal", 8) == 0) ||
			(strncmp(buf, "clustered", 9) == 0))
2269 2270 2271 2272 2273 2274 2275 2276 2277
		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);

2278
static ssize_t can_clear_show(struct mddev *mddev, char *page)
2279 2280
{
	int len;
2281
	spin_lock(&mddev->lock);
2282 2283 2284 2285 2286
	if (mddev->bitmap)
		len = sprintf(page, "%s\n", (mddev->bitmap->need_sync ?
					     "false" : "true"));
	else
		len = sprintf(page, "\n");
2287
	spin_unlock(&mddev->lock);
2288 2289 2290
	return len;
}

2291
static ssize_t can_clear_store(struct mddev *mddev, const char *buf, size_t len)
2292 2293 2294 2295 2296 2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308
{
	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);

2309
static ssize_t
2310
behind_writes_used_show(struct mddev *mddev, char *page)
2311
{
2312 2313
	ssize_t ret;
	spin_lock(&mddev->lock);
2314
	if (mddev->bitmap == NULL)
2315 2316 2317 2318 2319 2320
		ret = sprintf(page, "0\n");
	else
		ret = sprintf(page, "%lu\n",
			      mddev->bitmap->behind_writes_used);
	spin_unlock(&mddev->lock);
	return ret;
2321 2322 2323
}

static ssize_t
2324
behind_writes_used_reset(struct mddev *mddev, const char *buf, size_t len)
2325 2326 2327 2328 2329 2330 2331 2332 2333 2334
{
	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);

2335 2336
static struct attribute *md_bitmap_attrs[] = {
	&bitmap_location.attr,
2337
	&bitmap_space.attr,
2338 2339 2340
	&bitmap_timeout.attr,
	&bitmap_backlog.attr,
	&bitmap_chunksize.attr,
2341 2342
	&bitmap_metadata.attr,
	&bitmap_can_clear.attr,
2343
	&max_backlog_used.attr,
2344 2345 2346 2347 2348 2349 2350
	NULL
};
struct attribute_group md_bitmap_group = {
	.name = "bitmap",
	.attrs = md_bitmap_attrs,
};