bitmap.c 55.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 "md.h"
30
#include "bitmap.h"
31

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

/*
 * just a placeholder - calls kmalloc for bitmap pages
 */
static unsigned char *bitmap_alloc_page(struct bitmap *bitmap)
{
	unsigned char *page;

44
	page = kzalloc(PAGE_SIZE, GFP_NOIO);
45 46 47
	if (!page)
		printk("%s: bitmap_alloc_page FAILED\n", bmname(bitmap));
	else
48 49
		pr_debug("%s: bitmap_alloc_page: allocated page at %p\n",
			 bmname(bitmap), page);
50 51 52 53 54 55 56 57
	return page;
}

/*
 * for now just a placeholder -- just calls kfree for bitmap pages
 */
static void bitmap_free_page(struct bitmap *bitmap, unsigned char *page)
{
58
	pr_debug("%s: bitmap_free_page: free page %p\n", bmname(bitmap), page);
59 60 61 62 63 64 65 66 67 68 69 70 71
	kfree(page);
}

/*
 * 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
 */
72 73
static int bitmap_checkpage(struct bitmap *bitmap,
			    unsigned long page, int create)
74 75
__releases(bitmap->lock)
__acquires(bitmap->lock)
76 77 78 79
{
	unsigned char *mappage;

	if (page >= bitmap->pages) {
80 81 82 83
		/* This can happen if bitmap_start_sync goes beyond
		 * End-of-device while looking for a whole page.
		 * It is harmless.
		 */
84 85 86 87 88 89 90 91 92 93 94 95 96 97
		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 */

98 99 100 101 102
	spin_unlock_irq(&bitmap->lock);
	mappage = bitmap_alloc_page(bitmap);
	spin_lock_irq(&bitmap->lock);

	if (mappage == NULL) {
103 104
		pr_debug("%s: bitmap map page allocation failed, hijacking\n",
			 bmname(bitmap));
105 106 107 108
		/* 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;
109 110
	} else if (bitmap->bp[page].map ||
		   bitmap->bp[page].hijacked) {
111 112 113
		/* somebody beat us to getting the page */
		bitmap_free_page(bitmap, mappage);
		return 0;
114
	} else {
115

116
		/* no page was in place and we have one, so install it */
117

118 119 120
		bitmap->bp[page].map = mappage;
		bitmap->missing_pages--;
	}
121 122 123 124 125 126
	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 */
127
static void bitmap_checkfree(struct bitmap *bitmap, unsigned long page)
128 129 130 131 132 133 134 135 136 137 138
{
	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;
139 140 141 142 143 144
	} else {
		/* normal case, free the page */
		ptr = bitmap->bp[page].map;
		bitmap->bp[page].map = NULL;
		bitmap->missing_pages++;
		bitmap_free_page(bitmap, ptr);
145 146 147 148 149 150 151 152 153 154 155
	}
}

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

/*
 * basic page I/O operations
 */

156
/* IO operations when bitmap is stored near all superblocks */
157
static struct page *read_sb_page(struct mddev *mddev, loff_t offset,
158 159
				 struct page *page,
				 unsigned long index, int size)
160 161 162
{
	/* choose a good rdev and read the page from there */

163
	struct md_rdev *rdev;
164
	sector_t target;
165
	int did_alloc = 0;
166

167
	if (!page) {
168
		page = alloc_page(GFP_KERNEL);
169 170 171 172
		if (!page)
			return ERR_PTR(-ENOMEM);
		did_alloc = 1;
	}
173

174
	list_for_each_entry(rdev, &mddev->disks, same_set) {
175 176
		if (! test_bit(In_sync, &rdev->flags)
		    || test_bit(Faulty, &rdev->flags))
177 178
			continue;

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

181
		if (sync_page_io(rdev, target,
182
				 roundup(size, bdev_logical_block_size(rdev->bdev)),
J
Jonathan Brassow 已提交
183
				 page, READ, true)) {
184
			page->index = index;
185 186
			attach_page_buffers(page, NULL); /* so that free_buffer will
							  * quietly no-op */
187 188 189
			return page;
		}
	}
190 191
	if (did_alloc)
		put_page(page);
192
	return ERR_PTR(-EIO);
193 194 195

}

196
static struct md_rdev *next_active_rdev(struct md_rdev *rdev, struct mddev *mddev)
197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216
{
	/* 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) {
217
		rdev = list_entry(pos, struct md_rdev, same_set);
218 219 220 221 222 223 224 225 226 227 228 229
		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;
}

230
static int write_sb_page(struct bitmap *bitmap, struct page *page, int wait)
231
{
232
	struct md_rdev *rdev = NULL;
233
	struct block_device *bdev;
234
	struct mddev *mddev = bitmap->mddev;
235

236
	while ((rdev = next_active_rdev(rdev, mddev)) != NULL) {
237 238
		int size = PAGE_SIZE;
		loff_t offset = mddev->bitmap_info.offset;
239 240 241

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

242 243
		if (page->index == bitmap->file_pages-1)
			size = roundup(bitmap->last_page_size,
244
				       bdev_logical_block_size(bdev));
245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284
		/* 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);
285
	}
286 287

	if (wait)
288
		md_super_wait(mddev);
289
	return 0;
290 291 292

 bad_alignment:
	return -EINVAL;
293 294
}

295
static void bitmap_file_kick(struct bitmap *bitmap);
296
/*
297
 * write out a page to a file
298
 */
299
static void write_page(struct bitmap *bitmap, struct page *page, int wait)
300
{
301
	struct buffer_head *bh;
302

303 304 305 306 307
	if (bitmap->file == NULL) {
		switch (write_sb_page(bitmap, page, wait)) {
		case -EINVAL:
			bitmap->flags |= BITMAP_WRITE_ERROR;
		}
308
	} else {
309

310
		bh = page_buffers(page);
311

312 313 314 315
		while (bh && bh->b_blocknr) {
			atomic_inc(&bitmap->pending_writes);
			set_buffer_locked(bh);
			set_buffer_mapped(bh);
J
Jens Axboe 已提交
316
			submit_bh(WRITE | REQ_SYNC, bh);
317 318
			bh = bh->b_this_page;
		}
319

320
		if (wait)
321 322
			wait_event(bitmap->write_wait,
				   atomic_read(&bitmap->pending_writes)==0);
323
	}
324 325
	if (bitmap->flags & BITMAP_WRITE_ERROR)
		bitmap_file_kick(bitmap);
326 327 328 329 330 331
}

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

333 334 335 336
	if (!uptodate) {
		spin_lock_irqsave(&bitmap->lock, flags);
		bitmap->flags |= BITMAP_WRITE_ERROR;
		spin_unlock_irqrestore(&bitmap->lock, flags);
337
	}
338 339 340
	if (atomic_dec_and_test(&bitmap->pending_writes))
		wake_up(&bitmap->write_wait);
}
341

342 343 344 345 346 347 348 349 350 351 352
/* 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);
353

354 355 356 357
	while (bh) {
		struct buffer_head *next = bh->b_this_page;
		free_buffer_head(bh);
		bh = next;
358
	}
359 360
	__clear_page_buffers(page);
	put_page(page);
361 362
}

363 364 365 366 367 368 369
/* 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.
 */
370
static struct page *read_page(struct file *file, unsigned long index,
371 372
			      struct bitmap *bitmap,
			      unsigned long count)
373 374
{
	struct page *page = NULL;
J
Josef Sipek 已提交
375
	struct inode *inode = file->f_path.dentry->d_inode;
376 377
	struct buffer_head *bh;
	sector_t block;
378

379 380
	pr_debug("read bitmap file (%dB @ %llu)\n", (int)PAGE_SIZE,
		 (unsigned long long)index << PAGE_SHIFT);
381

382 383 384
	page = alloc_page(GFP_KERNEL);
	if (!page)
		page = ERR_PTR(-ENOMEM);
385 386
	if (IS_ERR(page))
		goto out;
387 388 389

	bh = alloc_page_buffers(page, 1<<inode->i_blkbits, 0);
	if (!bh) {
390
		put_page(page);
391
		page = ERR_PTR(-ENOMEM);
392 393
		goto out;
	}
394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414
	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;
415 416 417 418
			atomic_inc(&bitmap->pending_writes);
			set_buffer_locked(bh);
			set_buffer_mapped(bh);
			submit_bh(READ, bh);
419 420 421 422 423
		}
		block++;
		bh = bh->b_this_page;
	}
	page->index = index;
