bitmap.c 56.2 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17
/*
 * bitmap.c two-level bitmap (C) Peter T. Breuer (ptb@ot.uc3m.es) 2003
 *
 * bitmap_create  - sets up the bitmap structure
 * bitmap_destroy - destroys the bitmap structure
 *
 * additions, Copyright (C) 2003-2004, Paul Clements, SteelEye Technology, Inc.:
 * - added disk storage for bitmap
 * - changes to allow various bitmap chunk sizes
 */

/*
 * Still to do:
 *
 * flush after percent set rather than just time based. (maybe both).
 */

18
#include <linux/blkdev.h>
19 20 21 22 23 24 25 26 27 28
#include <linux/module.h>
#include <linux/errno.h>
#include <linux/slab.h>
#include <linux/init.h>
#include <linux/timer.h>
#include <linux/sched.h>
#include <linux/list.h>
#include <linux/file.h>
#include <linux/mount.h>
#include <linux/buffer_head.h>
29
#include <linux/seq_file.h>
30
#include "md.h"
31
#include "bitmap.h"
32

33
static inline char *bmname(struct bitmap *bitmap)
34 35 36 37 38 39 40 41 42 43 44 45 46 47
{
	return bitmap->mddev ? mdname(bitmap->mddev) : "mdX";
}

/*
 * check a page and, if necessary, allocate it (or hijack it if the alloc fails)
 *
 * 1) check to see if this page is allocated, if it's not then try to alloc
 * 2) if the alloc fails, set the page's hijacked flag so we'll use the
 *    page pointer directly as a counter
 *
 * if we find our page, we increment the page's refcount so that it stays
 * allocated while we're using it
 */
48 49
static int bitmap_checkpage(struct bitmap *bitmap,
			    unsigned long page, int create)
50 51
__releases(bitmap->lock)
__acquires(bitmap->lock)
52 53 54 55
{
	unsigned char *mappage;

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

	if (bitmap->bp[page].hijacked) /* it's hijacked, don't try to alloc */
		return 0;

	if (bitmap->bp[page].map) /* page is already allocated, just return */
		return 0;

	if (!create)
		return -ENOENT;

	/* this page has not been allocated yet */

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

	if (mappage == NULL) {
79 80
		pr_debug("%s: bitmap map page allocation failed, hijacking\n",
			 bmname(bitmap));
81 82 83 84
		/* failed - set the hijacked flag so that we can use the
		 * pointer as a counter */
		if (!bitmap->bp[page].map)
			bitmap->bp[page].hijacked = 1;
85 86
	} else if (bitmap->bp[page].map ||
		   bitmap->bp[page].hijacked) {
87
		/* somebody beat us to getting the page */
88
		kfree(mappage);
89
		return 0;
90
	} else {
91

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

94 95 96
		bitmap->bp[page].map = mappage;
		bitmap->missing_pages--;
	}
97 98 99 100 101 102
	return 0;
}

/* if page is completely empty, put it back on the free list, or dealloc it */
/* if page was hijacked, unmark the flag so it might get alloced next time */
/* Note: lock should be held when calling this */
103
static void bitmap_checkfree(struct bitmap *bitmap, unsigned long page)
104 105 106 107 108 109 110 111 112 113 114
{
	char *ptr;

	if (bitmap->bp[page].count) /* page is still busy */
		return;

	/* page is no longer in use, it can be released */

	if (bitmap->bp[page].hijacked) { /* page was hijacked, undo this now */
		bitmap->bp[page].hijacked = 0;
		bitmap->bp[page].map = NULL;
115 116 117 118 119
	} else {
		/* normal case, free the page */
		ptr = bitmap->bp[page].map;
		bitmap->bp[page].map = NULL;
		bitmap->missing_pages++;
120
		kfree(ptr);
121 122 123 124 125 126 127 128 129 130 131
	}
}

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

/*
 * basic page I/O operations
 */

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

139
	struct md_rdev *rdev;
140
	sector_t target;
141
	int did_alloc = 0;
142

143
	if (!page) {
144
		page = alloc_page(GFP_KERNEL);
145 146 147 148
		if (!page)
			return ERR_PTR(-ENOMEM);
		did_alloc = 1;
	}
149

N
NeilBrown 已提交
150
	rdev_for_each(rdev, mddev) {
151 152
		if (! test_bit(In_sync, &rdev->flags)
		    || test_bit(Faulty, &rdev->flags))
153 154
			continue;

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

157
		if (sync_page_io(rdev, target,
158
				 roundup(size, bdev_logical_block_size(rdev->bdev)),
J
Jonathan Brassow 已提交
159
				 page, READ, true)) {
160
			page->index = index;
161 162
			attach_page_buffers(page, NULL); /* so that free_buffer will
							  * quietly no-op */
163 164 165
			return page;
		}
	}
166 167
	if (did_alloc)
		put_page(page);
168
	return ERR_PTR(-EIO);
169 170 171

}

