1 // SPDX-License-Identifier: GPL-2.0
3 * Memory Migration functionality - linux/mm/migrate.c
5 * Copyright (C) 2006 Silicon Graphics, Inc., Christoph Lameter
7 * Page migration was first developed in the context of the memory hotplug
8 * project. The main authors of the migration code are:
10 * IWAMOTO Toshihiro <iwamoto@valinux.co.jp>
11 * Hirokazu Takahashi <taka@valinux.co.jp>
12 * Dave Hansen <haveblue@us.ibm.com>
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/pfn_t.h>
42 #include <linux/memremap.h>
43 #include <linux/userfaultfd_k.h>
44 #include <linux/balloon_compaction.h>
45 #include <linux/page_idle.h>
46 #include <linux/page_owner.h>
47 #include <linux/sched/mm.h>
48 #include <linux/ptrace.h>
49 #include <linux/oom.h>
50 #include <linux/memory.h>
51 #include <linux/random.h>
52 #include <linux/sched/sysctl.h>
54 #include <asm/tlbflush.h>
56 #include <trace/events/migrate.h>
60 int isolate_movable_page(struct page *page, isolate_mode_t mode)
62 struct address_space *mapping;
65 * Avoid burning cycles with pages that are yet under __free_pages(),
66 * or just got freed under us.
68 * In case we 'win' a race for a movable page being freed under us and
69 * raise its refcount preventing __free_pages() from doing its job
70 * the put_page() at the end of this block will take care of
71 * release this page, thus avoiding a nasty leakage.
73 if (unlikely(!get_page_unless_zero(page)))
77 * Check PageMovable before holding a PG_lock because page's owner
78 * assumes anybody doesn't touch PG_lock of newly allocated page
79 * so unconditionally grabbing the lock ruins page's owner side.
81 if (unlikely(!__PageMovable(page)))
84 * As movable pages are not isolated from LRU lists, concurrent
85 * compaction threads can race against page migration functions
86 * as well as race against the releasing a page.
88 * In order to avoid having an already isolated movable page
89 * being (wrongly) re-isolated while it is under migration,
90 * or to avoid attempting to isolate pages being released,
91 * lets be sure we have the page lock
92 * before proceeding with the movable page isolation steps.
94 if (unlikely(!trylock_page(page)))
97 if (!PageMovable(page) || PageIsolated(page))
100 mapping = page_mapping(page);
101 VM_BUG_ON_PAGE(!mapping, page);
103 if (!mapping->a_ops->isolate_page(page, mode))
104 goto out_no_isolated;
106 /* Driver shouldn't use PG_isolated bit of page->flags */
107 WARN_ON_ONCE(PageIsolated(page));
108 SetPageIsolated(page);
121 static void putback_movable_page(struct page *page)
123 struct address_space *mapping;
125 mapping = page_mapping(page);
126 mapping->a_ops->putback_page(page);
127 ClearPageIsolated(page);
131 * Put previously isolated pages back onto the appropriate lists
132 * from where they were once taken off for compaction/migration.
134 * This function shall be used whenever the isolated pageset has been
135 * built from lru, balloon, hugetlbfs page. See isolate_migratepages_range()
136 * and isolate_huge_page().
138 void putback_movable_pages(struct list_head *l)
143 list_for_each_entry_safe(page, page2, l, lru) {
144 if (unlikely(PageHuge(page))) {
145 putback_active_hugepage(page);
148 list_del(&page->lru);
150 * We isolated non-lru movable page so here we can use
151 * __PageMovable because LRU page's mapping cannot have
152 * PAGE_MAPPING_MOVABLE.
154 if (unlikely(__PageMovable(page))) {
155 VM_BUG_ON_PAGE(!PageIsolated(page), page);
157 if (PageMovable(page))
158 putback_movable_page(page);
160 ClearPageIsolated(page);
164 mod_node_page_state(page_pgdat(page), NR_ISOLATED_ANON +
165 page_is_file_lru(page), -thp_nr_pages(page));
166 putback_lru_page(page);
172 * Restore a potential migration pte to a working pte entry
174 static bool remove_migration_pte(struct folio *folio,
175 struct vm_area_struct *vma, unsigned long addr, void *old)
177 DEFINE_FOLIO_VMA_WALK(pvmw, old, vma, addr, PVMW_SYNC | PVMW_MIGRATION);
179 while (page_vma_mapped_walk(&pvmw)) {
183 unsigned long idx = 0;
185 /* pgoff is invalid for ksm pages, but they are never large */
186 if (folio_test_large(folio) && !folio_test_hugetlb(folio))
187 idx = linear_page_index(vma, pvmw.address) - pvmw.pgoff;
188 new = folio_page(folio, idx);
190 #ifdef CONFIG_ARCH_ENABLE_THP_MIGRATION
191 /* PMD-mapped THP migration entry */
193 VM_BUG_ON_FOLIO(folio_test_hugetlb(folio) ||
194 !folio_test_pmd_mappable(folio), folio);
195 remove_migration_pmd(&pvmw, new);
201 pte = pte_mkold(mk_pte(new, READ_ONCE(vma->vm_page_prot)));
202 if (pte_swp_soft_dirty(*pvmw.pte))
203 pte = pte_mksoft_dirty(pte);
206 * Recheck VMA as permissions can change since migration started
208 entry = pte_to_swp_entry(*pvmw.pte);
209 if (is_writable_migration_entry(entry))
210 pte = maybe_mkwrite(pte, vma);
211 else if (pte_swp_uffd_wp(*pvmw.pte))
212 pte = pte_mkuffd_wp(pte);
214 if (unlikely(is_device_private_page(new))) {
216 entry = make_writable_device_private_entry(
219 entry = make_readable_device_private_entry(
221 pte = swp_entry_to_pte(entry);
222 if (pte_swp_soft_dirty(*pvmw.pte))
223 pte = pte_swp_mksoft_dirty(pte);
224 if (pte_swp_uffd_wp(*pvmw.pte))
225 pte = pte_swp_mkuffd_wp(pte);
228 #ifdef CONFIG_HUGETLB_PAGE
229 if (folio_test_hugetlb(folio)) {
230 unsigned int shift = huge_page_shift(hstate_vma(vma));
232 pte = pte_mkhuge(pte);
233 pte = arch_make_huge_pte(pte, shift, vma->vm_flags);
234 if (folio_test_anon(folio))
235 hugepage_add_anon_rmap(new, vma, pvmw.address);
237 page_dup_rmap(new, true);
238 set_huge_pte_at(vma->vm_mm, pvmw.address, pvmw.pte, pte);
242 if (folio_test_anon(folio))
243 page_add_anon_rmap(new, vma, pvmw.address, false);
245 page_add_file_rmap(new, vma, false);
246 set_pte_at(vma->vm_mm, pvmw.address, pvmw.pte, pte);
248 if (vma->vm_flags & VM_LOCKED)
249 mlock_page_drain(smp_processor_id());
251 trace_remove_migration_pte(pvmw.address, pte_val(pte),
252 compound_order(new));
254 /* No need to invalidate - it was non-present before */
255 update_mmu_cache(vma, pvmw.address, pvmw.pte);
262 * Get rid of all migration entries and replace them by
263 * references to the indicated page.
265 void remove_migration_ptes(struct folio *src, struct folio *dst, bool locked)
267 struct rmap_walk_control rwc = {
268 .rmap_one = remove_migration_pte,
273 rmap_walk_locked(dst, &rwc);
275 rmap_walk(dst, &rwc);
279 * Something used the pte of a page under migration. We need to
280 * get to the page and wait until migration is finished.
281 * When we return from this function the fault will be retried.
283 void __migration_entry_wait(struct mm_struct *mm, pte_t *ptep,
291 if (!is_swap_pte(pte))
294 entry = pte_to_swp_entry(pte);
295 if (!is_migration_entry(entry))
298 migration_entry_wait_on_locked(entry, ptep, ptl);
301 pte_unmap_unlock(ptep, ptl);
304 void migration_entry_wait(struct mm_struct *mm, pmd_t *pmd,
305 unsigned long address)
307 spinlock_t *ptl = pte_lockptr(mm, pmd);
308 pte_t *ptep = pte_offset_map(pmd, address);
309 __migration_entry_wait(mm, ptep, ptl);
312 void migration_entry_wait_huge(struct vm_area_struct *vma,
313 struct mm_struct *mm, pte_t *pte)
315 spinlock_t *ptl = huge_pte_lockptr(hstate_vma(vma), mm, pte);
316 __migration_entry_wait(mm, pte, ptl);
319 #ifdef CONFIG_ARCH_ENABLE_THP_MIGRATION
320 void pmd_migration_entry_wait(struct mm_struct *mm, pmd_t *pmd)
324 ptl = pmd_lock(mm, pmd);
325 if (!is_pmd_migration_entry(*pmd))
327 migration_entry_wait_on_locked(pmd_to_swp_entry(*pmd), NULL, ptl);
334 static int expected_page_refs(struct address_space *mapping, struct page *page)
336 int expected_count = 1;
339 expected_count += compound_nr(page) + page_has_private(page);
340 return expected_count;
344 * Replace the page in the mapping.
346 * The number of remaining references must be:
347 * 1 for anonymous pages without a mapping
348 * 2 for pages with a mapping
349 * 3 for pages with a mapping and PagePrivate/PagePrivate2 set.
351 int folio_migrate_mapping(struct address_space *mapping,
352 struct folio *newfolio, struct folio *folio, int extra_count)
354 XA_STATE(xas, &mapping->i_pages, folio_index(folio));
355 struct zone *oldzone, *newzone;
357 int expected_count = expected_page_refs(mapping, &folio->page) + extra_count;
358 long nr = folio_nr_pages(folio);
361 /* Anonymous page without mapping */
362 if (folio_ref_count(folio) != expected_count)
365 /* No turning back from here */
366 newfolio->index = folio->index;
367 newfolio->mapping = folio->mapping;
368 if (folio_test_swapbacked(folio))
369 __folio_set_swapbacked(newfolio);
371 return MIGRATEPAGE_SUCCESS;
374 oldzone = folio_zone(folio);
375 newzone = folio_zone(newfolio);
378 if (!folio_ref_freeze(folio, expected_count)) {
379 xas_unlock_irq(&xas);
384 * Now we know that no one else is looking at the folio:
385 * no turning back from here.
387 newfolio->index = folio->index;
388 newfolio->mapping = folio->mapping;
389 folio_ref_add(newfolio, nr); /* add cache reference */
390 if (folio_test_swapbacked(folio)) {
391 __folio_set_swapbacked(newfolio);
392 if (folio_test_swapcache(folio)) {
393 folio_set_swapcache(newfolio);
394 newfolio->private = folio_get_private(folio);
397 VM_BUG_ON_FOLIO(folio_test_swapcache(folio), folio);
400 /* Move dirty while page refs frozen and newpage not yet exposed */
401 dirty = folio_test_dirty(folio);
403 folio_clear_dirty(folio);
404 folio_set_dirty(newfolio);
407 xas_store(&xas, newfolio);
410 * Drop cache reference from old page by unfreezing
411 * to one less reference.
412 * We know this isn't the last reference.
414 folio_ref_unfreeze(folio, expected_count - nr);
417 /* Leave irq disabled to prevent preemption while updating stats */
420 * If moved to a different zone then also account
421 * the page for that zone. Other VM counters will be
422 * taken care of when we establish references to the
423 * new page and drop references to the old page.
425 * Note that anonymous pages are accounted for
426 * via NR_FILE_PAGES and NR_ANON_MAPPED if they
427 * are mapped to swap space.
429 if (newzone != oldzone) {
430 struct lruvec *old_lruvec, *new_lruvec;
431 struct mem_cgroup *memcg;
433 memcg = folio_memcg(folio);
434 old_lruvec = mem_cgroup_lruvec(memcg, oldzone->zone_pgdat);
435 new_lruvec = mem_cgroup_lruvec(memcg, newzone->zone_pgdat);
437 __mod_lruvec_state(old_lruvec, NR_FILE_PAGES, -nr);
438 __mod_lruvec_state(new_lruvec, NR_FILE_PAGES, nr);
439 if (folio_test_swapbacked(folio) && !folio_test_swapcache(folio)) {
440 __mod_lruvec_state(old_lruvec, NR_SHMEM, -nr);
441 __mod_lruvec_state(new_lruvec, NR_SHMEM, nr);
444 if (folio_test_swapcache(folio)) {
445 __mod_lruvec_state(old_lruvec, NR_SWAPCACHE, -nr);
446 __mod_lruvec_state(new_lruvec, NR_SWAPCACHE, nr);
449 if (dirty && mapping_can_writeback(mapping)) {
450 __mod_lruvec_state(old_lruvec, NR_FILE_DIRTY, -nr);
451 __mod_zone_page_state(oldzone, NR_ZONE_WRITE_PENDING, -nr);
452 __mod_lruvec_state(new_lruvec, NR_FILE_DIRTY, nr);
453 __mod_zone_page_state(newzone, NR_ZONE_WRITE_PENDING, nr);
458 return MIGRATEPAGE_SUCCESS;
460 EXPORT_SYMBOL(folio_migrate_mapping);
463 * The expected number of remaining references is the same as that
464 * of folio_migrate_mapping().
466 int migrate_huge_page_move_mapping(struct address_space *mapping,
467 struct page *newpage, struct page *page)
469 XA_STATE(xas, &mapping->i_pages, page_index(page));
473 expected_count = 2 + page_has_private(page);
474 if (page_count(page) != expected_count || xas_load(&xas) != page) {
475 xas_unlock_irq(&xas);
479 if (!page_ref_freeze(page, expected_count)) {
480 xas_unlock_irq(&xas);
484 newpage->index = page->index;
485 newpage->mapping = page->mapping;
489 xas_store(&xas, newpage);
491 page_ref_unfreeze(page, expected_count - 1);
493 xas_unlock_irq(&xas);
495 return MIGRATEPAGE_SUCCESS;
499 * Copy the flags and some other ancillary information
501 void folio_migrate_flags(struct folio *newfolio, struct folio *folio)
505 if (folio_test_error(folio))
506 folio_set_error(newfolio);
507 if (folio_test_referenced(folio))
508 folio_set_referenced(newfolio);
509 if (folio_test_uptodate(folio))
510 folio_mark_uptodate(newfolio);
511 if (folio_test_clear_active(folio)) {
512 VM_BUG_ON_FOLIO(folio_test_unevictable(folio), folio);
513 folio_set_active(newfolio);
514 } else if (folio_test_clear_unevictable(folio))
515 folio_set_unevictable(newfolio);
516 if (folio_test_workingset(folio))
517 folio_set_workingset(newfolio);
518 if (folio_test_checked(folio))
519 folio_set_checked(newfolio);
520 if (folio_test_mappedtodisk(folio))
521 folio_set_mappedtodisk(newfolio);
523 /* Move dirty on pages not done by folio_migrate_mapping() */
524 if (folio_test_dirty(folio))
525 folio_set_dirty(newfolio);
527 if (folio_test_young(folio))
528 folio_set_young(newfolio);
529 if (folio_test_idle(folio))
530 folio_set_idle(newfolio);
533 * Copy NUMA information to the new page, to prevent over-eager
534 * future migrations of this same page.
536 cpupid = page_cpupid_xchg_last(&folio->page, -1);
537 page_cpupid_xchg_last(&newfolio->page, cpupid);
539 folio_migrate_ksm(newfolio, folio);
541 * Please do not reorder this without considering how mm/ksm.c's
542 * get_ksm_page() depends upon ksm_migrate_page() and PageSwapCache().
544 if (folio_test_swapcache(folio))
545 folio_clear_swapcache(folio);
546 folio_clear_private(folio);
548 /* page->private contains hugetlb specific flags */
549 if (!folio_test_hugetlb(folio))
550 folio->private = NULL;
553 * If any waiters have accumulated on the new page then
556 if (folio_test_writeback(newfolio))
557 folio_end_writeback(newfolio);
560 * PG_readahead shares the same bit with PG_reclaim. The above
561 * end_page_writeback() may clear PG_readahead mistakenly, so set the
564 if (folio_test_readahead(folio))
565 folio_set_readahead(newfolio);
567 folio_copy_owner(newfolio, folio);
569 if (!folio_test_hugetlb(folio))
570 mem_cgroup_migrate(folio, newfolio);
572 EXPORT_SYMBOL(folio_migrate_flags);
574 void folio_migrate_copy(struct folio *newfolio, struct folio *folio)
576 folio_copy(newfolio, folio);
577 folio_migrate_flags(newfolio, folio);
579 EXPORT_SYMBOL(folio_migrate_copy);
581 /************************************************************
582 * Migration functions
583 ***********************************************************/
586 * Common logic to directly migrate a single LRU page suitable for
587 * pages that do not use PagePrivate/PagePrivate2.
589 * Pages are locked upon entry and exit.
591 int migrate_page(struct address_space *mapping,
592 struct page *newpage, struct page *page,
593 enum migrate_mode mode)
595 struct folio *newfolio = page_folio(newpage);
596 struct folio *folio = page_folio(page);
599 BUG_ON(folio_test_writeback(folio)); /* Writeback must be complete */
601 rc = folio_migrate_mapping(mapping, newfolio, folio, 0);
603 if (rc != MIGRATEPAGE_SUCCESS)
606 if (mode != MIGRATE_SYNC_NO_COPY)
607 folio_migrate_copy(newfolio, folio);
609 folio_migrate_flags(newfolio, folio);
610 return MIGRATEPAGE_SUCCESS;
612 EXPORT_SYMBOL(migrate_page);
615 /* Returns true if all buffers are successfully locked */
616 static bool buffer_migrate_lock_buffers(struct buffer_head *head,
617 enum migrate_mode mode)
619 struct buffer_head *bh = head;
621 /* Simple case, sync compaction */
622 if (mode != MIGRATE_ASYNC) {
625 bh = bh->b_this_page;
627 } while (bh != head);
632 /* async case, we cannot block on lock_buffer so use trylock_buffer */
634 if (!trylock_buffer(bh)) {
636 * We failed to lock the buffer and cannot stall in
637 * async migration. Release the taken locks
639 struct buffer_head *failed_bh = bh;
641 while (bh != failed_bh) {
643 bh = bh->b_this_page;
648 bh = bh->b_this_page;
649 } while (bh != head);
653 static int __buffer_migrate_page(struct address_space *mapping,
654 struct page *newpage, struct page *page, enum migrate_mode mode,
657 struct buffer_head *bh, *head;
661 if (!page_has_buffers(page))
662 return migrate_page(mapping, newpage, page, mode);
664 /* Check whether page does not have extra refs before we do more work */
665 expected_count = expected_page_refs(mapping, page);
666 if (page_count(page) != expected_count)
669 head = page_buffers(page);
670 if (!buffer_migrate_lock_buffers(head, mode))
675 bool invalidated = false;
679 spin_lock(&mapping->private_lock);
682 if (atomic_read(&bh->b_count)) {
686 bh = bh->b_this_page;
687 } while (bh != head);
693 spin_unlock(&mapping->private_lock);
694 invalidate_bh_lrus();
696 goto recheck_buffers;
700 rc = migrate_page_move_mapping(mapping, newpage, page, 0);
701 if (rc != MIGRATEPAGE_SUCCESS)
704 attach_page_private(newpage, detach_page_private(page));
708 set_bh_page(bh, newpage, bh_offset(bh));
709 bh = bh->b_this_page;
711 } while (bh != head);
713 if (mode != MIGRATE_SYNC_NO_COPY)
714 migrate_page_copy(newpage, page);
716 migrate_page_states(newpage, page);
718 rc = MIGRATEPAGE_SUCCESS;
721 spin_unlock(&mapping->private_lock);
725 bh = bh->b_this_page;
727 } while (bh != head);
733 * Migration function for pages with buffers. This function can only be used
734 * if the underlying filesystem guarantees that no other references to "page"
735 * exist. For example attached buffer heads are accessed only under page lock.
737 int buffer_migrate_page(struct address_space *mapping,
738 struct page *newpage, struct page *page, enum migrate_mode mode)
740 return __buffer_migrate_page(mapping, newpage, page, mode, false);
742 EXPORT_SYMBOL(buffer_migrate_page);
745 * Same as above except that this variant is more careful and checks that there
746 * are also no buffer head references. This function is the right one for
747 * mappings where buffer heads are directly looked up and referenced (such as
748 * block device mappings).
750 int buffer_migrate_page_norefs(struct address_space *mapping,
751 struct page *newpage, struct page *page, enum migrate_mode mode)
753 return __buffer_migrate_page(mapping, newpage, page, mode, true);
758 * Writeback a page to clean the dirty state
760 static int writeout(struct address_space *mapping, struct page *page)
762 struct folio *folio = page_folio(page);
763 struct writeback_control wbc = {
764 .sync_mode = WB_SYNC_NONE,
767 .range_end = LLONG_MAX,
772 if (!mapping->a_ops->writepage)
773 /* No write method for the address space */
776 if (!clear_page_dirty_for_io(page))
777 /* Someone else already triggered a write */
781 * A dirty page may imply that the underlying filesystem has
782 * the page on some queue. So the page must be clean for
783 * migration. Writeout may mean we loose the lock and the
784 * page state is no longer what we checked for earlier.
785 * At this point we know that the migration attempt cannot
788 remove_migration_ptes(folio, folio, false);
790 rc = mapping->a_ops->writepage(page, &wbc);
792 if (rc != AOP_WRITEPAGE_ACTIVATE)
793 /* unlocked. Relock */
796 return (rc < 0) ? -EIO : -EAGAIN;
800 * Default handling if a filesystem does not provide a migration function.
802 static int fallback_migrate_page(struct address_space *mapping,
803 struct page *newpage, struct page *page, enum migrate_mode mode)
805 if (PageDirty(page)) {
806 /* Only writeback pages in full synchronous migration */
809 case MIGRATE_SYNC_NO_COPY:
814 return writeout(mapping, page);
818 * Buffers may be managed in a filesystem specific way.
819 * We must have no buffers or drop them.
821 if (page_has_private(page) &&
822 !try_to_release_page(page, GFP_KERNEL))
823 return mode == MIGRATE_SYNC ? -EAGAIN : -EBUSY;
825 return migrate_page(mapping, newpage, page, mode);
829 * Move a page to a newly allocated page
830 * The page is locked and all ptes have been successfully removed.
832 * The new page will have replaced the old page if this function
837 * MIGRATEPAGE_SUCCESS - success
839 static int move_to_new_page(struct page *newpage, struct page *page,
840 enum migrate_mode mode)
842 struct address_space *mapping;
844 bool is_lru = !__PageMovable(page);
846 VM_BUG_ON_PAGE(!PageLocked(page), page);
847 VM_BUG_ON_PAGE(!PageLocked(newpage), newpage);
849 mapping = page_mapping(page);
851 if (likely(is_lru)) {
853 rc = migrate_page(mapping, newpage, page, mode);
854 else if (mapping->a_ops->migratepage)
856 * Most pages have a mapping and most filesystems
857 * provide a migratepage callback. Anonymous pages
858 * are part of swap space which also has its own
859 * migratepage callback. This is the most common path
860 * for page migration.
862 rc = mapping->a_ops->migratepage(mapping, newpage,
865 rc = fallback_migrate_page(mapping, newpage,
869 * In case of non-lru page, it could be released after
870 * isolation step. In that case, we shouldn't try migration.
872 VM_BUG_ON_PAGE(!PageIsolated(page), page);
873 if (!PageMovable(page)) {
874 rc = MIGRATEPAGE_SUCCESS;
875 ClearPageIsolated(page);
879 rc = mapping->a_ops->migratepage(mapping, newpage,
881 WARN_ON_ONCE(rc == MIGRATEPAGE_SUCCESS &&
882 !PageIsolated(page));
886 * When successful, old pagecache page->mapping must be cleared before
887 * page is freed; but stats require that PageAnon be left as PageAnon.
889 if (rc == MIGRATEPAGE_SUCCESS) {
890 if (__PageMovable(page)) {
891 VM_BUG_ON_PAGE(!PageIsolated(page), page);
894 * We clear PG_movable under page_lock so any compactor
895 * cannot try to migrate this page.
897 ClearPageIsolated(page);
901 * Anonymous and movable page->mapping will be cleared by
902 * free_pages_prepare so don't reset it here for keeping
903 * the type to work PageAnon, for example.
905 if (!PageMappingFlags(page))
906 page->mapping = NULL;
908 if (likely(!is_zone_device_page(newpage)))
909 flush_dcache_folio(page_folio(newpage));
915 static int __unmap_and_move(struct page *page, struct page *newpage,
916 int force, enum migrate_mode mode)
918 struct folio *folio = page_folio(page);
919 struct folio *dst = page_folio(newpage);
921 bool page_was_mapped = false;
922 struct anon_vma *anon_vma = NULL;
923 bool is_lru = !__PageMovable(page);
925 if (!trylock_page(page)) {
926 if (!force || mode == MIGRATE_ASYNC)
930 * It's not safe for direct compaction to call lock_page.
931 * For example, during page readahead pages are added locked
932 * to the LRU. Later, when the IO completes the pages are
933 * marked uptodate and unlocked. However, the queueing
934 * could be merging multiple pages for one bio (e.g.
935 * mpage_readahead). If an allocation happens for the
936 * second or third page, the process can end up locking
937 * the same page twice and deadlocking. Rather than
938 * trying to be clever about what pages can be locked,
939 * avoid the use of lock_page for direct compaction
942 if (current->flags & PF_MEMALLOC)
948 if (PageWriteback(page)) {
950 * Only in the case of a full synchronous migration is it
951 * necessary to wait for PageWriteback. In the async case,
952 * the retry loop is too short and in the sync-light case,
953 * the overhead of stalling is too much
957 case MIGRATE_SYNC_NO_COPY:
965 wait_on_page_writeback(page);
969 * By try_to_migrate(), page->mapcount goes down to 0 here. In this case,
970 * we cannot notice that anon_vma is freed while we migrates a page.
971 * This get_anon_vma() delays freeing anon_vma pointer until the end
972 * of migration. File cache pages are no problem because of page_lock()
973 * File Caches may use write_page() or lock_page() in migration, then,
974 * just care Anon page here.
976 * Only page_get_anon_vma() understands the subtleties of
977 * getting a hold on an anon_vma from outside one of its mms.
978 * But if we cannot get anon_vma, then we won't need it anyway,
979 * because that implies that the anon page is no longer mapped
980 * (and cannot be remapped so long as we hold the page lock).
982 if (PageAnon(page) && !PageKsm(page))
983 anon_vma = page_get_anon_vma(page);
986 * Block others from accessing the new page when we get around to
987 * establishing additional references. We are usually the only one
988 * holding a reference to newpage at this point. We used to have a BUG
989 * here if trylock_page(newpage) fails, but would like to allow for
990 * cases where there might be a race with the previous use of newpage.
991 * This is much like races on refcount of oldpage: just don't BUG().
993 if (unlikely(!trylock_page(newpage)))
996 if (unlikely(!is_lru)) {
997 rc = move_to_new_page(newpage, page, mode);
998 goto out_unlock_both;
1002 * Corner case handling:
1003 * 1. When a new swap-cache page is read into, it is added to the LRU
1004 * and treated as swapcache but it has no rmap yet.
1005 * Calling try_to_unmap() against a page->mapping==NULL page will
1006 * trigger a BUG. So handle it here.
1007 * 2. An orphaned page (see truncate_cleanup_page) might have
1008 * fs-private metadata. The page can be picked up due to memory
1009 * offlining. Everywhere else except page reclaim, the page is
1010 * invisible to the vm, so the page can not be migrated. So try to
1011 * free the metadata, so the page can be freed.
1013 if (!page->mapping) {
1014 VM_BUG_ON_PAGE(PageAnon(page), page);
1015 if (page_has_private(page)) {
1016 try_to_free_buffers(page);
1017 goto out_unlock_both;
1019 } else if (page_mapped(page)) {
1020 /* Establish migration ptes */
1021 VM_BUG_ON_PAGE(PageAnon(page) && !PageKsm(page) && !anon_vma,
1023 try_to_migrate(folio, 0);
1024 page_was_mapped = true;
1027 if (!page_mapped(page))
1028 rc = move_to_new_page(newpage, page, mode);
1031 * When successful, push newpage to LRU immediately: so that if it
1032 * turns out to be an mlocked page, remove_migration_ptes() will
1033 * automatically build up the correct newpage->mlock_count for it.
1035 * We would like to do something similar for the old page, when
1036 * unsuccessful, and other cases when a page has been temporarily
1037 * isolated from the unevictable LRU: but this case is the easiest.
1039 if (rc == MIGRATEPAGE_SUCCESS) {
1040 lru_cache_add(newpage);
1041 if (page_was_mapped)
1045 if (page_was_mapped)
1046 remove_migration_ptes(folio,
1047 rc == MIGRATEPAGE_SUCCESS ? dst : folio, false);
1050 unlock_page(newpage);
1052 /* Drop an anon_vma reference if we took one */
1054 put_anon_vma(anon_vma);
1058 * If migration is successful, decrease refcount of the newpage,
1059 * which will not free the page because new page owner increased
1062 if (rc == MIGRATEPAGE_SUCCESS)
1069 * Obtain the lock on page, remove all ptes and migrate the page
1070 * to the newly allocated page in newpage.
1072 static int unmap_and_move(new_page_t get_new_page,
1073 free_page_t put_new_page,
1074 unsigned long private, struct page *page,
1075 int force, enum migrate_mode mode,
1076 enum migrate_reason reason,
1077 struct list_head *ret)
1079 int rc = MIGRATEPAGE_SUCCESS;
1080 struct page *newpage = NULL;
1082 if (!thp_migration_supported() && PageTransHuge(page))
1085 if (page_count(page) == 1) {
1086 /* page was freed from under us. So we are done. */
1087 ClearPageActive(page);
1088 ClearPageUnevictable(page);
1089 if (unlikely(__PageMovable(page))) {
1091 if (!PageMovable(page))
1092 ClearPageIsolated(page);
1098 newpage = get_new_page(page, private);
1102 rc = __unmap_and_move(page, newpage, force, mode);
1103 if (rc == MIGRATEPAGE_SUCCESS)
1104 set_page_owner_migrate_reason(newpage, reason);
1107 if (rc != -EAGAIN) {
1109 * A page that has been migrated has all references
1110 * removed and will be freed. A page that has not been
1111 * migrated will have kept its references and be restored.
1113 list_del(&page->lru);
1117 * If migration is successful, releases reference grabbed during
1118 * isolation. Otherwise, restore the page to right list unless
1121 if (rc == MIGRATEPAGE_SUCCESS) {
1123 * Compaction can migrate also non-LRU pages which are
1124 * not accounted to NR_ISOLATED_*. They can be recognized
1127 if (likely(!__PageMovable(page)))
1128 mod_node_page_state(page_pgdat(page), NR_ISOLATED_ANON +
1129 page_is_file_lru(page), -thp_nr_pages(page));
1131 if (reason != MR_MEMORY_FAILURE)
1133 * We release the page in page_handle_poison.
1138 list_add_tail(&page->lru, ret);
1141 put_new_page(newpage, private);
1150 * Counterpart of unmap_and_move_page() for hugepage migration.
1152 * This function doesn't wait the completion of hugepage I/O
1153 * because there is no race between I/O and migration for hugepage.
1154 * Note that currently hugepage I/O occurs only in direct I/O
1155 * where no lock is held and PG_writeback is irrelevant,
1156 * and writeback status of all subpages are counted in the reference
1157 * count of the head page (i.e. if all subpages of a 2MB hugepage are
1158 * under direct I/O, the reference of the head page is 512 and a bit more.)
1159 * This means that when we try to migrate hugepage whose subpages are
1160 * doing direct I/O, some references remain after try_to_unmap() and
1161 * hugepage migration fails without data corruption.
1163 * There is also no race when direct I/O is issued on the page under migration,
1164 * because then pte is replaced with migration swap entry and direct I/O code
1165 * will wait in the page fault for migration to complete.
1167 static int unmap_and_move_huge_page(new_page_t get_new_page,
1168 free_page_t put_new_page, unsigned long private,
1169 struct page *hpage, int force,
1170 enum migrate_mode mode, int reason,
1171 struct list_head *ret)
1173 struct folio *dst, *src = page_folio(hpage);
1175 int page_was_mapped = 0;
1176 struct page *new_hpage;
1177 struct anon_vma *anon_vma = NULL;
1178 struct address_space *mapping = NULL;
1181 * Migratability of hugepages depends on architectures and their size.
1182 * This check is necessary because some callers of hugepage migration
1183 * like soft offline and memory hotremove don't walk through page
1184 * tables or check whether the hugepage is pmd-based or not before
1185 * kicking migration.
1187 if (!hugepage_migration_supported(page_hstate(hpage))) {
1188 list_move_tail(&hpage->lru, ret);
1192 if (page_count(hpage) == 1) {
1193 /* page was freed from under us. So we are done. */
1194 putback_active_hugepage(hpage);
1195 return MIGRATEPAGE_SUCCESS;
1198 new_hpage = get_new_page(hpage, private);
1201 dst = page_folio(new_hpage);
1203 if (!trylock_page(hpage)) {
1208 case MIGRATE_SYNC_NO_COPY:
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.
1221 if (hugetlb_page_subpool(hpage) && !page_mapping(hpage)) {
1226 if (PageAnon(hpage))
1227 anon_vma = page_get_anon_vma(hpage);
1229 if (unlikely(!trylock_page(new_hpage)))
1232 if (page_mapped(hpage)) {
1233 bool mapping_locked = false;
1234 enum ttu_flags ttu = 0;
1236 if (!PageAnon(hpage)) {
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.
1243 mapping = hugetlb_page_mapping_lock_write(hpage);
1244 if (unlikely(!mapping))
1245 goto unlock_put_anon;
1247 mapping_locked = true;
1248 ttu |= TTU_RMAP_LOCKED;
1251 try_to_migrate(src, ttu);
1252 page_was_mapped = 1;
1255 i_mmap_unlock_write(mapping);
1258 if (!page_mapped(hpage))
1259 rc = move_to_new_page(new_hpage, hpage, mode);
1261 if (page_was_mapped)
1262 remove_migration_ptes(src,
1263 rc == MIGRATEPAGE_SUCCESS ? dst : src, false);
1266 unlock_page(new_hpage);
1270 put_anon_vma(anon_vma);
1272 if (rc == MIGRATEPAGE_SUCCESS) {
1273 move_hugetlb_state(hpage, new_hpage, reason);
1274 put_new_page = NULL;
1280 if (rc == MIGRATEPAGE_SUCCESS)
1281 putback_active_hugepage(hpage);
1282 else if (rc != -EAGAIN)
1283 list_move_tail(&hpage->lru, ret);
1286 * If migration was not successful and there's a freeing callback, use
1287 * it. Otherwise, put_page() will drop the reference grabbed during
1291 put_new_page(new_hpage, private);
1293 putback_active_hugepage(new_hpage);
1298 static inline int try_split_thp(struct page *page, struct page **page2,
1299 struct list_head *from)
1304 rc = split_huge_page_to_list(page, from);
1307 list_safe_reset_next(page, *page2, lru);
1313 * migrate_pages - migrate the pages specified in a list, to the free pages
1314 * supplied as the target for the page migration
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.
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.
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.
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)
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;
1350 bool is_thp = false;
1353 int rc, nr_subpages;
1354 LIST_HEAD(ret_pages);
1355 LIST_HEAD(thp_split_pages);
1356 bool nosplit = (reason == MR_NUMA_MISPLACED);
1357 bool no_subpage_counting = false;
1359 trace_mm_migrate_pages_start(mode, reason);
1361 thp_subpage_migration:
1362 for (pass = 0; pass < 10 && (retry || thp_retry); pass++) {
1366 list_for_each_entry_safe(page, page2, from, lru) {
1369 * THP statistics is based on the source huge page.
1370 * Capture required information that might get lost
1373 is_thp = PageTransHuge(page) && !PageHuge(page);
1374 nr_subpages = compound_nr(page);
1378 rc = unmap_and_move_huge_page(get_new_page,
1379 put_new_page, private, page,
1380 pass > 2, mode, reason,
1383 rc = unmap_and_move(get_new_page, put_new_page,
1384 private, page, pass > 2, mode,
1385 reason, &ret_pages);
1388 * Success: non hugetlb page will be freed, hugetlb
1389 * page will be put back
1390 * -EAGAIN: stay on the from list
1391 * -ENOMEM: stay on the from list
1392 * Other errno: put on ret_pages list then splice to
1397 * THP migration might be unsupported or the
1398 * allocation could've failed so we should
1399 * retry on the same page with the THP split
1402 * Head page is retried immediately and tail
1403 * pages are added to the tail of the list so
1404 * we encounter them after the rest of the list
1408 /* THP migration is unsupported */
1411 if (!try_split_thp(page, &page2, &thp_split_pages)) {
1416 nr_failed_pages += nr_subpages;
1420 /* Hugetlb migration is unsupported */
1421 if (!no_subpage_counting)
1423 nr_failed_pages += nr_subpages;
1427 * When memory is low, don't bother to try to migrate
1428 * other pages, just exit.
1429 * THP NUMA faulting doesn't split THP to retry.
1431 if (is_thp && !nosplit) {
1433 if (!try_split_thp(page, &page2, &thp_split_pages)) {
1438 nr_failed_pages += nr_subpages;
1442 if (!no_subpage_counting)
1444 nr_failed_pages += nr_subpages;
1453 case MIGRATEPAGE_SUCCESS:
1454 nr_succeeded += nr_subpages;
1462 * Permanent failure (-EBUSY, etc.):
1463 * unlike -EAGAIN case, the failed page is
1464 * removed from migration page list and not
1465 * retried in the next outer loop.
1469 nr_failed_pages += nr_subpages;
1473 if (!no_subpage_counting)
1475 nr_failed_pages += nr_subpages;
1481 nr_thp_failed += thp_retry;
1483 * Try to migrate subpages of fail-to-migrate THPs, no nr_failed
1484 * counting in this round, since all subpages of a THP is counted
1485 * as 1 failure in the first round.
1487 if (!list_empty(&thp_split_pages)) {
1489 * Move non-migrated pages (after 10 retries) to ret_pages
1490 * to avoid migrating them again.
1492 list_splice_init(from, &ret_pages);
1493 list_splice_init(&thp_split_pages, from);
1494 no_subpage_counting = true;
1496 goto thp_subpage_migration;
1499 rc = nr_failed + nr_thp_failed;
1502 * Put the permanent failure page back to migration list, they
1503 * will be put back to the right list by the caller.
1505 list_splice(&ret_pages, from);
1507 count_vm_events(PGMIGRATE_SUCCESS, nr_succeeded);
1508 count_vm_events(PGMIGRATE_FAIL, nr_failed_pages);
1509 count_vm_events(THP_MIGRATION_SUCCESS, nr_thp_succeeded);
1510 count_vm_events(THP_MIGRATION_FAIL, nr_thp_failed);
1511 count_vm_events(THP_MIGRATION_SPLIT, nr_thp_split);
1512 trace_mm_migrate_pages(nr_succeeded, nr_failed_pages, nr_thp_succeeded,
1513 nr_thp_failed, nr_thp_split, mode, reason);
1516 *ret_succeeded = nr_succeeded;
1521 struct page *alloc_migration_target(struct page *page, unsigned long private)
1523 struct migration_target_control *mtc;
1525 unsigned int order = 0;
1526 struct page *new_page = NULL;
1530 mtc = (struct migration_target_control *)private;
1531 gfp_mask = mtc->gfp_mask;
1533 if (nid == NUMA_NO_NODE)
1534 nid = page_to_nid(page);
1536 if (PageHuge(page)) {
1537 struct hstate *h = page_hstate(compound_head(page));
1539 gfp_mask = htlb_modify_alloc_mask(h, gfp_mask);
1540 return alloc_huge_page_nodemask(h, nid, mtc->nmask, gfp_mask);
1543 if (PageTransHuge(page)) {
1545 * clear __GFP_RECLAIM to make the migration callback
1546 * consistent with regular THP allocations.
1548 gfp_mask &= ~__GFP_RECLAIM;
1549 gfp_mask |= GFP_TRANSHUGE;
1550 order = HPAGE_PMD_ORDER;
1552 zidx = zone_idx(page_zone(page));
1553 if (is_highmem_idx(zidx) || zidx == ZONE_MOVABLE)
1554 gfp_mask |= __GFP_HIGHMEM;
1556 new_page = __alloc_pages(gfp_mask, order, nid, mtc->nmask);
1558 if (new_page && PageTransHuge(new_page))
1559 prep_transhuge_page(new_page);
1566 static int store_status(int __user *status, int start, int value, int nr)
1569 if (put_user(value, status + start))
1577 static int do_move_pages_to_node(struct mm_struct *mm,
1578 struct list_head *pagelist, int node)
1581 struct migration_target_control mtc = {
1583 .gfp_mask = GFP_HIGHUSER_MOVABLE | __GFP_THISNODE,
1586 err = migrate_pages(pagelist, alloc_migration_target, NULL,
1587 (unsigned long)&mtc, MIGRATE_SYNC, MR_SYSCALL, NULL);
1589 putback_movable_pages(pagelist);
1594 * Resolves the given address to a struct page, isolates it from the LRU and
1595 * puts it to the given pagelist.
1597 * errno - if the page cannot be found/isolated
1598 * 0 - when it doesn't have to be migrated because it is already on the
1600 * 1 - when it has been queued
1602 static int add_page_for_migration(struct mm_struct *mm, unsigned long addr,
1603 int node, struct list_head *pagelist, bool migrate_all)
1605 struct vm_area_struct *vma;
1611 vma = find_vma(mm, addr);
1612 if (!vma || addr < vma->vm_start || !vma_migratable(vma))
1615 /* FOLL_DUMP to ignore special (like zero) pages */
1616 page = follow_page(vma, addr, FOLL_GET | FOLL_DUMP);
1618 err = PTR_ERR(page);
1627 if (page_to_nid(page) == node)
1631 if (page_mapcount(page) > 1 && !migrate_all)
1634 if (PageHuge(page)) {
1635 if (PageHead(page)) {
1636 isolate_huge_page(page, pagelist);
1642 head = compound_head(page);
1643 err = isolate_lru_page(head);
1648 list_add_tail(&head->lru, pagelist);
1649 mod_node_page_state(page_pgdat(head),
1650 NR_ISOLATED_ANON + page_is_file_lru(head),
1651 thp_nr_pages(head));
1655 * Either remove the duplicate refcount from
1656 * isolate_lru_page() or drop the page ref if it was
1661 mmap_read_unlock(mm);
1665 static int move_pages_and_store_status(struct mm_struct *mm, int node,
1666 struct list_head *pagelist, int __user *status,
1667 int start, int i, unsigned long nr_pages)
1671 if (list_empty(pagelist))
1674 err = do_move_pages_to_node(mm, pagelist, node);
1677 * Positive err means the number of failed
1678 * pages to migrate. Since we are going to
1679 * abort and return the number of non-migrated
1680 * pages, so need to include the rest of the
1681 * nr_pages that have not been attempted as
1685 err += nr_pages - i - 1;
1688 return store_status(status, start, node, i - start);
1692 * Migrate an array of page address onto an array of nodes and fill
1693 * the corresponding array of status.
1695 static int do_pages_move(struct mm_struct *mm, nodemask_t task_nodes,
1696 unsigned long nr_pages,
1697 const void __user * __user *pages,
1698 const int __user *nodes,
1699 int __user *status, int flags)
1701 int current_node = NUMA_NO_NODE;
1702 LIST_HEAD(pagelist);
1706 lru_cache_disable();
1708 for (i = start = 0; i < nr_pages; i++) {
1709 const void __user *p;
1714 if (get_user(p, pages + i))
1716 if (get_user(node, nodes + i))
1718 addr = (unsigned long)untagged_addr(p);
1721 if (node < 0 || node >= MAX_NUMNODES)
1723 if (!node_state(node, N_MEMORY))
1727 if (!node_isset(node, task_nodes))
1730 if (current_node == NUMA_NO_NODE) {
1731 current_node = node;
1733 } else if (node != current_node) {
1734 err = move_pages_and_store_status(mm, current_node,
1735 &pagelist, status, start, i, nr_pages);
1739 current_node = node;
1743 * Errors in the page lookup or isolation are not fatal and we simply
1744 * report them via status
1746 err = add_page_for_migration(mm, addr, current_node,
1747 &pagelist, flags & MPOL_MF_MOVE_ALL);
1750 /* The page is successfully queued for migration */
1755 * The move_pages() man page does not have an -EEXIST choice, so
1756 * use -EFAULT instead.
1762 * If the page is already on the target node (!err), store the
1763 * node, otherwise, store the err.
1765 err = store_status(status, i, err ? : current_node, 1);
1769 err = move_pages_and_store_status(mm, current_node, &pagelist,
1770 status, start, i, nr_pages);
1773 current_node = NUMA_NO_NODE;
1776 /* Make sure we do not overwrite the existing error */
1777 err1 = move_pages_and_store_status(mm, current_node, &pagelist,
1778 status, start, i, nr_pages);
1787 * Determine the nodes of an array of pages and store it in an array of status.
1789 static void do_pages_stat_array(struct mm_struct *mm, unsigned long nr_pages,
1790 const void __user **pages, int *status)
1796 for (i = 0; i < nr_pages; i++) {
1797 unsigned long addr = (unsigned long)(*pages);
1798 struct vm_area_struct *vma;
1802 vma = vma_lookup(mm, addr);
1806 /* FOLL_DUMP to ignore special (like zero) pages */
1807 page = follow_page(vma, addr, FOLL_DUMP);
1809 err = PTR_ERR(page);
1813 err = page ? page_to_nid(page) : -ENOENT;
1821 mmap_read_unlock(mm);
1824 static int get_compat_pages_array(const void __user *chunk_pages[],
1825 const void __user * __user *pages,
1826 unsigned long chunk_nr)
1828 compat_uptr_t __user *pages32 = (compat_uptr_t __user *)pages;
1832 for (i = 0; i < chunk_nr; i++) {
1833 if (get_user(p, pages32 + i))
1835 chunk_pages[i] = compat_ptr(p);
1842 * Determine the nodes of a user array of pages and store it in
1843 * a user array of status.
1845 static int do_pages_stat(struct mm_struct *mm, unsigned long nr_pages,
1846 const void __user * __user *pages,
1849 #define DO_PAGES_STAT_CHUNK_NR 16
1850 const void __user *chunk_pages[DO_PAGES_STAT_CHUNK_NR];
1851 int chunk_status[DO_PAGES_STAT_CHUNK_NR];
1854 unsigned long chunk_nr;
1856 chunk_nr = nr_pages;
1857 if (chunk_nr > DO_PAGES_STAT_CHUNK_NR)
1858 chunk_nr = DO_PAGES_STAT_CHUNK_NR;
1860 if (in_compat_syscall()) {
1861 if (get_compat_pages_array(chunk_pages, pages,
1865 if (copy_from_user(chunk_pages, pages,
1866 chunk_nr * sizeof(*chunk_pages)))
1870 do_pages_stat_array(mm, chunk_nr, chunk_pages, chunk_status);
1872 if (copy_to_user(status, chunk_status, chunk_nr * sizeof(*status)))
1877 nr_pages -= chunk_nr;
1879 return nr_pages ? -EFAULT : 0;
1882 static struct mm_struct *find_mm_struct(pid_t pid, nodemask_t *mem_nodes)
1884 struct task_struct *task;
1885 struct mm_struct *mm;
1888 * There is no need to check if current process has the right to modify
1889 * the specified process when they are same.
1893 *mem_nodes = cpuset_mems_allowed(current);
1897 /* Find the mm_struct */
1899 task = find_task_by_vpid(pid);
1902 return ERR_PTR(-ESRCH);
1904 get_task_struct(task);
1907 * Check if this process has the right to modify the specified
1908 * process. Use the regular "ptrace_may_access()" checks.
1910 if (!ptrace_may_access(task, PTRACE_MODE_READ_REALCREDS)) {
1912 mm = ERR_PTR(-EPERM);
1917 mm = ERR_PTR(security_task_movememory(task));
1920 *mem_nodes = cpuset_mems_allowed(task);
1921 mm = get_task_mm(task);
1923 put_task_struct(task);
1925 mm = ERR_PTR(-EINVAL);
1930 * Move a list of pages in the address space of the currently executing
1933 static int kernel_move_pages(pid_t pid, unsigned long nr_pages,
1934 const void __user * __user *pages,
1935 const int __user *nodes,
1936 int __user *status, int flags)
1938 struct mm_struct *mm;
1940 nodemask_t task_nodes;
1943 if (flags & ~(MPOL_MF_MOVE|MPOL_MF_MOVE_ALL))
1946 if ((flags & MPOL_MF_MOVE_ALL) && !capable(CAP_SYS_NICE))
1949 mm = find_mm_struct(pid, &task_nodes);
1954 err = do_pages_move(mm, task_nodes, nr_pages, pages,
1955 nodes, status, flags);
1957 err = do_pages_stat(mm, nr_pages, pages, status);
1963 SYSCALL_DEFINE6(move_pages, pid_t, pid, unsigned long, nr_pages,
1964 const void __user * __user *, pages,
1965 const int __user *, nodes,
1966 int __user *, status, int, flags)
1968 return kernel_move_pages(pid, nr_pages, pages, nodes, status, flags);
1971 #ifdef CONFIG_NUMA_BALANCING
1973 * Returns true if this is a safe migration target node for misplaced NUMA
1974 * pages. Currently it only checks the watermarks which crude
1976 static bool migrate_balanced_pgdat(struct pglist_data *pgdat,
1977 unsigned long nr_migrate_pages)
1981 for (z = pgdat->nr_zones - 1; z >= 0; z--) {
1982 struct zone *zone = pgdat->node_zones + z;
1984 if (!populated_zone(zone))
1987 /* Avoid waking kswapd by allocating pages_to_migrate pages. */
1988 if (!zone_watermark_ok(zone, 0,
1989 high_wmark_pages(zone) +
1998 static struct page *alloc_misplaced_dst_page(struct page *page,
2001 int nid = (int) data;
2002 struct page *newpage;
2004 newpage = __alloc_pages_node(nid,
2005 (GFP_HIGHUSER_MOVABLE |
2006 __GFP_THISNODE | __GFP_NOMEMALLOC |
2007 __GFP_NORETRY | __GFP_NOWARN) &
2013 static struct page *alloc_misplaced_dst_page_thp(struct page *page,
2016 int nid = (int) data;
2017 struct page *newpage;
2019 newpage = alloc_pages_node(nid, (GFP_TRANSHUGE_LIGHT | __GFP_THISNODE),
2024 prep_transhuge_page(newpage);
2030 static int numamigrate_isolate_page(pg_data_t *pgdat, struct page *page)
2033 int nr_pages = thp_nr_pages(page);
2034 int order = compound_order(page);
2036 VM_BUG_ON_PAGE(order && !PageTransHuge(page), page);
2038 /* Do not migrate THP mapped by multiple processes */
2039 if (PageTransHuge(page) && total_mapcount(page) > 1)
2042 /* Avoid migrating to a node that is nearly full */
2043 if (!migrate_balanced_pgdat(pgdat, nr_pages)) {
2046 if (!(sysctl_numa_balancing_mode & NUMA_BALANCING_MEMORY_TIERING))
2048 for (z = pgdat->nr_zones - 1; z >= 0; z--) {
2049 if (populated_zone(pgdat->node_zones + z))
2052 wakeup_kswapd(pgdat->node_zones + z, 0, order, ZONE_MOVABLE);
2056 if (isolate_lru_page(page))
2059 page_lru = page_is_file_lru(page);
2060 mod_node_page_state(page_pgdat(page), NR_ISOLATED_ANON + page_lru,
2064 * Isolating the page has taken another reference, so the
2065 * caller's reference can be safely dropped without the page
2066 * disappearing underneath us during migration.
2073 * Attempt to migrate a misplaced page to the specified destination
2074 * node. Caller is expected to have an elevated reference count on
2075 * the page that will be dropped by this function before returning.
2077 int migrate_misplaced_page(struct page *page, struct vm_area_struct *vma,
2080 pg_data_t *pgdat = NODE_DATA(node);
2083 unsigned int nr_succeeded;
2084 LIST_HEAD(migratepages);
2087 int nr_pages = thp_nr_pages(page);
2090 * PTE mapped THP or HugeTLB page can't reach here so the page could
2091 * be either base page or THP. And it must be head page if it is
2094 compound = PageTransHuge(page);
2097 new = alloc_misplaced_dst_page_thp;
2099 new = alloc_misplaced_dst_page;
2102 * Don't migrate file pages that are mapped in multiple processes
2103 * with execute permissions as they are probably shared libraries.
2105 if (page_mapcount(page) != 1 && page_is_file_lru(page) &&
2106 (vma->vm_flags & VM_EXEC))
2110 * Also do not migrate dirty pages as not all filesystems can move
2111 * dirty pages in MIGRATE_ASYNC mode which is a waste of cycles.
2113 if (page_is_file_lru(page) && PageDirty(page))
2116 isolated = numamigrate_isolate_page(pgdat, page);
2120 list_add(&page->lru, &migratepages);
2121 nr_remaining = migrate_pages(&migratepages, *new, NULL, node,
2122 MIGRATE_ASYNC, MR_NUMA_MISPLACED,
2125 if (!list_empty(&migratepages)) {
2126 list_del(&page->lru);
2127 mod_node_page_state(page_pgdat(page), NR_ISOLATED_ANON +
2128 page_is_file_lru(page), -nr_pages);
2129 putback_lru_page(page);
2134 count_vm_numa_events(NUMA_PAGE_MIGRATE, nr_succeeded);
2135 if (!node_is_toptier(page_to_nid(page)) && node_is_toptier(node))
2136 mod_node_page_state(pgdat, PGPROMOTE_SUCCESS,
2139 BUG_ON(!list_empty(&migratepages));
2146 #endif /* CONFIG_NUMA_BALANCING */
2147 #endif /* CONFIG_NUMA */
2150 * node_demotion[] example:
2152 * Consider a system with two sockets. Each socket has
2153 * three classes of memory attached: fast, medium and slow.
2154 * Each memory class is placed in its own NUMA node. The
2155 * CPUs are placed in the node with the "fast" memory. The
2156 * 6 NUMA nodes (0-5) might be split among the sockets like
2162 * When Node 0 fills up, its memory should be migrated to
2163 * Node 1. When Node 1 fills up, it should be migrated to
2164 * Node 2. The migration path start on the nodes with the
2165 * processors (since allocations default to this node) and
2166 * fast memory, progress through medium and end with the
2169 * 0 -> 1 -> 2 -> stop
2170 * 3 -> 4 -> 5 -> stop
2172 * This is represented in the node_demotion[] like this:
2174 * { nr=1, nodes[0]=1 }, // Node 0 migrates to 1
2175 * { nr=1, nodes[0]=2 }, // Node 1 migrates to 2
2176 * { nr=0, nodes[0]=-1 }, // Node 2 does not migrate
2177 * { nr=1, nodes[0]=4 }, // Node 3 migrates to 4
2178 * { nr=1, nodes[0]=5 }, // Node 4 migrates to 5
2179 * { nr=0, nodes[0]=-1 }, // Node 5 does not migrate
2181 * Moreover some systems may have multiple slow memory nodes.
2182 * Suppose a system has one socket with 3 memory nodes, node 0
2183 * is fast memory type, and node 1/2 both are slow memory
2184 * type, and the distance between fast memory node and slow
2185 * memory node is same. So the migration path should be:
2189 * This is represented in the node_demotion[] like this:
2190 * { nr=2, {nodes[0]=1, nodes[1]=2} }, // Node 0 migrates to node 1 and node 2
2191 * { nr=0, nodes[0]=-1, }, // Node 1 dose not migrate
2192 * { nr=0, nodes[0]=-1, }, // Node 2 does not migrate
2196 * Writes to this array occur without locking. Cycles are
2197 * not allowed: Node X demotes to Y which demotes to X...
2199 * If multiple reads are performed, a single rcu_read_lock()
2200 * must be held over all reads to ensure that no cycles are
2203 #define DEFAULT_DEMOTION_TARGET_NODES 15
2205 #if MAX_NUMNODES < DEFAULT_DEMOTION_TARGET_NODES
2206 #define DEMOTION_TARGET_NODES (MAX_NUMNODES - 1)
2208 #define DEMOTION_TARGET_NODES DEFAULT_DEMOTION_TARGET_NODES
2211 struct demotion_nodes {
2213 short nodes[DEMOTION_TARGET_NODES];
2216 static struct demotion_nodes *node_demotion __read_mostly;
2219 * next_demotion_node() - Get the next node in the demotion path
2220 * @node: The starting node to lookup the next node
2222 * Return: node id for next memory node in the demotion path hierarchy
2223 * from @node; NUMA_NO_NODE if @node is terminal. This does not keep
2224 * @node online or guarantee that it *continues* to be the next demotion
2227 int next_demotion_node(int node)
2229 struct demotion_nodes *nd;
2230 unsigned short target_nr, index;
2234 return NUMA_NO_NODE;
2236 nd = &node_demotion[node];
2239 * node_demotion[] is updated without excluding this
2240 * function from running. RCU doesn't provide any
2241 * compiler barriers, so the READ_ONCE() is required
2242 * to avoid compiler reordering or read merging.
2244 * Make sure to use RCU over entire code blocks if
2245 * node_demotion[] reads need to be consistent.
2248 target_nr = READ_ONCE(nd->nr);
2250 switch (target_nr) {
2252 target = NUMA_NO_NODE;
2259 * If there are multiple target nodes, just select one
2260 * target node randomly.
2262 * In addition, we can also use round-robin to select
2263 * target node, but we should introduce another variable
2264 * for node_demotion[] to record last selected target node,
2265 * that may cause cache ping-pong due to the changing of
2266 * last target node. Or introducing per-cpu data to avoid
2267 * caching issue, which seems more complicated. So selecting
2268 * target node randomly seems better until now.
2270 index = get_random_int() % target_nr;
2274 target = READ_ONCE(nd->nodes[index]);
2281 #if defined(CONFIG_HOTPLUG_CPU)
2282 /* Disable reclaim-based migration. */
2283 static void __disable_all_migrate_targets(void)
2290 for_each_online_node(node) {
2291 node_demotion[node].nr = 0;
2292 for (i = 0; i < DEMOTION_TARGET_NODES; i++)
2293 node_demotion[node].nodes[i] = NUMA_NO_NODE;
2297 static void disable_all_migrate_targets(void)
2299 __disable_all_migrate_targets();
2302 * Ensure that the "disable" is visible across the system.
2303 * Readers will see either a combination of before+disable
2304 * state or disable+after. They will never see before and
2305 * after state together.
2307 * The before+after state together might have cycles and
2308 * could cause readers to do things like loop until this
2309 * function finishes. This ensures they can only see a
2310 * single "bad" read and would, for instance, only loop
2317 * Find an automatic demotion target for 'node'.
2318 * Failing here is OK. It might just indicate
2319 * being at the end of a chain.
2321 static int establish_migrate_target(int node, nodemask_t *used,
2324 int migration_target, index, val;
2325 struct demotion_nodes *nd;
2328 return NUMA_NO_NODE;
2330 nd = &node_demotion[node];
2332 migration_target = find_next_best_node(node, used);
2333 if (migration_target == NUMA_NO_NODE)
2334 return NUMA_NO_NODE;
2337 * If the node has been set a migration target node before,
2338 * which means it's the best distance between them. Still
2339 * check if this node can be demoted to other target nodes
2340 * if they have a same best distance.
2342 if (best_distance != -1) {
2343 val = node_distance(node, migration_target);
2344 if (val > best_distance)
2349 if (WARN_ONCE(index >= DEMOTION_TARGET_NODES,
2350 "Exceeds maximum demotion target nodes\n"))
2353 nd->nodes[index] = migration_target;
2356 return migration_target;
2358 node_clear(migration_target, *used);
2359 return NUMA_NO_NODE;
2363 * When memory fills up on a node, memory contents can be
2364 * automatically migrated to another node instead of
2365 * discarded at reclaim.
2367 * Establish a "migration path" which will start at nodes
2368 * with CPUs and will follow the priorities used to build the
2369 * page allocator zonelists.
2371 * The difference here is that cycles must be avoided. If
2372 * node0 migrates to node1, then neither node1, nor anything
2373 * node1 migrates to can migrate to node0. Also one node can
2374 * be migrated to multiple nodes if the target nodes all have
2375 * a same best-distance against the source node.
2377 * This function can run simultaneously with readers of
2378 * node_demotion[]. However, it can not run simultaneously
2379 * with itself. Exclusion is provided by memory hotplug events
2380 * being single-threaded.
2382 static void __set_migration_target_nodes(void)
2384 nodemask_t next_pass = NODE_MASK_NONE;
2385 nodemask_t this_pass = NODE_MASK_NONE;
2386 nodemask_t used_targets = NODE_MASK_NONE;
2387 int node, best_distance;
2390 * Avoid any oddities like cycles that could occur
2391 * from changes in the topology. This will leave
2392 * a momentary gap when migration is disabled.
2394 disable_all_migrate_targets();
2397 * Allocations go close to CPUs, first. Assume that
2398 * the migration path starts at the nodes with CPUs.
2400 next_pass = node_states[N_CPU];
2402 this_pass = next_pass;
2403 next_pass = NODE_MASK_NONE;
2405 * To avoid cycles in the migration "graph", ensure
2406 * that migration sources are not future targets by
2407 * setting them in 'used_targets'. Do this only
2408 * once per pass so that multiple source nodes can
2409 * share a target node.
2411 * 'used_targets' will become unavailable in future
2412 * passes. This limits some opportunities for
2413 * multiple source nodes to share a destination.
2415 nodes_or(used_targets, used_targets, this_pass);
2417 for_each_node_mask(node, this_pass) {
2421 * Try to set up the migration path for the node, and the target
2422 * migration nodes can be multiple, so doing a loop to find all
2423 * the target nodes if they all have a best node distance.
2427 establish_migrate_target(node, &used_targets,
2430 if (target_node == NUMA_NO_NODE)
2433 if (best_distance == -1)
2434 best_distance = node_distance(node, target_node);
2437 * Visit targets from this pass in the next pass.
2438 * Eventually, every node will have been part of
2439 * a pass, and will become set in 'used_targets'.
2441 node_set(target_node, next_pass);
2445 * 'next_pass' contains nodes which became migration
2446 * targets in this pass. Make additional passes until
2447 * no more migrations targets are available.
2449 if (!nodes_empty(next_pass))
2454 * For callers that do not hold get_online_mems() already.
2456 void set_migration_target_nodes(void)
2459 __set_migration_target_nodes();
2464 * This leaves migrate-on-reclaim transiently disabled between
2465 * the MEM_GOING_OFFLINE and MEM_OFFLINE events. This runs
2466 * whether reclaim-based migration is enabled or not, which
2467 * ensures that the user can turn reclaim-based migration at
2468 * any time without needing to recalculate migration targets.
2470 * These callbacks already hold get_online_mems(). That is why
2471 * __set_migration_target_nodes() can be used as opposed to
2472 * set_migration_target_nodes().
2474 static int __meminit migrate_on_reclaim_callback(struct notifier_block *self,
2475 unsigned long action, void *_arg)
2477 struct memory_notify *arg = _arg;
2480 * Only update the node migration order when a node is
2481 * changing status, like online->offline. This avoids
2482 * the overhead of synchronize_rcu() in most cases.
2484 if (arg->status_change_nid < 0)
2485 return notifier_from_errno(0);
2488 case MEM_GOING_OFFLINE:
2490 * Make sure there are not transient states where
2491 * an offline node is a migration target. This
2492 * will leave migration disabled until the offline
2493 * completes and the MEM_OFFLINE case below runs.
2495 disable_all_migrate_targets();
2500 * Recalculate the target nodes once the node
2501 * reaches its final state (online or offline).
2503 __set_migration_target_nodes();
2505 case MEM_CANCEL_OFFLINE:
2507 * MEM_GOING_OFFLINE disabled all the migration
2508 * targets. Reenable them.
2510 __set_migration_target_nodes();
2512 case MEM_GOING_ONLINE:
2513 case MEM_CANCEL_ONLINE:
2517 return notifier_from_errno(0);
2520 void __init migrate_on_reclaim_init(void)
2522 node_demotion = kmalloc_array(nr_node_ids,
2523 sizeof(struct demotion_nodes),
2525 WARN_ON(!node_demotion);
2527 hotplug_memory_notifier(migrate_on_reclaim_callback, 100);
2529 * At this point, all numa nodes with memory/CPus have their state
2530 * properly set, so we can build the demotion order now.
2531 * Let us hold the cpu_hotplug lock just, as we could possibily have
2532 * CPU hotplug events during boot.
2535 set_migration_target_nodes();
2538 #endif /* CONFIG_HOTPLUG_CPU */
2540 bool numa_demotion_enabled = false;
2543 static ssize_t numa_demotion_enabled_show(struct kobject *kobj,
2544 struct kobj_attribute *attr, char *buf)
2546 return sysfs_emit(buf, "%s\n",
2547 numa_demotion_enabled ? "true" : "false");
2550 static ssize_t numa_demotion_enabled_store(struct kobject *kobj,
2551 struct kobj_attribute *attr,
2552 const char *buf, size_t count)
2554 if (!strncmp(buf, "true", 4) || !strncmp(buf, "1", 1))
2555 numa_demotion_enabled = true;
2556 else if (!strncmp(buf, "false", 5) || !strncmp(buf, "0", 1))
2557 numa_demotion_enabled = false;
2564 static struct kobj_attribute numa_demotion_enabled_attr =
2565 __ATTR(demotion_enabled, 0644, numa_demotion_enabled_show,
2566 numa_demotion_enabled_store);
2568 static struct attribute *numa_attrs[] = {
2569 &numa_demotion_enabled_attr.attr,
2573 static const struct attribute_group numa_attr_group = {
2574 .attrs = numa_attrs,
2577 static int __init numa_init_sysfs(void)
2580 struct kobject *numa_kobj;
2582 numa_kobj = kobject_create_and_add("numa", mm_kobj);
2584 pr_err("failed to create numa kobject\n");
2587 err = sysfs_create_group(numa_kobj, &numa_attr_group);
2589 pr_err("failed to register numa group\n");
2595 kobject_put(numa_kobj);
2598 subsys_initcall(numa_init_sysfs);