424 425 426 427 428 429 430

	wait_event(bitmap->write_wait,
		   atomic_read(&bitmap->pending_writes)==0);
	if (bitmap->flags & BITMAP_WRITE_ERROR) {
		free_buffers(page);
		page = ERR_PTR(-EIO);
	}
431 432
out:
	if (IS_ERR(page))
433
		printk(KERN_ALERT "md: bitmap read error: (%dB @ %llu): %ld\n",
434 435
			(int)PAGE_SIZE,
			(unsigned long long)index << PAGE_SHIFT,
436 437 438 439 440 441 442 443 444
			PTR_ERR(page));
	return page;
}

/*
 * bitmap file superblock operations
 */

/* update the event counter and sync the superblock to disk */
445
void bitmap_update_sb(struct bitmap *bitmap)
446 447 448 449 450
{
	bitmap_super_t *sb;
	unsigned long flags;

	if (!bitmap || !bitmap->mddev) /* no bitmap for this array */
451
		return;
452 453
	if (bitmap->mddev->bitmap_info.external)
		return;
454 455 456
	spin_lock_irqsave(&bitmap->lock, flags);
	if (!bitmap->sb_page) { /* no superblock */
		spin_unlock_irqrestore(&bitmap->lock, flags);
457
		return;
458 459
	}
	spin_unlock_irqrestore(&bitmap->lock, flags);
460
	sb = kmap_atomic(bitmap->sb_page, KM_USER0);
461
	sb->events = cpu_to_le64(bitmap->mddev->events);
462
	if (bitmap->mddev->events < bitmap->events_cleared)
463 464
		/* rocking back to read-only */
		bitmap->events_cleared = bitmap->mddev->events;
465 466
	sb->events_cleared = cpu_to_le64(bitmap->events_cleared);
	sb->state = cpu_to_le32(bitmap->flags);
467 468 469
	/* 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);
470
	kunmap_atomic(sb, KM_USER0);
471
	write_page(bitmap, bitmap->sb_page, 1);
472 473 474 475 476 477 478 479 480
}

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

	if (!bitmap || !bitmap->sb_page)
		return;
481
	sb = kmap_atomic(bitmap->sb_page, KM_USER0);
482
	printk(KERN_DEBUG "%s: bitmap file superblock:\n", bmname(bitmap));
483 484 485
	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",
486 487 488 489
					*(__u32 *)(sb->uuid+0),
					*(__u32 *)(sb->uuid+4),
					*(__u32 *)(sb->uuid+8),
					*(__u32 *)(sb->uuid+12));
490
	printk(KERN_DEBUG "        events: %llu\n",
491
			(unsigned long long) le64_to_cpu(sb->events));
492
	printk(KERN_DEBUG "events cleared: %llu\n",
493
			(unsigned long long) le64_to_cpu(sb->events_cleared));
494 495 496 497 498
	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);
499
	printk(KERN_DEBUG "max write behind: %d\n", le32_to_cpu(sb->write_behind));
500
	kunmap_atomic(sb, KM_USER0);
501 502
}

503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578
/*
 * 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;

	sb = kmap_atomic(bitmap->sb_page, KM_USER0);

	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)) {
		kunmap_atomic(sb, KM_USER0);
		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);

	bitmap->flags |= BITMAP_HOSTENDIAN;
	sb->version = cpu_to_le32(BITMAP_MAJOR_HOSTENDIAN);

	kunmap_atomic(sb, KM_USER0);

	return 0;
}

579 580 581 582 583
/* 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;
584
	unsigned long chunksize, daemon_sleep, write_behind;
585 586 587 588
	unsigned long long events;
	int err = -EINVAL;

	/* page 0 is the superblock, read it... */
589 590 591 592 593 594
	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 {
595 596
		bitmap->sb_page = read_sb_page(bitmap->mddev,
					       bitmap->mddev->bitmap_info.offset,
597 598
					       NULL,
					       0, sizeof(bitmap_super_t));
599
	}
600 601 602 603 604 605
	if (IS_ERR(bitmap->sb_page)) {
		err = PTR_ERR(bitmap->sb_page);
		bitmap->sb_page = NULL;
		return err;
	}

606
	sb = kmap_atomic(bitmap->sb_page, KM_USER0);
607 608

	chunksize = le32_to_cpu(sb->chunksize);
609
	daemon_sleep = le32_to_cpu(sb->daemon_sleep) * HZ;
610
	write_behind = le32_to_cpu(sb->write_behind);
611 612 613 614

	/* verify that the bitmap-specific fields are valid */
	if (sb->magic != cpu_to_le32(BITMAP_MAGIC))
		reason = "bad magic";
615 616
	else if (le32_to_cpu(sb->version) < BITMAP_MAJOR_LO ||
		 le32_to_cpu(sb->version) > BITMAP_MAJOR_HI)
617
		reason = "unrecognized superblock version";
618
	else if (chunksize < 512)
619
		reason = "bitmap chunksize too small";
J
Jonathan Brassow 已提交
620
	else if (!is_power_of_2(chunksize))
621
		reason = "bitmap chunksize not a power of 2";
622
	else if (daemon_sleep < 1 || daemon_sleep > MAX_SCHEDULE_TIMEOUT)
623
		reason = "daemon sleep period out of range";
624 625
	else if (write_behind > COUNTER_MAX)
		reason = "write-behind limit out of range (0 - 16383)";
626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651
	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);

	if (!bitmap->mddev->persistent)
		goto success;

	/*
	 * if we have a persistent array superblock, 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);
652
		sb->state |= cpu_to_le32(BITMAP_STALE);
653 654 655
	}
success:
	/* assign fields using values from superblock */
