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)
25 * page->flags PG_locked (lock_page)
26 * mapping->i_mmap_rwsem
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 * mem_cgroup_{begin,end}_page_stat (memcg->move_lock)
34 * mapping->tree_lock (widely used)
35 * inode->i_lock (in set_page_dirty's __mark_inode_dirty)
36 * bdi.wb->list_lock (in set_page_dirty's __mark_inode_dirty)
37 * sb_lock (within inode_lock in fs/fs-writeback.c)
38 * mapping->tree_lock (widely used, in set_page_dirty,
39 * in arch-dependent flush_dcache_mmap_lock,
40 * within bdi.wb->list_lock in __sync_single_inode)
42 * anon_vma->rwsem,mapping->i_mutex (memory_failure, collect_procs_anon)
48 #include <linux/pagemap.h>
49 #include <linux/swap.h>
50 #include <linux/swapops.h>
51 #include <linux/slab.h>
52 #include <linux/init.h>
53 #include <linux/ksm.h>
54 #include <linux/rmap.h>
55 #include <linux/rcupdate.h>
56 #include <linux/export.h>
57 #include <linux/memcontrol.h>
58 #include <linux/mmu_notifier.h>
59 #include <linux/migrate.h>
60 #include <linux/hugetlb.h>
61 #include <linux/backing-dev.h>
62 #include <linux/page_idle.h>
64 #include <asm/tlbflush.h>
66 #include <trace/events/tlb.h>
70 static struct kmem_cache *anon_vma_cachep;
71 static struct kmem_cache *anon_vma_chain_cachep;
73 static inline struct anon_vma *anon_vma_alloc(void)
75 struct anon_vma *anon_vma;
77 anon_vma = kmem_cache_alloc(anon_vma_cachep, GFP_KERNEL);
79 atomic_set(&anon_vma->refcount, 1);
80 anon_vma->degree = 1; /* Reference for first vma */
81 anon_vma->parent = anon_vma;
83 * Initialise the anon_vma root to point to itself. If called
84 * from fork, the root will be reset to the parents anon_vma.
86 anon_vma->root = anon_vma;
92 static inline void anon_vma_free(struct anon_vma *anon_vma)
94 VM_BUG_ON(atomic_read(&anon_vma->refcount));
97 * Synchronize against page_lock_anon_vma_read() such that
98 * we can safely hold the lock without the anon_vma getting
101 * Relies on the full mb implied by the atomic_dec_and_test() from
102 * put_anon_vma() against the acquire barrier implied by
103 * down_read_trylock() from page_lock_anon_vma_read(). This orders:
105 * page_lock_anon_vma_read() VS put_anon_vma()
106 * down_read_trylock() atomic_dec_and_test()
108 * atomic_read() rwsem_is_locked()
110 * LOCK should suffice since the actual taking of the lock must
111 * happen _before_ what follows.
114 if (rwsem_is_locked(&anon_vma->root->rwsem)) {
115 anon_vma_lock_write(anon_vma);
116 anon_vma_unlock_write(anon_vma);
119 kmem_cache_free(anon_vma_cachep, anon_vma);
122 static inline struct anon_vma_chain *anon_vma_chain_alloc(gfp_t gfp)
124 return kmem_cache_alloc(anon_vma_chain_cachep, gfp);
127 static void anon_vma_chain_free(struct anon_vma_chain *anon_vma_chain)
129 kmem_cache_free(anon_vma_chain_cachep, anon_vma_chain);
132 static void anon_vma_chain_link(struct vm_area_struct *vma,
133 struct anon_vma_chain *avc,
134 struct anon_vma *anon_vma)
137 avc->anon_vma = anon_vma;
138 list_add(&avc->same_vma, &vma->anon_vma_chain);
139 anon_vma_interval_tree_insert(avc, &anon_vma->rb_root);
143 * anon_vma_prepare - attach an anon_vma to a memory region
144 * @vma: the memory region in question
146 * This makes sure the memory mapping described by 'vma' has
147 * an 'anon_vma' attached to it, so that we can associate the
148 * anonymous pages mapped into it with that anon_vma.
150 * The common case will be that we already have one, but if
151 * not we either need to find an adjacent mapping that we
152 * can re-use the anon_vma from (very common when the only
153 * reason for splitting a vma has been mprotect()), or we
154 * allocate a new one.
156 * Anon-vma allocations are very subtle, because we may have
157 * optimistically looked up an anon_vma in page_lock_anon_vma_read()
158 * and that may actually touch the spinlock even in the newly
159 * allocated vma (it depends on RCU to make sure that the
160 * anon_vma isn't actually destroyed).
162 * As a result, we need to do proper anon_vma locking even
163 * for the new allocation. At the same time, we do not want
164 * to do any locking for the common case of already having
167 * This must be called with the mmap_sem held for reading.
169 int anon_vma_prepare(struct vm_area_struct *vma)
171 struct anon_vma *anon_vma = vma->anon_vma;
172 struct anon_vma_chain *avc;
175 if (unlikely(!anon_vma)) {
176 struct mm_struct *mm = vma->vm_mm;
177 struct anon_vma *allocated;
179 avc = anon_vma_chain_alloc(GFP_KERNEL);
183 anon_vma = find_mergeable_anon_vma(vma);
186 anon_vma = anon_vma_alloc();
187 if (unlikely(!anon_vma))
188 goto out_enomem_free_avc;
189 allocated = anon_vma;
192 anon_vma_lock_write(anon_vma);
193 /* page_table_lock to protect against threads */
194 spin_lock(&mm->page_table_lock);
195 if (likely(!vma->anon_vma)) {
196 vma->anon_vma = anon_vma;
197 anon_vma_chain_link(vma, avc, anon_vma);
198 /* vma reference or self-parent link for new root */
203 spin_unlock(&mm->page_table_lock);
204 anon_vma_unlock_write(anon_vma);
206 if (unlikely(allocated))
207 put_anon_vma(allocated);
209 anon_vma_chain_free(avc);
214 anon_vma_chain_free(avc);
220 * This is a useful helper function for locking the anon_vma root as
221 * we traverse the vma->anon_vma_chain, looping over anon_vma's that
224 * Such anon_vma's should have the same root, so you'd expect to see
225 * just a single mutex_lock for the whole traversal.
227 static inline struct anon_vma *lock_anon_vma_root(struct anon_vma *root, struct anon_vma *anon_vma)
229 struct anon_vma *new_root = anon_vma->root;
230 if (new_root != root) {
231 if (WARN_ON_ONCE(root))
232 up_write(&root->rwsem);
234 down_write(&root->rwsem);
239 static inline void unlock_anon_vma_root(struct anon_vma *root)
242 up_write(&root->rwsem);
246 * Attach the anon_vmas from src to dst.
247 * Returns 0 on success, -ENOMEM on failure.
249 * If dst->anon_vma is NULL this function tries to find and reuse existing
250 * anon_vma which has no vmas and only one child anon_vma. This prevents
251 * degradation of anon_vma hierarchy to endless linear chain in case of
252 * constantly forking task. On the other hand, an anon_vma with more than one
253 * child isn't reused even if there was no alive vma, thus rmap walker has a
254 * good chance of avoiding scanning the whole hierarchy when it searches where
257 int anon_vma_clone(struct vm_area_struct *dst, struct vm_area_struct *src)
259 struct anon_vma_chain *avc, *pavc;
260 struct anon_vma *root = NULL;
262 list_for_each_entry_reverse(pavc, &src->anon_vma_chain, same_vma) {
263 struct anon_vma *anon_vma;
265 avc = anon_vma_chain_alloc(GFP_NOWAIT | __GFP_NOWARN);
266 if (unlikely(!avc)) {
267 unlock_anon_vma_root(root);
269 avc = anon_vma_chain_alloc(GFP_KERNEL);
273 anon_vma = pavc->anon_vma;
274 root = lock_anon_vma_root(root, anon_vma);
275 anon_vma_chain_link(dst, avc, anon_vma);
278 * Reuse existing anon_vma if its degree lower than two,
279 * that means it has no vma and only one anon_vma child.
281 * Do not chose parent anon_vma, otherwise first child
282 * will always reuse it. Root anon_vma is never reused:
283 * it has self-parent reference and at least one child.
285 if (!dst->anon_vma && anon_vma != src->anon_vma &&
286 anon_vma->degree < 2)
287 dst->anon_vma = anon_vma;
290 dst->anon_vma->degree++;
291 unlock_anon_vma_root(root);
296 * dst->anon_vma is dropped here otherwise its degree can be incorrectly
297 * decremented in unlink_anon_vmas().
298 * We can safely do this because callers of anon_vma_clone() don't care
299 * about dst->anon_vma if anon_vma_clone() failed.
301 dst->anon_vma = NULL;
302 unlink_anon_vmas(dst);
307 * Attach vma to its own anon_vma, as well as to the anon_vmas that
308 * the corresponding VMA in the parent process is attached to.
309 * Returns 0 on success, non-zero on failure.
311 int anon_vma_fork(struct vm_area_struct *vma, struct vm_area_struct *pvma)
313 struct anon_vma_chain *avc;
314 struct anon_vma *anon_vma;
317 /* Don't bother if the parent process has no anon_vma here. */
321 /* Drop inherited anon_vma, we'll reuse existing or allocate new. */
322 vma->anon_vma = NULL;
325 * First, attach the new VMA to the parent VMA's anon_vmas,
326 * so rmap can find non-COWed pages in child processes.
328 error = anon_vma_clone(vma, pvma);
332 /* An existing anon_vma has been reused, all done then. */
336 /* Then add our own anon_vma. */
337 anon_vma = anon_vma_alloc();
340 avc = anon_vma_chain_alloc(GFP_KERNEL);
342 goto out_error_free_anon_vma;
345 * The root anon_vma's spinlock is the lock actually used when we
346 * lock any of the anon_vmas in this anon_vma tree.
348 anon_vma->root = pvma->anon_vma->root;
349 anon_vma->parent = pvma->anon_vma;
351 * With refcounts, an anon_vma can stay around longer than the
352 * process it belongs to. The root anon_vma needs to be pinned until
353 * this anon_vma is freed, because the lock lives in the root.
355 get_anon_vma(anon_vma->root);
356 /* Mark this anon_vma as the one where our new (COWed) pages go. */
357 vma->anon_vma = anon_vma;
358 anon_vma_lock_write(anon_vma);
359 anon_vma_chain_link(vma, avc, anon_vma);
360 anon_vma->parent->degree++;
361 anon_vma_unlock_write(anon_vma);
365 out_error_free_anon_vma:
366 put_anon_vma(anon_vma);
368 unlink_anon_vmas(vma);
372 void unlink_anon_vmas(struct vm_area_struct *vma)
374 struct anon_vma_chain *avc, *next;
375 struct anon_vma *root = NULL;
378 * Unlink each anon_vma chained to the VMA. This list is ordered
379 * from newest to oldest, ensuring the root anon_vma gets freed last.
381 list_for_each_entry_safe(avc, next, &vma->anon_vma_chain, same_vma) {
382 struct anon_vma *anon_vma = avc->anon_vma;
384 root = lock_anon_vma_root(root, anon_vma);
385 anon_vma_interval_tree_remove(avc, &anon_vma->rb_root);
388 * Leave empty anon_vmas on the list - we'll need
389 * to free them outside the lock.
391 if (RB_EMPTY_ROOT(&anon_vma->rb_root)) {
392 anon_vma->parent->degree--;
396 list_del(&avc->same_vma);
397 anon_vma_chain_free(avc);
400 vma->anon_vma->degree--;
401 unlock_anon_vma_root(root);
404 * Iterate the list once more, it now only contains empty and unlinked
405 * anon_vmas, destroy them. Could not do before due to __put_anon_vma()
406 * needing to write-acquire the anon_vma->root->rwsem.
408 list_for_each_entry_safe(avc, next, &vma->anon_vma_chain, same_vma) {
409 struct anon_vma *anon_vma = avc->anon_vma;
411 BUG_ON(anon_vma->degree);
412 put_anon_vma(anon_vma);
414 list_del(&avc->same_vma);
415 anon_vma_chain_free(avc);
419 static void anon_vma_ctor(void *data)
421 struct anon_vma *anon_vma = data;
423 init_rwsem(&anon_vma->rwsem);
424 atomic_set(&anon_vma->refcount, 0);
425 anon_vma->rb_root = RB_ROOT;
428 void __init anon_vma_init(void)
430 anon_vma_cachep = kmem_cache_create("anon_vma", sizeof(struct anon_vma),
431 0, SLAB_DESTROY_BY_RCU|SLAB_PANIC|SLAB_ACCOUNT,
433 anon_vma_chain_cachep = KMEM_CACHE(anon_vma_chain,
434 SLAB_PANIC|SLAB_ACCOUNT);
438 * Getting a lock on a stable anon_vma from a page off the LRU is tricky!
440 * Since there is no serialization what so ever against page_remove_rmap()
441 * the best this function can do is return a locked anon_vma that might
442 * have been relevant to this page.
444 * The page might have been remapped to a different anon_vma or the anon_vma
445 * returned may already be freed (and even reused).
447 * In case it was remapped to a different anon_vma, the new anon_vma will be a
448 * child of the old anon_vma, and the anon_vma lifetime rules will therefore
449 * ensure that any anon_vma obtained from the page will still be valid for as
450 * long as we observe page_mapped() [ hence all those page_mapped() tests ].
452 * All users of this function must be very careful when walking the anon_vma
453 * chain and verify that the page in question is indeed mapped in it
454 * [ something equivalent to page_mapped_in_vma() ].
456 * Since anon_vma's slab is DESTROY_BY_RCU and we know from page_remove_rmap()
457 * that the anon_vma pointer from page->mapping is valid if there is a
458 * mapcount, we can dereference the anon_vma after observing those.
460 struct anon_vma *page_get_anon_vma(struct page *page)
462 struct anon_vma *anon_vma = NULL;
463 unsigned long anon_mapping;
466 anon_mapping = (unsigned long)READ_ONCE(page->mapping);
467 if ((anon_mapping & PAGE_MAPPING_FLAGS) != PAGE_MAPPING_ANON)
469 if (!page_mapped(page))
472 anon_vma = (struct anon_vma *) (anon_mapping - PAGE_MAPPING_ANON);
473 if (!atomic_inc_not_zero(&anon_vma->refcount)) {
479 * If this page is still mapped, then its anon_vma cannot have been
480 * freed. But if it has been unmapped, we have no security against the
481 * anon_vma structure being freed and reused (for another anon_vma:
482 * SLAB_DESTROY_BY_RCU guarantees that - so the atomic_inc_not_zero()
483 * above cannot corrupt).
485 if (!page_mapped(page)) {
487 put_anon_vma(anon_vma);
497 * Similar to page_get_anon_vma() except it locks the anon_vma.
499 * Its a little more complex as it tries to keep the fast path to a single
500 * atomic op -- the trylock. If we fail the trylock, we fall back to getting a
501 * reference like with page_get_anon_vma() and then block on the mutex.
503 struct anon_vma *page_lock_anon_vma_read(struct page *page)
505 struct anon_vma *anon_vma = NULL;
506 struct anon_vma *root_anon_vma;
507 unsigned long anon_mapping;
510 anon_mapping = (unsigned long)READ_ONCE(page->mapping);
511 if ((anon_mapping & PAGE_MAPPING_FLAGS) != PAGE_MAPPING_ANON)
513 if (!page_mapped(page))
516 anon_vma = (struct anon_vma *) (anon_mapping - PAGE_MAPPING_ANON);
517 root_anon_vma = READ_ONCE(anon_vma->root);
518 if (down_read_trylock(&root_anon_vma->rwsem)) {
520 * If the page is still mapped, then this anon_vma is still
521 * its anon_vma, and holding the mutex ensures that it will
522 * not go away, see anon_vma_free().
524 if (!page_mapped(page)) {
525 up_read(&root_anon_vma->rwsem);
531 /* trylock failed, we got to sleep */
532 if (!atomic_inc_not_zero(&anon_vma->refcount)) {
537 if (!page_mapped(page)) {
539 put_anon_vma(anon_vma);
543 /* we pinned the anon_vma, its safe to sleep */
545 anon_vma_lock_read(anon_vma);
547 if (atomic_dec_and_test(&anon_vma->refcount)) {
549 * Oops, we held the last refcount, release the lock
550 * and bail -- can't simply use put_anon_vma() because
551 * we'll deadlock on the anon_vma_lock_write() recursion.
553 anon_vma_unlock_read(anon_vma);
554 __put_anon_vma(anon_vma);
565 void page_unlock_anon_vma_read(struct anon_vma *anon_vma)
567 anon_vma_unlock_read(anon_vma);
571 * At what user virtual address is page expected in @vma?
573 static inline unsigned long
574 __vma_address(struct page *page, struct vm_area_struct *vma)
576 pgoff_t pgoff = page_to_pgoff(page);
577 return vma->vm_start + ((pgoff - vma->vm_pgoff) << PAGE_SHIFT);
581 vma_address(struct page *page, struct vm_area_struct *vma)
583 unsigned long address = __vma_address(page, vma);
585 /* page should be within @vma mapping range */
586 VM_BUG_ON_VMA(address < vma->vm_start || address >= vma->vm_end, vma);
591 #ifdef CONFIG_ARCH_WANT_BATCHED_UNMAP_TLB_FLUSH
592 static void percpu_flush_tlb_batch_pages(void *data)
595 * All TLB entries are flushed on the assumption that it is
596 * cheaper to flush all TLBs and let them be refilled than
597 * flushing individual PFNs. Note that we do not track mm's
598 * to flush as that might simply be multiple full TLB flushes
601 count_vm_tlb_event(NR_TLB_REMOTE_FLUSH_RECEIVED);
606 * Flush TLB entries for recently unmapped pages from remote CPUs. It is
607 * important if a PTE was dirty when it was unmapped that it's flushed
608 * before any IO is initiated on the page to prevent lost writes. Similarly,
609 * it must be flushed before freeing to prevent data leakage.
611 void try_to_unmap_flush(void)
613 struct tlbflush_unmap_batch *tlb_ubc = ¤t->tlb_ubc;
616 if (!tlb_ubc->flush_required)
621 trace_tlb_flush(TLB_REMOTE_SHOOTDOWN, -1UL);
623 if (cpumask_test_cpu(cpu, &tlb_ubc->cpumask))
624 percpu_flush_tlb_batch_pages(&tlb_ubc->cpumask);
626 if (cpumask_any_but(&tlb_ubc->cpumask, cpu) < nr_cpu_ids) {
627 smp_call_function_many(&tlb_ubc->cpumask,
628 percpu_flush_tlb_batch_pages, (void *)tlb_ubc, true);
630 cpumask_clear(&tlb_ubc->cpumask);
631 tlb_ubc->flush_required = false;
632 tlb_ubc->writable = false;
636 /* Flush iff there are potentially writable TLB entries that can race with IO */
637 void try_to_unmap_flush_dirty(void)
639 struct tlbflush_unmap_batch *tlb_ubc = ¤t->tlb_ubc;
641 if (tlb_ubc->writable)
642 try_to_unmap_flush();
645 static void set_tlb_ubc_flush_pending(struct mm_struct *mm,
646 struct page *page, bool writable)
648 struct tlbflush_unmap_batch *tlb_ubc = ¤t->tlb_ubc;
650 cpumask_or(&tlb_ubc->cpumask, &tlb_ubc->cpumask, mm_cpumask(mm));
651 tlb_ubc->flush_required = true;
654 * If the PTE was dirty then it's best to assume it's writable. The
655 * caller must use try_to_unmap_flush_dirty() or try_to_unmap_flush()
656 * before the page is queued for IO.
659 tlb_ubc->writable = true;
663 * Returns true if the TLB flush should be deferred to the end of a batch of
664 * unmap operations to reduce IPIs.
666 static bool should_defer_flush(struct mm_struct *mm, enum ttu_flags flags)
668 bool should_defer = false;
670 if (!(flags & TTU_BATCH_FLUSH))
673 /* If remote CPUs need to be flushed then defer batch the flush */
674 if (cpumask_any_but(mm_cpumask(mm), get_cpu()) < nr_cpu_ids)
681 static void set_tlb_ubc_flush_pending(struct mm_struct *mm,
682 struct page *page, bool writable)
686 static bool should_defer_flush(struct mm_struct *mm, enum ttu_flags flags)
690 #endif /* CONFIG_ARCH_WANT_BATCHED_UNMAP_TLB_FLUSH */
693 * At what user virtual address is page expected in vma?
694 * Caller should check the page is actually part of the vma.
696 unsigned long page_address_in_vma(struct page *page, struct vm_area_struct *vma)
698 unsigned long address;
699 if (PageAnon(page)) {
700 struct anon_vma *page__anon_vma = page_anon_vma(page);
702 * Note: swapoff's unuse_vma() is more efficient with this
703 * check, and needs it to match anon_vma when KSM is active.
705 if (!vma->anon_vma || !page__anon_vma ||
706 vma->anon_vma->root != page__anon_vma->root)
708 } else if (page->mapping) {
709 if (!vma->vm_file || vma->vm_file->f_mapping != page->mapping)
713 address = __vma_address(page, vma);
714 if (unlikely(address < vma->vm_start || address >= vma->vm_end))
719 pmd_t *mm_find_pmd(struct mm_struct *mm, unsigned long address)
726 pgd = pgd_offset(mm, address);
727 if (!pgd_present(*pgd))
730 pud = pud_offset(pgd, address);
731 if (!pud_present(*pud))
734 pmd = pmd_offset(pud, address);
736 * Some THP functions use the sequence pmdp_huge_clear_flush(), set_pmd_at()
737 * without holding anon_vma lock for write. So when looking for a
738 * genuine pmde (in which to find pte), test present and !THP together.
742 if (!pmd_present(pmde) || pmd_trans_huge(pmde))
749 * Check that @page is mapped at @address into @mm.
751 * If @sync is false, page_check_address may perform a racy check to avoid
752 * the page table lock when the pte is not present (helpful when reclaiming
753 * highly shared pages).
755 * On success returns with pte mapped and locked.
757 pte_t *__page_check_address(struct page *page, struct mm_struct *mm,
758 unsigned long address, spinlock_t **ptlp, int sync)
764 if (unlikely(PageHuge(page))) {
765 /* when pud is not present, pte will be NULL */
766 pte = huge_pte_offset(mm, address);
770 ptl = huge_pte_lockptr(page_hstate(page), mm, pte);
774 pmd = mm_find_pmd(mm, address);
778 pte = pte_offset_map(pmd, address);
779 /* Make a quick check before getting the lock */
780 if (!sync && !pte_present(*pte)) {
785 ptl = pte_lockptr(mm, pmd);
788 if (pte_present(*pte) && page_to_pfn(page) == pte_pfn(*pte)) {
792 pte_unmap_unlock(pte, ptl);
797 * page_mapped_in_vma - check whether a page is really mapped in a VMA
798 * @page: the page to test
799 * @vma: the VMA to test
801 * Returns 1 if the page is mapped into the page tables of the VMA, 0
802 * if the page is not mapped into the page tables of this VMA. Only
803 * valid for normal file or anonymous VMAs.
805 int page_mapped_in_vma(struct page *page, struct vm_area_struct *vma)
807 unsigned long address;
811 address = __vma_address(page, vma);
812 if (unlikely(address < vma->vm_start || address >= vma->vm_end))
814 pte = page_check_address(page, vma->vm_mm, address, &ptl, 1);
815 if (!pte) /* the page is not in this mm */
817 pte_unmap_unlock(pte, ptl);
822 struct page_referenced_arg {
825 unsigned long vm_flags;
826 struct mem_cgroup *memcg;
829 * arg: page_referenced_arg will be passed
831 static int page_referenced_one(struct page *page, struct vm_area_struct *vma,
832 unsigned long address, void *arg)
834 struct mm_struct *mm = vma->vm_mm;
837 struct page_referenced_arg *pra = arg;
839 if (unlikely(PageTransHuge(page))) {
843 * rmap might return false positives; we must filter
844 * these out using page_check_address_pmd().
846 pmd = page_check_address_pmd(page, mm, address,
847 PAGE_CHECK_ADDRESS_PMD_FLAG, &ptl);
851 if (vma->vm_flags & VM_LOCKED) {
853 pra->vm_flags |= VM_LOCKED;
854 return SWAP_FAIL; /* To break the loop */
857 /* go ahead even if the pmd is pmd_trans_splitting() */
858 if (pmdp_clear_flush_young_notify(vma, address, pmd))
865 * rmap might return false positives; we must filter
866 * these out using page_check_address().
868 pte = page_check_address(page, mm, address, &ptl, 0);
872 if (vma->vm_flags & VM_LOCKED) {
873 pte_unmap_unlock(pte, ptl);
874 pra->vm_flags |= VM_LOCKED;
875 return SWAP_FAIL; /* To break the loop */
878 if (ptep_clear_flush_young_notify(vma, address, pte)) {
880 * Don't treat a reference through a sequentially read
881 * mapping as such. If the page has been used in
882 * another mapping, we will catch it; if this other
883 * mapping is already gone, the unmap path will have
884 * set PG_referenced or activated the page.
886 if (likely(!(vma->vm_flags & VM_SEQ_READ)))
889 pte_unmap_unlock(pte, ptl);
893 clear_page_idle(page);
894 if (test_and_clear_page_young(page))
899 pra->vm_flags |= vma->vm_flags;
904 return SWAP_SUCCESS; /* To break the loop */
909 static bool invalid_page_referenced_vma(struct vm_area_struct *vma, void *arg)
911 struct page_referenced_arg *pra = arg;
912 struct mem_cgroup *memcg = pra->memcg;
914 if (!mm_match_cgroup(vma->vm_mm, memcg))
921 * page_referenced - test if the page was referenced
922 * @page: the page to test
923 * @is_locked: caller holds lock on the page
924 * @memcg: target memory cgroup
925 * @vm_flags: collect encountered vma->vm_flags who actually referenced the page
927 * Quick test_and_clear_referenced for all mappings to a page,
928 * returns the number of ptes which referenced the page.
930 int page_referenced(struct page *page,
932 struct mem_cgroup *memcg,
933 unsigned long *vm_flags)
937 struct page_referenced_arg pra = {
938 .mapcount = page_mapcount(page),
941 struct rmap_walk_control rwc = {
942 .rmap_one = page_referenced_one,
944 .anon_lock = page_lock_anon_vma_read,
948 if (!page_mapped(page))
951 if (!page_rmapping(page))
954 if (!is_locked && (!PageAnon(page) || PageKsm(page))) {
955 we_locked = trylock_page(page);
961 * If we are reclaiming on behalf of a cgroup, skip
962 * counting on behalf of references from different
966 rwc.invalid_vma = invalid_page_referenced_vma;
969 ret = rmap_walk(page, &rwc);
970 *vm_flags = pra.vm_flags;
975 return pra.referenced;
978 static int page_mkclean_one(struct page *page, struct vm_area_struct *vma,
979 unsigned long address, void *arg)
981 struct mm_struct *mm = vma->vm_mm;
987 pte = page_check_address(page, mm, address, &ptl, 1);
991 if (pte_dirty(*pte) || pte_write(*pte)) {
994 flush_cache_page(vma, address, pte_pfn(*pte));
995 entry = ptep_clear_flush(vma, address, pte);
996 entry = pte_wrprotect(entry);
997 entry = pte_mkclean(entry);
998 set_pte_at(mm, address, pte, entry);
1002 pte_unmap_unlock(pte, ptl);
1005 mmu_notifier_invalidate_page(mm, address);
1012 static bool invalid_mkclean_vma(struct vm_area_struct *vma, void *arg)
1014 if (vma->vm_flags & VM_SHARED)
1020 int page_mkclean(struct page *page)
1023 struct address_space *mapping;
1024 struct rmap_walk_control rwc = {
1025 .arg = (void *)&cleaned,
1026 .rmap_one = page_mkclean_one,
1027 .invalid_vma = invalid_mkclean_vma,
1030 BUG_ON(!PageLocked(page));
1032 if (!page_mapped(page))
1035 mapping = page_mapping(page);
1039 rmap_walk(page, &rwc);
1043 EXPORT_SYMBOL_GPL(page_mkclean);
1046 * page_move_anon_rmap - move a page to our anon_vma
1047 * @page: the page to move to our anon_vma
1048 * @vma: the vma the page belongs to
1049 * @address: the user virtual address mapped
1051 * When a page belongs exclusively to one process after a COW event,
1052 * that page can be moved into the anon_vma that belongs to just that
1053 * process, so the rmap code will not search the parent or sibling
1056 void page_move_anon_rmap(struct page *page,
1057 struct vm_area_struct *vma, unsigned long address)
1059 struct anon_vma *anon_vma = vma->anon_vma;
1061 VM_BUG_ON_PAGE(!PageLocked(page), page);
1062 VM_BUG_ON_VMA(!anon_vma, vma);
1063 VM_BUG_ON_PAGE(page->index != linear_page_index(vma, address), page);
1065 anon_vma = (void *) anon_vma + PAGE_MAPPING_ANON;
1067 * Ensure that anon_vma and the PAGE_MAPPING_ANON bit are written
1068 * simultaneously, so a concurrent reader (eg page_referenced()'s
1069 * PageAnon()) will not see one without the other.
1071 WRITE_ONCE(page->mapping, (struct address_space *) anon_vma);
1075 * __page_set_anon_rmap - set up new anonymous rmap
1076 * @page: Page to add to rmap
1077 * @vma: VM area to add page to.
1078 * @address: User virtual address of the mapping
1079 * @exclusive: the page is exclusively owned by the current process
1081 static void __page_set_anon_rmap(struct page *page,
1082 struct vm_area_struct *vma, unsigned long address, int exclusive)
1084 struct anon_vma *anon_vma = vma->anon_vma;
1092 * If the page isn't exclusively mapped into this vma,
1093 * we must use the _oldest_ possible anon_vma for the
1097 anon_vma = anon_vma->root;
1099 anon_vma = (void *) anon_vma + PAGE_MAPPING_ANON;
1100 page->mapping = (struct address_space *) anon_vma;
1101 page->index = linear_page_index(vma, address);
1105 * __page_check_anon_rmap - sanity check anonymous rmap addition
1106 * @page: the page to add the mapping to
1107 * @vma: the vm area in which the mapping is added
1108 * @address: the user virtual address mapped
1110 static void __page_check_anon_rmap(struct page *page,
1111 struct vm_area_struct *vma, unsigned long address)
1113 #ifdef CONFIG_DEBUG_VM
1115 * The page's anon-rmap details (mapping and index) are guaranteed to
1116 * be set up correctly at this point.
1118 * We have exclusion against page_add_anon_rmap because the caller
1119 * always holds the page locked, except if called from page_dup_rmap,
1120 * in which case the page is already known to be setup.
1122 * We have exclusion against page_add_new_anon_rmap because those pages
1123 * are initially only visible via the pagetables, and the pte is locked
1124 * over the call to page_add_new_anon_rmap.
1126 BUG_ON(page_anon_vma(page)->root != vma->anon_vma->root);
1127 BUG_ON(page->index != linear_page_index(vma, address));
1132 * page_add_anon_rmap - add pte mapping to an anonymous page
1133 * @page: the page to add the mapping to
1134 * @vma: the vm area in which the mapping is added
1135 * @address: the user virtual address mapped
1137 * The caller needs to hold the pte lock, and the page must be locked in
1138 * the anon_vma case: to serialize mapping,index checking after setting,
1139 * and to ensure that PageAnon is not being upgraded racily to PageKsm
1140 * (but PageKsm is never downgraded to PageAnon).
1142 void page_add_anon_rmap(struct page *page,
1143 struct vm_area_struct *vma, unsigned long address)
1145 do_page_add_anon_rmap(page, vma, address, 0);
1149 * Special version of the above for do_swap_page, which often runs
1150 * into pages that are exclusively owned by the current process.
1151 * Everybody else should continue to use page_add_anon_rmap above.
1153 void do_page_add_anon_rmap(struct page *page,
1154 struct vm_area_struct *vma, unsigned long address, int exclusive)
1156 int first = atomic_inc_and_test(&page->_mapcount);
1159 * We use the irq-unsafe __{inc|mod}_zone_page_stat because
1160 * these counters are not modified in interrupt context, and
1161 * pte lock(a spinlock) is held, which implies preemption
1164 if (PageTransHuge(page))
1165 __inc_zone_page_state(page,
1166 NR_ANON_TRANSPARENT_HUGEPAGES);
1167 __mod_zone_page_state(page_zone(page), NR_ANON_PAGES,
1168 hpage_nr_pages(page));
1170 if (unlikely(PageKsm(page)))
1173 VM_BUG_ON_PAGE(!PageLocked(page), page);
1174 /* address might be in next vma when migration races vma_adjust */
1176 __page_set_anon_rmap(page, vma, address, exclusive);
1178 __page_check_anon_rmap(page, vma, address);
1182 * page_add_new_anon_rmap - add pte mapping to a new anonymous page
1183 * @page: the page to add the mapping to
1184 * @vma: the vm area in which the mapping is added
1185 * @address: the user virtual address mapped
1187 * Same as page_add_anon_rmap but must only be called on *new* pages.
1188 * This means the inc-and-test can be bypassed.
1189 * Page does not have to be locked.
1191 void page_add_new_anon_rmap(struct page *page,
1192 struct vm_area_struct *vma, unsigned long address)
1194 VM_BUG_ON_VMA(address < vma->vm_start || address >= vma->vm_end, vma);
1195 SetPageSwapBacked(page);
1196 atomic_set(&page->_mapcount, 0); /* increment count (starts at -1) */
1197 if (PageTransHuge(page))
1198 __inc_zone_page_state(page, NR_ANON_TRANSPARENT_HUGEPAGES);
1199 __mod_zone_page_state(page_zone(page), NR_ANON_PAGES,
1200 hpage_nr_pages(page));
1201 __page_set_anon_rmap(page, vma, address, 1);
1205 * page_add_file_rmap - add pte mapping to a file page
1206 * @page: the page to add the mapping to
1208 * The caller needs to hold the pte lock.
1210 void page_add_file_rmap(struct page *page)
1212 struct mem_cgroup *memcg;
1214 memcg = mem_cgroup_begin_page_stat(page);
1215 if (atomic_inc_and_test(&page->_mapcount)) {
1216 __inc_zone_page_state(page, NR_FILE_MAPPED);
1217 mem_cgroup_inc_page_stat(memcg, MEM_CGROUP_STAT_FILE_MAPPED);
1219 mem_cgroup_end_page_stat(memcg);
1222 static void page_remove_file_rmap(struct page *page)
1224 struct mem_cgroup *memcg;
1226 memcg = mem_cgroup_begin_page_stat(page);
1228 /* page still mapped by someone else? */
1229 if (!atomic_add_negative(-1, &page->_mapcount))
1232 /* Hugepages are not counted in NR_FILE_MAPPED for now. */
1233 if (unlikely(PageHuge(page)))
1237 * We use the irq-unsafe __{inc|mod}_zone_page_stat because
1238 * these counters are not modified in interrupt context, and
1239 * pte lock(a spinlock) is held, which implies preemption disabled.
1241 __dec_zone_page_state(page, NR_FILE_MAPPED);
1242 mem_cgroup_dec_page_stat(memcg, MEM_CGROUP_STAT_FILE_MAPPED);
1244 if (unlikely(PageMlocked(page)))
1245 clear_page_mlock(page);
1247 mem_cgroup_end_page_stat(memcg);
1251 * page_remove_rmap - take down pte mapping from a page
1252 * @page: page to remove mapping from
1254 * The caller needs to hold the pte lock.
1256 void page_remove_rmap(struct page *page)
1258 if (!PageAnon(page)) {
1259 page_remove_file_rmap(page);
1263 /* page still mapped by someone else? */
1264 if (!atomic_add_negative(-1, &page->_mapcount))
1267 /* Hugepages are not counted in NR_ANON_PAGES for now. */
1268 if (unlikely(PageHuge(page)))
1272 * We use the irq-unsafe __{inc|mod}_zone_page_stat because
1273 * these counters are not modified in interrupt context, and
1274 * pte lock(a spinlock) is held, which implies preemption disabled.
1276 if (PageTransHuge(page))
1277 __dec_zone_page_state(page, NR_ANON_TRANSPARENT_HUGEPAGES);
1279 __mod_zone_page_state(page_zone(page), NR_ANON_PAGES,
1280 -hpage_nr_pages(page));
1282 if (unlikely(PageMlocked(page)))
1283 clear_page_mlock(page);
1286 * It would be tidy to reset the PageAnon mapping here,
1287 * but that might overwrite a racing page_add_anon_rmap
1288 * which increments mapcount after us but sets mapping
1289 * before us: so leave the reset to free_hot_cold_page,
1290 * and remember that it's only reliable while mapped.
1291 * Leaving it set also helps swapoff to reinstate ptes
1292 * faster for those pages still in swapcache.
1297 * @arg: enum ttu_flags will be passed to this argument
1299 static int try_to_unmap_one(struct page *page, struct vm_area_struct *vma,
1300 unsigned long address, void *arg)
1302 struct mm_struct *mm = vma->vm_mm;
1306 int ret = SWAP_AGAIN;
1307 enum ttu_flags flags = (enum ttu_flags)arg;
1309 /* munlock has nothing to gain from examining un-locked vmas */
1310 if ((flags & TTU_MUNLOCK) && !(vma->vm_flags & VM_LOCKED))
1313 pte = page_check_address(page, mm, address, &ptl, 0);
1318 * If the page is mlock()d, we cannot swap it out.
1319 * If it's recently referenced (perhaps page_referenced
1320 * skipped over this mm) then we should reactivate it.
1322 if (!(flags & TTU_IGNORE_MLOCK)) {
1323 if (vma->vm_flags & VM_LOCKED) {
1324 /* Holding pte lock, we do *not* need mmap_sem here */
1325 mlock_vma_page(page);
1329 if (flags & TTU_MUNLOCK)
1332 if (!(flags & TTU_IGNORE_ACCESS)) {
1333 if (ptep_clear_flush_young_notify(vma, address, pte)) {
1339 /* Nuke the page table entry. */
1340 flush_cache_page(vma, address, page_to_pfn(page));
1341 if (should_defer_flush(mm, flags)) {
1343 * We clear the PTE but do not flush so potentially a remote
1344 * CPU could still be writing to the page. If the entry was
1345 * previously clean then the architecture must guarantee that
1346 * a clear->dirty transition on a cached TLB entry is written
1347 * through and traps if the PTE is unmapped.
1349 pteval = ptep_get_and_clear(mm, address, pte);
1351 set_tlb_ubc_flush_pending(mm, page, pte_dirty(pteval));
1353 pteval = ptep_clear_flush(vma, address, pte);
1356 /* Move the dirty bit to the physical page now the pte is gone. */
1357 if (pte_dirty(pteval))
1358 set_page_dirty(page);
1360 /* Update high watermark before we lower rss */
1361 update_hiwater_rss(mm);
1363 if (PageHWPoison(page) && !(flags & TTU_IGNORE_HWPOISON)) {
1364 if (PageHuge(page)) {
1365 hugetlb_count_sub(1 << compound_order(page), mm);
1367 dec_mm_counter(mm, mm_counter(page));
1369 set_pte_at(mm, address, pte,
1370 swp_entry_to_pte(make_hwpoison_entry(page)));
1371 } else if (pte_unused(pteval)) {
1373 * The guest indicated that the page content is of no
1374 * interest anymore. Simply discard the pte, vmscan
1375 * will take care of the rest.
1377 dec_mm_counter(mm, mm_counter(page));
1378 } else if (IS_ENABLED(CONFIG_MIGRATION) && (flags & TTU_MIGRATION)) {
1382 * Store the pfn of the page in a special migration
1383 * pte. do_swap_page() will wait until the migration
1384 * pte is removed and then restart fault handling.
1386 entry = make_migration_entry(page, pte_write(pteval));
1387 swp_pte = swp_entry_to_pte(entry);
1388 if (pte_soft_dirty(pteval))
1389 swp_pte = pte_swp_mksoft_dirty(swp_pte);
1390 set_pte_at(mm, address, pte, swp_pte);
1391 } else if (PageAnon(page)) {
1392 swp_entry_t entry = { .val = page_private(page) };
1395 * Store the swap location in the pte.
1396 * See handle_pte_fault() ...
1398 VM_BUG_ON_PAGE(!PageSwapCache(page), page);
1399 if (swap_duplicate(entry) < 0) {
1400 set_pte_at(mm, address, pte, pteval);
1404 if (list_empty(&mm->mmlist)) {
1405 spin_lock(&mmlist_lock);
1406 if (list_empty(&mm->mmlist))
1407 list_add(&mm->mmlist, &init_mm.mmlist);
1408 spin_unlock(&mmlist_lock);
1410 dec_mm_counter(mm, MM_ANONPAGES);
1411 inc_mm_counter(mm, MM_SWAPENTS);
1412 swp_pte = swp_entry_to_pte(entry);
1413 if (pte_soft_dirty(pteval))
1414 swp_pte = pte_swp_mksoft_dirty(swp_pte);
1415 set_pte_at(mm, address, pte, swp_pte);
1417 dec_mm_counter(mm, mm_counter_file(page));
1419 page_remove_rmap(page);
1420 page_cache_release(page);
1423 pte_unmap_unlock(pte, ptl);
1424 if (ret != SWAP_FAIL && ret != SWAP_MLOCK && !(flags & TTU_MUNLOCK))
1425 mmu_notifier_invalidate_page(mm, address);
1430 bool is_vma_temporary_stack(struct vm_area_struct *vma)
1432 int maybe_stack = vma->vm_flags & (VM_GROWSDOWN | VM_GROWSUP);
1437 if ((vma->vm_flags & VM_STACK_INCOMPLETE_SETUP) ==
1438 VM_STACK_INCOMPLETE_SETUP)
1444 static bool invalid_migration_vma(struct vm_area_struct *vma, void *arg)
1446 return is_vma_temporary_stack(vma);
1449 static int page_not_mapped(struct page *page)
1451 return !page_mapped(page);
1455 * try_to_unmap - try to remove all page table mappings to a page
1456 * @page: the page to get unmapped
1457 * @flags: action and flags
1459 * Tries to remove all the page table entries which are mapping this
1460 * page, used in the pageout path. Caller must hold the page lock.
1461 * Return values are:
1463 * SWAP_SUCCESS - we succeeded in removing all mappings
1464 * SWAP_AGAIN - we missed a mapping, try again later
1465 * SWAP_FAIL - the page is unswappable
1466 * SWAP_MLOCK - page is mlocked.
1468 int try_to_unmap(struct page *page, enum ttu_flags flags)
1471 struct rmap_walk_control rwc = {
1472 .rmap_one = try_to_unmap_one,
1473 .arg = (void *)flags,
1474 .done = page_not_mapped,
1475 .anon_lock = page_lock_anon_vma_read,
1478 VM_BUG_ON_PAGE(!PageHuge(page) && PageTransHuge(page), page);
1481 * During exec, a temporary VMA is setup and later moved.
1482 * The VMA is moved under the anon_vma lock but not the
1483 * page tables leading to a race where migration cannot
1484 * find the migration ptes. Rather than increasing the
1485 * locking requirements of exec(), migration skips
1486 * temporary VMAs until after exec() completes.
1488 if ((flags & TTU_MIGRATION) && !PageKsm(page) && PageAnon(page))
1489 rwc.invalid_vma = invalid_migration_vma;
1491 ret = rmap_walk(page, &rwc);
1493 if (ret != SWAP_MLOCK && !page_mapped(page))
1499 * try_to_munlock - try to munlock a page
1500 * @page: the page to be munlocked
1502 * Called from munlock code. Checks all of the VMAs mapping the page
1503 * to make sure nobody else has this page mlocked. The page will be
1504 * returned with PG_mlocked cleared if no other vmas have it mlocked.
1506 * Return values are:
1508 * SWAP_AGAIN - no vma is holding page mlocked, or,
1509 * SWAP_AGAIN - page mapped in mlocked vma -- couldn't acquire mmap sem
1510 * SWAP_FAIL - page cannot be located at present
1511 * SWAP_MLOCK - page is now mlocked.
1513 int try_to_munlock(struct page *page)
1516 struct rmap_walk_control rwc = {
1517 .rmap_one = try_to_unmap_one,
1518 .arg = (void *)TTU_MUNLOCK,
1519 .done = page_not_mapped,
1520 .anon_lock = page_lock_anon_vma_read,
1524 VM_BUG_ON_PAGE(!PageLocked(page) || PageLRU(page), page);
1526 ret = rmap_walk(page, &rwc);
1530 void __put_anon_vma(struct anon_vma *anon_vma)
1532 struct anon_vma *root = anon_vma->root;
1534 anon_vma_free(anon_vma);
1535 if (root != anon_vma && atomic_dec_and_test(&root->refcount))
1536 anon_vma_free(root);
1539 static struct anon_vma *rmap_walk_anon_lock(struct page *page,
1540 struct rmap_walk_control *rwc)
1542 struct anon_vma *anon_vma;
1545 return rwc->anon_lock(page);
1548 * Note: remove_migration_ptes() cannot use page_lock_anon_vma_read()
1549 * because that depends on page_mapped(); but not all its usages
1550 * are holding mmap_sem. Users without mmap_sem are required to
1551 * take a reference count to prevent the anon_vma disappearing
1553 anon_vma = page_anon_vma(page);
1557 anon_vma_lock_read(anon_vma);
1562 * rmap_walk_anon - do something to anonymous page using the object-based
1564 * @page: the page to be handled
1565 * @rwc: control variable according to each walk type
1567 * Find all the mappings of a page using the mapping pointer and the vma chains
1568 * contained in the anon_vma struct it points to.
1570 * When called from try_to_munlock(), the mmap_sem of the mm containing the vma
1571 * where the page was found will be held for write. So, we won't recheck
1572 * vm_flags for that VMA. That should be OK, because that vma shouldn't be
1575 static int rmap_walk_anon(struct page *page, struct rmap_walk_control *rwc)
1577 struct anon_vma *anon_vma;
1579 struct anon_vma_chain *avc;
1580 int ret = SWAP_AGAIN;
1582 anon_vma = rmap_walk_anon_lock(page, rwc);
1586 pgoff = page_to_pgoff(page);
1587 anon_vma_interval_tree_foreach(avc, &anon_vma->rb_root, pgoff, pgoff) {
1588 struct vm_area_struct *vma = avc->vma;
1589 unsigned long address = vma_address(page, vma);
1593 if (rwc->invalid_vma && rwc->invalid_vma(vma, rwc->arg))
1596 ret = rwc->rmap_one(page, vma, address, rwc->arg);
1597 if (ret != SWAP_AGAIN)
1599 if (rwc->done && rwc->done(page))
1602 anon_vma_unlock_read(anon_vma);
1607 * rmap_walk_file - do something to file page using the object-based rmap method
1608 * @page: the page to be handled
1609 * @rwc: control variable according to each walk type
1611 * Find all the mappings of a page using the mapping pointer and the vma chains
1612 * contained in the address_space struct it points to.
1614 * When called from try_to_munlock(), the mmap_sem of the mm containing the vma
1615 * where the page was found will be held for write. So, we won't recheck
1616 * vm_flags for that VMA. That should be OK, because that vma shouldn't be
1619 static int rmap_walk_file(struct page *page, struct rmap_walk_control *rwc)
1621 struct address_space *mapping = page->mapping;
1623 struct vm_area_struct *vma;
1624 int ret = SWAP_AGAIN;
1627 * The page lock not only makes sure that page->mapping cannot
1628 * suddenly be NULLified by truncation, it makes sure that the
1629 * structure at mapping cannot be freed and reused yet,
1630 * so we can safely take mapping->i_mmap_rwsem.
1632 VM_BUG_ON_PAGE(!PageLocked(page), page);
1637 pgoff = page_to_pgoff(page);
1638 i_mmap_lock_read(mapping);
1639 vma_interval_tree_foreach(vma, &mapping->i_mmap, pgoff, pgoff) {
1640 unsigned long address = vma_address(page, vma);
1644 if (rwc->invalid_vma && rwc->invalid_vma(vma, rwc->arg))
1647 ret = rwc->rmap_one(page, vma, address, rwc->arg);
1648 if (ret != SWAP_AGAIN)
1650 if (rwc->done && rwc->done(page))
1655 i_mmap_unlock_read(mapping);
1659 int rmap_walk(struct page *page, struct rmap_walk_control *rwc)
1661 if (unlikely(PageKsm(page)))
1662 return rmap_walk_ksm(page, rwc);
1663 else if (PageAnon(page))
1664 return rmap_walk_anon(page, rwc);
1666 return rmap_walk_file(page, rwc);
1669 #ifdef CONFIG_HUGETLB_PAGE
1671 * The following three functions are for anonymous (private mapped) hugepages.
1672 * Unlike common anonymous pages, anonymous hugepages have no accounting code
1673 * and no lru code, because we handle hugepages differently from common pages.
1675 static void __hugepage_set_anon_rmap(struct page *page,
1676 struct vm_area_struct *vma, unsigned long address, int exclusive)
1678 struct anon_vma *anon_vma = vma->anon_vma;
1685 anon_vma = anon_vma->root;
1687 anon_vma = (void *) anon_vma + PAGE_MAPPING_ANON;
1688 page->mapping = (struct address_space *) anon_vma;
1689 page->index = linear_page_index(vma, address);
1692 void hugepage_add_anon_rmap(struct page *page,
1693 struct vm_area_struct *vma, unsigned long address)
1695 struct anon_vma *anon_vma = vma->anon_vma;
1698 BUG_ON(!PageLocked(page));
1700 /* address might be in next vma when migration races vma_adjust */
1701 first = atomic_inc_and_test(&page->_mapcount);
1703 __hugepage_set_anon_rmap(page, vma, address, 0);
1706 void hugepage_add_new_anon_rmap(struct page *page,
1707 struct vm_area_struct *vma, unsigned long address)
1709 BUG_ON(address < vma->vm_start || address >= vma->vm_end);
1710 atomic_set(&page->_mapcount, 0);
1711 __hugepage_set_anon_rmap(page, vma, address, 1);
1713 #endif /* CONFIG_HUGETLB_PAGE */