1 // SPDX-License-Identifier: GPL-2.0-only 2 /* 3 * bitmap.c two-level bitmap (C) Peter T. Breuer (ptb@ot.uc3m.es) 2003 4 * 5 * bitmap_create - sets up the bitmap structure 6 * bitmap_destroy - destroys the bitmap structure 7 * 8 * additions, Copyright (C) 2003-2004, Paul Clements, SteelEye Technology, Inc.: 9 * - added disk storage for bitmap 10 * - changes to allow various bitmap chunk sizes 11 */ 12 13 /* 14 * Still to do: 15 * 16 * flush after percent set rather than just time based. (maybe both). 17 */ 18 19 #include <linux/blkdev.h> 20 #include <linux/module.h> 21 #include <linux/errno.h> 22 #include <linux/slab.h> 23 #include <linux/init.h> 24 #include <linux/timer.h> 25 #include <linux/sched.h> 26 #include <linux/list.h> 27 #include <linux/file.h> 28 #include <linux/mount.h> 29 #include <linux/buffer_head.h> 30 #include <linux/seq_file.h> 31 #include <trace/events/block.h> 32 #include "md.h" 33 #include "md-bitmap.h" 34 35 static inline char *bmname(struct bitmap *bitmap) 36 { 37 return bitmap->mddev ? mdname(bitmap->mddev) : "mdX"; 38 } 39 40 /* 41 * check a page and, if necessary, allocate it (or hijack it if the alloc fails) 42 * 43 * 1) check to see if this page is allocated, if it's not then try to alloc 44 * 2) if the alloc fails, set the page's hijacked flag so we'll use the 45 * page pointer directly as a counter 46 * 47 * if we find our page, we increment the page's refcount so that it stays 48 * allocated while we're using it 49 */ 50 static int md_bitmap_checkpage(struct bitmap_counts *bitmap, 51 unsigned long page, int create, int no_hijack) 52 __releases(bitmap->lock) 53 __acquires(bitmap->lock) 54 { 55 unsigned char *mappage; 56 57 WARN_ON_ONCE(page >= bitmap->pages); 58 if (bitmap->bp[page].hijacked) /* it's hijacked, don't try to alloc */ 59 return 0; 60 61 if (bitmap->bp[page].map) /* page is already allocated, just return */ 62 return 0; 63 64 if (!create) 65 return -ENOENT; 66 67 /* this page has not been allocated yet */ 68 69 spin_unlock_irq(&bitmap->lock); 70 /* It is possible that this is being called inside a 71 * prepare_to_wait/finish_wait loop from raid5c:make_request(). 72 * In general it is not permitted to sleep in that context as it 73 * can cause the loop to spin freely. 74 * That doesn't apply here as we can only reach this point 75 * once with any loop. 76 * When this function completes, either bp[page].map or 77 * bp[page].hijacked. In either case, this function will 78 * abort before getting to this point again. So there is 79 * no risk of a free-spin, and so it is safe to assert 80 * that sleeping here is allowed. 81 */ 82 sched_annotate_sleep(); 83 mappage = kzalloc(PAGE_SIZE, GFP_NOIO); 84 spin_lock_irq(&bitmap->lock); 85 86 if (mappage == NULL) { 87 pr_debug("md/bitmap: map page allocation failed, hijacking\n"); 88 /* We don't support hijack for cluster raid */ 89 if (no_hijack) 90 return -ENOMEM; 91 /* failed - set the hijacked flag so that we can use the 92 * pointer as a counter */ 93 if (!bitmap->bp[page].map) 94 bitmap->bp[page].hijacked = 1; 95 } else if (bitmap->bp[page].map || 96 bitmap->bp[page].hijacked) { 97 /* somebody beat us to getting the page */ 98 kfree(mappage); 99 } else { 100 101 /* no page was in place and we have one, so install it */ 102 103 bitmap->bp[page].map = mappage; 104 bitmap->missing_pages--; 105 } 106 return 0; 107 } 108 109 /* if page is completely empty, put it back on the free list, or dealloc it */ 110 /* if page was hijacked, unmark the flag so it might get alloced next time */ 111 /* Note: lock should be held when calling this */ 112 static void md_bitmap_checkfree(struct bitmap_counts *bitmap, unsigned long page) 113 { 114 char *ptr; 115 116 if (bitmap->bp[page].count) /* page is still busy */ 117 return; 118 119 /* page is no longer in use, it can be released */ 120 121 if (bitmap->bp[page].hijacked) { /* page was hijacked, undo this now */ 122 bitmap->bp[page].hijacked = 0; 123 bitmap->bp[page].map = NULL; 124 } else { 125 /* normal case, free the page */ 126 ptr = bitmap->bp[page].map; 127 bitmap->bp[page].map = NULL; 128 bitmap->missing_pages++; 129 kfree(ptr); 130 } 131 } 132 133 /* 134 * bitmap file handling - read and write the bitmap file and its superblock 135 */ 136 137 /* 138 * basic page I/O operations 139 */ 140 141 /* IO operations when bitmap is stored near all superblocks */ 142 143 /* choose a good rdev and read the page from there */ 144 static int read_sb_page(struct mddev *mddev, loff_t offset, 145 struct page *page, unsigned long index, int size) 146 { 147 148 sector_t sector = mddev->bitmap_info.offset + offset + 149 index * (PAGE_SIZE / SECTOR_SIZE); 150 struct md_rdev *rdev; 151 152 rdev_for_each(rdev, mddev) { 153 u32 iosize = roundup(size, bdev_logical_block_size(rdev->bdev)); 154 155 if (!test_bit(In_sync, &rdev->flags) || 156 test_bit(Faulty, &rdev->flags) || 157 test_bit(Bitmap_sync, &rdev->flags)) 158 continue; 159 160 if (sync_page_io(rdev, sector, iosize, page, REQ_OP_READ, true)) 161 return 0; 162 } 163 return -EIO; 164 } 165 166 static struct md_rdev *next_active_rdev(struct md_rdev *rdev, struct mddev *mddev) 167 { 168 /* Iterate the disks of an mddev, using rcu to protect access to the 169 * linked list, and raising the refcount of devices we return to ensure 170 * they don't disappear while in use. 171 * As devices are only added or removed when raid_disk is < 0 and 172 * nr_pending is 0 and In_sync is clear, the entries we return will 173 * still be in the same position on the list when we re-enter 174 * list_for_each_entry_continue_rcu. 175 * 176 * Note that if entered with 'rdev == NULL' to start at the 177 * beginning, we temporarily assign 'rdev' to an address which 178 * isn't really an rdev, but which can be used by 179 * list_for_each_entry_continue_rcu() to find the first entry. 180 */ 181 rcu_read_lock(); 182 if (rdev == NULL) 183 /* start at the beginning */ 184 rdev = list_entry(&mddev->disks, struct md_rdev, same_set); 185 else { 186 /* release the previous rdev and start from there. */ 187 rdev_dec_pending(rdev, mddev); 188 } 189 list_for_each_entry_continue_rcu(rdev, &mddev->disks, same_set) { 190 if (rdev->raid_disk >= 0 && 191 !test_bit(Faulty, &rdev->flags)) { 192 /* this is a usable devices */ 193 atomic_inc(&rdev->nr_pending); 194 rcu_read_unlock(); 195 return rdev; 196 } 197 } 198 rcu_read_unlock(); 199 return NULL; 200 } 201 202 static unsigned int optimal_io_size(struct block_device *bdev, 203 unsigned int last_page_size, 204 unsigned int io_size) 205 { 206 if (bdev_io_opt(bdev) > bdev_logical_block_size(bdev)) 207 return roundup(last_page_size, bdev_io_opt(bdev)); 208 return io_size; 209 } 210 211 static unsigned int bitmap_io_size(unsigned int io_size, unsigned int opt_size, 212 loff_t start, loff_t boundary) 213 { 214 if (io_size != opt_size && 215 start + opt_size / SECTOR_SIZE <= boundary) 216 return opt_size; 217 if (start + io_size / SECTOR_SIZE <= boundary) 218 return io_size; 219 220 /* Overflows boundary */ 221 return 0; 222 } 223 224 static int __write_sb_page(struct md_rdev *rdev, struct bitmap *bitmap, 225 unsigned long pg_index, struct page *page) 226 { 227 struct block_device *bdev; 228 struct mddev *mddev = bitmap->mddev; 229 struct bitmap_storage *store = &bitmap->storage; 230 unsigned int bitmap_limit = (bitmap->storage.file_pages - pg_index) << 231 PAGE_SHIFT; 232 loff_t sboff, offset = mddev->bitmap_info.offset; 233 sector_t ps = pg_index * PAGE_SIZE / SECTOR_SIZE; 234 unsigned int size = PAGE_SIZE; 235 unsigned int opt_size = PAGE_SIZE; 236 sector_t doff; 237 238 bdev = (rdev->meta_bdev) ? rdev->meta_bdev : rdev->bdev; 239 /* we compare length (page numbers), not page offset. */ 240 if ((pg_index - store->sb_index) == store->file_pages - 1) { 241 unsigned int last_page_size = store->bytes & (PAGE_SIZE - 1); 242 243 if (last_page_size == 0) 244 last_page_size = PAGE_SIZE; 245 size = roundup(last_page_size, bdev_logical_block_size(bdev)); 246 opt_size = optimal_io_size(bdev, last_page_size, size); 247 } 248 249 sboff = rdev->sb_start + offset; 250 doff = rdev->data_offset; 251 252 /* Just make sure we aren't corrupting data or metadata */ 253 if (mddev->external) { 254 /* Bitmap could be anywhere. */ 255 if (sboff + ps > doff && 256 sboff < (doff + mddev->dev_sectors + PAGE_SIZE / SECTOR_SIZE)) 257 return -EINVAL; 258 } else if (offset < 0) { 259 /* DATA BITMAP METADATA */ 260 size = bitmap_io_size(size, opt_size, offset + ps, 0); 261 if (size == 0) 262 /* bitmap runs in to metadata */ 263 return -EINVAL; 264 265 if (doff + mddev->dev_sectors > sboff) 266 /* data runs in to bitmap */ 267 return -EINVAL; 268 } else if (rdev->sb_start < rdev->data_offset) { 269 /* METADATA BITMAP DATA */ 270 size = bitmap_io_size(size, opt_size, sboff + ps, doff); 271 if (size == 0) 272 /* bitmap runs in to data */ 273 return -EINVAL; 274 } 275 276 md_super_write(mddev, rdev, sboff + ps, (int)min(size, bitmap_limit), page); 277 return 0; 278 } 279 280 static void write_sb_page(struct bitmap *bitmap, unsigned long pg_index, 281 struct page *page, bool wait) 282 { 283 struct mddev *mddev = bitmap->mddev; 284 285 do { 286 struct md_rdev *rdev = NULL; 287 288 while ((rdev = next_active_rdev(rdev, mddev)) != NULL) { 289 if (__write_sb_page(rdev, bitmap, pg_index, page) < 0) { 290 set_bit(BITMAP_WRITE_ERROR, &bitmap->flags); 291 return; 292 } 293 } 294 } while (wait && md_super_wait(mddev) < 0); 295 } 296 297 static void md_bitmap_file_kick(struct bitmap *bitmap); 298 299 #ifdef CONFIG_MD_BITMAP_FILE 300 static void write_file_page(struct bitmap *bitmap, struct page *page, int wait) 301 { 302 struct buffer_head *bh = page_buffers(page); 303 304 while (bh && bh->b_blocknr) { 305 atomic_inc(&bitmap->pending_writes); 306 set_buffer_locked(bh); 307 set_buffer_mapped(bh); 308 submit_bh(REQ_OP_WRITE | REQ_SYNC, bh); 309 bh = bh->b_this_page; 310 } 311 312 if (wait) 313 wait_event(bitmap->write_wait, 314 atomic_read(&bitmap->pending_writes) == 0); 315 } 316 317 static void end_bitmap_write(struct buffer_head *bh, int uptodate) 318 { 319 struct bitmap *bitmap = bh->b_private; 320 321 if (!uptodate) 322 set_bit(BITMAP_WRITE_ERROR, &bitmap->flags); 323 if (atomic_dec_and_test(&bitmap->pending_writes)) 324 wake_up(&bitmap->write_wait); 325 } 326 327 static void free_buffers(struct page *page) 328 { 329 struct buffer_head *bh; 330 331 if (!PagePrivate(page)) 332 return; 333 334 bh = page_buffers(page); 335 while (bh) { 336 struct buffer_head *next = bh->b_this_page; 337 free_buffer_head(bh); 338 bh = next; 339 } 340 detach_page_private(page); 341 put_page(page); 342 } 343 344 /* read a page from a file. 345 * We both read the page, and attach buffers to the page to record the 346 * address of each block (using bmap). These addresses will be used 347 * to write the block later, completely bypassing the filesystem. 348 * This usage is similar to how swap files are handled, and allows us 349 * to write to a file with no concerns of memory allocation failing. 350 */ 351 static int read_file_page(struct file *file, unsigned long index, 352 struct bitmap *bitmap, unsigned long count, struct page *page) 353 { 354 int ret = 0; 355 struct inode *inode = file_inode(file); 356 struct buffer_head *bh; 357 sector_t block, blk_cur; 358 unsigned long blocksize = i_blocksize(inode); 359 360 pr_debug("read bitmap file (%dB @ %llu)\n", (int)PAGE_SIZE, 361 (unsigned long long)index << PAGE_SHIFT); 362 363 bh = alloc_page_buffers(page, blocksize, false); 364 if (!bh) { 365 ret = -ENOMEM; 366 goto out; 367 } 368 attach_page_private(page, bh); 369 blk_cur = index << (PAGE_SHIFT - inode->i_blkbits); 370 while (bh) { 371 block = blk_cur; 372 373 if (count == 0) 374 bh->b_blocknr = 0; 375 else { 376 ret = bmap(inode, &block); 377 if (ret || !block) { 378 ret = -EINVAL; 379 bh->b_blocknr = 0; 380 goto out; 381 } 382 383 bh->b_blocknr = block; 384 bh->b_bdev = inode->i_sb->s_bdev; 385 if (count < blocksize) 386 count = 0; 387 else 388 count -= blocksize; 389 390 bh->b_end_io = end_bitmap_write; 391 bh->b_private = bitmap; 392 atomic_inc(&bitmap->pending_writes); 393 set_buffer_locked(bh); 394 set_buffer_mapped(bh); 395 submit_bh(REQ_OP_READ, bh); 396 } 397 blk_cur++; 398 bh = bh->b_this_page; 399 } 400 401 wait_event(bitmap->write_wait, 402 atomic_read(&bitmap->pending_writes)==0); 403 if (test_bit(BITMAP_WRITE_ERROR, &bitmap->flags)) 404 ret = -EIO; 405 out: 406 if (ret) 407 pr_err("md: bitmap read error: (%dB @ %llu): %d\n", 408 (int)PAGE_SIZE, 409 (unsigned long long)index << PAGE_SHIFT, 410 ret); 411 return ret; 412 } 413 #else /* CONFIG_MD_BITMAP_FILE */ 414 static void write_file_page(struct bitmap *bitmap, struct page *page, int wait) 415 { 416 } 417 static int read_file_page(struct file *file, unsigned long index, 418 struct bitmap *bitmap, unsigned long count, struct page *page) 419 { 420 return -EIO; 421 } 422 static void free_buffers(struct page *page) 423 { 424 put_page(page); 425 } 426 #endif /* CONFIG_MD_BITMAP_FILE */ 427 428 /* 429 * bitmap file superblock operations 430 */ 431 432 /* 433 * write out a page to a file 434 */ 435 static void filemap_write_page(struct bitmap *bitmap, unsigned long pg_index, 436 bool wait) 437 { 438 struct bitmap_storage *store = &bitmap->storage; 439 struct page *page = store->filemap[pg_index]; 440 441 if (mddev_is_clustered(bitmap->mddev)) { 442 /* go to node bitmap area starting point */ 443 pg_index += store->sb_index; 444 } 445 446 if (store->file) 447 write_file_page(bitmap, page, wait); 448 else 449 write_sb_page(bitmap, pg_index, page, wait); 450 } 451 452 /* 453 * md_bitmap_wait_writes() should be called before writing any bitmap 454 * blocks, to ensure previous writes, particularly from 455 * md_bitmap_daemon_work(), have completed. 456 */ 457 static void md_bitmap_wait_writes(struct bitmap *bitmap) 458 { 459 if (bitmap->storage.file) 460 wait_event(bitmap->write_wait, 461 atomic_read(&bitmap->pending_writes)==0); 462 else 463 /* Note that we ignore the return value. The writes 464 * might have failed, but that would just mean that 465 * some bits which should be cleared haven't been, 466 * which is safe. The relevant bitmap blocks will 467 * probably get written again, but there is no great 468 * loss if they aren't. 469 */ 470 md_super_wait(bitmap->mddev); 471 } 472 473 474 /* update the event counter and sync the superblock to disk */ 475 void md_bitmap_update_sb(struct bitmap *bitmap) 476 { 477 bitmap_super_t *sb; 478 479 if (!bitmap || !bitmap->mddev) /* no bitmap for this array */ 480 return; 481 if (bitmap->mddev->bitmap_info.external) 482 return; 483 if (!bitmap->storage.sb_page) /* no superblock */ 484 return; 485 sb = kmap_atomic(bitmap->storage.sb_page); 486 sb->events = cpu_to_le64(bitmap->mddev->events); 487 if (bitmap->mddev->events < bitmap->events_cleared) 488 /* rocking back to read-only */ 489 bitmap->events_cleared = bitmap->mddev->events; 490 sb->events_cleared = cpu_to_le64(bitmap->events_cleared); 491 /* 492 * clear BITMAP_WRITE_ERROR bit to protect against the case that 493 * a bitmap write error occurred but the later writes succeeded. 494 */ 495 sb->state = cpu_to_le32(bitmap->flags & ~BIT(BITMAP_WRITE_ERROR)); 496 /* Just in case these have been changed via sysfs: */ 497 sb->daemon_sleep = cpu_to_le32(bitmap->mddev->bitmap_info.daemon_sleep/HZ); 498 sb->write_behind = cpu_to_le32(bitmap->mddev->bitmap_info.max_write_behind); 499 /* This might have been changed by a reshape */ 500 sb->sync_size = cpu_to_le64(bitmap->mddev->resync_max_sectors); 501 sb->chunksize = cpu_to_le32(bitmap->mddev->bitmap_info.chunksize); 502 sb->nodes = cpu_to_le32(bitmap->mddev->bitmap_info.nodes); 503 sb->sectors_reserved = cpu_to_le32(bitmap->mddev-> 504 bitmap_info.space); 505 kunmap_atomic(sb); 506 507 if (bitmap->storage.file) 508 write_file_page(bitmap, bitmap->storage.sb_page, 1); 509 else 510 write_sb_page(bitmap, bitmap->storage.sb_index, 511 bitmap->storage.sb_page, 1); 512 } 513 EXPORT_SYMBOL(md_bitmap_update_sb); 514 515 /* print out the bitmap file superblock */ 516 void md_bitmap_print_sb(struct bitmap *bitmap) 517 { 518 bitmap_super_t *sb; 519 520 if (!bitmap || !bitmap->storage.sb_page) 521 return; 522 sb = kmap_atomic(bitmap->storage.sb_page); 523 pr_debug("%s: bitmap file superblock:\n", bmname(bitmap)); 524 pr_debug(" magic: %08x\n", le32_to_cpu(sb->magic)); 525 pr_debug(" version: %u\n", le32_to_cpu(sb->version)); 526 pr_debug(" uuid: %08x.%08x.%08x.%08x\n", 527 le32_to_cpu(*(__le32 *)(sb->uuid+0)), 528 le32_to_cpu(*(__le32 *)(sb->uuid+4)), 529 le32_to_cpu(*(__le32 *)(sb->uuid+8)), 530 le32_to_cpu(*(__le32 *)(sb->uuid+12))); 531 pr_debug(" events: %llu\n", 532 (unsigned long long) le64_to_cpu(sb->events)); 533 pr_debug("events cleared: %llu\n", 534 (unsigned long long) le64_to_cpu(sb->events_cleared)); 535 pr_debug(" state: %08x\n", le32_to_cpu(sb->state)); 536 pr_debug(" chunksize: %u B\n", le32_to_cpu(sb->chunksize)); 537 pr_debug(" daemon sleep: %us\n", le32_to_cpu(sb->daemon_sleep)); 538 pr_debug(" sync size: %llu KB\n", 539 (unsigned long long)le64_to_cpu(sb->sync_size)/2); 540 pr_debug("max write behind: %u\n", le32_to_cpu(sb->write_behind)); 541 kunmap_atomic(sb); 542 } 543 544 /* 545 * bitmap_new_disk_sb 546 * @bitmap 547 * 548 * This function is somewhat the reverse of bitmap_read_sb. bitmap_read_sb 549 * reads and verifies the on-disk bitmap superblock and populates bitmap_info. 550 * This function verifies 'bitmap_info' and populates the on-disk bitmap 551 * structure, which is to be written to disk. 552 * 553 * Returns: 0 on success, -Exxx on error 554 */ 555 static int md_bitmap_new_disk_sb(struct bitmap *bitmap) 556 { 557 bitmap_super_t *sb; 558 unsigned long chunksize, daemon_sleep, write_behind; 559 560 bitmap->storage.sb_page = alloc_page(GFP_KERNEL | __GFP_ZERO); 561 if (bitmap->storage.sb_page == NULL) 562 return -ENOMEM; 563 bitmap->storage.sb_index = 0; 564 565 sb = kmap_atomic(bitmap->storage.sb_page); 566 567 sb->magic = cpu_to_le32(BITMAP_MAGIC); 568 sb->version = cpu_to_le32(BITMAP_MAJOR_HI); 569 570 chunksize = bitmap->mddev->bitmap_info.chunksize; 571 BUG_ON(!chunksize); 572 if (!is_power_of_2(chunksize)) { 573 kunmap_atomic(sb); 574 pr_warn("bitmap chunksize not a power of 2\n"); 575 return -EINVAL; 576 } 577 sb->chunksize = cpu_to_le32(chunksize); 578 579 daemon_sleep = bitmap->mddev->bitmap_info.daemon_sleep; 580 if (!daemon_sleep || (daemon_sleep > MAX_SCHEDULE_TIMEOUT)) { 581 pr_debug("Choosing daemon_sleep default (5 sec)\n"); 582 daemon_sleep = 5 * HZ; 583 } 584 sb->daemon_sleep = cpu_to_le32(daemon_sleep); 585 bitmap->mddev->bitmap_info.daemon_sleep = daemon_sleep; 586 587 /* 588 * FIXME: write_behind for RAID1. If not specified, what 589 * is a good choice? We choose COUNTER_MAX / 2 arbitrarily. 590 */ 591 write_behind = bitmap->mddev->bitmap_info.max_write_behind; 592 if (write_behind > COUNTER_MAX) 593 write_behind = COUNTER_MAX / 2; 594 sb->write_behind = cpu_to_le32(write_behind); 595 bitmap->mddev->bitmap_info.max_write_behind = write_behind; 596 597 /* keep the array size field of the bitmap superblock up to date */ 598 sb->sync_size = cpu_to_le64(bitmap->mddev->resync_max_sectors); 599 600 memcpy(sb->uuid, bitmap->mddev->uuid, 16); 601 602 set_bit(BITMAP_STALE, &bitmap->flags); 603 sb->state = cpu_to_le32(bitmap->flags); 604 bitmap->events_cleared = bitmap->mddev->events; 605 sb->events_cleared = cpu_to_le64(bitmap->mddev->events); 606 bitmap->mddev->bitmap_info.nodes = 0; 607 608 kunmap_atomic(sb); 609 610 return 0; 611 } 612 613 /* read the superblock from the bitmap file and initialize some bitmap fields */ 614 static int md_bitmap_read_sb(struct bitmap *bitmap) 615 { 616 char *reason = NULL; 617 bitmap_super_t *sb; 618 unsigned long chunksize, daemon_sleep, write_behind; 619 unsigned long long events; 620 int nodes = 0; 621 unsigned long sectors_reserved = 0; 622 int err = -EINVAL; 623 struct page *sb_page; 624 loff_t offset = 0; 625 626 if (!bitmap->storage.file && !bitmap->mddev->bitmap_info.offset) { 627 chunksize = 128 * 1024 * 1024; 628 daemon_sleep = 5 * HZ; 629 write_behind = 0; 630 set_bit(BITMAP_STALE, &bitmap->flags); 631 err = 0; 632 goto out_no_sb; 633 } 634 /* page 0 is the superblock, read it... */ 635 sb_page = alloc_page(GFP_KERNEL); 636 if (!sb_page) 637 return -ENOMEM; 638 bitmap->storage.sb_page = sb_page; 639 640 re_read: 641 /* If cluster_slot is set, the cluster is setup */ 642 if (bitmap->cluster_slot >= 0) { 643 sector_t bm_blocks = bitmap->mddev->resync_max_sectors; 644 645 bm_blocks = DIV_ROUND_UP_SECTOR_T(bm_blocks, 646 (bitmap->mddev->bitmap_info.chunksize >> 9)); 647 /* bits to bytes */ 648 bm_blocks = ((bm_blocks+7) >> 3) + sizeof(bitmap_super_t); 649 /* to 4k blocks */ 650 bm_blocks = DIV_ROUND_UP_SECTOR_T(bm_blocks, 4096); 651 offset = bitmap->cluster_slot * (bm_blocks << 3); 652 pr_debug("%s:%d bm slot: %d offset: %llu\n", __func__, __LINE__, 653 bitmap->cluster_slot, offset); 654 } 655 656 if (bitmap->storage.file) { 657 loff_t isize = i_size_read(bitmap->storage.file->f_mapping->host); 658 int bytes = isize > PAGE_SIZE ? PAGE_SIZE : isize; 659 660 err = read_file_page(bitmap->storage.file, 0, 661 bitmap, bytes, sb_page); 662 } else { 663 err = read_sb_page(bitmap->mddev, offset, sb_page, 0, 664 sizeof(bitmap_super_t)); 665 } 666 if (err) 667 return err; 668 669 err = -EINVAL; 670 sb = kmap_atomic(sb_page); 671 672 chunksize = le32_to_cpu(sb->chunksize); 673 daemon_sleep = le32_to_cpu(sb->daemon_sleep) * HZ; 674 write_behind = le32_to_cpu(sb->write_behind); 675 sectors_reserved = le32_to_cpu(sb->sectors_reserved); 676 677 /* verify that the bitmap-specific fields are valid */ 678 if (sb->magic != cpu_to_le32(BITMAP_MAGIC)) 679 reason = "bad magic"; 680 else if (le32_to_cpu(sb->version) < BITMAP_MAJOR_LO || 681 le32_to_cpu(sb->version) > BITMAP_MAJOR_CLUSTERED) 682 reason = "unrecognized superblock version"; 683 else if (chunksize < 512) 684 reason = "bitmap chunksize too small"; 685 else if (!is_power_of_2(chunksize)) 686 reason = "bitmap chunksize not a power of 2"; 687 else if (daemon_sleep < 1 || daemon_sleep > MAX_SCHEDULE_TIMEOUT) 688 reason = "daemon sleep period out of range"; 689 else if (write_behind > COUNTER_MAX) 690 reason = "write-behind limit out of range (0 - 16383)"; 691 if (reason) { 692 pr_warn("%s: invalid bitmap file superblock: %s\n", 693 bmname(bitmap), reason); 694 goto out; 695 } 696 697 /* 698 * Setup nodes/clustername only if bitmap version is 699 * cluster-compatible 700 */ 701 if (sb->version == cpu_to_le32(BITMAP_MAJOR_CLUSTERED)) { 702 nodes = le32_to_cpu(sb->nodes); 703 strscpy(bitmap->mddev->bitmap_info.cluster_name, 704 sb->cluster_name, 64); 705 } 706 707 /* keep the array size field of the bitmap superblock up to date */ 708 sb->sync_size = cpu_to_le64(bitmap->mddev->resync_max_sectors); 709 710 if (bitmap->mddev->persistent) { 711 /* 712 * We have a persistent array superblock, so compare the 713 * bitmap's UUID and event counter to the mddev's 714 */ 715 if (memcmp(sb->uuid, bitmap->mddev->uuid, 16)) { 716 pr_warn("%s: bitmap superblock UUID mismatch\n", 717 bmname(bitmap)); 718 goto out; 719 } 720 events = le64_to_cpu(sb->events); 721 if (!nodes && (events < bitmap->mddev->events)) { 722 pr_warn("%s: bitmap file is out of date (%llu < %llu) -- forcing full recovery\n", 723 bmname(bitmap), events, 724 (unsigned long long) bitmap->mddev->events); 725 set_bit(BITMAP_STALE, &bitmap->flags); 726 } 727 } 728 729 /* assign fields using values from superblock */ 730 bitmap->flags |= le32_to_cpu(sb->state); 731 if (le32_to_cpu(sb->version) == BITMAP_MAJOR_HOSTENDIAN) 732 set_bit(BITMAP_HOSTENDIAN, &bitmap->flags); 733 bitmap->events_cleared = le64_to_cpu(sb->events_cleared); 734 err = 0; 735 736 out: 737 kunmap_atomic(sb); 738 if (err == 0 && nodes && (bitmap->cluster_slot < 0)) { 739 /* Assigning chunksize is required for "re_read" */ 740 bitmap->mddev->bitmap_info.chunksize = chunksize; 741 err = md_setup_cluster(bitmap->mddev, nodes); 742 if (err) { 743 pr_warn("%s: Could not setup cluster service (%d)\n", 744 bmname(bitmap), err); 745 goto out_no_sb; 746 } 747 bitmap->cluster_slot = md_cluster_ops->slot_number(bitmap->mddev); 748 goto re_read; 749 } 750 751 out_no_sb: 752 if (err == 0) { 753 if (test_bit(BITMAP_STALE, &bitmap->flags)) 754 bitmap->events_cleared = bitmap->mddev->events; 755 bitmap->mddev->bitmap_info.chunksize = chunksize; 756 bitmap->mddev->bitmap_info.daemon_sleep = daemon_sleep; 757 bitmap->mddev->bitmap_info.max_write_behind = write_behind; 758 bitmap->mddev->bitmap_info.nodes = nodes; 759 if (bitmap->mddev->bitmap_info.space == 0 || 760 bitmap->mddev->bitmap_info.space > sectors_reserved) 761 bitmap->mddev->bitmap_info.space = sectors_reserved; 762 } else { 763 md_bitmap_print_sb(bitmap); 764 if (bitmap->cluster_slot < 0) 765 md_cluster_stop(bitmap->mddev); 766 } 767 return err; 768 } 769 770 /* 771 * general bitmap file operations 772 */ 773 774 /* 775 * on-disk bitmap: 776 * 777 * Use one bit per "chunk" (block set). We do the disk I/O on the bitmap 778 * file a page at a time. There's a superblock at the start of the file. 779 */ 780 /* calculate the index of the page that contains this bit */ 781 static inline unsigned long file_page_index(struct bitmap_storage *store, 782 unsigned long chunk) 783 { 784 if (store->sb_page) 785 chunk += sizeof(bitmap_super_t) << 3; 786 return chunk >> PAGE_BIT_SHIFT; 787 } 788 789 /* calculate the (bit) offset of this bit within a page */ 790 static inline unsigned long file_page_offset(struct bitmap_storage *store, 791 unsigned long chunk) 792 { 793 if (store->sb_page) 794 chunk += sizeof(bitmap_super_t) << 3; 795 return chunk & (PAGE_BITS - 1); 796 } 797 798 /* 799 * return a pointer to the page in the filemap that contains the given bit 800 * 801 */ 802 static inline struct page *filemap_get_page(struct bitmap_storage *store, 803 unsigned long chunk) 804 { 805 if (file_page_index(store, chunk) >= store->file_pages) 806 return NULL; 807 return store->filemap[file_page_index(store, chunk)]; 808 } 809 810 static int md_bitmap_storage_alloc(struct bitmap_storage *store, 811 unsigned long chunks, int with_super, 812 int slot_number) 813 { 814 int pnum, offset = 0; 815 unsigned long num_pages; 816 unsigned long bytes; 817 818 bytes = DIV_ROUND_UP(chunks, 8); 819 if (with_super) 820 bytes += sizeof(bitmap_super_t); 821 822 num_pages = DIV_ROUND_UP(bytes, PAGE_SIZE); 823 offset = slot_number * num_pages; 824 825 store->filemap = kmalloc_array(num_pages, sizeof(struct page *), 826 GFP_KERNEL); 827 if (!store->filemap) 828 return -ENOMEM; 829 830 if (with_super && !store->sb_page) { 831 store->sb_page = alloc_page(GFP_KERNEL|__GFP_ZERO); 832 if (store->sb_page == NULL) 833 return -ENOMEM; 834 } 835 836 pnum = 0; 837 if (store->sb_page) { 838 store->filemap[0] = store->sb_page; 839 pnum = 1; 840 store->sb_index = offset; 841 } 842 843 for ( ; pnum < num_pages; pnum++) { 844 store->filemap[pnum] = alloc_page(GFP_KERNEL|__GFP_ZERO); 845 if (!store->filemap[pnum]) { 846 store->file_pages = pnum; 847 return -ENOMEM; 848 } 849 } 850 store->file_pages = pnum; 851 852 /* We need 4 bits per page, rounded up to a multiple 853 * of sizeof(unsigned long) */ 854 store->filemap_attr = kzalloc( 855 roundup(DIV_ROUND_UP(num_pages*4, 8), sizeof(unsigned long)), 856 GFP_KERNEL); 857 if (!store->filemap_attr) 858 return -ENOMEM; 859 860 store->bytes = bytes; 861 862 return 0; 863 } 864 865 static void md_bitmap_file_unmap(struct bitmap_storage *store) 866 { 867 struct file *file = store->file; 868 struct page *sb_page = store->sb_page; 869 struct page **map = store->filemap; 870 int pages = store->file_pages; 871 872 while (pages--) 873 if (map[pages] != sb_page) /* 0 is sb_page, release it below */ 874 free_buffers(map[pages]); 875 kfree(map); 876 kfree(store->filemap_attr); 877 878 if (sb_page) 879 free_buffers(sb_page); 880 881 if (file) { 882 struct inode *inode = file_inode(file); 883 invalidate_mapping_pages(inode->i_mapping, 0, -1); 884 fput(file); 885 } 886 } 887 888 /* 889 * bitmap_file_kick - if an error occurs while manipulating the bitmap file 890 * then it is no longer reliable, so we stop using it and we mark the file 891 * as failed in the superblock 892 */ 893 static void md_bitmap_file_kick(struct bitmap *bitmap) 894 { 895 if (!test_and_set_bit(BITMAP_STALE, &bitmap->flags)) { 896 md_bitmap_update_sb(bitmap); 897 898 if (bitmap->storage.file) { 899 pr_warn("%s: kicking failed bitmap file %pD4 from array!\n", 900 bmname(bitmap), bitmap->storage.file); 901 902 } else 903 pr_warn("%s: disabling internal bitmap due to errors\n", 904 bmname(bitmap)); 905 } 906 } 907 908 enum bitmap_page_attr { 909 BITMAP_PAGE_DIRTY = 0, /* there are set bits that need to be synced */ 910 BITMAP_PAGE_PENDING = 1, /* there are bits that are being cleaned. 911 * i.e. counter is 1 or 2. */ 912 BITMAP_PAGE_NEEDWRITE = 2, /* there are cleared bits that need to be synced */ 913 }; 914 915 static inline void set_page_attr(struct bitmap *bitmap, int pnum, 916 enum bitmap_page_attr attr) 917 { 918 set_bit((pnum<<2) + attr, bitmap->storage.filemap_attr); 919 } 920 921 static inline void clear_page_attr(struct bitmap *bitmap, int pnum, 922 enum bitmap_page_attr attr) 923 { 924 clear_bit((pnum<<2) + attr, bitmap->storage.filemap_attr); 925 } 926 927 static inline int test_page_attr(struct bitmap *bitmap, int pnum, 928 enum bitmap_page_attr attr) 929 { 930 return test_bit((pnum<<2) + attr, bitmap->storage.filemap_attr); 931 } 932 933 static inline int test_and_clear_page_attr(struct bitmap *bitmap, int pnum, 934 enum bitmap_page_attr attr) 935 { 936 return test_and_clear_bit((pnum<<2) + attr, 937 bitmap->storage.filemap_attr); 938 } 939 /* 940 * bitmap_file_set_bit -- called before performing a write to the md device 941 * to set (and eventually sync) a particular bit in the bitmap file 942 * 943 * we set the bit immediately, then we record the page number so that 944 * when an unplug occurs, we can flush the dirty pages out to disk 945 */ 946 static void md_bitmap_file_set_bit(struct bitmap *bitmap, sector_t block) 947 { 948 unsigned long bit; 949 struct page *page; 950 void *kaddr; 951 unsigned long chunk = block >> bitmap->counts.chunkshift; 952 struct bitmap_storage *store = &bitmap->storage; 953 unsigned long index = file_page_index(store, chunk); 954 unsigned long node_offset = 0; 955 956 index += store->sb_index; 957 if (mddev_is_clustered(bitmap->mddev)) 958 node_offset = bitmap->cluster_slot * store->file_pages; 959 960 page = filemap_get_page(&bitmap->storage, chunk); 961 if (!page) 962 return; 963 bit = file_page_offset(&bitmap->storage, chunk); 964 965 /* set the bit */ 966 kaddr = kmap_atomic(page); 967 if (test_bit(BITMAP_HOSTENDIAN, &bitmap->flags)) 968 set_bit(bit, kaddr); 969 else 970 set_bit_le(bit, kaddr); 971 kunmap_atomic(kaddr); 972 pr_debug("set file bit %lu page %lu\n", bit, index); 973 /* record page number so it gets flushed to disk when unplug occurs */ 974 set_page_attr(bitmap, index - node_offset, BITMAP_PAGE_DIRTY); 975 } 976 977 static void md_bitmap_file_clear_bit(struct bitmap *bitmap, sector_t block) 978 { 979 unsigned long bit; 980 struct page *page; 981 void *paddr; 982 unsigned long chunk = block >> bitmap->counts.chunkshift; 983 struct bitmap_storage *store = &bitmap->storage; 984 unsigned long index = file_page_index(store, chunk); 985 unsigned long node_offset = 0; 986 987 index += store->sb_index; 988 if (mddev_is_clustered(bitmap->mddev)) 989 node_offset = bitmap->cluster_slot * store->file_pages; 990 991 page = filemap_get_page(&bitmap->storage, chunk); 992 if (!page) 993 return; 994 bit = file_page_offset(&bitmap->storage, chunk); 995 paddr = kmap_atomic(page); 996 if (test_bit(BITMAP_HOSTENDIAN, &bitmap->flags)) 997 clear_bit(bit, paddr); 998 else 999 clear_bit_le(bit, paddr); 1000 kunmap_atomic(paddr); 1001 if (!test_page_attr(bitmap, index - node_offset, BITMAP_PAGE_NEEDWRITE)) { 1002 set_page_attr(bitmap, index - node_offset, BITMAP_PAGE_PENDING); 1003 bitmap->allclean = 0; 1004 } 1005 } 1006 1007 static int md_bitmap_file_test_bit(struct bitmap *bitmap, sector_t block) 1008 { 1009 unsigned long bit; 1010 struct page *page; 1011 void *paddr; 1012 unsigned long chunk = block >> bitmap->counts.chunkshift; 1013 int set = 0; 1014 1015 page = filemap_get_page(&bitmap->storage, chunk); 1016 if (!page) 1017 return -EINVAL; 1018 bit = file_page_offset(&bitmap->storage, chunk); 1019 paddr = kmap_atomic(page); 1020 if (test_bit(BITMAP_HOSTENDIAN, &bitmap->flags)) 1021 set = test_bit(bit, paddr); 1022 else 1023 set = test_bit_le(bit, paddr); 1024 kunmap_atomic(paddr); 1025 return set; 1026 } 1027 1028 /* this gets called when the md device is ready to unplug its underlying 1029 * (slave) device queues -- before we let any writes go down, we need to 1030 * sync the dirty pages of the bitmap file to disk */ 1031 void md_bitmap_unplug(struct bitmap *bitmap) 1032 { 1033 unsigned long i; 1034 int dirty, need_write; 1035 int writing = 0; 1036 1037 if (!md_bitmap_enabled(bitmap)) 1038 return; 1039 1040 /* look at each page to see if there are any set bits that need to be 1041 * flushed out to disk */ 1042 for (i = 0; i < bitmap->storage.file_pages; i++) { 1043 dirty = test_and_clear_page_attr(bitmap, i, BITMAP_PAGE_DIRTY); 1044 need_write = test_and_clear_page_attr(bitmap, i, 1045 BITMAP_PAGE_NEEDWRITE); 1046 if (dirty || need_write) { 1047 if (!writing) { 1048 md_bitmap_wait_writes(bitmap); 1049 if (bitmap->mddev->queue) 1050 blk_add_trace_msg(bitmap->mddev->queue, 1051 "md bitmap_unplug"); 1052 } 1053 clear_page_attr(bitmap, i, BITMAP_PAGE_PENDING); 1054 filemap_write_page(bitmap, i, false); 1055 writing = 1; 1056 } 1057 } 1058 if (writing) 1059 md_bitmap_wait_writes(bitmap); 1060 1061 if (test_bit(BITMAP_WRITE_ERROR, &bitmap->flags)) 1062 md_bitmap_file_kick(bitmap); 1063 } 1064 EXPORT_SYMBOL(md_bitmap_unplug); 1065 1066 struct bitmap_unplug_work { 1067 struct work_struct work; 1068 struct bitmap *bitmap; 1069 struct completion *done; 1070 }; 1071 1072 static void md_bitmap_unplug_fn(struct work_struct *work) 1073 { 1074 struct bitmap_unplug_work *unplug_work = 1075 container_of(work, struct bitmap_unplug_work, work); 1076 1077 md_bitmap_unplug(unplug_work->bitmap); 1078 complete(unplug_work->done); 1079 } 1080 1081 void md_bitmap_unplug_async(struct bitmap *bitmap) 1082 { 1083 DECLARE_COMPLETION_ONSTACK(done); 1084 struct bitmap_unplug_work unplug_work; 1085 1086 INIT_WORK_ONSTACK(&unplug_work.work, md_bitmap_unplug_fn); 1087 unplug_work.bitmap = bitmap; 1088 unplug_work.done = &done; 1089 1090 queue_work(md_bitmap_wq, &unplug_work.work); 1091 wait_for_completion(&done); 1092 destroy_work_on_stack(&unplug_work.work); 1093 } 1094 EXPORT_SYMBOL(md_bitmap_unplug_async); 1095 1096 static void md_bitmap_set_memory_bits(struct bitmap *bitmap, sector_t offset, int needed); 1097 1098 /* 1099 * Initialize the in-memory bitmap from the on-disk bitmap and set up the memory 1100 * mapping of the bitmap file. 1101 * 1102 * Special case: If there's no bitmap file, or if the bitmap file had been 1103 * previously kicked from the array, we mark all the bits as 1's in order to 1104 * cause a full resync. 1105 * 1106 * We ignore all bits for sectors that end earlier than 'start'. 1107 * This is used when reading an out-of-date bitmap. 1108 */ 1109 static int md_bitmap_init_from_disk(struct bitmap *bitmap, sector_t start) 1110 { 1111 bool outofdate = test_bit(BITMAP_STALE, &bitmap->flags); 1112 struct mddev *mddev = bitmap->mddev; 1113 unsigned long chunks = bitmap->counts.chunks; 1114 struct bitmap_storage *store = &bitmap->storage; 1115 struct file *file = store->file; 1116 unsigned long node_offset = 0; 1117 unsigned long bit_cnt = 0; 1118 unsigned long i; 1119 int ret; 1120 1121 if (!file && !mddev->bitmap_info.offset) { 1122 /* No permanent bitmap - fill with '1s'. */ 1123 store->filemap = NULL; 1124 store->file_pages = 0; 1125 for (i = 0; i < chunks ; i++) { 1126 /* if the disk bit is set, set the memory bit */ 1127 int needed = ((sector_t)(i+1) << (bitmap->counts.chunkshift) 1128 >= start); 1129 md_bitmap_set_memory_bits(bitmap, 1130 (sector_t)i << bitmap->counts.chunkshift, 1131 needed); 1132 } 1133 return 0; 1134 } 1135 1136 if (file && i_size_read(file->f_mapping->host) < store->bytes) { 1137 pr_warn("%s: bitmap file too short %lu < %lu\n", 1138 bmname(bitmap), 1139 (unsigned long) i_size_read(file->f_mapping->host), 1140 store->bytes); 1141 ret = -ENOSPC; 1142 goto err; 1143 } 1144 1145 if (mddev_is_clustered(mddev)) 1146 node_offset = bitmap->cluster_slot * (DIV_ROUND_UP(store->bytes, PAGE_SIZE)); 1147 1148 for (i = 0; i < store->file_pages; i++) { 1149 struct page *page = store->filemap[i]; 1150 int count; 1151 1152 /* unmap the old page, we're done with it */ 1153 if (i == store->file_pages - 1) 1154 count = store->bytes - i * PAGE_SIZE; 1155 else 1156 count = PAGE_SIZE; 1157 1158 if (file) 1159 ret = read_file_page(file, i, bitmap, count, page); 1160 else 1161 ret = read_sb_page(mddev, 0, page, i + node_offset, 1162 count); 1163 if (ret) 1164 goto err; 1165 } 1166 1167 if (outofdate) { 1168 pr_warn("%s: bitmap file is out of date, doing full recovery\n", 1169 bmname(bitmap)); 1170 1171 for (i = 0; i < store->file_pages; i++) { 1172 struct page *page = store->filemap[i]; 1173 unsigned long offset = 0; 1174 void *paddr; 1175 1176 if (i == 0 && !mddev->bitmap_info.external) 1177 offset = sizeof(bitmap_super_t); 1178 1179 /* 1180 * If the bitmap is out of date, dirty the whole page 1181 * and write it out 1182 */ 1183 paddr = kmap_atomic(page); 1184 memset(paddr + offset, 0xff, PAGE_SIZE - offset); 1185 kunmap_atomic(paddr); 1186 1187 filemap_write_page(bitmap, i, true); 1188 if (test_bit(BITMAP_WRITE_ERROR, &bitmap->flags)) { 1189 ret = -EIO; 1190 goto err; 1191 } 1192 } 1193 } 1194 1195 for (i = 0; i < chunks; i++) { 1196 struct page *page = filemap_get_page(&bitmap->storage, i); 1197 unsigned long bit = file_page_offset(&bitmap->storage, i); 1198 void *paddr; 1199 bool was_set; 1200 1201 paddr = kmap_atomic(page); 1202 if (test_bit(BITMAP_HOSTENDIAN, &bitmap->flags)) 1203 was_set = test_bit(bit, paddr); 1204 else 1205 was_set = test_bit_le(bit, paddr); 1206 kunmap_atomic(paddr); 1207 1208 if (was_set) { 1209 /* if the disk bit is set, set the memory bit */ 1210 int needed = ((sector_t)(i+1) << bitmap->counts.chunkshift 1211 >= start); 1212 md_bitmap_set_memory_bits(bitmap, 1213 (sector_t)i << bitmap->counts.chunkshift, 1214 needed); 1215 bit_cnt++; 1216 } 1217 } 1218 1219 pr_debug("%s: bitmap initialized from disk: read %lu pages, set %lu of %lu bits\n", 1220 bmname(bitmap), store->file_pages, 1221 bit_cnt, chunks); 1222 1223 return 0; 1224 1225 err: 1226 pr_warn("%s: bitmap initialisation failed: %d\n", 1227 bmname(bitmap), ret); 1228 return ret; 1229 } 1230 1231 void md_bitmap_write_all(struct bitmap *bitmap) 1232 { 1233 /* We don't actually write all bitmap blocks here, 1234 * just flag them as needing to be written 1235 */ 1236 int i; 1237 1238 if (!bitmap || !bitmap->storage.filemap) 1239 return; 1240 if (bitmap->storage.file) 1241 /* Only one copy, so nothing needed */ 1242 return; 1243 1244 for (i = 0; i < bitmap->storage.file_pages; i++) 1245 set_page_attr(bitmap, i, 1246 BITMAP_PAGE_NEEDWRITE); 1247 bitmap->allclean = 0; 1248 } 1249 1250 static void md_bitmap_count_page(struct bitmap_counts *bitmap, 1251 sector_t offset, int inc) 1252 { 1253 sector_t chunk = offset >> bitmap->chunkshift; 1254 unsigned long page = chunk >> PAGE_COUNTER_SHIFT; 1255 bitmap->bp[page].count += inc; 1256 md_bitmap_checkfree(bitmap, page); 1257 } 1258 1259 static void md_bitmap_set_pending(struct bitmap_counts *bitmap, sector_t offset) 1260 { 1261 sector_t chunk = offset >> bitmap->chunkshift; 1262 unsigned long page = chunk >> PAGE_COUNTER_SHIFT; 1263 struct bitmap_page *bp = &bitmap->bp[page]; 1264 1265 if (!bp->pending) 1266 bp->pending = 1; 1267 } 1268 1269 static bitmap_counter_t *md_bitmap_get_counter(struct bitmap_counts *bitmap, 1270 sector_t offset, sector_t *blocks, 1271 int create); 1272 1273 static void mddev_set_timeout(struct mddev *mddev, unsigned long timeout, 1274 bool force) 1275 { 1276 struct md_thread *thread; 1277 1278 rcu_read_lock(); 1279 thread = rcu_dereference(mddev->thread); 1280 1281 if (!thread) 1282 goto out; 1283 1284 if (force || thread->timeout < MAX_SCHEDULE_TIMEOUT) 1285 thread->timeout = timeout; 1286 1287 out: 1288 rcu_read_unlock(); 1289 } 1290 1291 /* 1292 * bitmap daemon -- periodically wakes up to clean bits and flush pages 1293 * out to disk 1294 */ 1295 void md_bitmap_daemon_work(struct mddev *mddev) 1296 { 1297 struct bitmap *bitmap; 1298 unsigned long j; 1299 unsigned long nextpage; 1300 sector_t blocks; 1301 struct bitmap_counts *counts; 1302 1303 /* Use a mutex to guard daemon_work against 1304 * bitmap_destroy. 1305 */ 1306 mutex_lock(&mddev->bitmap_info.mutex); 1307 bitmap = mddev->bitmap; 1308 if (bitmap == NULL) { 1309 mutex_unlock(&mddev->bitmap_info.mutex); 1310 return; 1311 } 1312 if (time_before(jiffies, bitmap->daemon_lastrun 1313 + mddev->bitmap_info.daemon_sleep)) 1314 goto done; 1315 1316 bitmap->daemon_lastrun = jiffies; 1317 if (bitmap->allclean) { 1318 mddev_set_timeout(mddev, MAX_SCHEDULE_TIMEOUT, true); 1319 goto done; 1320 } 1321 bitmap->allclean = 1; 1322 1323 if (bitmap->mddev->queue) 1324 blk_add_trace_msg(bitmap->mddev->queue, 1325 "md bitmap_daemon_work"); 1326 1327 /* Any file-page which is PENDING now needs to be written. 1328 * So set NEEDWRITE now, then after we make any last-minute changes 1329 * we will write it. 1330 */ 1331 for (j = 0; j < bitmap->storage.file_pages; j++) 1332 if (test_and_clear_page_attr(bitmap, j, 1333 BITMAP_PAGE_PENDING)) 1334 set_page_attr(bitmap, j, 1335 BITMAP_PAGE_NEEDWRITE); 1336 1337 if (bitmap->need_sync && 1338 mddev->bitmap_info.external == 0) { 1339 /* Arrange for superblock update as well as 1340 * other changes */ 1341 bitmap_super_t *sb; 1342 bitmap->need_sync = 0; 1343 if (bitmap->storage.filemap) { 1344 sb = kmap_atomic(bitmap->storage.sb_page); 1345 sb->events_cleared = 1346 cpu_to_le64(bitmap->events_cleared); 1347 kunmap_atomic(sb); 1348 set_page_attr(bitmap, 0, 1349 BITMAP_PAGE_NEEDWRITE); 1350 } 1351 } 1352 /* Now look at the bitmap counters and if any are '2' or '1', 1353 * decrement and handle accordingly. 1354 */ 1355 counts = &bitmap->counts; 1356 spin_lock_irq(&counts->lock); 1357 nextpage = 0; 1358 for (j = 0; j < counts->chunks; j++) { 1359 bitmap_counter_t *bmc; 1360 sector_t block = (sector_t)j << counts->chunkshift; 1361 1362 if (j == nextpage) { 1363 nextpage += PAGE_COUNTER_RATIO; 1364 if (!counts->bp[j >> PAGE_COUNTER_SHIFT].pending) { 1365 j |= PAGE_COUNTER_MASK; 1366 continue; 1367 } 1368 counts->bp[j >> PAGE_COUNTER_SHIFT].pending = 0; 1369 } 1370 1371 bmc = md_bitmap_get_counter(counts, block, &blocks, 0); 1372 if (!bmc) { 1373 j |= PAGE_COUNTER_MASK; 1374 continue; 1375 } 1376 if (*bmc == 1 && !bitmap->need_sync) { 1377 /* We can clear the bit */ 1378 *bmc = 0; 1379 md_bitmap_count_page(counts, block, -1); 1380 md_bitmap_file_clear_bit(bitmap, block); 1381 } else if (*bmc && *bmc <= 2) { 1382 *bmc = 1; 1383 md_bitmap_set_pending(counts, block); 1384 bitmap->allclean = 0; 1385 } 1386 } 1387 spin_unlock_irq(&counts->lock); 1388 1389 md_bitmap_wait_writes(bitmap); 1390 /* Now start writeout on any page in NEEDWRITE that isn't DIRTY. 1391 * DIRTY pages need to be written by bitmap_unplug so it can wait 1392 * for them. 1393 * If we find any DIRTY page we stop there and let bitmap_unplug 1394 * handle all the rest. This is important in the case where 1395 * the first blocking holds the superblock and it has been updated. 1396 * We mustn't write any other blocks before the superblock. 1397 */ 1398 for (j = 0; 1399 j < bitmap->storage.file_pages 1400 && !test_bit(BITMAP_STALE, &bitmap->flags); 1401 j++) { 1402 if (test_page_attr(bitmap, j, 1403 BITMAP_PAGE_DIRTY)) 1404 /* bitmap_unplug will handle the rest */ 1405 break; 1406 if (bitmap->storage.filemap && 1407 test_and_clear_page_attr(bitmap, j, 1408 BITMAP_PAGE_NEEDWRITE)) 1409 filemap_write_page(bitmap, j, false); 1410 } 1411 1412 done: 1413 if (bitmap->allclean == 0) 1414 mddev_set_timeout(mddev, mddev->bitmap_info.daemon_sleep, true); 1415 mutex_unlock(&mddev->bitmap_info.mutex); 1416 } 1417 1418 static bitmap_counter_t *md_bitmap_get_counter(struct bitmap_counts *bitmap, 1419 sector_t offset, sector_t *blocks, 1420 int create) 1421 __releases(bitmap->lock) 1422 __acquires(bitmap->lock) 1423 { 1424 /* If 'create', we might release the lock and reclaim it. 1425 * The lock must have been taken with interrupts enabled. 1426 * If !create, we don't release the lock. 1427 */ 1428 sector_t chunk = offset >> bitmap->chunkshift; 1429 unsigned long page = chunk >> PAGE_COUNTER_SHIFT; 1430 unsigned long pageoff = (chunk & PAGE_COUNTER_MASK) << COUNTER_BYTE_SHIFT; 1431 sector_t csize = ((sector_t)1) << bitmap->chunkshift; 1432 int err; 1433 1434 if (page >= bitmap->pages) { 1435 /* 1436 * This can happen if bitmap_start_sync goes beyond 1437 * End-of-device while looking for a whole page or 1438 * user set a huge number to sysfs bitmap_set_bits. 1439 */ 1440 *blocks = csize - (offset & (csize - 1)); 1441 return NULL; 1442 } 1443 err = md_bitmap_checkpage(bitmap, page, create, 0); 1444 1445 if (bitmap->bp[page].hijacked || 1446 bitmap->bp[page].map == NULL) 1447 csize = ((sector_t)1) << (bitmap->chunkshift + 1448 PAGE_COUNTER_SHIFT); 1449 1450 *blocks = csize - (offset & (csize - 1)); 1451 1452 if (err < 0) 1453 return NULL; 1454 1455 /* now locked ... */ 1456 1457 if (bitmap->bp[page].hijacked) { /* hijacked pointer */ 1458 /* should we use the first or second counter field 1459 * of the hijacked pointer? */ 1460 int hi = (pageoff > PAGE_COUNTER_MASK); 1461 return &((bitmap_counter_t *) 1462 &bitmap->bp[page].map)[hi]; 1463 } else /* page is allocated */ 1464 return (bitmap_counter_t *) 1465 &(bitmap->bp[page].map[pageoff]); 1466 } 1467 1468 int md_bitmap_startwrite(struct bitmap *bitmap, sector_t offset, unsigned long sectors, int behind) 1469 { 1470 if (!bitmap) 1471 return 0; 1472 1473 if (behind) { 1474 int bw; 1475 atomic_inc(&bitmap->behind_writes); 1476 bw = atomic_read(&bitmap->behind_writes); 1477 if (bw > bitmap->behind_writes_used) 1478 bitmap->behind_writes_used = bw; 1479 1480 pr_debug("inc write-behind count %d/%lu\n", 1481 bw, bitmap->mddev->bitmap_info.max_write_behind); 1482 } 1483 1484 while (sectors) { 1485 sector_t blocks; 1486 bitmap_counter_t *bmc; 1487 1488 spin_lock_irq(&bitmap->counts.lock); 1489 bmc = md_bitmap_get_counter(&bitmap->counts, offset, &blocks, 1); 1490 if (!bmc) { 1491 spin_unlock_irq(&bitmap->counts.lock); 1492 return 0; 1493 } 1494 1495 if (unlikely(COUNTER(*bmc) == COUNTER_MAX)) { 1496 DEFINE_WAIT(__wait); 1497 /* note that it is safe to do the prepare_to_wait 1498 * after the test as long as we do it before dropping 1499 * the spinlock. 1500 */ 1501 prepare_to_wait(&bitmap->overflow_wait, &__wait, 1502 TASK_UNINTERRUPTIBLE); 1503 spin_unlock_irq(&bitmap->counts.lock); 1504 schedule(); 1505 finish_wait(&bitmap->overflow_wait, &__wait); 1506 continue; 1507 } 1508 1509 switch (*bmc) { 1510 case 0: 1511 md_bitmap_file_set_bit(bitmap, offset); 1512 md_bitmap_count_page(&bitmap->counts, offset, 1); 1513 fallthrough; 1514 case 1: 1515 *bmc = 2; 1516 } 1517 1518 (*bmc)++; 1519 1520 spin_unlock_irq(&bitmap->counts.lock); 1521 1522 offset += blocks; 1523 if (sectors > blocks) 1524 sectors -= blocks; 1525 else 1526 sectors = 0; 1527 } 1528 return 0; 1529 } 1530 EXPORT_SYMBOL(md_bitmap_startwrite); 1531 1532 void md_bitmap_endwrite(struct bitmap *bitmap, sector_t offset, 1533 unsigned long sectors, int success, int behind) 1534 { 1535 if (!bitmap) 1536 return; 1537 if (behind) { 1538 if (atomic_dec_and_test(&bitmap->behind_writes)) 1539 wake_up(&bitmap->behind_wait); 1540 pr_debug("dec write-behind count %d/%lu\n", 1541 atomic_read(&bitmap->behind_writes), 1542 bitmap->mddev->bitmap_info.max_write_behind); 1543 } 1544 1545 while (sectors) { 1546 sector_t blocks; 1547 unsigned long flags; 1548 bitmap_counter_t *bmc; 1549 1550 spin_lock_irqsave(&bitmap->counts.lock, flags); 1551 bmc = md_bitmap_get_counter(&bitmap->counts, offset, &blocks, 0); 1552 if (!bmc) { 1553 spin_unlock_irqrestore(&bitmap->counts.lock, flags); 1554 return; 1555 } 1556 1557 if (success && !bitmap->mddev->degraded && 1558 bitmap->events_cleared < bitmap->mddev->events) { 1559 bitmap->events_cleared = bitmap->mddev->events; 1560 bitmap->need_sync = 1; 1561 sysfs_notify_dirent_safe(bitmap->sysfs_can_clear); 1562 } 1563 1564 if (!success && !NEEDED(*bmc)) 1565 *bmc |= NEEDED_MASK; 1566 1567 if (COUNTER(*bmc) == COUNTER_MAX) 1568 wake_up(&bitmap->overflow_wait); 1569 1570 (*bmc)--; 1571 if (*bmc <= 2) { 1572 md_bitmap_set_pending(&bitmap->counts, offset); 1573 bitmap->allclean = 0; 1574 } 1575 spin_unlock_irqrestore(&bitmap->counts.lock, flags); 1576 offset += blocks; 1577 if (sectors > blocks) 1578 sectors -= blocks; 1579 else 1580 sectors = 0; 1581 } 1582 } 1583 EXPORT_SYMBOL(md_bitmap_endwrite); 1584 1585 static int __bitmap_start_sync(struct bitmap *bitmap, sector_t offset, sector_t *blocks, 1586 int degraded) 1587 { 1588 bitmap_counter_t *bmc; 1589 int rv; 1590 if (bitmap == NULL) {/* FIXME or bitmap set as 'failed' */ 1591 *blocks = 1024; 1592 return 1; /* always resync if no bitmap */ 1593 } 1594 spin_lock_irq(&bitmap->counts.lock); 1595 bmc = md_bitmap_get_counter(&bitmap->counts, offset, blocks, 0); 1596 rv = 0; 1597 if (bmc) { 1598 /* locked */ 1599 if (RESYNC(*bmc)) 1600 rv = 1; 1601 else if (NEEDED(*bmc)) { 1602 rv = 1; 1603 if (!degraded) { /* don't set/clear bits if degraded */ 1604 *bmc |= RESYNC_MASK; 1605 *bmc &= ~NEEDED_MASK; 1606 } 1607 } 1608 } 1609 spin_unlock_irq(&bitmap->counts.lock); 1610 return rv; 1611 } 1612 1613 int md_bitmap_start_sync(struct bitmap *bitmap, sector_t offset, sector_t *blocks, 1614 int degraded) 1615 { 1616 /* bitmap_start_sync must always report on multiples of whole 1617 * pages, otherwise resync (which is very PAGE_SIZE based) will 1618 * get confused. 1619 * So call __bitmap_start_sync repeatedly (if needed) until 1620 * At least PAGE_SIZE>>9 blocks are covered. 1621 * Return the 'or' of the result. 1622 */ 1623 int rv = 0; 1624 sector_t blocks1; 1625 1626 *blocks = 0; 1627 while (*blocks < (PAGE_SIZE>>9)) { 1628 rv |= __bitmap_start_sync(bitmap, offset, 1629 &blocks1, degraded); 1630 offset += blocks1; 1631 *blocks += blocks1; 1632 } 1633 return rv; 1634 } 1635 EXPORT_SYMBOL(md_bitmap_start_sync); 1636 1637 void md_bitmap_end_sync(struct bitmap *bitmap, sector_t offset, sector_t *blocks, int aborted) 1638 { 1639 bitmap_counter_t *bmc; 1640 unsigned long flags; 1641 1642 if (bitmap == NULL) { 1643 *blocks = 1024; 1644 return; 1645 } 1646 spin_lock_irqsave(&bitmap->counts.lock, flags); 1647 bmc = md_bitmap_get_counter(&bitmap->counts, offset, blocks, 0); 1648 if (bmc == NULL) 1649 goto unlock; 1650 /* locked */ 1651 if (RESYNC(*bmc)) { 1652 *bmc &= ~RESYNC_MASK; 1653 1654 if (!NEEDED(*bmc) && aborted) 1655 *bmc |= NEEDED_MASK; 1656 else { 1657 if (*bmc <= 2) { 1658 md_bitmap_set_pending(&bitmap->counts, offset); 1659 bitmap->allclean = 0; 1660 } 1661 } 1662 } 1663 unlock: 1664 spin_unlock_irqrestore(&bitmap->counts.lock, flags); 1665 } 1666 EXPORT_SYMBOL(md_bitmap_end_sync); 1667 1668 void md_bitmap_close_sync(struct bitmap *bitmap) 1669 { 1670 /* Sync has finished, and any bitmap chunks that weren't synced 1671 * properly have been aborted. It remains to us to clear the 1672 * RESYNC bit wherever it is still on 1673 */ 1674 sector_t sector = 0; 1675 sector_t blocks; 1676 if (!bitmap) 1677 return; 1678 while (sector < bitmap->mddev->resync_max_sectors) { 1679 md_bitmap_end_sync(bitmap, sector, &blocks, 0); 1680 sector += blocks; 1681 } 1682 } 1683 EXPORT_SYMBOL(md_bitmap_close_sync); 1684 1685 void md_bitmap_cond_end_sync(struct bitmap *bitmap, sector_t sector, bool force) 1686 { 1687 sector_t s = 0; 1688 sector_t blocks; 1689 1690 if (!bitmap) 1691 return; 1692 if (sector == 0) { 1693 bitmap->last_end_sync = jiffies; 1694 return; 1695 } 1696 if (!force && time_before(jiffies, (bitmap->last_end_sync 1697 + bitmap->mddev->bitmap_info.daemon_sleep))) 1698 return; 1699 wait_event(bitmap->mddev->recovery_wait, 1700 atomic_read(&bitmap->mddev->recovery_active) == 0); 1701 1702 bitmap->mddev->curr_resync_completed = sector; 1703 set_bit(MD_SB_CHANGE_CLEAN, &bitmap->mddev->sb_flags); 1704 sector &= ~((1ULL << bitmap->counts.chunkshift) - 1); 1705 s = 0; 1706 while (s < sector && s < bitmap->mddev->resync_max_sectors) { 1707 md_bitmap_end_sync(bitmap, s, &blocks, 0); 1708 s += blocks; 1709 } 1710 bitmap->last_end_sync = jiffies; 1711 sysfs_notify_dirent_safe(bitmap->mddev->sysfs_completed); 1712 } 1713 EXPORT_SYMBOL(md_bitmap_cond_end_sync); 1714 1715 void md_bitmap_sync_with_cluster(struct mddev *mddev, 1716 sector_t old_lo, sector_t old_hi, 1717 sector_t new_lo, sector_t new_hi) 1718 { 1719 struct bitmap *bitmap = mddev->bitmap; 1720 sector_t sector, blocks = 0; 1721 1722 for (sector = old_lo; sector < new_lo; ) { 1723 md_bitmap_end_sync(bitmap, sector, &blocks, 0); 1724 sector += blocks; 1725 } 1726 WARN((blocks > new_lo) && old_lo, "alignment is not correct for lo\n"); 1727 1728 for (sector = old_hi; sector < new_hi; ) { 1729 md_bitmap_start_sync(bitmap, sector, &blocks, 0); 1730 sector += blocks; 1731 } 1732 WARN((blocks > new_hi) && old_hi, "alignment is not correct for hi\n"); 1733 } 1734 EXPORT_SYMBOL(md_bitmap_sync_with_cluster); 1735 1736 static void md_bitmap_set_memory_bits(struct bitmap *bitmap, sector_t offset, int needed) 1737 { 1738 /* For each chunk covered by any of these sectors, set the 1739 * counter to 2 and possibly set resync_needed. They should all 1740 * be 0 at this point 1741 */ 1742 1743 sector_t secs; 1744 bitmap_counter_t *bmc; 1745 spin_lock_irq(&bitmap->counts.lock); 1746 bmc = md_bitmap_get_counter(&bitmap->counts, offset, &secs, 1); 1747 if (!bmc) { 1748 spin_unlock_irq(&bitmap->counts.lock); 1749 return; 1750 } 1751 if (!*bmc) { 1752 *bmc = 2; 1753 md_bitmap_count_page(&bitmap->counts, offset, 1); 1754 md_bitmap_set_pending(&bitmap->counts, offset); 1755 bitmap->allclean = 0; 1756 } 1757 if (needed) 1758 *bmc |= NEEDED_MASK; 1759 spin_unlock_irq(&bitmap->counts.lock); 1760 } 1761 1762 /* dirty the memory and file bits for bitmap chunks "s" to "e" */ 1763 void md_bitmap_dirty_bits(struct bitmap *bitmap, unsigned long s, unsigned long e) 1764 { 1765 unsigned long chunk; 1766 1767 for (chunk = s; chunk <= e; chunk++) { 1768 sector_t sec = (sector_t)chunk << bitmap->counts.chunkshift; 1769 md_bitmap_set_memory_bits(bitmap, sec, 1); 1770 md_bitmap_file_set_bit(bitmap, sec); 1771 if (sec < bitmap->mddev->recovery_cp) 1772 /* We are asserting that the array is dirty, 1773 * so move the recovery_cp address back so 1774 * that it is obvious that it is dirty 1775 */ 1776 bitmap->mddev->recovery_cp = sec; 1777 } 1778 } 1779 1780 /* 1781 * flush out any pending updates 1782 */ 1783 void md_bitmap_flush(struct mddev *mddev) 1784 { 1785 struct bitmap *bitmap = mddev->bitmap; 1786 long sleep; 1787 1788 if (!bitmap) /* there was no bitmap */ 1789 return; 1790 1791 /* run the daemon_work three time to ensure everything is flushed 1792 * that can be 1793 */ 1794 sleep = mddev->bitmap_info.daemon_sleep * 2; 1795 bitmap->daemon_lastrun -= sleep; 1796 md_bitmap_daemon_work(mddev); 1797 bitmap->daemon_lastrun -= sleep; 1798 md_bitmap_daemon_work(mddev); 1799 bitmap->daemon_lastrun -= sleep; 1800 md_bitmap_daemon_work(mddev); 1801 if (mddev->bitmap_info.external) 1802 md_super_wait(mddev); 1803 md_bitmap_update_sb(bitmap); 1804 } 1805 1806 /* 1807 * free memory that was allocated 1808 */ 1809 void md_bitmap_free(struct bitmap *bitmap) 1810 { 1811 unsigned long k, pages; 1812 struct bitmap_page *bp; 1813 1814 if (!bitmap) /* there was no bitmap */ 1815 return; 1816 1817 if (bitmap->sysfs_can_clear) 1818 sysfs_put(bitmap->sysfs_can_clear); 1819 1820 if (mddev_is_clustered(bitmap->mddev) && bitmap->mddev->cluster_info && 1821 bitmap->cluster_slot == md_cluster_ops->slot_number(bitmap->mddev)) 1822 md_cluster_stop(bitmap->mddev); 1823 1824 /* Shouldn't be needed - but just in case.... */ 1825 wait_event(bitmap->write_wait, 1826 atomic_read(&bitmap->pending_writes) == 0); 1827 1828 /* release the bitmap file */ 1829 md_bitmap_file_unmap(&bitmap->storage); 1830 1831 bp = bitmap->counts.bp; 1832 pages = bitmap->counts.pages; 1833 1834 /* free all allocated memory */ 1835 1836 if (bp) /* deallocate the page memory */ 1837 for (k = 0; k < pages; k++) 1838 if (bp[k].map && !bp[k].hijacked) 1839 kfree(bp[k].map); 1840 kfree(bp); 1841 kfree(bitmap); 1842 } 1843 EXPORT_SYMBOL(md_bitmap_free); 1844 1845 void md_bitmap_wait_behind_writes(struct mddev *mddev) 1846 { 1847 struct bitmap *bitmap = mddev->bitmap; 1848 1849 /* wait for behind writes to complete */ 1850 if (bitmap && atomic_read(&bitmap->behind_writes) > 0) { 1851 pr_debug("md:%s: behind writes in progress - waiting to stop.\n", 1852 mdname(mddev)); 1853 /* need to kick something here to make sure I/O goes? */ 1854 wait_event(bitmap->behind_wait, 1855 atomic_read(&bitmap->behind_writes) == 0); 1856 } 1857 } 1858 1859 void md_bitmap_destroy(struct mddev *mddev) 1860 { 1861 struct bitmap *bitmap = mddev->bitmap; 1862 1863 if (!bitmap) /* there was no bitmap */ 1864 return; 1865 1866 md_bitmap_wait_behind_writes(mddev); 1867 if (!mddev->serialize_policy) 1868 mddev_destroy_serial_pool(mddev, NULL, true); 1869 1870 mutex_lock(&mddev->bitmap_info.mutex); 1871 spin_lock(&mddev->lock); 1872 mddev->bitmap = NULL; /* disconnect from the md device */ 1873 spin_unlock(&mddev->lock); 1874 mutex_unlock(&mddev->bitmap_info.mutex); 1875 mddev_set_timeout(mddev, MAX_SCHEDULE_TIMEOUT, true); 1876 1877 md_bitmap_free(bitmap); 1878 } 1879 1880 /* 1881 * initialize the bitmap structure 1882 * if this returns an error, bitmap_destroy must be called to do clean up 1883 * once mddev->bitmap is set 1884 */ 1885 struct bitmap *md_bitmap_create(struct mddev *mddev, int slot) 1886 { 1887 struct bitmap *bitmap; 1888 sector_t blocks = mddev->resync_max_sectors; 1889 struct file *file = mddev->bitmap_info.file; 1890 int err; 1891 struct kernfs_node *bm = NULL; 1892 1893 BUILD_BUG_ON(sizeof(bitmap_super_t) != 256); 1894 1895 BUG_ON(file && mddev->bitmap_info.offset); 1896 1897 if (test_bit(MD_HAS_JOURNAL, &mddev->flags)) { 1898 pr_notice("md/raid:%s: array with journal cannot have bitmap\n", 1899 mdname(mddev)); 1900 return ERR_PTR(-EBUSY); 1901 } 1902 1903 bitmap = kzalloc(sizeof(*bitmap), GFP_KERNEL); 1904 if (!bitmap) 1905 return ERR_PTR(-ENOMEM); 1906 1907 spin_lock_init(&bitmap->counts.lock); 1908 atomic_set(&bitmap->pending_writes, 0); 1909 init_waitqueue_head(&bitmap->write_wait); 1910 init_waitqueue_head(&bitmap->overflow_wait); 1911 init_waitqueue_head(&bitmap->behind_wait); 1912 1913 bitmap->mddev = mddev; 1914 bitmap->cluster_slot = slot; 1915 1916 if (mddev->kobj.sd) 1917 bm = sysfs_get_dirent(mddev->kobj.sd, "bitmap"); 1918 if (bm) { 1919 bitmap->sysfs_can_clear = sysfs_get_dirent(bm, "can_clear"); 1920 sysfs_put(bm); 1921 } else 1922 bitmap->sysfs_can_clear = NULL; 1923 1924 bitmap->storage.file = file; 1925 if (file) { 1926 get_file(file); 1927 /* As future accesses to this file will use bmap, 1928 * and bypass the page cache, we must sync the file 1929 * first. 1930 */ 1931 vfs_fsync(file, 1); 1932 } 1933 /* read superblock from bitmap file (this sets mddev->bitmap_info.chunksize) */ 1934 if (!mddev->bitmap_info.external) { 1935 /* 1936 * If 'MD_ARRAY_FIRST_USE' is set, then device-mapper is 1937 * instructing us to create a new on-disk bitmap instance. 1938 */ 1939 if (test_and_clear_bit(MD_ARRAY_FIRST_USE, &mddev->flags)) 1940 err = md_bitmap_new_disk_sb(bitmap); 1941 else 1942 err = md_bitmap_read_sb(bitmap); 1943 } else { 1944 err = 0; 1945 if (mddev->bitmap_info.chunksize == 0 || 1946 mddev->bitmap_info.daemon_sleep == 0) 1947 /* chunksize and time_base need to be 1948 * set first. */ 1949 err = -EINVAL; 1950 } 1951 if (err) 1952 goto error; 1953 1954 bitmap->daemon_lastrun = jiffies; 1955 err = md_bitmap_resize(bitmap, blocks, mddev->bitmap_info.chunksize, 1); 1956 if (err) 1957 goto error; 1958 1959 pr_debug("created bitmap (%lu pages) for device %s\n", 1960 bitmap->counts.pages, bmname(bitmap)); 1961 1962 err = test_bit(BITMAP_WRITE_ERROR, &bitmap->flags) ? -EIO : 0; 1963 if (err) 1964 goto error; 1965 1966 return bitmap; 1967 error: 1968 md_bitmap_free(bitmap); 1969 return ERR_PTR(err); 1970 } 1971 1972 int md_bitmap_load(struct mddev *mddev) 1973 { 1974 int err = 0; 1975 sector_t start = 0; 1976 sector_t sector = 0; 1977 struct bitmap *bitmap = mddev->bitmap; 1978 struct md_rdev *rdev; 1979 1980 if (!bitmap) 1981 goto out; 1982 1983 rdev_for_each(rdev, mddev) 1984 mddev_create_serial_pool(mddev, rdev, true); 1985 1986 if (mddev_is_clustered(mddev)) 1987 md_cluster_ops->load_bitmaps(mddev, mddev->bitmap_info.nodes); 1988 1989 /* Clear out old bitmap info first: Either there is none, or we 1990 * are resuming after someone else has possibly changed things, 1991 * so we should forget old cached info. 1992 * All chunks should be clean, but some might need_sync. 1993 */ 1994 while (sector < mddev->resync_max_sectors) { 1995 sector_t blocks; 1996 md_bitmap_start_sync(bitmap, sector, &blocks, 0); 1997 sector += blocks; 1998 } 1999 md_bitmap_close_sync(bitmap); 2000 2001 if (mddev->degraded == 0 2002 || bitmap->events_cleared == mddev->events) 2003 /* no need to keep dirty bits to optimise a 2004 * re-add of a missing device */ 2005 start = mddev->recovery_cp; 2006 2007 mutex_lock(&mddev->bitmap_info.mutex); 2008 err = md_bitmap_init_from_disk(bitmap, start); 2009 mutex_unlock(&mddev->bitmap_info.mutex); 2010 2011 if (err) 2012 goto out; 2013 clear_bit(BITMAP_STALE, &bitmap->flags); 2014 2015 /* Kick recovery in case any bits were set */ 2016 set_bit(MD_RECOVERY_NEEDED, &bitmap->mddev->recovery); 2017 2018 mddev_set_timeout(mddev, mddev->bitmap_info.daemon_sleep, true); 2019 md_wakeup_thread(mddev->thread); 2020 2021 md_bitmap_update_sb(bitmap); 2022 2023 if (test_bit(BITMAP_WRITE_ERROR, &bitmap->flags)) 2024 err = -EIO; 2025 out: 2026 return err; 2027 } 2028 EXPORT_SYMBOL_GPL(md_bitmap_load); 2029 2030 /* caller need to free returned bitmap with md_bitmap_free() */ 2031 struct bitmap *get_bitmap_from_slot(struct mddev *mddev, int slot) 2032 { 2033 int rv = 0; 2034 struct bitmap *bitmap; 2035 2036 bitmap = md_bitmap_create(mddev, slot); 2037 if (IS_ERR(bitmap)) { 2038 rv = PTR_ERR(bitmap); 2039 return ERR_PTR(rv); 2040 } 2041 2042 rv = md_bitmap_init_from_disk(bitmap, 0); 2043 if (rv) { 2044 md_bitmap_free(bitmap); 2045 return ERR_PTR(rv); 2046 } 2047 2048 return bitmap; 2049 } 2050 EXPORT_SYMBOL(get_bitmap_from_slot); 2051 2052 /* Loads the bitmap associated with slot and copies the resync information 2053 * to our bitmap 2054 */ 2055 int md_bitmap_copy_from_slot(struct mddev *mddev, int slot, 2056 sector_t *low, sector_t *high, bool clear_bits) 2057 { 2058 int rv = 0, i, j; 2059 sector_t block, lo = 0, hi = 0; 2060 struct bitmap_counts *counts; 2061 struct bitmap *bitmap; 2062 2063 bitmap = get_bitmap_from_slot(mddev, slot); 2064 if (IS_ERR(bitmap)) { 2065 pr_err("%s can't get bitmap from slot %d\n", __func__, slot); 2066 return -1; 2067 } 2068 2069 counts = &bitmap->counts; 2070 for (j = 0; j < counts->chunks; j++) { 2071 block = (sector_t)j << counts->chunkshift; 2072 if (md_bitmap_file_test_bit(bitmap, block)) { 2073 if (!lo) 2074 lo = block; 2075 hi = block; 2076 md_bitmap_file_clear_bit(bitmap, block); 2077 md_bitmap_set_memory_bits(mddev->bitmap, block, 1); 2078 md_bitmap_file_set_bit(mddev->bitmap, block); 2079 } 2080 } 2081 2082 if (clear_bits) { 2083 md_bitmap_update_sb(bitmap); 2084 /* BITMAP_PAGE_PENDING is set, but bitmap_unplug needs 2085 * BITMAP_PAGE_DIRTY or _NEEDWRITE to write ... */ 2086 for (i = 0; i < bitmap->storage.file_pages; i++) 2087 if (test_page_attr(bitmap, i, BITMAP_PAGE_PENDING)) 2088 set_page_attr(bitmap, i, BITMAP_PAGE_NEEDWRITE); 2089 md_bitmap_unplug(bitmap); 2090 } 2091 md_bitmap_unplug(mddev->bitmap); 2092 *low = lo; 2093 *high = hi; 2094 md_bitmap_free(bitmap); 2095 2096 return rv; 2097 } 2098 EXPORT_SYMBOL_GPL(md_bitmap_copy_from_slot); 2099 2100 2101 void md_bitmap_status(struct seq_file *seq, struct bitmap *bitmap) 2102 { 2103 unsigned long chunk_kb; 2104 struct bitmap_counts *counts; 2105 2106 if (!bitmap) 2107 return; 2108 2109 counts = &bitmap->counts; 2110 2111 chunk_kb = bitmap->mddev->bitmap_info.chunksize >> 10; 2112 seq_printf(seq, "bitmap: %lu/%lu pages [%luKB], " 2113 "%lu%s chunk", 2114 counts->pages - counts->missing_pages, 2115 counts->pages, 2116 (counts->pages - counts->missing_pages) 2117 << (PAGE_SHIFT - 10), 2118 chunk_kb ? chunk_kb : bitmap->mddev->bitmap_info.chunksize, 2119 chunk_kb ? "KB" : "B"); 2120 if (bitmap->storage.file) { 2121 seq_printf(seq, ", file: "); 2122 seq_file_path(seq, bitmap->storage.file, " \t\n"); 2123 } 2124 2125 seq_printf(seq, "\n"); 2126 } 2127 2128 int md_bitmap_resize(struct bitmap *bitmap, sector_t blocks, 2129 int chunksize, int init) 2130 { 2131 /* If chunk_size is 0, choose an appropriate chunk size. 2132 * Then possibly allocate new storage space. 2133 * Then quiesce, copy bits, replace bitmap, and re-start 2134 * 2135 * This function is called both to set up the initial bitmap 2136 * and to resize the bitmap while the array is active. 2137 * If this happens as a result of the array being resized, 2138 * chunksize will be zero, and we need to choose a suitable 2139 * chunksize, otherwise we use what we are given. 2140 */ 2141 struct bitmap_storage store; 2142 struct bitmap_counts old_counts; 2143 unsigned long chunks; 2144 sector_t block; 2145 sector_t old_blocks, new_blocks; 2146 int chunkshift; 2147 int ret = 0; 2148 long pages; 2149 struct bitmap_page *new_bp; 2150 2151 if (bitmap->storage.file && !init) { 2152 pr_info("md: cannot resize file-based bitmap\n"); 2153 return -EINVAL; 2154 } 2155 2156 if (chunksize == 0) { 2157 /* If there is enough space, leave the chunk size unchanged, 2158 * else increase by factor of two until there is enough space. 2159 */ 2160 long bytes; 2161 long space = bitmap->mddev->bitmap_info.space; 2162 2163 if (space == 0) { 2164 /* We don't know how much space there is, so limit 2165 * to current size - in sectors. 2166 */ 2167 bytes = DIV_ROUND_UP(bitmap->counts.chunks, 8); 2168 if (!bitmap->mddev->bitmap_info.external) 2169 bytes += sizeof(bitmap_super_t); 2170 space = DIV_ROUND_UP(bytes, 512); 2171 bitmap->mddev->bitmap_info.space = space; 2172 } 2173 chunkshift = bitmap->counts.chunkshift; 2174 chunkshift--; 2175 do { 2176 /* 'chunkshift' is shift from block size to chunk size */ 2177 chunkshift++; 2178 chunks = DIV_ROUND_UP_SECTOR_T(blocks, 1 << chunkshift); 2179 bytes = DIV_ROUND_UP(chunks, 8); 2180 if (!bitmap->mddev->bitmap_info.external) 2181 bytes += sizeof(bitmap_super_t); 2182 } while (bytes > (space << 9) && (chunkshift + BITMAP_BLOCK_SHIFT) < 2183 (BITS_PER_BYTE * sizeof(((bitmap_super_t *)0)->chunksize) - 1)); 2184 } else 2185 chunkshift = ffz(~chunksize) - BITMAP_BLOCK_SHIFT; 2186 2187 chunks = DIV_ROUND_UP_SECTOR_T(blocks, 1 << chunkshift); 2188 memset(&store, 0, sizeof(store)); 2189 if (bitmap->mddev->bitmap_info.offset || bitmap->mddev->bitmap_info.file) 2190 ret = md_bitmap_storage_alloc(&store, chunks, 2191 !bitmap->mddev->bitmap_info.external, 2192 mddev_is_clustered(bitmap->mddev) 2193 ? bitmap->cluster_slot : 0); 2194 if (ret) { 2195 md_bitmap_file_unmap(&store); 2196 goto err; 2197 } 2198 2199 pages = DIV_ROUND_UP(chunks, PAGE_COUNTER_RATIO); 2200 2201 new_bp = kcalloc(pages, sizeof(*new_bp), GFP_KERNEL); 2202 ret = -ENOMEM; 2203 if (!new_bp) { 2204 md_bitmap_file_unmap(&store); 2205 goto err; 2206 } 2207 2208 if (!init) 2209 bitmap->mddev->pers->quiesce(bitmap->mddev, 1); 2210 2211 store.file = bitmap->storage.file; 2212 bitmap->storage.file = NULL; 2213 2214 if (store.sb_page && bitmap->storage.sb_page) 2215 memcpy(page_address(store.sb_page), 2216 page_address(bitmap->storage.sb_page), 2217 sizeof(bitmap_super_t)); 2218 spin_lock_irq(&bitmap->counts.lock); 2219 md_bitmap_file_unmap(&bitmap->storage); 2220 bitmap->storage = store; 2221 2222 old_counts = bitmap->counts; 2223 bitmap->counts.bp = new_bp; 2224 bitmap->counts.pages = pages; 2225 bitmap->counts.missing_pages = pages; 2226 bitmap->counts.chunkshift = chunkshift; 2227 bitmap->counts.chunks = chunks; 2228 bitmap->mddev->bitmap_info.chunksize = 1UL << (chunkshift + 2229 BITMAP_BLOCK_SHIFT); 2230 2231 blocks = min(old_counts.chunks << old_counts.chunkshift, 2232 chunks << chunkshift); 2233 2234 /* For cluster raid, need to pre-allocate bitmap */ 2235 if (mddev_is_clustered(bitmap->mddev)) { 2236 unsigned long page; 2237 for (page = 0; page < pages; page++) { 2238 ret = md_bitmap_checkpage(&bitmap->counts, page, 1, 1); 2239 if (ret) { 2240 unsigned long k; 2241 2242 /* deallocate the page memory */ 2243 for (k = 0; k < page; k++) { 2244 kfree(new_bp[k].map); 2245 } 2246 kfree(new_bp); 2247 2248 /* restore some fields from old_counts */ 2249 bitmap->counts.bp = old_counts.bp; 2250 bitmap->counts.pages = old_counts.pages; 2251 bitmap->counts.missing_pages = old_counts.pages; 2252 bitmap->counts.chunkshift = old_counts.chunkshift; 2253 bitmap->counts.chunks = old_counts.chunks; 2254 bitmap->mddev->bitmap_info.chunksize = 2255 1UL << (old_counts.chunkshift + BITMAP_BLOCK_SHIFT); 2256 blocks = old_counts.chunks << old_counts.chunkshift; 2257 pr_warn("Could not pre-allocate in-memory bitmap for cluster raid\n"); 2258 break; 2259 } else 2260 bitmap->counts.bp[page].count += 1; 2261 } 2262 } 2263 2264 for (block = 0; block < blocks; ) { 2265 bitmap_counter_t *bmc_old, *bmc_new; 2266 int set; 2267 2268 bmc_old = md_bitmap_get_counter(&old_counts, block, &old_blocks, 0); 2269 set = bmc_old && NEEDED(*bmc_old); 2270 2271 if (set) { 2272 bmc_new = md_bitmap_get_counter(&bitmap->counts, block, &new_blocks, 1); 2273 if (bmc_new) { 2274 if (*bmc_new == 0) { 2275 /* need to set on-disk bits too. */ 2276 sector_t end = block + new_blocks; 2277 sector_t start = block >> chunkshift; 2278 2279 start <<= chunkshift; 2280 while (start < end) { 2281 md_bitmap_file_set_bit(bitmap, block); 2282 start += 1 << chunkshift; 2283 } 2284 *bmc_new = 2; 2285 md_bitmap_count_page(&bitmap->counts, block, 1); 2286 md_bitmap_set_pending(&bitmap->counts, block); 2287 } 2288 *bmc_new |= NEEDED_MASK; 2289 } 2290 if (new_blocks < old_blocks) 2291 old_blocks = new_blocks; 2292 } 2293 block += old_blocks; 2294 } 2295 2296 if (bitmap->counts.bp != old_counts.bp) { 2297 unsigned long k; 2298 for (k = 0; k < old_counts.pages; k++) 2299 if (!old_counts.bp[k].hijacked) 2300 kfree(old_counts.bp[k].map); 2301 kfree(old_counts.bp); 2302 } 2303 2304 if (!init) { 2305 int i; 2306 while (block < (chunks << chunkshift)) { 2307 bitmap_counter_t *bmc; 2308 bmc = md_bitmap_get_counter(&bitmap->counts, block, &new_blocks, 1); 2309 if (bmc) { 2310 /* new space. It needs to be resynced, so 2311 * we set NEEDED_MASK. 2312 */ 2313 if (*bmc == 0) { 2314 *bmc = NEEDED_MASK | 2; 2315 md_bitmap_count_page(&bitmap->counts, block, 1); 2316 md_bitmap_set_pending(&bitmap->counts, block); 2317 } 2318 } 2319 block += new_blocks; 2320 } 2321 for (i = 0; i < bitmap->storage.file_pages; i++) 2322 set_page_attr(bitmap, i, BITMAP_PAGE_DIRTY); 2323 } 2324 spin_unlock_irq(&bitmap->counts.lock); 2325 2326 if (!init) { 2327 md_bitmap_unplug(bitmap); 2328 bitmap->mddev->pers->quiesce(bitmap->mddev, 0); 2329 } 2330 ret = 0; 2331 err: 2332 return ret; 2333 } 2334 EXPORT_SYMBOL_GPL(md_bitmap_resize); 2335 2336 static ssize_t 2337 location_show(struct mddev *mddev, char *page) 2338 { 2339 ssize_t len; 2340 if (mddev->bitmap_info.file) 2341 len = sprintf(page, "file"); 2342 else if (mddev->bitmap_info.offset) 2343 len = sprintf(page, "%+lld", (long long)mddev->bitmap_info.offset); 2344 else 2345 len = sprintf(page, "none"); 2346 len += sprintf(page+len, "\n"); 2347 return len; 2348 } 2349 2350 static ssize_t 2351 location_store(struct mddev *mddev, const char *buf, size_t len) 2352 { 2353 int rv; 2354 2355 rv = mddev_lock(mddev); 2356 if (rv) 2357 return rv; 2358 if (mddev->pers) { 2359 if (!mddev->pers->quiesce) { 2360 rv = -EBUSY; 2361 goto out; 2362 } 2363 if (mddev->recovery || mddev->sync_thread) { 2364 rv = -EBUSY; 2365 goto out; 2366 } 2367 } 2368 2369 if (mddev->bitmap || mddev->bitmap_info.file || 2370 mddev->bitmap_info.offset) { 2371 /* bitmap already configured. Only option is to clear it */ 2372 if (strncmp(buf, "none", 4) != 0) { 2373 rv = -EBUSY; 2374 goto out; 2375 } 2376 if (mddev->pers) { 2377 mddev_suspend(mddev); 2378 md_bitmap_destroy(mddev); 2379 mddev_resume(mddev); 2380 } 2381 mddev->bitmap_info.offset = 0; 2382 if (mddev->bitmap_info.file) { 2383 struct file *f = mddev->bitmap_info.file; 2384 mddev->bitmap_info.file = NULL; 2385 fput(f); 2386 } 2387 } else { 2388 /* No bitmap, OK to set a location */ 2389 long long offset; 2390 if (strncmp(buf, "none", 4) == 0) 2391 /* nothing to be done */; 2392 else if (strncmp(buf, "file:", 5) == 0) { 2393 /* Not supported yet */ 2394 rv = -EINVAL; 2395 goto out; 2396 } else { 2397 if (buf[0] == '+') 2398 rv = kstrtoll(buf+1, 10, &offset); 2399 else 2400 rv = kstrtoll(buf, 10, &offset); 2401 if (rv) 2402 goto out; 2403 if (offset == 0) { 2404 rv = -EINVAL; 2405 goto out; 2406 } 2407 if (mddev->bitmap_info.external == 0 && 2408 mddev->major_version == 0 && 2409 offset != mddev->bitmap_info.default_offset) { 2410 rv = -EINVAL; 2411 goto out; 2412 } 2413 mddev->bitmap_info.offset = offset; 2414 if (mddev->pers) { 2415 struct bitmap *bitmap; 2416 bitmap = md_bitmap_create(mddev, -1); 2417 mddev_suspend(mddev); 2418 if (IS_ERR(bitmap)) 2419 rv = PTR_ERR(bitmap); 2420 else { 2421 mddev->bitmap = bitmap; 2422 rv = md_bitmap_load(mddev); 2423 if (rv) 2424 mddev->bitmap_info.offset = 0; 2425 } 2426 if (rv) { 2427 md_bitmap_destroy(mddev); 2428 mddev_resume(mddev); 2429 goto out; 2430 } 2431 mddev_resume(mddev); 2432 } 2433 } 2434 } 2435 if (!mddev->external) { 2436 /* Ensure new bitmap info is stored in 2437 * metadata promptly. 2438 */ 2439 set_bit(MD_SB_CHANGE_DEVS, &mddev->sb_flags); 2440 md_wakeup_thread(mddev->thread); 2441 } 2442 rv = 0; 2443 out: 2444 mddev_unlock(mddev); 2445 if (rv) 2446 return rv; 2447 return len; 2448 } 2449 2450 static struct md_sysfs_entry bitmap_location = 2451 __ATTR(location, S_IRUGO|S_IWUSR, location_show, location_store); 2452 2453 /* 'bitmap/space' is the space available at 'location' for the 2454 * bitmap. This allows the kernel to know when it is safe to 2455 * resize the bitmap to match a resized array. 2456 */ 2457 static ssize_t 2458 space_show(struct mddev *mddev, char *page) 2459 { 2460 return sprintf(page, "%lu\n", mddev->bitmap_info.space); 2461 } 2462 2463 static ssize_t 2464 space_store(struct mddev *mddev, const char *buf, size_t len) 2465 { 2466 unsigned long sectors; 2467 int rv; 2468 2469 rv = kstrtoul(buf, 10, §ors); 2470 if (rv) 2471 return rv; 2472 2473 if (sectors == 0) 2474 return -EINVAL; 2475 2476 if (mddev->bitmap && 2477 sectors < (mddev->bitmap->storage.bytes + 511) >> 9) 2478 return -EFBIG; /* Bitmap is too big for this small space */ 2479 2480 /* could make sure it isn't too big, but that isn't really 2481 * needed - user-space should be careful. 2482 */ 2483 mddev->bitmap_info.space = sectors; 2484 return len; 2485 } 2486 2487 static struct md_sysfs_entry bitmap_space = 2488 __ATTR(space, S_IRUGO|S_IWUSR, space_show, space_store); 2489 2490 static ssize_t 2491 timeout_show(struct mddev *mddev, char *page) 2492 { 2493 ssize_t len; 2494 unsigned long secs = mddev->bitmap_info.daemon_sleep / HZ; 2495 unsigned long jifs = mddev->bitmap_info.daemon_sleep % HZ; 2496 2497 len = sprintf(page, "%lu", secs); 2498 if (jifs) 2499 len += sprintf(page+len, ".%03u", jiffies_to_msecs(jifs)); 2500 len += sprintf(page+len, "\n"); 2501 return len; 2502 } 2503 2504 static ssize_t 2505 timeout_store(struct mddev *mddev, const char *buf, size_t len) 2506 { 2507 /* timeout can be set at any time */ 2508 unsigned long timeout; 2509 int rv = strict_strtoul_scaled(buf, &timeout, 4); 2510 if (rv) 2511 return rv; 2512 2513 /* just to make sure we don't overflow... */ 2514 if (timeout >= LONG_MAX / HZ) 2515 return -EINVAL; 2516 2517 timeout = timeout * HZ / 10000; 2518 2519 if (timeout >= MAX_SCHEDULE_TIMEOUT) 2520 timeout = MAX_SCHEDULE_TIMEOUT-1; 2521 if (timeout < 1) 2522 timeout = 1; 2523 2524 mddev->bitmap_info.daemon_sleep = timeout; 2525 mddev_set_timeout(mddev, timeout, false); 2526 md_wakeup_thread(mddev->thread); 2527 2528 return len; 2529 } 2530 2531 static struct md_sysfs_entry bitmap_timeout = 2532 __ATTR(time_base, S_IRUGO|S_IWUSR, timeout_show, timeout_store); 2533 2534 static ssize_t 2535 backlog_show(struct mddev *mddev, char *page) 2536 { 2537 return sprintf(page, "%lu\n", mddev->bitmap_info.max_write_behind); 2538 } 2539 2540 static ssize_t 2541 backlog_store(struct mddev *mddev, const char *buf, size_t len) 2542 { 2543 unsigned long backlog; 2544 unsigned long old_mwb = mddev->bitmap_info.max_write_behind; 2545 struct md_rdev *rdev; 2546 bool has_write_mostly = false; 2547 int rv = kstrtoul(buf, 10, &backlog); 2548 if (rv) 2549 return rv; 2550 if (backlog > COUNTER_MAX) 2551 return -EINVAL; 2552 2553 rv = mddev_lock(mddev); 2554 if (rv) 2555 return rv; 2556 2557 /* 2558 * Without write mostly device, it doesn't make sense to set 2559 * backlog for max_write_behind. 2560 */ 2561 rdev_for_each(rdev, mddev) { 2562 if (test_bit(WriteMostly, &rdev->flags)) { 2563 has_write_mostly = true; 2564 break; 2565 } 2566 } 2567 if (!has_write_mostly) { 2568 pr_warn_ratelimited("%s: can't set backlog, no write mostly device available\n", 2569 mdname(mddev)); 2570 mddev_unlock(mddev); 2571 return -EINVAL; 2572 } 2573 2574 mddev->bitmap_info.max_write_behind = backlog; 2575 if (!backlog && mddev->serial_info_pool) { 2576 /* serial_info_pool is not needed if backlog is zero */ 2577 if (!mddev->serialize_policy) 2578 mddev_destroy_serial_pool(mddev, NULL, false); 2579 } else if (backlog && !mddev->serial_info_pool) { 2580 /* serial_info_pool is needed since backlog is not zero */ 2581 rdev_for_each(rdev, mddev) 2582 mddev_create_serial_pool(mddev, rdev, false); 2583 } 2584 if (old_mwb != backlog) 2585 md_bitmap_update_sb(mddev->bitmap); 2586 2587 mddev_unlock(mddev); 2588 return len; 2589 } 2590 2591 static struct md_sysfs_entry bitmap_backlog = 2592 __ATTR(backlog, S_IRUGO|S_IWUSR, backlog_show, backlog_store); 2593 2594 static ssize_t 2595 chunksize_show(struct mddev *mddev, char *page) 2596 { 2597 return sprintf(page, "%lu\n", mddev->bitmap_info.chunksize); 2598 } 2599 2600 static ssize_t 2601 chunksize_store(struct mddev *mddev, const char *buf, size_t len) 2602 { 2603 /* Can only be changed when no bitmap is active */ 2604 int rv; 2605 unsigned long csize; 2606 if (mddev->bitmap) 2607 return -EBUSY; 2608 rv = kstrtoul(buf, 10, &csize); 2609 if (rv) 2610 return rv; 2611 if (csize < 512 || 2612 !is_power_of_2(csize)) 2613 return -EINVAL; 2614 if (BITS_PER_LONG > 32 && csize >= (1ULL << (BITS_PER_BYTE * 2615 sizeof(((bitmap_super_t *)0)->chunksize)))) 2616 return -EOVERFLOW; 2617 mddev->bitmap_info.chunksize = csize; 2618 return len; 2619 } 2620 2621 static struct md_sysfs_entry bitmap_chunksize = 2622 __ATTR(chunksize, S_IRUGO|S_IWUSR, chunksize_show, chunksize_store); 2623 2624 static ssize_t metadata_show(struct mddev *mddev, char *page) 2625 { 2626 if (mddev_is_clustered(mddev)) 2627 return sprintf(page, "clustered\n"); 2628 return sprintf(page, "%s\n", (mddev->bitmap_info.external 2629 ? "external" : "internal")); 2630 } 2631 2632 static ssize_t metadata_store(struct mddev *mddev, const char *buf, size_t len) 2633 { 2634 if (mddev->bitmap || 2635 mddev->bitmap_info.file || 2636 mddev->bitmap_info.offset) 2637 return -EBUSY; 2638 if (strncmp(buf, "external", 8) == 0) 2639 mddev->bitmap_info.external = 1; 2640 else if ((strncmp(buf, "internal", 8) == 0) || 2641 (strncmp(buf, "clustered", 9) == 0)) 2642 mddev->bitmap_info.external = 0; 2643 else 2644 return -EINVAL; 2645 return len; 2646 } 2647 2648 static struct md_sysfs_entry bitmap_metadata = 2649 __ATTR(metadata, S_IRUGO|S_IWUSR, metadata_show, metadata_store); 2650 2651 static ssize_t can_clear_show(struct mddev *mddev, char *page) 2652 { 2653 int len; 2654 spin_lock(&mddev->lock); 2655 if (mddev->bitmap) 2656 len = sprintf(page, "%s\n", (mddev->bitmap->need_sync ? 2657 "false" : "true")); 2658 else 2659 len = sprintf(page, "\n"); 2660 spin_unlock(&mddev->lock); 2661 return len; 2662 } 2663 2664 static ssize_t can_clear_store(struct mddev *mddev, const char *buf, size_t len) 2665 { 2666 if (mddev->bitmap == NULL) 2667 return -ENOENT; 2668 if (strncmp(buf, "false", 5) == 0) 2669 mddev->bitmap->need_sync = 1; 2670 else if (strncmp(buf, "true", 4) == 0) { 2671 if (mddev->degraded) 2672 return -EBUSY; 2673 mddev->bitmap->need_sync = 0; 2674 } else 2675 return -EINVAL; 2676 return len; 2677 } 2678 2679 static struct md_sysfs_entry bitmap_can_clear = 2680 __ATTR(can_clear, S_IRUGO|S_IWUSR, can_clear_show, can_clear_store); 2681 2682 static ssize_t 2683 behind_writes_used_show(struct mddev *mddev, char *page) 2684 { 2685 ssize_t ret; 2686 spin_lock(&mddev->lock); 2687 if (mddev->bitmap == NULL) 2688 ret = sprintf(page, "0\n"); 2689 else 2690 ret = sprintf(page, "%lu\n", 2691 mddev->bitmap->behind_writes_used); 2692 spin_unlock(&mddev->lock); 2693 return ret; 2694 } 2695 2696 static ssize_t 2697 behind_writes_used_reset(struct mddev *mddev, const char *buf, size_t len) 2698 { 2699 if (mddev->bitmap) 2700 mddev->bitmap->behind_writes_used = 0; 2701 return len; 2702 } 2703 2704 static struct md_sysfs_entry max_backlog_used = 2705 __ATTR(max_backlog_used, S_IRUGO | S_IWUSR, 2706 behind_writes_used_show, behind_writes_used_reset); 2707 2708 static struct attribute *md_bitmap_attrs[] = { 2709 &bitmap_location.attr, 2710 &bitmap_space.attr, 2711 &bitmap_timeout.attr, 2712 &bitmap_backlog.attr, 2713 &bitmap_chunksize.attr, 2714 &bitmap_metadata.attr, 2715 &bitmap_can_clear.attr, 2716 &max_backlog_used.attr, 2717 NULL 2718 }; 2719 const struct attribute_group md_bitmap_group = { 2720 .name = "bitmap", 2721 .attrs = md_bitmap_attrs, 2722 }; 2723