656 657 658
	bitmap->mddev->bitmap_info.chunksize = chunksize;
	bitmap->mddev->bitmap_info.daemon_sleep = daemon_sleep;
	bitmap->mddev->bitmap_info.max_write_behind = write_behind;
659
	bitmap->flags |= le32_to_cpu(sb->state);
660 661
	if (le32_to_cpu(sb->version) == BITMAP_MAJOR_HOSTENDIAN)
		bitmap->flags |= BITMAP_HOSTENDIAN;
662
	bitmap->events_cleared = le64_to_cpu(sb->events_cleared);
663
	if (bitmap->flags & BITMAP_STALE)
664
		bitmap->events_cleared = bitmap->mddev->events;
665 666
	err = 0;
out:
667
	kunmap_atomic(sb, KM_USER0);
668 669 670 671 672 673 674 675 676 677
	if (err)
		bitmap_print_sb(bitmap);
	return err;
}

enum bitmap_mask_op {
	MASK_SET,
	MASK_UNSET
};

678 679 680
/* 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)
681 682 683
{
	bitmap_super_t *sb;
	unsigned long flags;
684
	int old;
685 686

	spin_lock_irqsave(&bitmap->lock, flags);
687
	if (!bitmap->sb_page) { /* can't set the state */
688
		spin_unlock_irqrestore(&bitmap->lock, flags);
689
		return 0;
690 691
	}
	spin_unlock_irqrestore(&bitmap->lock, flags);
692
	sb = kmap_atomic(bitmap->sb_page, KM_USER0);
693
	old = le32_to_cpu(sb->state) & bits;
694
	switch (op) {
695 696
	case MASK_SET:
		sb->state |= cpu_to_le32(bits);
697
		bitmap->flags |= bits;
698 699 700
		break;
	case MASK_UNSET:
		sb->state &= cpu_to_le32(~bits);
701
		bitmap->flags &= ~bits;
702 703 704
		break;
	default:
		BUG();
705
	}
706
	kunmap_atomic(sb, KM_USER0);
707
	return old;
708 709 710 711 712 713
}

/*
 * general bitmap file operations
 */

714 715 716 717 718 719
/*
 * 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.
 */
720
/* calculate the index of the page that contains this bit */
721
static inline unsigned long file_page_index(struct bitmap *bitmap, unsigned long chunk)
722
{
723 724 725
	if (!bitmap->mddev->bitmap_info.external)
		chunk += sizeof(bitmap_super_t) << 3;
	return chunk >> PAGE_BIT_SHIFT;
726 727 728
}

/* calculate the (bit) offset of this bit within a page */
729
static inline unsigned long file_page_offset(struct bitmap *bitmap, unsigned long chunk)
730
{
731 732 733
	if (!bitmap->mddev->bitmap_info.external)
		chunk += sizeof(bitmap_super_t) << 3;
	return chunk & (PAGE_BITS - 1);
734 735 736 737 738 739 740 741 742 743
}

/*
 * 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,
744
					    unsigned long chunk)
745
{
746 747
	if (file_page_index(bitmap, chunk) >= bitmap->file_pages)
		return NULL;
748 749
	return bitmap->filemap[file_page_index(bitmap, chunk)
			       - file_page_index(bitmap, 0)];
750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770
}

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--)
771
		if (map[pages] != sb_page) /* 0 is sb_page, release it below */
772
			free_buffers(map[pages]);
773 774 775
	kfree(map);
	kfree(attr);

776 777
	if (sb_page)
		free_buffers(sb_page);
778 779 780 781 782 783 784 785 786 787 788 789
}

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);

790 791 792
	if (file)
		wait_event(bitmap->write_wait,
			   atomic_read(&bitmap->pending_writes)==0);
793 794
	bitmap_file_unmap(bitmap);

795
	if (file) {
J
Josef Sipek 已提交
796
		struct inode *inode = file->f_path.dentry->d_inode;
797
		invalidate_mapping_pages(inode->i_mapping, 0, -1);
798
		fput(file);
799
	}
800 801 802 803 804 805 806 807 808 809 810
}

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

811 812
	if (bitmap_mask_state(bitmap, BITMAP_STALE, MASK_SET) == 0) {
		bitmap_update_sb(bitmap);
813

814 815 816
		if (bitmap->file) {
			path = kmalloc(PAGE_SIZE, GFP_KERNEL);
			if (path)
C
Christoph Hellwig 已提交
817 818 819
				ptr = d_path(&bitmap->file->f_path, path,
					     PAGE_SIZE);

820 821
			printk(KERN_ALERT
			      "%s: kicking failed bitmap file %s from array!\n",
C
Christoph Hellwig 已提交
822
			      bmname(bitmap), IS_ERR(ptr) ? "" : ptr);
823

824 825 826 827 828
			kfree(path);
		} else
			printk(KERN_ALERT
			       "%s: disabling internal bitmap due to errors\n",
			       bmname(bitmap));
829
	}