172
static struct md_rdev *next_active_rdev(struct md_rdev *rdev, struct mddev *mddev)
173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192
{
	/* Iterate the disks of an mddev, using rcu to protect access to the
	 * linked list, and raising the refcount of devices we return to ensure
	 * they don't disappear while in use.
	 * As devices are only added or removed when raid_disk is < 0 and
	 * nr_pending is 0 and In_sync is clear, the entries we return will
	 * still be in the same position on the list when we re-enter
	 * list_for_each_continue_rcu.
	 */
	struct list_head *pos;
	rcu_read_lock();
	if (rdev == NULL)
		/* start at the beginning */
		pos = &mddev->disks;
	else {
		/* release the previous rdev and start from there. */
		rdev_dec_pending(rdev, mddev);
		pos = &rdev->same_set;
	}
	list_for_each_continue_rcu(pos, &mddev->disks) {
193
		rdev = list_entry(pos, struct md_rdev, same_set);
194 195 196 197 198 199 200 201 202 203 204 205
		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;
}

206
static int write_sb_page(struct bitmap *bitmap, struct page *page, int wait)
207
{
208
	struct md_rdev *rdev = NULL;
209
	struct block_device *bdev;
210
	struct mddev *mddev = bitmap->mddev;
211

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

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

218 219
		if (page->index == bitmap->file_pages-1)
			size = roundup(bitmap->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
		/* 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);
261
	}
262 263

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

 bad_alignment:
	return -EINVAL;
269 270
}

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

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

286
		bh = page_buffers(page);
287

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

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

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

309 310 311 312
	if (!uptodate) {
		spin_lock_irqsave(&bitmap->lock, flags);
		bitmap->flags |= BITMAP_WRITE_ERROR;
		spin_unlock_irqrestore(&bitmap->lock, flags);
313
	}
314 315 316
	if (atomic_dec_and_test(&bitmap->pending_writes))
		wake_up(&bitmap->write_wait);
}
317

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)
{
	struct buffer_head *bh = page_buffers(page);
329

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

339 340 341 342 343 344 345
/* 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.
 */
346
static struct page *read_page(struct file *file, unsigned long index,
347 348
			      struct bitmap *bitmap,
			      unsigned long count)
349 350
{
	struct page *page = NULL;
J
Josef Sipek 已提交
351
	struct inode *inode = file->f_path.dentry->d_inode;
352 353
	struct buffer_head *bh;
	sector_t block;
354

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

358 359 360
	page = alloc_page(GFP_KERNEL);
	if (!page)
		page = ERR_PTR(-ENOMEM);
361 362
	if (IS_ERR(page))
		goto out;
363 364 365

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

	wait_event(bitmap->write_wait,
		   atomic_read(&bitmap->pending_writes)==0);
	if (bitmap->flags & BITMAP_WRITE_ERROR) {
		free_buffers(page);
		page = ERR_PTR(-EIO);
	}
407 408
out:
	if (IS_ERR(page))
409
		printk(KERN_ALERT "md: bitmap read error: (%dB @ %llu): %ld\n",
410 411
			(int)PAGE_SIZE,
			(unsigned long long)index << PAGE_SHIFT,
412 413 414 415 416 417 418 419 420
			PTR_ERR(page));
	return page;
}

/*
 * bitmap file superblock operations
 */

/* update the event counter and sync the superblock to disk */
421
void bitmap_update_sb(struct bitmap *bitmap)
422 423 424 425
{
	bitmap_super_t *sb;

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

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

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

474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498
/*
 * bitmap_new_disk_sb
 * @bitmap
 *
 * This function is somewhat the reverse of bitmap_read_sb.  bitmap_read_sb
 * reads and verifies the on-disk bitmap superblock and populates bitmap_info.
 * This function verifies 'bitmap_info' and populates the on-disk bitmap
 * structure, which is to be written to disk.
 *
 * Returns: 0 on success, -Exxx on error
 */
static int bitmap_new_disk_sb(struct bitmap *bitmap)
{
	bitmap_super_t *sb;
	unsigned long chunksize, daemon_sleep, write_behind;
	int err = -EINVAL;

	bitmap->sb_page = alloc_page(GFP_KERNEL);
	if (IS_ERR(bitmap->sb_page)) {
		err = PTR_ERR(bitmap->sb_page);
		bitmap->sb_page = NULL;
		return err;
	}
	bitmap->sb_page->index = 0;

499
	sb = kmap_atomic(bitmap->sb_page);
500 501 502 503 504 505 506

	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)) {
507
		kunmap_atomic(sb);
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 535 536 537 538 539 540 541
		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);

	bitmap->flags |= BITMAP_STALE;
	sb->state |= cpu_to_le32(BITMAP_STALE);
	bitmap->events_cleared = bitmap->mddev->events;
	sb->events_cleared = cpu_to_le64(bitmap->mddev->events);

542
	kunmap_atomic(sb);
543 544 545 546

	return 0;
}

547 548 549 550 551
/* 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;
552
	unsigned long chunksize, daemon_sleep, write_behind;
553 554 555
	unsigned long long events;
	int err = -EINVAL;

556 557 558 559 560 561 562 563
	if (!bitmap->file && !bitmap->mddev->bitmap_info.offset) {
		chunksize = 128 * 1024 * 1024;
		daemon_sleep = 5 * HZ;
		write_behind = 0;
		bitmap->flags = BITMAP_STALE;
		err = 0;
		goto out_no_sb;
	}
564
	/* page 0 is the superblock, read it... */
565 566 567 568 569 570
	if (bitmap->file) {
		loff_t isize = i_size_read(bitmap->file->f_mapping->host);
		int bytes = isize > PAGE_SIZE ? PAGE_SIZE : isize;

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

582
	sb = kmap_atomic(bitmap->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 588 589 590

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

611 612 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);
			sb->state |= cpu_to_le32(BITMAP_STALE);
		}
631
	}
632

633
	/* assign fields using values from superblock */
634
	bitmap->flags |= le32_to_cpu(sb->state);
635 636
	if (le32_to_cpu(sb->version) == BITMAP_MAJOR_HOSTENDIAN)
		bitmap->flags |= BITMAP_HOSTENDIAN;
637 638 639
	bitmap->events_cleared = le64_to_cpu(sb->events_cleared);
	err = 0;
out:
640
	kunmap_atomic(sb);
641 642 643 644 645 646
out_no_sb:
	if (bitmap->flags & BITMAP_STALE)
		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;
647 648 649 650 651 652 653 654 655 656
	if (err)
		bitmap_print_sb(bitmap);
	return err;
}

