migrate.c revision 11bc82d67d1150767901bca54a24466621d763d7
1/*
2 * Memory Migration functionality - linux/mm/migration.c
3 *
4 * Copyright (C) 2006 Silicon Graphics, Inc., Christoph Lameter
5 *
6 * Page migration was first developed in the context of the memory hotplug
7 * project. The main authors of the migration code are:
8 *
9 * IWAMOTO Toshihiro <iwamoto@valinux.co.jp>
10 * Hirokazu Takahashi <taka@valinux.co.jp>
11 * Dave Hansen <haveblue@us.ibm.com>
12 * Christoph Lameter
13 */
14
15#include <linux/migrate.h>
16#include <linux/module.h>
17#include <linux/swap.h>
18#include <linux/swapops.h>
19#include <linux/pagemap.h>
20#include <linux/buffer_head.h>
21#include <linux/mm_inline.h>
22#include <linux/nsproxy.h>
23#include <linux/pagevec.h>
24#include <linux/ksm.h>
25#include <linux/rmap.h>
26#include <linux/topology.h>
27#include <linux/cpu.h>
28#include <linux/cpuset.h>
29#include <linux/writeback.h>
30#include <linux/mempolicy.h>
31#include <linux/vmalloc.h>
32#include <linux/security.h>
33#include <linux/memcontrol.h>
34#include <linux/syscalls.h>
35#include <linux/hugetlb.h>
36#include <linux/gfp.h>
37
38#include <asm/tlbflush.h>
39
40#include "internal.h"
41
42#define lru_to_page(_head) (list_entry((_head)->prev, struct page, lru))
43
44/*
45 * migrate_prep() needs to be called before we start compiling a list of pages
46 * to be migrated using isolate_lru_page(). If scheduling work on other CPUs is
47 * undesirable, use migrate_prep_local()
48 */
49int migrate_prep(void)
50{
51	/*
52	 * Clear the LRU lists so pages can be isolated.
53	 * Note that pages may be moved off the LRU after we have
54	 * drained them. Those pages will fail to migrate like other
55	 * pages that may be busy.
56	 */
57	lru_add_drain_all();
58
59	return 0;
60}
61
62/* Do the necessary work of migrate_prep but not if it involves other CPUs */
63int migrate_prep_local(void)
64{
65	lru_add_drain();
66
67	return 0;
68}
69
70/*
71 * Add isolated pages on the list back to the LRU under page lock
72 * to avoid leaking evictable pages back onto unevictable list.
73 */
74void putback_lru_pages(struct list_head *l)
75{
76	struct page *page;
77	struct page *page2;
78
79	list_for_each_entry_safe(page, page2, l, lru) {
80		list_del(&page->lru);
81		dec_zone_page_state(page, NR_ISOLATED_ANON +
82				page_is_file_cache(page));
83		putback_lru_page(page);
84	}
85}
86
87/*
88 * Restore a potential migration pte to a working pte entry
89 */
90static int remove_migration_pte(struct page *new, struct vm_area_struct *vma,
91				 unsigned long addr, void *old)
92{
93	struct mm_struct *mm = vma->vm_mm;
94	swp_entry_t entry;
95 	pgd_t *pgd;
96 	pud_t *pud;
97 	pmd_t *pmd;
98	pte_t *ptep, pte;
99 	spinlock_t *ptl;
100
101	if (unlikely(PageHuge(new))) {
102		ptep = huge_pte_offset(mm, addr);
103		if (!ptep)
104			goto out;
105		ptl = &mm->page_table_lock;
106	} else {
107		pgd = pgd_offset(mm, addr);
108		if (!pgd_present(*pgd))
109			goto out;
110
111		pud = pud_offset(pgd, addr);
112		if (!pud_present(*pud))
113			goto out;
114
115		pmd = pmd_offset(pud, addr);
116		if (pmd_trans_huge(*pmd))
117			goto out;
118		if (!pmd_present(*pmd))
119			goto out;
120
121		ptep = pte_offset_map(pmd, addr);
122
123		if (!is_swap_pte(*ptep)) {
124			pte_unmap(ptep);
125			goto out;
126		}
127
128		ptl = pte_lockptr(mm, pmd);
129	}
130
131 	spin_lock(ptl);
132	pte = *ptep;
133	if (!is_swap_pte(pte))
134		goto unlock;
135
136	entry = pte_to_swp_entry(pte);
137
138	if (!is_migration_entry(entry) ||
139	    migration_entry_to_page(entry) != old)
140		goto unlock;
141
142	get_page(new);
143	pte = pte_mkold(mk_pte(new, vma->vm_page_prot));
144	if (is_write_migration_entry(entry))
145		pte = pte_mkwrite(pte);
146#ifdef CONFIG_HUGETLB_PAGE
147	if (PageHuge(new))
148		pte = pte_mkhuge(pte);
149#endif
150	flush_cache_page(vma, addr, pte_pfn(pte));
151	set_pte_at(mm, addr, ptep, pte);
152
153	if (PageHuge(new)) {
154		if (PageAnon(new))
155			hugepage_add_anon_rmap(new, vma, addr);
156		else
157			page_dup_rmap(new);
158	} else if (PageAnon(new))
159		page_add_anon_rmap(new, vma, addr);
160	else
161		page_add_file_rmap(new);
162
163	/* No need to invalidate - it was non-present before */
164	update_mmu_cache(vma, addr, ptep);
165unlock:
166	pte_unmap_unlock(ptep, ptl);
167out:
168	return SWAP_AGAIN;
169}
170
171/*
172 * Get rid of all migration entries and replace them by
173 * references to the indicated page.
174 */
175static void remove_migration_ptes(struct page *old, struct page *new)
176{
177	rmap_walk(new, remove_migration_pte, old);
178}
179
180/*
181 * Something used the pte of a page under migration. We need to
182 * get to the page and wait until migration is finished.
183 * When we return from this function the fault will be retried.
184 *
185 * This function is called from do_swap_page().
186 */
187void migration_entry_wait(struct mm_struct *mm, pmd_t *pmd,
188				unsigned long address)
189{
190	pte_t *ptep, pte;
191	spinlock_t *ptl;
192	swp_entry_t entry;
193	struct page *page;
194
195	ptep = pte_offset_map_lock(mm, pmd, address, &ptl);
196	pte = *ptep;
197	if (!is_swap_pte(pte))
198		goto out;
199
200	entry = pte_to_swp_entry(pte);
201	if (!is_migration_entry(entry))
202		goto out;
203
204	page = migration_entry_to_page(entry);
205
206	/*
207	 * Once radix-tree replacement of page migration started, page_count
208	 * *must* be zero. And, we don't want to call wait_on_page_locked()
209	 * against a page without get_page().
210	 * So, we use get_page_unless_zero(), here. Even failed, page fault
211	 * will occur again.
212	 */
213	if (!get_page_unless_zero(page))
214		goto out;
215	pte_unmap_unlock(ptep, ptl);
216	wait_on_page_locked(page);
217	put_page(page);
218	return;
219out:
220	pte_unmap_unlock(ptep, ptl);
221}
222
223/*
224 * Replace the page in the mapping.
225 *
226 * The number of remaining references must be:
227 * 1 for anonymous pages without a mapping
228 * 2 for pages with a mapping
229 * 3 for pages with a mapping and PagePrivate/PagePrivate2 set.
230 */
231static int migrate_page_move_mapping(struct address_space *mapping,
232		struct page *newpage, struct page *page)
233{
234	int expected_count;
235	void **pslot;
236
237	if (!mapping) {
238		/* Anonymous page without mapping */
239		if (page_count(page) != 1)
240			return -EAGAIN;
241		return 0;
242	}
243
244	spin_lock_irq(&mapping->tree_lock);
245
246	pslot = radix_tree_lookup_slot(&mapping->page_tree,
247 					page_index(page));
248
249	expected_count = 2 + page_has_private(page);
250	if (page_count(page) != expected_count ||
251		radix_tree_deref_slot_protected(pslot, &mapping->tree_lock) != page) {
252		spin_unlock_irq(&mapping->tree_lock);
253		return -EAGAIN;
254	}
255
256	if (!page_freeze_refs(page, expected_count)) {
257		spin_unlock_irq(&mapping->tree_lock);
258		return -EAGAIN;
259	}
260
261	/*
262	 * Now we know that no one else is looking at the page.
263	 */
264	get_page(newpage);	/* add cache reference */
265	if (PageSwapCache(page)) {
266		SetPageSwapCache(newpage);
267		set_page_private(newpage, page_private(page));
268	}
269
270	radix_tree_replace_slot(pslot, newpage);
271
272	page_unfreeze_refs(page, expected_count);
273	/*
274	 * Drop cache reference from old page.
275	 * We know this isn't the last reference.
276	 */
277	__put_page(page);
278
279	/*
280	 * If moved to a different zone then also account
281	 * the page for that zone. Other VM counters will be
282	 * taken care of when we establish references to the
283	 * new page and drop references to the old page.
284	 *
285	 * Note that anonymous pages are accounted for
286	 * via NR_FILE_PAGES and NR_ANON_PAGES if they
287	 * are mapped to swap space.
288	 */
289	__dec_zone_page_state(page, NR_FILE_PAGES);
290	__inc_zone_page_state(newpage, NR_FILE_PAGES);
291	if (PageSwapBacked(page)) {
292		__dec_zone_page_state(page, NR_SHMEM);
293		__inc_zone_page_state(newpage, NR_SHMEM);
294	}
295	spin_unlock_irq(&mapping->tree_lock);
296
297	return 0;
298}
299
300/*
301 * The expected number of remaining references is the same as that
302 * of migrate_page_move_mapping().
303 */
304int migrate_huge_page_move_mapping(struct address_space *mapping,
305				   struct page *newpage, struct page *page)
306{
307	int expected_count;
308	void **pslot;
309
310	if (!mapping) {
311		if (page_count(page) != 1)
312			return -EAGAIN;
313		return 0;
314	}
315
316	spin_lock_irq(&mapping->tree_lock);
317
318	pslot = radix_tree_lookup_slot(&mapping->page_tree,
319					page_index(page));
320
321	expected_count = 2 + page_has_private(page);
322	if (page_count(page) != expected_count ||
323		radix_tree_deref_slot_protected(pslot, &mapping->tree_lock) != page) {
324		spin_unlock_irq(&mapping->tree_lock);
325		return -EAGAIN;
326	}
327
328	if (!page_freeze_refs(page, expected_count)) {
329		spin_unlock_irq(&mapping->tree_lock);
330		return -EAGAIN;
331	}
332
333	get_page(newpage);
334
335	radix_tree_replace_slot(pslot, newpage);
336
337	page_unfreeze_refs(page, expected_count);
338
339	__put_page(page);
340
341	spin_unlock_irq(&mapping->tree_lock);
342	return 0;
343}
344
345/*
346 * Copy the page to its new location
347 */
348void migrate_page_copy(struct page *newpage, struct page *page)
349{
350	if (PageHuge(page))
351		copy_huge_page(newpage, page);
352	else
353		copy_highpage(newpage, page);
354
355	if (PageError(page))
356		SetPageError(newpage);
357	if (PageReferenced(page))
358		SetPageReferenced(newpage);
359	if (PageUptodate(page))
360		SetPageUptodate(newpage);
361	if (TestClearPageActive(page)) {
362		VM_BUG_ON(PageUnevictable(page));
363		SetPageActive(newpage);
364	} else if (TestClearPageUnevictable(page))
365		SetPageUnevictable(newpage);
366	if (PageChecked(page))
367		SetPageChecked(newpage);
368	if (PageMappedToDisk(page))
369		SetPageMappedToDisk(newpage);
370
371	if (PageDirty(page)) {
372		clear_page_dirty_for_io(page);
373		/*
374		 * Want to mark the page and the radix tree as dirty, and
375		 * redo the accounting that clear_page_dirty_for_io undid,
376		 * but we can't use set_page_dirty because that function
377		 * is actually a signal that all of the page has become dirty.
378		 * Wheras only part of our page may be dirty.
379		 */
380		__set_page_dirty_nobuffers(newpage);
381 	}
382
383	mlock_migrate_page(newpage, page);
384	ksm_migrate_page(newpage, page);
385
386	ClearPageSwapCache(page);
387	ClearPagePrivate(page);
388	set_page_private(page, 0);
389	page->mapping = NULL;
390
391	/*
392	 * If any waiters have accumulated on the new page then
393	 * wake them up.
394	 */
395	if (PageWriteback(newpage))
396		end_page_writeback(newpage);
397}
398
399/************************************************************
400 *                    Migration functions
401 ***********************************************************/
402
403/* Always fail migration. Used for mappings that are not movable */
404int fail_migrate_page(struct address_space *mapping,
405			struct page *newpage, struct page *page)
406{
407	return -EIO;
408}
409EXPORT_SYMBOL(fail_migrate_page);
410
411/*
412 * Common logic to directly migrate a single page suitable for
413 * pages that do not use PagePrivate/PagePrivate2.
414 *
415 * Pages are locked upon entry and exit.
416 */
417int migrate_page(struct address_space *mapping,
418		struct page *newpage, struct page *page)
419{
420	int rc;
421
422	BUG_ON(PageWriteback(page));	/* Writeback must be complete */
423
424	rc = migrate_page_move_mapping(mapping, newpage, page);
425
426	if (rc)
427		return rc;
428
429	migrate_page_copy(newpage, page);
430	return 0;
431}
432EXPORT_SYMBOL(migrate_page);
433
434#ifdef CONFIG_BLOCK
435/*
436 * Migration function for pages with buffers. This function can only be used
437 * if the underlying filesystem guarantees that no other references to "page"
438 * exist.
439 */
440int buffer_migrate_page(struct address_space *mapping,
441		struct page *newpage, struct page *page)
442{
443	struct buffer_head *bh, *head;
444	int rc;
445
446	if (!page_has_buffers(page))
447		return migrate_page(mapping, newpage, page);
448
449	head = page_buffers(page);
450
451	rc = migrate_page_move_mapping(mapping, newpage, page);
452
453	if (rc)
454		return rc;
455
456	bh = head;
457	do {
458		get_bh(bh);
459		lock_buffer(bh);
460		bh = bh->b_this_page;
461
462	} while (bh != head);
463
464	ClearPagePrivate(page);
465	set_page_private(newpage, page_private(page));
466	set_page_private(page, 0);
467	put_page(page);
468	get_page(newpage);
469
470	bh = head;
471	do {
472		set_bh_page(bh, newpage, bh_offset(bh));
473		bh = bh->b_this_page;
474
475	} while (bh != head);
476
477	SetPagePrivate(newpage);
478
479	migrate_page_copy(newpage, page);
480
481	bh = head;
482	do {
483		unlock_buffer(bh);
484 		put_bh(bh);
485		bh = bh->b_this_page;
486
487	} while (bh != head);
488
489	return 0;
490}
491EXPORT_SYMBOL(buffer_migrate_page);
492#endif
493
494/*
495 * Writeback a page to clean the dirty state
496 */
497static int writeout(struct address_space *mapping, struct page *page)
498{
499	struct writeback_control wbc = {
500		.sync_mode = WB_SYNC_NONE,
501		.nr_to_write = 1,
502		.range_start = 0,
503		.range_end = LLONG_MAX,
504		.for_reclaim = 1
505	};
506	int rc;
507
508	if (!mapping->a_ops->writepage)
509		/* No write method for the address space */
510		return -EINVAL;
511
512	if (!clear_page_dirty_for_io(page))
513		/* Someone else already triggered a write */
514		return -EAGAIN;
515
516	/*
517	 * A dirty page may imply that the underlying filesystem has
518	 * the page on some queue. So the page must be clean for
519	 * migration. Writeout may mean we loose the lock and the
520	 * page state is no longer what we checked for earlier.
521	 * At this point we know that the migration attempt cannot
522	 * be successful.
523	 */
524	remove_migration_ptes(page, page);
525
526	rc = mapping->a_ops->writepage(page, &wbc);
527
528	if (rc != AOP_WRITEPAGE_ACTIVATE)
529		/* unlocked. Relock */
530		lock_page(page);
531
532	return (rc < 0) ? -EIO : -EAGAIN;
533}
534
535/*
536 * Default handling if a filesystem does not provide a migration function.
537 */
538static int fallback_migrate_page(struct address_space *mapping,
539	struct page *newpage, struct page *page)
540{
541	if (PageDirty(page))
542		return writeout(mapping, page);
543
544	/*
545	 * Buffers may be managed in a filesystem specific way.
546	 * We must have no buffers or drop them.
547	 */
548	if (page_has_private(page) &&
549	    !try_to_release_page(page, GFP_KERNEL))
550		return -EAGAIN;
551
552	return migrate_page(mapping, newpage, page);
553}
554
555/*
556 * Move a page to a newly allocated page
557 * The page is locked and all ptes have been successfully removed.
558 *
559 * The new page will have replaced the old page if this function
560 * is successful.
561 *
562 * Return value:
563 *   < 0 - error code
564 *  == 0 - success
565 */
566static int move_to_new_page(struct page *newpage, struct page *page,
567					int remap_swapcache, bool sync)
568{
569	struct address_space *mapping;
570	int rc;
571
572	/*
573	 * Block others from accessing the page when we get around to
574	 * establishing additional references. We are the only one
575	 * holding a reference to the new page at this point.
576	 */
577	if (!trylock_page(newpage))
578		BUG();
579
580	/* Prepare mapping for the new page.*/
581	newpage->index = page->index;
582	newpage->mapping = page->mapping;
583	if (PageSwapBacked(page))
584		SetPageSwapBacked(newpage);
585
586	mapping = page_mapping(page);
587	if (!mapping)
588		rc = migrate_page(mapping, newpage, page);
589	else {
590		/*
591		 * Do not writeback pages if !sync and migratepage is
592		 * not pointing to migrate_page() which is nonblocking
593		 * (swapcache/tmpfs uses migratepage = migrate_page).
594		 */
595		if (PageDirty(page) && !sync &&
596		    mapping->a_ops->migratepage != migrate_page)
597			rc = -EBUSY;
598		else if (mapping->a_ops->migratepage)
599			/*
600			 * Most pages have a mapping and most filesystems
601			 * should provide a migration function. Anonymous
602			 * pages are part of swap space which also has its
603			 * own migration function. This is the most common
604			 * path for page migration.
605			 */
606			rc = mapping->a_ops->migratepage(mapping,
607							newpage, page);
608		else
609			rc = fallback_migrate_page(mapping, newpage, page);
610	}
611
612	if (rc) {
613		newpage->mapping = NULL;
614	} else {
615		if (remap_swapcache)
616			remove_migration_ptes(page, newpage);
617	}
618
619	unlock_page(newpage);
620
621	return rc;
622}
623
624/*
625 * Obtain the lock on page, remove all ptes and migrate the page
626 * to the newly allocated page in newpage.
627 */
628static int unmap_and_move(new_page_t get_new_page, unsigned long private,
629			struct page *page, int force, bool offlining, bool sync)
630{
631	int rc = 0;
632	int *result = NULL;
633	struct page *newpage = get_new_page(page, private, &result);
634	int remap_swapcache = 1;
635	int charge = 0;
636	struct mem_cgroup *mem = NULL;
637	struct anon_vma *anon_vma = NULL;
638
639	if (!newpage)
640		return -ENOMEM;
641
642	if (page_count(page) == 1) {
643		/* page was freed from under us. So we are done. */
644		goto move_newpage;
645	}
646	if (unlikely(PageTransHuge(page)))
647		if (unlikely(split_huge_page(page)))
648			goto move_newpage;
649
650	/* prepare cgroup just returns 0 or -ENOMEM */
651	rc = -EAGAIN;
652
653	if (!trylock_page(page)) {
654		if (!force || !sync)
655			goto move_newpage;
656
657		/*
658		 * It's not safe for direct compaction to call lock_page.
659		 * For example, during page readahead pages are added locked
660		 * to the LRU. Later, when the IO completes the pages are
661		 * marked uptodate and unlocked. However, the queueing
662		 * could be merging multiple pages for one bio (e.g.
663		 * mpage_readpages). If an allocation happens for the
664		 * second or third page, the process can end up locking
665		 * the same page twice and deadlocking. Rather than
666		 * trying to be clever about what pages can be locked,
667		 * avoid the use of lock_page for direct compaction
668		 * altogether.
669		 */
670		if (current->flags & PF_MEMALLOC)
671			goto move_newpage;
672
673		lock_page(page);
674	}
675
676	/*
677	 * Only memory hotplug's offline_pages() caller has locked out KSM,
678	 * and can safely migrate a KSM page.  The other cases have skipped
679	 * PageKsm along with PageReserved - but it is only now when we have
680	 * the page lock that we can be certain it will not go KSM beneath us
681	 * (KSM will not upgrade a page from PageAnon to PageKsm when it sees
682	 * its pagecount raised, but only here do we take the page lock which
683	 * serializes that).
684	 */
685	if (PageKsm(page) && !offlining) {
686		rc = -EBUSY;
687		goto unlock;
688	}
689
690	/* charge against new page */
691	charge = mem_cgroup_prepare_migration(page, newpage, &mem, GFP_KERNEL);
692	if (charge == -ENOMEM) {
693		rc = -ENOMEM;
694		goto unlock;
695	}
696	BUG_ON(charge);
697
698	if (PageWriteback(page)) {
699		/*
700		 * For !sync, there is no point retrying as the retry loop
701		 * is expected to be too short for PageWriteback to be cleared
702		 */
703		if (!sync) {
704			rc = -EBUSY;
705			goto uncharge;
706		}
707		if (!force)
708			goto uncharge;
709		wait_on_page_writeback(page);
710	}
711	/*
712	 * By try_to_unmap(), page->mapcount goes down to 0 here. In this case,
713	 * we cannot notice that anon_vma is freed while we migrates a page.
714	 * This get_anon_vma() delays freeing anon_vma pointer until the end
715	 * of migration. File cache pages are no problem because of page_lock()
716	 * File Caches may use write_page() or lock_page() in migration, then,
717	 * just care Anon page here.
718	 */
719	if (PageAnon(page)) {
720		/*
721		 * Only page_lock_anon_vma() understands the subtleties of
722		 * getting a hold on an anon_vma from outside one of its mms.
723		 */
724		anon_vma = page_lock_anon_vma(page);
725		if (anon_vma) {
726			/*
727			 * Take a reference count on the anon_vma if the
728			 * page is mapped so that it is guaranteed to
729			 * exist when the page is remapped later
730			 */
731			get_anon_vma(anon_vma);
732			page_unlock_anon_vma(anon_vma);
733		} else if (PageSwapCache(page)) {
734			/*
735			 * We cannot be sure that the anon_vma of an unmapped
736			 * swapcache page is safe to use because we don't
737			 * know in advance if the VMA that this page belonged
738			 * to still exists. If the VMA and others sharing the
739			 * data have been freed, then the anon_vma could
740			 * already be invalid.
741			 *
742			 * To avoid this possibility, swapcache pages get
743			 * migrated but are not remapped when migration
744			 * completes
745			 */
746			remap_swapcache = 0;
747		} else {
748			goto uncharge;
749		}
750	}
751
752	/*
753	 * Corner case handling:
754	 * 1. When a new swap-cache page is read into, it is added to the LRU
755	 * and treated as swapcache but it has no rmap yet.
756	 * Calling try_to_unmap() against a page->mapping==NULL page will
757	 * trigger a BUG.  So handle it here.
758	 * 2. An orphaned page (see truncate_complete_page) might have
759	 * fs-private metadata. The page can be picked up due to memory
760	 * offlining.  Everywhere else except page reclaim, the page is
761	 * invisible to the vm, so the page can not be migrated.  So try to
762	 * free the metadata, so the page can be freed.
763	 */
764	if (!page->mapping) {
765		VM_BUG_ON(PageAnon(page));
766		if (page_has_private(page)) {
767			try_to_free_buffers(page);
768			goto uncharge;
769		}
770		goto skip_unmap;
771	}
772
773	/* Establish migration ptes or remove ptes */
774	try_to_unmap(page, TTU_MIGRATION|TTU_IGNORE_MLOCK|TTU_IGNORE_ACCESS);
775
776skip_unmap:
777	if (!page_mapped(page))
778		rc = move_to_new_page(newpage, page, remap_swapcache, sync);
779
780	if (rc && remap_swapcache)
781		remove_migration_ptes(page, page);
782
783	/* Drop an anon_vma reference if we took one */
784	if (anon_vma)
785		put_anon_vma(anon_vma);
786
787uncharge:
788	if (!charge)
789		mem_cgroup_end_migration(mem, page, newpage, rc == 0);
790unlock:
791	unlock_page(page);
792
793move_newpage:
794	if (rc != -EAGAIN) {
795 		/*
796 		 * A page that has been migrated has all references
797 		 * removed and will be freed. A page that has not been
798 		 * migrated will have kepts its references and be
799 		 * restored.
800 		 */
801 		list_del(&page->lru);
802		dec_zone_page_state(page, NR_ISOLATED_ANON +
803				page_is_file_cache(page));
804		putback_lru_page(page);
805	}
806
807	/*
808	 * Move the new page to the LRU. If migration was not successful
809	 * then this will free the page.
810	 */
811	putback_lru_page(newpage);
812
813	if (result) {
814		if (rc)
815			*result = rc;
816		else
817			*result = page_to_nid(newpage);
818	}
819	return rc;
820}
821
822/*
823 * Counterpart of unmap_and_move_page() for hugepage migration.
824 *
825 * This function doesn't wait the completion of hugepage I/O
826 * because there is no race between I/O and migration for hugepage.
827 * Note that currently hugepage I/O occurs only in direct I/O
828 * where no lock is held and PG_writeback is irrelevant,
829 * and writeback status of all subpages are counted in the reference
830 * count of the head page (i.e. if all subpages of a 2MB hugepage are
831 * under direct I/O, the reference of the head page is 512 and a bit more.)
832 * This means that when we try to migrate hugepage whose subpages are
833 * doing direct I/O, some references remain after try_to_unmap() and
834 * hugepage migration fails without data corruption.
835 *
836 * There is also no race when direct I/O is issued on the page under migration,
837 * because then pte is replaced with migration swap entry and direct I/O code
838 * will wait in the page fault for migration to complete.
839 */
840static int unmap_and_move_huge_page(new_page_t get_new_page,
841				unsigned long private, struct page *hpage,
842				int force, bool offlining, bool sync)
843{
844	int rc = 0;
845	int *result = NULL;
846	struct page *new_hpage = get_new_page(hpage, private, &result);
847	struct anon_vma *anon_vma = NULL;
848
849	if (!new_hpage)
850		return -ENOMEM;
851
852	rc = -EAGAIN;
853
854	if (!trylock_page(hpage)) {
855		if (!force || !sync)
856			goto out;
857		lock_page(hpage);
858	}
859
860	if (PageAnon(hpage)) {
861		anon_vma = page_lock_anon_vma(hpage);
862		if (anon_vma) {
863			get_anon_vma(anon_vma);
864			page_unlock_anon_vma(anon_vma);
865		}
866	}
867
868	try_to_unmap(hpage, TTU_MIGRATION|TTU_IGNORE_MLOCK|TTU_IGNORE_ACCESS);
869
870	if (!page_mapped(hpage))
871		rc = move_to_new_page(new_hpage, hpage, 1, sync);
872
873	if (rc)
874		remove_migration_ptes(hpage, hpage);
875
876	if (anon_vma)
877		put_anon_vma(anon_vma);
878out:
879	unlock_page(hpage);
880
881	if (rc != -EAGAIN) {
882		list_del(&hpage->lru);
883		put_page(hpage);
884	}
885
886	put_page(new_hpage);
887
888	if (result) {
889		if (rc)
890			*result = rc;
891		else
892			*result = page_to_nid(new_hpage);
893	}
894	return rc;
895}
896
897/*
898 * migrate_pages
899 *
900 * The function takes one list of pages to migrate and a function
901 * that determines from the page to be migrated and the private data
902 * the target of the move and allocates the page.
903 *
904 * The function returns after 10 attempts or if no pages
905 * are movable anymore because to has become empty
906 * or no retryable pages exist anymore.
907 * Caller should call putback_lru_pages to return pages to the LRU
908 * or free list only if ret != 0.
909 *
910 * Return: Number of pages not migrated or error code.
911 */
912int migrate_pages(struct list_head *from,
913		new_page_t get_new_page, unsigned long private, bool offlining,
914		bool sync)
915{
916	int retry = 1;
917	int nr_failed = 0;
918	int pass = 0;
919	struct page *page;
920	struct page *page2;
921	int swapwrite = current->flags & PF_SWAPWRITE;
922	int rc;
923
924	if (!swapwrite)
925		current->flags |= PF_SWAPWRITE;
926
927	for(pass = 0; pass < 10 && retry; pass++) {
928		retry = 0;
929
930		list_for_each_entry_safe(page, page2, from, lru) {
931			cond_resched();
932
933			rc = unmap_and_move(get_new_page, private,
934						page, pass > 2, offlining,
935						sync);
936
937			switch(rc) {
938			case -ENOMEM:
939				goto out;
940			case -EAGAIN:
941				retry++;
942				break;
943			case 0:
944				break;
945			default:
946				/* Permanent failure */
947				nr_failed++;
948				break;
949			}
950		}
951	}
952	rc = 0;
953out:
954	if (!swapwrite)
955		current->flags &= ~PF_SWAPWRITE;
956
957	if (rc)
958		return rc;
959
960	return nr_failed + retry;
961}
962
963int migrate_huge_pages(struct list_head *from,
964		new_page_t get_new_page, unsigned long private, bool offlining,
965		bool sync)
966{
967	int retry = 1;
968	int nr_failed = 0;
969	int pass = 0;
970	struct page *page;
971	struct page *page2;
972	int rc;
973
974	for (pass = 0; pass < 10 && retry; pass++) {
975		retry = 0;
976
977		list_for_each_entry_safe(page, page2, from, lru) {
978			cond_resched();
979
980			rc = unmap_and_move_huge_page(get_new_page,
981					private, page, pass > 2, offlining,
982					sync);
983
984			switch(rc) {
985			case -ENOMEM:
986				goto out;
987			case -EAGAIN:
988				retry++;
989				break;
990			case 0:
991				break;
992			default:
993				/* Permanent failure */
994				nr_failed++;
995				break;
996			}
997		}
998	}
999	rc = 0;
1000out:
1001	if (rc)
1002		return rc;
1003
1004	return nr_failed + retry;
1005}
1006
1007#ifdef CONFIG_NUMA
1008/*
1009 * Move a list of individual pages
1010 */
1011struct page_to_node {
1012	unsigned long addr;
1013	struct page *page;
1014	int node;
1015	int status;
1016};
1017
1018static struct page *new_page_node(struct page *p, unsigned long private,
1019		int **result)
1020{
1021	struct page_to_node *pm = (struct page_to_node *)private;
1022
1023	while (pm->node != MAX_NUMNODES && pm->page != p)
1024		pm++;
1025
1026	if (pm->node == MAX_NUMNODES)
1027		return NULL;
1028
1029	*result = &pm->status;
1030
1031	return alloc_pages_exact_node(pm->node,
1032				GFP_HIGHUSER_MOVABLE | GFP_THISNODE, 0);
1033}
1034
1035/*
1036 * Move a set of pages as indicated in the pm array. The addr
1037 * field must be set to the virtual address of the page to be moved
1038 * and the node number must contain a valid target node.
1039 * The pm array ends with node = MAX_NUMNODES.
1040 */
1041static int do_move_page_to_node_array(struct mm_struct *mm,
1042				      struct page_to_node *pm,
1043				      int migrate_all)
1044{
1045	int err;
1046	struct page_to_node *pp;
1047	LIST_HEAD(pagelist);
1048
1049	down_read(&mm->mmap_sem);
1050
1051	/*
1052	 * Build a list of pages to migrate
1053	 */
1054	for (pp = pm; pp->node != MAX_NUMNODES; pp++) {
1055		struct vm_area_struct *vma;
1056		struct page *page;
1057
1058		err = -EFAULT;
1059		vma = find_vma(mm, pp->addr);
1060		if (!vma || pp->addr < vma->vm_start || !vma_migratable(vma))
1061			goto set_status;
1062
1063		page = follow_page(vma, pp->addr, FOLL_GET|FOLL_SPLIT);
1064
1065		err = PTR_ERR(page);
1066		if (IS_ERR(page))
1067			goto set_status;
1068
1069		err = -ENOENT;
1070		if (!page)
1071			goto set_status;
1072
1073		/* Use PageReserved to check for zero page */
1074		if (PageReserved(page) || PageKsm(page))
1075			goto put_and_set;
1076
1077		pp->page = page;
1078		err = page_to_nid(page);
1079
1080		if (err == pp->node)
1081			/*
1082			 * Node already in the right place
1083			 */
1084			goto put_and_set;
1085
1086		err = -EACCES;
1087		if (page_mapcount(page) > 1 &&
1088				!migrate_all)
1089			goto put_and_set;
1090
1091		err = isolate_lru_page(page);
1092		if (!err) {
1093			list_add_tail(&page->lru, &pagelist);
1094			inc_zone_page_state(page, NR_ISOLATED_ANON +
1095					    page_is_file_cache(page));
1096		}
1097put_and_set:
1098		/*
1099		 * Either remove the duplicate refcount from
1100		 * isolate_lru_page() or drop the page ref if it was
1101		 * not isolated.
1102		 */
1103		put_page(page);
1104set_status:
1105		pp->status = err;
1106	}
1107
1108	err = 0;
1109	if (!list_empty(&pagelist)) {
1110		err = migrate_pages(&pagelist, new_page_node,
1111				(unsigned long)pm, 0, true);
1112		if (err)
1113			putback_lru_pages(&pagelist);
1114	}
1115
1116	up_read(&mm->mmap_sem);
1117	return err;
1118}
1119
1120/*
1121 * Migrate an array of page address onto an array of nodes and fill
1122 * the corresponding array of status.
1123 */
1124static int do_pages_move(struct mm_struct *mm, struct task_struct *task,
1125			 unsigned long nr_pages,
1126			 const void __user * __user *pages,
1127			 const int __user *nodes,
1128			 int __user *status, int flags)
1129{
1130	struct page_to_node *pm;
1131	nodemask_t task_nodes;
1132	unsigned long chunk_nr_pages;
1133	unsigned long chunk_start;
1134	int err;
1135
1136	task_nodes = cpuset_mems_allowed(task);
1137
1138	err = -ENOMEM;
1139	pm = (struct page_to_node *)__get_free_page(GFP_KERNEL);
1140	if (!pm)
1141		goto out;
1142
1143	migrate_prep();
1144
1145	/*
1146	 * Store a chunk of page_to_node array in a page,
1147	 * but keep the last one as a marker
1148	 */
1149	chunk_nr_pages = (PAGE_SIZE / sizeof(struct page_to_node)) - 1;
1150
1151	for (chunk_start = 0;
1152	     chunk_start < nr_pages;
1153	     chunk_start += chunk_nr_pages) {
1154		int j;
1155
1156		if (chunk_start + chunk_nr_pages > nr_pages)
1157			chunk_nr_pages = nr_pages - chunk_start;
1158
1159		/* fill the chunk pm with addrs and nodes from user-space */
1160		for (j = 0; j < chunk_nr_pages; j++) {
1161			const void __user *p;
1162			int node;
1163
1164			err = -EFAULT;
1165			if (get_user(p, pages + j + chunk_start))
1166				goto out_pm;
1167			pm[j].addr = (unsigned long) p;
1168
1169			if (get_user(node, nodes + j + chunk_start))
1170				goto out_pm;
1171
1172			err = -ENODEV;
1173			if (node < 0 || node >= MAX_NUMNODES)
1174				goto out_pm;
1175
1176			if (!node_state(node, N_HIGH_MEMORY))
1177				goto out_pm;
1178
1179			err = -EACCES;
1180			if (!node_isset(node, task_nodes))
1181				goto out_pm;
1182
1183			pm[j].node = node;
1184		}
1185
1186		/* End marker for this chunk */
1187		pm[chunk_nr_pages].node = MAX_NUMNODES;
1188
1189		/* Migrate this chunk */
1190		err = do_move_page_to_node_array(mm, pm,
1191						 flags & MPOL_MF_MOVE_ALL);
1192		if (err < 0)
1193			goto out_pm;
1194
1195		/* Return status information */
1196		for (j = 0; j < chunk_nr_pages; j++)
1197			if (put_user(pm[j].status, status + j + chunk_start)) {
1198				err = -EFAULT;
1199				goto out_pm;
1200			}
1201	}
1202	err = 0;
1203
1204out_pm:
1205	free_page((unsigned long)pm);
1206out:
1207	return err;
1208}
1209
1210/*
1211 * Determine the nodes of an array of pages and store it in an array of status.
1212 */
1213static void do_pages_stat_array(struct mm_struct *mm, unsigned long nr_pages,
1214				const void __user **pages, int *status)
1215{
1216	unsigned long i;
1217
1218	down_read(&mm->mmap_sem);
1219
1220	for (i = 0; i < nr_pages; i++) {
1221		unsigned long addr = (unsigned long)(*pages);
1222		struct vm_area_struct *vma;
1223		struct page *page;
1224		int err = -EFAULT;
1225
1226		vma = find_vma(mm, addr);
1227		if (!vma || addr < vma->vm_start)
1228			goto set_status;
1229
1230		page = follow_page(vma, addr, 0);
1231
1232		err = PTR_ERR(page);
1233		if (IS_ERR(page))
1234			goto set_status;
1235
1236		err = -ENOENT;
1237		/* Use PageReserved to check for zero page */
1238		if (!page || PageReserved(page) || PageKsm(page))
1239			goto set_status;
1240
1241		err = page_to_nid(page);
1242set_status:
1243		*status = err;
1244
1245		pages++;
1246		status++;
1247	}
1248
1249	up_read(&mm->mmap_sem);
1250}
1251
1252/*
1253 * Determine the nodes of a user array of pages and store it in
1254 * a user array of status.
1255 */
1256static int do_pages_stat(struct mm_struct *mm, unsigned long nr_pages,
1257			 const void __user * __user *pages,
1258			 int __user *status)
1259{
1260#define DO_PAGES_STAT_CHUNK_NR 16
1261	const void __user *chunk_pages[DO_PAGES_STAT_CHUNK_NR];
1262	int chunk_status[DO_PAGES_STAT_CHUNK_NR];
1263
1264	while (nr_pages) {
1265		unsigned long chunk_nr;
1266
1267		chunk_nr = nr_pages;
1268		if (chunk_nr > DO_PAGES_STAT_CHUNK_NR)
1269			chunk_nr = DO_PAGES_STAT_CHUNK_NR;
1270
1271		if (copy_from_user(chunk_pages, pages, chunk_nr * sizeof(*chunk_pages)))
1272			break;
1273
1274		do_pages_stat_array(mm, chunk_nr, chunk_pages, chunk_status);
1275
1276		if (copy_to_user(status, chunk_status, chunk_nr * sizeof(*status)))
1277			break;
1278
1279		pages += chunk_nr;
1280		status += chunk_nr;
1281		nr_pages -= chunk_nr;
1282	}
1283	return nr_pages ? -EFAULT : 0;
1284}
1285
1286/*
1287 * Move a list of pages in the address space of the currently executing
1288 * process.
1289 */
1290SYSCALL_DEFINE6(move_pages, pid_t, pid, unsigned long, nr_pages,
1291		const void __user * __user *, pages,
1292		const int __user *, nodes,
1293		int __user *, status, int, flags)
1294{
1295	const struct cred *cred = current_cred(), *tcred;
1296	struct task_struct *task;
1297	struct mm_struct *mm;
1298	int err;
1299
1300	/* Check flags */
1301	if (flags & ~(MPOL_MF_MOVE|MPOL_MF_MOVE_ALL))
1302		return -EINVAL;
1303
1304	if ((flags & MPOL_MF_MOVE_ALL) && !capable(CAP_SYS_NICE))
1305		return -EPERM;
1306
1307	/* Find the mm_struct */
1308	rcu_read_lock();
1309	task = pid ? find_task_by_vpid(pid) : current;
1310	if (!task) {
1311		rcu_read_unlock();
1312		return -ESRCH;
1313	}
1314	mm = get_task_mm(task);
1315	rcu_read_unlock();
1316
1317	if (!mm)
1318		return -EINVAL;
1319
1320	/*
1321	 * Check if this process has the right to modify the specified
1322	 * process. The right exists if the process has administrative
1323	 * capabilities, superuser privileges or the same
1324	 * userid as the target process.
1325	 */
1326	rcu_read_lock();
1327	tcred = __task_cred(task);
1328	if (cred->euid != tcred->suid && cred->euid != tcred->uid &&
1329	    cred->uid  != tcred->suid && cred->uid  != tcred->uid &&
1330	    !capable(CAP_SYS_NICE)) {
1331		rcu_read_unlock();
1332		err = -EPERM;
1333		goto out;
1334	}
1335	rcu_read_unlock();
1336
1337 	err = security_task_movememory(task);
1338 	if (err)
1339		goto out;
1340
1341	if (nodes) {
1342		err = do_pages_move(mm, task, nr_pages, pages, nodes, status,
1343				    flags);
1344	} else {
1345		err = do_pages_stat(mm, nr_pages, pages, status);
1346	}
1347
1348out:
1349	mmput(mm);
1350	return err;
1351}
1352
1353/*
1354 * Call migration functions in the vma_ops that may prepare
1355 * memory in a vm for migration. migration functions may perform
1356 * the migration for vmas that do not have an underlying page struct.
1357 */
1358int migrate_vmas(struct mm_struct *mm, const nodemask_t *to,
1359	const nodemask_t *from, unsigned long flags)
1360{
1361 	struct vm_area_struct *vma;
1362 	int err = 0;
1363
1364	for (vma = mm->mmap; vma && !err; vma = vma->vm_next) {
1365 		if (vma->vm_ops && vma->vm_ops->migrate) {
1366 			err = vma->vm_ops->migrate(vma, to, from, flags);
1367 			if (err)
1368 				break;
1369 		}
1370 	}
1371 	return err;
1372}
1373#endif
1374