830 831 832 833 834 835 836

	bitmap_file_put(bitmap);

	return;
}

enum bitmap_page_attr {
837
	BITMAP_PAGE_DIRTY = 0,     /* there are set bits that need to be synced */
838 839
	BITMAP_PAGE_PENDING = 1,   /* there are bits that are being cleaned.
				    * i.e. counter is 1 or 2. */
840
	BITMAP_PAGE_NEEDWRITE = 2, /* there are cleared bits that need to be synced */
841 842 843 844 845
};

static inline void set_page_attr(struct bitmap *bitmap, struct page *page,
				enum bitmap_page_attr attr)
{
846
	__set_bit((page->index<<2) + attr, bitmap->filemap_attr);
847 848 849 850 851
}

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

855 856
static inline unsigned long test_page_attr(struct bitmap *bitmap, struct page *page,
					   enum bitmap_page_attr attr)
857
{
858
	return test_bit((page->index<<2) + attr, bitmap->filemap_attr);
859 860 861 862 863 864 865 866 867 868 869 870
}

/*
 * 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;
871
	struct page *page;
872 873 874
	void *kaddr;
	unsigned long chunk = block >> CHUNK_BLOCK_SHIFT(bitmap);

875 876
	if (!bitmap->filemap)
		return;
877

878 879 880 881
	page = filemap_get_page(bitmap, chunk);
	if (!page)
		return;
	bit = file_page_offset(bitmap, chunk);
882

883 884 885 886 887 888 889
	/* set the bit */
	kaddr = kmap_atomic(page, KM_USER0);
	if (bitmap->flags & BITMAP_HOSTENDIAN)
		set_bit(bit, kaddr);
	else
		__set_bit_le(bit, kaddr);
	kunmap_atomic(kaddr, KM_USER0);
890
	pr_debug("set file bit %lu page %lu\n", bit, page->index);
891 892 893 894 895 896 897
	/* record page number so it gets flushed to disk when unplug occurs */
	set_page_attr(bitmap, page, BITMAP_PAGE_DIRTY);
}

/* 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 */
898
void bitmap_unplug(struct bitmap *bitmap)
899
{
900 901
	unsigned long i, flags;
	int dirty, need_write;
902 903 904 905
	struct page *page;
	int wait = 0;

	if (!bitmap)
906
		return;
907 908 909 910 911

	/* 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);
912
		if (!bitmap->filemap) {
913
			spin_unlock_irqrestore(&bitmap->lock, flags);
914
			return;
915 916
		}
		page = bitmap->filemap[i];
917 918
		dirty = test_page_attr(bitmap, page, BITMAP_PAGE_DIRTY);
		need_write = test_page_attr(bitmap, page, BITMAP_PAGE_NEEDWRITE);
919 920
		clear_page_attr(bitmap, page, BITMAP_PAGE_DIRTY);
		clear_page_attr(bitmap, page, BITMAP_PAGE_NEEDWRITE);
921
		if (dirty)
922 923 924
			wait = 1;
		spin_unlock_irqrestore(&bitmap->lock, flags);

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

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

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

966
	BUG_ON(!file && !bitmap->mddev->bitmap_info.offset);
967 968 969 970 971 972

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

973
	bytes = DIV_ROUND_UP(bitmap->chunks, 8);
974 975
	if (!bitmap->mddev->bitmap_info.external)
		bytes += sizeof(bitmap_super_t);
976

977
	num_pages = DIV_ROUND_UP(bytes, PAGE_SIZE);
978

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

	ret = -ENOMEM;

989
	bitmap->filemap = kmalloc(sizeof(struct page *) * num_pages, GFP_KERNEL);
990
	if (!bitmap->filemap)
991
		goto err;
992

993 994
	/* We need 4 bits per page, rounded up to a multiple of sizeof(unsigned long) */
	bitmap->filemap_attr = kzalloc(
995
		roundup(DIV_ROUND_UP(num_pages*4, 8), sizeof(unsigned long)),
996
		GFP_KERNEL);
997
	if (!bitmap->filemap_attr)
998
		goto err;
999 1000 1001 1002

	oldindex = ~0L;

	for (i = 0; i < chunks; i++) {
1003
		int b;
1004 1005
		index = file_page_index(bitmap, i);
		bit = file_page_offset(bitmap, i);
1006
		if (index != oldindex) { /* this is a new page, read it in */
1007
			int count;
1008
			/* unmap the old page, we're done with it */
1009
			if (index == num_pages-1)
1010
				count = bytes - index * PAGE_SIZE;
1011 1012
			else
				count = PAGE_SIZE;
1013
			if (index == 0 && bitmap->sb_page) {
1014 1015 1016 1017 1018 1019 1020
				/*
				 * 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 已提交
1021
				if (!file)
1022 1023 1024 1025 1026
					page = read_sb_page(
						bitmap->mddev,
						bitmap->mddev->bitmap_info.offset,
						page,
						index, count);
1027
			} else if (file) {
1028
				page = read_page(file, index, bitmap, count);
1029 1030
				offset = 0;
			} else {
1031 1032
				page = read_sb_page(bitmap->mddev,
						    bitmap->mddev->bitmap_info.offset,
1033 1034
						    NULL,
						    index, count);
1035 1036
				offset = 0;
			}
1037 1038
			if (IS_ERR(page)) { /* read error */
				ret = PTR_ERR(page);
1039
				goto err;
1040 1041
			}

1042 1043 1044
			oldindex = index;
			oldpage = page;

1045 1046 1047
			bitmap->filemap[bitmap->file_pages++] = page;
			bitmap->last_page_size = count;

1048 1049 1050
			if (outofdate) {
				/*
				 * if bitmap is out of date, dirty the
1051
				 * whole page and write it out
1052
				 */
1053 1054
				paddr = kmap_atomic(page, KM_USER0);
				memset(paddr + offset, 0xff,
1055
				       PAGE_SIZE - offset);
1056
				kunmap_atomic(paddr, KM_USER0);
1057 1058 1059
				write_page(bitmap, page, 1);

				ret = -EIO;
1060
				if (bitmap->flags & BITMAP_WRITE_ERROR)
1061
					goto err;
1062 1063
			}
		}
1064
		paddr = kmap_atomic(page, KM_USER0);
1065
		if (bitmap->flags & BITMAP_HOSTENDIAN)
1066
			b = test_bit(bit, paddr);
1067
		else
A
Akinobu Mita 已提交
1068
			b = test_bit_le(bit, paddr);
1069
		kunmap_atomic(paddr, KM_USER0);
1070
		if (b) {
1071
			/* if the disk bit is set, set the memory bit */
1072 1073 1074 1075 1076
			int needed = ((sector_t)(i+1) << (CHUNK_BLOCK_SHIFT(bitmap))
				      >= start);
			bitmap_set_memory_bits(bitmap,
					       (sector_t)i << CHUNK_BLOCK_SHIFT(bitmap),
					       needed);
1077 1078 1079 1080
			bit_cnt++;
		}
	}

1081
	/* everything went OK */
1082 1083 1084 1085 1086 1087 1088 1089 1090
	ret = 0;
	bitmap_mask_state(bitmap, BITMAP_STALE, MASK_UNSET);

	if (bit_cnt) { /* Kick recovery if any bits were set */
		set_bit(MD_RECOVERY_NEEDED, &bitmap->mddev->recovery);
		md_wakeup_thread(bitmap->mddev->thread);
	}

	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
	spin_lock_irq(&bitmap->lock);
1110
	for (i = 0; i < bitmap->file_pages; i++)
1111 1112
		set_page_attr(bitmap, bitmap->filemap[i],
			      BITMAP_PAGE_NEEDWRITE);
1113
	bitmap->allclean = 0;
1114
	spin_unlock_irq(&bitmap->lock);
1115 1116
}