enum bitmap_mask_op {
	MASK_SET,
	MASK_UNSET
};

657 658 659
/* record the state of the bitmap in the superblock.  Return the old value */
static int bitmap_mask_state(struct bitmap *bitmap, enum bitmap_state bits,
			     enum bitmap_mask_op op)
660 661
{
	bitmap_super_t *sb;
662
	int old;
663

664
	if (!bitmap->sb_page) /* can't set the state */
665
		return 0;
666
	sb = kmap_atomic(bitmap->sb_page);
667
	old = le32_to_cpu(sb->state) & bits;
668
	switch (op) {
669 670
	case MASK_SET:
		sb->state |= cpu_to_le32(bits);
671
		bitmap->flags |= bits;
672 673 674
		break;
	case MASK_UNSET:
		sb->state &= cpu_to_le32(~bits);
675
		bitmap->flags &= ~bits;
676 677 678
		break;
	default:
		BUG();
679
	}
680
	kunmap_atomic(sb);
681
	return old;
682 683 684 685 686 687
}

/*
 * general bitmap file operations
 */

688 689 690 691 692 693
/*
 * 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.
 */
694
/* calculate the index of the page that contains this bit */
695
static inline unsigned long file_page_index(struct bitmap *bitmap, unsigned long chunk)
696
{
697 698 699
	if (!bitmap->mddev->bitmap_info.external)
		chunk += sizeof(bitmap_super_t) << 3;
	return chunk >> PAGE_BIT_SHIFT;
700 701 702
}

/* calculate the (bit) offset of this bit within a page */
703
static inline unsigned long file_page_offset(struct bitmap *bitmap, unsigned long chunk)
704
{
705 706 707
	if (!bitmap->mddev->bitmap_info.external)
		chunk += sizeof(bitmap_super_t) << 3;
	return chunk & (PAGE_BITS - 1);
708 709 710 711 712 713 714 715 716 717
}

/*
 * return a pointer to the page in the filemap that contains the given bit
 *
 * this lookup is complicated by the fact that the bitmap sb might be exactly
 * 1 page (e.g., x86) or less than 1 page -- so the bitmap might start on page
 * 0 or page 1
 */
static inline struct page *filemap_get_page(struct bitmap *bitmap,
718
					    unsigned long chunk)
719
{
720 721
	if (file_page_index(bitmap, chunk) >= bitmap->file_pages)
		return NULL;
722 723
	return bitmap->filemap[file_page_index(bitmap, chunk)
			       - file_page_index(bitmap, 0)];
724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744
}

static void bitmap_file_unmap(struct bitmap *bitmap)
{
	struct page **map, *sb_page;
	unsigned long *attr;
	int pages;
	unsigned long flags;

	spin_lock_irqsave(&bitmap->lock, flags);
	map = bitmap->filemap;
	bitmap->filemap = NULL;
	attr = bitmap->filemap_attr;
	bitmap->filemap_attr = NULL;
	pages = bitmap->file_pages;
	bitmap->file_pages = 0;
	sb_page = bitmap->sb_page;
	bitmap->sb_page = NULL;
	spin_unlock_irqrestore(&bitmap->lock, flags);

	while (pages--)
745
		if (map[pages] != sb_page) /* 0 is sb_page, release it below */
746
			free_buffers(map[pages]);
747 748 749
	kfree(map);
	kfree(attr);

750 751
	if (sb_page)
		free_buffers(sb_page);
752 753 754 755 756 757 758 759 760 761 762 763
}

static void bitmap_file_put(struct bitmap *bitmap)
{
	struct file *file;
	unsigned long flags;

	spin_lock_irqsave(&bitmap->lock, flags);
	file = bitmap->file;
	bitmap->file = NULL;
	spin_unlock_irqrestore(&bitmap->lock, flags);

764 765 766
	if (file)
		wait_event(bitmap->write_wait,
			   atomic_read(&bitmap->pending_writes)==0);
767 768
	bitmap_file_unmap(bitmap);

769
	if (file) {
J
Josef Sipek 已提交
770
		struct inode *inode = file->f_path.dentry->d_inode;
771
		invalidate_mapping_pages(inode->i_mapping, 0, -1);
772
		fput(file);
773
	}
774 775 776 777 778 779 780 781 782 783 784
}

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

785 786
	if (bitmap_mask_state(bitmap, BITMAP_STALE, MASK_SET) == 0) {
		bitmap_update_sb(bitmap);
787

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

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

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

	bitmap_file_put(bitmap);

	return;
}

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

static inline void set_page_attr(struct bitmap *bitmap, struct page *page,
				enum bitmap_page_attr attr)
{
820
	__set_bit((page->index<<2) + attr, bitmap->filemap_attr);
821 822 823 824 825
}

static inline void clear_page_attr(struct bitmap *bitmap, struct page *page,
				enum bitmap_page_attr attr)
{
826
	__clear_bit((page->index<<2) + attr, bitmap->filemap_attr);
827 828
}

829 830
static inline unsigned long test_page_attr(struct bitmap *bitmap, struct page *page,
					   enum bitmap_page_attr attr)
831
{
832
	return test_bit((page->index<<2) + attr, bitmap->filemap_attr);
833 834 835 836 837 838 839 840 841 842 843 844
}

