1 // SPDX-License-Identifier: GPL-2.0 2 /* 3 * Memory Migration functionality - linux/mm/migrate.c 4 * 5 * Copyright (C) 2006 Silicon Graphics, Inc., Christoph Lameter 6 * 7 * Page migration was first developed in the context of the memory hotplug 8 * project. The main authors of the migration code are: 9 * 10 * IWAMOTO Toshihiro <iwamoto@valinux.co.jp> 11 * Hirokazu Takahashi <taka@valinux.co.jp> 12 * Dave Hansen <haveblue@us.ibm.com> 13 * Christoph Lameter 14 */ 15 16 #include <linux/migrate.h> 17 #include <linux/export.h> 18 #include <linux/swap.h> 19 #include <linux/swapops.h> 20 #include <linux/pagemap.h> 21 #include <linux/buffer_head.h> 22 #include <linux/mm_inline.h> 23 #include <linux/nsproxy.h> 24 #include <linux/pagevec.h> 25 #include <linux/ksm.h> 26 #include <linux/rmap.h> 27 #include <linux/topology.h> 28 #include <linux/cpu.h> 29 #include <linux/cpuset.h> 30 #include <linux/writeback.h> 31 #include <linux/mempolicy.h> 32 #include <linux/vmalloc.h> 33 #include <linux/security.h> 34 #include <linux/backing-dev.h> 35 #include <linux/compaction.h> 36 #include <linux/syscalls.h> 37 #include <linux/compat.h> 38 #include <linux/hugetlb.h> 39 #include <linux/hugetlb_cgroup.h> 40 #include <linux/gfp.h> 41 #include <linux/pagewalk.h> 42 #include <linux/pfn_t.h> 43 #include <linux/memremap.h> 44 #include <linux/userfaultfd_k.h> 45 #include <linux/balloon_compaction.h> 46 #include <linux/mmu_notifier.h> 47 #include <linux/page_idle.h> 48 #include <linux/page_owner.h> 49 #include <linux/sched/mm.h> 50 #include <linux/ptrace.h> 51 #include <linux/oom.h> 52 #include <linux/memory.h> 53 #include <linux/random.h> 54 55 #include <asm/tlbflush.h> 56 57 #define CREATE_TRACE_POINTS 58 #include <trace/events/migrate.h> 59 60 #include "internal.h" 61 62 int isolate_movable_page(struct page *page, isolate_mode_t mode) 63 { 64 struct address_space *mapping; 65 66 /* 67 * Avoid burning cycles with pages that are yet under __free_pages(), 68 * or just got freed under us. 69 * 70 * In case we 'win' a race for a movable page being freed under us and 71 * raise its refcount preventing __free_pages() from doing its job 72 * the put_page() at the end of this block will take care of 73 * release this page, thus avoiding a nasty leakage. 74 */ 75 if (unlikely(!get_page_unless_zero(page))) 76 goto out; 77 78 /* 79 * Check PageMovable before holding a PG_lock because page's owner 80 * assumes anybody doesn't touch PG_lock of newly allocated page 81 * so unconditionally grabbing the lock ruins page's owner side. 82 */ 83 if (unlikely(!__PageMovable(page))) 84 goto out_putpage; 85 /* 86 * As movable pages are not isolated from LRU lists, concurrent 87 * compaction threads can race against page migration functions 88 * as well as race against the releasing a page. 89 * 90 * In order to avoid having an already isolated movable page 91 * being (wrongly) re-isolated while it is under migration, 92 * or to avoid attempting to isolate pages being released, 93 * lets be sure we have the page lock 94 * before proceeding with the movable page isolation steps. 95 */ 96 if (unlikely(!trylock_page(page))) 97 goto out_putpage; 98 99 if (!PageMovable(page) || PageIsolated(page)) 100 goto out_no_isolated; 101 102 mapping = page_mapping(page); 103 VM_BUG_ON_PAGE(!mapping, page); 104 105 if (!mapping->a_ops->isolate_page(page, mode)) 106 goto out_no_isolated; 107 108 /* Driver shouldn't use PG_isolated bit of page->flags */ 109 WARN_ON_ONCE(PageIsolated(page)); 110 __SetPageIsolated(page); 111 unlock_page(page); 112 113 return 0; 114 115 out_no_isolated: 116 unlock_page(page); 117 out_putpage: 118 put_page(page); 119 out: 120 return -EBUSY; 121 } 122 123 static void putback_movable_page(struct page *page) 124 { 125 struct address_space *mapping; 126 127 mapping = page_mapping(page); 128 mapping->a_ops->putback_page(page); 129 __ClearPageIsolated(page); 130 } 131 132 /* 133 * Put previously isolated pages back onto the appropriate lists 134 * from where they were once taken off for compaction/migration. 135 * 136 * This function shall be used whenever the isolated pageset has been 137 * built from lru, balloon, hugetlbfs page. See isolate_migratepages_range() 138 * and isolate_huge_page(). 139 */ 140 void putback_movable_pages(struct list_head *l) 141 { 142 struct page *page; 143 struct page *page2; 144 145 list_for_each_entry_safe(page, page2, l, lru) { 146 if (unlikely(PageHuge(page))) { 147 putback_active_hugepage(page); 148 continue; 149 } 150 list_del(&page->lru); 151 /* 152 * We isolated non-lru movable page so here we can use 153 * __PageMovable because LRU page's mapping cannot have 154 * PAGE_MAPPING_MOVABLE. 155 */ 156 if (unlikely(__PageMovable(page))) { 157 VM_BUG_ON_PAGE(!PageIsolated(page), page); 158 lock_page(page); 159 if (PageMovable(page)) 160 putback_movable_page(page); 161 else 162 __ClearPageIsolated(page); 163 unlock_page(page); 164 put_page(page); 165 } else { 166 mod_node_page_state(page_pgdat(page), NR_ISOLATED_ANON + 167 page_is_file_lru(page), -thp_nr_pages(page)); 168 putback_lru_page(page); 169 } 170 } 171 } 172 173 /* 174 * Restore a potential migration pte to a working pte entry 175 */ 176 static bool remove_migration_pte(struct page *page, struct vm_area_struct *vma, 177 unsigned long addr, void *old) 178 { 179 struct page_vma_mapped_walk pvmw = { 180 .page = old, 181 .vma = vma, 182 .address = addr, 183 .flags = PVMW_SYNC | PVMW_MIGRATION, 184 }; 185 struct page *new; 186 pte_t pte; 187 swp_entry_t entry; 188 189 VM_BUG_ON_PAGE(PageTail(page), page); 190 while (page_vma_mapped_walk(&pvmw)) { 191 if (PageKsm(page)) 192 new = page; 193 else 194 new = page - pvmw.page->index + 195 linear_page_index(vma, pvmw.address); 196 197 #ifdef CONFIG_ARCH_ENABLE_THP_MIGRATION 198 /* PMD-mapped THP migration entry */ 199 if (!pvmw.pte) { 200 VM_BUG_ON_PAGE(PageHuge(page) || !PageTransCompound(page), page); 201 remove_migration_pmd(&pvmw, new); 202 continue; 203 } 204 #endif 205 206 get_page(new); 207 pte = pte_mkold(mk_pte(new, READ_ONCE(vma->vm_page_prot))); 208 if (pte_swp_soft_dirty(*pvmw.pte)) 209 pte = pte_mksoft_dirty(pte); 210 211 /* 212 * Recheck VMA as permissions can change since migration started 213 */ 214 entry = pte_to_swp_entry(*pvmw.pte); 215 if (is_writable_migration_entry(entry)) 216 pte = maybe_mkwrite(pte, vma); 217 else if (pte_swp_uffd_wp(*pvmw.pte)) 218 pte = pte_mkuffd_wp(pte); 219 220 if (unlikely(is_device_private_page(new))) { 221 if (pte_write(pte)) 222 entry = make_writable_device_private_entry( 223 page_to_pfn(new)); 224 else 225 entry = make_readable_device_private_entry( 226 page_to_pfn(new)); 227 pte = swp_entry_to_pte(entry); 228 if (pte_swp_soft_dirty(*pvmw.pte)) 229 pte = pte_swp_mksoft_dirty(pte); 230 if (pte_swp_uffd_wp(*pvmw.pte)) 231 pte = pte_swp_mkuffd_wp(pte); 232 } 233 234 #ifdef CONFIG_HUGETLB_PAGE 235 if (PageHuge(new)) { 236 unsigned int shift = huge_page_shift(hstate_vma(vma)); 237 238 pte = pte_mkhuge(pte); 239 pte = arch_make_huge_pte(pte, shift, vma->vm_flags); 240 if (PageAnon(new)) 241 hugepage_add_anon_rmap(new, vma, pvmw.address); 242 else 243 page_dup_rmap(new, true); 244 set_huge_pte_at(vma->vm_mm, pvmw.address, pvmw.pte, pte); 245 } else 246 #endif 247 { 248 if (PageAnon(new)) 249 page_add_anon_rmap(new, vma, pvmw.address, false); 250 else 251 page_add_file_rmap(new, false); 252 set_pte_at(vma->vm_mm, pvmw.address, pvmw.pte, pte); 253 } 254 if (vma->vm_flags & VM_LOCKED && !PageTransCompound(new)) 255 mlock_vma_page(new); 256 257 if (PageTransHuge(page) && PageMlocked(page)) 258 clear_page_mlock(page); 259 260 /* No need to invalidate - it was non-present before */ 261 update_mmu_cache(vma, pvmw.address, pvmw.pte); 262 } 263 264 return true; 265 } 266 267 /* 268 * Get rid of all migration entries and replace them by 269 * references to the indicated page. 270 */ 271 void remove_migration_ptes(struct page *old, struct page *new, bool locked) 272 { 273 struct rmap_walk_control rwc = { 274 .rmap_one = remove_migration_pte, 275 .arg = old, 276 }; 277 278 if (locked) 279 rmap_walk_locked(new, &rwc); 280 else 281 rmap_walk(new, &rwc); 282 } 283 284 /* 285 * Something used the pte of a page under migration. We need to 286 * get to the page and wait until migration is finished. 287 * When we return from this function the fault will be retried. 288 */ 289 void __migration_entry_wait(struct mm_struct *mm, pte_t *ptep, 290 spinlock_t *ptl) 291 { 292 pte_t pte; 293 swp_entry_t entry; 294 295 spin_lock(ptl); 296 pte = *ptep; 297 if (!is_swap_pte(pte)) 298 goto out; 299 300 entry = pte_to_swp_entry(pte); 301 if (!is_migration_entry(entry)) 302 goto out; 303 304 migration_entry_wait_on_locked(entry, ptep, ptl); 305 return; 306 out: 307 pte_unmap_unlock(ptep, ptl); 308 } 309 310 void migration_entry_wait(struct mm_struct *mm, pmd_t *pmd, 311 unsigned long address) 312 { 313 spinlock_t *ptl = pte_lockptr(mm, pmd); 314 pte_t *ptep = pte_offset_map(pmd, address); 315 __migration_entry_wait(mm, ptep, ptl); 316 } 317 318 void migration_entry_wait_huge(struct vm_area_struct *vma, 319 struct mm_struct *mm, pte_t *pte) 320 { 321 spinlock_t *ptl = huge_pte_lockptr(hstate_vma(vma), mm, pte); 322 __migration_entry_wait(mm, pte, ptl); 323 } 324 325 #ifdef CONFIG_ARCH_ENABLE_THP_MIGRATION 326 void pmd_migration_entry_wait(struct mm_struct *mm, pmd_t *pmd) 327 { 328 spinlock_t *ptl; 329 330 ptl = pmd_lock(mm, pmd); 331 if (!is_pmd_migration_entry(*pmd)) 332 goto unlock; 333 migration_entry_wait_on_locked(pmd_to_swp_entry(*pmd), NULL, ptl); 334 return; 335 unlock: 336 spin_unlock(ptl); 337 } 338 #endif 339 340 static int expected_page_refs(struct address_space *mapping, struct page *page) 341 { 342 int expected_count = 1; 343 344 /* 345 * Device private pages have an extra refcount as they are 346 * ZONE_DEVICE pages. 347 */ 348 expected_count += is_device_private_page(page); 349 if (mapping) 350 expected_count += compound_nr(page) + page_has_private(page); 351 352 return expected_count; 353 } 354 355 /* 356 * Replace the page in the mapping. 357 * 358 * The number of remaining references must be: 359 * 1 for anonymous pages without a mapping 360 * 2 for pages with a mapping 361 * 3 for pages with a mapping and PagePrivate/PagePrivate2 set. 362 */ 363 int folio_migrate_mapping(struct address_space *mapping, 364 struct folio *newfolio, struct folio *folio, int extra_count) 365 { 366 XA_STATE(xas, &mapping->i_pages, folio_index(folio)); 367 struct zone *oldzone, *newzone; 368 int dirty; 369 int expected_count = expected_page_refs(mapping, &folio->page) + extra_count; 370 long nr = folio_nr_pages(folio); 371 372 if (!mapping) { 373 /* Anonymous page without mapping */ 374 if (folio_ref_count(folio) != expected_count) 375 return -EAGAIN; 376 377 /* No turning back from here */ 378 newfolio->index = folio->index; 379 newfolio->mapping = folio->mapping; 380 if (folio_test_swapbacked(folio)) 381 __folio_set_swapbacked(newfolio); 382 383 return MIGRATEPAGE_SUCCESS; 384 } 385 386 oldzone = folio_zone(folio); 387 newzone = folio_zone(newfolio); 388 389 xas_lock_irq(&xas); 390 if (!folio_ref_freeze(folio, expected_count)) { 391 xas_unlock_irq(&xas); 392 return -EAGAIN; 393 } 394 395 /* 396 * Now we know that no one else is looking at the folio: 397 * no turning back from here. 398 */ 399 newfolio->index = folio->index; 400 newfolio->mapping = folio->mapping; 401 folio_ref_add(newfolio, nr); /* add cache reference */ 402 if (folio_test_swapbacked(folio)) { 403 __folio_set_swapbacked(newfolio); 404 if (folio_test_swapcache(folio)) { 405 folio_set_swapcache(newfolio); 406 newfolio->private = folio_get_private(folio); 407 } 408 } else { 409 VM_BUG_ON_FOLIO(folio_test_swapcache(folio), folio); 410 } 411 412 /* Move dirty while page refs frozen and newpage not yet exposed */ 413 dirty = folio_test_dirty(folio); 414 if (dirty) { 415 folio_clear_dirty(folio); 416 folio_set_dirty(newfolio); 417 } 418 419 xas_store(&xas, newfolio); 420 421 /* 422 * Drop cache reference from old page by unfreezing 423 * to one less reference. 424 * We know this isn't the last reference. 425 */ 426 folio_ref_unfreeze(folio, expected_count - nr); 427 428 xas_unlock(&xas); 429 /* Leave irq disabled to prevent preemption while updating stats */ 430 431 /* 432 * If moved to a different zone then also account 433 * the page for that zone. Other VM counters will be 434 * taken care of when we establish references to the 435 * new page and drop references to the old page. 436 * 437 * Note that anonymous pages are accounted for 438 * via NR_FILE_PAGES and NR_ANON_MAPPED if they 439 * are mapped to swap space. 440 */ 441 if (newzone != oldzone) { 442 struct lruvec *old_lruvec, *new_lruvec; 443 struct mem_cgroup *memcg; 444 445 memcg = folio_memcg(folio); 446 old_lruvec = mem_cgroup_lruvec(memcg, oldzone->zone_pgdat); 447 new_lruvec = mem_cgroup_lruvec(memcg, newzone->zone_pgdat); 448 449 __mod_lruvec_state(old_lruvec, NR_FILE_PAGES, -nr); 450 __mod_lruvec_state(new_lruvec, NR_FILE_PAGES, nr); 451 if (folio_test_swapbacked(folio) && !folio_test_swapcache(folio)) { 452 __mod_lruvec_state(old_lruvec, NR_SHMEM, -nr); 453 __mod_lruvec_state(new_lruvec, NR_SHMEM, nr); 454 } 455 #ifdef CONFIG_SWAP 456 if (folio_test_swapcache(folio)) { 457 __mod_lruvec_state(old_lruvec, NR_SWAPCACHE, -nr); 458 __mod_lruvec_state(new_lruvec, NR_SWAPCACHE, nr); 459 } 460 #endif 461 if (dirty && mapping_can_writeback(mapping)) { 462 __mod_lruvec_state(old_lruvec, NR_FILE_DIRTY, -nr); 463 __mod_zone_page_state(oldzone, NR_ZONE_WRITE_PENDING, -nr); 464 __mod_lruvec_state(new_lruvec, NR_FILE_DIRTY, nr); 465 __mod_zone_page_state(newzone, NR_ZONE_WRITE_PENDING, nr); 466 } 467 } 468 local_irq_enable(); 469 470 return MIGRATEPAGE_SUCCESS; 471 } 472 EXPORT_SYMBOL(folio_migrate_mapping); 473 474 /* 475 * The expected number of remaining references is the same as that 476 * of folio_migrate_mapping(). 477 */ 478 int migrate_huge_page_move_mapping(struct address_space *mapping, 479 struct page *newpage, struct page *page) 480 { 481 XA_STATE(xas, &mapping->i_pages, page_index(page)); 482 int expected_count; 483 484 xas_lock_irq(&xas); 485 expected_count = 2 + page_has_private(page); 486 if (page_count(page) != expected_count || xas_load(&xas) != page) { 487 xas_unlock_irq(&xas); 488 return -EAGAIN; 489 } 490 491 if (!page_ref_freeze(page, expected_count)) { 492 xas_unlock_irq(&xas); 493 return -EAGAIN; 494 } 495 496 newpage->index = page->index; 497 newpage->mapping = page->mapping; 498 499 get_page(newpage); 500 501 xas_store(&xas, newpage); 502 503 page_ref_unfreeze(page, expected_count - 1); 504 505 xas_unlock_irq(&xas); 506 507 return MIGRATEPAGE_SUCCESS; 508 } 509 510 /* 511 * Copy the flags and some other ancillary information 512 */ 513 void folio_migrate_flags(struct folio *newfolio, struct folio *folio) 514 { 515 int cpupid; 516 517 if (folio_test_error(folio)) 518 folio_set_error(newfolio); 519 if (folio_test_referenced(folio)) 520 folio_set_referenced(newfolio); 521 if (folio_test_uptodate(folio)) 522 folio_mark_uptodate(newfolio); 523 if (folio_test_clear_active(folio)) { 524 VM_BUG_ON_FOLIO(folio_test_unevictable(folio), folio); 525 folio_set_active(newfolio); 526 } else if (folio_test_clear_unevictable(folio)) 527 folio_set_unevictable(newfolio); 528 if (folio_test_workingset(folio)) 529 folio_set_workingset(newfolio); 530 if (folio_test_checked(folio)) 531 folio_set_checked(newfolio); 532 if (folio_test_mappedtodisk(folio)) 533 folio_set_mappedtodisk(newfolio); 534 535 /* Move dirty on pages not done by folio_migrate_mapping() */ 536 if (folio_test_dirty(folio)) 537 folio_set_dirty(newfolio); 538 539 if (folio_test_young(folio)) 540 folio_set_young(newfolio); 541 if (folio_test_idle(folio)) 542 folio_set_idle(newfolio); 543 544 /* 545 * Copy NUMA information to the new page, to prevent over-eager 546 * future migrations of this same page. 547 */ 548 cpupid = page_cpupid_xchg_last(&folio->page, -1); 549 page_cpupid_xchg_last(&newfolio->page, cpupid); 550 551 folio_migrate_ksm(newfolio, folio); 552 /* 553 * Please do not reorder this without considering how mm/ksm.c's 554 * get_ksm_page() depends upon ksm_migrate_page() and PageSwapCache(). 555 */ 556 if (folio_test_swapcache(folio)) 557 folio_clear_swapcache(folio); 558 folio_clear_private(folio); 559 560 /* page->private contains hugetlb specific flags */ 561 if (!folio_test_hugetlb(folio)) 562 folio->private = NULL; 563 564 /* 565 * If any waiters have accumulated on the new page then 566 * wake them up. 567 */ 568 if (folio_test_writeback(newfolio)) 569 folio_end_writeback(newfolio); 570 571 /* 572 * PG_readahead shares the same bit with PG_reclaim. The above 573 * end_page_writeback() may clear PG_readahead mistakenly, so set the 574 * bit after that. 575 */ 576 if (folio_test_readahead(folio)) 577 folio_set_readahead(newfolio); 578 579 folio_copy_owner(newfolio, folio); 580 581 if (!folio_test_hugetlb(folio)) 582 mem_cgroup_migrate(folio, newfolio); 583 } 584 EXPORT_SYMBOL(folio_migrate_flags); 585 586 void folio_migrate_copy(struct folio *newfolio, struct folio *folio) 587 { 588 folio_copy(newfolio, folio); 589 folio_migrate_flags(newfolio, folio); 590 } 591 EXPORT_SYMBOL(folio_migrate_copy); 592 593 /************************************************************ 594 * Migration functions 595 ***********************************************************/ 596 597 /* 598 * Common logic to directly migrate a single LRU page suitable for 599 * pages that do not use PagePrivate/PagePrivate2. 600 * 601 * Pages are locked upon entry and exit. 602 */ 603 int migrate_page(struct address_space *mapping, 604 struct page *newpage, struct page *page, 605 enum migrate_mode mode) 606 { 607 struct folio *newfolio = page_folio(newpage); 608 struct folio *folio = page_folio(page); 609 int rc; 610 611 BUG_ON(folio_test_writeback(folio)); /* Writeback must be complete */ 612 613 rc = folio_migrate_mapping(mapping, newfolio, folio, 0); 614 615 if (rc != MIGRATEPAGE_SUCCESS) 616 return rc; 617 618 if (mode != MIGRATE_SYNC_NO_COPY) 619 folio_migrate_copy(newfolio, folio); 620 else 621 folio_migrate_flags(newfolio, folio); 622 return MIGRATEPAGE_SUCCESS; 623 } 624 EXPORT_SYMBOL(migrate_page); 625 626 #ifdef CONFIG_BLOCK 627 /* Returns true if all buffers are successfully locked */ 628 static bool buffer_migrate_lock_buffers(struct buffer_head *head, 629 enum migrate_mode mode) 630 { 631 struct buffer_head *bh = head; 632 633 /* Simple case, sync compaction */ 634 if (mode != MIGRATE_ASYNC) { 635 do { 636 lock_buffer(bh); 637 bh = bh->b_this_page; 638 639 } while (bh != head); 640 641 return true; 642 } 643 644 /* async case, we cannot block on lock_buffer so use trylock_buffer */ 645 do { 646 if (!trylock_buffer(bh)) { 647 /* 648 * We failed to lock the buffer and cannot stall in 649 * async migration. Release the taken locks 650 */ 651 struct buffer_head *failed_bh = bh; 652 bh = head; 653 while (bh != failed_bh) { 654 unlock_buffer(bh); 655 bh = bh->b_this_page; 656 } 657 return false; 658 } 659 660 bh = bh->b_this_page; 661 } while (bh != head); 662 return true; 663 } 664 665 static int __buffer_migrate_page(struct address_space *mapping, 666 struct page *newpage, struct page *page, enum migrate_mode mode, 667 bool check_refs) 668 { 669 struct buffer_head *bh, *head; 670 int rc; 671 int expected_count; 672 673 if (!page_has_buffers(page)) 674 return migrate_page(mapping, newpage, page, mode); 675 676 /* Check whether page does not have extra refs before we do more work */ 677 expected_count = expected_page_refs(mapping, page); 678 if (page_count(page) != expected_count) 679 return -EAGAIN; 680 681 head = page_buffers(page); 682 if (!buffer_migrate_lock_buffers(head, mode)) 683 return -EAGAIN; 684 685 if (check_refs) { 686 bool busy; 687 bool invalidated = false; 688 689 recheck_buffers: 690 busy = false; 691 spin_lock(&mapping->private_lock); 692 bh = head; 693 do { 694 if (atomic_read(&bh->b_count)) { 695 busy = true; 696 break; 697 } 698 bh = bh->b_this_page; 699 } while (bh != head); 700 if (busy) { 701 if (invalidated) { 702 rc = -EAGAIN; 703 goto unlock_buffers; 704 } 705 spin_unlock(&mapping->private_lock); 706 invalidate_bh_lrus(); 707 invalidated = true; 708 goto recheck_buffers; 709 } 710 } 711 712 rc = migrate_page_move_mapping(mapping, newpage, page, 0); 713 if (rc != MIGRATEPAGE_SUCCESS) 714 goto unlock_buffers; 715 716 attach_page_private(newpage, detach_page_private(page)); 717 718 bh = head; 719 do { 720 set_bh_page(bh, newpage, bh_offset(bh)); 721 bh = bh->b_this_page; 722 723 } while (bh != head); 724 725 if (mode != MIGRATE_SYNC_NO_COPY) 726 migrate_page_copy(newpage, page); 727 else 728 migrate_page_states(newpage, page); 729 730 rc = MIGRATEPAGE_SUCCESS; 731 unlock_buffers: 732 if (check_refs) 733 spin_unlock(&mapping->private_lock); 734 bh = head; 735 do { 736 unlock_buffer(bh); 737 bh = bh->b_this_page; 738 739 } while (bh != head); 740 741 return rc; 742 } 743 744 /* 745 * Migration function for pages with buffers. This function can only be used 746 * if the underlying filesystem guarantees that no other references to "page" 747 * exist. For example attached buffer heads are accessed only under page lock. 748 */ 749 int buffer_migrate_page(struct address_space *mapping, 750 struct page *newpage, struct page *page, enum migrate_mode mode) 751 { 752 return __buffer_migrate_page(mapping, newpage, page, mode, false); 753 } 754 EXPORT_SYMBOL(buffer_migrate_page); 755 756 /* 757 * Same as above except that this variant is more careful and checks that there 758 * are also no buffer head references. This function is the right one for 759 * mappings where buffer heads are directly looked up and referenced (such as 760 * block device mappings). 761 */ 762 int buffer_migrate_page_norefs(struct address_space *mapping, 763 struct page *newpage, struct page *page, enum migrate_mode mode) 764 { 765 return __buffer_migrate_page(mapping, newpage, page, mode, true); 766 } 767 #endif 768 769 /* 770 * Writeback a page to clean the dirty state 771 */ 772 static int writeout(struct address_space *mapping, struct page *page) 773 { 774 struct writeback_control wbc = { 775 .sync_mode = WB_SYNC_NONE, 776 .nr_to_write = 1, 777 .range_start = 0, 778 .range_end = LLONG_MAX, 779 .for_reclaim = 1 780 }; 781 int rc; 782 783 if (!mapping->a_ops->writepage) 784 /* No write method for the address space */ 785 return -EINVAL; 786 787 if (!clear_page_dirty_for_io(page)) 788 /* Someone else already triggered a write */ 789 return -EAGAIN; 790 791 /* 792 * A dirty page may imply that the underlying filesystem has 793 * the page on some queue. So the page must be clean for 794 * migration. Writeout may mean we loose the lock and the 795 * page state is no longer what we checked for earlier. 796 * At this point we know that the migration attempt cannot 797 * be successful. 798 */ 799 remove_migration_ptes(page, page, false); 800 801 rc = mapping->a_ops->writepage(page, &wbc); 802 803 if (rc != AOP_WRITEPAGE_ACTIVATE) 804 /* unlocked. Relock */ 805 lock_page(page); 806 807 return (rc < 0) ? -EIO : -EAGAIN; 808 } 809 810 /* 811 * Default handling if a filesystem does not provide a migration function. 812 */ 813 static int fallback_migrate_page(struct address_space *mapping, 814 struct page *newpage, struct page *page, enum migrate_mode mode) 815 { 816 if (PageDirty(page)) { 817 /* Only writeback pages in full synchronous migration */ 818 switch (mode) { 819 case MIGRATE_SYNC: 820 case MIGRATE_SYNC_NO_COPY: 821 break; 822 default: 823 return -EBUSY; 824 } 825 return writeout(mapping, page); 826 } 827 828 /* 829 * Buffers may be managed in a filesystem specific way. 830 * We must have no buffers or drop them. 831 */ 832 if (page_has_private(page) && 833 !try_to_release_page(page, GFP_KERNEL)) 834 return mode == MIGRATE_SYNC ? -EAGAIN : -EBUSY; 835 836 return migrate_page(mapping, newpage, page, mode); 837 } 838 839 /* 840 * Move a page to a newly allocated page 841 * The page is locked and all ptes have been successfully removed. 842 * 843 * The new page will have replaced the old page if this function 844 * is successful. 845 * 846 * Return value: 847 * < 0 - error code 848 * MIGRATEPAGE_SUCCESS - success 849 */ 850 static int move_to_new_page(struct page *newpage, struct page *page, 851 enum migrate_mode mode) 852 { 853 struct address_space *mapping; 854 int rc = -EAGAIN; 855 bool is_lru = !__PageMovable(page); 856 857 VM_BUG_ON_PAGE(!PageLocked(page), page); 858 VM_BUG_ON_PAGE(!PageLocked(newpage), newpage); 859 860 mapping = page_mapping(page); 861 862 if (likely(is_lru)) { 863 if (!mapping) 864 rc = migrate_page(mapping, newpage, page, mode); 865 else if (mapping->a_ops->migratepage) 866 /* 867 * Most pages have a mapping and most filesystems 868 * provide a migratepage callback. Anonymous pages 869 * are part of swap space which also has its own 870 * migratepage callback. This is the most common path 871 * for page migration. 872 */ 873 rc = mapping->a_ops->migratepage(mapping, newpage, 874 page, mode); 875 else 876 rc = fallback_migrate_page(mapping, newpage, 877 page, mode); 878 } else { 879 /* 880 * In case of non-lru page, it could be released after 881 * isolation step. In that case, we shouldn't try migration. 882 */ 883 VM_BUG_ON_PAGE(!PageIsolated(page), page); 884 if (!PageMovable(page)) { 885 rc = MIGRATEPAGE_SUCCESS; 886 __ClearPageIsolated(page); 887 goto out; 888 } 889 890 rc = mapping->a_ops->migratepage(mapping, newpage, 891 page, mode); 892 WARN_ON_ONCE(rc == MIGRATEPAGE_SUCCESS && 893 !PageIsolated(page)); 894 } 895 896 /* 897 * When successful, old pagecache page->mapping must be cleared before 898 * page is freed; but stats require that PageAnon be left as PageAnon. 899 */ 900 if (rc == MIGRATEPAGE_SUCCESS) { 901 if (__PageMovable(page)) { 902 VM_BUG_ON_PAGE(!PageIsolated(page), page); 903 904 /* 905 * We clear PG_movable under page_lock so any compactor 906 * cannot try to migrate this page. 907 */ 908 __ClearPageIsolated(page); 909 } 910 911 /* 912 * Anonymous and movable page->mapping will be cleared by 913 * free_pages_prepare so don't reset it here for keeping 914 * the type to work PageAnon, for example. 915 */ 916 if (!PageMappingFlags(page)) 917 page->mapping = NULL; 918 919 if (likely(!is_zone_device_page(newpage))) 920 flush_dcache_folio(page_folio(newpage)); 921 } 922 out: 923 return rc; 924 } 925 926 static int __unmap_and_move(struct page *page, struct page *newpage, 927 int force, enum migrate_mode mode) 928 { 929 int rc = -EAGAIN; 930 bool page_was_mapped = false; 931 struct anon_vma *anon_vma = NULL; 932 bool is_lru = !__PageMovable(page); 933 934 if (!trylock_page(page)) { 935 if (!force || mode == MIGRATE_ASYNC) 936 goto out; 937 938 /* 939 * It's not safe for direct compaction to call lock_page. 940 * For example, during page readahead pages are added locked 941 * to the LRU. Later, when the IO completes the pages are 942 * marked uptodate and unlocked. However, the queueing 943 * could be merging multiple pages for one bio (e.g. 944 * mpage_readahead). If an allocation happens for the 945 * second or third page, the process can end up locking 946 * the same page twice and deadlocking. Rather than 947 * trying to be clever about what pages can be locked, 948 * avoid the use of lock_page for direct compaction 949 * altogether. 950 */ 951 if (current->flags & PF_MEMALLOC) 952 goto out; 953 954 lock_page(page); 955 } 956 957 if (PageWriteback(page)) { 958 /* 959 * Only in the case of a full synchronous migration is it 960 * necessary to wait for PageWriteback. In the async case, 961 * the retry loop is too short and in the sync-light case, 962 * the overhead of stalling is too much 963 */ 964 switch (mode) { 965 case MIGRATE_SYNC: 966 case MIGRATE_SYNC_NO_COPY: 967 break; 968 default: 969 rc = -EBUSY; 970 goto out_unlock; 971 } 972 if (!force) 973 goto out_unlock; 974 wait_on_page_writeback(page); 975 } 976 977 /* 978 * By try_to_migrate(), page->mapcount goes down to 0 here. In this case, 979 * we cannot notice that anon_vma is freed while we migrates a page. 980 * This get_anon_vma() delays freeing anon_vma pointer until the end 981 * of migration. File cache pages are no problem because of page_lock() 982 * File Caches may use write_page() or lock_page() in migration, then, 983 * just care Anon page here. 984 * 985 * Only page_get_anon_vma() understands the subtleties of 986 * getting a hold on an anon_vma from outside one of its mms. 987 * But if we cannot get anon_vma, then we won't need it anyway, 988 * because that implies that the anon page is no longer mapped 989 * (and cannot be remapped so long as we hold the page lock). 990 */ 991 if (PageAnon(page) && !PageKsm(page)) 992 anon_vma = page_get_anon_vma(page); 993 994 /* 995 * Block others from accessing the new page when we get around to 996 * establishing additional references. We are usually the only one 997 * holding a reference to newpage at this point. We used to have a BUG 998 * here if trylock_page(newpage) fails, but would like to allow for 999 * cases where there might be a race with the previous use of newpage. 1000 * This is much like races on refcount of oldpage: just don't BUG(). 1001 */ 1002 if (unlikely(!trylock_page(newpage))) 1003 goto out_unlock; 1004 1005 if (unlikely(!is_lru)) { 1006 rc = move_to_new_page(newpage, page, mode); 1007 goto out_unlock_both; 1008 } 1009 1010 /* 1011 * Corner case handling: 1012 * 1. When a new swap-cache page is read into, it is added to the LRU 1013 * and treated as swapcache but it has no rmap yet. 1014 * Calling try_to_unmap() against a page->mapping==NULL page will 1015 * trigger a BUG. So handle it here. 1016 * 2. An orphaned page (see truncate_cleanup_page) might have 1017 * fs-private metadata. The page can be picked up due to memory 1018 * offlining. Everywhere else except page reclaim, the page is 1019 * invisible to the vm, so the page can not be migrated. So try to 1020 * free the metadata, so the page can be freed. 1021 */ 1022 if (!page->mapping) { 1023 VM_BUG_ON_PAGE(PageAnon(page), page); 1024 if (page_has_private(page)) { 1025 try_to_free_buffers(page); 1026 goto out_unlock_both; 1027 } 1028 } else if (page_mapped(page)) { 1029 /* Establish migration ptes */ 1030 VM_BUG_ON_PAGE(PageAnon(page) && !PageKsm(page) && !anon_vma, 1031 page); 1032 try_to_migrate(page, 0); 1033 page_was_mapped = true; 1034 } 1035 1036 if (!page_mapped(page)) 1037 rc = move_to_new_page(newpage, page, mode); 1038 1039 if (page_was_mapped) 1040 remove_migration_ptes(page, 1041 rc == MIGRATEPAGE_SUCCESS ? newpage : page, false); 1042 1043 out_unlock_both: 1044 unlock_page(newpage); 1045 out_unlock: 1046 /* Drop an anon_vma reference if we took one */ 1047 if (anon_vma) 1048 put_anon_vma(anon_vma); 1049 unlock_page(page); 1050 out: 1051 /* 1052 * If migration is successful, decrease refcount of the newpage 1053 * which will not free the page because new page owner increased 1054 * refcounter. As well, if it is LRU page, add the page to LRU 1055 * list in here. Use the old state of the isolated source page to 1056 * determine if we migrated a LRU page. newpage was already unlocked 1057 * and possibly modified by its owner - don't rely on the page 1058 * state. 1059 */ 1060 if (rc == MIGRATEPAGE_SUCCESS) { 1061 if (unlikely(!is_lru)) 1062 put_page(newpage); 1063 else 1064 putback_lru_page(newpage); 1065 } 1066 1067 return rc; 1068 } 1069 1070 /* 1071 * Obtain the lock on page, remove all ptes and migrate the page 1072 * to the newly allocated page in newpage. 1073 */ 1074 static int unmap_and_move(new_page_t get_new_page, 1075 free_page_t put_new_page, 1076 unsigned long private, struct page *page, 1077 int force, enum migrate_mode mode, 1078 enum migrate_reason reason, 1079 struct list_head *ret) 1080 { 1081 int rc = MIGRATEPAGE_SUCCESS; 1082 struct page *newpage = NULL; 1083 1084 if (!thp_migration_supported() && PageTransHuge(page)) 1085 return -ENOSYS; 1086 1087 if (page_count(page) == 1) { 1088 /* page was freed from under us. So we are done. */ 1089 ClearPageActive(page); 1090 ClearPageUnevictable(page); 1091 if (unlikely(__PageMovable(page))) { 1092 lock_page(page); 1093 if (!PageMovable(page)) 1094 __ClearPageIsolated(page); 1095 unlock_page(page); 1096 } 1097 goto out; 1098 } 1099 1100 newpage = get_new_page(page, private); 1101 if (!newpage) 1102 return -ENOMEM; 1103 1104 rc = __unmap_and_move(page, newpage, force, mode); 1105 if (rc == MIGRATEPAGE_SUCCESS) 1106 set_page_owner_migrate_reason(newpage, reason); 1107 1108 out: 1109 if (rc != -EAGAIN) { 1110 /* 1111 * A page that has been migrated has all references 1112 * removed and will be freed. A page that has not been 1113 * migrated will have kept its references and be restored. 1114 */ 1115 list_del(&page->lru); 1116 } 1117 1118 /* 1119 * If migration is successful, releases reference grabbed during 1120 * isolation. Otherwise, restore the page to right list unless 1121 * we want to retry. 1122 */ 1123 if (rc == MIGRATEPAGE_SUCCESS) { 1124 /* 1125 * Compaction can migrate also non-LRU pages which are 1126 * not accounted to NR_ISOLATED_*. They can be recognized 1127 * as __PageMovable 1128 */ 1129 if (likely(!__PageMovable(page))) 1130 mod_node_page_state(page_pgdat(page), NR_ISOLATED_ANON + 1131 page_is_file_lru(page), -thp_nr_pages(page)); 1132 1133 if (reason != MR_MEMORY_FAILURE) 1134 /* 1135 * We release the page in page_handle_poison. 1136 */ 1137 put_page(page); 1138 } else { 1139 if (rc != -EAGAIN) 1140 list_add_tail(&page->lru, ret); 1141 1142 if (put_new_page) 1143 put_new_page(newpage, private); 1144 else 1145 put_page(newpage); 1146 } 1147 1148 return rc; 1149 } 1150 1151 /* 1152 * Counterpart of unmap_and_move_page() for hugepage migration. 1153 * 1154 * This function doesn't wait the completion of hugepage I/O 1155 * because there is no race between I/O and migration for hugepage. 1156 * Note that currently hugepage I/O occurs only in direct I/O 1157 * where no lock is held and PG_writeback is irrelevant, 1158 * and writeback status of all subpages are counted in the reference 1159 * count of the head page (i.e. if all subpages of a 2MB hugepage are 1160 * under direct I/O, the reference of the head page is 512 and a bit more.) 1161 * This means that when we try to migrate hugepage whose subpages are 1162 * doing direct I/O, some references remain after try_to_unmap() and 1163 * hugepage migration fails without data corruption. 1164 * 1165 * There is also no race when direct I/O is issued on the page under migration, 1166 * because then pte is replaced with migration swap entry and direct I/O code 1167 * will wait in the page fault for migration to complete. 1168 */ 1169 static int unmap_and_move_huge_page(new_page_t get_new_page, 1170 free_page_t put_new_page, unsigned long private, 1171 struct page *hpage, int force, 1172 enum migrate_mode mode, int reason, 1173 struct list_head *ret) 1174 { 1175 int rc = -EAGAIN; 1176 int page_was_mapped = 0; 1177 struct page *new_hpage; 1178 struct anon_vma *anon_vma = NULL; 1179 struct address_space *mapping = NULL; 1180 1181 /* 1182 * Migratability of hugepages depends on architectures and their size. 1183 * This check is necessary because some callers of hugepage migration 1184 * like soft offline and memory hotremove don't walk through page 1185 * tables or check whether the hugepage is pmd-based or not before 1186 * kicking migration. 1187 */ 1188 if (!hugepage_migration_supported(page_hstate(hpage))) { 1189 list_move_tail(&hpage->lru, ret); 1190 return -ENOSYS; 1191 } 1192 1193 if (page_count(hpage) == 1) { 1194 /* page was freed from under us. So we are done. */ 1195 putback_active_hugepage(hpage); 1196 return MIGRATEPAGE_SUCCESS; 1197 } 1198 1199 new_hpage = get_new_page(hpage, private); 1200 if (!new_hpage) 1201 return -ENOMEM; 1202 1203 if (!trylock_page(hpage)) { 1204 if (!force) 1205 goto out; 1206 switch (mode) { 1207 case MIGRATE_SYNC: 1208 case MIGRATE_SYNC_NO_COPY: 1209 break; 1210 default: 1211 goto out; 1212 } 1213 lock_page(hpage); 1214 } 1215 1216 /* 1217 * Check for pages which are in the process of being freed. Without 1218 * page_mapping() set, hugetlbfs specific move page routine will not 1219 * be called and we could leak usage counts for subpools. 1220 */ 1221 if (hugetlb_page_subpool(hpage) && !page_mapping(hpage)) { 1222 rc = -EBUSY; 1223 goto out_unlock; 1224 } 1225 1226 if (PageAnon(hpage)) 1227 anon_vma = page_get_anon_vma(hpage); 1228 1229 if (unlikely(!trylock_page(new_hpage))) 1230 goto put_anon; 1231 1232 if (page_mapped(hpage)) { 1233 bool mapping_locked = false; 1234 enum ttu_flags ttu = 0; 1235 1236 if (!PageAnon(hpage)) { 1237 /* 1238 * In shared mappings, try_to_unmap could potentially 1239 * call huge_pmd_unshare. Because of this, take 1240 * semaphore in write mode here and set TTU_RMAP_LOCKED 1241 * to let lower levels know we have taken the lock. 1242 */ 1243 mapping = hugetlb_page_mapping_lock_write(hpage); 1244 if (unlikely(!mapping)) 1245 goto unlock_put_anon; 1246 1247 mapping_locked = true; 1248 ttu |= TTU_RMAP_LOCKED; 1249 } 1250 1251 try_to_migrate(hpage, ttu); 1252 page_was_mapped = 1; 1253 1254 if (mapping_locked) 1255 i_mmap_unlock_write(mapping); 1256 } 1257 1258 if (!page_mapped(hpage)) 1259 rc = move_to_new_page(new_hpage, hpage, mode); 1260 1261 if (page_was_mapped) 1262 remove_migration_ptes(hpage, 1263 rc == MIGRATEPAGE_SUCCESS ? new_hpage : hpage, false); 1264 1265 unlock_put_anon: 1266 unlock_page(new_hpage); 1267 1268 put_anon: 1269 if (anon_vma) 1270 put_anon_vma(anon_vma); 1271 1272 if (rc == MIGRATEPAGE_SUCCESS) { 1273 move_hugetlb_state(hpage, new_hpage, reason); 1274 put_new_page = NULL; 1275 } 1276 1277 out_unlock: 1278 unlock_page(hpage); 1279 out: 1280 if (rc == MIGRATEPAGE_SUCCESS) 1281 putback_active_hugepage(hpage); 1282 else if (rc != -EAGAIN) 1283 list_move_tail(&hpage->lru, ret); 1284 1285 /* 1286 * If migration was not successful and there's a freeing callback, use 1287 * it. Otherwise, put_page() will drop the reference grabbed during 1288 * isolation. 1289 */ 1290 if (put_new_page) 1291 put_new_page(new_hpage, private); 1292 else 1293 putback_active_hugepage(new_hpage); 1294 1295 return rc; 1296 } 1297 1298 static inline int try_split_thp(struct page *page, struct page **page2, 1299 struct list_head *from) 1300 { 1301 int rc = 0; 1302 1303 lock_page(page); 1304 rc = split_huge_page_to_list(page, from); 1305 unlock_page(page); 1306 if (!rc) 1307 list_safe_reset_next(page, *page2, lru); 1308 1309 return rc; 1310 } 1311 1312 /* 1313 * migrate_pages - migrate the pages specified in a list, to the free pages 1314 * supplied as the target for the page migration 1315 * 1316 * @from: The list of pages to be migrated. 1317 * @get_new_page: The function used to allocate free pages to be used 1318 * as the target of the page migration. 1319 * @put_new_page: The function used to free target pages if migration 1320 * fails, or NULL if no special handling is necessary. 1321 * @private: Private data to be passed on to get_new_page() 1322 * @mode: The migration mode that specifies the constraints for 1323 * page migration, if any. 1324 * @reason: The reason for page migration. 1325 * @ret_succeeded: Set to the number of normal pages migrated successfully if 1326 * the caller passes a non-NULL pointer. 1327 * 1328 * The function returns after 10 attempts or if no pages are movable any more 1329 * because the list has become empty or no retryable pages exist any more. 1330 * It is caller's responsibility to call putback_movable_pages() to return pages 1331 * to the LRU or free list only if ret != 0. 1332 * 1333 * Returns the number of {normal page, THP, hugetlb} that were not migrated, or 1334 * an error code. The number of THP splits will be considered as the number of 1335 * non-migrated THP, no matter how many subpages of the THP are migrated successfully. 1336 */ 1337 int migrate_pages(struct list_head *from, new_page_t get_new_page, 1338 free_page_t put_new_page, unsigned long private, 1339 enum migrate_mode mode, int reason, unsigned int *ret_succeeded) 1340 { 1341 int retry = 1; 1342 int thp_retry = 1; 1343 int nr_failed = 0; 1344 int nr_failed_pages = 0; 1345 int nr_succeeded = 0; 1346 int nr_thp_succeeded = 0; 1347 int nr_thp_failed = 0; 1348 int nr_thp_split = 0; 1349 int pass = 0; 1350 bool is_thp = false; 1351 struct page *page; 1352 struct page *page2; 1353 int swapwrite = current->flags & PF_SWAPWRITE; 1354 int rc, nr_subpages; 1355 LIST_HEAD(ret_pages); 1356 LIST_HEAD(thp_split_pages); 1357 bool nosplit = (reason == MR_NUMA_MISPLACED); 1358 bool no_subpage_counting = false; 1359 1360 trace_mm_migrate_pages_start(mode, reason); 1361 1362 if (!swapwrite) 1363 current->flags |= PF_SWAPWRITE; 1364 1365 thp_subpage_migration: 1366 for (pass = 0; pass < 10 && (retry || thp_retry); pass++) { 1367 retry = 0; 1368 thp_retry = 0; 1369 1370 list_for_each_entry_safe(page, page2, from, lru) { 1371 retry: 1372 /* 1373 * THP statistics is based on the source huge page. 1374 * Capture required information that might get lost 1375 * during migration. 1376 */ 1377 is_thp = PageTransHuge(page) && !PageHuge(page); 1378 nr_subpages = compound_nr(page); 1379 cond_resched(); 1380 1381 if (PageHuge(page)) 1382 rc = unmap_and_move_huge_page(get_new_page, 1383 put_new_page, private, page, 1384 pass > 2, mode, reason, 1385 &ret_pages); 1386 else 1387 rc = unmap_and_move(get_new_page, put_new_page, 1388 private, page, pass > 2, mode, 1389 reason, &ret_pages); 1390 /* 1391 * The rules are: 1392 * Success: non hugetlb page will be freed, hugetlb 1393 * page will be put back 1394 * -EAGAIN: stay on the from list 1395 * -ENOMEM: stay on the from list 1396 * Other errno: put on ret_pages list then splice to 1397 * from list 1398 */ 1399 switch(rc) { 1400 /* 1401 * THP migration might be unsupported or the 1402 * allocation could've failed so we should 1403 * retry on the same page with the THP split 1404 * to base pages. 1405 * 1406 * Head page is retried immediately and tail 1407 * pages are added to the tail of the list so 1408 * we encounter them after the rest of the list 1409 * is processed. 1410 */ 1411 case -ENOSYS: 1412 /* THP migration is unsupported */ 1413 if (is_thp) { 1414 nr_thp_failed++; 1415 if (!try_split_thp(page, &page2, &thp_split_pages)) { 1416 nr_thp_split++; 1417 goto retry; 1418 } 1419 1420 nr_failed_pages += nr_subpages; 1421 break; 1422 } 1423 1424 /* Hugetlb migration is unsupported */ 1425 if (!no_subpage_counting) 1426 nr_failed++; 1427 nr_failed_pages += nr_subpages; 1428 break; 1429 case -ENOMEM: 1430 /* 1431 * When memory is low, don't bother to try to migrate 1432 * other pages, just exit. 1433 * THP NUMA faulting doesn't split THP to retry. 1434 */ 1435 if (is_thp && !nosplit) { 1436 nr_thp_failed++; 1437 if (!try_split_thp(page, &page2, &thp_split_pages)) { 1438 nr_thp_split++; 1439 goto retry; 1440 } 1441 1442 nr_failed_pages += nr_subpages; 1443 goto out; 1444 } 1445 1446 if (!no_subpage_counting) 1447 nr_failed++; 1448 nr_failed_pages += nr_subpages; 1449 goto out; 1450 case -EAGAIN: 1451 if (is_thp) { 1452 thp_retry++; 1453 break; 1454 } 1455 retry++; 1456 break; 1457 case MIGRATEPAGE_SUCCESS: 1458 nr_succeeded += nr_subpages; 1459 if (is_thp) { 1460 nr_thp_succeeded++; 1461 break; 1462 } 1463 break; 1464 default: 1465 /* 1466 * Permanent failure (-EBUSY, etc.): 1467 * unlike -EAGAIN case, the failed page is 1468 * removed from migration page list and not 1469 * retried in the next outer loop. 1470 */ 1471 if (is_thp) { 1472 nr_thp_failed++; 1473 nr_failed_pages += nr_subpages; 1474 break; 1475 } 1476 1477 if (!no_subpage_counting) 1478 nr_failed++; 1479 nr_failed_pages += nr_subpages; 1480 break; 1481 } 1482 } 1483 } 1484 nr_failed += retry; 1485 nr_thp_failed += thp_retry; 1486 /* 1487 * Try to migrate subpages of fail-to-migrate THPs, no nr_failed 1488 * counting in this round, since all subpages of a THP is counted 1489 * as 1 failure in the first round. 1490 */ 1491 if (!list_empty(&thp_split_pages)) { 1492 /* 1493 * Move non-migrated pages (after 10 retries) to ret_pages 1494 * to avoid migrating them again. 1495 */ 1496 list_splice_init(from, &ret_pages); 1497 list_splice_init(&thp_split_pages, from); 1498 no_subpage_counting = true; 1499 retry = 1; 1500 goto thp_subpage_migration; 1501 } 1502 1503 rc = nr_failed + nr_thp_failed; 1504 out: 1505 /* 1506 * Put the permanent failure page back to migration list, they 1507 * will be put back to the right list by the caller. 1508 */ 1509 list_splice(&ret_pages, from); 1510 1511 count_vm_events(PGMIGRATE_SUCCESS, nr_succeeded); 1512 count_vm_events(PGMIGRATE_FAIL, nr_failed_pages); 1513 count_vm_events(THP_MIGRATION_SUCCESS, nr_thp_succeeded); 1514 count_vm_events(THP_MIGRATION_FAIL, nr_thp_failed); 1515 count_vm_events(THP_MIGRATION_SPLIT, nr_thp_split); 1516 trace_mm_migrate_pages(nr_succeeded, nr_failed_pages, nr_thp_succeeded, 1517 nr_thp_failed, nr_thp_split, mode, reason); 1518 1519 if (!swapwrite) 1520 current->flags &= ~PF_SWAPWRITE; 1521 1522 if (ret_succeeded) 1523 *ret_succeeded = nr_succeeded; 1524 1525 return rc; 1526 } 1527 1528 struct page *alloc_migration_target(struct page *page, unsigned long private) 1529 { 1530 struct migration_target_control *mtc; 1531 gfp_t gfp_mask; 1532 unsigned int order = 0; 1533 struct page *new_page = NULL; 1534 int nid; 1535 int zidx; 1536 1537 mtc = (struct migration_target_control *)private; 1538 gfp_mask = mtc->gfp_mask; 1539 nid = mtc->nid; 1540 if (nid == NUMA_NO_NODE) 1541 nid = page_to_nid(page); 1542 1543 if (PageHuge(page)) { 1544 struct hstate *h = page_hstate(compound_head(page)); 1545 1546 gfp_mask = htlb_modify_alloc_mask(h, gfp_mask); 1547 return alloc_huge_page_nodemask(h, nid, mtc->nmask, gfp_mask); 1548 } 1549 1550 if (PageTransHuge(page)) { 1551 /* 1552 * clear __GFP_RECLAIM to make the migration callback 1553 * consistent with regular THP allocations. 1554 */ 1555 gfp_mask &= ~__GFP_RECLAIM; 1556 gfp_mask |= GFP_TRANSHUGE; 1557 order = HPAGE_PMD_ORDER; 1558 } 1559 zidx = zone_idx(page_zone(page)); 1560 if (is_highmem_idx(zidx) || zidx == ZONE_MOVABLE) 1561 gfp_mask |= __GFP_HIGHMEM; 1562 1563 new_page = __alloc_pages(gfp_mask, order, nid, mtc->nmask); 1564 1565 if (new_page && PageTransHuge(new_page)) 1566 prep_transhuge_page(new_page); 1567 1568 return new_page; 1569 } 1570 1571 #ifdef CONFIG_NUMA 1572 1573 static int store_status(int __user *status, int start, int value, int nr) 1574 { 1575 while (nr-- > 0) { 1576 if (put_user(value, status + start)) 1577 return -EFAULT; 1578 start++; 1579 } 1580 1581 return 0; 1582 } 1583 1584 static int do_move_pages_to_node(struct mm_struct *mm, 1585 struct list_head *pagelist, int node) 1586 { 1587 int err; 1588 struct migration_target_control mtc = { 1589 .nid = node, 1590 .gfp_mask = GFP_HIGHUSER_MOVABLE | __GFP_THISNODE, 1591 }; 1592 1593 err = migrate_pages(pagelist, alloc_migration_target, NULL, 1594 (unsigned long)&mtc, MIGRATE_SYNC, MR_SYSCALL, NULL); 1595 if (err) 1596 putback_movable_pages(pagelist); 1597 return err; 1598 } 1599 1600 /* 1601 * Resolves the given address to a struct page, isolates it from the LRU and 1602 * puts it to the given pagelist. 1603 * Returns: 1604 * errno - if the page cannot be found/isolated 1605 * 0 - when it doesn't have to be migrated because it is already on the 1606 * target node 1607 * 1 - when it has been queued 1608 */ 1609 static int add_page_for_migration(struct mm_struct *mm, unsigned long addr, 1610 int node, struct list_head *pagelist, bool migrate_all) 1611 { 1612 struct vm_area_struct *vma; 1613 struct page *page; 1614 unsigned int follflags; 1615 int err; 1616 1617 mmap_read_lock(mm); 1618 err = -EFAULT; 1619 vma = find_vma(mm, addr); 1620 if (!vma || addr < vma->vm_start || !vma_migratable(vma)) 1621 goto out; 1622 1623 /* FOLL_DUMP to ignore special (like zero) pages */ 1624 follflags = FOLL_GET | FOLL_DUMP; 1625 page = follow_page(vma, addr, follflags); 1626 1627 err = PTR_ERR(page); 1628 if (IS_ERR(page)) 1629 goto out; 1630 1631 err = -ENOENT; 1632 if (!page) 1633 goto out; 1634 1635 err = 0; 1636 if (page_to_nid(page) == node) 1637 goto out_putpage; 1638 1639 err = -EACCES; 1640 if (page_mapcount(page) > 1 && !migrate_all) 1641 goto out_putpage; 1642 1643 if (PageHuge(page)) { 1644 if (PageHead(page)) { 1645 isolate_huge_page(page, pagelist); 1646 err = 1; 1647 } 1648 } else { 1649 struct page *head; 1650 1651 head = compound_head(page); 1652 err = isolate_lru_page(head); 1653 if (err) 1654 goto out_putpage; 1655 1656 err = 1; 1657 list_add_tail(&head->lru, pagelist); 1658 mod_node_page_state(page_pgdat(head), 1659 NR_ISOLATED_ANON + page_is_file_lru(head), 1660 thp_nr_pages(head)); 1661 } 1662 out_putpage: 1663 /* 1664 * Either remove the duplicate refcount from 1665 * isolate_lru_page() or drop the page ref if it was 1666 * not isolated. 1667 */ 1668 put_page(page); 1669 out: 1670 mmap_read_unlock(mm); 1671 return err; 1672 } 1673 1674 static int move_pages_and_store_status(struct mm_struct *mm, int node, 1675 struct list_head *pagelist, int __user *status, 1676 int start, int i, unsigned long nr_pages) 1677 { 1678 int err; 1679 1680 if (list_empty(pagelist)) 1681 return 0; 1682 1683 err = do_move_pages_to_node(mm, pagelist, node); 1684 if (err) { 1685 /* 1686 * Positive err means the number of failed 1687 * pages to migrate. Since we are going to 1688 * abort and return the number of non-migrated 1689 * pages, so need to include the rest of the 1690 * nr_pages that have not been attempted as 1691 * well. 1692 */ 1693 if (err > 0) 1694 err += nr_pages - i - 1; 1695 return err; 1696 } 1697 return store_status(status, start, node, i - start); 1698 } 1699 1700 /* 1701 * Migrate an array of page address onto an array of nodes and fill 1702 * the corresponding array of status. 1703 */ 1704 static int do_pages_move(struct mm_struct *mm, nodemask_t task_nodes, 1705 unsigned long nr_pages, 1706 const void __user * __user *pages, 1707 const int __user *nodes, 1708 int __user *status, int flags) 1709 { 1710 int current_node = NUMA_NO_NODE; 1711 LIST_HEAD(pagelist); 1712 int start, i; 1713 int err = 0, err1; 1714 1715 lru_cache_disable(); 1716 1717 for (i = start = 0; i < nr_pages; i++) { 1718 const void __user *p; 1719 unsigned long addr; 1720 int node; 1721 1722 err = -EFAULT; 1723 if (get_user(p, pages + i)) 1724 goto out_flush; 1725 if (get_user(node, nodes + i)) 1726 goto out_flush; 1727 addr = (unsigned long)untagged_addr(p); 1728 1729 err = -ENODEV; 1730 if (node < 0 || node >= MAX_NUMNODES) 1731 goto out_flush; 1732 if (!node_state(node, N_MEMORY)) 1733 goto out_flush; 1734 1735 err = -EACCES; 1736 if (!node_isset(node, task_nodes)) 1737 goto out_flush; 1738 1739 if (current_node == NUMA_NO_NODE) { 1740 current_node = node; 1741 start = i; 1742 } else if (node != current_node) { 1743 err = move_pages_and_store_status(mm, current_node, 1744 &pagelist, status, start, i, nr_pages); 1745 if (err) 1746 goto out; 1747 start = i; 1748 current_node = node; 1749 } 1750 1751 /* 1752 * Errors in the page lookup or isolation are not fatal and we simply 1753 * report them via status 1754 */ 1755 err = add_page_for_migration(mm, addr, current_node, 1756 &pagelist, flags & MPOL_MF_MOVE_ALL); 1757 1758 if (err > 0) { 1759 /* The page is successfully queued for migration */ 1760 continue; 1761 } 1762 1763 /* 1764 * The move_pages() man page does not have an -EEXIST choice, so 1765 * use -EFAULT instead. 1766 */ 1767 if (err == -EEXIST) 1768 err = -EFAULT; 1769 1770 /* 1771 * If the page is already on the target node (!err), store the 1772 * node, otherwise, store the err. 1773 */ 1774 err = store_status(status, i, err ? : current_node, 1); 1775 if (err) 1776 goto out_flush; 1777 1778 err = move_pages_and_store_status(mm, current_node, &pagelist, 1779 status, start, i, nr_pages); 1780 if (err) 1781 goto out; 1782 current_node = NUMA_NO_NODE; 1783 } 1784 out_flush: 1785 /* Make sure we do not overwrite the existing error */ 1786 err1 = move_pages_and_store_status(mm, current_node, &pagelist, 1787 status, start, i, nr_pages); 1788 if (err >= 0) 1789 err = err1; 1790 out: 1791 lru_cache_enable(); 1792 return err; 1793 } 1794 1795 /* 1796 * Determine the nodes of an array of pages and store it in an array of status. 1797 */ 1798 static void do_pages_stat_array(struct mm_struct *mm, unsigned long nr_pages, 1799 const void __user **pages, int *status) 1800 { 1801 unsigned long i; 1802 1803 mmap_read_lock(mm); 1804 1805 for (i = 0; i < nr_pages; i++) { 1806 unsigned long addr = (unsigned long)(*pages); 1807 struct vm_area_struct *vma; 1808 struct page *page; 1809 int err = -EFAULT; 1810 1811 vma = vma_lookup(mm, addr); 1812 if (!vma) 1813 goto set_status; 1814 1815 /* FOLL_DUMP to ignore special (like zero) pages */ 1816 page = follow_page(vma, addr, FOLL_DUMP); 1817 1818 err = PTR_ERR(page); 1819 if (IS_ERR(page)) 1820 goto set_status; 1821 1822 err = page ? page_to_nid(page) : -ENOENT; 1823 set_status: 1824 *status = err; 1825 1826 pages++; 1827 status++; 1828 } 1829 1830 mmap_read_unlock(mm); 1831 } 1832 1833 static int get_compat_pages_array(const void __user *chunk_pages[], 1834 const void __user * __user *pages, 1835 unsigned long chunk_nr) 1836 { 1837 compat_uptr_t __user *pages32 = (compat_uptr_t __user *)pages; 1838 compat_uptr_t p; 1839 int i; 1840 1841 for (i = 0; i < chunk_nr; i++) { 1842 if (get_user(p, pages32 + i)) 1843 return -EFAULT; 1844 chunk_pages[i] = compat_ptr(p); 1845 } 1846 1847 return 0; 1848 } 1849 1850 /* 1851 * Determine the nodes of a user array of pages and store it in 1852 * a user array of status. 1853 */ 1854 static int do_pages_stat(struct mm_struct *mm, unsigned long nr_pages, 1855 const void __user * __user *pages, 1856 int __user *status) 1857 { 1858 #define DO_PAGES_STAT_CHUNK_NR 16 1859 const void __user *chunk_pages[DO_PAGES_STAT_CHUNK_NR]; 1860 int chunk_status[DO_PAGES_STAT_CHUNK_NR]; 1861 1862 while (nr_pages) { 1863 unsigned long chunk_nr; 1864 1865 chunk_nr = nr_pages; 1866 if (chunk_nr > DO_PAGES_STAT_CHUNK_NR) 1867 chunk_nr = DO_PAGES_STAT_CHUNK_NR; 1868 1869 if (in_compat_syscall()) { 1870 if (get_compat_pages_array(chunk_pages, pages, 1871 chunk_nr)) 1872 break; 1873 } else { 1874 if (copy_from_user(chunk_pages, pages, 1875 chunk_nr * sizeof(*chunk_pages))) 1876 break; 1877 } 1878 1879 do_pages_stat_array(mm, chunk_nr, chunk_pages, chunk_status); 1880 1881 if (copy_to_user(status, chunk_status, chunk_nr * sizeof(*status))) 1882 break; 1883 1884 pages += chunk_nr; 1885 status += chunk_nr; 1886 nr_pages -= chunk_nr; 1887 } 1888 return nr_pages ? -EFAULT : 0; 1889 } 1890 1891 static struct mm_struct *find_mm_struct(pid_t pid, nodemask_t *mem_nodes) 1892 { 1893 struct task_struct *task; 1894 struct mm_struct *mm; 1895 1896 /* 1897 * There is no need to check if current process has the right to modify 1898 * the specified process when they are same. 1899 */ 1900 if (!pid) { 1901 mmget(current->mm); 1902 *mem_nodes = cpuset_mems_allowed(current); 1903 return current->mm; 1904 } 1905 1906 /* Find the mm_struct */ 1907 rcu_read_lock(); 1908 task = find_task_by_vpid(pid); 1909 if (!task) { 1910 rcu_read_unlock(); 1911 return ERR_PTR(-ESRCH); 1912 } 1913 get_task_struct(task); 1914 1915 /* 1916 * Check if this process has the right to modify the specified 1917 * process. Use the regular "ptrace_may_access()" checks. 1918 */ 1919 if (!ptrace_may_access(task, PTRACE_MODE_READ_REALCREDS)) { 1920 rcu_read_unlock(); 1921 mm = ERR_PTR(-EPERM); 1922 goto out; 1923 } 1924 rcu_read_unlock(); 1925 1926 mm = ERR_PTR(security_task_movememory(task)); 1927 if (IS_ERR(mm)) 1928 goto out; 1929 *mem_nodes = cpuset_mems_allowed(task); 1930 mm = get_task_mm(task); 1931 out: 1932 put_task_struct(task); 1933 if (!mm) 1934 mm = ERR_PTR(-EINVAL); 1935 return mm; 1936 } 1937 1938 /* 1939 * Move a list of pages in the address space of the currently executing 1940 * process. 1941 */ 1942 static int kernel_move_pages(pid_t pid, unsigned long nr_pages, 1943 const void __user * __user *pages, 1944 const int __user *nodes, 1945 int __user *status, int flags) 1946 { 1947 struct mm_struct *mm; 1948 int err; 1949 nodemask_t task_nodes; 1950 1951 /* Check flags */ 1952 if (flags & ~(MPOL_MF_MOVE|MPOL_MF_MOVE_ALL)) 1953 return -EINVAL; 1954 1955 if ((flags & MPOL_MF_MOVE_ALL) && !capable(CAP_SYS_NICE)) 1956 return -EPERM; 1957 1958 mm = find_mm_struct(pid, &task_nodes); 1959 if (IS_ERR(mm)) 1960 return PTR_ERR(mm); 1961 1962 if (nodes) 1963 err = do_pages_move(mm, task_nodes, nr_pages, pages, 1964 nodes, status, flags); 1965 else 1966 err = do_pages_stat(mm, nr_pages, pages, status); 1967 1968 mmput(mm); 1969 return err; 1970 } 1971 1972 SYSCALL_DEFINE6(move_pages, pid_t, pid, unsigned long, nr_pages, 1973 const void __user * __user *, pages, 1974 const int __user *, nodes, 1975 int __user *, status, int, flags) 1976 { 1977 return kernel_move_pages(pid, nr_pages, pages, nodes, status, flags); 1978 } 1979 1980 #ifdef CONFIG_NUMA_BALANCING 1981 /* 1982 * Returns true if this is a safe migration target node for misplaced NUMA 1983 * pages. Currently it only checks the watermarks which crude 1984 */ 1985 static bool migrate_balanced_pgdat(struct pglist_data *pgdat, 1986 unsigned long nr_migrate_pages) 1987 { 1988 int z; 1989 1990 for (z = pgdat->nr_zones - 1; z >= 0; z--) { 1991 struct zone *zone = pgdat->node_zones + z; 1992 1993 if (!populated_zone(zone)) 1994 continue; 1995 1996 /* Avoid waking kswapd by allocating pages_to_migrate pages. */ 1997 if (!zone_watermark_ok(zone, 0, 1998 high_wmark_pages(zone) + 1999 nr_migrate_pages, 2000 ZONE_MOVABLE, 0)) 2001 continue; 2002 return true; 2003 } 2004 return false; 2005 } 2006 2007 static struct page *alloc_misplaced_dst_page(struct page *page, 2008 unsigned long data) 2009 { 2010 int nid = (int) data; 2011 struct page *newpage; 2012 2013 newpage = __alloc_pages_node(nid, 2014 (GFP_HIGHUSER_MOVABLE | 2015 __GFP_THISNODE | __GFP_NOMEMALLOC | 2016 __GFP_NORETRY | __GFP_NOWARN) & 2017 ~__GFP_RECLAIM, 0); 2018 2019 return newpage; 2020 } 2021 2022 static struct page *alloc_misplaced_dst_page_thp(struct page *page, 2023 unsigned long data) 2024 { 2025 int nid = (int) data; 2026 struct page *newpage; 2027 2028 newpage = alloc_pages_node(nid, (GFP_TRANSHUGE_LIGHT | __GFP_THISNODE), 2029 HPAGE_PMD_ORDER); 2030 if (!newpage) 2031 goto out; 2032 2033 prep_transhuge_page(newpage); 2034 2035 out: 2036 return newpage; 2037 } 2038 2039 static int numamigrate_isolate_page(pg_data_t *pgdat, struct page *page) 2040 { 2041 int page_lru; 2042 int nr_pages = thp_nr_pages(page); 2043 2044 VM_BUG_ON_PAGE(compound_order(page) && !PageTransHuge(page), page); 2045 2046 /* Do not migrate THP mapped by multiple processes */ 2047 if (PageTransHuge(page) && total_mapcount(page) > 1) 2048 return 0; 2049 2050 /* Avoid migrating to a node that is nearly full */ 2051 if (!migrate_balanced_pgdat(pgdat, nr_pages)) 2052 return 0; 2053 2054 if (isolate_lru_page(page)) 2055 return 0; 2056 2057 page_lru = page_is_file_lru(page); 2058 mod_node_page_state(page_pgdat(page), NR_ISOLATED_ANON + page_lru, 2059 nr_pages); 2060 2061 /* 2062 * Isolating the page has taken another reference, so the 2063 * caller's reference can be safely dropped without the page 2064 * disappearing underneath us during migration. 2065 */ 2066 put_page(page); 2067 return 1; 2068 } 2069 2070 /* 2071 * Attempt to migrate a misplaced page to the specified destination 2072 * node. Caller is expected to have an elevated reference count on 2073 * the page that will be dropped by this function before returning. 2074 */ 2075 int migrate_misplaced_page(struct page *page, struct vm_area_struct *vma, 2076 int node) 2077 { 2078 pg_data_t *pgdat = NODE_DATA(node); 2079 int isolated; 2080 int nr_remaining; 2081 LIST_HEAD(migratepages); 2082 new_page_t *new; 2083 bool compound; 2084 int nr_pages = thp_nr_pages(page); 2085 2086 /* 2087 * PTE mapped THP or HugeTLB page can't reach here so the page could 2088 * be either base page or THP. And it must be head page if it is 2089 * THP. 2090 */ 2091 compound = PageTransHuge(page); 2092 2093 if (compound) 2094 new = alloc_misplaced_dst_page_thp; 2095 else 2096 new = alloc_misplaced_dst_page; 2097 2098 /* 2099 * Don't migrate file pages that are mapped in multiple processes 2100 * with execute permissions as they are probably shared libraries. 2101 */ 2102 if (page_mapcount(page) != 1 && page_is_file_lru(page) && 2103 (vma->vm_flags & VM_EXEC)) 2104 goto out; 2105 2106 /* 2107 * Also do not migrate dirty pages as not all filesystems can move 2108 * dirty pages in MIGRATE_ASYNC mode which is a waste of cycles. 2109 */ 2110 if (page_is_file_lru(page) && PageDirty(page)) 2111 goto out; 2112 2113 isolated = numamigrate_isolate_page(pgdat, page); 2114 if (!isolated) 2115 goto out; 2116 2117 list_add(&page->lru, &migratepages); 2118 nr_remaining = migrate_pages(&migratepages, *new, NULL, node, 2119 MIGRATE_ASYNC, MR_NUMA_MISPLACED, NULL); 2120 if (nr_remaining) { 2121 if (!list_empty(&migratepages)) { 2122 list_del(&page->lru); 2123 mod_node_page_state(page_pgdat(page), NR_ISOLATED_ANON + 2124 page_is_file_lru(page), -nr_pages); 2125 putback_lru_page(page); 2126 } 2127 isolated = 0; 2128 } else 2129 count_vm_numa_events(NUMA_PAGE_MIGRATE, nr_pages); 2130 BUG_ON(!list_empty(&migratepages)); 2131 return isolated; 2132 2133 out: 2134 put_page(page); 2135 return 0; 2136 } 2137 #endif /* CONFIG_NUMA_BALANCING */ 2138 #endif /* CONFIG_NUMA */ 2139 2140 #ifdef CONFIG_DEVICE_PRIVATE 2141 static int migrate_vma_collect_skip(unsigned long start, 2142 unsigned long end, 2143 struct mm_walk *walk) 2144 { 2145 struct migrate_vma *migrate = walk->private; 2146 unsigned long addr; 2147 2148 for (addr = start; addr < end; addr += PAGE_SIZE) { 2149 migrate->dst[migrate->npages] = 0; 2150 migrate->src[migrate->npages++] = 0; 2151 } 2152 2153 return 0; 2154 } 2155 2156 static int migrate_vma_collect_hole(unsigned long start, 2157 unsigned long end, 2158 __always_unused int depth, 2159 struct mm_walk *walk) 2160 { 2161 struct migrate_vma *migrate = walk->private; 2162 unsigned long addr; 2163 2164 /* Only allow populating anonymous memory. */ 2165 if (!vma_is_anonymous(walk->vma)) 2166 return migrate_vma_collect_skip(start, end, walk); 2167 2168 for (addr = start; addr < end; addr += PAGE_SIZE) { 2169 migrate->src[migrate->npages] = MIGRATE_PFN_MIGRATE; 2170 migrate->dst[migrate->npages] = 0; 2171 migrate->npages++; 2172 migrate->cpages++; 2173 } 2174 2175 return 0; 2176 } 2177 2178 static int migrate_vma_collect_pmd(pmd_t *pmdp, 2179 unsigned long start, 2180 unsigned long end, 2181 struct mm_walk *walk) 2182 { 2183 struct migrate_vma *migrate = walk->private; 2184 struct vm_area_struct *vma = walk->vma; 2185 struct mm_struct *mm = vma->vm_mm; 2186 unsigned long addr = start, unmapped = 0; 2187 spinlock_t *ptl; 2188 pte_t *ptep; 2189 2190 again: 2191 if (pmd_none(*pmdp)) 2192 return migrate_vma_collect_hole(start, end, -1, walk); 2193 2194 if (pmd_trans_huge(*pmdp)) { 2195 struct page *page; 2196 2197 ptl = pmd_lock(mm, pmdp); 2198 if (unlikely(!pmd_trans_huge(*pmdp))) { 2199 spin_unlock(ptl); 2200 goto again; 2201 } 2202 2203 page = pmd_page(*pmdp); 2204 if (is_huge_zero_page(page)) { 2205 spin_unlock(ptl); 2206 split_huge_pmd(vma, pmdp, addr); 2207 if (pmd_trans_unstable(pmdp)) 2208 return migrate_vma_collect_skip(start, end, 2209 walk); 2210 } else { 2211 int ret; 2212 2213 get_page(page); 2214 spin_unlock(ptl); 2215 if (unlikely(!trylock_page(page))) 2216 return migrate_vma_collect_skip(start, end, 2217 walk); 2218 ret = split_huge_page(page); 2219 unlock_page(page); 2220 put_page(page); 2221 if (ret) 2222 return migrate_vma_collect_skip(start, end, 2223 walk); 2224 if (pmd_none(*pmdp)) 2225 return migrate_vma_collect_hole(start, end, -1, 2226 walk); 2227 } 2228 } 2229 2230 if (unlikely(pmd_bad(*pmdp))) 2231 return migrate_vma_collect_skip(start, end, walk); 2232 2233 ptep = pte_offset_map_lock(mm, pmdp, addr, &ptl); 2234 arch_enter_lazy_mmu_mode(); 2235 2236 for (; addr < end; addr += PAGE_SIZE, ptep++) { 2237 unsigned long mpfn = 0, pfn; 2238 struct page *page; 2239 swp_entry_t entry; 2240 pte_t pte; 2241 2242 pte = *ptep; 2243 2244 if (pte_none(pte)) { 2245 if (vma_is_anonymous(vma)) { 2246 mpfn = MIGRATE_PFN_MIGRATE; 2247 migrate->cpages++; 2248 } 2249 goto next; 2250 } 2251 2252 if (!pte_present(pte)) { 2253 /* 2254 * Only care about unaddressable device page special 2255 * page table entry. Other special swap entries are not 2256 * migratable, and we ignore regular swapped page. 2257 */ 2258 entry = pte_to_swp_entry(pte); 2259 if (!is_device_private_entry(entry)) 2260 goto next; 2261 2262 page = pfn_swap_entry_to_page(entry); 2263 if (!(migrate->flags & 2264 MIGRATE_VMA_SELECT_DEVICE_PRIVATE) || 2265 page->pgmap->owner != migrate->pgmap_owner) 2266 goto next; 2267 2268 mpfn = migrate_pfn(page_to_pfn(page)) | 2269 MIGRATE_PFN_MIGRATE; 2270 if (is_writable_device_private_entry(entry)) 2271 mpfn |= MIGRATE_PFN_WRITE; 2272 } else { 2273 if (!(migrate->flags & MIGRATE_VMA_SELECT_SYSTEM)) 2274 goto next; 2275 pfn = pte_pfn(pte); 2276 if (is_zero_pfn(pfn)) { 2277 mpfn = MIGRATE_PFN_MIGRATE; 2278 migrate->cpages++; 2279 goto next; 2280 } 2281 page = vm_normal_page(migrate->vma, addr, pte); 2282 mpfn = migrate_pfn(pfn) | MIGRATE_PFN_MIGRATE; 2283 mpfn |= pte_write(pte) ? MIGRATE_PFN_WRITE : 0; 2284 } 2285 2286 /* FIXME support THP */ 2287 if (!page || !page->mapping || PageTransCompound(page)) { 2288 mpfn = 0; 2289 goto next; 2290 } 2291 2292 /* 2293 * By getting a reference on the page we pin it and that blocks 2294 * any kind of migration. Side effect is that it "freezes" the 2295 * pte. 2296 * 2297 * We drop this reference after isolating the page from the lru 2298 * for non device page (device page are not on the lru and thus 2299 * can't be dropped from it). 2300 */ 2301 get_page(page); 2302 2303 /* 2304 * Optimize for the common case where page is only mapped once 2305 * in one process. If we can lock the page, then we can safely 2306 * set up a special migration page table entry now. 2307 */ 2308 if (trylock_page(page)) { 2309 pte_t swp_pte; 2310 2311 migrate->cpages++; 2312 ptep_get_and_clear(mm, addr, ptep); 2313 2314 /* Setup special migration page table entry */ 2315 if (mpfn & MIGRATE_PFN_WRITE) 2316 entry = make_writable_migration_entry( 2317 page_to_pfn(page)); 2318 else 2319 entry = make_readable_migration_entry( 2320 page_to_pfn(page)); 2321 swp_pte = swp_entry_to_pte(entry); 2322 if (pte_present(pte)) { 2323 if (pte_soft_dirty(pte)) 2324 swp_pte = pte_swp_mksoft_dirty(swp_pte); 2325 if (pte_uffd_wp(pte)) 2326 swp_pte = pte_swp_mkuffd_wp(swp_pte); 2327 } else { 2328 if (pte_swp_soft_dirty(pte)) 2329 swp_pte = pte_swp_mksoft_dirty(swp_pte); 2330 if (pte_swp_uffd_wp(pte)) 2331 swp_pte = pte_swp_mkuffd_wp(swp_pte); 2332 } 2333 set_pte_at(mm, addr, ptep, swp_pte); 2334 2335 /* 2336 * This is like regular unmap: we remove the rmap and 2337 * drop page refcount. Page won't be freed, as we took 2338 * a reference just above. 2339 */ 2340 page_remove_rmap(page, false); 2341 put_page(page); 2342 2343 if (pte_present(pte)) 2344 unmapped++; 2345 } else { 2346 put_page(page); 2347 mpfn = 0; 2348 } 2349 2350 next: 2351 migrate->dst[migrate->npages] = 0; 2352 migrate->src[migrate->npages++] = mpfn; 2353 } 2354 arch_leave_lazy_mmu_mode(); 2355 pte_unmap_unlock(ptep - 1, ptl); 2356 2357 /* Only flush the TLB if we actually modified any entries */ 2358 if (unmapped) 2359 flush_tlb_range(walk->vma, start, end); 2360 2361 return 0; 2362 } 2363 2364 static const struct mm_walk_ops migrate_vma_walk_ops = { 2365 .pmd_entry = migrate_vma_collect_pmd, 2366 .pte_hole = migrate_vma_collect_hole, 2367 }; 2368 2369 /* 2370 * migrate_vma_collect() - collect pages over a range of virtual addresses 2371 * @migrate: migrate struct containing all migration information 2372 * 2373 * This will walk the CPU page table. For each virtual address backed by a 2374 * valid page, it updates the src array and takes a reference on the page, in 2375 * order to pin the page until we lock it and unmap it. 2376 */ 2377 static void migrate_vma_collect(struct migrate_vma *migrate) 2378 { 2379 struct mmu_notifier_range range; 2380 2381 /* 2382 * Note that the pgmap_owner is passed to the mmu notifier callback so 2383 * that the registered device driver can skip invalidating device 2384 * private page mappings that won't be migrated. 2385 */ 2386 mmu_notifier_range_init_owner(&range, MMU_NOTIFY_MIGRATE, 0, 2387 migrate->vma, migrate->vma->vm_mm, migrate->start, migrate->end, 2388 migrate->pgmap_owner); 2389 mmu_notifier_invalidate_range_start(&range); 2390 2391 walk_page_range(migrate->vma->vm_mm, migrate->start, migrate->end, 2392 &migrate_vma_walk_ops, migrate); 2393 2394 mmu_notifier_invalidate_range_end(&range); 2395 migrate->end = migrate->start + (migrate->npages << PAGE_SHIFT); 2396 } 2397 2398 /* 2399 * migrate_vma_check_page() - check if page is pinned or not 2400 * @page: struct page to check 2401 * 2402 * Pinned pages cannot be migrated. This is the same test as in 2403 * folio_migrate_mapping(), except that here we allow migration of a 2404 * ZONE_DEVICE page. 2405 */ 2406 static bool migrate_vma_check_page(struct page *page) 2407 { 2408 /* 2409 * One extra ref because caller holds an extra reference, either from 2410 * isolate_lru_page() for a regular page, or migrate_vma_collect() for 2411 * a device page. 2412 */ 2413 int extra = 1; 2414 2415 /* 2416 * FIXME support THP (transparent huge page), it is bit more complex to 2417 * check them than regular pages, because they can be mapped with a pmd 2418 * or with a pte (split pte mapping). 2419 */ 2420 if (PageCompound(page)) 2421 return false; 2422 2423 /* Page from ZONE_DEVICE have one extra reference */ 2424 if (is_zone_device_page(page)) 2425 extra++; 2426 2427 /* For file back page */ 2428 if (page_mapping(page)) 2429 extra += 1 + page_has_private(page); 2430 2431 if ((page_count(page) - extra) > page_mapcount(page)) 2432 return false; 2433 2434 return true; 2435 } 2436 2437 /* 2438 * migrate_vma_unmap() - replace page mapping with special migration pte entry 2439 * @migrate: migrate struct containing all migration information 2440 * 2441 * Isolate pages from the LRU and replace mappings (CPU page table pte) with a 2442 * special migration pte entry and check if it has been pinned. Pinned pages are 2443 * restored because we cannot migrate them. 2444 * 2445 * This is the last step before we call the device driver callback to allocate 2446 * destination memory and copy contents of original page over to new page. 2447 */ 2448 static void migrate_vma_unmap(struct migrate_vma *migrate) 2449 { 2450 const unsigned long npages = migrate->npages; 2451 unsigned long i, restore = 0; 2452 bool allow_drain = true; 2453 2454 lru_add_drain(); 2455 2456 for (i = 0; i < npages; i++) { 2457 struct page *page = migrate_pfn_to_page(migrate->src[i]); 2458 2459 if (!page) 2460 continue; 2461 2462 /* ZONE_DEVICE pages are not on LRU */ 2463 if (!is_zone_device_page(page)) { 2464 if (!PageLRU(page) && allow_drain) { 2465 /* Drain CPU's pagevec */ 2466 lru_add_drain_all(); 2467 allow_drain = false; 2468 } 2469 2470 if (isolate_lru_page(page)) { 2471 migrate->src[i] &= ~MIGRATE_PFN_MIGRATE; 2472 migrate->cpages--; 2473 restore++; 2474 continue; 2475 } 2476 2477 /* Drop the reference we took in collect */ 2478 put_page(page); 2479 } 2480 2481 if (page_mapped(page)) 2482 try_to_migrate(page, 0); 2483 2484 if (page_mapped(page) || !migrate_vma_check_page(page)) { 2485 if (!is_zone_device_page(page)) { 2486 get_page(page); 2487 putback_lru_page(page); 2488 } 2489 2490 migrate->src[i] &= ~MIGRATE_PFN_MIGRATE; 2491 migrate->cpages--; 2492 restore++; 2493 continue; 2494 } 2495 } 2496 2497 for (i = 0; i < npages && restore; i++) { 2498 struct page *page = migrate_pfn_to_page(migrate->src[i]); 2499 2500 if (!page || (migrate->src[i] & MIGRATE_PFN_MIGRATE)) 2501 continue; 2502 2503 remove_migration_ptes(page, page, false); 2504 2505 migrate->src[i] = 0; 2506 unlock_page(page); 2507 put_page(page); 2508 restore--; 2509 } 2510 } 2511 2512 /** 2513 * migrate_vma_setup() - prepare to migrate a range of memory 2514 * @args: contains the vma, start, and pfns arrays for the migration 2515 * 2516 * Returns: negative errno on failures, 0 when 0 or more pages were migrated 2517 * without an error. 2518 * 2519 * Prepare to migrate a range of memory virtual address range by collecting all 2520 * the pages backing each virtual address in the range, saving them inside the 2521 * src array. Then lock those pages and unmap them. Once the pages are locked 2522 * and unmapped, check whether each page is pinned or not. Pages that aren't 2523 * pinned have the MIGRATE_PFN_MIGRATE flag set (by this function) in the 2524 * corresponding src array entry. Then restores any pages that are pinned, by 2525 * remapping and unlocking those pages. 2526 * 2527 * The caller should then allocate destination memory and copy source memory to 2528 * it for all those entries (ie with MIGRATE_PFN_VALID and MIGRATE_PFN_MIGRATE 2529 * flag set). Once these are allocated and copied, the caller must update each 2530 * corresponding entry in the dst array with the pfn value of the destination 2531 * page and with MIGRATE_PFN_VALID. Destination pages must be locked via 2532 * lock_page(). 2533 * 2534 * Note that the caller does not have to migrate all the pages that are marked 2535 * with MIGRATE_PFN_MIGRATE flag in src array unless this is a migration from 2536 * device memory to system memory. If the caller cannot migrate a device page 2537 * back to system memory, then it must return VM_FAULT_SIGBUS, which has severe 2538 * consequences for the userspace process, so it must be avoided if at all 2539 * possible. 2540 * 2541 * For empty entries inside CPU page table (pte_none() or pmd_none() is true) we 2542 * do set MIGRATE_PFN_MIGRATE flag inside the corresponding source array thus 2543 * allowing the caller to allocate device memory for those unbacked virtual 2544 * addresses. For this the caller simply has to allocate device memory and 2545 * properly set the destination entry like for regular migration. Note that 2546 * this can still fail, and thus inside the device driver you must check if the 2547 * migration was successful for those entries after calling migrate_vma_pages(), 2548 * just like for regular migration. 2549 * 2550 * After that, the callers must call migrate_vma_pages() to go over each entry 2551 * in the src array that has the MIGRATE_PFN_VALID and MIGRATE_PFN_MIGRATE flag 2552 * set. If the corresponding entry in dst array has MIGRATE_PFN_VALID flag set, 2553 * then migrate_vma_pages() to migrate struct page information from the source 2554 * struct page to the destination struct page. If it fails to migrate the 2555 * struct page information, then it clears the MIGRATE_PFN_MIGRATE flag in the 2556 * src array. 2557 * 2558 * At this point all successfully migrated pages have an entry in the src 2559 * array with MIGRATE_PFN_VALID and MIGRATE_PFN_MIGRATE flag set and the dst 2560 * array entry with MIGRATE_PFN_VALID flag set. 2561 * 2562 * Once migrate_vma_pages() returns the caller may inspect which pages were 2563 * successfully migrated, and which were not. Successfully migrated pages will 2564 * have the MIGRATE_PFN_MIGRATE flag set for their src array entry. 2565 * 2566 * It is safe to update device page table after migrate_vma_pages() because 2567 * both destination and source page are still locked, and the mmap_lock is held 2568 * in read mode (hence no one can unmap the range being migrated). 2569 * 2570 * Once the caller is done cleaning up things and updating its page table (if it 2571 * chose to do so, this is not an obligation) it finally calls 2572 * migrate_vma_finalize() to update the CPU page table to point to new pages 2573 * for successfully migrated pages or otherwise restore the CPU page table to 2574 * point to the original source pages. 2575 */ 2576 int migrate_vma_setup(struct migrate_vma *args) 2577 { 2578 long nr_pages = (args->end - args->start) >> PAGE_SHIFT; 2579 2580 args->start &= PAGE_MASK; 2581 args->end &= PAGE_MASK; 2582 if (!args->vma || is_vm_hugetlb_page(args->vma) || 2583 (args->vma->vm_flags & VM_SPECIAL) || vma_is_dax(args->vma)) 2584 return -EINVAL; 2585 if (nr_pages <= 0) 2586 return -EINVAL; 2587 if (args->start < args->vma->vm_start || 2588 args->start >= args->vma->vm_end) 2589 return -EINVAL; 2590 if (args->end <= args->vma->vm_start || args->end > args->vma->vm_end) 2591 return -EINVAL; 2592 if (!args->src || !args->dst) 2593 return -EINVAL; 2594 2595 memset(args->src, 0, sizeof(*args->src) * nr_pages); 2596 args->cpages = 0; 2597 args->npages = 0; 2598 2599 migrate_vma_collect(args); 2600 2601 if (args->cpages) 2602 migrate_vma_unmap(args); 2603 2604 /* 2605 * At this point pages are locked and unmapped, and thus they have 2606 * stable content and can safely be copied to destination memory that 2607 * is allocated by the drivers. 2608 */ 2609 return 0; 2610 2611 } 2612 EXPORT_SYMBOL(migrate_vma_setup); 2613 2614 /* 2615 * This code closely matches the code in: 2616 * __handle_mm_fault() 2617 * handle_pte_fault() 2618 * do_anonymous_page() 2619 * to map in an anonymous zero page but the struct page will be a ZONE_DEVICE 2620 * private page. 2621 */ 2622 static void migrate_vma_insert_page(struct migrate_vma *migrate, 2623 unsigned long addr, 2624 struct page *page, 2625 unsigned long *src) 2626 { 2627 struct vm_area_struct *vma = migrate->vma; 2628 struct mm_struct *mm = vma->vm_mm; 2629 bool flush = false; 2630 spinlock_t *ptl; 2631 pte_t entry; 2632 pgd_t *pgdp; 2633 p4d_t *p4dp; 2634 pud_t *pudp; 2635 pmd_t *pmdp; 2636 pte_t *ptep; 2637 2638 /* Only allow populating anonymous memory */ 2639 if (!vma_is_anonymous(vma)) 2640 goto abort; 2641 2642 pgdp = pgd_offset(mm, addr); 2643 p4dp = p4d_alloc(mm, pgdp, addr); 2644 if (!p4dp) 2645 goto abort; 2646 pudp = pud_alloc(mm, p4dp, addr); 2647 if (!pudp) 2648 goto abort; 2649 pmdp = pmd_alloc(mm, pudp, addr); 2650 if (!pmdp) 2651 goto abort; 2652 2653 if (pmd_trans_huge(*pmdp) || pmd_devmap(*pmdp)) 2654 goto abort; 2655 2656 /* 2657 * Use pte_alloc() instead of pte_alloc_map(). We can't run 2658 * pte_offset_map() on pmds where a huge pmd might be created 2659 * from a different thread. 2660 * 2661 * pte_alloc_map() is safe to use under mmap_write_lock(mm) or when 2662 * parallel threads are excluded by other means. 2663 * 2664 * Here we only have mmap_read_lock(mm). 2665 */ 2666 if (pte_alloc(mm, pmdp)) 2667 goto abort; 2668 2669 /* See the comment in pte_alloc_one_map() */ 2670 if (unlikely(pmd_trans_unstable(pmdp))) 2671 goto abort; 2672 2673 if (unlikely(anon_vma_prepare(vma))) 2674 goto abort; 2675 if (mem_cgroup_charge(page_folio(page), vma->vm_mm, GFP_KERNEL)) 2676 goto abort; 2677 2678 /* 2679 * The memory barrier inside __SetPageUptodate makes sure that 2680 * preceding stores to the page contents become visible before 2681 * the set_pte_at() write. 2682 */ 2683 __SetPageUptodate(page); 2684 2685 if (is_zone_device_page(page)) { 2686 if (is_device_private_page(page)) { 2687 swp_entry_t swp_entry; 2688 2689 if (vma->vm_flags & VM_WRITE) 2690 swp_entry = make_writable_device_private_entry( 2691 page_to_pfn(page)); 2692 else 2693 swp_entry = make_readable_device_private_entry( 2694 page_to_pfn(page)); 2695 entry = swp_entry_to_pte(swp_entry); 2696 } else { 2697 /* 2698 * For now we only support migrating to un-addressable 2699 * device memory. 2700 */ 2701 pr_warn_once("Unsupported ZONE_DEVICE page type.\n"); 2702 goto abort; 2703 } 2704 } else { 2705 entry = mk_pte(page, vma->vm_page_prot); 2706 if (vma->vm_flags & VM_WRITE) 2707 entry = pte_mkwrite(pte_mkdirty(entry)); 2708 } 2709 2710 ptep = pte_offset_map_lock(mm, pmdp, addr, &ptl); 2711 2712 if (check_stable_address_space(mm)) 2713 goto unlock_abort; 2714 2715 if (pte_present(*ptep)) { 2716 unsigned long pfn = pte_pfn(*ptep); 2717 2718 if (!is_zero_pfn(pfn)) 2719 goto unlock_abort; 2720 flush = true; 2721 } else if (!pte_none(*ptep)) 2722 goto unlock_abort; 2723 2724 /* 2725 * Check for userfaultfd but do not deliver the fault. Instead, 2726 * just back off. 2727 */ 2728 if (userfaultfd_missing(vma)) 2729 goto unlock_abort; 2730 2731 inc_mm_counter(mm, MM_ANONPAGES); 2732 page_add_new_anon_rmap(page, vma, addr, false); 2733 if (!is_zone_device_page(page)) 2734 lru_cache_add_inactive_or_unevictable(page, vma); 2735 get_page(page); 2736 2737 if (flush) { 2738 flush_cache_page(vma, addr, pte_pfn(*ptep)); 2739 ptep_clear_flush_notify(vma, addr, ptep); 2740 set_pte_at_notify(mm, addr, ptep, entry); 2741 update_mmu_cache(vma, addr, ptep); 2742 } else { 2743 /* No need to invalidate - it was non-present before */ 2744 set_pte_at(mm, addr, ptep, entry); 2745 update_mmu_cache(vma, addr, ptep); 2746 } 2747 2748 pte_unmap_unlock(ptep, ptl); 2749 *src = MIGRATE_PFN_MIGRATE; 2750 return; 2751 2752 unlock_abort: 2753 pte_unmap_unlock(ptep, ptl); 2754 abort: 2755 *src &= ~MIGRATE_PFN_MIGRATE; 2756 } 2757 2758 /** 2759 * migrate_vma_pages() - migrate meta-data from src page to dst page 2760 * @migrate: migrate struct containing all migration information 2761 * 2762 * This migrates struct page meta-data from source struct page to destination 2763 * struct page. This effectively finishes the migration from source page to the 2764 * destination page. 2765 */ 2766 void migrate_vma_pages(struct migrate_vma *migrate) 2767 { 2768 const unsigned long npages = migrate->npages; 2769 const unsigned long start = migrate->start; 2770 struct mmu_notifier_range range; 2771 unsigned long addr, i; 2772 bool notified = false; 2773 2774 for (i = 0, addr = start; i < npages; addr += PAGE_SIZE, i++) { 2775 struct page *newpage = migrate_pfn_to_page(migrate->dst[i]); 2776 struct page *page = migrate_pfn_to_page(migrate->src[i]); 2777 struct address_space *mapping; 2778 int r; 2779 2780 if (!newpage) { 2781 migrate->src[i] &= ~MIGRATE_PFN_MIGRATE; 2782 continue; 2783 } 2784 2785 if (!page) { 2786 if (!(migrate->src[i] & MIGRATE_PFN_MIGRATE)) 2787 continue; 2788 if (!notified) { 2789 notified = true; 2790 2791 mmu_notifier_range_init_owner(&range, 2792 MMU_NOTIFY_MIGRATE, 0, migrate->vma, 2793 migrate->vma->vm_mm, addr, migrate->end, 2794 migrate->pgmap_owner); 2795 mmu_notifier_invalidate_range_start(&range); 2796 } 2797 migrate_vma_insert_page(migrate, addr, newpage, 2798 &migrate->src[i]); 2799 continue; 2800 } 2801 2802 mapping = page_mapping(page); 2803 2804 if (is_zone_device_page(newpage)) { 2805 if (is_device_private_page(newpage)) { 2806 /* 2807 * For now only support private anonymous when 2808 * migrating to un-addressable device memory. 2809 */ 2810 if (mapping) { 2811 migrate->src[i] &= ~MIGRATE_PFN_MIGRATE; 2812 continue; 2813 } 2814 } else { 2815 /* 2816 * Other types of ZONE_DEVICE page are not 2817 * supported. 2818 */ 2819 migrate->src[i] &= ~MIGRATE_PFN_MIGRATE; 2820 continue; 2821 } 2822 } 2823 2824 r = migrate_page(mapping, newpage, page, MIGRATE_SYNC_NO_COPY); 2825 if (r != MIGRATEPAGE_SUCCESS) 2826 migrate->src[i] &= ~MIGRATE_PFN_MIGRATE; 2827 } 2828 2829 /* 2830 * No need to double call mmu_notifier->invalidate_range() callback as 2831 * the above ptep_clear_flush_notify() inside migrate_vma_insert_page() 2832 * did already call it. 2833 */ 2834 if (notified) 2835 mmu_notifier_invalidate_range_only_end(&range); 2836 } 2837 EXPORT_SYMBOL(migrate_vma_pages); 2838 2839 /** 2840 * migrate_vma_finalize() - restore CPU page table entry 2841 * @migrate: migrate struct containing all migration information 2842 * 2843 * This replaces the special migration pte entry with either a mapping to the 2844 * new page if migration was successful for that page, or to the original page 2845 * otherwise. 2846 * 2847 * This also unlocks the pages and puts them back on the lru, or drops the extra 2848 * refcount, for device pages. 2849 */ 2850 void migrate_vma_finalize(struct migrate_vma *migrate) 2851 { 2852 const unsigned long npages = migrate->npages; 2853 unsigned long i; 2854 2855 for (i = 0; i < npages; i++) { 2856 struct page *newpage = migrate_pfn_to_page(migrate->dst[i]); 2857 struct page *page = migrate_pfn_to_page(migrate->src[i]); 2858 2859 if (!page) { 2860 if (newpage) { 2861 unlock_page(newpage); 2862 put_page(newpage); 2863 } 2864 continue; 2865 } 2866 2867 if (!(migrate->src[i] & MIGRATE_PFN_MIGRATE) || !newpage) { 2868 if (newpage) { 2869 unlock_page(newpage); 2870 put_page(newpage); 2871 } 2872 newpage = page; 2873 } 2874 2875 remove_migration_ptes(page, newpage, false); 2876 unlock_page(page); 2877 2878 if (is_zone_device_page(page)) 2879 put_page(page); 2880 else 2881 putback_lru_page(page); 2882 2883 if (newpage != page) { 2884 unlock_page(newpage); 2885 if (is_zone_device_page(newpage)) 2886 put_page(newpage); 2887 else 2888 putback_lru_page(newpage); 2889 } 2890 } 2891 } 2892 EXPORT_SYMBOL(migrate_vma_finalize); 2893 #endif /* CONFIG_DEVICE_PRIVATE */ 2894 2895 /* 2896 * node_demotion[] example: 2897 * 2898 * Consider a system with two sockets. Each socket has 2899 * three classes of memory attached: fast, medium and slow. 2900 * Each memory class is placed in its own NUMA node. The 2901 * CPUs are placed in the node with the "fast" memory. The 2902 * 6 NUMA nodes (0-5) might be split among the sockets like 2903 * this: 2904 * 2905 * Socket A: 0, 1, 2 2906 * Socket B: 3, 4, 5 2907 * 2908 * When Node 0 fills up, its memory should be migrated to 2909 * Node 1. When Node 1 fills up, it should be migrated to 2910 * Node 2. The migration path start on the nodes with the 2911 * processors (since allocations default to this node) and 2912 * fast memory, progress through medium and end with the 2913 * slow memory: 2914 * 2915 * 0 -> 1 -> 2 -> stop 2916 * 3 -> 4 -> 5 -> stop 2917 * 2918 * This is represented in the node_demotion[] like this: 2919 * 2920 * { nr=1, nodes[0]=1 }, // Node 0 migrates to 1 2921 * { nr=1, nodes[0]=2 }, // Node 1 migrates to 2 2922 * { nr=0, nodes[0]=-1 }, // Node 2 does not migrate 2923 * { nr=1, nodes[0]=4 }, // Node 3 migrates to 4 2924 * { nr=1, nodes[0]=5 }, // Node 4 migrates to 5 2925 * { nr=0, nodes[0]=-1 }, // Node 5 does not migrate 2926 * 2927 * Moreover some systems may have multiple slow memory nodes. 2928 * Suppose a system has one socket with 3 memory nodes, node 0 2929 * is fast memory type, and node 1/2 both are slow memory 2930 * type, and the distance between fast memory node and slow 2931 * memory node is same. So the migration path should be: 2932 * 2933 * 0 -> 1/2 -> stop 2934 * 2935 * This is represented in the node_demotion[] like this: 2936 * { nr=2, {nodes[0]=1, nodes[1]=2} }, // Node 0 migrates to node 1 and node 2 2937 * { nr=0, nodes[0]=-1, }, // Node 1 dose not migrate 2938 * { nr=0, nodes[0]=-1, }, // Node 2 does not migrate 2939 */ 2940 2941 /* 2942 * Writes to this array occur without locking. Cycles are 2943 * not allowed: Node X demotes to Y which demotes to X... 2944 * 2945 * If multiple reads are performed, a single rcu_read_lock() 2946 * must be held over all reads to ensure that no cycles are 2947 * observed. 2948 */ 2949 #define DEFAULT_DEMOTION_TARGET_NODES 15 2950 2951 #if MAX_NUMNODES < DEFAULT_DEMOTION_TARGET_NODES 2952 #define DEMOTION_TARGET_NODES (MAX_NUMNODES - 1) 2953 #else 2954 #define DEMOTION_TARGET_NODES DEFAULT_DEMOTION_TARGET_NODES 2955 #endif 2956 2957 struct demotion_nodes { 2958 unsigned short nr; 2959 short nodes[DEMOTION_TARGET_NODES]; 2960 }; 2961 2962 static struct demotion_nodes *node_demotion __read_mostly; 2963 2964 /** 2965 * next_demotion_node() - Get the next node in the demotion path 2966 * @node: The starting node to lookup the next node 2967 * 2968 * Return: node id for next memory node in the demotion path hierarchy 2969 * from @node; NUMA_NO_NODE if @node is terminal. This does not keep 2970 * @node online or guarantee that it *continues* to be the next demotion 2971 * target. 2972 */ 2973 int next_demotion_node(int node) 2974 { 2975 struct demotion_nodes *nd; 2976 unsigned short target_nr, index; 2977 int target; 2978 2979 if (!node_demotion) 2980 return NUMA_NO_NODE; 2981 2982 nd = &node_demotion[node]; 2983 2984 /* 2985 * node_demotion[] is updated without excluding this 2986 * function from running. RCU doesn't provide any 2987 * compiler barriers, so the READ_ONCE() is required 2988 * to avoid compiler reordering or read merging. 2989 * 2990 * Make sure to use RCU over entire code blocks if 2991 * node_demotion[] reads need to be consistent. 2992 */ 2993 rcu_read_lock(); 2994 target_nr = READ_ONCE(nd->nr); 2995 2996 switch (target_nr) { 2997 case 0: 2998 target = NUMA_NO_NODE; 2999 goto out; 3000 case 1: 3001 index = 0; 3002 break; 3003 default: 3004 /* 3005 * If there are multiple target nodes, just select one 3006 * target node randomly. 3007 * 3008 * In addition, we can also use round-robin to select 3009 * target node, but we should introduce another variable 3010 * for node_demotion[] to record last selected target node, 3011 * that may cause cache ping-pong due to the changing of 3012 * last target node. Or introducing per-cpu data to avoid 3013 * caching issue, which seems more complicated. So selecting 3014 * target node randomly seems better until now. 3015 */ 3016 index = get_random_int() % target_nr; 3017 break; 3018 } 3019 3020 target = READ_ONCE(nd->nodes[index]); 3021 3022 out: 3023 rcu_read_unlock(); 3024 return target; 3025 } 3026 3027 #if defined(CONFIG_HOTPLUG_CPU) 3028 /* Disable reclaim-based migration. */ 3029 static void __disable_all_migrate_targets(void) 3030 { 3031 int node, i; 3032 3033 if (!node_demotion) 3034 return; 3035 3036 for_each_online_node(node) { 3037 node_demotion[node].nr = 0; 3038 for (i = 0; i < DEMOTION_TARGET_NODES; i++) 3039 node_demotion[node].nodes[i] = NUMA_NO_NODE; 3040 } 3041 } 3042 3043 static void disable_all_migrate_targets(void) 3044 { 3045 __disable_all_migrate_targets(); 3046 3047 /* 3048 * Ensure that the "disable" is visible across the system. 3049 * Readers will see either a combination of before+disable 3050 * state or disable+after. They will never see before and 3051 * after state together. 3052 * 3053 * The before+after state together might have cycles and 3054 * could cause readers to do things like loop until this 3055 * function finishes. This ensures they can only see a 3056 * single "bad" read and would, for instance, only loop 3057 * once. 3058 */ 3059 synchronize_rcu(); 3060 } 3061 3062 /* 3063 * Find an automatic demotion target for 'node'. 3064 * Failing here is OK. It might just indicate 3065 * being at the end of a chain. 3066 */ 3067 static int establish_migrate_target(int node, nodemask_t *used, 3068 int best_distance) 3069 { 3070 int migration_target, index, val; 3071 struct demotion_nodes *nd; 3072 3073 if (!node_demotion) 3074 return NUMA_NO_NODE; 3075 3076 nd = &node_demotion[node]; 3077 3078 migration_target = find_next_best_node(node, used); 3079 if (migration_target == NUMA_NO_NODE) 3080 return NUMA_NO_NODE; 3081 3082 /* 3083 * If the node has been set a migration target node before, 3084 * which means it's the best distance between them. Still 3085 * check if this node can be demoted to other target nodes 3086 * if they have a same best distance. 3087 */ 3088 if (best_distance != -1) { 3089 val = node_distance(node, migration_target); 3090 if (val > best_distance) 3091 return NUMA_NO_NODE; 3092 } 3093 3094 index = nd->nr; 3095 if (WARN_ONCE(index >= DEMOTION_TARGET_NODES, 3096 "Exceeds maximum demotion target nodes\n")) 3097 return NUMA_NO_NODE; 3098 3099 nd->nodes[index] = migration_target; 3100 nd->nr++; 3101 3102 return migration_target; 3103 } 3104 3105 /* 3106 * When memory fills up on a node, memory contents can be 3107 * automatically migrated to another node instead of 3108 * discarded at reclaim. 3109 * 3110 * Establish a "migration path" which will start at nodes 3111 * with CPUs and will follow the priorities used to build the 3112 * page allocator zonelists. 3113 * 3114 * The difference here is that cycles must be avoided. If 3115 * node0 migrates to node1, then neither node1, nor anything 3116 * node1 migrates to can migrate to node0. Also one node can 3117 * be migrated to multiple nodes if the target nodes all have 3118 * a same best-distance against the source node. 3119 * 3120 * This function can run simultaneously with readers of 3121 * node_demotion[]. However, it can not run simultaneously 3122 * with itself. Exclusion is provided by memory hotplug events 3123 * being single-threaded. 3124 */ 3125 static void __set_migration_target_nodes(void) 3126 { 3127 nodemask_t next_pass = NODE_MASK_NONE; 3128 nodemask_t this_pass = NODE_MASK_NONE; 3129 nodemask_t used_targets = NODE_MASK_NONE; 3130 int node, best_distance; 3131 3132 /* 3133 * Avoid any oddities like cycles that could occur 3134 * from changes in the topology. This will leave 3135 * a momentary gap when migration is disabled. 3136 */ 3137 disable_all_migrate_targets(); 3138 3139 /* 3140 * Allocations go close to CPUs, first. Assume that 3141 * the migration path starts at the nodes with CPUs. 3142 */ 3143 next_pass = node_states[N_CPU]; 3144 again: 3145 this_pass = next_pass; 3146 next_pass = NODE_MASK_NONE; 3147 /* 3148 * To avoid cycles in the migration "graph", ensure 3149 * that migration sources are not future targets by 3150 * setting them in 'used_targets'. Do this only 3151 * once per pass so that multiple source nodes can 3152 * share a target node. 3153 * 3154 * 'used_targets' will become unavailable in future 3155 * passes. This limits some opportunities for 3156 * multiple source nodes to share a destination. 3157 */ 3158 nodes_or(used_targets, used_targets, this_pass); 3159 3160 for_each_node_mask(node, this_pass) { 3161 best_distance = -1; 3162 3163 /* 3164 * Try to set up the migration path for the node, and the target 3165 * migration nodes can be multiple, so doing a loop to find all 3166 * the target nodes if they all have a best node distance. 3167 */ 3168 do { 3169 int target_node = 3170 establish_migrate_target(node, &used_targets, 3171 best_distance); 3172 3173 if (target_node == NUMA_NO_NODE) 3174 break; 3175 3176 if (best_distance == -1) 3177 best_distance = node_distance(node, target_node); 3178 3179 /* 3180 * Visit targets from this pass in the next pass. 3181 * Eventually, every node will have been part of 3182 * a pass, and will become set in 'used_targets'. 3183 */ 3184 node_set(target_node, next_pass); 3185 } while (1); 3186 } 3187 /* 3188 * 'next_pass' contains nodes which became migration 3189 * targets in this pass. Make additional passes until 3190 * no more migrations targets are available. 3191 */ 3192 if (!nodes_empty(next_pass)) 3193 goto again; 3194 } 3195 3196 /* 3197 * For callers that do not hold get_online_mems() already. 3198 */ 3199 static void set_migration_target_nodes(void) 3200 { 3201 get_online_mems(); 3202 __set_migration_target_nodes(); 3203 put_online_mems(); 3204 } 3205 3206 /* 3207 * This leaves migrate-on-reclaim transiently disabled between 3208 * the MEM_GOING_OFFLINE and MEM_OFFLINE events. This runs 3209 * whether reclaim-based migration is enabled or not, which 3210 * ensures that the user can turn reclaim-based migration at 3211 * any time without needing to recalculate migration targets. 3212 * 3213 * These callbacks already hold get_online_mems(). That is why 3214 * __set_migration_target_nodes() can be used as opposed to 3215 * set_migration_target_nodes(). 3216 */ 3217 static int __meminit migrate_on_reclaim_callback(struct notifier_block *self, 3218 unsigned long action, void *_arg) 3219 { 3220 struct memory_notify *arg = _arg; 3221 3222 /* 3223 * Only update the node migration order when a node is 3224 * changing status, like online->offline. This avoids 3225 * the overhead of synchronize_rcu() in most cases. 3226 */ 3227 if (arg->status_change_nid < 0) 3228 return notifier_from_errno(0); 3229 3230 switch (action) { 3231 case MEM_GOING_OFFLINE: 3232 /* 3233 * Make sure there are not transient states where 3234 * an offline node is a migration target. This 3235 * will leave migration disabled until the offline 3236 * completes and the MEM_OFFLINE case below runs. 3237 */ 3238 disable_all_migrate_targets(); 3239 break; 3240 case MEM_OFFLINE: 3241 case MEM_ONLINE: 3242 /* 3243 * Recalculate the target nodes once the node 3244 * reaches its final state (online or offline). 3245 */ 3246 __set_migration_target_nodes(); 3247 break; 3248 case MEM_CANCEL_OFFLINE: 3249 /* 3250 * MEM_GOING_OFFLINE disabled all the migration 3251 * targets. Reenable them. 3252 */ 3253 __set_migration_target_nodes(); 3254 break; 3255 case MEM_GOING_ONLINE: 3256 case MEM_CANCEL_ONLINE: 3257 break; 3258 } 3259 3260 return notifier_from_errno(0); 3261 } 3262 3263 /* 3264 * React to hotplug events that might affect the migration targets 3265 * like events that online or offline NUMA nodes. 3266 * 3267 * The ordering is also currently dependent on which nodes have 3268 * CPUs. That means we need CPU on/offline notification too. 3269 */ 3270 static int migration_online_cpu(unsigned int cpu) 3271 { 3272 set_migration_target_nodes(); 3273 return 0; 3274 } 3275 3276 static int migration_offline_cpu(unsigned int cpu) 3277 { 3278 set_migration_target_nodes(); 3279 return 0; 3280 } 3281 3282 static int __init migrate_on_reclaim_init(void) 3283 { 3284 int ret; 3285 3286 node_demotion = kmalloc_array(nr_node_ids, 3287 sizeof(struct demotion_nodes), 3288 GFP_KERNEL); 3289 WARN_ON(!node_demotion); 3290 3291 ret = cpuhp_setup_state_nocalls(CPUHP_MM_DEMOTION_DEAD, "mm/demotion:offline", 3292 NULL, migration_offline_cpu); 3293 /* 3294 * In the unlikely case that this fails, the automatic 3295 * migration targets may become suboptimal for nodes 3296 * where N_CPU changes. With such a small impact in a 3297 * rare case, do not bother trying to do anything special. 3298 */ 3299 WARN_ON(ret < 0); 3300 ret = cpuhp_setup_state(CPUHP_AP_MM_DEMOTION_ONLINE, "mm/demotion:online", 3301 migration_online_cpu, NULL); 3302 WARN_ON(ret < 0); 3303 3304 hotplug_memory_notifier(migrate_on_reclaim_callback, 100); 3305 return 0; 3306 } 3307 late_initcall(migrate_on_reclaim_init); 3308 #endif /* CONFIG_HOTPLUG_CPU */ 3309 3310 bool numa_demotion_enabled = false; 3311 3312 #ifdef CONFIG_SYSFS 3313 static ssize_t numa_demotion_enabled_show(struct kobject *kobj, 3314 struct kobj_attribute *attr, char *buf) 3315 { 3316 return sysfs_emit(buf, "%s\n", 3317 numa_demotion_enabled ? "true" : "false"); 3318 } 3319 3320 static ssize_t numa_demotion_enabled_store(struct kobject *kobj, 3321 struct kobj_attribute *attr, 3322 const char *buf, size_t count) 3323 { 3324 if (!strncmp(buf, "true", 4) || !strncmp(buf, "1", 1)) 3325 numa_demotion_enabled = true; 3326 else if (!strncmp(buf, "false", 5) || !strncmp(buf, "0", 1)) 3327 numa_demotion_enabled = false; 3328 else 3329 return -EINVAL; 3330 3331 return count; 3332 } 3333 3334 static struct kobj_attribute numa_demotion_enabled_attr = 3335 __ATTR(demotion_enabled, 0644, numa_demotion_enabled_show, 3336 numa_demotion_enabled_store); 3337 3338 static struct attribute *numa_attrs[] = { 3339 &numa_demotion_enabled_attr.attr, 3340 NULL, 3341 }; 3342 3343 static const struct attribute_group numa_attr_group = { 3344 .attrs = numa_attrs, 3345 }; 3346 3347 static int __init numa_init_sysfs(void) 3348 { 3349 int err; 3350 struct kobject *numa_kobj; 3351 3352 numa_kobj = kobject_create_and_add("numa", mm_kobj); 3353 if (!numa_kobj) { 3354 pr_err("failed to create numa kobject\n"); 3355 return -ENOMEM; 3356 } 3357 err = sysfs_create_group(numa_kobj, &numa_attr_group); 3358 if (err) { 3359 pr_err("failed to register numa group\n"); 3360 goto delete_obj; 3361 } 3362 return 0; 3363 3364 delete_obj: 3365 kobject_put(numa_kobj); 3366 return err; 3367 } 3368 subsys_initcall(numa_init_sysfs); 3369 #endif 3370