1117 1118 1119 1120 1121 1122 1123 1124
static void bitmap_count_page(struct bitmap *bitmap, sector_t offset, int inc)
{
	sector_t chunk = offset >> CHUNK_BLOCK_SHIFT(bitmap);
	unsigned long page = chunk >> PAGE_COUNTER_SHIFT;
	bitmap->bp[page].count += inc;
	bitmap_checkfree(bitmap, page);
}
static bitmap_counter_t *bitmap_get_counter(struct bitmap *bitmap,
N
NeilBrown 已提交
1125
					    sector_t offset, sector_t *blocks,
1126 1127 1128 1129 1130 1131 1132
					    int create);

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

1133
void bitmap_daemon_work(struct mddev *mddev)
1134
{
1135
	struct bitmap *bitmap;
1136
	unsigned long j;
1137 1138
	unsigned long flags;
	struct page *page = NULL, *lastpage = NULL;
N
NeilBrown 已提交
1139
	sector_t blocks;
1140
	void *paddr;
1141

1142 1143 1144
	/* Use a mutex to guard daemon_work against
	 * bitmap_destroy.
	 */
1145
	mutex_lock(&mddev->bitmap_info.mutex);
1146 1147
	bitmap = mddev->bitmap;
	if (bitmap == NULL) {
1148
		mutex_unlock(&mddev->bitmap_info.mutex);
1149
		return;
1150
	}
1151
	if (time_before(jiffies, bitmap->daemon_lastrun
1152
			+ bitmap->mddev->bitmap_info.daemon_sleep))
1153 1154
		goto done;

1155
	bitmap->daemon_lastrun = jiffies;
1156 1157
	if (bitmap->allclean) {
		bitmap->mddev->thread->timeout = MAX_SCHEDULE_TIMEOUT;
1158
		goto done;
1159 1160
	}
	bitmap->allclean = 1;
1161

1162
	spin_lock_irqsave(&bitmap->lock, flags);
1163 1164
	for (j = 0; j < bitmap->chunks; j++) {
		bitmap_counter_t *bmc;
1165 1166 1167 1168 1169
		if (!bitmap->filemap)
			/* error or shutdown */
			break;

		page = filemap_get_page(bitmap, j);
1170 1171

		if (page != lastpage) {
1172
			/* skip this page unless it's marked as needing cleaning */
1173
			if (!test_page_attr(bitmap, page, BITMAP_PAGE_PENDING)) {
1174 1175
				int need_write = test_page_attr(bitmap, page,
								BITMAP_PAGE_NEEDWRITE);
1176
				if (need_write)
1177
					clear_page_attr(bitmap, page, BITMAP_PAGE_NEEDWRITE);
1178

1179
				spin_unlock_irqrestore(&bitmap->lock, flags);
1180
				if (need_write)
1181
					write_page(bitmap, page, 0);
1182 1183
				spin_lock_irqsave(&bitmap->lock, flags);
				j |= (PAGE_BITS - 1);
1184 1185 1186
				continue;
			}

1187 1188
			/* grab the new page, sync and release the old */
			if (lastpage != NULL) {
1189 1190 1191 1192
				if (test_page_attr(bitmap, lastpage,
						   BITMAP_PAGE_NEEDWRITE)) {
					clear_page_attr(bitmap, lastpage,
							BITMAP_PAGE_NEEDWRITE);
1193
					spin_unlock_irqrestore(&bitmap->lock, flags);
1194
					write_page(bitmap, lastpage, 0);
1195
				} else {
1196 1197 1198
					set_page_attr(bitmap, lastpage,
						      BITMAP_PAGE_NEEDWRITE);
					bitmap->allclean = 0;
1199 1200 1201 1202 1203
					spin_unlock_irqrestore(&bitmap->lock, flags);
				}
			} else
				spin_unlock_irqrestore(&bitmap->lock, flags);
			lastpage = page;
1204 1205 1206 1207

			/* We are possibly going to clear some bits, so make
			 * sure that events_cleared is up-to-date.
			 */
1208 1209
			if (bitmap->need_sync &&
			    bitmap->mddev->bitmap_info.external == 0) {
1210 1211 1212 1213 1214 1215 1216 1217
				bitmap_super_t *sb;
				bitmap->need_sync = 0;
				sb = kmap_atomic(bitmap->sb_page, KM_USER0);
				sb->events_cleared =
					cpu_to_le64(bitmap->events_cleared);
				kunmap_atomic(sb, KM_USER0);
				write_page(bitmap, bitmap->sb_page, 1);
			}
1218
			spin_lock_irqsave(&bitmap->lock, flags);
1219
			if (!bitmap->need_sync)
1220
				clear_page_attr(bitmap, page, BITMAP_PAGE_PENDING);
1221 1222
			else
				bitmap->allclean = 0;
1223
		}
1224 1225 1226
		bmc = bitmap_get_counter(bitmap,
					 (sector_t)j << CHUNK_BLOCK_SHIFT(bitmap),
					 &blocks, 0);
1227 1228 1229 1230
		if (!bmc)
			j |= PAGE_COUNTER_MASK;
		else if (*bmc) {
			if (*bmc == 1 && !bitmap->need_sync) {
1231 1232
				/* we can clear the bit */
				*bmc = 0;
1233 1234
				bitmap_count_page(bitmap,
						  (sector_t)j << CHUNK_BLOCK_SHIFT(bitmap),
1235 1236 1237
						  -1);

				/* clear the bit */
1238 1239 1240 1241 1242 1243
				paddr = kmap_atomic(page, KM_USER0);
				if (bitmap->flags & BITMAP_HOSTENDIAN)
					clear_bit(file_page_offset(bitmap, j),
						  paddr);
				else
					__clear_bit_le(
1244 1245 1246
						file_page_offset(bitmap,
								 j),
						paddr);
1247
				kunmap_atomic(paddr, KM_USER0);
1248 1249 1250
			} else if (*bmc <= 2) {
				*bmc = 1; /* maybe clear the bit next time */
				set_page_attr(bitmap, page, BITMAP_PAGE_PENDING);
1251
				bitmap->allclean = 0;
1252
			}
1253
		}
1254
	}
1255
	spin_unlock_irqrestore(&bitmap->lock, flags);
1256 1257

	/* now sync the final page */
1258
	if (lastpage != NULL) {
1259
		spin_lock_irqsave(&bitmap->lock, flags);
1260
		if (test_page_attr(bitmap, lastpage, BITMAP_PAGE_NEEDWRITE)) {
1261 1262
			clear_page_attr(bitmap, lastpage, BITMAP_PAGE_NEEDWRITE);
			spin_unlock_irqrestore(&bitmap->lock, flags);
1263
			write_page(bitmap, lastpage, 0);
1264 1265
		} else {
			set_page_attr(bitmap, lastpage, BITMAP_PAGE_NEEDWRITE);
1266
			bitmap->allclean = 0;
1267 1268 1269 1270
			spin_unlock_irqrestore(&bitmap->lock, flags);
		}
	}

1271
 done:
1272
	if (bitmap->allclean == 0)
1273
		bitmap->mddev->thread->timeout =
1274
			bitmap->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 1288 1289 1290 1291
{
	/* 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.
	 */
	sector_t chunk = offset >> CHUNK_BLOCK_SHIFT(bitmap);
	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 1298 1299 1300
	err = bitmap_checkpage(bitmap, page, create);

	if (bitmap->bp[page].hijacked ||
	    bitmap->bp[page].map == NULL)
		csize = ((sector_t)1) << (CHUNK_BLOCK_SHIFT(bitmap) +
					  PAGE_COUNTER_SHIFT - 1);
	else
1301
		csize = ((sector_t)1) << (CHUNK_BLOCK_SHIFT(bitmap));
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 1398
	if (bitmap->mddev->degraded)
		/* Never clear bits or update events_cleared when degraded */
		success = 0;
1399

1400
	while (sectors) {
N
NeilBrown 已提交
1401
		sector_t blocks;
1402 1403 1404 1405 1406 1407 1408 1409 1410 1411
		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;
		}

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

1419
		if (!success && !NEEDED(*bmc))
1420 1421
			*bmc |= NEEDED_MASK;

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

1425
		(*bmc)--;
1426
		if (*bmc <= 2) {
1427
			set_page_attr(bitmap,
1428 1429 1430
				      filemap_get_page(
					      bitmap,
					      offset >> CHUNK_BLOCK_SHIFT(bitmap)),
1431
				      BITMAP_PAGE_PENDING);
1432 1433
			bitmap->allclean = 0;
		}
1434 1435 1436 1437
		spin_unlock_irqrestore(&bitmap->lock, flags);
		offset += blocks;
		if (sectors > blocks)
			sectors -= blocks;
1438 1439
		else
			sectors = 0;
1440 1441
	}
}
1442
EXPORT_SYMBOL(bitmap_endwrite);
1443