/*
 * 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;
845
	struct page *page;
846
	void *kaddr;
847
	unsigned long chunk = block >> bitmap->chunkshift;
848

849 850 851 852
	page = filemap_get_page(bitmap, chunk);
	if (!page)
		return;
	bit = file_page_offset(bitmap, chunk);
853

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

866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888
static void bitmap_file_clear_bit(struct bitmap *bitmap, sector_t block)
{
	unsigned long bit;
	struct page *page;
	void *paddr;
	unsigned long chunk = block >> bitmap->chunkshift;

	page = filemap_get_page(bitmap, chunk);
	if (!page)
		return;
	bit = file_page_offset(bitmap, chunk);
	paddr = kmap_atomic(page);
	if (bitmap->flags & BITMAP_HOSTENDIAN)
		clear_bit(bit, paddr);
	else
		__clear_bit_le(bit, paddr);
	kunmap_atomic(paddr);
	if (!test_page_attr(bitmap, page, BITMAP_PAGE_NEEDWRITE)) {
		set_page_attr(bitmap, page, BITMAP_PAGE_PENDING);
		bitmap->allclean = 0;
	}
}

889 890 891
/* 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 */
892
void bitmap_unplug(struct bitmap *bitmap)
893
{
894 895
	unsigned long i, flags;
	int dirty, need_write;
896 897 898
	struct page *page;
	int wait = 0;

899
	if (!bitmap || !bitmap->filemap)
900
		return;
901 902 903 904 905

	/* look at each page to see if there are any set bits that need to be
	 * flushed out to disk */
	for (i = 0; i < bitmap->file_pages; i++) {
		spin_lock_irqsave(&bitmap->lock, flags);
906
		if (!bitmap->filemap) {
907
			spin_unlock_irqrestore(&bitmap->lock, flags);
908
			return;
909 910
		}
		page = bitmap->filemap[i];
911 912
		dirty = test_page_attr(bitmap, page, BITMAP_PAGE_DIRTY);
		need_write = test_page_attr(bitmap, page, BITMAP_PAGE_NEEDWRITE);
913 914
		clear_page_attr(bitmap, page, BITMAP_PAGE_DIRTY);
		clear_page_attr(bitmap, page, BITMAP_PAGE_NEEDWRITE);
915 916
		if (dirty || need_write)
			clear_page_attr(bitmap, page, BITMAP_PAGE_PENDING);
917
		if (dirty)
918 919 920
			wait = 1;
		spin_unlock_irqrestore(&bitmap->lock, flags);

921
		if (dirty || need_write)
922
			write_page(bitmap, page, 0);
923 924
	}
	if (wait) { /* if any writes were performed, we need to wait on them */
925
		if (bitmap->file)
926 927
			wait_event(bitmap->write_wait,
				   atomic_read(&bitmap->pending_writes)==0);
928
		else
929
			md_super_wait(bitmap->mddev);
930
	}
931 932
	if (bitmap->flags & BITMAP_WRITE_ERROR)
		bitmap_file_kick(bitmap);
933
}
934
EXPORT_SYMBOL(bitmap_unplug);
935

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

	chunks = bitmap->chunks;
	file = bitmap->file;

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

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

982
	bytes = DIV_ROUND_UP(bitmap->chunks, 8);
983 984
	if (!bitmap->mddev->bitmap_info.external)
		bytes += sizeof(bitmap_super_t);
985

986
	num_pages = DIV_ROUND_UP(bytes, PAGE_SIZE);
987

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

	ret = -ENOMEM;

998
	bitmap->filemap = kmalloc(sizeof(struct page *) * num_pages, GFP_KERNEL);
999
	if (!bitmap->filemap)
1000
		goto err;
1001

1002 1003
	/* We need 4 bits per page, rounded up to a multiple of sizeof(unsigned long) */
	bitmap->filemap_attr = kzalloc(
1004
		roundup(DIV_ROUND_UP(num_pages*4, 8), sizeof(unsigned long)),
1005
		GFP_KERNEL);
1006
	if (!bitmap->filemap_attr)
1007
		goto err;
