perf,x86: fix link failure for non-Intel configs
[linux/fpc-iii.git] / mm / rmap.c
blob8685697b88b28c11a7fab6802a2c616deece66b1
1 /*
2 * mm/rmap.c - physical to virtual reverse mappings
4 * Copyright 2001, Rik van Riel <riel@conectiva.com.br>
5 * Released under the General Public License (GPL).
7 * Simple, low overhead reverse mapping scheme.
8 * Please try to keep this thing as modular as possible.
10 * Provides methods for unmapping each kind of mapped page:
11 * the anon methods track anonymous pages, and
12 * the file methods track pages belonging to an inode.
14 * Original design by Rik van Riel <riel@conectiva.com.br> 2001
15 * File methods by Dave McCracken <dmccr@us.ibm.com> 2003, 2004
16 * Anonymous methods by Andrea Arcangeli <andrea@suse.de> 2004
17 * Contributions by Hugh Dickins 2003, 2004
21 * Lock ordering in mm:
23 * inode->i_mutex (while writing or truncating, not reading or faulting)
24 * mm->mmap_sem
25 * page->flags PG_locked (lock_page)
26 * mapping->i_mmap_mutex
27 * anon_vma->mutex
28 * mm->page_table_lock or pte_lock
29 * zone->lru_lock (in mark_page_accessed, isolate_lru_page)
30 * swap_lock (in swap_duplicate, swap_info_get)
31 * mmlist_lock (in mmput, drain_mmlist and others)
32 * mapping->private_lock (in __set_page_dirty_buffers)
33 * inode->i_lock (in set_page_dirty's __mark_inode_dirty)
34 * bdi.wb->list_lock (in set_page_dirty's __mark_inode_dirty)
35 * sb_lock (within inode_lock in fs/fs-writeback.c)
36 * mapping->tree_lock (widely used, in set_page_dirty,
37 * in arch-dependent flush_dcache_mmap_lock,
38 * within bdi.wb->list_lock in __sync_single_inode)
40 * anon_vma->mutex,mapping->i_mutex (memory_failure, collect_procs_anon)
41 * ->tasklist_lock
42 * pte map lock
45 #include <linux/mm.h>
46 #include <linux/pagemap.h>
47 #include <linux/swap.h>
48 #include <linux/swapops.h>
49 #include <linux/slab.h>
50 #include <linux/init.h>
51 #include <linux/ksm.h>
52 #include <linux/rmap.h>
53 #include <linux/rcupdate.h>
54 #include <linux/export.h>
55 #include <linux/memcontrol.h>
56 #include <linux/mmu_notifier.h>
57 #include <linux/migrate.h>
58 #include <linux/hugetlb.h>
59 #include <linux/backing-dev.h>
61 #include <asm/tlbflush.h>
63 #include "internal.h"
65 static struct kmem_cache *anon_vma_cachep;
66 static struct kmem_cache *anon_vma_chain_cachep;
68 static inline struct anon_vma *anon_vma_alloc(void)
70 struct anon_vma *anon_vma;
72 anon_vma = kmem_cache_alloc(anon_vma_cachep, GFP_KERNEL);
73 if (anon_vma) {
74 atomic_set(&anon_vma->refcount, 1);
76 * Initialise the anon_vma root to point to itself. If called
77 * from fork, the root will be reset to the parents anon_vma.
79 anon_vma->root = anon_vma;
82 return anon_vma;
85 static inline void anon_vma_free(struct anon_vma *anon_vma)
87 VM_BUG_ON(atomic_read(&anon_vma->refcount));
90 * Synchronize against page_lock_anon_vma() such that
91 * we can safely hold the lock without the anon_vma getting
92 * freed.
94 * Relies on the full mb implied by the atomic_dec_and_test() from
95 * put_anon_vma() against the acquire barrier implied by
96 * mutex_trylock() from page_lock_anon_vma(). This orders:
98 * page_lock_anon_vma() VS put_anon_vma()
99 * mutex_trylock() atomic_dec_and_test()
100 * LOCK MB
101 * atomic_read() mutex_is_locked()
103 * LOCK should suffice since the actual taking of the lock must
104 * happen _before_ what follows.
106 if (mutex_is_locked(&anon_vma->root->mutex)) {
107 anon_vma_lock(anon_vma);
108 anon_vma_unlock(anon_vma);
111 kmem_cache_free(anon_vma_cachep, anon_vma);
114 static inline struct anon_vma_chain *anon_vma_chain_alloc(gfp_t gfp)
116 return kmem_cache_alloc(anon_vma_chain_cachep, gfp);
119 static void anon_vma_chain_free(struct anon_vma_chain *anon_vma_chain)
121 kmem_cache_free(anon_vma_chain_cachep, anon_vma_chain);
125 * anon_vma_prepare - attach an anon_vma to a memory region
126 * @vma: the memory region in question
128 * This makes sure the memory mapping described by 'vma' has
129 * an 'anon_vma' attached to it, so that we can associate the
130 * anonymous pages mapped into it with that anon_vma.
132 * The common case will be that we already have one, but if
133 * not we either need to find an adjacent mapping that we
134 * can re-use the anon_vma from (very common when the only
135 * reason for splitting a vma has been mprotect()), or we
136 * allocate a new one.
138 * Anon-vma allocations are very subtle, because we may have
139 * optimistically looked up an anon_vma in page_lock_anon_vma()
140 * and that may actually touch the spinlock even in the newly
141 * allocated vma (it depends on RCU to make sure that the
142 * anon_vma isn't actually destroyed).
144 * As a result, we need to do proper anon_vma locking even
145 * for the new allocation. At the same time, we do not want
146 * to do any locking for the common case of already having
147 * an anon_vma.
149 * This must be called with the mmap_sem held for reading.
151 int anon_vma_prepare(struct vm_area_struct *vma)
153 struct anon_vma *anon_vma = vma->anon_vma;
154 struct anon_vma_chain *avc;
156 might_sleep();
157 if (unlikely(!anon_vma)) {
158 struct mm_struct *mm = vma->vm_mm;
159 struct anon_vma *allocated;
161 avc = anon_vma_chain_alloc(GFP_KERNEL);
162 if (!avc)
163 goto out_enomem;
165 anon_vma = find_mergeable_anon_vma(vma);
166 allocated = NULL;
167 if (!anon_vma) {
168 anon_vma = anon_vma_alloc();
169 if (unlikely(!anon_vma))
170 goto out_enomem_free_avc;
171 allocated = anon_vma;
174 anon_vma_lock(anon_vma);
175 /* page_table_lock to protect against threads */
176 spin_lock(&mm->page_table_lock);
177 if (likely(!vma->anon_vma)) {
178 vma->anon_vma = anon_vma;
179 avc->anon_vma = anon_vma;
180 avc->vma = vma;
181 list_add(&avc->same_vma, &vma->anon_vma_chain);
182 list_add_tail(&avc->same_anon_vma, &anon_vma->head);
183 allocated = NULL;
184 avc = NULL;
186 spin_unlock(&mm->page_table_lock);
187 anon_vma_unlock(anon_vma);
189 if (unlikely(allocated))
190 put_anon_vma(allocated);
191 if (unlikely(avc))
192 anon_vma_chain_free(avc);
194 return 0;
196 out_enomem_free_avc:
197 anon_vma_chain_free(avc);
198 out_enomem:
199 return -ENOMEM;
203 * This is a useful helper function for locking the anon_vma root as
204 * we traverse the vma->anon_vma_chain, looping over anon_vma's that
205 * have the same vma.
207 * Such anon_vma's should have the same root, so you'd expect to see
208 * just a single mutex_lock for the whole traversal.
210 static inline struct anon_vma *lock_anon_vma_root(struct anon_vma *root, struct anon_vma *anon_vma)
212 struct anon_vma *new_root = anon_vma->root;
213 if (new_root != root) {
214 if (WARN_ON_ONCE(root))
215 mutex_unlock(&root->mutex);
216 root = new_root;
217 mutex_lock(&root->mutex);
219 return root;
222 static inline void unlock_anon_vma_root(struct anon_vma *root)
224 if (root)
225 mutex_unlock(&root->mutex);
228 static void anon_vma_chain_link(struct vm_area_struct *vma,
229 struct anon_vma_chain *avc,
230 struct anon_vma *anon_vma)
232 avc->vma = vma;
233 avc->anon_vma = anon_vma;
234 list_add(&avc->same_vma, &vma->anon_vma_chain);
237 * It's critical to add new vmas to the tail of the anon_vma,
238 * see comment in huge_memory.c:__split_huge_page().
240 list_add_tail(&avc->same_anon_vma, &anon_vma->head);
244 * Attach the anon_vmas from src to dst.
245 * Returns 0 on success, -ENOMEM on failure.
247 int anon_vma_clone(struct vm_area_struct *dst, struct vm_area_struct *src)
249 struct anon_vma_chain *avc, *pavc;
250 struct anon_vma *root = NULL;
252 list_for_each_entry_reverse(pavc, &src->anon_vma_chain, same_vma) {
253 struct anon_vma *anon_vma;
255 avc = anon_vma_chain_alloc(GFP_NOWAIT | __GFP_NOWARN);
256 if (unlikely(!avc)) {
257 unlock_anon_vma_root(root);
258 root = NULL;
259 avc = anon_vma_chain_alloc(GFP_KERNEL);
260 if (!avc)
261 goto enomem_failure;
263 anon_vma = pavc->anon_vma;
264 root = lock_anon_vma_root(root, anon_vma);
265 anon_vma_chain_link(dst, avc, anon_vma);
267 unlock_anon_vma_root(root);
268 return 0;
270 enomem_failure:
271 unlink_anon_vmas(dst);
272 return -ENOMEM;
276 * Attach vma to its own anon_vma, as well as to the anon_vmas that
277 * the corresponding VMA in the parent process is attached to.
278 * Returns 0 on success, non-zero on failure.
280 int anon_vma_fork(struct vm_area_struct *vma, struct vm_area_struct *pvma)
282 struct anon_vma_chain *avc;
283 struct anon_vma *anon_vma;
285 /* Don't bother if the parent process has no anon_vma here. */
286 if (!pvma->anon_vma)
287 return 0;
290 * First, attach the new VMA to the parent VMA's anon_vmas,
291 * so rmap can find non-COWed pages in child processes.
293 if (anon_vma_clone(vma, pvma))
294 return -ENOMEM;
296 /* Then add our own anon_vma. */
297 anon_vma = anon_vma_alloc();
298 if (!anon_vma)
299 goto out_error;
300 avc = anon_vma_chain_alloc(GFP_KERNEL);
301 if (!avc)
302 goto out_error_free_anon_vma;
305 * The root anon_vma's spinlock is the lock actually used when we
306 * lock any of the anon_vmas in this anon_vma tree.
308 anon_vma->root = pvma->anon_vma->root;
310 * With refcounts, an anon_vma can stay around longer than the
311 * process it belongs to. The root anon_vma needs to be pinned until
312 * this anon_vma is freed, because the lock lives in the root.
314 get_anon_vma(anon_vma->root);
315 /* Mark this anon_vma as the one where our new (COWed) pages go. */
316 vma->anon_vma = anon_vma;
317 anon_vma_lock(anon_vma);
318 anon_vma_chain_link(vma, avc, anon_vma);
319 anon_vma_unlock(anon_vma);
321 return 0;
323 out_error_free_anon_vma:
324 put_anon_vma(anon_vma);
325 out_error:
326 unlink_anon_vmas(vma);
327 return -ENOMEM;
330 void unlink_anon_vmas(struct vm_area_struct *vma)
332 struct anon_vma_chain *avc, *next;
333 struct anon_vma *root = NULL;
336 * Unlink each anon_vma chained to the VMA. This list is ordered
337 * from newest to oldest, ensuring the root anon_vma gets freed last.
339 list_for_each_entry_safe(avc, next, &vma->anon_vma_chain, same_vma) {
340 struct anon_vma *anon_vma = avc->anon_vma;
342 root = lock_anon_vma_root(root, anon_vma);
343 list_del(&avc->same_anon_vma);
346 * Leave empty anon_vmas on the list - we'll need
347 * to free them outside the lock.
349 if (list_empty(&anon_vma->head))
350 continue;
352 list_del(&avc->same_vma);
353 anon_vma_chain_free(avc);
355 unlock_anon_vma_root(root);
358 * Iterate the list once more, it now only contains empty and unlinked
359 * anon_vmas, destroy them. Could not do before due to __put_anon_vma()
360 * needing to acquire the anon_vma->root->mutex.
362 list_for_each_entry_safe(avc, next, &vma->anon_vma_chain, same_vma) {
363 struct anon_vma *anon_vma = avc->anon_vma;
365 put_anon_vma(anon_vma);
367 list_del(&avc->same_vma);
368 anon_vma_chain_free(avc);
372 static void anon_vma_ctor(void *data)
374 struct anon_vma *anon_vma = data;
376 mutex_init(&anon_vma->mutex);
377 atomic_set(&anon_vma->refcount, 0);
378 INIT_LIST_HEAD(&anon_vma->head);
381 void __init anon_vma_init(void)
383 anon_vma_cachep = kmem_cache_create("anon_vma", sizeof(struct anon_vma),
384 0, SLAB_DESTROY_BY_RCU|SLAB_PANIC, anon_vma_ctor);
385 anon_vma_chain_cachep = KMEM_CACHE(anon_vma_chain, SLAB_PANIC);
389 * Getting a lock on a stable anon_vma from a page off the LRU is tricky!
391 * Since there is no serialization what so ever against page_remove_rmap()
392 * the best this function can do is return a locked anon_vma that might
393 * have been relevant to this page.
395 * The page might have been remapped to a different anon_vma or the anon_vma
396 * returned may already be freed (and even reused).
398 * In case it was remapped to a different anon_vma, the new anon_vma will be a
399 * child of the old anon_vma, and the anon_vma lifetime rules will therefore
400 * ensure that any anon_vma obtained from the page will still be valid for as
401 * long as we observe page_mapped() [ hence all those page_mapped() tests ].
403 * All users of this function must be very careful when walking the anon_vma
404 * chain and verify that the page in question is indeed mapped in it
405 * [ something equivalent to page_mapped_in_vma() ].
407 * Since anon_vma's slab is DESTROY_BY_RCU and we know from page_remove_rmap()
408 * that the anon_vma pointer from page->mapping is valid if there is a
409 * mapcount, we can dereference the anon_vma after observing those.
411 struct anon_vma *page_get_anon_vma(struct page *page)
413 struct anon_vma *anon_vma = NULL;
414 unsigned long anon_mapping;
416 rcu_read_lock();
417 anon_mapping = (unsigned long) ACCESS_ONCE(page->mapping);
418 if ((anon_mapping & PAGE_MAPPING_FLAGS) != PAGE_MAPPING_ANON)
419 goto out;
420 if (!page_mapped(page))
421 goto out;
423 anon_vma = (struct anon_vma *) (anon_mapping - PAGE_MAPPING_ANON);
424 if (!atomic_inc_not_zero(&anon_vma->refcount)) {
425 anon_vma = NULL;
426 goto out;
430 * If this page is still mapped, then its anon_vma cannot have been
431 * freed. But if it has been unmapped, we have no security against the
432 * anon_vma structure being freed and reused (for another anon_vma:
433 * SLAB_DESTROY_BY_RCU guarantees that - so the atomic_inc_not_zero()
434 * above cannot corrupt).
436 if (!page_mapped(page)) {
437 put_anon_vma(anon_vma);
438 anon_vma = NULL;
440 out:
441 rcu_read_unlock();
443 return anon_vma;
447 * Similar to page_get_anon_vma() except it locks the anon_vma.
449 * Its a little more complex as it tries to keep the fast path to a single
450 * atomic op -- the trylock. If we fail the trylock, we fall back to getting a
451 * reference like with page_get_anon_vma() and then block on the mutex.
453 struct anon_vma *page_lock_anon_vma(struct page *page)
455 struct anon_vma *anon_vma = NULL;
456 struct anon_vma *root_anon_vma;
457 unsigned long anon_mapping;
459 rcu_read_lock();
460 anon_mapping = (unsigned long) ACCESS_ONCE(page->mapping);
461 if ((anon_mapping & PAGE_MAPPING_FLAGS) != PAGE_MAPPING_ANON)
462 goto out;
463 if (!page_mapped(page))
464 goto out;
466 anon_vma = (struct anon_vma *) (anon_mapping - PAGE_MAPPING_ANON);
467 root_anon_vma = ACCESS_ONCE(anon_vma->root);
468 if (mutex_trylock(&root_anon_vma->mutex)) {
470 * If the page is still mapped, then this anon_vma is still
471 * its anon_vma, and holding the mutex ensures that it will
472 * not go away, see anon_vma_free().
474 if (!page_mapped(page)) {
475 mutex_unlock(&root_anon_vma->mutex);
476 anon_vma = NULL;
478 goto out;
481 /* trylock failed, we got to sleep */
482 if (!atomic_inc_not_zero(&anon_vma->refcount)) {
483 anon_vma = NULL;
484 goto out;
487 if (!page_mapped(page)) {
488 put_anon_vma(anon_vma);
489 anon_vma = NULL;
490 goto out;
493 /* we pinned the anon_vma, its safe to sleep */
494 rcu_read_unlock();
495 anon_vma_lock(anon_vma);
497 if (atomic_dec_and_test(&anon_vma->refcount)) {
499 * Oops, we held the last refcount, release the lock
500 * and bail -- can't simply use put_anon_vma() because
501 * we'll deadlock on the anon_vma_lock() recursion.
503 anon_vma_unlock(anon_vma);
504 __put_anon_vma(anon_vma);
505 anon_vma = NULL;
508 return anon_vma;
510 out:
511 rcu_read_unlock();
512 return anon_vma;
515 void page_unlock_anon_vma(struct anon_vma *anon_vma)
517 anon_vma_unlock(anon_vma);
521 * At what user virtual address is page expected in @vma?
522 * Returns virtual address or -EFAULT if page's index/offset is not
523 * within the range mapped the @vma.
525 inline unsigned long
526 vma_address(struct page *page, struct vm_area_struct *vma)
528 pgoff_t pgoff = page->index << (PAGE_CACHE_SHIFT - PAGE_SHIFT);
529 unsigned long address;
531 if (unlikely(is_vm_hugetlb_page(vma)))
532 pgoff = page->index << huge_page_order(page_hstate(page));
533 address = vma->vm_start + ((pgoff - vma->vm_pgoff) << PAGE_SHIFT);
534 if (unlikely(address < vma->vm_start || address >= vma->vm_end)) {
535 /* page should be within @vma mapping range */
536 return -EFAULT;
538 return address;
542 * At what user virtual address is page expected in vma?
543 * Caller should check the page is actually part of the vma.
545 unsigned long page_address_in_vma(struct page *page, struct vm_area_struct *vma)
547 if (PageAnon(page)) {
548 struct anon_vma *page__anon_vma = page_anon_vma(page);
550 * Note: swapoff's unuse_vma() is more efficient with this
551 * check, and needs it to match anon_vma when KSM is active.
553 if (!vma->anon_vma || !page__anon_vma ||
554 vma->anon_vma->root != page__anon_vma->root)
555 return -EFAULT;
556 } else if (page->mapping && !(vma->vm_flags & VM_NONLINEAR)) {
557 if (!vma->vm_file ||
558 vma->vm_file->f_mapping != page->mapping)
559 return -EFAULT;
560 } else
561 return -EFAULT;
562 return vma_address(page, vma);
566 * Check that @page is mapped at @address into @mm.
568 * If @sync is false, page_check_address may perform a racy check to avoid
569 * the page table lock when the pte is not present (helpful when reclaiming
570 * highly shared pages).
572 * On success returns with pte mapped and locked.
574 pte_t *__page_check_address(struct page *page, struct mm_struct *mm,
575 unsigned long address, spinlock_t **ptlp, int sync)
577 pgd_t *pgd;
578 pud_t *pud;
579 pmd_t *pmd;
580 pte_t *pte;
581 spinlock_t *ptl;
583 if (unlikely(PageHuge(page))) {
584 pte = huge_pte_offset(mm, address);
585 ptl = &mm->page_table_lock;
586 goto check;
589 pgd = pgd_offset(mm, address);
590 if (!pgd_present(*pgd))
591 return NULL;
593 pud = pud_offset(pgd, address);
594 if (!pud_present(*pud))
595 return NULL;
597 pmd = pmd_offset(pud, address);
598 if (!pmd_present(*pmd))
599 return NULL;
600 if (pmd_trans_huge(*pmd))
601 return NULL;
603 pte = pte_offset_map(pmd, address);
604 /* Make a quick check before getting the lock */
605 if (!sync && !pte_present(*pte)) {
606 pte_unmap(pte);
607 return NULL;
610 ptl = pte_lockptr(mm, pmd);
611 check:
612 spin_lock(ptl);
613 if (pte_present(*pte) && page_to_pfn(page) == pte_pfn(*pte)) {
614 *ptlp = ptl;
615 return pte;
617 pte_unmap_unlock(pte, ptl);
618 return NULL;
622 * page_mapped_in_vma - check whether a page is really mapped in a VMA
623 * @page: the page to test
624 * @vma: the VMA to test
626 * Returns 1 if the page is mapped into the page tables of the VMA, 0
627 * if the page is not mapped into the page tables of this VMA. Only
628 * valid for normal file or anonymous VMAs.
630 int page_mapped_in_vma(struct page *page, struct vm_area_struct *vma)
632 unsigned long address;
633 pte_t *pte;
634 spinlock_t *ptl;
636 address = vma_address(page, vma);
637 if (address == -EFAULT) /* out of vma range */
638 return 0;
639 pte = page_check_address(page, vma->vm_mm, address, &ptl, 1);
640 if (!pte) /* the page is not in this mm */
641 return 0;
642 pte_unmap_unlock(pte, ptl);
644 return 1;
648 * Subfunctions of page_referenced: page_referenced_one called
649 * repeatedly from either page_referenced_anon or page_referenced_file.
651 int page_referenced_one(struct page *page, struct vm_area_struct *vma,
652 unsigned long address, unsigned int *mapcount,
653 unsigned long *vm_flags)
655 struct mm_struct *mm = vma->vm_mm;
656 int referenced = 0;
658 if (unlikely(PageTransHuge(page))) {
659 pmd_t *pmd;
661 spin_lock(&mm->page_table_lock);
663 * rmap might return false positives; we must filter
664 * these out using page_check_address_pmd().
666 pmd = page_check_address_pmd(page, mm, address,
667 PAGE_CHECK_ADDRESS_PMD_FLAG);
668 if (!pmd) {
669 spin_unlock(&mm->page_table_lock);
670 goto out;
673 if (vma->vm_flags & VM_LOCKED) {
674 spin_unlock(&mm->page_table_lock);
675 *mapcount = 0; /* break early from loop */
676 *vm_flags |= VM_LOCKED;
677 goto out;
680 /* go ahead even if the pmd is pmd_trans_splitting() */
681 if (pmdp_clear_flush_young_notify(vma, address, pmd))
682 referenced++;
683 spin_unlock(&mm->page_table_lock);
684 } else {
685 pte_t *pte;
686 spinlock_t *ptl;
689 * rmap might return false positives; we must filter
690 * these out using page_check_address().
692 pte = page_check_address(page, mm, address, &ptl, 0);
693 if (!pte)
694 goto out;
696 if (vma->vm_flags & VM_LOCKED) {
697 pte_unmap_unlock(pte, ptl);
698 *mapcount = 0; /* break early from loop */
699 *vm_flags |= VM_LOCKED;
700 goto out;
703 if (ptep_clear_flush_young_notify(vma, address, pte)) {
705 * Don't treat a reference through a sequentially read
706 * mapping as such. If the page has been used in
707 * another mapping, we will catch it; if this other
708 * mapping is already gone, the unmap path will have
709 * set PG_referenced or activated the page.
711 if (likely(!VM_SequentialReadHint(vma)))
712 referenced++;
714 pte_unmap_unlock(pte, ptl);
717 /* Pretend the page is referenced if the task has the
718 swap token and is in the middle of a page fault. */
719 if (mm != current->mm && has_swap_token(mm) &&
720 rwsem_is_locked(&mm->mmap_sem))
721 referenced++;
723 (*mapcount)--;
725 if (referenced)
726 *vm_flags |= vma->vm_flags;
727 out:
728 return referenced;
731 static int page_referenced_anon(struct page *page,
732 struct mem_cgroup *mem_cont,
733 unsigned long *vm_flags)
735 unsigned int mapcount;
736 struct anon_vma *anon_vma;
737 struct anon_vma_chain *avc;
738 int referenced = 0;
740 anon_vma = page_lock_anon_vma(page);
741 if (!anon_vma)
742 return referenced;
744 mapcount = page_mapcount(page);
745 list_for_each_entry(avc, &anon_vma->head, same_anon_vma) {
746 struct vm_area_struct *vma = avc->vma;
747 unsigned long address = vma_address(page, vma);
748 if (address == -EFAULT)
749 continue;
751 * If we are reclaiming on behalf of a cgroup, skip
752 * counting on behalf of references from different
753 * cgroups
755 if (mem_cont && !mm_match_cgroup(vma->vm_mm, mem_cont))
756 continue;
757 referenced += page_referenced_one(page, vma, address,
758 &mapcount, vm_flags);
759 if (!mapcount)
760 break;
763 page_unlock_anon_vma(anon_vma);
764 return referenced;
768 * page_referenced_file - referenced check for object-based rmap
769 * @page: the page we're checking references on.
770 * @mem_cont: target memory controller
771 * @vm_flags: collect encountered vma->vm_flags who actually referenced the page
773 * For an object-based mapped page, find all the places it is mapped and
774 * check/clear the referenced flag. This is done by following the page->mapping
775 * pointer, then walking the chain of vmas it holds. It returns the number
776 * of references it found.
778 * This function is only called from page_referenced for object-based pages.
780 static int page_referenced_file(struct page *page,
781 struct mem_cgroup *mem_cont,
782 unsigned long *vm_flags)
784 unsigned int mapcount;
785 struct address_space *mapping = page->mapping;
786 pgoff_t pgoff = page->index << (PAGE_CACHE_SHIFT - PAGE_SHIFT);
787 struct vm_area_struct *vma;
788 struct prio_tree_iter iter;
789 int referenced = 0;
792 * The caller's checks on page->mapping and !PageAnon have made
793 * sure that this is a file page: the check for page->mapping
794 * excludes the case just before it gets set on an anon page.
796 BUG_ON(PageAnon(page));
799 * The page lock not only makes sure that page->mapping cannot
800 * suddenly be NULLified by truncation, it makes sure that the
801 * structure at mapping cannot be freed and reused yet,
802 * so we can safely take mapping->i_mmap_mutex.
804 BUG_ON(!PageLocked(page));
806 mutex_lock(&mapping->i_mmap_mutex);
809 * i_mmap_mutex does not stabilize mapcount at all, but mapcount
810 * is more likely to be accurate if we note it after spinning.
812 mapcount = page_mapcount(page);
814 vma_prio_tree_foreach(vma, &iter, &mapping->i_mmap, pgoff, pgoff) {
815 unsigned long address = vma_address(page, vma);
816 if (address == -EFAULT)
817 continue;
819 * If we are reclaiming on behalf of a cgroup, skip
820 * counting on behalf of references from different
821 * cgroups
823 if (mem_cont && !mm_match_cgroup(vma->vm_mm, mem_cont))
824 continue;
825 referenced += page_referenced_one(page, vma, address,
826 &mapcount, vm_flags);
827 if (!mapcount)
828 break;
831 mutex_unlock(&mapping->i_mmap_mutex);
832 return referenced;
836 * page_referenced - test if the page was referenced
837 * @page: the page to test
838 * @is_locked: caller holds lock on the page
839 * @mem_cont: target memory controller
840 * @vm_flags: collect encountered vma->vm_flags who actually referenced the page
842 * Quick test_and_clear_referenced for all mappings to a page,
843 * returns the number of ptes which referenced the page.
845 int page_referenced(struct page *page,
846 int is_locked,
847 struct mem_cgroup *mem_cont,
848 unsigned long *vm_flags)
850 int referenced = 0;
851 int we_locked = 0;
853 *vm_flags = 0;
854 if (page_mapped(page) && page_rmapping(page)) {
855 if (!is_locked && (!PageAnon(page) || PageKsm(page))) {
856 we_locked = trylock_page(page);
857 if (!we_locked) {
858 referenced++;
859 goto out;
862 if (unlikely(PageKsm(page)))
863 referenced += page_referenced_ksm(page, mem_cont,
864 vm_flags);
865 else if (PageAnon(page))
866 referenced += page_referenced_anon(page, mem_cont,
867 vm_flags);
868 else if (page->mapping)
869 referenced += page_referenced_file(page, mem_cont,
870 vm_flags);
871 if (we_locked)
872 unlock_page(page);
874 if (page_test_and_clear_young(page_to_pfn(page)))
875 referenced++;
877 out:
878 return referenced;
881 static int page_mkclean_one(struct page *page, struct vm_area_struct *vma,
882 unsigned long address)
884 struct mm_struct *mm = vma->vm_mm;
885 pte_t *pte;
886 spinlock_t *ptl;
887 int ret = 0;
889 pte = page_check_address(page, mm, address, &ptl, 1);
890 if (!pte)
891 goto out;
893 if (pte_dirty(*pte) || pte_write(*pte)) {
894 pte_t entry;
896 flush_cache_page(vma, address, pte_pfn(*pte));
897 entry = ptep_clear_flush_notify(vma, address, pte);
898 entry = pte_wrprotect(entry);
899 entry = pte_mkclean(entry);
900 set_pte_at(mm, address, pte, entry);
901 ret = 1;
904 pte_unmap_unlock(pte, ptl);
905 out:
906 return ret;
909 static int page_mkclean_file(struct address_space *mapping, struct page *page)
911 pgoff_t pgoff = page->index << (PAGE_CACHE_SHIFT - PAGE_SHIFT);
912 struct vm_area_struct *vma;
913 struct prio_tree_iter iter;
914 int ret = 0;
916 BUG_ON(PageAnon(page));
918 mutex_lock(&mapping->i_mmap_mutex);
919 vma_prio_tree_foreach(vma, &iter, &mapping->i_mmap, pgoff, pgoff) {
920 if (vma->vm_flags & VM_SHARED) {
921 unsigned long address = vma_address(page, vma);
922 if (address == -EFAULT)
923 continue;
924 ret += page_mkclean_one(page, vma, address);
927 mutex_unlock(&mapping->i_mmap_mutex);
928 return ret;
931 int page_mkclean(struct page *page)
933 int ret = 0;
935 BUG_ON(!PageLocked(page));
937 if (page_mapped(page)) {
938 struct address_space *mapping = page_mapping(page);
939 if (mapping)
940 ret = page_mkclean_file(mapping, page);
943 return ret;
945 EXPORT_SYMBOL_GPL(page_mkclean);
948 * page_move_anon_rmap - move a page to our anon_vma
949 * @page: the page to move to our anon_vma
950 * @vma: the vma the page belongs to
951 * @address: the user virtual address mapped
953 * When a page belongs exclusively to one process after a COW event,
954 * that page can be moved into the anon_vma that belongs to just that
955 * process, so the rmap code will not search the parent or sibling
956 * processes.
958 void page_move_anon_rmap(struct page *page,
959 struct vm_area_struct *vma, unsigned long address)
961 struct anon_vma *anon_vma = vma->anon_vma;
963 VM_BUG_ON(!PageLocked(page));
964 VM_BUG_ON(!anon_vma);
965 VM_BUG_ON(page->index != linear_page_index(vma, address));
967 anon_vma = (void *) anon_vma + PAGE_MAPPING_ANON;
968 page->mapping = (struct address_space *) anon_vma;
972 * __page_set_anon_rmap - set up new anonymous rmap
973 * @page: Page to add to rmap
974 * @vma: VM area to add page to.
975 * @address: User virtual address of the mapping
976 * @exclusive: the page is exclusively owned by the current process
978 static void __page_set_anon_rmap(struct page *page,
979 struct vm_area_struct *vma, unsigned long address, int exclusive)
981 struct anon_vma *anon_vma = vma->anon_vma;
983 BUG_ON(!anon_vma);
985 if (PageAnon(page))
986 return;
989 * If the page isn't exclusively mapped into this vma,
990 * we must use the _oldest_ possible anon_vma for the
991 * page mapping!
993 if (!exclusive)
994 anon_vma = anon_vma->root;
996 anon_vma = (void *) anon_vma + PAGE_MAPPING_ANON;
997 page->mapping = (struct address_space *) anon_vma;
998 page->index = linear_page_index(vma, address);
1002 * __page_check_anon_rmap - sanity check anonymous rmap addition
1003 * @page: the page to add the mapping to
1004 * @vma: the vm area in which the mapping is added
1005 * @address: the user virtual address mapped
1007 static void __page_check_anon_rmap(struct page *page,
1008 struct vm_area_struct *vma, unsigned long address)
1010 #ifdef CONFIG_DEBUG_VM
1012 * The page's anon-rmap details (mapping and index) are guaranteed to
1013 * be set up correctly at this point.
1015 * We have exclusion against page_add_anon_rmap because the caller
1016 * always holds the page locked, except if called from page_dup_rmap,
1017 * in which case the page is already known to be setup.
1019 * We have exclusion against page_add_new_anon_rmap because those pages
1020 * are initially only visible via the pagetables, and the pte is locked
1021 * over the call to page_add_new_anon_rmap.
1023 BUG_ON(page_anon_vma(page)->root != vma->anon_vma->root);
1024 BUG_ON(page->index != linear_page_index(vma, address));
1025 #endif
1029 * page_add_anon_rmap - add pte mapping to an anonymous page
1030 * @page: the page to add the mapping to
1031 * @vma: the vm area in which the mapping is added
1032 * @address: the user virtual address mapped
1034 * The caller needs to hold the pte lock, and the page must be locked in
1035 * the anon_vma case: to serialize mapping,index checking after setting,
1036 * and to ensure that PageAnon is not being upgraded racily to PageKsm
1037 * (but PageKsm is never downgraded to PageAnon).
1039 void page_add_anon_rmap(struct page *page,
1040 struct vm_area_struct *vma, unsigned long address)
1042 do_page_add_anon_rmap(page, vma, address, 0);
1046 * Special version of the above for do_swap_page, which often runs
1047 * into pages that are exclusively owned by the current process.
1048 * Everybody else should continue to use page_add_anon_rmap above.
1050 void do_page_add_anon_rmap(struct page *page,
1051 struct vm_area_struct *vma, unsigned long address, int exclusive)
1053 int first = atomic_inc_and_test(&page->_mapcount);
1054 if (first) {
1055 if (!PageTransHuge(page))
1056 __inc_zone_page_state(page, NR_ANON_PAGES);
1057 else
1058 __inc_zone_page_state(page,
1059 NR_ANON_TRANSPARENT_HUGEPAGES);
1061 if (unlikely(PageKsm(page)))
1062 return;
1064 VM_BUG_ON(!PageLocked(page));
1065 /* address might be in next vma when migration races vma_adjust */
1066 if (first)
1067 __page_set_anon_rmap(page, vma, address, exclusive);
1068 else
1069 __page_check_anon_rmap(page, vma, address);
1073 * page_add_new_anon_rmap - add pte mapping to a new anonymous page
1074 * @page: the page to add the mapping to
1075 * @vma: the vm area in which the mapping is added
1076 * @address: the user virtual address mapped
1078 * Same as page_add_anon_rmap but must only be called on *new* pages.
1079 * This means the inc-and-test can be bypassed.
1080 * Page does not have to be locked.
1082 void page_add_new_anon_rmap(struct page *page,
1083 struct vm_area_struct *vma, unsigned long address)
1085 VM_BUG_ON(address < vma->vm_start || address >= vma->vm_end);
1086 SetPageSwapBacked(page);
1087 atomic_set(&page->_mapcount, 0); /* increment count (starts at -1) */
1088 if (!PageTransHuge(page))
1089 __inc_zone_page_state(page, NR_ANON_PAGES);
1090 else
1091 __inc_zone_page_state(page, NR_ANON_TRANSPARENT_HUGEPAGES);
1092 __page_set_anon_rmap(page, vma, address, 1);
1093 if (page_evictable(page, vma))
1094 lru_cache_add_lru(page, LRU_ACTIVE_ANON);
1095 else
1096 add_page_to_unevictable_list(page);
1100 * page_add_file_rmap - add pte mapping to a file page
1101 * @page: the page to add the mapping to
1103 * The caller needs to hold the pte lock.
1105 void page_add_file_rmap(struct page *page)
1107 if (atomic_inc_and_test(&page->_mapcount)) {
1108 __inc_zone_page_state(page, NR_FILE_MAPPED);
1109 mem_cgroup_inc_page_stat(page, MEMCG_NR_FILE_MAPPED);
1114 * page_remove_rmap - take down pte mapping from a page
1115 * @page: page to remove mapping from
1117 * The caller needs to hold the pte lock.
1119 void page_remove_rmap(struct page *page)
1121 struct address_space *mapping = page_mapping(page);
1123 /* page still mapped by someone else? */
1124 if (!atomic_add_negative(-1, &page->_mapcount))
1125 return;
1128 * Now that the last pte has gone, s390 must transfer dirty
1129 * flag from storage key to struct page. We can usually skip
1130 * this if the page is anon, so about to be freed; but perhaps
1131 * not if it's in swapcache - there might be another pte slot
1132 * containing the swap entry, but page not yet written to swap.
1134 * And we can skip it on file pages, so long as the filesystem
1135 * participates in dirty tracking; but need to catch shm and tmpfs
1136 * and ramfs pages which have been modified since creation by read
1137 * fault.
1139 * Note that mapping must be decided above, before decrementing
1140 * mapcount (which luckily provides a barrier): once page is unmapped,
1141 * it could be truncated and page->mapping reset to NULL at any moment.
1142 * Note also that we are relying on page_mapping(page) to set mapping
1143 * to &swapper_space when PageSwapCache(page).
1145 if (mapping && !mapping_cap_account_dirty(mapping) &&
1146 page_test_and_clear_dirty(page_to_pfn(page), 1))
1147 set_page_dirty(page);
1149 * Hugepages are not counted in NR_ANON_PAGES nor NR_FILE_MAPPED
1150 * and not charged by memcg for now.
1152 if (unlikely(PageHuge(page)))
1153 return;
1154 if (PageAnon(page)) {
1155 mem_cgroup_uncharge_page(page);
1156 if (!PageTransHuge(page))
1157 __dec_zone_page_state(page, NR_ANON_PAGES);
1158 else
1159 __dec_zone_page_state(page,
1160 NR_ANON_TRANSPARENT_HUGEPAGES);
1161 } else {
1162 __dec_zone_page_state(page, NR_FILE_MAPPED);
1163 mem_cgroup_dec_page_stat(page, MEMCG_NR_FILE_MAPPED);
1166 * It would be tidy to reset the PageAnon mapping here,
1167 * but that might overwrite a racing page_add_anon_rmap
1168 * which increments mapcount after us but sets mapping
1169 * before us: so leave the reset to free_hot_cold_page,
1170 * and remember that it's only reliable while mapped.
1171 * Leaving it set also helps swapoff to reinstate ptes
1172 * faster for those pages still in swapcache.
1177 * Subfunctions of try_to_unmap: try_to_unmap_one called
1178 * repeatedly from try_to_unmap_ksm, try_to_unmap_anon or try_to_unmap_file.
1180 int try_to_unmap_one(struct page *page, struct vm_area_struct *vma,
1181 unsigned long address, enum ttu_flags flags)
1183 struct mm_struct *mm = vma->vm_mm;
1184 pte_t *pte;
1185 pte_t pteval;
1186 spinlock_t *ptl;
1187 int ret = SWAP_AGAIN;
1189 pte = page_check_address(page, mm, address, &ptl, 0);
1190 if (!pte)
1191 goto out;
1194 * If the page is mlock()d, we cannot swap it out.
1195 * If it's recently referenced (perhaps page_referenced
1196 * skipped over this mm) then we should reactivate it.
1198 if (!(flags & TTU_IGNORE_MLOCK)) {
1199 if (vma->vm_flags & VM_LOCKED)
1200 goto out_mlock;
1202 if (TTU_ACTION(flags) == TTU_MUNLOCK)
1203 goto out_unmap;
1205 if (!(flags & TTU_IGNORE_ACCESS)) {
1206 if (ptep_clear_flush_young_notify(vma, address, pte)) {
1207 ret = SWAP_FAIL;
1208 goto out_unmap;
1212 /* Nuke the page table entry. */
1213 flush_cache_page(vma, address, page_to_pfn(page));
1214 pteval = ptep_clear_flush_notify(vma, address, pte);
1216 /* Move the dirty bit to the physical page now the pte is gone. */
1217 if (pte_dirty(pteval))
1218 set_page_dirty(page);
1220 /* Update high watermark before we lower rss */
1221 update_hiwater_rss(mm);
1223 if (PageHWPoison(page) && !(flags & TTU_IGNORE_HWPOISON)) {
1224 if (PageAnon(page))
1225 dec_mm_counter(mm, MM_ANONPAGES);
1226 else
1227 dec_mm_counter(mm, MM_FILEPAGES);
1228 set_pte_at(mm, address, pte,
1229 swp_entry_to_pte(make_hwpoison_entry(page)));
1230 } else if (PageAnon(page)) {
1231 swp_entry_t entry = { .val = page_private(page) };
1233 if (PageSwapCache(page)) {
1235 * Store the swap location in the pte.
1236 * See handle_pte_fault() ...
1238 if (swap_duplicate(entry) < 0) {
1239 set_pte_at(mm, address, pte, pteval);
1240 ret = SWAP_FAIL;
1241 goto out_unmap;
1243 if (list_empty(&mm->mmlist)) {
1244 spin_lock(&mmlist_lock);
1245 if (list_empty(&mm->mmlist))
1246 list_add(&mm->mmlist, &init_mm.mmlist);
1247 spin_unlock(&mmlist_lock);
1249 dec_mm_counter(mm, MM_ANONPAGES);
1250 inc_mm_counter(mm, MM_SWAPENTS);
1251 } else if (PAGE_MIGRATION) {
1253 * Store the pfn of the page in a special migration
1254 * pte. do_swap_page() will wait until the migration
1255 * pte is removed and then restart fault handling.
1257 BUG_ON(TTU_ACTION(flags) != TTU_MIGRATION);
1258 entry = make_migration_entry(page, pte_write(pteval));
1260 set_pte_at(mm, address, pte, swp_entry_to_pte(entry));
1261 BUG_ON(pte_file(*pte));
1262 } else if (PAGE_MIGRATION && (TTU_ACTION(flags) == TTU_MIGRATION)) {
1263 /* Establish migration entry for a file page */
1264 swp_entry_t entry;
1265 entry = make_migration_entry(page, pte_write(pteval));
1266 set_pte_at(mm, address, pte, swp_entry_to_pte(entry));
1267 } else
1268 dec_mm_counter(mm, MM_FILEPAGES);
1270 page_remove_rmap(page);
1271 page_cache_release(page);
1273 out_unmap:
1274 pte_unmap_unlock(pte, ptl);
1275 out:
1276 return ret;
1278 out_mlock:
1279 pte_unmap_unlock(pte, ptl);
1283 * We need mmap_sem locking, Otherwise VM_LOCKED check makes
1284 * unstable result and race. Plus, We can't wait here because
1285 * we now hold anon_vma->mutex or mapping->i_mmap_mutex.
1286 * if trylock failed, the page remain in evictable lru and later
1287 * vmscan could retry to move the page to unevictable lru if the
1288 * page is actually mlocked.
1290 if (down_read_trylock(&vma->vm_mm->mmap_sem)) {
1291 if (vma->vm_flags & VM_LOCKED) {
1292 mlock_vma_page(page);
1293 ret = SWAP_MLOCK;
1295 up_read(&vma->vm_mm->mmap_sem);
1297 return ret;
1301 * objrmap doesn't work for nonlinear VMAs because the assumption that
1302 * offset-into-file correlates with offset-into-virtual-addresses does not hold.
1303 * Consequently, given a particular page and its ->index, we cannot locate the
1304 * ptes which are mapping that page without an exhaustive linear search.
1306 * So what this code does is a mini "virtual scan" of each nonlinear VMA which
1307 * maps the file to which the target page belongs. The ->vm_private_data field
1308 * holds the current cursor into that scan. Successive searches will circulate
1309 * around the vma's virtual address space.
1311 * So as more replacement pressure is applied to the pages in a nonlinear VMA,
1312 * more scanning pressure is placed against them as well. Eventually pages
1313 * will become fully unmapped and are eligible for eviction.
1315 * For very sparsely populated VMAs this is a little inefficient - chances are
1316 * there there won't be many ptes located within the scan cluster. In this case
1317 * maybe we could scan further - to the end of the pte page, perhaps.
1319 * Mlocked pages: check VM_LOCKED under mmap_sem held for read, if we can
1320 * acquire it without blocking. If vma locked, mlock the pages in the cluster,
1321 * rather than unmapping them. If we encounter the "check_page" that vmscan is
1322 * trying to unmap, return SWAP_MLOCK, else default SWAP_AGAIN.
1324 #define CLUSTER_SIZE min(32*PAGE_SIZE, PMD_SIZE)
1325 #define CLUSTER_MASK (~(CLUSTER_SIZE - 1))
1327 static int try_to_unmap_cluster(unsigned long cursor, unsigned int *mapcount,
1328 struct vm_area_struct *vma, struct page *check_page)
1330 struct mm_struct *mm = vma->vm_mm;
1331 pgd_t *pgd;
1332 pud_t *pud;
1333 pmd_t *pmd;
1334 pte_t *pte;
1335 pte_t pteval;
1336 spinlock_t *ptl;
1337 struct page *page;
1338 unsigned long address;
1339 unsigned long end;
1340 int ret = SWAP_AGAIN;
1341 int locked_vma = 0;
1343 address = (vma->vm_start + cursor) & CLUSTER_MASK;
1344 end = address + CLUSTER_SIZE;
1345 if (address < vma->vm_start)
1346 address = vma->vm_start;
1347 if (end > vma->vm_end)
1348 end = vma->vm_end;
1350 pgd = pgd_offset(mm, address);
1351 if (!pgd_present(*pgd))
1352 return ret;
1354 pud = pud_offset(pgd, address);
1355 if (!pud_present(*pud))
1356 return ret;
1358 pmd = pmd_offset(pud, address);
1359 if (!pmd_present(*pmd))
1360 return ret;
1363 * If we can acquire the mmap_sem for read, and vma is VM_LOCKED,
1364 * keep the sem while scanning the cluster for mlocking pages.
1366 if (down_read_trylock(&vma->vm_mm->mmap_sem)) {
1367 locked_vma = (vma->vm_flags & VM_LOCKED);
1368 if (!locked_vma)
1369 up_read(&vma->vm_mm->mmap_sem); /* don't need it */
1372 pte = pte_offset_map_lock(mm, pmd, address, &ptl);
1374 /* Update high watermark before we lower rss */
1375 update_hiwater_rss(mm);
1377 for (; address < end; pte++, address += PAGE_SIZE) {
1378 if (!pte_present(*pte))
1379 continue;
1380 page = vm_normal_page(vma, address, *pte);
1381 BUG_ON(!page || PageAnon(page));
1383 if (locked_vma) {
1384 mlock_vma_page(page); /* no-op if already mlocked */
1385 if (page == check_page)
1386 ret = SWAP_MLOCK;
1387 continue; /* don't unmap */
1390 if (ptep_clear_flush_young_notify(vma, address, pte))
1391 continue;
1393 /* Nuke the page table entry. */
1394 flush_cache_page(vma, address, pte_pfn(*pte));
1395 pteval = ptep_clear_flush_notify(vma, address, pte);
1397 /* If nonlinear, store the file page offset in the pte. */
1398 if (page->index != linear_page_index(vma, address))
1399 set_pte_at(mm, address, pte, pgoff_to_pte(page->index));
1401 /* Move the dirty bit to the physical page now the pte is gone. */
1402 if (pte_dirty(pteval))
1403 set_page_dirty(page);
1405 page_remove_rmap(page);
1406 page_cache_release(page);
1407 dec_mm_counter(mm, MM_FILEPAGES);
1408 (*mapcount)--;
1410 pte_unmap_unlock(pte - 1, ptl);
1411 if (locked_vma)
1412 up_read(&vma->vm_mm->mmap_sem);
1413 return ret;
1416 bool is_vma_temporary_stack(struct vm_area_struct *vma)
1418 int maybe_stack = vma->vm_flags & (VM_GROWSDOWN | VM_GROWSUP);
1420 if (!maybe_stack)
1421 return false;
1423 if ((vma->vm_flags & VM_STACK_INCOMPLETE_SETUP) ==
1424 VM_STACK_INCOMPLETE_SETUP)
1425 return true;
1427 return false;
1431 * try_to_unmap_anon - unmap or unlock anonymous page using the object-based
1432 * rmap method
1433 * @page: the page to unmap/unlock
1434 * @flags: action and flags
1436 * Find all the mappings of a page using the mapping pointer and the vma chains
1437 * contained in the anon_vma struct it points to.
1439 * This function is only called from try_to_unmap/try_to_munlock for
1440 * anonymous pages.
1441 * When called from try_to_munlock(), the mmap_sem of the mm containing the vma
1442 * where the page was found will be held for write. So, we won't recheck
1443 * vm_flags for that VMA. That should be OK, because that vma shouldn't be
1444 * 'LOCKED.
1446 static int try_to_unmap_anon(struct page *page, enum ttu_flags flags)
1448 struct anon_vma *anon_vma;
1449 struct anon_vma_chain *avc;
1450 int ret = SWAP_AGAIN;
1452 anon_vma = page_lock_anon_vma(page);
1453 if (!anon_vma)
1454 return ret;
1456 list_for_each_entry(avc, &anon_vma->head, same_anon_vma) {
1457 struct vm_area_struct *vma = avc->vma;
1458 unsigned long address;
1461 * During exec, a temporary VMA is setup and later moved.
1462 * The VMA is moved under the anon_vma lock but not the
1463 * page tables leading to a race where migration cannot
1464 * find the migration ptes. Rather than increasing the
1465 * locking requirements of exec(), migration skips
1466 * temporary VMAs until after exec() completes.
1468 if (PAGE_MIGRATION && (flags & TTU_MIGRATION) &&
1469 is_vma_temporary_stack(vma))
1470 continue;
1472 address = vma_address(page, vma);
1473 if (address == -EFAULT)
1474 continue;
1475 ret = try_to_unmap_one(page, vma, address, flags);
1476 if (ret != SWAP_AGAIN || !page_mapped(page))
1477 break;
1480 page_unlock_anon_vma(anon_vma);
1481 return ret;
1485 * try_to_unmap_file - unmap/unlock file page using the object-based rmap method
1486 * @page: the page to unmap/unlock
1487 * @flags: action and flags
1489 * Find all the mappings of a page using the mapping pointer and the vma chains
1490 * contained in the address_space struct it points to.
1492 * This function is only called from try_to_unmap/try_to_munlock for
1493 * object-based pages.
1494 * When called from try_to_munlock(), the mmap_sem of the mm containing the vma
1495 * where the page was found will be held for write. So, we won't recheck
1496 * vm_flags for that VMA. That should be OK, because that vma shouldn't be
1497 * 'LOCKED.
1499 static int try_to_unmap_file(struct page *page, enum ttu_flags flags)
1501 struct address_space *mapping = page->mapping;
1502 pgoff_t pgoff = page->index << (PAGE_CACHE_SHIFT - PAGE_SHIFT);
1503 struct vm_area_struct *vma;
1504 struct prio_tree_iter iter;
1505 int ret = SWAP_AGAIN;
1506 unsigned long cursor;
1507 unsigned long max_nl_cursor = 0;
1508 unsigned long max_nl_size = 0;
1509 unsigned int mapcount;
1511 mutex_lock(&mapping->i_mmap_mutex);
1512 vma_prio_tree_foreach(vma, &iter, &mapping->i_mmap, pgoff, pgoff) {
1513 unsigned long address = vma_address(page, vma);
1514 if (address == -EFAULT)
1515 continue;
1516 ret = try_to_unmap_one(page, vma, address, flags);
1517 if (ret != SWAP_AGAIN || !page_mapped(page))
1518 goto out;
1521 if (list_empty(&mapping->i_mmap_nonlinear))
1522 goto out;
1525 * We don't bother to try to find the munlocked page in nonlinears.
1526 * It's costly. Instead, later, page reclaim logic may call
1527 * try_to_unmap(TTU_MUNLOCK) and recover PG_mlocked lazily.
1529 if (TTU_ACTION(flags) == TTU_MUNLOCK)
1530 goto out;
1532 list_for_each_entry(vma, &mapping->i_mmap_nonlinear,
1533 shared.vm_set.list) {
1534 cursor = (unsigned long) vma->vm_private_data;
1535 if (cursor > max_nl_cursor)
1536 max_nl_cursor = cursor;
1537 cursor = vma->vm_end - vma->vm_start;
1538 if (cursor > max_nl_size)
1539 max_nl_size = cursor;
1542 if (max_nl_size == 0) { /* all nonlinears locked or reserved ? */
1543 ret = SWAP_FAIL;
1544 goto out;
1548 * We don't try to search for this page in the nonlinear vmas,
1549 * and page_referenced wouldn't have found it anyway. Instead
1550 * just walk the nonlinear vmas trying to age and unmap some.
1551 * The mapcount of the page we came in with is irrelevant,
1552 * but even so use it as a guide to how hard we should try?
1554 mapcount = page_mapcount(page);
1555 if (!mapcount)
1556 goto out;
1557 cond_resched();
1559 max_nl_size = (max_nl_size + CLUSTER_SIZE - 1) & CLUSTER_MASK;
1560 if (max_nl_cursor == 0)
1561 max_nl_cursor = CLUSTER_SIZE;
1563 do {
1564 list_for_each_entry(vma, &mapping->i_mmap_nonlinear,
1565 shared.vm_set.list) {
1566 cursor = (unsigned long) vma->vm_private_data;
1567 while ( cursor < max_nl_cursor &&
1568 cursor < vma->vm_end - vma->vm_start) {
1569 if (try_to_unmap_cluster(cursor, &mapcount,
1570 vma, page) == SWAP_MLOCK)
1571 ret = SWAP_MLOCK;
1572 cursor += CLUSTER_SIZE;
1573 vma->vm_private_data = (void *) cursor;
1574 if ((int)mapcount <= 0)
1575 goto out;
1577 vma->vm_private_data = (void *) max_nl_cursor;
1579 cond_resched();
1580 max_nl_cursor += CLUSTER_SIZE;
1581 } while (max_nl_cursor <= max_nl_size);
1584 * Don't loop forever (perhaps all the remaining pages are
1585 * in locked vmas). Reset cursor on all unreserved nonlinear
1586 * vmas, now forgetting on which ones it had fallen behind.
1588 list_for_each_entry(vma, &mapping->i_mmap_nonlinear, shared.vm_set.list)
1589 vma->vm_private_data = NULL;
1590 out:
1591 mutex_unlock(&mapping->i_mmap_mutex);
1592 return ret;
1596 * try_to_unmap - try to remove all page table mappings to a page
1597 * @page: the page to get unmapped
1598 * @flags: action and flags
1600 * Tries to remove all the page table entries which are mapping this
1601 * page, used in the pageout path. Caller must hold the page lock.
1602 * Return values are:
1604 * SWAP_SUCCESS - we succeeded in removing all mappings
1605 * SWAP_AGAIN - we missed a mapping, try again later
1606 * SWAP_FAIL - the page is unswappable
1607 * SWAP_MLOCK - page is mlocked.
1609 int try_to_unmap(struct page *page, enum ttu_flags flags)
1611 int ret;
1613 BUG_ON(!PageLocked(page));
1614 VM_BUG_ON(!PageHuge(page) && PageTransHuge(page));
1616 if (unlikely(PageKsm(page)))
1617 ret = try_to_unmap_ksm(page, flags);
1618 else if (PageAnon(page))
1619 ret = try_to_unmap_anon(page, flags);
1620 else
1621 ret = try_to_unmap_file(page, flags);
1622 if (ret != SWAP_MLOCK && !page_mapped(page))
1623 ret = SWAP_SUCCESS;
1624 return ret;
1628 * try_to_munlock - try to munlock a page
1629 * @page: the page to be munlocked
1631 * Called from munlock code. Checks all of the VMAs mapping the page
1632 * to make sure nobody else has this page mlocked. The page will be
1633 * returned with PG_mlocked cleared if no other vmas have it mlocked.
1635 * Return values are:
1637 * SWAP_AGAIN - no vma is holding page mlocked, or,
1638 * SWAP_AGAIN - page mapped in mlocked vma -- couldn't acquire mmap sem
1639 * SWAP_FAIL - page cannot be located at present
1640 * SWAP_MLOCK - page is now mlocked.
1642 int try_to_munlock(struct page *page)
1644 VM_BUG_ON(!PageLocked(page) || PageLRU(page));
1646 if (unlikely(PageKsm(page)))
1647 return try_to_unmap_ksm(page, TTU_MUNLOCK);
1648 else if (PageAnon(page))
1649 return try_to_unmap_anon(page, TTU_MUNLOCK);
1650 else
1651 return try_to_unmap_file(page, TTU_MUNLOCK);
1654 void __put_anon_vma(struct anon_vma *anon_vma)
1656 struct anon_vma *root = anon_vma->root;
1658 if (root != anon_vma && atomic_dec_and_test(&root->refcount))
1659 anon_vma_free(root);
1661 anon_vma_free(anon_vma);
1664 #ifdef CONFIG_MIGRATION
1666 * rmap_walk() and its helpers rmap_walk_anon() and rmap_walk_file():
1667 * Called by migrate.c to remove migration ptes, but might be used more later.
1669 static int rmap_walk_anon(struct page *page, int (*rmap_one)(struct page *,
1670 struct vm_area_struct *, unsigned long, void *), void *arg)
1672 struct anon_vma *anon_vma;
1673 struct anon_vma_chain *avc;
1674 int ret = SWAP_AGAIN;
1677 * Note: remove_migration_ptes() cannot use page_lock_anon_vma()
1678 * because that depends on page_mapped(); but not all its usages
1679 * are holding mmap_sem. Users without mmap_sem are required to
1680 * take a reference count to prevent the anon_vma disappearing
1682 anon_vma = page_anon_vma(page);
1683 if (!anon_vma)
1684 return ret;
1685 anon_vma_lock(anon_vma);
1686 list_for_each_entry(avc, &anon_vma->head, same_anon_vma) {
1687 struct vm_area_struct *vma = avc->vma;
1688 unsigned long address = vma_address(page, vma);
1689 if (address == -EFAULT)
1690 continue;
1691 ret = rmap_one(page, vma, address, arg);
1692 if (ret != SWAP_AGAIN)
1693 break;
1695 anon_vma_unlock(anon_vma);
1696 return ret;
1699 static int rmap_walk_file(struct page *page, int (*rmap_one)(struct page *,
1700 struct vm_area_struct *, unsigned long, void *), void *arg)
1702 struct address_space *mapping = page->mapping;
1703 pgoff_t pgoff = page->index << (PAGE_CACHE_SHIFT - PAGE_SHIFT);
1704 struct vm_area_struct *vma;
1705 struct prio_tree_iter iter;
1706 int ret = SWAP_AGAIN;
1708 if (!mapping)
1709 return ret;
1710 mutex_lock(&mapping->i_mmap_mutex);
1711 vma_prio_tree_foreach(vma, &iter, &mapping->i_mmap, pgoff, pgoff) {
1712 unsigned long address = vma_address(page, vma);
1713 if (address == -EFAULT)
1714 continue;
1715 ret = rmap_one(page, vma, address, arg);
1716 if (ret != SWAP_AGAIN)
1717 break;
1720 * No nonlinear handling: being always shared, nonlinear vmas
1721 * never contain migration ptes. Decide what to do about this
1722 * limitation to linear when we need rmap_walk() on nonlinear.
1724 mutex_unlock(&mapping->i_mmap_mutex);
1725 return ret;
1728 int rmap_walk(struct page *page, int (*rmap_one)(struct page *,
1729 struct vm_area_struct *, unsigned long, void *), void *arg)
1731 VM_BUG_ON(!PageLocked(page));
1733 if (unlikely(PageKsm(page)))
1734 return rmap_walk_ksm(page, rmap_one, arg);
1735 else if (PageAnon(page))
1736 return rmap_walk_anon(page, rmap_one, arg);
1737 else
1738 return rmap_walk_file(page, rmap_one, arg);
1740 #endif /* CONFIG_MIGRATION */
1742 #ifdef CONFIG_HUGETLB_PAGE
1744 * The following three functions are for anonymous (private mapped) hugepages.
1745 * Unlike common anonymous pages, anonymous hugepages have no accounting code
1746 * and no lru code, because we handle hugepages differently from common pages.
1748 static void __hugepage_set_anon_rmap(struct page *page,
1749 struct vm_area_struct *vma, unsigned long address, int exclusive)
1751 struct anon_vma *anon_vma = vma->anon_vma;
1753 BUG_ON(!anon_vma);
1755 if (PageAnon(page))
1756 return;
1757 if (!exclusive)
1758 anon_vma = anon_vma->root;
1760 anon_vma = (void *) anon_vma + PAGE_MAPPING_ANON;
1761 page->mapping = (struct address_space *) anon_vma;
1762 page->index = linear_page_index(vma, address);
1765 void hugepage_add_anon_rmap(struct page *page,
1766 struct vm_area_struct *vma, unsigned long address)
1768 struct anon_vma *anon_vma = vma->anon_vma;
1769 int first;
1771 BUG_ON(!PageLocked(page));
1772 BUG_ON(!anon_vma);
1773 /* address might be in next vma when migration races vma_adjust */
1774 first = atomic_inc_and_test(&page->_mapcount);
1775 if (first)
1776 __hugepage_set_anon_rmap(page, vma, address, 0);
1779 void hugepage_add_new_anon_rmap(struct page *page,
1780 struct vm_area_struct *vma, unsigned long address)
1782 BUG_ON(address < vma->vm_start || address >= vma->vm_end);
1783 atomic_set(&page->_mapcount, 0);
1784 __hugepage_set_anon_rmap(page, vma, address, 1);
1786 #endif /* CONFIG_HUGETLB_PAGE */