N
NeilBrown 已提交
1444
static int __bitmap_start_sync(struct bitmap *bitmap, sector_t offset, sector_t *blocks,
1445
			       int degraded)
1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461
{
	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;
1462 1463 1464 1465
			if (!degraded) { /* don't set/clear bits if degraded */
				*bmc |= RESYNC_MASK;
				*bmc &= ~NEEDED_MASK;
			}
1466 1467 1468 1469 1470 1471
		}
	}
	spin_unlock_irq(&bitmap->lock);
	return rv;
}

N
NeilBrown 已提交
1472
int bitmap_start_sync(struct bitmap *bitmap, sector_t offset, sector_t *blocks,
1473 1474 1475 1476 1477 1478 1479 1480 1481 1482
		      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 已提交
1483
	sector_t blocks1;
1484 1485 1486 1487 1488 1489 1490 1491 1492 1493

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

N
NeilBrown 已提交
1496
void bitmap_end_sync(struct bitmap *bitmap, sector_t offset, sector_t *blocks, int aborted)
1497 1498 1499
{
	bitmap_counter_t *bmc;
	unsigned long flags;
1500 1501

	if (bitmap == NULL) {
1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515
		*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 {
1516
			if (*bmc <= 2) {
1517 1518
				set_page_attr(bitmap,
					      filemap_get_page(bitmap, offset >> CHUNK_BLOCK_SHIFT(bitmap)),
1519
					      BITMAP_PAGE_PENDING);
1520 1521
				bitmap->allclean = 0;
			}
1522 1523 1524 1525 1526
		}
	}
 unlock:
	spin_unlock_irqrestore(&bitmap->lock, flags);
}
1527
EXPORT_SYMBOL(bitmap_end_sync);
1528 1529 1530 1531 1532 1533 1534 1535

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 已提交
1536
	sector_t blocks;
N
NeilBrown 已提交
1537 1538
	if (!bitmap)
		return;
1539 1540
	while (sector < bitmap->mddev->resync_max_sectors) {
		bitmap_end_sync(bitmap, sector, &blocks, 0);
N
NeilBrown 已提交
1541 1542 1543
		sector += blocks;
	}
}
1544
EXPORT_SYMBOL(bitmap_close_sync);
N
NeilBrown 已提交
1545 1546 1547 1548