1008 1009 1010 1011

	oldindex = ~0L;

	for (i = 0; i < chunks; i++) {
1012
		int b;
1013 1014
		index = file_page_index(bitmap, i);
		bit = file_page_offset(bitmap, i);
1015
		if (index != oldindex) { /* this is a new page, read it in */
1016
			int count;
1017
			/* unmap the old page, we're done with it */
1018
			if (index == num_pages-1)
1019
				count = bytes - index * PAGE_SIZE;
1020 1021
			else
				count = PAGE_SIZE;
1022
			if (index == 0 && bitmap->sb_page) {
1023 1024 1025 1026 1027 1028 1029
				/*
				 * if we're here then the superblock page
				 * contains some bits (PAGE_SIZE != sizeof sb)
				 * we've already read it in, so just use it
				 */
				page = bitmap->sb_page;
				offset = sizeof(bitmap_super_t);
N
NeilBrown 已提交
1030
				if (!file)
1031 1032 1033 1034 1035
					page = read_sb_page(
						bitmap->mddev,
						bitmap->mddev->bitmap_info.offset,
						page,
						index, count);
1036
			} else if (file) {
1037
				page = read_page(file, index, bitmap, count);
1038 1039
				offset = 0;
			} else {
1040 1041
				page = read_sb_page(bitmap->mddev,
						    bitmap->mddev->bitmap_info.offset,
1042 1043
						    NULL,
						    index, count);
1044 1045
				offset = 0;
			}
1046 1047
			if (IS_ERR(page)) { /* read error */
				ret = PTR_ERR(page);
1048
				goto err;
1049 1050
			}

1051 1052 1053
			oldindex = index;
			oldpage = page;

1054 1055 1056
			bitmap->filemap[bitmap->file_pages++] = page;
			bitmap->last_page_size = count;

1057 1058 1059
			if (outofdate) {
				/*
				 * if bitmap is out of date, dirty the
1060
				 * whole page and write it out
1061
				 */
1062
				paddr = kmap_atomic(page);
1063
				memset(paddr + offset, 0xff,
1064
				       PAGE_SIZE - offset);
1065
				kunmap_atomic(paddr);
1066 1067 1068
				write_page(bitmap, page, 1);

				ret = -EIO;
1069
				if (bitmap->flags & BITMAP_WRITE_ERROR)
1070
					goto err;
1071 1072
			}
		}
1073
		paddr = kmap_atomic(page);
1074
		if (bitmap->flags & BITMAP_HOSTENDIAN)
1075
			b = test_bit(bit, paddr);
1076
		else
A
Akinobu Mita 已提交
1077
			b = test_bit_le(bit, paddr);
1078
		kunmap_atomic(paddr);
1079
		if (b) {
1080
			/* if the disk bit is set, set the memory bit */
1081
			int needed = ((sector_t)(i+1) << bitmap->chunkshift
1082 1083
				      >= start);
			bitmap_set_memory_bits(bitmap,
1084
					       (sector_t)i << bitmap->chunkshift,
1085
					       needed);
1086 1087 1088 1089 1090
			bit_cnt++;
		}
	}

	printk(KERN_INFO "%s: bitmap initialized from disk: "
1091 1092
	       "read %lu/%lu pages, set %lu of %lu bits\n",
	       bmname(bitmap), bitmap->file_pages, num_pages, bit_cnt, chunks);
1093 1094

	return 0;
1095

1096 1097 1098
 err:
	printk(KERN_INFO "%s: bitmap initialisation failed: %d\n",
	       bmname(bitmap), ret);
1099 1100 1101
	return ret;
}

1102 1103 1104 1105 1106
void bitmap_write_all(struct bitmap *bitmap)
{
	/* We don't actually write all bitmap blocks here,
	 * just flag them as needing to be written
	 */
1107
	int i;
1108

1109 1110 1111 1112 1113 1114
	if (!bitmap || !bitmap->filemap)
		return;
	if (bitmap->file)
		/* Only one copy, so nothing needed */
		return;

1115
	spin_lock_irq(&bitmap->lock);
1116
	for (i = 0; i < bitmap->file_pages; i++)
1117 1118
		set_page_attr(bitmap, bitmap->filemap[i],
			      BITMAP_PAGE_NEEDWRITE);
1119
	bitmap->allclean = 0;
1120
	spin_unlock_irq(&bitmap->lock);
1121 1122
}

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

static void bitmap_set_pending(struct bitmap *bitmap, sector_t offset)
{
	sector_t chunk = offset >> bitmap->chunkshift;
	unsigned long page = chunk >> PAGE_COUNTER_SHIFT;
	struct bitmap_page *bp = &bitmap->bp[page];

	if (!bp->pending)
		bp->pending = 1;
}

1141
static bitmap_counter_t *bitmap_get_counter(struct bitmap *bitmap,
N
NeilBrown 已提交
1142
					    sector_t offset, sector_t *blocks,
1143 1144 1145 1146 1147 1148 1149
					    int create);

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