void bitmap_cond_end_sync(struct bitmap *bitmap, sector_t sector)
{
	sector_t s = 0;
N
NeilBrown 已提交
1549
	sector_t blocks;
N
NeilBrown 已提交
1550 1551 1552 1553 1554 1555 1556 1557

	if (!bitmap)
		return;
	if (sector == 0) {
		bitmap->last_end_sync = jiffies;
		return;
	}
	if (time_before(jiffies, (bitmap->last_end_sync
1558
				  + bitmap->mddev->bitmap_info.daemon_sleep)))
N
NeilBrown 已提交
1559 1560 1561 1562
		return;
	wait_event(bitmap->mddev->recovery_wait,
		   atomic_read(&bitmap->mddev->recovery_active) == 0);

1563
	bitmap->mddev->curr_resync_completed = sector;
1564
	set_bit(MD_CHANGE_CLEAN, &bitmap->mddev->flags);
N
NeilBrown 已提交
1565 1566 1567 1568 1569
	sector &= ~((1ULL << CHUNK_BLOCK_SHIFT(bitmap)) - 1);
	s = 0;
	while (s < sector && s < bitmap->mddev->resync_max_sectors) {
		bitmap_end_sync(bitmap, s, &blocks, 0);
		s += blocks;
1570
	}
N
NeilBrown 已提交
1571
	bitmap->last_end_sync = jiffies;
1572
	sysfs_notify(&bitmap->mddev->kobj, NULL, "sync_completed");
1573
}
1574
EXPORT_SYMBOL(bitmap_cond_end_sync);
1575

1576
static void bitmap_set_memory_bits(struct bitmap *bitmap, sector_t offset, int needed)
1577 1578
{
	/* For each chunk covered by any of these sectors, set the
1579
	 * counter to 1 and set resync_needed.  They should all
1580 1581
	 * be 0 at this point
	 */
1582

N
NeilBrown 已提交
1583
	sector_t secs;
1584 1585 1586 1587
	bitmap_counter_t *bmc;
	spin_lock_irq(&bitmap->lock);
	bmc = bitmap_get_counter(bitmap, offset, &secs, 1);
	if (!bmc) {
1588
		spin_unlock_irq(&bitmap->lock);
1589
		return;
1590
	}
1591
	if (!*bmc) {
1592
		struct page *page;
1593
		*bmc = 1 | (needed ? NEEDED_MASK : 0);
1594 1595
		bitmap_count_page(bitmap, offset, 1);
		page = filemap_get_page(bitmap, offset >> CHUNK_BLOCK_SHIFT(bitmap));
1596
		set_page_attr(bitmap, page, BITMAP_PAGE_PENDING);
1597
		bitmap->allclean = 0;
1598 1599
	}
	spin_unlock_irq(&bitmap->lock);
1600 1601
}

1602 1603 1604 1605 1606 1607
/* 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++) {
1608
		sector_t sec = (sector_t)chunk << CHUNK_BLOCK_SHIFT(bitmap);
1609
		bitmap_set_memory_bits(bitmap, sec, 1);
1610
		spin_lock_irq(&bitmap->lock);
1611
		bitmap_file_set_bit(bitmap, sec);
1612
		spin_unlock_irq(&bitmap->lock);
1613 1614 1615 1616 1617 1618
		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;
1619 1620 1621
	}
}

1622 1623 1624
/*
 * flush out any pending updates
 */
1625
void bitmap_flush(struct mddev *mddev)
1626 1627
{
	struct bitmap *bitmap = mddev->bitmap;
1628
	long sleep;
1629 1630 1631 1632 1633 1634 1635

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

	/* run the daemon_work three time to ensure everything is flushed
	 * that can be
	 */
1636
	sleep = mddev->bitmap_info.daemon_sleep * 2;
1637
	bitmap->daemon_lastrun -= sleep;
1638
	bitmap_daemon_work(mddev);
1639
	bitmap->daemon_lastrun -= sleep;
1640
	bitmap_daemon_work(mddev);
1641
	bitmap->daemon_lastrun -= sleep;
1642
	bitmap_daemon_work(mddev);
1643 1644 1645
	bitmap_update_sb(bitmap);
}

1646 1647 1648
/*
 * free memory that was allocated
 */
1649
static void bitmap_free(struct bitmap *bitmap)
1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671
{
	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);
}
1672

1673
void bitmap_destroy(struct mddev *mddev)
1674 1675 1676 1677 1678 1679
{
	struct bitmap *bitmap = mddev->bitmap;

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

1680
	mutex_lock(&mddev->bitmap_info.mutex);
1681
	mddev->bitmap = NULL; /* disconnect from the md device */
1682
	mutex_unlock(&mddev->bitmap_info.mutex);
1683 1684
	if (mddev->thread)
		mddev->thread->timeout = MAX_SCHEDULE_TIMEOUT;
1685

1686 1687 1688
	if (bitmap->sysfs_can_clear)
		sysfs_put(bitmap->sysfs_can_clear);

1689 1690
	bitmap_free(bitmap);
}
1691 1692 1693 1694 1695

/*
 * initialize the bitmap structure
 * if this returns an error, bitmap_destroy must be called to do clean up
 */
1696
int bitmap_create(struct mddev *mddev)
1697 1698
{
	struct bitmap *bitmap;
1699
	sector_t blocks = mddev->resync_max_sectors;
1700 1701
	unsigned long chunks;
	unsigned long pages;
1702
	struct file *file = mddev->bitmap_info.file;
1703
	int err;
1704
	struct sysfs_dirent *bm = NULL;
1705

A
Alexey Dobriyan 已提交
1706
	BUILD_BUG_ON(sizeof(bitmap_super_t) != 256);
1707

1708
	if (!file
1709
	    && !mddev->bitmap_info.offset) /* bitmap disabled, nothing to do */
1710 1711
		return 0;

1712
	BUG_ON(file && mddev->bitmap_info.offset);
1713

1714
	bitmap = kzalloc(sizeof(*bitmap), GFP_KERNEL);
1715 1716 1717 1718
	if (!bitmap)
		return -ENOMEM;

	spin_lock_init(&bitmap->lock);
1719 1720
	atomic_set(&bitmap->pending_writes, 0);
	init_waitqueue_head(&bitmap->write_wait);
1721
	init_waitqueue_head(&bitmap->overflow_wait);
1722
	init_waitqueue_head(&bitmap->behind_wait);
1723

1724 1725
	bitmap->mddev = mddev;

1726 1727
	if (mddev->kobj.sd)
		bm = sysfs_get_dirent(mddev->kobj.sd, NULL, "bitmap");
1728
	if (bm) {
1729
		bitmap->sysfs_can_clear = sysfs_get_dirent(bm, NULL, "can_clear");
1730 1731 1732 1733
		sysfs_put(bm);
	} else
		bitmap->sysfs_can_clear = NULL;

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

1764
	bitmap->daemon_lastrun = jiffies;
1765
	bitmap->chunkshift = ffz(~mddev->bitmap_info.chunksize);
1766 1767

	/* now that chunksize and chunkshift are set, we can use these macros */
1768
	chunks = (blocks + CHUNK_BLOCK_RATIO(bitmap) - 1) >>
1769
			CHUNK_BLOCK_SHIFT(bitmap);
1770
	pages = (chunks + PAGE_COUNTER_RATIO - 1) / PAGE_COUNTER_RATIO;
1771 1772 1773 1774 1775 1776 1777

	BUG_ON(!pages);

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

1778
	bitmap->bp = kzalloc(pages * sizeof(*bitmap->bp), GFP_KERNEL);
1779

1780
	err = -ENOMEM;
1781
	if (!bitmap->bp)
1782
		goto error;
1783

1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796
	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;
}

1797
int bitmap_load(struct mddev *mddev)
1798 1799
{
	int err = 0;
1800
	sector_t start = 0;
1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812
	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 已提交
1813
		sector_t blocks;
1814 1815 1816 1817 1818
		bitmap_start_sync(bitmap, sector, &blocks, 0);
		sector += blocks;
	}
	bitmap_close_sync(bitmap);

1819 1820 1821 1822 1823 1824 1825 1826
	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;

	err = bitmap_init_from_disk(bitmap, start);

1827
	if (err)
1828
		goto out;
1829

1830
	mddev->thread->timeout = mddev->bitmap_info.daemon_sleep;
1831
	md_wakeup_thread(mddev->thread);
1832

1833 1834
	bitmap_update_sb(bitmap);

1835 1836 1837
	if (bitmap->flags & BITMAP_WRITE_ERROR)
		err = -EIO;
out:
1838
	return err;
1839
}
1840
EXPORT_SYMBOL_GPL(bitmap_load);
1841

1842
static ssize_t
1843
location_show(struct mddev *mddev, char *page)
1844 1845
{
	ssize_t len;
1846
	if (mddev->bitmap_info.file)
1847
		len = sprintf(page, "file");
1848
	else if (mddev->bitmap_info.offset)
1849
		len = sprintf(page, "%+lld", (long long)mddev->bitmap_info.offset);
1850
	else
1851 1852 1853 1854 1855 1856
		len = sprintf(page, "none");
	len += sprintf(page+len, "\n");
	return len;
}

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

	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;
1902 1903
			if (mddev->bitmap_info.external == 0 &&
			    mddev->major_version == 0 &&
1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933
			    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);
				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);

static ssize_t
1934
timeout_show(struct mddev *mddev, char *page)
1935 1936 1937 1938
{
	ssize_t len;
	unsigned long secs = mddev->bitmap_info.daemon_sleep / HZ;
	unsigned long jifs = mddev->bitmap_info.daemon_sleep % HZ;
1939

1940 1941 1942 1943 1944 1945 1946 1947
	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
1948
timeout_store(struct mddev *mddev, const char *buf, size_t len)
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
{
	/* 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
1984
backlog_show(struct mddev *mddev, char *page)
1985 1986 1987 1988 1989
{
	return sprintf(page, "%lu\n", mddev->bitmap_info.max_write_behind);
}

static ssize_t
1990
backlog_store(struct mddev *mddev, const char *buf, size_t len)
1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005
{
	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
2006
chunksize_show(struct mddev *mddev, char *page)
2007 2008 2009 2010 2011
{
	return sprintf(page, "%lu\n", mddev->bitmap_info.chunksize);
}

static ssize_t
2012
chunksize_store(struct mddev *mddev, const char *buf, size_t len)
2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031
{
	/* 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);

2032
static ssize_t metadata_show(struct mddev *mddev, char *page)
2033 2034 2035 2036 2037
{
	return sprintf(page, "%s\n", (mddev->bitmap_info.external
				      ? "external" : "internal"));
}

2038
static ssize_t metadata_store(struct mddev *mddev, const char *buf, size_t len)
2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055
{
	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);

2056
static ssize_t can_clear_show(struct mddev *mddev, char *page)
2057 2058 2059 2060 2061 2062 2063 2064 2065 2066
{
	int len;
	if (mddev->bitmap)
		len = sprintf(page, "%s\n", (mddev->bitmap->need_sync ?
					     "false" : "true"));
	else
		len = sprintf(page, "\n");
	return len;
}

2067
static ssize_t can_clear_store(struct mddev *mddev, const char *buf, size_t len)
2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084
{
	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);

2085
static ssize_t
2086
behind_writes_used_show(struct mddev *mddev, char *page)
2087 2088 2089 2090 2091 2092 2093 2094
{
	if (mddev->bitmap == NULL)
		return sprintf(page, "0\n");
	return sprintf(page, "%lu\n",
		       mddev->bitmap->behind_writes_used);
}

static ssize_t
2095
behind_writes_used_reset(struct mddev *mddev, const char *buf, size_t len)
2096 2097 2098 2099 2100 2101 2102 2103 2104 2105
{
	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);

2106 2107 2108 2109 2110
static struct attribute *md_bitmap_attrs[] = {
	&bitmap_location.attr,
	&bitmap_timeout.attr,
	&bitmap_backlog.attr,
	&bitmap_chunksize.attr,
2111 2112
	&bitmap_metadata.attr,
	&bitmap_can_clear.attr,
2113
	&max_backlog_used.attr,
2114 2115 2116 2117 2118 2119 2120
	NULL
};
struct attribute_group md_bitmap_group = {
	.name = "bitmap",
	.attrs = md_bitmap_attrs,
};