1150
void bitmap_daemon_work(struct mddev *mddev)
1151
{
1152
	struct bitmap *bitmap;
1153
	unsigned long j;
1154
	unsigned long nextpage;
1155
	unsigned long flags;
N
NeilBrown 已提交
1156
	sector_t blocks;
1157

1158 1159 1160
	/* Use a mutex to guard daemon_work against
	 * bitmap_destroy.
	 */
1161
	mutex_lock(&mddev->bitmap_info.mutex);
1162 1163
	bitmap = mddev->bitmap;
	if (bitmap == NULL) {
1164
		mutex_unlock(&mddev->bitmap_info.mutex);
1165
		return;
1166
	}
1167
	if (time_before(jiffies, bitmap->daemon_lastrun
N
NeilBrown 已提交
1168
			+ mddev->bitmap_info.daemon_sleep))
1169 1170
		goto done;

1171
	bitmap->daemon_lastrun = jiffies;
1172
	if (bitmap->allclean) {
N
NeilBrown 已提交
1173
		mddev->thread->timeout = MAX_SCHEDULE_TIMEOUT;
1174
		goto done;
1175 1176
	}
	bitmap->allclean = 1;
1177

1178 1179 1180 1181
	/* 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.
	 */
1182
	spin_lock_irqsave(&bitmap->lock, flags);
1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197
	for (j = 0; j < bitmap->file_pages; j++)
		if (test_page_attr(bitmap, bitmap->filemap[j],
				   BITMAP_PAGE_PENDING)) {
			set_page_attr(bitmap, bitmap->filemap[j],
				      BITMAP_PAGE_NEEDWRITE);
			clear_page_attr(bitmap, bitmap->filemap[j],
					BITMAP_PAGE_PENDING);
		}

	if (bitmap->need_sync &&
	    mddev->bitmap_info.external == 0) {
		/* Arrange for superblock update as well as
		 * other changes */
		bitmap_super_t *sb;
		bitmap->need_sync = 0;
1198 1199 1200 1201 1202 1203 1204 1205
		if (bitmap->filemap) {
			sb = kmap_atomic(bitmap->sb_page);
			sb->events_cleared =
				cpu_to_le64(bitmap->events_cleared);
			kunmap_atomic(sb);
			set_page_attr(bitmap, bitmap->sb_page,
				      BITMAP_PAGE_NEEDWRITE);
		}
1206 1207 1208 1209 1210
	}
	/* Now look at the bitmap counters and if any are '2' or '1',
	 * decrement and handle accordingly.
	 */
	nextpage = 0;
1211 1212
	for (j = 0; j < bitmap->chunks; j++) {
		bitmap_counter_t *bmc;
1213
		sector_t  block = (sector_t)j << bitmap->chunkshift;
1214

1215 1216 1217 1218
		if (j == nextpage) {
			nextpage += PAGE_COUNTER_RATIO;
			if (!bitmap->bp[j >> PAGE_COUNTER_SHIFT].pending) {
				j |= PAGE_COUNTER_MASK;
1219 1220
				continue;
			}
1221
			bitmap->bp[j >> PAGE_COUNTER_SHIFT].pending = 0;
1222
		}
1223
		bmc = bitmap_get_counter(bitmap,
1224
					 block,
1225
					 &blocks, 0);
1226 1227

		if (!bmc) {
1228
			j |= PAGE_COUNTER_MASK;
1229 1230 1231 1232 1233
			continue;
		}
		if (*bmc == 1 && !bitmap->need_sync) {
			/* We can clear the bit */
			*bmc = 0;
1234 1235
			bitmap_count_page(bitmap, block, -1);
			bitmap_file_clear_bit(bitmap, block);
1236 1237
		} else if (*bmc && *bmc <= 2) {
			*bmc = 1;
1238
			bitmap_set_pending(bitmap, block);
1239
			bitmap->allclean = 0;
1240
		}
1241 1242
	}

1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261
	/* 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.
	 */
	for (j = 0; j < bitmap->file_pages; j++) {
		struct page *page = bitmap->filemap[j];

		if (test_page_attr(bitmap, page,
				   BITMAP_PAGE_DIRTY))
			/* bitmap_unplug will handle the rest */
			break;
		if (test_page_attr(bitmap, page,
				   BITMAP_PAGE_NEEDWRITE)) {
			clear_page_attr(bitmap, page,
					BITMAP_PAGE_NEEDWRITE);
1262
			spin_unlock_irqrestore(&bitmap->lock, flags);
1263 1264 1265 1266
			write_page(bitmap, page, 0);
			spin_lock_irqsave(&bitmap->lock, flags);
			if (!bitmap->filemap)
				break;
1267 1268
		}
	}
1269
	spin_unlock_irqrestore(&bitmap->lock, flags);
1270

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

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

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

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

	if (err < 0)
1305
		return NULL;
1306

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

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

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

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

1336
	while (sectors) {
N
NeilBrown 已提交
1337
		sector_t blocks;
1338 1339 1340 1341 1342 1343 1344 1345 1346
		bitmap_counter_t *bmc;

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

1347
		if (unlikely(COUNTER(*bmc) == COUNTER_MAX)) {
1348 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);
			spin_unlock_irq(&bitmap->lock);
J
Jens Axboe 已提交
1356
			io_schedule();
1357 1358 1359 1360
			finish_wait(&bitmap->overflow_wait, &__wait);
			continue;
		}

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

1370 1371 1372 1373 1374 1375 1376
		(*bmc)++;

		spin_unlock_irq(&bitmap->lock);

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

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

1397
	while (sectors) {
N
NeilBrown 已提交
1398
		sector_t blocks;
1399 1400 1401 1402 1403 1404 1405 1406 1407 1408
		unsigned long flags;
		bitmap_counter_t *bmc;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

1635 1636 1637
/*
 * free memory that was allocated
 */
1638
static void bitmap_free(struct bitmap *bitmap)
1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660
{
	unsigned long k, pages;
	struct bitmap_page *bp;

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

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

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

	/* free all allocated memory */

	if (bp) /* deallocate the page memory */
		for (k = 0; k < pages; k++)
			if (bp[k].map && !bp[k].hijacked)
				kfree(bp[k].map);
	kfree(bp);
	kfree(bitmap);
}
1661

1662
void bitmap_destroy(struct mddev *mddev)
1663 1664 1665 1666 1667 1668
{
	struct bitmap *bitmap = mddev->bitmap;

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

1669
	mutex_lock(&mddev->bitmap_info.mutex);
1670
	mddev->bitmap = NULL; /* disconnect from the md device */
1671
	mutex_unlock(&mddev->bitmap_info.mutex);
1672 1673
	if (mddev->thread)
		mddev->thread->timeout = MAX_SCHEDULE_TIMEOUT;
1674

1675 1676 1677
	if (bitmap->sysfs_can_clear)
		sysfs_put(bitmap->sysfs_can_clear);

1678 1679
	bitmap_free(bitmap);
}
1680 1681 1682 1683 1684

/*
 * initialize the bitmap structure
 * if this returns an error, bitmap_destroy must be called to do clean up
 */
1685
int bitmap_create(struct mddev *mddev)
1686 1687
{
	struct bitmap *bitmap;
1688
	sector_t blocks = mddev->resync_max_sectors;
1689 1690
	unsigned long chunks;
	unsigned long pages;
1691
	struct file *file = mddev->bitmap_info.file;
1692
	int err;
1693
	struct sysfs_dirent *bm = NULL;
1694

A
Alexey Dobriyan 已提交
1695
	BUILD_BUG_ON(sizeof(bitmap_super_t) != 256);
1696

1697
	BUG_ON(file && mddev->bitmap_info.offset);
1698

1699
	bitmap = kzalloc(sizeof(*bitmap), GFP_KERNEL);
1700 1701 1702 1703
	if (!bitmap)
		return -ENOMEM;

	spin_lock_init(&bitmap->lock);
1704 1705
	atomic_set(&bitmap->pending_writes, 0);
	init_waitqueue_head(&bitmap->write_wait);
1706
	init_waitqueue_head(&bitmap->overflow_wait);
1707
	init_waitqueue_head(&bitmap->behind_wait);
1708

1709 1710
	bitmap->mddev = mddev;

1711 1712
	if (mddev->kobj.sd)
		bm = sysfs_get_dirent(mddev->kobj.sd, NULL, "bitmap");
1713
	if (bm) {
1714
		bitmap->sysfs_can_clear = sysfs_get_dirent(bm, NULL, "can_clear");
1715 1716 1717 1718
		sysfs_put(bm);
	} else
		bitmap->sysfs_can_clear = NULL;

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

1749
	bitmap->daemon_lastrun = jiffies;
1750 1751
	bitmap->chunkshift = (ffz(~mddev->bitmap_info.chunksize)
			      - BITMAP_BLOCK_SHIFT);
1752

1753
	chunks = (blocks + (1 << bitmap->chunkshift) - 1) >>
1754
			bitmap->chunkshift;
1755
	pages = (chunks + PAGE_COUNTER_RATIO - 1) / PAGE_COUNTER_RATIO;
1756 1757 1758 1759 1760 1761 1762

	BUG_ON(!pages);

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

1763
	bitmap->bp = kzalloc(pages * sizeof(*bitmap->bp), GFP_KERNEL);
1764

1765
	err = -ENOMEM;
1766
	if (!bitmap->bp)
1767
		goto error;
1768

1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781
	printk(KERN_INFO "created bitmap (%lu pages) for device %s\n",
		pages, bmname(bitmap));

	mddev->bitmap = bitmap;


	return (bitmap->flags & BITMAP_WRITE_ERROR) ? -EIO : 0;

 error:
	bitmap_free(bitmap);
	return err;
}

1782
int bitmap_load(struct mddev *mddev)
1783 1784
{
	int err = 0;
1785
	sector_t start = 0;
1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797
	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 已提交
1798
		sector_t blocks;
1799 1800 1801 1802 1803
		bitmap_start_sync(bitmap, sector, &blocks, 0);
		sector += blocks;
	}
	bitmap_close_sync(bitmap);

1804 1805 1806 1807 1808 1809
	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;

1810
	mutex_lock(&mddev->bitmap_info.mutex);
1811
	err = bitmap_init_from_disk(bitmap, start);
1812
	mutex_unlock(&mddev->bitmap_info.mutex);
1813

1814
	if (err)
1815
		goto out;
1816 1817 1818 1819
	bitmap_mask_state(bitmap, BITMAP_STALE, MASK_UNSET);

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

1821
	mddev->thread->timeout = mddev->bitmap_info.daemon_sleep;
1822
	md_wakeup_thread(mddev->thread);
1823

1824 1825
	bitmap_update_sb(bitmap);

1826 1827 1828
	if (bitmap->flags & BITMAP_WRITE_ERROR)
		err = -EIO;
out:
1829
	return err;
1830
}
1831
EXPORT_SYMBOL_GPL(bitmap_load);
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
void bitmap_status(struct seq_file *seq, struct bitmap *bitmap)
{
	unsigned long chunk_kb;
	unsigned long flags;

	if (!bitmap)
		return;

	spin_lock_irqsave(&bitmap->lock, flags);
	chunk_kb = bitmap->mddev->bitmap_info.chunksize >> 10;
	seq_printf(seq, "bitmap: %lu/%lu pages [%luKB], "
		   "%lu%s chunk",
		   bitmap->pages - bitmap->missing_pages,
		   bitmap->pages,
		   (bitmap->pages - bitmap->missing_pages)
		   << (PAGE_SHIFT - 10),
		   chunk_kb ? chunk_kb : bitmap->mddev->bitmap_info.chunksize,
		   chunk_kb ? "KB" : "B");
	if (bitmap->file) {
		seq_printf(seq, ", file: ");
		seq_path(seq, &bitmap->file->f_path, " \t\n");
	}

	seq_printf(seq, "\n");
	spin_unlock_irqrestore(&bitmap->lock, flags);
}

1860
static ssize_t
1861
location_show(struct mddev *mddev, char *page)
1862 1863
{
	ssize_t len;
1864
	if (mddev->bitmap_info.file)
1865
		len = sprintf(page, "file");
1866
	else if (mddev->bitmap_info.offset)
1867
		len = sprintf(page, "%+lld", (long long)mddev->bitmap_info.offset);
1868
	else
1869 1870 1871 1872 1873 1874
		len = sprintf(page, "none");
	len += sprintf(page+len, "\n");
	return len;
}

static ssize_t
1875
location_store(struct mddev *mddev, const char *buf, size_t len)
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
{

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

	if (mddev->bitmap || mddev->bitmap_info.file ||
	    mddev->bitmap_info.offset) {
		/* bitmap already configured.  Only option is to clear it */
		if (strncmp(buf, "none", 4) != 0)
			return -EBUSY;
		if (mddev->pers) {
			mddev->pers->quiesce(mddev, 1);
			bitmap_destroy(mddev);
			mddev->pers->quiesce(mddev, 0);
		}
		mddev->bitmap_info.offset = 0;
		if (mddev->bitmap_info.file) {
			struct file *f = mddev->bitmap_info.file;
			mddev->bitmap_info.file = NULL;
			restore_bitmap_write_access(f);
			fput(f);
		}
	} else {
		/* No bitmap, OK to set a location */
		long long offset;
		if (strncmp(buf, "none", 4) == 0)
			/* nothing to be done */;
		else if (strncmp(buf, "file:", 5) == 0) {
			/* Not supported yet */
			return -EINVAL;
		} else {
			int rv;
			if (buf[0] == '+')
				rv = strict_strtoll(buf+1, 10, &offset);
			else
				rv = strict_strtoll(buf, 10, &offset);
			if (rv)
				return rv;
			if (offset == 0)
				return -EINVAL;
1920 1921
			if (mddev->bitmap_info.external == 0 &&
			    mddev->major_version == 0 &&
1922 1923 1924 1925 1926 1927
			    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);
1928 1929
				if (!rv)
					rv = bitmap_load(mddev);
1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952
				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);

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
/* '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 &&
	    sectors  < ((mddev->bitmap->file_pages - 1) * PAGE_SIZE
			+ mddev->bitmap->last_page_size + 511) >> 9)
		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);

1991
static ssize_t
1992
timeout_show(struct mddev *mddev, char *page)
1993 1994 1995 1996
{
	ssize_t len;
	unsigned long secs = mddev->bitmap_info.daemon_sleep / HZ;
	unsigned long jifs = mddev->bitmap_info.daemon_sleep % HZ;
1997

1998 1999 2000 2001 2002 2003 2004 2005
	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
2006
timeout_store(struct mddev *mddev, const char *buf, size_t len)
2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041
{
	/* 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
2042
backlog_show(struct mddev *mddev, char *page)
2043 2044 2045 2046 2047
{
	return sprintf(page, "%lu\n", mddev->bitmap_info.max_write_behind);
}

static ssize_t
2048
backlog_store(struct mddev *mddev, const char *buf, size_t len)
2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063
{
	unsigned long backlog;
	int rv = strict_strtoul(buf, 10, &backlog);
	if (rv)
		return rv;
	if (backlog > COUNTER_MAX)
		return -EINVAL;
	mddev->bitmap_info.max_write_behind = backlog;
	return len;
}

static struct md_sysfs_entry bitmap_backlog =
__ATTR(backlog, S_IRUGO|S_IWUSR, backlog_show, backlog_store);

static ssize_t
2064
chunksize_show(struct mddev *mddev, char *page)
2065 2066 2067 2068 2069
{
	return sprintf(page, "%lu\n", mddev->bitmap_info.chunksize);
}

static ssize_t
2070
chunksize_store(struct mddev *mddev, const char *buf, size_t len)
2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089
{
	/* Can only be changed when no bitmap is active */
	int rv;
	unsigned long csize;
	if (mddev->bitmap)
		return -EBUSY;
	rv = strict_strtoul(buf, 10, &csize);
	if (rv)
		return rv;
	if (csize < 512 ||
	    !is_power_of_2(csize))
		return -EINVAL;
	mddev->bitmap_info.chunksize = csize;
	return len;
}

static struct md_sysfs_entry bitmap_chunksize =
__ATTR(chunksize, S_IRUGO|S_IWUSR, chunksize_show, chunksize_store);

2090
static ssize_t metadata_show(struct mddev *mddev, char *page)
2091 2092 2093 2094 2095
{
	return sprintf(page, "%s\n", (mddev->bitmap_info.external
				      ? "external" : "internal"));
}

2096
static ssize_t metadata_store(struct mddev *mddev, const char *buf, size_t len)
2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113
{
	if (mddev->bitmap ||
	    mddev->bitmap_info.file ||
	    mddev->bitmap_info.offset)
		return -EBUSY;
	if (strncmp(buf, "external", 8) == 0)
		mddev->bitmap_info.external = 1;
	else if (strncmp(buf, "internal", 8) == 0)
		mddev->bitmap_info.external = 0;
	else
		return -EINVAL;
	return len;
}

static struct md_sysfs_entry bitmap_metadata =
__ATTR(metadata, S_IRUGO|S_IWUSR, metadata_show, metadata_store);

2114
static ssize_t can_clear_show(struct mddev *mddev, char *page)
2115 2116 2117 2118 2119 2120 2121 2122 2123 2124
{
	int len;
	if (mddev->bitmap)
		len = sprintf(page, "%s\n", (mddev->bitmap->need_sync ?
					     "false" : "true"));
	else
		len = sprintf(page, "\n");
	return len;
}

2125
static ssize_t can_clear_store(struct mddev *mddev, const char *buf, size_t len)
2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142
{
	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);

2143
static ssize_t
2144
behind_writes_used_show(struct mddev *mddev, char *page)
2145 2146 2147 2148 2149 2150 2151 2152
{
	if (mddev->bitmap == NULL)
		return sprintf(page, "0\n");
	return sprintf(page, "%lu\n",
		       mddev->bitmap->behind_writes_used);
}

static ssize_t
2153
behind_writes_used_reset(struct mddev *mddev, const char *buf, size_t len)
2154 2155 2156 2157 2158 2159 2160 2161 2162 2163
{
	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);

2164 2165
static struct attribute *md_bitmap_attrs[] = {
	&bitmap_location.attr,
2166
	&bitmap_space.attr,
2167 2168 2169
	&bitmap_timeout.attr,
	&bitmap_backlog.attr,
	&bitmap_chunksize.attr,
2170 2171
	&bitmap_metadata.attr,
	&bitmap_can_clear.attr,
2172
	&max_backlog_used.attr,
2173 2174 2175 2176 2177 2178 2179
	NULL
};
struct attribute_group md_bitmap_group = {
	.name = "bitmap",
	.attrs = md_bitmap_attrs,
};