1 // SPDX-License-Identifier: GPL-2.0-only
5 * Copyright (C) 1991, 1992, 1993, 1994 Linus Torvalds
9 * demand-loading started 01.12.91 - seems it is high on the list of
10 * things wanted, and it should be easy to implement. - Linus
14 * Ok, demand-loading was easy, shared pages a little bit tricker. Shared
15 * pages started 02.12.91, seems to work. - Linus.
17 * Tested sharing by executing about 30 /bin/sh: under the old kernel it
18 * would have taken more than the 6M I have free, but it worked well as
21 * Also corrected some "invalidate()"s - I wasn't doing enough of them.
25 * Real VM (paging to/from disk) started 18.12.91. Much more work and
26 * thought has to go into this. Oh, well..
27 * 19.12.91 - works, somewhat. Sometimes I get faults, don't know why.
28 * Found it. Everything seems to work now.
29 * 20.12.91 - Ok, making the swap-device changeable like the root.
33 * 05.04.94 - Multi-page memory management added for v1.1.
34 * Idea by Alex Bligh (alex@cconcepts.co.uk)
36 * 16.07.99 - Support of BIGMEM added by Gerhard Wichert, Siemens AG
37 * (Gerhard.Wichert@pdb.siemens.de)
39 * Aug/Sep 2004 Changed to four level page tables (Andi Kleen)
42 #include <linux/kernel_stat.h>
44 #include <linux/sched/mm.h>
45 #include <linux/sched/coredump.h>
46 #include <linux/sched/numa_balancing.h>
47 #include <linux/sched/task.h>
48 #include <linux/hugetlb.h>
49 #include <linux/mman.h>
50 #include <linux/swap.h>
51 #include <linux/highmem.h>
52 #include <linux/pagemap.h>
53 #include <linux/memremap.h>
54 #include <linux/ksm.h>
55 #include <linux/rmap.h>
56 #include <linux/export.h>
57 #include <linux/delayacct.h>
58 #include <linux/init.h>
59 #include <linux/pfn_t.h>
60 #include <linux/writeback.h>
61 #include <linux/memcontrol.h>
62 #include <linux/mmu_notifier.h>
63 #include <linux/swapops.h>
64 #include <linux/elf.h>
65 #include <linux/gfp.h>
66 #include <linux/migrate.h>
67 #include <linux/string.h>
68 #include <linux/debugfs.h>
69 #include <linux/userfaultfd_k.h>
70 #include <linux/dax.h>
71 #include <linux/oom.h>
72 #include <linux/numa.h>
73 #include <linux/perf_event.h>
74 #include <linux/ptrace.h>
75 #include <linux/vmalloc.h>
77 #include <trace/events/kmem.h>
80 #include <asm/mmu_context.h>
81 #include <asm/pgalloc.h>
82 #include <linux/uaccess.h>
84 #include <asm/tlbflush.h>
86 #include "pgalloc-track.h"
89 #if defined(LAST_CPUPID_NOT_IN_PAGE_FLAGS) && !defined(CONFIG_COMPILE_TEST)
90 #warning Unfortunate NUMA and NUMA Balancing config, growing page-frame for last_cpupid.
94 unsigned long max_mapnr
;
95 EXPORT_SYMBOL(max_mapnr
);
98 EXPORT_SYMBOL(mem_map
);
102 * A number of key systems in x86 including ioremap() rely on the assumption
103 * that high_memory defines the upper bound on direct map memory, then end
104 * of ZONE_NORMAL. Under CONFIG_DISCONTIG this means that max_low_pfn and
105 * highstart_pfn must be the same; there must be no gap between ZONE_NORMAL
109 EXPORT_SYMBOL(high_memory
);
112 * Randomize the address space (stacks, mmaps, brk, etc.).
114 * ( When CONFIG_COMPAT_BRK=y we exclude brk from randomization,
115 * as ancient (libc5 based) binaries can segfault. )
117 int randomize_va_space __read_mostly
=
118 #ifdef CONFIG_COMPAT_BRK
124 #ifndef arch_faults_on_old_pte
125 static inline bool arch_faults_on_old_pte(void)
128 * Those arches which don't have hw access flag feature need to
129 * implement their own helper. By default, "true" means pagefault
130 * will be hit on old pte.
136 #ifndef arch_wants_old_prefaulted_pte
137 static inline bool arch_wants_old_prefaulted_pte(void)
140 * Transitioning a PTE from 'old' to 'young' can be expensive on
141 * some architectures, even if it's performed in hardware. By
142 * default, "false" means prefaulted entries will be 'young'.
148 static int __init
disable_randmaps(char *s
)
150 randomize_va_space
= 0;
153 __setup("norandmaps", disable_randmaps
);
155 unsigned long zero_pfn __read_mostly
;
156 EXPORT_SYMBOL(zero_pfn
);
158 unsigned long highest_memmap_pfn __read_mostly
;
161 * CONFIG_MMU architectures set up ZERO_PAGE in their paging_init()
163 static int __init
init_zero_pfn(void)
165 zero_pfn
= page_to_pfn(ZERO_PAGE(0));
168 early_initcall(init_zero_pfn
);
170 void mm_trace_rss_stat(struct mm_struct
*mm
, int member
, long count
)
172 trace_rss_stat(mm
, member
, count
);
175 #if defined(SPLIT_RSS_COUNTING)
177 void sync_mm_rss(struct mm_struct
*mm
)
181 for (i
= 0; i
< NR_MM_COUNTERS
; i
++) {
182 if (current
->rss_stat
.count
[i
]) {
183 add_mm_counter(mm
, i
, current
->rss_stat
.count
[i
]);
184 current
->rss_stat
.count
[i
] = 0;
187 current
->rss_stat
.events
= 0;
190 static void add_mm_counter_fast(struct mm_struct
*mm
, int member
, int val
)
192 struct task_struct
*task
= current
;
194 if (likely(task
->mm
== mm
))
195 task
->rss_stat
.count
[member
] += val
;
197 add_mm_counter(mm
, member
, val
);
199 #define inc_mm_counter_fast(mm, member) add_mm_counter_fast(mm, member, 1)
200 #define dec_mm_counter_fast(mm, member) add_mm_counter_fast(mm, member, -1)
202 /* sync counter once per 64 page faults */
203 #define TASK_RSS_EVENTS_THRESH (64)
204 static void check_sync_rss_stat(struct task_struct
*task
)
206 if (unlikely(task
!= current
))
208 if (unlikely(task
->rss_stat
.events
++ > TASK_RSS_EVENTS_THRESH
))
209 sync_mm_rss(task
->mm
);
211 #else /* SPLIT_RSS_COUNTING */
213 #define inc_mm_counter_fast(mm, member) inc_mm_counter(mm, member)
214 #define dec_mm_counter_fast(mm, member) dec_mm_counter(mm, member)
216 static void check_sync_rss_stat(struct task_struct
*task
)
220 #endif /* SPLIT_RSS_COUNTING */
223 * Note: this doesn't free the actual pages themselves. That
224 * has been handled earlier when unmapping all the memory regions.
226 static void free_pte_range(struct mmu_gather
*tlb
, pmd_t
*pmd
,
229 pgtable_t token
= pmd_pgtable(*pmd
);
231 pte_free_tlb(tlb
, token
, addr
);
232 mm_dec_nr_ptes(tlb
->mm
);
235 static inline void free_pmd_range(struct mmu_gather
*tlb
, pud_t
*pud
,
236 unsigned long addr
, unsigned long end
,
237 unsigned long floor
, unsigned long ceiling
)
244 pmd
= pmd_offset(pud
, addr
);
246 next
= pmd_addr_end(addr
, end
);
247 if (pmd_none_or_clear_bad(pmd
))
249 free_pte_range(tlb
, pmd
, addr
);
250 } while (pmd
++, addr
= next
, addr
!= end
);
260 if (end
- 1 > ceiling
- 1)
263 pmd
= pmd_offset(pud
, start
);
265 pmd_free_tlb(tlb
, pmd
, start
);
266 mm_dec_nr_pmds(tlb
->mm
);
269 static inline void free_pud_range(struct mmu_gather
*tlb
, p4d_t
*p4d
,
270 unsigned long addr
, unsigned long end
,
271 unsigned long floor
, unsigned long ceiling
)
278 pud
= pud_offset(p4d
, addr
);
280 next
= pud_addr_end(addr
, end
);
281 if (pud_none_or_clear_bad(pud
))
283 free_pmd_range(tlb
, pud
, addr
, next
, floor
, ceiling
);
284 } while (pud
++, addr
= next
, addr
!= end
);
294 if (end
- 1 > ceiling
- 1)
297 pud
= pud_offset(p4d
, start
);
299 pud_free_tlb(tlb
, pud
, start
);
300 mm_dec_nr_puds(tlb
->mm
);
303 static inline void free_p4d_range(struct mmu_gather
*tlb
, pgd_t
*pgd
,
304 unsigned long addr
, unsigned long end
,
305 unsigned long floor
, unsigned long ceiling
)
312 p4d
= p4d_offset(pgd
, addr
);
314 next
= p4d_addr_end(addr
, end
);
315 if (p4d_none_or_clear_bad(p4d
))
317 free_pud_range(tlb
, p4d
, addr
, next
, floor
, ceiling
);
318 } while (p4d
++, addr
= next
, addr
!= end
);
324 ceiling
&= PGDIR_MASK
;
328 if (end
- 1 > ceiling
- 1)
331 p4d
= p4d_offset(pgd
, start
);
333 p4d_free_tlb(tlb
, p4d
, start
);
337 * This function frees user-level page tables of a process.
339 void free_pgd_range(struct mmu_gather
*tlb
,
340 unsigned long addr
, unsigned long end
,
341 unsigned long floor
, unsigned long ceiling
)
347 * The next few lines have given us lots of grief...
349 * Why are we testing PMD* at this top level? Because often
350 * there will be no work to do at all, and we'd prefer not to
351 * go all the way down to the bottom just to discover that.
353 * Why all these "- 1"s? Because 0 represents both the bottom
354 * of the address space and the top of it (using -1 for the
355 * top wouldn't help much: the masks would do the wrong thing).
356 * The rule is that addr 0 and floor 0 refer to the bottom of
357 * the address space, but end 0 and ceiling 0 refer to the top
358 * Comparisons need to use "end - 1" and "ceiling - 1" (though
359 * that end 0 case should be mythical).
361 * Wherever addr is brought up or ceiling brought down, we must
362 * be careful to reject "the opposite 0" before it confuses the
363 * subsequent tests. But what about where end is brought down
364 * by PMD_SIZE below? no, end can't go down to 0 there.
366 * Whereas we round start (addr) and ceiling down, by different
367 * masks at different levels, in order to test whether a table
368 * now has no other vmas using it, so can be freed, we don't
369 * bother to round floor or end up - the tests don't need that.
383 if (end
- 1 > ceiling
- 1)
388 * We add page table cache pages with PAGE_SIZE,
389 * (see pte_free_tlb()), flush the tlb if we need
391 tlb_change_page_size(tlb
, PAGE_SIZE
);
392 pgd
= pgd_offset(tlb
->mm
, addr
);
394 next
= pgd_addr_end(addr
, end
);
395 if (pgd_none_or_clear_bad(pgd
))
397 free_p4d_range(tlb
, pgd
, addr
, next
, floor
, ceiling
);
398 } while (pgd
++, addr
= next
, addr
!= end
);
401 void free_pgtables(struct mmu_gather
*tlb
, struct vm_area_struct
*vma
,
402 unsigned long floor
, unsigned long ceiling
)
405 struct vm_area_struct
*next
= vma
->vm_next
;
406 unsigned long addr
= vma
->vm_start
;
409 * Hide vma from rmap and truncate_pagecache before freeing
412 unlink_anon_vmas(vma
);
413 unlink_file_vma(vma
);
415 if (is_vm_hugetlb_page(vma
)) {
416 hugetlb_free_pgd_range(tlb
, addr
, vma
->vm_end
,
417 floor
, next
? next
->vm_start
: ceiling
);
420 * Optimization: gather nearby vmas into one call down
422 while (next
&& next
->vm_start
<= vma
->vm_end
+ PMD_SIZE
423 && !is_vm_hugetlb_page(next
)) {
426 unlink_anon_vmas(vma
);
427 unlink_file_vma(vma
);
429 free_pgd_range(tlb
, addr
, vma
->vm_end
,
430 floor
, next
? next
->vm_start
: ceiling
);
436 int __pte_alloc(struct mm_struct
*mm
, pmd_t
*pmd
)
439 pgtable_t
new = pte_alloc_one(mm
);
444 * Ensure all pte setup (eg. pte page lock and page clearing) are
445 * visible before the pte is made visible to other CPUs by being
446 * put into page tables.
448 * The other side of the story is the pointer chasing in the page
449 * table walking code (when walking the page table without locking;
450 * ie. most of the time). Fortunately, these data accesses consist
451 * of a chain of data-dependent loads, meaning most CPUs (alpha
452 * being the notable exception) will already guarantee loads are
453 * seen in-order. See the alpha page table accessors for the
454 * smp_rmb() barriers in page table walking code.
456 smp_wmb(); /* Could be smp_wmb__xxx(before|after)_spin_lock */
458 ptl
= pmd_lock(mm
, pmd
);
459 if (likely(pmd_none(*pmd
))) { /* Has another populated it ? */
461 pmd_populate(mm
, pmd
, new);
470 int __pte_alloc_kernel(pmd_t
*pmd
)
472 pte_t
*new = pte_alloc_one_kernel(&init_mm
);
476 smp_wmb(); /* See comment in __pte_alloc */
478 spin_lock(&init_mm
.page_table_lock
);
479 if (likely(pmd_none(*pmd
))) { /* Has another populated it ? */
480 pmd_populate_kernel(&init_mm
, pmd
, new);
483 spin_unlock(&init_mm
.page_table_lock
);
485 pte_free_kernel(&init_mm
, new);
489 static inline void init_rss_vec(int *rss
)
491 memset(rss
, 0, sizeof(int) * NR_MM_COUNTERS
);
494 static inline void add_mm_rss_vec(struct mm_struct
*mm
, int *rss
)
498 if (current
->mm
== mm
)
500 for (i
= 0; i
< NR_MM_COUNTERS
; i
++)
502 add_mm_counter(mm
, i
, rss
[i
]);
506 * This function is called to print an error when a bad pte
507 * is found. For example, we might have a PFN-mapped pte in
508 * a region that doesn't allow it.
510 * The calling function must still handle the error.
512 static void print_bad_pte(struct vm_area_struct
*vma
, unsigned long addr
,
513 pte_t pte
, struct page
*page
)
515 pgd_t
*pgd
= pgd_offset(vma
->vm_mm
, addr
);
516 p4d_t
*p4d
= p4d_offset(pgd
, addr
);
517 pud_t
*pud
= pud_offset(p4d
, addr
);
518 pmd_t
*pmd
= pmd_offset(pud
, addr
);
519 struct address_space
*mapping
;
521 static unsigned long resume
;
522 static unsigned long nr_shown
;
523 static unsigned long nr_unshown
;
526 * Allow a burst of 60 reports, then keep quiet for that minute;
527 * or allow a steady drip of one report per second.
529 if (nr_shown
== 60) {
530 if (time_before(jiffies
, resume
)) {
535 pr_alert("BUG: Bad page map: %lu messages suppressed\n",
542 resume
= jiffies
+ 60 * HZ
;
544 mapping
= vma
->vm_file
? vma
->vm_file
->f_mapping
: NULL
;
545 index
= linear_page_index(vma
, addr
);
547 pr_alert("BUG: Bad page map in process %s pte:%08llx pmd:%08llx\n",
549 (long long)pte_val(pte
), (long long)pmd_val(*pmd
));
551 dump_page(page
, "bad pte");
552 pr_alert("addr:%px vm_flags:%08lx anon_vma:%px mapping:%px index:%lx\n",
553 (void *)addr
, vma
->vm_flags
, vma
->anon_vma
, mapping
, index
);
554 pr_alert("file:%pD fault:%ps mmap:%ps readpage:%ps\n",
556 vma
->vm_ops
? vma
->vm_ops
->fault
: NULL
,
557 vma
->vm_file
? vma
->vm_file
->f_op
->mmap
: NULL
,
558 mapping
? mapping
->a_ops
->readpage
: NULL
);
560 add_taint(TAINT_BAD_PAGE
, LOCKDEP_NOW_UNRELIABLE
);
564 * vm_normal_page -- This function gets the "struct page" associated with a pte.
566 * "Special" mappings do not wish to be associated with a "struct page" (either
567 * it doesn't exist, or it exists but they don't want to touch it). In this
568 * case, NULL is returned here. "Normal" mappings do have a struct page.
570 * There are 2 broad cases. Firstly, an architecture may define a pte_special()
571 * pte bit, in which case this function is trivial. Secondly, an architecture
572 * may not have a spare pte bit, which requires a more complicated scheme,
575 * A raw VM_PFNMAP mapping (ie. one that is not COWed) is always considered a
576 * special mapping (even if there are underlying and valid "struct pages").
577 * COWed pages of a VM_PFNMAP are always normal.
579 * The way we recognize COWed pages within VM_PFNMAP mappings is through the
580 * rules set up by "remap_pfn_range()": the vma will have the VM_PFNMAP bit
581 * set, and the vm_pgoff will point to the first PFN mapped: thus every special
582 * mapping will always honor the rule
584 * pfn_of_page == vma->vm_pgoff + ((addr - vma->vm_start) >> PAGE_SHIFT)
586 * And for normal mappings this is false.
588 * This restricts such mappings to be a linear translation from virtual address
589 * to pfn. To get around this restriction, we allow arbitrary mappings so long
590 * as the vma is not a COW mapping; in that case, we know that all ptes are
591 * special (because none can have been COWed).
594 * In order to support COW of arbitrary special mappings, we have VM_MIXEDMAP.
596 * VM_MIXEDMAP mappings can likewise contain memory with or without "struct
597 * page" backing, however the difference is that _all_ pages with a struct
598 * page (that is, those where pfn_valid is true) are refcounted and considered
599 * normal pages by the VM. The disadvantage is that pages are refcounted
600 * (which can be slower and simply not an option for some PFNMAP users). The
601 * advantage is that we don't have to follow the strict linearity rule of
602 * PFNMAP mappings in order to support COWable mappings.
605 struct page
*vm_normal_page(struct vm_area_struct
*vma
, unsigned long addr
,
608 unsigned long pfn
= pte_pfn(pte
);
610 if (IS_ENABLED(CONFIG_ARCH_HAS_PTE_SPECIAL
)) {
611 if (likely(!pte_special(pte
)))
613 if (vma
->vm_ops
&& vma
->vm_ops
->find_special_page
)
614 return vma
->vm_ops
->find_special_page(vma
, addr
);
615 if (vma
->vm_flags
& (VM_PFNMAP
| VM_MIXEDMAP
))
617 if (is_zero_pfn(pfn
))
622 print_bad_pte(vma
, addr
, pte
, NULL
);
626 /* !CONFIG_ARCH_HAS_PTE_SPECIAL case follows: */
628 if (unlikely(vma
->vm_flags
& (VM_PFNMAP
|VM_MIXEDMAP
))) {
629 if (vma
->vm_flags
& VM_MIXEDMAP
) {
635 off
= (addr
- vma
->vm_start
) >> PAGE_SHIFT
;
636 if (pfn
== vma
->vm_pgoff
+ off
)
638 if (!is_cow_mapping(vma
->vm_flags
))
643 if (is_zero_pfn(pfn
))
647 if (unlikely(pfn
> highest_memmap_pfn
)) {
648 print_bad_pte(vma
, addr
, pte
, NULL
);
653 * NOTE! We still have PageReserved() pages in the page tables.
654 * eg. VDSO mappings can cause them to exist.
657 return pfn_to_page(pfn
);
660 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
661 struct page
*vm_normal_page_pmd(struct vm_area_struct
*vma
, unsigned long addr
,
664 unsigned long pfn
= pmd_pfn(pmd
);
667 * There is no pmd_special() but there may be special pmds, e.g.
668 * in a direct-access (dax) mapping, so let's just replicate the
669 * !CONFIG_ARCH_HAS_PTE_SPECIAL case from vm_normal_page() here.
671 if (unlikely(vma
->vm_flags
& (VM_PFNMAP
|VM_MIXEDMAP
))) {
672 if (vma
->vm_flags
& VM_MIXEDMAP
) {
678 off
= (addr
- vma
->vm_start
) >> PAGE_SHIFT
;
679 if (pfn
== vma
->vm_pgoff
+ off
)
681 if (!is_cow_mapping(vma
->vm_flags
))
688 if (is_huge_zero_pmd(pmd
))
690 if (unlikely(pfn
> highest_memmap_pfn
))
694 * NOTE! We still have PageReserved() pages in the page tables.
695 * eg. VDSO mappings can cause them to exist.
698 return pfn_to_page(pfn
);
702 static void restore_exclusive_pte(struct vm_area_struct
*vma
,
703 struct page
*page
, unsigned long address
,
709 pte
= pte_mkold(mk_pte(page
, READ_ONCE(vma
->vm_page_prot
)));
710 if (pte_swp_soft_dirty(*ptep
))
711 pte
= pte_mksoft_dirty(pte
);
713 entry
= pte_to_swp_entry(*ptep
);
714 if (pte_swp_uffd_wp(*ptep
))
715 pte
= pte_mkuffd_wp(pte
);
716 else if (is_writable_device_exclusive_entry(entry
))
717 pte
= maybe_mkwrite(pte_mkdirty(pte
), vma
);
719 set_pte_at(vma
->vm_mm
, address
, ptep
, pte
);
722 * No need to take a page reference as one was already
723 * created when the swap entry was made.
726 page_add_anon_rmap(page
, vma
, address
, false);
729 * Currently device exclusive access only supports anonymous
730 * memory so the entry shouldn't point to a filebacked page.
732 WARN_ON_ONCE(!PageAnon(page
));
734 if (vma
->vm_flags
& VM_LOCKED
)
735 mlock_vma_page(page
);
738 * No need to invalidate - it was non-present before. However
739 * secondary CPUs may have mappings that need invalidating.
741 update_mmu_cache(vma
, address
, ptep
);
745 * Tries to restore an exclusive pte if the page lock can be acquired without
749 try_restore_exclusive_pte(pte_t
*src_pte
, struct vm_area_struct
*vma
,
752 swp_entry_t entry
= pte_to_swp_entry(*src_pte
);
753 struct page
*page
= pfn_swap_entry_to_page(entry
);
755 if (trylock_page(page
)) {
756 restore_exclusive_pte(vma
, page
, addr
, src_pte
);
765 * copy one vm_area from one task to the other. Assumes the page tables
766 * already present in the new task to be cleared in the whole range
767 * covered by this vma.
771 copy_nonpresent_pte(struct mm_struct
*dst_mm
, struct mm_struct
*src_mm
,
772 pte_t
*dst_pte
, pte_t
*src_pte
, struct vm_area_struct
*dst_vma
,
773 struct vm_area_struct
*src_vma
, unsigned long addr
, int *rss
)
775 unsigned long vm_flags
= dst_vma
->vm_flags
;
776 pte_t pte
= *src_pte
;
778 swp_entry_t entry
= pte_to_swp_entry(pte
);
780 if (likely(!non_swap_entry(entry
))) {
781 if (swap_duplicate(entry
) < 0)
784 /* make sure dst_mm is on swapoff's mmlist. */
785 if (unlikely(list_empty(&dst_mm
->mmlist
))) {
786 spin_lock(&mmlist_lock
);
787 if (list_empty(&dst_mm
->mmlist
))
788 list_add(&dst_mm
->mmlist
,
790 spin_unlock(&mmlist_lock
);
793 } else if (is_migration_entry(entry
)) {
794 page
= pfn_swap_entry_to_page(entry
);
796 rss
[mm_counter(page
)]++;
798 if (is_writable_migration_entry(entry
) &&
799 is_cow_mapping(vm_flags
)) {
801 * COW mappings require pages in both
802 * parent and child to be set to read.
804 entry
= make_readable_migration_entry(
806 pte
= swp_entry_to_pte(entry
);
807 if (pte_swp_soft_dirty(*src_pte
))
808 pte
= pte_swp_mksoft_dirty(pte
);
809 if (pte_swp_uffd_wp(*src_pte
))
810 pte
= pte_swp_mkuffd_wp(pte
);
811 set_pte_at(src_mm
, addr
, src_pte
, pte
);
813 } else if (is_device_private_entry(entry
)) {
814 page
= pfn_swap_entry_to_page(entry
);
817 * Update rss count even for unaddressable pages, as
818 * they should treated just like normal pages in this
821 * We will likely want to have some new rss counters
822 * for unaddressable pages, at some point. But for now
823 * keep things as they are.
826 rss
[mm_counter(page
)]++;
827 page_dup_rmap(page
, false);
830 * We do not preserve soft-dirty information, because so
831 * far, checkpoint/restore is the only feature that
832 * requires that. And checkpoint/restore does not work
833 * when a device driver is involved (you cannot easily
834 * save and restore device driver state).
836 if (is_writable_device_private_entry(entry
) &&
837 is_cow_mapping(vm_flags
)) {
838 entry
= make_readable_device_private_entry(
840 pte
= swp_entry_to_pte(entry
);
841 if (pte_swp_uffd_wp(*src_pte
))
842 pte
= pte_swp_mkuffd_wp(pte
);
843 set_pte_at(src_mm
, addr
, src_pte
, pte
);
845 } else if (is_device_exclusive_entry(entry
)) {
847 * Make device exclusive entries present by restoring the
848 * original entry then copying as for a present pte. Device
849 * exclusive entries currently only support private writable
850 * (ie. COW) mappings.
852 VM_BUG_ON(!is_cow_mapping(src_vma
->vm_flags
));
853 if (try_restore_exclusive_pte(src_pte
, src_vma
, addr
))
857 if (!userfaultfd_wp(dst_vma
))
858 pte
= pte_swp_clear_uffd_wp(pte
);
859 set_pte_at(dst_mm
, addr
, dst_pte
, pte
);
864 * Copy a present and normal page if necessary.
866 * NOTE! The usual case is that this doesn't need to do
867 * anything, and can just return a positive value. That
868 * will let the caller know that it can just increase
869 * the page refcount and re-use the pte the traditional
872 * But _if_ we need to copy it because it needs to be
873 * pinned in the parent (and the child should get its own
874 * copy rather than just a reference to the same page),
875 * we'll do that here and return zero to let the caller
878 * And if we need a pre-allocated page but don't yet have
879 * one, return a negative error to let the preallocation
880 * code know so that it can do so outside the page table
884 copy_present_page(struct vm_area_struct
*dst_vma
, struct vm_area_struct
*src_vma
,
885 pte_t
*dst_pte
, pte_t
*src_pte
, unsigned long addr
, int *rss
,
886 struct page
**prealloc
, pte_t pte
, struct page
*page
)
888 struct page
*new_page
;
891 * What we want to do is to check whether this page may
892 * have been pinned by the parent process. If so,
893 * instead of wrprotect the pte on both sides, we copy
894 * the page immediately so that we'll always guarantee
895 * the pinned page won't be randomly replaced in the
898 * The page pinning checks are just "has this mm ever
899 * seen pinning", along with the (inexact) check of
900 * the page count. That might give false positives for
901 * for pinning, but it will work correctly.
903 if (likely(!page_needs_cow_for_dma(src_vma
, page
)))
906 new_page
= *prealloc
;
911 * We have a prealloc page, all good! Take it
912 * over and copy the page & arm it.
915 copy_user_highpage(new_page
, page
, addr
, src_vma
);
916 __SetPageUptodate(new_page
);
917 page_add_new_anon_rmap(new_page
, dst_vma
, addr
, false);
918 lru_cache_add_inactive_or_unevictable(new_page
, dst_vma
);
919 rss
[mm_counter(new_page
)]++;
921 /* All done, just insert the new page copy in the child */
922 pte
= mk_pte(new_page
, dst_vma
->vm_page_prot
);
923 pte
= maybe_mkwrite(pte_mkdirty(pte
), dst_vma
);
924 if (userfaultfd_pte_wp(dst_vma
, *src_pte
))
925 /* Uffd-wp needs to be delivered to dest pte as well */
926 pte
= pte_wrprotect(pte_mkuffd_wp(pte
));
927 set_pte_at(dst_vma
->vm_mm
, addr
, dst_pte
, pte
);
932 * Copy one pte. Returns 0 if succeeded, or -EAGAIN if one preallocated page
933 * is required to copy this pte.
936 copy_present_pte(struct vm_area_struct
*dst_vma
, struct vm_area_struct
*src_vma
,
937 pte_t
*dst_pte
, pte_t
*src_pte
, unsigned long addr
, int *rss
,
938 struct page
**prealloc
)
940 struct mm_struct
*src_mm
= src_vma
->vm_mm
;
941 unsigned long vm_flags
= src_vma
->vm_flags
;
942 pte_t pte
= *src_pte
;
945 page
= vm_normal_page(src_vma
, addr
, pte
);
949 retval
= copy_present_page(dst_vma
, src_vma
, dst_pte
, src_pte
,
950 addr
, rss
, prealloc
, pte
, page
);
955 page_dup_rmap(page
, false);
956 rss
[mm_counter(page
)]++;
960 * If it's a COW mapping, write protect it both
961 * in the parent and the child
963 if (is_cow_mapping(vm_flags
) && pte_write(pte
)) {
964 ptep_set_wrprotect(src_mm
, addr
, src_pte
);
965 pte
= pte_wrprotect(pte
);
969 * If it's a shared mapping, mark it clean in
972 if (vm_flags
& VM_SHARED
)
973 pte
= pte_mkclean(pte
);
974 pte
= pte_mkold(pte
);
976 if (!userfaultfd_wp(dst_vma
))
977 pte
= pte_clear_uffd_wp(pte
);
979 set_pte_at(dst_vma
->vm_mm
, addr
, dst_pte
, pte
);
983 static inline struct page
*
984 page_copy_prealloc(struct mm_struct
*src_mm
, struct vm_area_struct
*vma
,
987 struct page
*new_page
;
989 new_page
= alloc_page_vma(GFP_HIGHUSER_MOVABLE
, vma
, addr
);
993 if (mem_cgroup_charge(new_page
, src_mm
, GFP_KERNEL
)) {
997 cgroup_throttle_swaprate(new_page
, GFP_KERNEL
);
1003 copy_pte_range(struct vm_area_struct
*dst_vma
, struct vm_area_struct
*src_vma
,
1004 pmd_t
*dst_pmd
, pmd_t
*src_pmd
, unsigned long addr
,
1007 struct mm_struct
*dst_mm
= dst_vma
->vm_mm
;
1008 struct mm_struct
*src_mm
= src_vma
->vm_mm
;
1009 pte_t
*orig_src_pte
, *orig_dst_pte
;
1010 pte_t
*src_pte
, *dst_pte
;
1011 spinlock_t
*src_ptl
, *dst_ptl
;
1012 int progress
, ret
= 0;
1013 int rss
[NR_MM_COUNTERS
];
1014 swp_entry_t entry
= (swp_entry_t
){0};
1015 struct page
*prealloc
= NULL
;
1021 dst_pte
= pte_alloc_map_lock(dst_mm
, dst_pmd
, addr
, &dst_ptl
);
1026 src_pte
= pte_offset_map(src_pmd
, addr
);
1027 src_ptl
= pte_lockptr(src_mm
, src_pmd
);
1028 spin_lock_nested(src_ptl
, SINGLE_DEPTH_NESTING
);
1029 orig_src_pte
= src_pte
;
1030 orig_dst_pte
= dst_pte
;
1031 arch_enter_lazy_mmu_mode();
1035 * We are holding two locks at this point - either of them
1036 * could generate latencies in another task on another CPU.
1038 if (progress
>= 32) {
1040 if (need_resched() ||
1041 spin_needbreak(src_ptl
) || spin_needbreak(dst_ptl
))
1044 if (pte_none(*src_pte
)) {
1048 if (unlikely(!pte_present(*src_pte
))) {
1049 ret
= copy_nonpresent_pte(dst_mm
, src_mm
,
1054 entry
= pte_to_swp_entry(*src_pte
);
1056 } else if (ret
== -EBUSY
) {
1064 * Device exclusive entry restored, continue by copying
1065 * the now present pte.
1067 WARN_ON_ONCE(ret
!= -ENOENT
);
1069 /* copy_present_pte() will clear `*prealloc' if consumed */
1070 ret
= copy_present_pte(dst_vma
, src_vma
, dst_pte
, src_pte
,
1071 addr
, rss
, &prealloc
);
1073 * If we need a pre-allocated page for this pte, drop the
1074 * locks, allocate, and try again.
1076 if (unlikely(ret
== -EAGAIN
))
1078 if (unlikely(prealloc
)) {
1080 * pre-alloc page cannot be reused by next time so as
1081 * to strictly follow mempolicy (e.g., alloc_page_vma()
1082 * will allocate page according to address). This
1083 * could only happen if one pinned pte changed.
1089 } while (dst_pte
++, src_pte
++, addr
+= PAGE_SIZE
, addr
!= end
);
1091 arch_leave_lazy_mmu_mode();
1092 spin_unlock(src_ptl
);
1093 pte_unmap(orig_src_pte
);
1094 add_mm_rss_vec(dst_mm
, rss
);
1095 pte_unmap_unlock(orig_dst_pte
, dst_ptl
);
1099 VM_WARN_ON_ONCE(!entry
.val
);
1100 if (add_swap_count_continuation(entry
, GFP_KERNEL
) < 0) {
1105 } else if (ret
== -EBUSY
) {
1107 } else if (ret
== -EAGAIN
) {
1108 prealloc
= page_copy_prealloc(src_mm
, src_vma
, addr
);
1115 /* We've captured and resolved the error. Reset, try again. */
1121 if (unlikely(prealloc
))
1127 copy_pmd_range(struct vm_area_struct
*dst_vma
, struct vm_area_struct
*src_vma
,
1128 pud_t
*dst_pud
, pud_t
*src_pud
, unsigned long addr
,
1131 struct mm_struct
*dst_mm
= dst_vma
->vm_mm
;
1132 struct mm_struct
*src_mm
= src_vma
->vm_mm
;
1133 pmd_t
*src_pmd
, *dst_pmd
;
1136 dst_pmd
= pmd_alloc(dst_mm
, dst_pud
, addr
);
1139 src_pmd
= pmd_offset(src_pud
, addr
);
1141 next
= pmd_addr_end(addr
, end
);
1142 if (is_swap_pmd(*src_pmd
) || pmd_trans_huge(*src_pmd
)
1143 || pmd_devmap(*src_pmd
)) {
1145 VM_BUG_ON_VMA(next
-addr
!= HPAGE_PMD_SIZE
, src_vma
);
1146 err
= copy_huge_pmd(dst_mm
, src_mm
, dst_pmd
, src_pmd
,
1147 addr
, dst_vma
, src_vma
);
1154 if (pmd_none_or_clear_bad(src_pmd
))
1156 if (copy_pte_range(dst_vma
, src_vma
, dst_pmd
, src_pmd
,
1159 } while (dst_pmd
++, src_pmd
++, addr
= next
, addr
!= end
);
1164 copy_pud_range(struct vm_area_struct
*dst_vma
, struct vm_area_struct
*src_vma
,
1165 p4d_t
*dst_p4d
, p4d_t
*src_p4d
, unsigned long addr
,
1168 struct mm_struct
*dst_mm
= dst_vma
->vm_mm
;
1169 struct mm_struct
*src_mm
= src_vma
->vm_mm
;
1170 pud_t
*src_pud
, *dst_pud
;
1173 dst_pud
= pud_alloc(dst_mm
, dst_p4d
, addr
);
1176 src_pud
= pud_offset(src_p4d
, addr
);
1178 next
= pud_addr_end(addr
, end
);
1179 if (pud_trans_huge(*src_pud
) || pud_devmap(*src_pud
)) {
1182 VM_BUG_ON_VMA(next
-addr
!= HPAGE_PUD_SIZE
, src_vma
);
1183 err
= copy_huge_pud(dst_mm
, src_mm
,
1184 dst_pud
, src_pud
, addr
, src_vma
);
1191 if (pud_none_or_clear_bad(src_pud
))
1193 if (copy_pmd_range(dst_vma
, src_vma
, dst_pud
, src_pud
,
1196 } while (dst_pud
++, src_pud
++, addr
= next
, addr
!= end
);
1201 copy_p4d_range(struct vm_area_struct
*dst_vma
, struct vm_area_struct
*src_vma
,
1202 pgd_t
*dst_pgd
, pgd_t
*src_pgd
, unsigned long addr
,
1205 struct mm_struct
*dst_mm
= dst_vma
->vm_mm
;
1206 p4d_t
*src_p4d
, *dst_p4d
;
1209 dst_p4d
= p4d_alloc(dst_mm
, dst_pgd
, addr
);
1212 src_p4d
= p4d_offset(src_pgd
, addr
);
1214 next
= p4d_addr_end(addr
, end
);
1215 if (p4d_none_or_clear_bad(src_p4d
))
1217 if (copy_pud_range(dst_vma
, src_vma
, dst_p4d
, src_p4d
,
1220 } while (dst_p4d
++, src_p4d
++, addr
= next
, addr
!= end
);
1225 copy_page_range(struct vm_area_struct
*dst_vma
, struct vm_area_struct
*src_vma
)
1227 pgd_t
*src_pgd
, *dst_pgd
;
1229 unsigned long addr
= src_vma
->vm_start
;
1230 unsigned long end
= src_vma
->vm_end
;
1231 struct mm_struct
*dst_mm
= dst_vma
->vm_mm
;
1232 struct mm_struct
*src_mm
= src_vma
->vm_mm
;
1233 struct mmu_notifier_range range
;
1238 * Don't copy ptes where a page fault will fill them correctly.
1239 * Fork becomes much lighter when there are big shared or private
1240 * readonly mappings. The tradeoff is that copy_page_range is more
1241 * efficient than faulting.
1243 if (!(src_vma
->vm_flags
& (VM_HUGETLB
| VM_PFNMAP
| VM_MIXEDMAP
)) &&
1247 if (is_vm_hugetlb_page(src_vma
))
1248 return copy_hugetlb_page_range(dst_mm
, src_mm
, src_vma
);
1250 if (unlikely(src_vma
->vm_flags
& VM_PFNMAP
)) {
1252 * We do not free on error cases below as remove_vma
1253 * gets called on error from higher level routine
1255 ret
= track_pfn_copy(src_vma
);
1261 * We need to invalidate the secondary MMU mappings only when
1262 * there could be a permission downgrade on the ptes of the
1263 * parent mm. And a permission downgrade will only happen if
1264 * is_cow_mapping() returns true.
1266 is_cow
= is_cow_mapping(src_vma
->vm_flags
);
1269 mmu_notifier_range_init(&range
, MMU_NOTIFY_PROTECTION_PAGE
,
1270 0, src_vma
, src_mm
, addr
, end
);
1271 mmu_notifier_invalidate_range_start(&range
);
1273 * Disabling preemption is not needed for the write side, as
1274 * the read side doesn't spin, but goes to the mmap_lock.
1276 * Use the raw variant of the seqcount_t write API to avoid
1277 * lockdep complaining about preemptibility.
1279 mmap_assert_write_locked(src_mm
);
1280 raw_write_seqcount_begin(&src_mm
->write_protect_seq
);
1284 dst_pgd
= pgd_offset(dst_mm
, addr
);
1285 src_pgd
= pgd_offset(src_mm
, addr
);
1287 next
= pgd_addr_end(addr
, end
);
1288 if (pgd_none_or_clear_bad(src_pgd
))
1290 if (unlikely(copy_p4d_range(dst_vma
, src_vma
, dst_pgd
, src_pgd
,
1295 } while (dst_pgd
++, src_pgd
++, addr
= next
, addr
!= end
);
1298 raw_write_seqcount_end(&src_mm
->write_protect_seq
);
1299 mmu_notifier_invalidate_range_end(&range
);
1304 static unsigned long zap_pte_range(struct mmu_gather
*tlb
,
1305 struct vm_area_struct
*vma
, pmd_t
*pmd
,
1306 unsigned long addr
, unsigned long end
,
1307 struct zap_details
*details
)
1309 struct mm_struct
*mm
= tlb
->mm
;
1310 int force_flush
= 0;
1311 int rss
[NR_MM_COUNTERS
];
1317 tlb_change_page_size(tlb
, PAGE_SIZE
);
1320 start_pte
= pte_offset_map_lock(mm
, pmd
, addr
, &ptl
);
1322 flush_tlb_batched_pending(mm
);
1323 arch_enter_lazy_mmu_mode();
1326 if (pte_none(ptent
))
1332 if (pte_present(ptent
)) {
1335 page
= vm_normal_page(vma
, addr
, ptent
);
1336 if (unlikely(details
) && page
) {
1338 * unmap_shared_mapping_pages() wants to
1339 * invalidate cache without truncating:
1340 * unmap shared but keep private pages.
1342 if (details
->check_mapping
&&
1343 details
->check_mapping
!= page_rmapping(page
))
1346 ptent
= ptep_get_and_clear_full(mm
, addr
, pte
,
1348 tlb_remove_tlb_entry(tlb
, pte
, addr
);
1349 if (unlikely(!page
))
1352 if (!PageAnon(page
)) {
1353 if (pte_dirty(ptent
)) {
1355 set_page_dirty(page
);
1357 if (pte_young(ptent
) &&
1358 likely(!(vma
->vm_flags
& VM_SEQ_READ
)))
1359 mark_page_accessed(page
);
1361 rss
[mm_counter(page
)]--;
1362 page_remove_rmap(page
, false);
1363 if (unlikely(page_mapcount(page
) < 0))
1364 print_bad_pte(vma
, addr
, ptent
, page
);
1365 if (unlikely(__tlb_remove_page(tlb
, page
))) {
1373 entry
= pte_to_swp_entry(ptent
);
1374 if (is_device_private_entry(entry
) ||
1375 is_device_exclusive_entry(entry
)) {
1376 struct page
*page
= pfn_swap_entry_to_page(entry
);
1378 if (unlikely(details
&& details
->check_mapping
)) {
1380 * unmap_shared_mapping_pages() wants to
1381 * invalidate cache without truncating:
1382 * unmap shared but keep private pages.
1384 if (details
->check_mapping
!=
1385 page_rmapping(page
))
1389 pte_clear_not_present_full(mm
, addr
, pte
, tlb
->fullmm
);
1390 rss
[mm_counter(page
)]--;
1392 if (is_device_private_entry(entry
))
1393 page_remove_rmap(page
, false);
1399 /* If details->check_mapping, we leave swap entries. */
1400 if (unlikely(details
))
1403 if (!non_swap_entry(entry
))
1405 else if (is_migration_entry(entry
)) {
1408 page
= pfn_swap_entry_to_page(entry
);
1409 rss
[mm_counter(page
)]--;
1411 if (unlikely(!free_swap_and_cache(entry
)))
1412 print_bad_pte(vma
, addr
, ptent
, NULL
);
1413 pte_clear_not_present_full(mm
, addr
, pte
, tlb
->fullmm
);
1414 } while (pte
++, addr
+= PAGE_SIZE
, addr
!= end
);
1416 add_mm_rss_vec(mm
, rss
);
1417 arch_leave_lazy_mmu_mode();
1419 /* Do the actual TLB flush before dropping ptl */
1421 tlb_flush_mmu_tlbonly(tlb
);
1422 pte_unmap_unlock(start_pte
, ptl
);
1425 * If we forced a TLB flush (either due to running out of
1426 * batch buffers or because we needed to flush dirty TLB
1427 * entries before releasing the ptl), free the batched
1428 * memory too. Restart if we didn't do everything.
1443 static inline unsigned long zap_pmd_range(struct mmu_gather
*tlb
,
1444 struct vm_area_struct
*vma
, pud_t
*pud
,
1445 unsigned long addr
, unsigned long end
,
1446 struct zap_details
*details
)
1451 pmd
= pmd_offset(pud
, addr
);
1453 next
= pmd_addr_end(addr
, end
);
1454 if (is_swap_pmd(*pmd
) || pmd_trans_huge(*pmd
) || pmd_devmap(*pmd
)) {
1455 if (next
- addr
!= HPAGE_PMD_SIZE
)
1456 __split_huge_pmd(vma
, pmd
, addr
, false, NULL
);
1457 else if (zap_huge_pmd(tlb
, vma
, pmd
, addr
))
1460 } else if (details
&& details
->single_page
&&
1461 PageTransCompound(details
->single_page
) &&
1462 next
- addr
== HPAGE_PMD_SIZE
&& pmd_none(*pmd
)) {
1463 spinlock_t
*ptl
= pmd_lock(tlb
->mm
, pmd
);
1465 * Take and drop THP pmd lock so that we cannot return
1466 * prematurely, while zap_huge_pmd() has cleared *pmd,
1467 * but not yet decremented compound_mapcount().
1473 * Here there can be other concurrent MADV_DONTNEED or
1474 * trans huge page faults running, and if the pmd is
1475 * none or trans huge it can change under us. This is
1476 * because MADV_DONTNEED holds the mmap_lock in read
1479 if (pmd_none_or_trans_huge_or_clear_bad(pmd
))
1481 next
= zap_pte_range(tlb
, vma
, pmd
, addr
, next
, details
);
1484 } while (pmd
++, addr
= next
, addr
!= end
);
1489 static inline unsigned long zap_pud_range(struct mmu_gather
*tlb
,
1490 struct vm_area_struct
*vma
, p4d_t
*p4d
,
1491 unsigned long addr
, unsigned long end
,
1492 struct zap_details
*details
)
1497 pud
= pud_offset(p4d
, addr
);
1499 next
= pud_addr_end(addr
, end
);
1500 if (pud_trans_huge(*pud
) || pud_devmap(*pud
)) {
1501 if (next
- addr
!= HPAGE_PUD_SIZE
) {
1502 mmap_assert_locked(tlb
->mm
);
1503 split_huge_pud(vma
, pud
, addr
);
1504 } else if (zap_huge_pud(tlb
, vma
, pud
, addr
))
1508 if (pud_none_or_clear_bad(pud
))
1510 next
= zap_pmd_range(tlb
, vma
, pud
, addr
, next
, details
);
1513 } while (pud
++, addr
= next
, addr
!= end
);
1518 static inline unsigned long zap_p4d_range(struct mmu_gather
*tlb
,
1519 struct vm_area_struct
*vma
, pgd_t
*pgd
,
1520 unsigned long addr
, unsigned long end
,
1521 struct zap_details
*details
)
1526 p4d
= p4d_offset(pgd
, addr
);
1528 next
= p4d_addr_end(addr
, end
);
1529 if (p4d_none_or_clear_bad(p4d
))
1531 next
= zap_pud_range(tlb
, vma
, p4d
, addr
, next
, details
);
1532 } while (p4d
++, addr
= next
, addr
!= end
);
1537 void unmap_page_range(struct mmu_gather
*tlb
,
1538 struct vm_area_struct
*vma
,
1539 unsigned long addr
, unsigned long end
,
1540 struct zap_details
*details
)
1545 BUG_ON(addr
>= end
);
1546 tlb_start_vma(tlb
, vma
);
1547 pgd
= pgd_offset(vma
->vm_mm
, addr
);
1549 next
= pgd_addr_end(addr
, end
);
1550 if (pgd_none_or_clear_bad(pgd
))
1552 next
= zap_p4d_range(tlb
, vma
, pgd
, addr
, next
, details
);
1553 } while (pgd
++, addr
= next
, addr
!= end
);
1554 tlb_end_vma(tlb
, vma
);
1558 static void unmap_single_vma(struct mmu_gather
*tlb
,
1559 struct vm_area_struct
*vma
, unsigned long start_addr
,
1560 unsigned long end_addr
,
1561 struct zap_details
*details
)
1563 unsigned long start
= max(vma
->vm_start
, start_addr
);
1566 if (start
>= vma
->vm_end
)
1568 end
= min(vma
->vm_end
, end_addr
);
1569 if (end
<= vma
->vm_start
)
1573 uprobe_munmap(vma
, start
, end
);
1575 if (unlikely(vma
->vm_flags
& VM_PFNMAP
))
1576 untrack_pfn(vma
, 0, 0);
1579 if (unlikely(is_vm_hugetlb_page(vma
))) {
1581 * It is undesirable to test vma->vm_file as it
1582 * should be non-null for valid hugetlb area.
1583 * However, vm_file will be NULL in the error
1584 * cleanup path of mmap_region. When
1585 * hugetlbfs ->mmap method fails,
1586 * mmap_region() nullifies vma->vm_file
1587 * before calling this function to clean up.
1588 * Since no pte has actually been setup, it is
1589 * safe to do nothing in this case.
1592 i_mmap_lock_write(vma
->vm_file
->f_mapping
);
1593 __unmap_hugepage_range_final(tlb
, vma
, start
, end
, NULL
);
1594 i_mmap_unlock_write(vma
->vm_file
->f_mapping
);
1597 unmap_page_range(tlb
, vma
, start
, end
, details
);
1602 * unmap_vmas - unmap a range of memory covered by a list of vma's
1603 * @tlb: address of the caller's struct mmu_gather
1604 * @vma: the starting vma
1605 * @start_addr: virtual address at which to start unmapping
1606 * @end_addr: virtual address at which to end unmapping
1608 * Unmap all pages in the vma list.
1610 * Only addresses between `start' and `end' will be unmapped.
1612 * The VMA list must be sorted in ascending virtual address order.
1614 * unmap_vmas() assumes that the caller will flush the whole unmapped address
1615 * range after unmap_vmas() returns. So the only responsibility here is to
1616 * ensure that any thus-far unmapped pages are flushed before unmap_vmas()
1617 * drops the lock and schedules.
1619 void unmap_vmas(struct mmu_gather
*tlb
,
1620 struct vm_area_struct
*vma
, unsigned long start_addr
,
1621 unsigned long end_addr
)
1623 struct mmu_notifier_range range
;
1625 mmu_notifier_range_init(&range
, MMU_NOTIFY_UNMAP
, 0, vma
, vma
->vm_mm
,
1626 start_addr
, end_addr
);
1627 mmu_notifier_invalidate_range_start(&range
);
1628 for ( ; vma
&& vma
->vm_start
< end_addr
; vma
= vma
->vm_next
)
1629 unmap_single_vma(tlb
, vma
, start_addr
, end_addr
, NULL
);
1630 mmu_notifier_invalidate_range_end(&range
);
1634 * zap_page_range - remove user pages in a given range
1635 * @vma: vm_area_struct holding the applicable pages
1636 * @start: starting address of pages to zap
1637 * @size: number of bytes to zap
1639 * Caller must protect the VMA list
1641 void zap_page_range(struct vm_area_struct
*vma
, unsigned long start
,
1644 struct mmu_notifier_range range
;
1645 struct mmu_gather tlb
;
1648 mmu_notifier_range_init(&range
, MMU_NOTIFY_CLEAR
, 0, vma
, vma
->vm_mm
,
1649 start
, start
+ size
);
1650 tlb_gather_mmu(&tlb
, vma
->vm_mm
);
1651 update_hiwater_rss(vma
->vm_mm
);
1652 mmu_notifier_invalidate_range_start(&range
);
1653 for ( ; vma
&& vma
->vm_start
< range
.end
; vma
= vma
->vm_next
)
1654 unmap_single_vma(&tlb
, vma
, start
, range
.end
, NULL
);
1655 mmu_notifier_invalidate_range_end(&range
);
1656 tlb_finish_mmu(&tlb
);
1658 EXPORT_SYMBOL(zap_page_range
);
1661 * zap_page_range_single - remove user pages in a given range
1662 * @vma: vm_area_struct holding the applicable pages
1663 * @address: starting address of pages to zap
1664 * @size: number of bytes to zap
1665 * @details: details of shared cache invalidation
1667 * The range must fit into one VMA.
1669 static void zap_page_range_single(struct vm_area_struct
*vma
, unsigned long address
,
1670 unsigned long size
, struct zap_details
*details
)
1672 struct mmu_notifier_range range
;
1673 struct mmu_gather tlb
;
1676 mmu_notifier_range_init(&range
, MMU_NOTIFY_CLEAR
, 0, vma
, vma
->vm_mm
,
1677 address
, address
+ size
);
1678 tlb_gather_mmu(&tlb
, vma
->vm_mm
);
1679 update_hiwater_rss(vma
->vm_mm
);
1680 mmu_notifier_invalidate_range_start(&range
);
1681 unmap_single_vma(&tlb
, vma
, address
, range
.end
, details
);
1682 mmu_notifier_invalidate_range_end(&range
);
1683 tlb_finish_mmu(&tlb
);
1687 * zap_vma_ptes - remove ptes mapping the vma
1688 * @vma: vm_area_struct holding ptes to be zapped
1689 * @address: starting address of pages to zap
1690 * @size: number of bytes to zap
1692 * This function only unmaps ptes assigned to VM_PFNMAP vmas.
1694 * The entire address range must be fully contained within the vma.
1697 void zap_vma_ptes(struct vm_area_struct
*vma
, unsigned long address
,
1700 if (address
< vma
->vm_start
|| address
+ size
> vma
->vm_end
||
1701 !(vma
->vm_flags
& VM_PFNMAP
))
1704 zap_page_range_single(vma
, address
, size
, NULL
);
1706 EXPORT_SYMBOL_GPL(zap_vma_ptes
);
1708 static pmd_t
*walk_to_pmd(struct mm_struct
*mm
, unsigned long addr
)
1715 pgd
= pgd_offset(mm
, addr
);
1716 p4d
= p4d_alloc(mm
, pgd
, addr
);
1719 pud
= pud_alloc(mm
, p4d
, addr
);
1722 pmd
= pmd_alloc(mm
, pud
, addr
);
1726 VM_BUG_ON(pmd_trans_huge(*pmd
));
1730 pte_t
*__get_locked_pte(struct mm_struct
*mm
, unsigned long addr
,
1733 pmd_t
*pmd
= walk_to_pmd(mm
, addr
);
1737 return pte_alloc_map_lock(mm
, pmd
, addr
, ptl
);
1740 static int validate_page_before_insert(struct page
*page
)
1742 if (PageAnon(page
) || PageSlab(page
) || page_has_type(page
))
1744 flush_dcache_page(page
);
1748 static int insert_page_into_pte_locked(struct mm_struct
*mm
, pte_t
*pte
,
1749 unsigned long addr
, struct page
*page
, pgprot_t prot
)
1751 if (!pte_none(*pte
))
1753 /* Ok, finally just insert the thing.. */
1755 inc_mm_counter_fast(mm
, mm_counter_file(page
));
1756 page_add_file_rmap(page
, false);
1757 set_pte_at(mm
, addr
, pte
, mk_pte(page
, prot
));
1762 * This is the old fallback for page remapping.
1764 * For historical reasons, it only allows reserved pages. Only
1765 * old drivers should use this, and they needed to mark their
1766 * pages reserved for the old functions anyway.
1768 static int insert_page(struct vm_area_struct
*vma
, unsigned long addr
,
1769 struct page
*page
, pgprot_t prot
)
1771 struct mm_struct
*mm
= vma
->vm_mm
;
1776 retval
= validate_page_before_insert(page
);
1780 pte
= get_locked_pte(mm
, addr
, &ptl
);
1783 retval
= insert_page_into_pte_locked(mm
, pte
, addr
, page
, prot
);
1784 pte_unmap_unlock(pte
, ptl
);
1790 static int insert_page_in_batch_locked(struct mm_struct
*mm
, pte_t
*pte
,
1791 unsigned long addr
, struct page
*page
, pgprot_t prot
)
1795 if (!page_count(page
))
1797 err
= validate_page_before_insert(page
);
1800 return insert_page_into_pte_locked(mm
, pte
, addr
, page
, prot
);
1803 /* insert_pages() amortizes the cost of spinlock operations
1804 * when inserting pages in a loop. Arch *must* define pte_index.
1806 static int insert_pages(struct vm_area_struct
*vma
, unsigned long addr
,
1807 struct page
**pages
, unsigned long *num
, pgprot_t prot
)
1810 pte_t
*start_pte
, *pte
;
1811 spinlock_t
*pte_lock
;
1812 struct mm_struct
*const mm
= vma
->vm_mm
;
1813 unsigned long curr_page_idx
= 0;
1814 unsigned long remaining_pages_total
= *num
;
1815 unsigned long pages_to_write_in_pmd
;
1819 pmd
= walk_to_pmd(mm
, addr
);
1823 pages_to_write_in_pmd
= min_t(unsigned long,
1824 remaining_pages_total
, PTRS_PER_PTE
- pte_index(addr
));
1826 /* Allocate the PTE if necessary; takes PMD lock once only. */
1828 if (pte_alloc(mm
, pmd
))
1831 while (pages_to_write_in_pmd
) {
1833 const int batch_size
= min_t(int, pages_to_write_in_pmd
, 8);
1835 start_pte
= pte_offset_map_lock(mm
, pmd
, addr
, &pte_lock
);
1836 for (pte
= start_pte
; pte_idx
< batch_size
; ++pte
, ++pte_idx
) {
1837 int err
= insert_page_in_batch_locked(mm
, pte
,
1838 addr
, pages
[curr_page_idx
], prot
);
1839 if (unlikely(err
)) {
1840 pte_unmap_unlock(start_pte
, pte_lock
);
1842 remaining_pages_total
-= pte_idx
;
1848 pte_unmap_unlock(start_pte
, pte_lock
);
1849 pages_to_write_in_pmd
-= batch_size
;
1850 remaining_pages_total
-= batch_size
;
1852 if (remaining_pages_total
)
1856 *num
= remaining_pages_total
;
1859 #endif /* ifdef pte_index */
1862 * vm_insert_pages - insert multiple pages into user vma, batching the pmd lock.
1863 * @vma: user vma to map to
1864 * @addr: target start user address of these pages
1865 * @pages: source kernel pages
1866 * @num: in: number of pages to map. out: number of pages that were *not*
1867 * mapped. (0 means all pages were successfully mapped).
1869 * Preferred over vm_insert_page() when inserting multiple pages.
1871 * In case of error, we may have mapped a subset of the provided
1872 * pages. It is the caller's responsibility to account for this case.
1874 * The same restrictions apply as in vm_insert_page().
1876 int vm_insert_pages(struct vm_area_struct
*vma
, unsigned long addr
,
1877 struct page
**pages
, unsigned long *num
)
1880 const unsigned long end_addr
= addr
+ (*num
* PAGE_SIZE
) - 1;
1882 if (addr
< vma
->vm_start
|| end_addr
>= vma
->vm_end
)
1884 if (!(vma
->vm_flags
& VM_MIXEDMAP
)) {
1885 BUG_ON(mmap_read_trylock(vma
->vm_mm
));
1886 BUG_ON(vma
->vm_flags
& VM_PFNMAP
);
1887 vma
->vm_flags
|= VM_MIXEDMAP
;
1889 /* Defer page refcount checking till we're about to map that page. */
1890 return insert_pages(vma
, addr
, pages
, num
, vma
->vm_page_prot
);
1892 unsigned long idx
= 0, pgcount
= *num
;
1895 for (; idx
< pgcount
; ++idx
) {
1896 err
= vm_insert_page(vma
, addr
+ (PAGE_SIZE
* idx
), pages
[idx
]);
1900 *num
= pgcount
- idx
;
1902 #endif /* ifdef pte_index */
1904 EXPORT_SYMBOL(vm_insert_pages
);
1907 * vm_insert_page - insert single page into user vma
1908 * @vma: user vma to map to
1909 * @addr: target user address of this page
1910 * @page: source kernel page
1912 * This allows drivers to insert individual pages they've allocated
1915 * The page has to be a nice clean _individual_ kernel allocation.
1916 * If you allocate a compound page, you need to have marked it as
1917 * such (__GFP_COMP), or manually just split the page up yourself
1918 * (see split_page()).
1920 * NOTE! Traditionally this was done with "remap_pfn_range()" which
1921 * took an arbitrary page protection parameter. This doesn't allow
1922 * that. Your vma protection will have to be set up correctly, which
1923 * means that if you want a shared writable mapping, you'd better
1924 * ask for a shared writable mapping!
1926 * The page does not need to be reserved.
1928 * Usually this function is called from f_op->mmap() handler
1929 * under mm->mmap_lock write-lock, so it can change vma->vm_flags.
1930 * Caller must set VM_MIXEDMAP on vma if it wants to call this
1931 * function from other places, for example from page-fault handler.
1933 * Return: %0 on success, negative error code otherwise.
1935 int vm_insert_page(struct vm_area_struct
*vma
, unsigned long addr
,
1938 if (addr
< vma
->vm_start
|| addr
>= vma
->vm_end
)
1940 if (!page_count(page
))
1942 if (!(vma
->vm_flags
& VM_MIXEDMAP
)) {
1943 BUG_ON(mmap_read_trylock(vma
->vm_mm
));
1944 BUG_ON(vma
->vm_flags
& VM_PFNMAP
);
1945 vma
->vm_flags
|= VM_MIXEDMAP
;
1947 return insert_page(vma
, addr
, page
, vma
->vm_page_prot
);
1949 EXPORT_SYMBOL(vm_insert_page
);
1952 * __vm_map_pages - maps range of kernel pages into user vma
1953 * @vma: user vma to map to
1954 * @pages: pointer to array of source kernel pages
1955 * @num: number of pages in page array
1956 * @offset: user's requested vm_pgoff
1958 * This allows drivers to map range of kernel pages into a user vma.
1960 * Return: 0 on success and error code otherwise.
1962 static int __vm_map_pages(struct vm_area_struct
*vma
, struct page
**pages
,
1963 unsigned long num
, unsigned long offset
)
1965 unsigned long count
= vma_pages(vma
);
1966 unsigned long uaddr
= vma
->vm_start
;
1969 /* Fail if the user requested offset is beyond the end of the object */
1973 /* Fail if the user requested size exceeds available object size */
1974 if (count
> num
- offset
)
1977 for (i
= 0; i
< count
; i
++) {
1978 ret
= vm_insert_page(vma
, uaddr
, pages
[offset
+ i
]);
1988 * vm_map_pages - maps range of kernel pages starts with non zero offset
1989 * @vma: user vma to map to
1990 * @pages: pointer to array of source kernel pages
1991 * @num: number of pages in page array
1993 * Maps an object consisting of @num pages, catering for the user's
1994 * requested vm_pgoff
1996 * If we fail to insert any page into the vma, the function will return
1997 * immediately leaving any previously inserted pages present. Callers
1998 * from the mmap handler may immediately return the error as their caller
1999 * will destroy the vma, removing any successfully inserted pages. Other
2000 * callers should make their own arrangements for calling unmap_region().
2002 * Context: Process context. Called by mmap handlers.
2003 * Return: 0 on success and error code otherwise.
2005 int vm_map_pages(struct vm_area_struct
*vma
, struct page
**pages
,
2008 return __vm_map_pages(vma
, pages
, num
, vma
->vm_pgoff
);
2010 EXPORT_SYMBOL(vm_map_pages
);
2013 * vm_map_pages_zero - map range of kernel pages starts with zero offset
2014 * @vma: user vma to map to
2015 * @pages: pointer to array of source kernel pages
2016 * @num: number of pages in page array
2018 * Similar to vm_map_pages(), except that it explicitly sets the offset
2019 * to 0. This function is intended for the drivers that did not consider
2022 * Context: Process context. Called by mmap handlers.
2023 * Return: 0 on success and error code otherwise.
2025 int vm_map_pages_zero(struct vm_area_struct
*vma
, struct page
**pages
,
2028 return __vm_map_pages(vma
, pages
, num
, 0);
2030 EXPORT_SYMBOL(vm_map_pages_zero
);
2032 static vm_fault_t
insert_pfn(struct vm_area_struct
*vma
, unsigned long addr
,
2033 pfn_t pfn
, pgprot_t prot
, bool mkwrite
)
2035 struct mm_struct
*mm
= vma
->vm_mm
;
2039 pte
= get_locked_pte(mm
, addr
, &ptl
);
2041 return VM_FAULT_OOM
;
2042 if (!pte_none(*pte
)) {
2045 * For read faults on private mappings the PFN passed
2046 * in may not match the PFN we have mapped if the
2047 * mapped PFN is a writeable COW page. In the mkwrite
2048 * case we are creating a writable PTE for a shared
2049 * mapping and we expect the PFNs to match. If they
2050 * don't match, we are likely racing with block
2051 * allocation and mapping invalidation so just skip the
2054 if (pte_pfn(*pte
) != pfn_t_to_pfn(pfn
)) {
2055 WARN_ON_ONCE(!is_zero_pfn(pte_pfn(*pte
)));
2058 entry
= pte_mkyoung(*pte
);
2059 entry
= maybe_mkwrite(pte_mkdirty(entry
), vma
);
2060 if (ptep_set_access_flags(vma
, addr
, pte
, entry
, 1))
2061 update_mmu_cache(vma
, addr
, pte
);
2066 /* Ok, finally just insert the thing.. */
2067 if (pfn_t_devmap(pfn
))
2068 entry
= pte_mkdevmap(pfn_t_pte(pfn
, prot
));
2070 entry
= pte_mkspecial(pfn_t_pte(pfn
, prot
));
2073 entry
= pte_mkyoung(entry
);
2074 entry
= maybe_mkwrite(pte_mkdirty(entry
), vma
);
2077 set_pte_at(mm
, addr
, pte
, entry
);
2078 update_mmu_cache(vma
, addr
, pte
); /* XXX: why not for insert_page? */
2081 pte_unmap_unlock(pte
, ptl
);
2082 return VM_FAULT_NOPAGE
;
2086 * vmf_insert_pfn_prot - insert single pfn into user vma with specified pgprot
2087 * @vma: user vma to map to
2088 * @addr: target user address of this page
2089 * @pfn: source kernel pfn
2090 * @pgprot: pgprot flags for the inserted page
2092 * This is exactly like vmf_insert_pfn(), except that it allows drivers
2093 * to override pgprot on a per-page basis.
2095 * This only makes sense for IO mappings, and it makes no sense for
2096 * COW mappings. In general, using multiple vmas is preferable;
2097 * vmf_insert_pfn_prot should only be used if using multiple VMAs is
2100 * See vmf_insert_mixed_prot() for a discussion of the implication of using
2101 * a value of @pgprot different from that of @vma->vm_page_prot.
2103 * Context: Process context. May allocate using %GFP_KERNEL.
2104 * Return: vm_fault_t value.
2106 vm_fault_t
vmf_insert_pfn_prot(struct vm_area_struct
*vma
, unsigned long addr
,
2107 unsigned long pfn
, pgprot_t pgprot
)
2110 * Technically, architectures with pte_special can avoid all these
2111 * restrictions (same for remap_pfn_range). However we would like
2112 * consistency in testing and feature parity among all, so we should
2113 * try to keep these invariants in place for everybody.
2115 BUG_ON(!(vma
->vm_flags
& (VM_PFNMAP
|VM_MIXEDMAP
)));
2116 BUG_ON((vma
->vm_flags
& (VM_PFNMAP
|VM_MIXEDMAP
)) ==
2117 (VM_PFNMAP
|VM_MIXEDMAP
));
2118 BUG_ON((vma
->vm_flags
& VM_PFNMAP
) && is_cow_mapping(vma
->vm_flags
));
2119 BUG_ON((vma
->vm_flags
& VM_MIXEDMAP
) && pfn_valid(pfn
));
2121 if (addr
< vma
->vm_start
|| addr
>= vma
->vm_end
)
2122 return VM_FAULT_SIGBUS
;
2124 if (!pfn_modify_allowed(pfn
, pgprot
))
2125 return VM_FAULT_SIGBUS
;
2127 track_pfn_insert(vma
, &pgprot
, __pfn_to_pfn_t(pfn
, PFN_DEV
));
2129 return insert_pfn(vma
, addr
, __pfn_to_pfn_t(pfn
, PFN_DEV
), pgprot
,
2132 EXPORT_SYMBOL(vmf_insert_pfn_prot
);
2135 * vmf_insert_pfn - insert single pfn into user vma
2136 * @vma: user vma to map to
2137 * @addr: target user address of this page
2138 * @pfn: source kernel pfn
2140 * Similar to vm_insert_page, this allows drivers to insert individual pages
2141 * they've allocated into a user vma. Same comments apply.
2143 * This function should only be called from a vm_ops->fault handler, and
2144 * in that case the handler should return the result of this function.
2146 * vma cannot be a COW mapping.
2148 * As this is called only for pages that do not currently exist, we
2149 * do not need to flush old virtual caches or the TLB.
2151 * Context: Process context. May allocate using %GFP_KERNEL.
2152 * Return: vm_fault_t value.
2154 vm_fault_t
vmf_insert_pfn(struct vm_area_struct
*vma
, unsigned long addr
,
2157 return vmf_insert_pfn_prot(vma
, addr
, pfn
, vma
->vm_page_prot
);
2159 EXPORT_SYMBOL(vmf_insert_pfn
);
2161 static bool vm_mixed_ok(struct vm_area_struct
*vma
, pfn_t pfn
)
2163 /* these checks mirror the abort conditions in vm_normal_page */
2164 if (vma
->vm_flags
& VM_MIXEDMAP
)
2166 if (pfn_t_devmap(pfn
))
2168 if (pfn_t_special(pfn
))
2170 if (is_zero_pfn(pfn_t_to_pfn(pfn
)))
2175 static vm_fault_t
__vm_insert_mixed(struct vm_area_struct
*vma
,
2176 unsigned long addr
, pfn_t pfn
, pgprot_t pgprot
,
2181 BUG_ON(!vm_mixed_ok(vma
, pfn
));
2183 if (addr
< vma
->vm_start
|| addr
>= vma
->vm_end
)
2184 return VM_FAULT_SIGBUS
;
2186 track_pfn_insert(vma
, &pgprot
, pfn
);
2188 if (!pfn_modify_allowed(pfn_t_to_pfn(pfn
), pgprot
))
2189 return VM_FAULT_SIGBUS
;
2192 * If we don't have pte special, then we have to use the pfn_valid()
2193 * based VM_MIXEDMAP scheme (see vm_normal_page), and thus we *must*
2194 * refcount the page if pfn_valid is true (hence insert_page rather
2195 * than insert_pfn). If a zero_pfn were inserted into a VM_MIXEDMAP
2196 * without pte special, it would there be refcounted as a normal page.
2198 if (!IS_ENABLED(CONFIG_ARCH_HAS_PTE_SPECIAL
) &&
2199 !pfn_t_devmap(pfn
) && pfn_t_valid(pfn
)) {
2203 * At this point we are committed to insert_page()
2204 * regardless of whether the caller specified flags that
2205 * result in pfn_t_has_page() == false.
2207 page
= pfn_to_page(pfn_t_to_pfn(pfn
));
2208 err
= insert_page(vma
, addr
, page
, pgprot
);
2210 return insert_pfn(vma
, addr
, pfn
, pgprot
, mkwrite
);
2214 return VM_FAULT_OOM
;
2215 if (err
< 0 && err
!= -EBUSY
)
2216 return VM_FAULT_SIGBUS
;
2218 return VM_FAULT_NOPAGE
;
2222 * vmf_insert_mixed_prot - insert single pfn into user vma with specified pgprot
2223 * @vma: user vma to map to
2224 * @addr: target user address of this page
2225 * @pfn: source kernel pfn
2226 * @pgprot: pgprot flags for the inserted page
2228 * This is exactly like vmf_insert_mixed(), except that it allows drivers
2229 * to override pgprot on a per-page basis.
2231 * Typically this function should be used by drivers to set caching- and
2232 * encryption bits different than those of @vma->vm_page_prot, because
2233 * the caching- or encryption mode may not be known at mmap() time.
2234 * This is ok as long as @vma->vm_page_prot is not used by the core vm
2235 * to set caching and encryption bits for those vmas (except for COW pages).
2236 * This is ensured by core vm only modifying these page table entries using
2237 * functions that don't touch caching- or encryption bits, using pte_modify()
2238 * if needed. (See for example mprotect()).
2239 * Also when new page-table entries are created, this is only done using the
2240 * fault() callback, and never using the value of vma->vm_page_prot,
2241 * except for page-table entries that point to anonymous pages as the result
2244 * Context: Process context. May allocate using %GFP_KERNEL.
2245 * Return: vm_fault_t value.
2247 vm_fault_t
vmf_insert_mixed_prot(struct vm_area_struct
*vma
, unsigned long addr
,
2248 pfn_t pfn
, pgprot_t pgprot
)
2250 return __vm_insert_mixed(vma
, addr
, pfn
, pgprot
, false);
2252 EXPORT_SYMBOL(vmf_insert_mixed_prot
);
2254 vm_fault_t
vmf_insert_mixed(struct vm_area_struct
*vma
, unsigned long addr
,
2257 return __vm_insert_mixed(vma
, addr
, pfn
, vma
->vm_page_prot
, false);
2259 EXPORT_SYMBOL(vmf_insert_mixed
);
2262 * If the insertion of PTE failed because someone else already added a
2263 * different entry in the mean time, we treat that as success as we assume
2264 * the same entry was actually inserted.
2266 vm_fault_t
vmf_insert_mixed_mkwrite(struct vm_area_struct
*vma
,
2267 unsigned long addr
, pfn_t pfn
)
2269 return __vm_insert_mixed(vma
, addr
, pfn
, vma
->vm_page_prot
, true);
2271 EXPORT_SYMBOL(vmf_insert_mixed_mkwrite
);
2274 * maps a range of physical memory into the requested pages. the old
2275 * mappings are removed. any references to nonexistent pages results
2276 * in null mappings (currently treated as "copy-on-access")
2278 static int remap_pte_range(struct mm_struct
*mm
, pmd_t
*pmd
,
2279 unsigned long addr
, unsigned long end
,
2280 unsigned long pfn
, pgprot_t prot
)
2282 pte_t
*pte
, *mapped_pte
;
2286 mapped_pte
= pte
= pte_alloc_map_lock(mm
, pmd
, addr
, &ptl
);
2289 arch_enter_lazy_mmu_mode();
2291 BUG_ON(!pte_none(*pte
));
2292 if (!pfn_modify_allowed(pfn
, prot
)) {
2296 set_pte_at(mm
, addr
, pte
, pte_mkspecial(pfn_pte(pfn
, prot
)));
2298 } while (pte
++, addr
+= PAGE_SIZE
, addr
!= end
);
2299 arch_leave_lazy_mmu_mode();
2300 pte_unmap_unlock(mapped_pte
, ptl
);
2304 static inline int remap_pmd_range(struct mm_struct
*mm
, pud_t
*pud
,
2305 unsigned long addr
, unsigned long end
,
2306 unsigned long pfn
, pgprot_t prot
)
2312 pfn
-= addr
>> PAGE_SHIFT
;
2313 pmd
= pmd_alloc(mm
, pud
, addr
);
2316 VM_BUG_ON(pmd_trans_huge(*pmd
));
2318 next
= pmd_addr_end(addr
, end
);
2319 err
= remap_pte_range(mm
, pmd
, addr
, next
,
2320 pfn
+ (addr
>> PAGE_SHIFT
), prot
);
2323 } while (pmd
++, addr
= next
, addr
!= end
);
2327 static inline int remap_pud_range(struct mm_struct
*mm
, p4d_t
*p4d
,
2328 unsigned long addr
, unsigned long end
,
2329 unsigned long pfn
, pgprot_t prot
)
2335 pfn
-= addr
>> PAGE_SHIFT
;
2336 pud
= pud_alloc(mm
, p4d
, addr
);
2340 next
= pud_addr_end(addr
, end
);
2341 err
= remap_pmd_range(mm
, pud
, addr
, next
,
2342 pfn
+ (addr
>> PAGE_SHIFT
), prot
);
2345 } while (pud
++, addr
= next
, addr
!= end
);
2349 static inline int remap_p4d_range(struct mm_struct
*mm
, pgd_t
*pgd
,
2350 unsigned long addr
, unsigned long end
,
2351 unsigned long pfn
, pgprot_t prot
)
2357 pfn
-= addr
>> PAGE_SHIFT
;
2358 p4d
= p4d_alloc(mm
, pgd
, addr
);
2362 next
= p4d_addr_end(addr
, end
);
2363 err
= remap_pud_range(mm
, p4d
, addr
, next
,
2364 pfn
+ (addr
>> PAGE_SHIFT
), prot
);
2367 } while (p4d
++, addr
= next
, addr
!= end
);
2372 * Variant of remap_pfn_range that does not call track_pfn_remap. The caller
2373 * must have pre-validated the caching bits of the pgprot_t.
2375 int remap_pfn_range_notrack(struct vm_area_struct
*vma
, unsigned long addr
,
2376 unsigned long pfn
, unsigned long size
, pgprot_t prot
)
2380 unsigned long end
= addr
+ PAGE_ALIGN(size
);
2381 struct mm_struct
*mm
= vma
->vm_mm
;
2384 if (WARN_ON_ONCE(!PAGE_ALIGNED(addr
)))
2388 * Physically remapped pages are special. Tell the
2389 * rest of the world about it:
2390 * VM_IO tells people not to look at these pages
2391 * (accesses can have side effects).
2392 * VM_PFNMAP tells the core MM that the base pages are just
2393 * raw PFN mappings, and do not have a "struct page" associated
2396 * Disable vma merging and expanding with mremap().
2398 * Omit vma from core dump, even when VM_IO turned off.
2400 * There's a horrible special case to handle copy-on-write
2401 * behaviour that some programs depend on. We mark the "original"
2402 * un-COW'ed pages by matching them up with "vma->vm_pgoff".
2403 * See vm_normal_page() for details.
2405 if (is_cow_mapping(vma
->vm_flags
)) {
2406 if (addr
!= vma
->vm_start
|| end
!= vma
->vm_end
)
2408 vma
->vm_pgoff
= pfn
;
2411 vma
->vm_flags
|= VM_IO
| VM_PFNMAP
| VM_DONTEXPAND
| VM_DONTDUMP
;
2413 BUG_ON(addr
>= end
);
2414 pfn
-= addr
>> PAGE_SHIFT
;
2415 pgd
= pgd_offset(mm
, addr
);
2416 flush_cache_range(vma
, addr
, end
);
2418 next
= pgd_addr_end(addr
, end
);
2419 err
= remap_p4d_range(mm
, pgd
, addr
, next
,
2420 pfn
+ (addr
>> PAGE_SHIFT
), prot
);
2423 } while (pgd
++, addr
= next
, addr
!= end
);
2429 * remap_pfn_range - remap kernel memory to userspace
2430 * @vma: user vma to map to
2431 * @addr: target page aligned user address to start at
2432 * @pfn: page frame number of kernel physical memory address
2433 * @size: size of mapping area
2434 * @prot: page protection flags for this mapping
2436 * Note: this is only safe if the mm semaphore is held when called.
2438 * Return: %0 on success, negative error code otherwise.
2440 int remap_pfn_range(struct vm_area_struct
*vma
, unsigned long addr
,
2441 unsigned long pfn
, unsigned long size
, pgprot_t prot
)
2445 err
= track_pfn_remap(vma
, &prot
, pfn
, addr
, PAGE_ALIGN(size
));
2449 err
= remap_pfn_range_notrack(vma
, addr
, pfn
, size
, prot
);
2451 untrack_pfn(vma
, pfn
, PAGE_ALIGN(size
));
2454 EXPORT_SYMBOL(remap_pfn_range
);
2457 * vm_iomap_memory - remap memory to userspace
2458 * @vma: user vma to map to
2459 * @start: start of the physical memory to be mapped
2460 * @len: size of area
2462 * This is a simplified io_remap_pfn_range() for common driver use. The
2463 * driver just needs to give us the physical memory range to be mapped,
2464 * we'll figure out the rest from the vma information.
2466 * NOTE! Some drivers might want to tweak vma->vm_page_prot first to get
2467 * whatever write-combining details or similar.
2469 * Return: %0 on success, negative error code otherwise.
2471 int vm_iomap_memory(struct vm_area_struct
*vma
, phys_addr_t start
, unsigned long len
)
2473 unsigned long vm_len
, pfn
, pages
;
2475 /* Check that the physical memory area passed in looks valid */
2476 if (start
+ len
< start
)
2479 * You *really* shouldn't map things that aren't page-aligned,
2480 * but we've historically allowed it because IO memory might
2481 * just have smaller alignment.
2483 len
+= start
& ~PAGE_MASK
;
2484 pfn
= start
>> PAGE_SHIFT
;
2485 pages
= (len
+ ~PAGE_MASK
) >> PAGE_SHIFT
;
2486 if (pfn
+ pages
< pfn
)
2489 /* We start the mapping 'vm_pgoff' pages into the area */
2490 if (vma
->vm_pgoff
> pages
)
2492 pfn
+= vma
->vm_pgoff
;
2493 pages
-= vma
->vm_pgoff
;
2495 /* Can we fit all of the mapping? */
2496 vm_len
= vma
->vm_end
- vma
->vm_start
;
2497 if (vm_len
>> PAGE_SHIFT
> pages
)
2500 /* Ok, let it rip */
2501 return io_remap_pfn_range(vma
, vma
->vm_start
, pfn
, vm_len
, vma
->vm_page_prot
);
2503 EXPORT_SYMBOL(vm_iomap_memory
);
2505 static int apply_to_pte_range(struct mm_struct
*mm
, pmd_t
*pmd
,
2506 unsigned long addr
, unsigned long end
,
2507 pte_fn_t fn
, void *data
, bool create
,
2508 pgtbl_mod_mask
*mask
)
2510 pte_t
*pte
, *mapped_pte
;
2515 mapped_pte
= pte
= (mm
== &init_mm
) ?
2516 pte_alloc_kernel_track(pmd
, addr
, mask
) :
2517 pte_alloc_map_lock(mm
, pmd
, addr
, &ptl
);
2521 mapped_pte
= pte
= (mm
== &init_mm
) ?
2522 pte_offset_kernel(pmd
, addr
) :
2523 pte_offset_map_lock(mm
, pmd
, addr
, &ptl
);
2526 BUG_ON(pmd_huge(*pmd
));
2528 arch_enter_lazy_mmu_mode();
2532 if (create
|| !pte_none(*pte
)) {
2533 err
= fn(pte
++, addr
, data
);
2537 } while (addr
+= PAGE_SIZE
, addr
!= end
);
2539 *mask
|= PGTBL_PTE_MODIFIED
;
2541 arch_leave_lazy_mmu_mode();
2544 pte_unmap_unlock(mapped_pte
, ptl
);
2548 static int apply_to_pmd_range(struct mm_struct
*mm
, pud_t
*pud
,
2549 unsigned long addr
, unsigned long end
,
2550 pte_fn_t fn
, void *data
, bool create
,
2551 pgtbl_mod_mask
*mask
)
2557 BUG_ON(pud_huge(*pud
));
2560 pmd
= pmd_alloc_track(mm
, pud
, addr
, mask
);
2564 pmd
= pmd_offset(pud
, addr
);
2567 next
= pmd_addr_end(addr
, end
);
2568 if (pmd_none(*pmd
) && !create
)
2570 if (WARN_ON_ONCE(pmd_leaf(*pmd
)))
2572 if (!pmd_none(*pmd
) && WARN_ON_ONCE(pmd_bad(*pmd
))) {
2577 err
= apply_to_pte_range(mm
, pmd
, addr
, next
,
2578 fn
, data
, create
, mask
);
2581 } while (pmd
++, addr
= next
, addr
!= end
);
2586 static int apply_to_pud_range(struct mm_struct
*mm
, p4d_t
*p4d
,
2587 unsigned long addr
, unsigned long end
,
2588 pte_fn_t fn
, void *data
, bool create
,
2589 pgtbl_mod_mask
*mask
)
2596 pud
= pud_alloc_track(mm
, p4d
, addr
, mask
);
2600 pud
= pud_offset(p4d
, addr
);
2603 next
= pud_addr_end(addr
, end
);
2604 if (pud_none(*pud
) && !create
)
2606 if (WARN_ON_ONCE(pud_leaf(*pud
)))
2608 if (!pud_none(*pud
) && WARN_ON_ONCE(pud_bad(*pud
))) {
2613 err
= apply_to_pmd_range(mm
, pud
, addr
, next
,
2614 fn
, data
, create
, mask
);
2617 } while (pud
++, addr
= next
, addr
!= end
);
2622 static int apply_to_p4d_range(struct mm_struct
*mm
, pgd_t
*pgd
,
2623 unsigned long addr
, unsigned long end
,
2624 pte_fn_t fn
, void *data
, bool create
,
2625 pgtbl_mod_mask
*mask
)
2632 p4d
= p4d_alloc_track(mm
, pgd
, addr
, mask
);
2636 p4d
= p4d_offset(pgd
, addr
);
2639 next
= p4d_addr_end(addr
, end
);
2640 if (p4d_none(*p4d
) && !create
)
2642 if (WARN_ON_ONCE(p4d_leaf(*p4d
)))
2644 if (!p4d_none(*p4d
) && WARN_ON_ONCE(p4d_bad(*p4d
))) {
2649 err
= apply_to_pud_range(mm
, p4d
, addr
, next
,
2650 fn
, data
, create
, mask
);
2653 } while (p4d
++, addr
= next
, addr
!= end
);
2658 static int __apply_to_page_range(struct mm_struct
*mm
, unsigned long addr
,
2659 unsigned long size
, pte_fn_t fn
,
2660 void *data
, bool create
)
2663 unsigned long start
= addr
, next
;
2664 unsigned long end
= addr
+ size
;
2665 pgtbl_mod_mask mask
= 0;
2668 if (WARN_ON(addr
>= end
))
2671 pgd
= pgd_offset(mm
, addr
);
2673 next
= pgd_addr_end(addr
, end
);
2674 if (pgd_none(*pgd
) && !create
)
2676 if (WARN_ON_ONCE(pgd_leaf(*pgd
)))
2678 if (!pgd_none(*pgd
) && WARN_ON_ONCE(pgd_bad(*pgd
))) {
2683 err
= apply_to_p4d_range(mm
, pgd
, addr
, next
,
2684 fn
, data
, create
, &mask
);
2687 } while (pgd
++, addr
= next
, addr
!= end
);
2689 if (mask
& ARCH_PAGE_TABLE_SYNC_MASK
)
2690 arch_sync_kernel_mappings(start
, start
+ size
);
2696 * Scan a region of virtual memory, filling in page tables as necessary
2697 * and calling a provided function on each leaf page table.
2699 int apply_to_page_range(struct mm_struct
*mm
, unsigned long addr
,
2700 unsigned long size
, pte_fn_t fn
, void *data
)
2702 return __apply_to_page_range(mm
, addr
, size
, fn
, data
, true);
2704 EXPORT_SYMBOL_GPL(apply_to_page_range
);
2707 * Scan a region of virtual memory, calling a provided function on
2708 * each leaf page table where it exists.
2710 * Unlike apply_to_page_range, this does _not_ fill in page tables
2711 * where they are absent.
2713 int apply_to_existing_page_range(struct mm_struct
*mm
, unsigned long addr
,
2714 unsigned long size
, pte_fn_t fn
, void *data
)
2716 return __apply_to_page_range(mm
, addr
, size
, fn
, data
, false);
2718 EXPORT_SYMBOL_GPL(apply_to_existing_page_range
);
2721 * handle_pte_fault chooses page fault handler according to an entry which was
2722 * read non-atomically. Before making any commitment, on those architectures
2723 * or configurations (e.g. i386 with PAE) which might give a mix of unmatched
2724 * parts, do_swap_page must check under lock before unmapping the pte and
2725 * proceeding (but do_wp_page is only called after already making such a check;
2726 * and do_anonymous_page can safely check later on).
2728 static inline int pte_unmap_same(struct mm_struct
*mm
, pmd_t
*pmd
,
2729 pte_t
*page_table
, pte_t orig_pte
)
2732 #if defined(CONFIG_SMP) || defined(CONFIG_PREEMPTION)
2733 if (sizeof(pte_t
) > sizeof(unsigned long)) {
2734 spinlock_t
*ptl
= pte_lockptr(mm
, pmd
);
2736 same
= pte_same(*page_table
, orig_pte
);
2740 pte_unmap(page_table
);
2744 static inline bool cow_user_page(struct page
*dst
, struct page
*src
,
2745 struct vm_fault
*vmf
)
2750 bool locked
= false;
2751 struct vm_area_struct
*vma
= vmf
->vma
;
2752 struct mm_struct
*mm
= vma
->vm_mm
;
2753 unsigned long addr
= vmf
->address
;
2756 copy_user_highpage(dst
, src
, addr
, vma
);
2761 * If the source page was a PFN mapping, we don't have
2762 * a "struct page" for it. We do a best-effort copy by
2763 * just copying from the original user address. If that
2764 * fails, we just zero-fill it. Live with it.
2766 kaddr
= kmap_atomic(dst
);
2767 uaddr
= (void __user
*)(addr
& PAGE_MASK
);
2770 * On architectures with software "accessed" bits, we would
2771 * take a double page fault, so mark it accessed here.
2773 if (arch_faults_on_old_pte() && !pte_young(vmf
->orig_pte
)) {
2776 vmf
->pte
= pte_offset_map_lock(mm
, vmf
->pmd
, addr
, &vmf
->ptl
);
2778 if (!likely(pte_same(*vmf
->pte
, vmf
->orig_pte
))) {
2780 * Other thread has already handled the fault
2781 * and update local tlb only
2783 update_mmu_tlb(vma
, addr
, vmf
->pte
);
2788 entry
= pte_mkyoung(vmf
->orig_pte
);
2789 if (ptep_set_access_flags(vma
, addr
, vmf
->pte
, entry
, 0))
2790 update_mmu_cache(vma
, addr
, vmf
->pte
);
2794 * This really shouldn't fail, because the page is there
2795 * in the page tables. But it might just be unreadable,
2796 * in which case we just give up and fill the result with
2799 if (__copy_from_user_inatomic(kaddr
, uaddr
, PAGE_SIZE
)) {
2803 /* Re-validate under PTL if the page is still mapped */
2804 vmf
->pte
= pte_offset_map_lock(mm
, vmf
->pmd
, addr
, &vmf
->ptl
);
2806 if (!likely(pte_same(*vmf
->pte
, vmf
->orig_pte
))) {
2807 /* The PTE changed under us, update local tlb */
2808 update_mmu_tlb(vma
, addr
, vmf
->pte
);
2814 * The same page can be mapped back since last copy attempt.
2815 * Try to copy again under PTL.
2817 if (__copy_from_user_inatomic(kaddr
, uaddr
, PAGE_SIZE
)) {
2819 * Give a warn in case there can be some obscure
2832 pte_unmap_unlock(vmf
->pte
, vmf
->ptl
);
2833 kunmap_atomic(kaddr
);
2834 flush_dcache_page(dst
);
2839 static gfp_t
__get_fault_gfp_mask(struct vm_area_struct
*vma
)
2841 struct file
*vm_file
= vma
->vm_file
;
2844 return mapping_gfp_mask(vm_file
->f_mapping
) | __GFP_FS
| __GFP_IO
;
2847 * Special mappings (e.g. VDSO) do not have any file so fake
2848 * a default GFP_KERNEL for them.
2854 * Notify the address space that the page is about to become writable so that
2855 * it can prohibit this or wait for the page to get into an appropriate state.
2857 * We do this without the lock held, so that it can sleep if it needs to.
2859 static vm_fault_t
do_page_mkwrite(struct vm_fault
*vmf
)
2862 struct page
*page
= vmf
->page
;
2863 unsigned int old_flags
= vmf
->flags
;
2865 vmf
->flags
= FAULT_FLAG_WRITE
|FAULT_FLAG_MKWRITE
;
2867 if (vmf
->vma
->vm_file
&&
2868 IS_SWAPFILE(vmf
->vma
->vm_file
->f_mapping
->host
))
2869 return VM_FAULT_SIGBUS
;
2871 ret
= vmf
->vma
->vm_ops
->page_mkwrite(vmf
);
2872 /* Restore original flags so that caller is not surprised */
2873 vmf
->flags
= old_flags
;
2874 if (unlikely(ret
& (VM_FAULT_ERROR
| VM_FAULT_NOPAGE
)))
2876 if (unlikely(!(ret
& VM_FAULT_LOCKED
))) {
2878 if (!page
->mapping
) {
2880 return 0; /* retry */
2882 ret
|= VM_FAULT_LOCKED
;
2884 VM_BUG_ON_PAGE(!PageLocked(page
), page
);
2889 * Handle dirtying of a page in shared file mapping on a write fault.
2891 * The function expects the page to be locked and unlocks it.
2893 static vm_fault_t
fault_dirty_shared_page(struct vm_fault
*vmf
)
2895 struct vm_area_struct
*vma
= vmf
->vma
;
2896 struct address_space
*mapping
;
2897 struct page
*page
= vmf
->page
;
2899 bool page_mkwrite
= vma
->vm_ops
&& vma
->vm_ops
->page_mkwrite
;
2901 dirtied
= set_page_dirty(page
);
2902 VM_BUG_ON_PAGE(PageAnon(page
), page
);
2904 * Take a local copy of the address_space - page.mapping may be zeroed
2905 * by truncate after unlock_page(). The address_space itself remains
2906 * pinned by vma->vm_file's reference. We rely on unlock_page()'s
2907 * release semantics to prevent the compiler from undoing this copying.
2909 mapping
= page_rmapping(page
);
2913 file_update_time(vma
->vm_file
);
2916 * Throttle page dirtying rate down to writeback speed.
2918 * mapping may be NULL here because some device drivers do not
2919 * set page.mapping but still dirty their pages
2921 * Drop the mmap_lock before waiting on IO, if we can. The file
2922 * is pinning the mapping, as per above.
2924 if ((dirtied
|| page_mkwrite
) && mapping
) {
2927 fpin
= maybe_unlock_mmap_for_io(vmf
, NULL
);
2928 balance_dirty_pages_ratelimited(mapping
);
2931 return VM_FAULT_RETRY
;
2939 * Handle write page faults for pages that can be reused in the current vma
2941 * This can happen either due to the mapping being with the VM_SHARED flag,
2942 * or due to us being the last reference standing to the page. In either
2943 * case, all we need to do here is to mark the page as writable and update
2944 * any related book-keeping.
2946 static inline void wp_page_reuse(struct vm_fault
*vmf
)
2947 __releases(vmf
->ptl
)
2949 struct vm_area_struct
*vma
= vmf
->vma
;
2950 struct page
*page
= vmf
->page
;
2953 * Clear the pages cpupid information as the existing
2954 * information potentially belongs to a now completely
2955 * unrelated process.
2958 page_cpupid_xchg_last(page
, (1 << LAST_CPUPID_SHIFT
) - 1);
2960 flush_cache_page(vma
, vmf
->address
, pte_pfn(vmf
->orig_pte
));
2961 entry
= pte_mkyoung(vmf
->orig_pte
);
2962 entry
= maybe_mkwrite(pte_mkdirty(entry
), vma
);
2963 if (ptep_set_access_flags(vma
, vmf
->address
, vmf
->pte
, entry
, 1))
2964 update_mmu_cache(vma
, vmf
->address
, vmf
->pte
);
2965 pte_unmap_unlock(vmf
->pte
, vmf
->ptl
);
2966 count_vm_event(PGREUSE
);
2970 * Handle the case of a page which we actually need to copy to a new page.
2972 * Called with mmap_lock locked and the old page referenced, but
2973 * without the ptl held.
2975 * High level logic flow:
2977 * - Allocate a page, copy the content of the old page to the new one.
2978 * - Handle book keeping and accounting - cgroups, mmu-notifiers, etc.
2979 * - Take the PTL. If the pte changed, bail out and release the allocated page
2980 * - If the pte is still the way we remember it, update the page table and all
2981 * relevant references. This includes dropping the reference the page-table
2982 * held to the old page, as well as updating the rmap.
2983 * - In any case, unlock the PTL and drop the reference we took to the old page.
2985 static vm_fault_t
wp_page_copy(struct vm_fault
*vmf
)
2987 struct vm_area_struct
*vma
= vmf
->vma
;
2988 struct mm_struct
*mm
= vma
->vm_mm
;
2989 struct page
*old_page
= vmf
->page
;
2990 struct page
*new_page
= NULL
;
2992 int page_copied
= 0;
2993 struct mmu_notifier_range range
;
2995 if (unlikely(anon_vma_prepare(vma
)))
2998 if (is_zero_pfn(pte_pfn(vmf
->orig_pte
))) {
2999 new_page
= alloc_zeroed_user_highpage_movable(vma
,
3004 new_page
= alloc_page_vma(GFP_HIGHUSER_MOVABLE
, vma
,
3009 if (!cow_user_page(new_page
, old_page
, vmf
)) {
3011 * COW failed, if the fault was solved by other,
3012 * it's fine. If not, userspace would re-fault on
3013 * the same address and we will handle the fault
3014 * from the second attempt.
3023 if (mem_cgroup_charge(new_page
, mm
, GFP_KERNEL
))
3025 cgroup_throttle_swaprate(new_page
, GFP_KERNEL
);
3027 __SetPageUptodate(new_page
);
3029 mmu_notifier_range_init(&range
, MMU_NOTIFY_CLEAR
, 0, vma
, mm
,
3030 vmf
->address
& PAGE_MASK
,
3031 (vmf
->address
& PAGE_MASK
) + PAGE_SIZE
);
3032 mmu_notifier_invalidate_range_start(&range
);
3035 * Re-check the pte - we dropped the lock
3037 vmf
->pte
= pte_offset_map_lock(mm
, vmf
->pmd
, vmf
->address
, &vmf
->ptl
);
3038 if (likely(pte_same(*vmf
->pte
, vmf
->orig_pte
))) {
3040 if (!PageAnon(old_page
)) {
3041 dec_mm_counter_fast(mm
,
3042 mm_counter_file(old_page
));
3043 inc_mm_counter_fast(mm
, MM_ANONPAGES
);
3046 inc_mm_counter_fast(mm
, MM_ANONPAGES
);
3048 flush_cache_page(vma
, vmf
->address
, pte_pfn(vmf
->orig_pte
));
3049 entry
= mk_pte(new_page
, vma
->vm_page_prot
);
3050 entry
= pte_sw_mkyoung(entry
);
3051 entry
= maybe_mkwrite(pte_mkdirty(entry
), vma
);
3054 * Clear the pte entry and flush it first, before updating the
3055 * pte with the new entry, to keep TLBs on different CPUs in
3056 * sync. This code used to set the new PTE then flush TLBs, but
3057 * that left a window where the new PTE could be loaded into
3058 * some TLBs while the old PTE remains in others.
3060 ptep_clear_flush_notify(vma
, vmf
->address
, vmf
->pte
);
3061 page_add_new_anon_rmap(new_page
, vma
, vmf
->address
, false);
3062 lru_cache_add_inactive_or_unevictable(new_page
, vma
);
3064 * We call the notify macro here because, when using secondary
3065 * mmu page tables (such as kvm shadow page tables), we want the
3066 * new page to be mapped directly into the secondary page table.
3068 set_pte_at_notify(mm
, vmf
->address
, vmf
->pte
, entry
);
3069 update_mmu_cache(vma
, vmf
->address
, vmf
->pte
);
3072 * Only after switching the pte to the new page may
3073 * we remove the mapcount here. Otherwise another
3074 * process may come and find the rmap count decremented
3075 * before the pte is switched to the new page, and
3076 * "reuse" the old page writing into it while our pte
3077 * here still points into it and can be read by other
3080 * The critical issue is to order this
3081 * page_remove_rmap with the ptp_clear_flush above.
3082 * Those stores are ordered by (if nothing else,)
3083 * the barrier present in the atomic_add_negative
3084 * in page_remove_rmap.
3086 * Then the TLB flush in ptep_clear_flush ensures that
3087 * no process can access the old page before the
3088 * decremented mapcount is visible. And the old page
3089 * cannot be reused until after the decremented
3090 * mapcount is visible. So transitively, TLBs to
3091 * old page will be flushed before it can be reused.
3093 page_remove_rmap(old_page
, false);
3096 /* Free the old page.. */
3097 new_page
= old_page
;
3100 update_mmu_tlb(vma
, vmf
->address
, vmf
->pte
);
3106 pte_unmap_unlock(vmf
->pte
, vmf
->ptl
);
3108 * No need to double call mmu_notifier->invalidate_range() callback as
3109 * the above ptep_clear_flush_notify() did already call it.
3111 mmu_notifier_invalidate_range_only_end(&range
);
3114 * Don't let another task, with possibly unlocked vma,
3115 * keep the mlocked page.
3117 if (page_copied
&& (vma
->vm_flags
& VM_LOCKED
)) {
3118 lock_page(old_page
); /* LRU manipulation */
3119 if (PageMlocked(old_page
))
3120 munlock_vma_page(old_page
);
3121 unlock_page(old_page
);
3124 free_swap_cache(old_page
);
3127 return page_copied
? VM_FAULT_WRITE
: 0;
3133 return VM_FAULT_OOM
;
3137 * finish_mkwrite_fault - finish page fault for a shared mapping, making PTE
3138 * writeable once the page is prepared
3140 * @vmf: structure describing the fault
3142 * This function handles all that is needed to finish a write page fault in a
3143 * shared mapping due to PTE being read-only once the mapped page is prepared.
3144 * It handles locking of PTE and modifying it.
3146 * The function expects the page to be locked or other protection against
3147 * concurrent faults / writeback (such as DAX radix tree locks).
3149 * Return: %0 on success, %VM_FAULT_NOPAGE when PTE got changed before
3150 * we acquired PTE lock.
3152 vm_fault_t
finish_mkwrite_fault(struct vm_fault
*vmf
)
3154 WARN_ON_ONCE(!(vmf
->vma
->vm_flags
& VM_SHARED
));
3155 vmf
->pte
= pte_offset_map_lock(vmf
->vma
->vm_mm
, vmf
->pmd
, vmf
->address
,
3158 * We might have raced with another page fault while we released the
3159 * pte_offset_map_lock.
3161 if (!pte_same(*vmf
->pte
, vmf
->orig_pte
)) {
3162 update_mmu_tlb(vmf
->vma
, vmf
->address
, vmf
->pte
);
3163 pte_unmap_unlock(vmf
->pte
, vmf
->ptl
);
3164 return VM_FAULT_NOPAGE
;
3171 * Handle write page faults for VM_MIXEDMAP or VM_PFNMAP for a VM_SHARED
3174 static vm_fault_t
wp_pfn_shared(struct vm_fault
*vmf
)
3176 struct vm_area_struct
*vma
= vmf
->vma
;
3178 if (vma
->vm_ops
&& vma
->vm_ops
->pfn_mkwrite
) {
3181 pte_unmap_unlock(vmf
->pte
, vmf
->ptl
);
3182 vmf
->flags
|= FAULT_FLAG_MKWRITE
;
3183 ret
= vma
->vm_ops
->pfn_mkwrite(vmf
);
3184 if (ret
& (VM_FAULT_ERROR
| VM_FAULT_NOPAGE
))
3186 return finish_mkwrite_fault(vmf
);
3189 return VM_FAULT_WRITE
;
3192 static vm_fault_t
wp_page_shared(struct vm_fault
*vmf
)
3193 __releases(vmf
->ptl
)
3195 struct vm_area_struct
*vma
= vmf
->vma
;
3196 vm_fault_t ret
= VM_FAULT_WRITE
;
3198 get_page(vmf
->page
);
3200 if (vma
->vm_ops
&& vma
->vm_ops
->page_mkwrite
) {
3203 pte_unmap_unlock(vmf
->pte
, vmf
->ptl
);
3204 tmp
= do_page_mkwrite(vmf
);
3205 if (unlikely(!tmp
|| (tmp
&
3206 (VM_FAULT_ERROR
| VM_FAULT_NOPAGE
)))) {
3207 put_page(vmf
->page
);
3210 tmp
= finish_mkwrite_fault(vmf
);
3211 if (unlikely(tmp
& (VM_FAULT_ERROR
| VM_FAULT_NOPAGE
))) {
3212 unlock_page(vmf
->page
);
3213 put_page(vmf
->page
);
3218 lock_page(vmf
->page
);
3220 ret
|= fault_dirty_shared_page(vmf
);
3221 put_page(vmf
->page
);
3227 * This routine handles present pages, when users try to write
3228 * to a shared page. It is done by copying the page to a new address
3229 * and decrementing the shared-page counter for the old page.
3231 * Note that this routine assumes that the protection checks have been
3232 * done by the caller (the low-level page fault routine in most cases).
3233 * Thus we can safely just mark it writable once we've done any necessary
3236 * We also mark the page dirty at this point even though the page will
3237 * change only once the write actually happens. This avoids a few races,
3238 * and potentially makes it more efficient.
3240 * We enter with non-exclusive mmap_lock (to exclude vma changes,
3241 * but allow concurrent faults), with pte both mapped and locked.
3242 * We return with mmap_lock still held, but pte unmapped and unlocked.
3244 static vm_fault_t
do_wp_page(struct vm_fault
*vmf
)
3245 __releases(vmf
->ptl
)
3247 struct vm_area_struct
*vma
= vmf
->vma
;
3249 if (userfaultfd_pte_wp(vma
, *vmf
->pte
)) {
3250 pte_unmap_unlock(vmf
->pte
, vmf
->ptl
);
3251 return handle_userfault(vmf
, VM_UFFD_WP
);
3255 * Userfaultfd write-protect can defer flushes. Ensure the TLB
3256 * is flushed in this case before copying.
3258 if (unlikely(userfaultfd_wp(vmf
->vma
) &&
3259 mm_tlb_flush_pending(vmf
->vma
->vm_mm
)))
3260 flush_tlb_page(vmf
->vma
, vmf
->address
);
3262 vmf
->page
= vm_normal_page(vma
, vmf
->address
, vmf
->orig_pte
);
3265 * VM_MIXEDMAP !pfn_valid() case, or VM_SOFTDIRTY clear on a
3268 * We should not cow pages in a shared writeable mapping.
3269 * Just mark the pages writable and/or call ops->pfn_mkwrite.
3271 if ((vma
->vm_flags
& (VM_WRITE
|VM_SHARED
)) ==
3272 (VM_WRITE
|VM_SHARED
))
3273 return wp_pfn_shared(vmf
);
3275 pte_unmap_unlock(vmf
->pte
, vmf
->ptl
);
3276 return wp_page_copy(vmf
);
3280 * Take out anonymous pages first, anonymous shared vmas are
3281 * not dirty accountable.
3283 if (PageAnon(vmf
->page
)) {
3284 struct page
*page
= vmf
->page
;
3286 /* PageKsm() doesn't necessarily raise the page refcount */
3287 if (PageKsm(page
) || page_count(page
) != 1)
3289 if (!trylock_page(page
))
3291 if (PageKsm(page
) || page_mapcount(page
) != 1 || page_count(page
) != 1) {
3296 * Ok, we've got the only map reference, and the only
3297 * page count reference, and the page is locked,
3298 * it's dark out, and we're wearing sunglasses. Hit it.
3302 return VM_FAULT_WRITE
;
3303 } else if (unlikely((vma
->vm_flags
& (VM_WRITE
|VM_SHARED
)) ==
3304 (VM_WRITE
|VM_SHARED
))) {
3305 return wp_page_shared(vmf
);
3309 * Ok, we need to copy. Oh, well..
3311 get_page(vmf
->page
);
3313 pte_unmap_unlock(vmf
->pte
, vmf
->ptl
);
3314 return wp_page_copy(vmf
);
3317 static void unmap_mapping_range_vma(struct vm_area_struct
*vma
,
3318 unsigned long start_addr
, unsigned long end_addr
,
3319 struct zap_details
*details
)
3321 zap_page_range_single(vma
, start_addr
, end_addr
- start_addr
, details
);
3324 static inline void unmap_mapping_range_tree(struct rb_root_cached
*root
,
3325 struct zap_details
*details
)
3327 struct vm_area_struct
*vma
;
3328 pgoff_t vba
, vea
, zba
, zea
;
3330 vma_interval_tree_foreach(vma
, root
,
3331 details
->first_index
, details
->last_index
) {
3333 vba
= vma
->vm_pgoff
;
3334 vea
= vba
+ vma_pages(vma
) - 1;
3335 zba
= details
->first_index
;
3338 zea
= details
->last_index
;
3342 unmap_mapping_range_vma(vma
,
3343 ((zba
- vba
) << PAGE_SHIFT
) + vma
->vm_start
,
3344 ((zea
- vba
+ 1) << PAGE_SHIFT
) + vma
->vm_start
,
3350 * unmap_mapping_page() - Unmap single page from processes.
3351 * @page: The locked page to be unmapped.
3353 * Unmap this page from any userspace process which still has it mmaped.
3354 * Typically, for efficiency, the range of nearby pages has already been
3355 * unmapped by unmap_mapping_pages() or unmap_mapping_range(). But once
3356 * truncation or invalidation holds the lock on a page, it may find that
3357 * the page has been remapped again: and then uses unmap_mapping_page()
3358 * to unmap it finally.
3360 void unmap_mapping_page(struct page
*page
)
3362 struct address_space
*mapping
= page
->mapping
;
3363 struct zap_details details
= { };
3365 VM_BUG_ON(!PageLocked(page
));
3366 VM_BUG_ON(PageTail(page
));
3368 details
.check_mapping
= mapping
;
3369 details
.first_index
= page
->index
;
3370 details
.last_index
= page
->index
+ thp_nr_pages(page
) - 1;
3371 details
.single_page
= page
;
3373 i_mmap_lock_write(mapping
);
3374 if (unlikely(!RB_EMPTY_ROOT(&mapping
->i_mmap
.rb_root
)))
3375 unmap_mapping_range_tree(&mapping
->i_mmap
, &details
);
3376 i_mmap_unlock_write(mapping
);
3380 * unmap_mapping_pages() - Unmap pages from processes.
3381 * @mapping: The address space containing pages to be unmapped.
3382 * @start: Index of first page to be unmapped.
3383 * @nr: Number of pages to be unmapped. 0 to unmap to end of file.
3384 * @even_cows: Whether to unmap even private COWed pages.
3386 * Unmap the pages in this address space from any userspace process which
3387 * has them mmaped. Generally, you want to remove COWed pages as well when
3388 * a file is being truncated, but not when invalidating pages from the page
3391 void unmap_mapping_pages(struct address_space
*mapping
, pgoff_t start
,
3392 pgoff_t nr
, bool even_cows
)
3394 struct zap_details details
= { };
3396 details
.check_mapping
= even_cows
? NULL
: mapping
;
3397 details
.first_index
= start
;
3398 details
.last_index
= start
+ nr
- 1;
3399 if (details
.last_index
< details
.first_index
)
3400 details
.last_index
= ULONG_MAX
;
3402 i_mmap_lock_write(mapping
);
3403 if (unlikely(!RB_EMPTY_ROOT(&mapping
->i_mmap
.rb_root
)))
3404 unmap_mapping_range_tree(&mapping
->i_mmap
, &details
);
3405 i_mmap_unlock_write(mapping
);
3407 EXPORT_SYMBOL_GPL(unmap_mapping_pages
);
3410 * unmap_mapping_range - unmap the portion of all mmaps in the specified
3411 * address_space corresponding to the specified byte range in the underlying
3414 * @mapping: the address space containing mmaps to be unmapped.
3415 * @holebegin: byte in first page to unmap, relative to the start of
3416 * the underlying file. This will be rounded down to a PAGE_SIZE
3417 * boundary. Note that this is different from truncate_pagecache(), which
3418 * must keep the partial page. In contrast, we must get rid of
3420 * @holelen: size of prospective hole in bytes. This will be rounded
3421 * up to a PAGE_SIZE boundary. A holelen of zero truncates to the
3423 * @even_cows: 1 when truncating a file, unmap even private COWed pages;
3424 * but 0 when invalidating pagecache, don't throw away private data.
3426 void unmap_mapping_range(struct address_space
*mapping
,
3427 loff_t
const holebegin
, loff_t
const holelen
, int even_cows
)
3429 pgoff_t hba
= holebegin
>> PAGE_SHIFT
;
3430 pgoff_t hlen
= (holelen
+ PAGE_SIZE
- 1) >> PAGE_SHIFT
;
3432 /* Check for overflow. */
3433 if (sizeof(holelen
) > sizeof(hlen
)) {
3435 (holebegin
+ holelen
+ PAGE_SIZE
- 1) >> PAGE_SHIFT
;
3436 if (holeend
& ~(long long)ULONG_MAX
)
3437 hlen
= ULONG_MAX
- hba
+ 1;
3440 unmap_mapping_pages(mapping
, hba
, hlen
, even_cows
);
3442 EXPORT_SYMBOL(unmap_mapping_range
);
3445 * Restore a potential device exclusive pte to a working pte entry
3447 static vm_fault_t
remove_device_exclusive_entry(struct vm_fault
*vmf
)
3449 struct page
*page
= vmf
->page
;
3450 struct vm_area_struct
*vma
= vmf
->vma
;
3451 struct mmu_notifier_range range
;
3453 if (!lock_page_or_retry(page
, vma
->vm_mm
, vmf
->flags
))
3454 return VM_FAULT_RETRY
;
3455 mmu_notifier_range_init_owner(&range
, MMU_NOTIFY_EXCLUSIVE
, 0, vma
,
3456 vma
->vm_mm
, vmf
->address
& PAGE_MASK
,
3457 (vmf
->address
& PAGE_MASK
) + PAGE_SIZE
, NULL
);
3458 mmu_notifier_invalidate_range_start(&range
);
3460 vmf
->pte
= pte_offset_map_lock(vma
->vm_mm
, vmf
->pmd
, vmf
->address
,
3462 if (likely(pte_same(*vmf
->pte
, vmf
->orig_pte
)))
3463 restore_exclusive_pte(vma
, page
, vmf
->address
, vmf
->pte
);
3465 pte_unmap_unlock(vmf
->pte
, vmf
->ptl
);
3468 mmu_notifier_invalidate_range_end(&range
);
3473 * We enter with non-exclusive mmap_lock (to exclude vma changes,
3474 * but allow concurrent faults), and pte mapped but not yet locked.
3475 * We return with pte unmapped and unlocked.
3477 * We return with the mmap_lock locked or unlocked in the same cases
3478 * as does filemap_fault().
3480 vm_fault_t
do_swap_page(struct vm_fault
*vmf
)
3482 struct vm_area_struct
*vma
= vmf
->vma
;
3483 struct page
*page
= NULL
, *swapcache
;
3484 struct swap_info_struct
*si
= NULL
;
3490 void *shadow
= NULL
;
3492 if (!pte_unmap_same(vma
->vm_mm
, vmf
->pmd
, vmf
->pte
, vmf
->orig_pte
))
3495 entry
= pte_to_swp_entry(vmf
->orig_pte
);
3496 if (unlikely(non_swap_entry(entry
))) {
3497 if (is_migration_entry(entry
)) {
3498 migration_entry_wait(vma
->vm_mm
, vmf
->pmd
,
3500 } else if (is_device_exclusive_entry(entry
)) {
3501 vmf
->page
= pfn_swap_entry_to_page(entry
);
3502 ret
= remove_device_exclusive_entry(vmf
);
3503 } else if (is_device_private_entry(entry
)) {
3504 vmf
->page
= pfn_swap_entry_to_page(entry
);
3505 ret
= vmf
->page
->pgmap
->ops
->migrate_to_ram(vmf
);
3506 } else if (is_hwpoison_entry(entry
)) {
3507 ret
= VM_FAULT_HWPOISON
;
3509 print_bad_pte(vma
, vmf
->address
, vmf
->orig_pte
, NULL
);
3510 ret
= VM_FAULT_SIGBUS
;
3515 /* Prevent swapoff from happening to us. */
3516 si
= get_swap_device(entry
);
3520 delayacct_set_flag(current
, DELAYACCT_PF_SWAPIN
);
3521 page
= lookup_swap_cache(entry
, vma
, vmf
->address
);
3525 if (data_race(si
->flags
& SWP_SYNCHRONOUS_IO
) &&
3526 __swap_count(entry
) == 1) {
3527 /* skip swapcache */
3528 page
= alloc_page_vma(GFP_HIGHUSER_MOVABLE
, vma
,
3531 __SetPageLocked(page
);
3532 __SetPageSwapBacked(page
);
3534 if (mem_cgroup_swapin_charge_page(page
,
3535 vma
->vm_mm
, GFP_KERNEL
, entry
)) {
3539 mem_cgroup_swapin_uncharge_swap(entry
);
3541 shadow
= get_shadow_from_swap_cache(entry
);
3543 workingset_refault(page
, shadow
);
3545 lru_cache_add(page
);
3547 /* To provide entry to swap_readpage() */
3548 set_page_private(page
, entry
.val
);
3549 swap_readpage(page
, true);
3550 set_page_private(page
, 0);
3553 page
= swapin_readahead(entry
, GFP_HIGHUSER_MOVABLE
,
3560 * Back out if somebody else faulted in this pte
3561 * while we released the pte lock.
3563 vmf
->pte
= pte_offset_map_lock(vma
->vm_mm
, vmf
->pmd
,
3564 vmf
->address
, &vmf
->ptl
);
3565 if (likely(pte_same(*vmf
->pte
, vmf
->orig_pte
)))
3567 delayacct_clear_flag(current
, DELAYACCT_PF_SWAPIN
);
3571 /* Had to read the page from swap area: Major fault */
3572 ret
= VM_FAULT_MAJOR
;
3573 count_vm_event(PGMAJFAULT
);
3574 count_memcg_event_mm(vma
->vm_mm
, PGMAJFAULT
);
3575 } else if (PageHWPoison(page
)) {
3577 * hwpoisoned dirty swapcache pages are kept for killing
3578 * owner processes (which may be unknown at hwpoison time)
3580 ret
= VM_FAULT_HWPOISON
;
3581 delayacct_clear_flag(current
, DELAYACCT_PF_SWAPIN
);
3585 locked
= lock_page_or_retry(page
, vma
->vm_mm
, vmf
->flags
);
3587 delayacct_clear_flag(current
, DELAYACCT_PF_SWAPIN
);
3589 ret
|= VM_FAULT_RETRY
;
3594 * Make sure try_to_free_swap or reuse_swap_page or swapoff did not
3595 * release the swapcache from under us. The page pin, and pte_same
3596 * test below, are not enough to exclude that. Even if it is still
3597 * swapcache, we need to check that the page's swap has not changed.
3599 if (unlikely((!PageSwapCache(page
) ||
3600 page_private(page
) != entry
.val
)) && swapcache
)
3603 page
= ksm_might_need_to_copy(page
, vma
, vmf
->address
);
3604 if (unlikely(!page
)) {
3610 cgroup_throttle_swaprate(page
, GFP_KERNEL
);
3613 * Back out if somebody else already faulted in this pte.
3615 vmf
->pte
= pte_offset_map_lock(vma
->vm_mm
, vmf
->pmd
, vmf
->address
,
3617 if (unlikely(!pte_same(*vmf
->pte
, vmf
->orig_pte
)))
3620 if (unlikely(!PageUptodate(page
))) {
3621 ret
= VM_FAULT_SIGBUS
;
3626 * The page isn't present yet, go ahead with the fault.
3628 * Be careful about the sequence of operations here.
3629 * To get its accounting right, reuse_swap_page() must be called
3630 * while the page is counted on swap but not yet in mapcount i.e.
3631 * before page_add_anon_rmap() and swap_free(); try_to_free_swap()
3632 * must be called after the swap_free(), or it will never succeed.
3635 inc_mm_counter_fast(vma
->vm_mm
, MM_ANONPAGES
);
3636 dec_mm_counter_fast(vma
->vm_mm
, MM_SWAPENTS
);
3637 pte
= mk_pte(page
, vma
->vm_page_prot
);
3638 if ((vmf
->flags
& FAULT_FLAG_WRITE
) && reuse_swap_page(page
, NULL
)) {
3639 pte
= maybe_mkwrite(pte_mkdirty(pte
), vma
);
3640 vmf
->flags
&= ~FAULT_FLAG_WRITE
;
3641 ret
|= VM_FAULT_WRITE
;
3642 exclusive
= RMAP_EXCLUSIVE
;
3644 flush_icache_page(vma
, page
);
3645 if (pte_swp_soft_dirty(vmf
->orig_pte
))
3646 pte
= pte_mksoft_dirty(pte
);
3647 if (pte_swp_uffd_wp(vmf
->orig_pte
)) {
3648 pte
= pte_mkuffd_wp(pte
);
3649 pte
= pte_wrprotect(pte
);
3651 set_pte_at(vma
->vm_mm
, vmf
->address
, vmf
->pte
, pte
);
3652 arch_do_swap_page(vma
->vm_mm
, vma
, vmf
->address
, pte
, vmf
->orig_pte
);
3653 vmf
->orig_pte
= pte
;
3655 /* ksm created a completely new copy */
3656 if (unlikely(page
!= swapcache
&& swapcache
)) {
3657 page_add_new_anon_rmap(page
, vma
, vmf
->address
, false);
3658 lru_cache_add_inactive_or_unevictable(page
, vma
);
3660 do_page_add_anon_rmap(page
, vma
, vmf
->address
, exclusive
);
3664 if (mem_cgroup_swap_full(page
) ||
3665 (vma
->vm_flags
& VM_LOCKED
) || PageMlocked(page
))
3666 try_to_free_swap(page
);
3668 if (page
!= swapcache
&& swapcache
) {
3670 * Hold the lock to avoid the swap entry to be reused
3671 * until we take the PT lock for the pte_same() check
3672 * (to avoid false positives from pte_same). For
3673 * further safety release the lock after the swap_free
3674 * so that the swap count won't change under a
3675 * parallel locked swapcache.
3677 unlock_page(swapcache
);
3678 put_page(swapcache
);
3681 if (vmf
->flags
& FAULT_FLAG_WRITE
) {
3682 ret
|= do_wp_page(vmf
);
3683 if (ret
& VM_FAULT_ERROR
)
3684 ret
&= VM_FAULT_ERROR
;
3688 /* No need to invalidate - it was non-present before */
3689 update_mmu_cache(vma
, vmf
->address
, vmf
->pte
);
3691 pte_unmap_unlock(vmf
->pte
, vmf
->ptl
);
3694 put_swap_device(si
);
3697 pte_unmap_unlock(vmf
->pte
, vmf
->ptl
);
3702 if (page
!= swapcache
&& swapcache
) {
3703 unlock_page(swapcache
);
3704 put_page(swapcache
);
3707 put_swap_device(si
);
3712 * We enter with non-exclusive mmap_lock (to exclude vma changes,
3713 * but allow concurrent faults), and pte mapped but not yet locked.
3714 * We return with mmap_lock still held, but pte unmapped and unlocked.
3716 static vm_fault_t
do_anonymous_page(struct vm_fault
*vmf
)
3718 struct vm_area_struct
*vma
= vmf
->vma
;
3723 /* File mapping without ->vm_ops ? */
3724 if (vma
->vm_flags
& VM_SHARED
)
3725 return VM_FAULT_SIGBUS
;
3728 * Use pte_alloc() instead of pte_alloc_map(). We can't run
3729 * pte_offset_map() on pmds where a huge pmd might be created
3730 * from a different thread.
3732 * pte_alloc_map() is safe to use under mmap_write_lock(mm) or when
3733 * parallel threads are excluded by other means.
3735 * Here we only have mmap_read_lock(mm).
3737 if (pte_alloc(vma
->vm_mm
, vmf
->pmd
))
3738 return VM_FAULT_OOM
;
3740 /* See comment in handle_pte_fault() */
3741 if (unlikely(pmd_trans_unstable(vmf
->pmd
)))
3744 /* Use the zero-page for reads */
3745 if (!(vmf
->flags
& FAULT_FLAG_WRITE
) &&
3746 !mm_forbids_zeropage(vma
->vm_mm
)) {
3747 entry
= pte_mkspecial(pfn_pte(my_zero_pfn(vmf
->address
),
3748 vma
->vm_page_prot
));
3749 vmf
->pte
= pte_offset_map_lock(vma
->vm_mm
, vmf
->pmd
,
3750 vmf
->address
, &vmf
->ptl
);
3751 if (!pte_none(*vmf
->pte
)) {
3752 update_mmu_tlb(vma
, vmf
->address
, vmf
->pte
);
3755 ret
= check_stable_address_space(vma
->vm_mm
);
3758 /* Deliver the page fault to userland, check inside PT lock */
3759 if (userfaultfd_missing(vma
)) {
3760 pte_unmap_unlock(vmf
->pte
, vmf
->ptl
);
3761 return handle_userfault(vmf
, VM_UFFD_MISSING
);
3766 /* Allocate our own private page. */
3767 if (unlikely(anon_vma_prepare(vma
)))
3769 page
= alloc_zeroed_user_highpage_movable(vma
, vmf
->address
);
3773 if (mem_cgroup_charge(page
, vma
->vm_mm
, GFP_KERNEL
))
3775 cgroup_throttle_swaprate(page
, GFP_KERNEL
);
3778 * The memory barrier inside __SetPageUptodate makes sure that
3779 * preceding stores to the page contents become visible before
3780 * the set_pte_at() write.
3782 __SetPageUptodate(page
);
3784 entry
= mk_pte(page
, vma
->vm_page_prot
);
3785 entry
= pte_sw_mkyoung(entry
);
3786 if (vma
->vm_flags
& VM_WRITE
)
3787 entry
= pte_mkwrite(pte_mkdirty(entry
));
3789 vmf
->pte
= pte_offset_map_lock(vma
->vm_mm
, vmf
->pmd
, vmf
->address
,
3791 if (!pte_none(*vmf
->pte
)) {
3792 update_mmu_cache(vma
, vmf
->address
, vmf
->pte
);
3796 ret
= check_stable_address_space(vma
->vm_mm
);
3800 /* Deliver the page fault to userland, check inside PT lock */
3801 if (userfaultfd_missing(vma
)) {
3802 pte_unmap_unlock(vmf
->pte
, vmf
->ptl
);
3804 return handle_userfault(vmf
, VM_UFFD_MISSING
);
3807 inc_mm_counter_fast(vma
->vm_mm
, MM_ANONPAGES
);
3808 page_add_new_anon_rmap(page
, vma
, vmf
->address
, false);
3809 lru_cache_add_inactive_or_unevictable(page
, vma
);
3811 set_pte_at(vma
->vm_mm
, vmf
->address
, vmf
->pte
, entry
);
3813 /* No need to invalidate - it was non-present before */
3814 update_mmu_cache(vma
, vmf
->address
, vmf
->pte
);
3816 pte_unmap_unlock(vmf
->pte
, vmf
->ptl
);
3824 return VM_FAULT_OOM
;
3828 * The mmap_lock must have been held on entry, and may have been
3829 * released depending on flags and vma->vm_ops->fault() return value.
3830 * See filemap_fault() and __lock_page_retry().
3832 static vm_fault_t
__do_fault(struct vm_fault
*vmf
)
3834 struct vm_area_struct
*vma
= vmf
->vma
;
3838 * Preallocate pte before we take page_lock because this might lead to
3839 * deadlocks for memcg reclaim which waits for pages under writeback:
3841 * SetPageWriteback(A)
3847 * wait_on_page_writeback(A)
3848 * SetPageWriteback(B)
3850 * # flush A, B to clear the writeback
3852 if (pmd_none(*vmf
->pmd
) && !vmf
->prealloc_pte
) {
3853 vmf
->prealloc_pte
= pte_alloc_one(vma
->vm_mm
);
3854 if (!vmf
->prealloc_pte
)
3855 return VM_FAULT_OOM
;
3856 smp_wmb(); /* See comment in __pte_alloc() */
3859 ret
= vma
->vm_ops
->fault(vmf
);
3860 if (unlikely(ret
& (VM_FAULT_ERROR
| VM_FAULT_NOPAGE
| VM_FAULT_RETRY
|
3861 VM_FAULT_DONE_COW
)))
3864 if (unlikely(PageHWPoison(vmf
->page
))) {
3865 if (ret
& VM_FAULT_LOCKED
)
3866 unlock_page(vmf
->page
);
3867 put_page(vmf
->page
);
3869 return VM_FAULT_HWPOISON
;
3872 if (unlikely(!(ret
& VM_FAULT_LOCKED
)))
3873 lock_page(vmf
->page
);
3875 VM_BUG_ON_PAGE(!PageLocked(vmf
->page
), vmf
->page
);
3880 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
3881 static void deposit_prealloc_pte(struct vm_fault
*vmf
)
3883 struct vm_area_struct
*vma
= vmf
->vma
;
3885 pgtable_trans_huge_deposit(vma
->vm_mm
, vmf
->pmd
, vmf
->prealloc_pte
);
3887 * We are going to consume the prealloc table,
3888 * count that as nr_ptes.
3890 mm_inc_nr_ptes(vma
->vm_mm
);
3891 vmf
->prealloc_pte
= NULL
;
3894 vm_fault_t
do_set_pmd(struct vm_fault
*vmf
, struct page
*page
)
3896 struct vm_area_struct
*vma
= vmf
->vma
;
3897 bool write
= vmf
->flags
& FAULT_FLAG_WRITE
;
3898 unsigned long haddr
= vmf
->address
& HPAGE_PMD_MASK
;
3901 vm_fault_t ret
= VM_FAULT_FALLBACK
;
3903 if (!transhuge_vma_suitable(vma
, haddr
))
3906 page
= compound_head(page
);
3907 if (compound_order(page
) != HPAGE_PMD_ORDER
)
3911 * Just backoff if any subpage of a THP is corrupted otherwise
3912 * the corrupted page may mapped by PMD silently to escape the
3913 * check. This kind of THP just can be PTE mapped. Access to
3914 * the corrupted subpage should trigger SIGBUS as expected.
3916 if (unlikely(PageHasHWPoisoned(page
)))
3920 * Archs like ppc64 need additional space to store information
3921 * related to pte entry. Use the preallocated table for that.
3923 if (arch_needs_pgtable_deposit() && !vmf
->prealloc_pte
) {
3924 vmf
->prealloc_pte
= pte_alloc_one(vma
->vm_mm
);
3925 if (!vmf
->prealloc_pte
)
3926 return VM_FAULT_OOM
;
3927 smp_wmb(); /* See comment in __pte_alloc() */
3930 vmf
->ptl
= pmd_lock(vma
->vm_mm
, vmf
->pmd
);
3931 if (unlikely(!pmd_none(*vmf
->pmd
)))
3934 for (i
= 0; i
< HPAGE_PMD_NR
; i
++)
3935 flush_icache_page(vma
, page
+ i
);
3937 entry
= mk_huge_pmd(page
, vma
->vm_page_prot
);
3939 entry
= maybe_pmd_mkwrite(pmd_mkdirty(entry
), vma
);
3941 add_mm_counter(vma
->vm_mm
, mm_counter_file(page
), HPAGE_PMD_NR
);
3942 page_add_file_rmap(page
, true);
3944 * deposit and withdraw with pmd lock held
3946 if (arch_needs_pgtable_deposit())
3947 deposit_prealloc_pte(vmf
);
3949 set_pmd_at(vma
->vm_mm
, haddr
, vmf
->pmd
, entry
);
3951 update_mmu_cache_pmd(vma
, haddr
, vmf
->pmd
);
3953 /* fault is handled */
3955 count_vm_event(THP_FILE_MAPPED
);
3957 spin_unlock(vmf
->ptl
);
3961 vm_fault_t
do_set_pmd(struct vm_fault
*vmf
, struct page
*page
)
3963 return VM_FAULT_FALLBACK
;
3967 void do_set_pte(struct vm_fault
*vmf
, struct page
*page
, unsigned long addr
)
3969 struct vm_area_struct
*vma
= vmf
->vma
;
3970 bool write
= vmf
->flags
& FAULT_FLAG_WRITE
;
3971 bool prefault
= vmf
->address
!= addr
;
3974 flush_icache_page(vma
, page
);
3975 entry
= mk_pte(page
, vma
->vm_page_prot
);
3977 if (prefault
&& arch_wants_old_prefaulted_pte())
3978 entry
= pte_mkold(entry
);
3980 entry
= pte_sw_mkyoung(entry
);
3983 entry
= maybe_mkwrite(pte_mkdirty(entry
), vma
);
3984 /* copy-on-write page */
3985 if (write
&& !(vma
->vm_flags
& VM_SHARED
)) {
3986 inc_mm_counter_fast(vma
->vm_mm
, MM_ANONPAGES
);
3987 page_add_new_anon_rmap(page
, vma
, addr
, false);
3988 lru_cache_add_inactive_or_unevictable(page
, vma
);
3990 inc_mm_counter_fast(vma
->vm_mm
, mm_counter_file(page
));
3991 page_add_file_rmap(page
, false);
3993 set_pte_at(vma
->vm_mm
, addr
, vmf
->pte
, entry
);
3997 * finish_fault - finish page fault once we have prepared the page to fault
3999 * @vmf: structure describing the fault
4001 * This function handles all that is needed to finish a page fault once the
4002 * page to fault in is prepared. It handles locking of PTEs, inserts PTE for
4003 * given page, adds reverse page mapping, handles memcg charges and LRU
4006 * The function expects the page to be locked and on success it consumes a
4007 * reference of a page being mapped (for the PTE which maps it).
4009 * Return: %0 on success, %VM_FAULT_ code in case of error.
4011 vm_fault_t
finish_fault(struct vm_fault
*vmf
)
4013 struct vm_area_struct
*vma
= vmf
->vma
;
4017 /* Did we COW the page? */
4018 if ((vmf
->flags
& FAULT_FLAG_WRITE
) && !(vma
->vm_flags
& VM_SHARED
))
4019 page
= vmf
->cow_page
;
4024 * check even for read faults because we might have lost our CoWed
4027 if (!(vma
->vm_flags
& VM_SHARED
)) {
4028 ret
= check_stable_address_space(vma
->vm_mm
);
4033 if (pmd_none(*vmf
->pmd
)) {
4034 if (PageTransCompound(page
)) {
4035 ret
= do_set_pmd(vmf
, page
);
4036 if (ret
!= VM_FAULT_FALLBACK
)
4040 if (vmf
->prealloc_pte
) {
4041 vmf
->ptl
= pmd_lock(vma
->vm_mm
, vmf
->pmd
);
4042 if (likely(pmd_none(*vmf
->pmd
))) {
4043 mm_inc_nr_ptes(vma
->vm_mm
);
4044 pmd_populate(vma
->vm_mm
, vmf
->pmd
, vmf
->prealloc_pte
);
4045 vmf
->prealloc_pte
= NULL
;
4047 spin_unlock(vmf
->ptl
);
4048 } else if (unlikely(pte_alloc(vma
->vm_mm
, vmf
->pmd
))) {
4049 return VM_FAULT_OOM
;
4053 /* See comment in handle_pte_fault() */
4054 if (pmd_devmap_trans_unstable(vmf
->pmd
))
4057 vmf
->pte
= pte_offset_map_lock(vma
->vm_mm
, vmf
->pmd
,
4058 vmf
->address
, &vmf
->ptl
);
4060 /* Re-check under ptl */
4061 if (likely(pte_none(*vmf
->pte
)))
4062 do_set_pte(vmf
, page
, vmf
->address
);
4064 ret
= VM_FAULT_NOPAGE
;
4066 update_mmu_tlb(vma
, vmf
->address
, vmf
->pte
);
4067 pte_unmap_unlock(vmf
->pte
, vmf
->ptl
);
4071 static unsigned long fault_around_bytes __read_mostly
=
4072 rounddown_pow_of_two(65536);
4074 #ifdef CONFIG_DEBUG_FS
4075 static int fault_around_bytes_get(void *data
, u64
*val
)
4077 *val
= fault_around_bytes
;
4082 * fault_around_bytes must be rounded down to the nearest page order as it's
4083 * what do_fault_around() expects to see.
4085 static int fault_around_bytes_set(void *data
, u64 val
)
4087 if (val
/ PAGE_SIZE
> PTRS_PER_PTE
)
4089 if (val
> PAGE_SIZE
)
4090 fault_around_bytes
= rounddown_pow_of_two(val
);
4092 fault_around_bytes
= PAGE_SIZE
; /* rounddown_pow_of_two(0) is undefined */
4095 DEFINE_DEBUGFS_ATTRIBUTE(fault_around_bytes_fops
,
4096 fault_around_bytes_get
, fault_around_bytes_set
, "%llu\n");
4098 static int __init
fault_around_debugfs(void)
4100 debugfs_create_file_unsafe("fault_around_bytes", 0644, NULL
, NULL
,
4101 &fault_around_bytes_fops
);
4104 late_initcall(fault_around_debugfs
);
4108 * do_fault_around() tries to map few pages around the fault address. The hope
4109 * is that the pages will be needed soon and this will lower the number of
4112 * It uses vm_ops->map_pages() to map the pages, which skips the page if it's
4113 * not ready to be mapped: not up-to-date, locked, etc.
4115 * This function is called with the page table lock taken. In the split ptlock
4116 * case the page table lock only protects only those entries which belong to
4117 * the page table corresponding to the fault address.
4119 * This function doesn't cross the VMA boundaries, in order to call map_pages()
4122 * fault_around_bytes defines how many bytes we'll try to map.
4123 * do_fault_around() expects it to be set to a power of two less than or equal
4126 * The virtual address of the area that we map is naturally aligned to
4127 * fault_around_bytes rounded down to the machine page size
4128 * (and therefore to page order). This way it's easier to guarantee
4129 * that we don't cross page table boundaries.
4131 static vm_fault_t
do_fault_around(struct vm_fault
*vmf
)
4133 unsigned long address
= vmf
->address
, nr_pages
, mask
;
4134 pgoff_t start_pgoff
= vmf
->pgoff
;
4138 nr_pages
= READ_ONCE(fault_around_bytes
) >> PAGE_SHIFT
;
4139 mask
= ~(nr_pages
* PAGE_SIZE
- 1) & PAGE_MASK
;
4141 address
= max(address
& mask
, vmf
->vma
->vm_start
);
4142 off
= ((vmf
->address
- address
) >> PAGE_SHIFT
) & (PTRS_PER_PTE
- 1);
4146 * end_pgoff is either the end of the page table, the end of
4147 * the vma or nr_pages from start_pgoff, depending what is nearest.
4149 end_pgoff
= start_pgoff
-
4150 ((address
>> PAGE_SHIFT
) & (PTRS_PER_PTE
- 1)) +
4152 end_pgoff
= min3(end_pgoff
, vma_pages(vmf
->vma
) + vmf
->vma
->vm_pgoff
- 1,
4153 start_pgoff
+ nr_pages
- 1);
4155 if (pmd_none(*vmf
->pmd
)) {
4156 vmf
->prealloc_pte
= pte_alloc_one(vmf
->vma
->vm_mm
);
4157 if (!vmf
->prealloc_pte
)
4158 return VM_FAULT_OOM
;
4159 smp_wmb(); /* See comment in __pte_alloc() */
4162 return vmf
->vma
->vm_ops
->map_pages(vmf
, start_pgoff
, end_pgoff
);
4165 static vm_fault_t
do_read_fault(struct vm_fault
*vmf
)
4167 struct vm_area_struct
*vma
= vmf
->vma
;
4171 * Let's call ->map_pages() first and use ->fault() as fallback
4172 * if page by the offset is not ready to be mapped (cold cache or
4175 if (vma
->vm_ops
->map_pages
&& fault_around_bytes
>> PAGE_SHIFT
> 1) {
4176 if (likely(!userfaultfd_minor(vmf
->vma
))) {
4177 ret
= do_fault_around(vmf
);
4183 ret
= __do_fault(vmf
);
4184 if (unlikely(ret
& (VM_FAULT_ERROR
| VM_FAULT_NOPAGE
| VM_FAULT_RETRY
)))
4187 ret
|= finish_fault(vmf
);
4188 unlock_page(vmf
->page
);
4189 if (unlikely(ret
& (VM_FAULT_ERROR
| VM_FAULT_NOPAGE
| VM_FAULT_RETRY
)))
4190 put_page(vmf
->page
);
4194 static vm_fault_t
do_cow_fault(struct vm_fault
*vmf
)
4196 struct vm_area_struct
*vma
= vmf
->vma
;
4199 if (unlikely(anon_vma_prepare(vma
)))
4200 return VM_FAULT_OOM
;
4202 vmf
->cow_page
= alloc_page_vma(GFP_HIGHUSER_MOVABLE
, vma
, vmf
->address
);
4204 return VM_FAULT_OOM
;
4206 if (mem_cgroup_charge(vmf
->cow_page
, vma
->vm_mm
, GFP_KERNEL
)) {
4207 put_page(vmf
->cow_page
);
4208 return VM_FAULT_OOM
;
4210 cgroup_throttle_swaprate(vmf
->cow_page
, GFP_KERNEL
);
4212 ret
= __do_fault(vmf
);
4213 if (unlikely(ret
& (VM_FAULT_ERROR
| VM_FAULT_NOPAGE
| VM_FAULT_RETRY
)))
4215 if (ret
& VM_FAULT_DONE_COW
)
4218 copy_user_highpage(vmf
->cow_page
, vmf
->page
, vmf
->address
, vma
);
4219 __SetPageUptodate(vmf
->cow_page
);
4221 ret
|= finish_fault(vmf
);
4222 unlock_page(vmf
->page
);
4223 put_page(vmf
->page
);
4224 if (unlikely(ret
& (VM_FAULT_ERROR
| VM_FAULT_NOPAGE
| VM_FAULT_RETRY
)))
4228 put_page(vmf
->cow_page
);
4232 static vm_fault_t
do_shared_fault(struct vm_fault
*vmf
)
4234 struct vm_area_struct
*vma
= vmf
->vma
;
4235 vm_fault_t ret
, tmp
;
4237 ret
= __do_fault(vmf
);
4238 if (unlikely(ret
& (VM_FAULT_ERROR
| VM_FAULT_NOPAGE
| VM_FAULT_RETRY
)))
4242 * Check if the backing address space wants to know that the page is
4243 * about to become writable
4245 if (vma
->vm_ops
->page_mkwrite
) {
4246 unlock_page(vmf
->page
);
4247 tmp
= do_page_mkwrite(vmf
);
4248 if (unlikely(!tmp
||
4249 (tmp
& (VM_FAULT_ERROR
| VM_FAULT_NOPAGE
)))) {
4250 put_page(vmf
->page
);
4255 ret
|= finish_fault(vmf
);
4256 if (unlikely(ret
& (VM_FAULT_ERROR
| VM_FAULT_NOPAGE
|
4258 unlock_page(vmf
->page
);
4259 put_page(vmf
->page
);
4263 ret
|= fault_dirty_shared_page(vmf
);
4268 * We enter with non-exclusive mmap_lock (to exclude vma changes,
4269 * but allow concurrent faults).
4270 * The mmap_lock may have been released depending on flags and our
4271 * return value. See filemap_fault() and __lock_page_or_retry().
4272 * If mmap_lock is released, vma may become invalid (for example
4273 * by other thread calling munmap()).
4275 static vm_fault_t
do_fault(struct vm_fault
*vmf
)
4277 struct vm_area_struct
*vma
= vmf
->vma
;
4278 struct mm_struct
*vm_mm
= vma
->vm_mm
;
4282 * The VMA was not fully populated on mmap() or missing VM_DONTEXPAND
4284 if (!vma
->vm_ops
->fault
) {
4286 * If we find a migration pmd entry or a none pmd entry, which
4287 * should never happen, return SIGBUS
4289 if (unlikely(!pmd_present(*vmf
->pmd
)))
4290 ret
= VM_FAULT_SIGBUS
;
4292 vmf
->pte
= pte_offset_map_lock(vmf
->vma
->vm_mm
,
4297 * Make sure this is not a temporary clearing of pte
4298 * by holding ptl and checking again. A R/M/W update
4299 * of pte involves: take ptl, clearing the pte so that
4300 * we don't have concurrent modification by hardware
4301 * followed by an update.
4303 if (unlikely(pte_none(*vmf
->pte
)))
4304 ret
= VM_FAULT_SIGBUS
;
4306 ret
= VM_FAULT_NOPAGE
;
4308 pte_unmap_unlock(vmf
->pte
, vmf
->ptl
);
4310 } else if (!(vmf
->flags
& FAULT_FLAG_WRITE
))
4311 ret
= do_read_fault(vmf
);
4312 else if (!(vma
->vm_flags
& VM_SHARED
))
4313 ret
= do_cow_fault(vmf
);
4315 ret
= do_shared_fault(vmf
);
4317 /* preallocated pagetable is unused: free it */
4318 if (vmf
->prealloc_pte
) {
4319 pte_free(vm_mm
, vmf
->prealloc_pte
);
4320 vmf
->prealloc_pte
= NULL
;
4325 int numa_migrate_prep(struct page
*page
, struct vm_area_struct
*vma
,
4326 unsigned long addr
, int page_nid
, int *flags
)
4330 count_vm_numa_event(NUMA_HINT_FAULTS
);
4331 if (page_nid
== numa_node_id()) {
4332 count_vm_numa_event(NUMA_HINT_FAULTS_LOCAL
);
4333 *flags
|= TNF_FAULT_LOCAL
;
4336 return mpol_misplaced(page
, vma
, addr
);
4339 static vm_fault_t
do_numa_page(struct vm_fault
*vmf
)
4341 struct vm_area_struct
*vma
= vmf
->vma
;
4342 struct page
*page
= NULL
;
4343 int page_nid
= NUMA_NO_NODE
;
4347 bool was_writable
= pte_savedwrite(vmf
->orig_pte
);
4351 * The "pte" at this point cannot be used safely without
4352 * validation through pte_unmap_same(). It's of NUMA type but
4353 * the pfn may be screwed if the read is non atomic.
4355 vmf
->ptl
= pte_lockptr(vma
->vm_mm
, vmf
->pmd
);
4356 spin_lock(vmf
->ptl
);
4357 if (unlikely(!pte_same(*vmf
->pte
, vmf
->orig_pte
))) {
4358 pte_unmap_unlock(vmf
->pte
, vmf
->ptl
);
4362 /* Get the normal PTE */
4363 old_pte
= ptep_get(vmf
->pte
);
4364 pte
= pte_modify(old_pte
, vma
->vm_page_prot
);
4366 page
= vm_normal_page(vma
, vmf
->address
, pte
);
4370 /* TODO: handle PTE-mapped THP */
4371 if (PageCompound(page
))
4375 * Avoid grouping on RO pages in general. RO pages shouldn't hurt as
4376 * much anyway since they can be in shared cache state. This misses
4377 * the case where a mapping is writable but the process never writes
4378 * to it but pte_write gets cleared during protection updates and
4379 * pte_dirty has unpredictable behaviour between PTE scan updates,
4380 * background writeback, dirty balancing and application behaviour.
4383 flags
|= TNF_NO_GROUP
;
4386 * Flag if the page is shared between multiple address spaces. This
4387 * is later used when determining whether to group tasks together
4389 if (page_mapcount(page
) > 1 && (vma
->vm_flags
& VM_SHARED
))
4390 flags
|= TNF_SHARED
;
4392 last_cpupid
= page_cpupid_last(page
);
4393 page_nid
= page_to_nid(page
);
4394 target_nid
= numa_migrate_prep(page
, vma
, vmf
->address
, page_nid
,
4396 if (target_nid
== NUMA_NO_NODE
) {
4400 pte_unmap_unlock(vmf
->pte
, vmf
->ptl
);
4402 /* Migrate to the requested node */
4403 if (migrate_misplaced_page(page
, vma
, target_nid
)) {
4404 page_nid
= target_nid
;
4405 flags
|= TNF_MIGRATED
;
4407 flags
|= TNF_MIGRATE_FAIL
;
4408 vmf
->pte
= pte_offset_map(vmf
->pmd
, vmf
->address
);
4409 spin_lock(vmf
->ptl
);
4410 if (unlikely(!pte_same(*vmf
->pte
, vmf
->orig_pte
))) {
4411 pte_unmap_unlock(vmf
->pte
, vmf
->ptl
);
4418 if (page_nid
!= NUMA_NO_NODE
)
4419 task_numa_fault(last_cpupid
, page_nid
, 1, flags
);
4423 * Make it present again, depending on how arch implements
4424 * non-accessible ptes, some can allow access by kernel mode.
4426 old_pte
= ptep_modify_prot_start(vma
, vmf
->address
, vmf
->pte
);
4427 pte
= pte_modify(old_pte
, vma
->vm_page_prot
);
4428 pte
= pte_mkyoung(pte
);
4430 pte
= pte_mkwrite(pte
);
4431 ptep_modify_prot_commit(vma
, vmf
->address
, vmf
->pte
, old_pte
, pte
);
4432 update_mmu_cache(vma
, vmf
->address
, vmf
->pte
);
4433 pte_unmap_unlock(vmf
->pte
, vmf
->ptl
);
4437 static inline vm_fault_t
create_huge_pmd(struct vm_fault
*vmf
)
4439 if (vma_is_anonymous(vmf
->vma
))
4440 return do_huge_pmd_anonymous_page(vmf
);
4441 if (vmf
->vma
->vm_ops
->huge_fault
)
4442 return vmf
->vma
->vm_ops
->huge_fault(vmf
, PE_SIZE_PMD
);
4443 return VM_FAULT_FALLBACK
;
4446 /* `inline' is required to avoid gcc 4.1.2 build error */
4447 static inline vm_fault_t
wp_huge_pmd(struct vm_fault
*vmf
)
4449 if (vma_is_anonymous(vmf
->vma
)) {
4450 if (userfaultfd_huge_pmd_wp(vmf
->vma
, vmf
->orig_pmd
))
4451 return handle_userfault(vmf
, VM_UFFD_WP
);
4452 return do_huge_pmd_wp_page(vmf
);
4454 if (vmf
->vma
->vm_ops
->huge_fault
) {
4455 vm_fault_t ret
= vmf
->vma
->vm_ops
->huge_fault(vmf
, PE_SIZE_PMD
);
4457 if (!(ret
& VM_FAULT_FALLBACK
))
4461 /* COW or write-notify handled on pte level: split pmd. */
4462 __split_huge_pmd(vmf
->vma
, vmf
->pmd
, vmf
->address
, false, NULL
);
4464 return VM_FAULT_FALLBACK
;
4467 static vm_fault_t
create_huge_pud(struct vm_fault
*vmf
)
4469 #if defined(CONFIG_TRANSPARENT_HUGEPAGE) && \
4470 defined(CONFIG_HAVE_ARCH_TRANSPARENT_HUGEPAGE_PUD)
4471 /* No support for anonymous transparent PUD pages yet */
4472 if (vma_is_anonymous(vmf
->vma
))
4474 if (vmf
->vma
->vm_ops
->huge_fault
) {
4475 vm_fault_t ret
= vmf
->vma
->vm_ops
->huge_fault(vmf
, PE_SIZE_PUD
);
4477 if (!(ret
& VM_FAULT_FALLBACK
))
4481 /* COW or write-notify not handled on PUD level: split pud.*/
4482 __split_huge_pud(vmf
->vma
, vmf
->pud
, vmf
->address
);
4483 #endif /* CONFIG_TRANSPARENT_HUGEPAGE */
4484 return VM_FAULT_FALLBACK
;
4487 static vm_fault_t
wp_huge_pud(struct vm_fault
*vmf
, pud_t orig_pud
)
4489 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
4490 /* No support for anonymous transparent PUD pages yet */
4491 if (vma_is_anonymous(vmf
->vma
))
4492 return VM_FAULT_FALLBACK
;
4493 if (vmf
->vma
->vm_ops
->huge_fault
)
4494 return vmf
->vma
->vm_ops
->huge_fault(vmf
, PE_SIZE_PUD
);
4495 #endif /* CONFIG_TRANSPARENT_HUGEPAGE */
4496 return VM_FAULT_FALLBACK
;
4500 * These routines also need to handle stuff like marking pages dirty
4501 * and/or accessed for architectures that don't do it in hardware (most
4502 * RISC architectures). The early dirtying is also good on the i386.
4504 * There is also a hook called "update_mmu_cache()" that architectures
4505 * with external mmu caches can use to update those (ie the Sparc or
4506 * PowerPC hashed page tables that act as extended TLBs).
4508 * We enter with non-exclusive mmap_lock (to exclude vma changes, but allow
4509 * concurrent faults).
4511 * The mmap_lock may have been released depending on flags and our return value.
4512 * See filemap_fault() and __lock_page_or_retry().
4514 static vm_fault_t
handle_pte_fault(struct vm_fault
*vmf
)
4518 if (unlikely(pmd_none(*vmf
->pmd
))) {
4520 * Leave __pte_alloc() until later: because vm_ops->fault may
4521 * want to allocate huge page, and if we expose page table
4522 * for an instant, it will be difficult to retract from
4523 * concurrent faults and from rmap lookups.
4528 * If a huge pmd materialized under us just retry later. Use
4529 * pmd_trans_unstable() via pmd_devmap_trans_unstable() instead
4530 * of pmd_trans_huge() to ensure the pmd didn't become
4531 * pmd_trans_huge under us and then back to pmd_none, as a
4532 * result of MADV_DONTNEED running immediately after a huge pmd
4533 * fault in a different thread of this mm, in turn leading to a
4534 * misleading pmd_trans_huge() retval. All we have to ensure is
4535 * that it is a regular pmd that we can walk with
4536 * pte_offset_map() and we can do that through an atomic read
4537 * in C, which is what pmd_trans_unstable() provides.
4539 if (pmd_devmap_trans_unstable(vmf
->pmd
))
4542 * A regular pmd is established and it can't morph into a huge
4543 * pmd from under us anymore at this point because we hold the
4544 * mmap_lock read mode and khugepaged takes it in write mode.
4545 * So now it's safe to run pte_offset_map().
4547 vmf
->pte
= pte_offset_map(vmf
->pmd
, vmf
->address
);
4548 vmf
->orig_pte
= *vmf
->pte
;
4551 * some architectures can have larger ptes than wordsize,
4552 * e.g.ppc44x-defconfig has CONFIG_PTE_64BIT=y and
4553 * CONFIG_32BIT=y, so READ_ONCE cannot guarantee atomic
4554 * accesses. The code below just needs a consistent view
4555 * for the ifs and we later double check anyway with the
4556 * ptl lock held. So here a barrier will do.
4559 if (pte_none(vmf
->orig_pte
)) {
4560 pte_unmap(vmf
->pte
);
4566 if (vma_is_anonymous(vmf
->vma
))
4567 return do_anonymous_page(vmf
);
4569 return do_fault(vmf
);
4572 if (!pte_present(vmf
->orig_pte
))
4573 return do_swap_page(vmf
);
4575 if (pte_protnone(vmf
->orig_pte
) && vma_is_accessible(vmf
->vma
))
4576 return do_numa_page(vmf
);
4578 vmf
->ptl
= pte_lockptr(vmf
->vma
->vm_mm
, vmf
->pmd
);
4579 spin_lock(vmf
->ptl
);
4580 entry
= vmf
->orig_pte
;
4581 if (unlikely(!pte_same(*vmf
->pte
, entry
))) {
4582 update_mmu_tlb(vmf
->vma
, vmf
->address
, vmf
->pte
);
4585 if (vmf
->flags
& FAULT_FLAG_WRITE
) {
4586 if (!pte_write(entry
))
4587 return do_wp_page(vmf
);
4588 entry
= pte_mkdirty(entry
);
4590 entry
= pte_mkyoung(entry
);
4591 if (ptep_set_access_flags(vmf
->vma
, vmf
->address
, vmf
->pte
, entry
,
4592 vmf
->flags
& FAULT_FLAG_WRITE
)) {
4593 update_mmu_cache(vmf
->vma
, vmf
->address
, vmf
->pte
);
4595 /* Skip spurious TLB flush for retried page fault */
4596 if (vmf
->flags
& FAULT_FLAG_TRIED
)
4599 * This is needed only for protection faults but the arch code
4600 * is not yet telling us if this is a protection fault or not.
4601 * This still avoids useless tlb flushes for .text page faults
4604 if (vmf
->flags
& FAULT_FLAG_WRITE
)
4605 flush_tlb_fix_spurious_fault(vmf
->vma
, vmf
->address
);
4608 pte_unmap_unlock(vmf
->pte
, vmf
->ptl
);
4613 * By the time we get here, we already hold the mm semaphore
4615 * The mmap_lock may have been released depending on flags and our
4616 * return value. See filemap_fault() and __lock_page_or_retry().
4618 static vm_fault_t
__handle_mm_fault(struct vm_area_struct
*vma
,
4619 unsigned long address
, unsigned int flags
)
4621 struct vm_fault vmf
= {
4623 .address
= address
& PAGE_MASK
,
4625 .pgoff
= linear_page_index(vma
, address
),
4626 .gfp_mask
= __get_fault_gfp_mask(vma
),
4628 unsigned int dirty
= flags
& FAULT_FLAG_WRITE
;
4629 struct mm_struct
*mm
= vma
->vm_mm
;
4634 pgd
= pgd_offset(mm
, address
);
4635 p4d
= p4d_alloc(mm
, pgd
, address
);
4637 return VM_FAULT_OOM
;
4639 vmf
.pud
= pud_alloc(mm
, p4d
, address
);
4641 return VM_FAULT_OOM
;
4643 if (pud_none(*vmf
.pud
) && __transparent_hugepage_enabled(vma
)) {
4644 ret
= create_huge_pud(&vmf
);
4645 if (!(ret
& VM_FAULT_FALLBACK
))
4648 pud_t orig_pud
= *vmf
.pud
;
4651 if (pud_trans_huge(orig_pud
) || pud_devmap(orig_pud
)) {
4653 /* NUMA case for anonymous PUDs would go here */
4655 if (dirty
&& !pud_write(orig_pud
)) {
4656 ret
= wp_huge_pud(&vmf
, orig_pud
);
4657 if (!(ret
& VM_FAULT_FALLBACK
))
4660 huge_pud_set_accessed(&vmf
, orig_pud
);
4666 vmf
.pmd
= pmd_alloc(mm
, vmf
.pud
, address
);
4668 return VM_FAULT_OOM
;
4670 /* Huge pud page fault raced with pmd_alloc? */
4671 if (pud_trans_unstable(vmf
.pud
))
4674 if (pmd_none(*vmf
.pmd
) && __transparent_hugepage_enabled(vma
)) {
4675 ret
= create_huge_pmd(&vmf
);
4676 if (!(ret
& VM_FAULT_FALLBACK
))
4679 vmf
.orig_pmd
= *vmf
.pmd
;
4682 if (unlikely(is_swap_pmd(vmf
.orig_pmd
))) {
4683 VM_BUG_ON(thp_migration_supported() &&
4684 !is_pmd_migration_entry(vmf
.orig_pmd
));
4685 if (is_pmd_migration_entry(vmf
.orig_pmd
))
4686 pmd_migration_entry_wait(mm
, vmf
.pmd
);
4689 if (pmd_trans_huge(vmf
.orig_pmd
) || pmd_devmap(vmf
.orig_pmd
)) {
4690 if (pmd_protnone(vmf
.orig_pmd
) && vma_is_accessible(vma
))
4691 return do_huge_pmd_numa_page(&vmf
);
4693 if (dirty
&& !pmd_write(vmf
.orig_pmd
)) {
4694 ret
= wp_huge_pmd(&vmf
);
4695 if (!(ret
& VM_FAULT_FALLBACK
))
4698 huge_pmd_set_accessed(&vmf
);
4704 return handle_pte_fault(&vmf
);
4708 * mm_account_fault - Do page fault accounting
4710 * @regs: the pt_regs struct pointer. When set to NULL, will skip accounting
4711 * of perf event counters, but we'll still do the per-task accounting to
4712 * the task who triggered this page fault.
4713 * @address: the faulted address.
4714 * @flags: the fault flags.
4715 * @ret: the fault retcode.
4717 * This will take care of most of the page fault accounting. Meanwhile, it
4718 * will also include the PERF_COUNT_SW_PAGE_FAULTS_[MAJ|MIN] perf counter
4719 * updates. However, note that the handling of PERF_COUNT_SW_PAGE_FAULTS should
4720 * still be in per-arch page fault handlers at the entry of page fault.
4722 static inline void mm_account_fault(struct pt_regs
*regs
,
4723 unsigned long address
, unsigned int flags
,
4729 * We don't do accounting for some specific faults:
4731 * - Unsuccessful faults (e.g. when the address wasn't valid). That
4732 * includes arch_vma_access_permitted() failing before reaching here.
4733 * So this is not a "this many hardware page faults" counter. We
4734 * should use the hw profiling for that.
4736 * - Incomplete faults (VM_FAULT_RETRY). They will only be counted
4737 * once they're completed.
4739 if (ret
& (VM_FAULT_ERROR
| VM_FAULT_RETRY
))
4743 * We define the fault as a major fault when the final successful fault
4744 * is VM_FAULT_MAJOR, or if it retried (which implies that we couldn't
4745 * handle it immediately previously).
4747 major
= (ret
& VM_FAULT_MAJOR
) || (flags
& FAULT_FLAG_TRIED
);
4755 * If the fault is done for GUP, regs will be NULL. We only do the
4756 * accounting for the per thread fault counters who triggered the
4757 * fault, and we skip the perf event updates.
4763 perf_sw_event(PERF_COUNT_SW_PAGE_FAULTS_MAJ
, 1, regs
, address
);
4765 perf_sw_event(PERF_COUNT_SW_PAGE_FAULTS_MIN
, 1, regs
, address
);
4769 * By the time we get here, we already hold the mm semaphore
4771 * The mmap_lock may have been released depending on flags and our
4772 * return value. See filemap_fault() and __lock_page_or_retry().
4774 vm_fault_t
handle_mm_fault(struct vm_area_struct
*vma
, unsigned long address
,
4775 unsigned int flags
, struct pt_regs
*regs
)
4779 __set_current_state(TASK_RUNNING
);
4781 count_vm_event(PGFAULT
);
4782 count_memcg_event_mm(vma
->vm_mm
, PGFAULT
);
4784 /* do counter updates before entering really critical section. */
4785 check_sync_rss_stat(current
);
4787 if (!arch_vma_access_permitted(vma
, flags
& FAULT_FLAG_WRITE
,
4788 flags
& FAULT_FLAG_INSTRUCTION
,
4789 flags
& FAULT_FLAG_REMOTE
))
4790 return VM_FAULT_SIGSEGV
;
4793 * Enable the memcg OOM handling for faults triggered in user
4794 * space. Kernel faults are handled more gracefully.
4796 if (flags
& FAULT_FLAG_USER
)
4797 mem_cgroup_enter_user_fault();
4799 if (unlikely(is_vm_hugetlb_page(vma
)))
4800 ret
= hugetlb_fault(vma
->vm_mm
, vma
, address
, flags
);
4802 ret
= __handle_mm_fault(vma
, address
, flags
);
4804 if (flags
& FAULT_FLAG_USER
) {
4805 mem_cgroup_exit_user_fault();
4807 * The task may have entered a memcg OOM situation but
4808 * if the allocation error was handled gracefully (no
4809 * VM_FAULT_OOM), there is no need to kill anything.
4810 * Just clean up the OOM state peacefully.
4812 if (task_in_memcg_oom(current
) && !(ret
& VM_FAULT_OOM
))
4813 mem_cgroup_oom_synchronize(false);
4816 mm_account_fault(regs
, address
, flags
, ret
);
4820 EXPORT_SYMBOL_GPL(handle_mm_fault
);
4822 #ifndef __PAGETABLE_P4D_FOLDED
4824 * Allocate p4d page table.
4825 * We've already handled the fast-path in-line.
4827 int __p4d_alloc(struct mm_struct
*mm
, pgd_t
*pgd
, unsigned long address
)
4829 p4d_t
*new = p4d_alloc_one(mm
, address
);
4833 smp_wmb(); /* See comment in __pte_alloc */
4835 spin_lock(&mm
->page_table_lock
);
4836 if (pgd_present(*pgd
)) /* Another has populated it */
4839 pgd_populate(mm
, pgd
, new);
4840 spin_unlock(&mm
->page_table_lock
);
4843 #endif /* __PAGETABLE_P4D_FOLDED */
4845 #ifndef __PAGETABLE_PUD_FOLDED
4847 * Allocate page upper directory.
4848 * We've already handled the fast-path in-line.
4850 int __pud_alloc(struct mm_struct
*mm
, p4d_t
*p4d
, unsigned long address
)
4852 pud_t
*new = pud_alloc_one(mm
, address
);
4856 smp_wmb(); /* See comment in __pte_alloc */
4858 spin_lock(&mm
->page_table_lock
);
4859 if (!p4d_present(*p4d
)) {
4861 p4d_populate(mm
, p4d
, new);
4862 } else /* Another has populated it */
4864 spin_unlock(&mm
->page_table_lock
);
4867 #endif /* __PAGETABLE_PUD_FOLDED */
4869 #ifndef __PAGETABLE_PMD_FOLDED
4871 * Allocate page middle directory.
4872 * We've already handled the fast-path in-line.
4874 int __pmd_alloc(struct mm_struct
*mm
, pud_t
*pud
, unsigned long address
)
4877 pmd_t
*new = pmd_alloc_one(mm
, address
);
4881 smp_wmb(); /* See comment in __pte_alloc */
4883 ptl
= pud_lock(mm
, pud
);
4884 if (!pud_present(*pud
)) {
4886 pud_populate(mm
, pud
, new);
4887 } else /* Another has populated it */
4892 #endif /* __PAGETABLE_PMD_FOLDED */
4894 int follow_invalidate_pte(struct mm_struct
*mm
, unsigned long address
,
4895 struct mmu_notifier_range
*range
, pte_t
**ptepp
,
4896 pmd_t
**pmdpp
, spinlock_t
**ptlp
)
4904 pgd
= pgd_offset(mm
, address
);
4905 if (pgd_none(*pgd
) || unlikely(pgd_bad(*pgd
)))
4908 p4d
= p4d_offset(pgd
, address
);
4909 if (p4d_none(*p4d
) || unlikely(p4d_bad(*p4d
)))
4912 pud
= pud_offset(p4d
, address
);
4913 if (pud_none(*pud
) || unlikely(pud_bad(*pud
)))
4916 pmd
= pmd_offset(pud
, address
);
4917 VM_BUG_ON(pmd_trans_huge(*pmd
));
4919 if (pmd_huge(*pmd
)) {
4924 mmu_notifier_range_init(range
, MMU_NOTIFY_CLEAR
, 0,
4925 NULL
, mm
, address
& PMD_MASK
,
4926 (address
& PMD_MASK
) + PMD_SIZE
);
4927 mmu_notifier_invalidate_range_start(range
);
4929 *ptlp
= pmd_lock(mm
, pmd
);
4930 if (pmd_huge(*pmd
)) {
4936 mmu_notifier_invalidate_range_end(range
);
4939 if (pmd_none(*pmd
) || unlikely(pmd_bad(*pmd
)))
4943 mmu_notifier_range_init(range
, MMU_NOTIFY_CLEAR
, 0, NULL
, mm
,
4944 address
& PAGE_MASK
,
4945 (address
& PAGE_MASK
) + PAGE_SIZE
);
4946 mmu_notifier_invalidate_range_start(range
);
4948 ptep
= pte_offset_map_lock(mm
, pmd
, address
, ptlp
);
4949 if (!pte_present(*ptep
))
4954 pte_unmap_unlock(ptep
, *ptlp
);
4956 mmu_notifier_invalidate_range_end(range
);
4962 * follow_pte - look up PTE at a user virtual address
4963 * @mm: the mm_struct of the target address space
4964 * @address: user virtual address
4965 * @ptepp: location to store found PTE
4966 * @ptlp: location to store the lock for the PTE
4968 * On a successful return, the pointer to the PTE is stored in @ptepp;
4969 * the corresponding lock is taken and its location is stored in @ptlp.
4970 * The contents of the PTE are only stable until @ptlp is released;
4971 * any further use, if any, must be protected against invalidation
4972 * with MMU notifiers.
4974 * Only IO mappings and raw PFN mappings are allowed. The mmap semaphore
4975 * should be taken for read.
4977 * KVM uses this function. While it is arguably less bad than ``follow_pfn``,
4978 * it is not a good general-purpose API.
4980 * Return: zero on success, -ve otherwise.
4982 int follow_pte(struct mm_struct
*mm
, unsigned long address
,
4983 pte_t
**ptepp
, spinlock_t
**ptlp
)
4985 return follow_invalidate_pte(mm
, address
, NULL
, ptepp
, NULL
, ptlp
);
4987 EXPORT_SYMBOL_GPL(follow_pte
);
4990 * follow_pfn - look up PFN at a user virtual address
4991 * @vma: memory mapping
4992 * @address: user virtual address
4993 * @pfn: location to store found PFN
4995 * Only IO mappings and raw PFN mappings are allowed.
4997 * This function does not allow the caller to read the permissions
4998 * of the PTE. Do not use it.
5000 * Return: zero and the pfn at @pfn on success, -ve otherwise.
5002 int follow_pfn(struct vm_area_struct
*vma
, unsigned long address
,
5009 if (!(vma
->vm_flags
& (VM_IO
| VM_PFNMAP
)))
5012 ret
= follow_pte(vma
->vm_mm
, address
, &ptep
, &ptl
);
5015 *pfn
= pte_pfn(*ptep
);
5016 pte_unmap_unlock(ptep
, ptl
);
5019 EXPORT_SYMBOL(follow_pfn
);
5021 #ifdef CONFIG_HAVE_IOREMAP_PROT
5022 int follow_phys(struct vm_area_struct
*vma
,
5023 unsigned long address
, unsigned int flags
,
5024 unsigned long *prot
, resource_size_t
*phys
)
5030 if (!(vma
->vm_flags
& (VM_IO
| VM_PFNMAP
)))
5033 if (follow_pte(vma
->vm_mm
, address
, &ptep
, &ptl
))
5037 if ((flags
& FOLL_WRITE
) && !pte_write(pte
))
5040 *prot
= pgprot_val(pte_pgprot(pte
));
5041 *phys
= (resource_size_t
)pte_pfn(pte
) << PAGE_SHIFT
;
5045 pte_unmap_unlock(ptep
, ptl
);
5051 * generic_access_phys - generic implementation for iomem mmap access
5052 * @vma: the vma to access
5053 * @addr: userspace address, not relative offset within @vma
5054 * @buf: buffer to read/write
5055 * @len: length of transfer
5056 * @write: set to FOLL_WRITE when writing, otherwise reading
5058 * This is a generic implementation for &vm_operations_struct.access for an
5059 * iomem mapping. This callback is used by access_process_vm() when the @vma is
5062 int generic_access_phys(struct vm_area_struct
*vma
, unsigned long addr
,
5063 void *buf
, int len
, int write
)
5065 resource_size_t phys_addr
;
5066 unsigned long prot
= 0;
5067 void __iomem
*maddr
;
5070 int offset
= offset_in_page(addr
);
5073 if (!(vma
->vm_flags
& (VM_IO
| VM_PFNMAP
)))
5077 if (follow_pte(vma
->vm_mm
, addr
, &ptep
, &ptl
))
5080 pte_unmap_unlock(ptep
, ptl
);
5082 prot
= pgprot_val(pte_pgprot(pte
));
5083 phys_addr
= (resource_size_t
)pte_pfn(pte
) << PAGE_SHIFT
;
5085 if ((write
& FOLL_WRITE
) && !pte_write(pte
))
5088 maddr
= ioremap_prot(phys_addr
, PAGE_ALIGN(len
+ offset
), prot
);
5092 if (follow_pte(vma
->vm_mm
, addr
, &ptep
, &ptl
))
5095 if (!pte_same(pte
, *ptep
)) {
5096 pte_unmap_unlock(ptep
, ptl
);
5103 memcpy_toio(maddr
+ offset
, buf
, len
);
5105 memcpy_fromio(buf
, maddr
+ offset
, len
);
5107 pte_unmap_unlock(ptep
, ptl
);
5113 EXPORT_SYMBOL_GPL(generic_access_phys
);
5117 * Access another process' address space as given in mm.
5119 int __access_remote_vm(struct mm_struct
*mm
, unsigned long addr
, void *buf
,
5120 int len
, unsigned int gup_flags
)
5122 struct vm_area_struct
*vma
;
5123 void *old_buf
= buf
;
5124 int write
= gup_flags
& FOLL_WRITE
;
5126 if (mmap_read_lock_killable(mm
))
5129 /* ignore errors, just check how much was successfully transferred */
5131 int bytes
, ret
, offset
;
5133 struct page
*page
= NULL
;
5135 ret
= get_user_pages_remote(mm
, addr
, 1,
5136 gup_flags
, &page
, &vma
, NULL
);
5138 #ifndef CONFIG_HAVE_IOREMAP_PROT
5142 * Check if this is a VM_IO | VM_PFNMAP VMA, which
5143 * we can access using slightly different code.
5145 vma
= vma_lookup(mm
, addr
);
5148 if (vma
->vm_ops
&& vma
->vm_ops
->access
)
5149 ret
= vma
->vm_ops
->access(vma
, addr
, buf
,
5157 offset
= addr
& (PAGE_SIZE
-1);
5158 if (bytes
> PAGE_SIZE
-offset
)
5159 bytes
= PAGE_SIZE
-offset
;
5163 copy_to_user_page(vma
, page
, addr
,
5164 maddr
+ offset
, buf
, bytes
);
5165 set_page_dirty_lock(page
);
5167 copy_from_user_page(vma
, page
, addr
,
5168 buf
, maddr
+ offset
, bytes
);
5177 mmap_read_unlock(mm
);
5179 return buf
- old_buf
;
5183 * access_remote_vm - access another process' address space
5184 * @mm: the mm_struct of the target address space
5185 * @addr: start address to access
5186 * @buf: source or destination buffer
5187 * @len: number of bytes to transfer
5188 * @gup_flags: flags modifying lookup behaviour
5190 * The caller must hold a reference on @mm.
5192 * Return: number of bytes copied from source to destination.
5194 int access_remote_vm(struct mm_struct
*mm
, unsigned long addr
,
5195 void *buf
, int len
, unsigned int gup_flags
)
5197 return __access_remote_vm(mm
, addr
, buf
, len
, gup_flags
);
5201 * Access another process' address space.
5202 * Source/target buffer must be kernel space,
5203 * Do not walk the page table directly, use get_user_pages
5205 int access_process_vm(struct task_struct
*tsk
, unsigned long addr
,
5206 void *buf
, int len
, unsigned int gup_flags
)
5208 struct mm_struct
*mm
;
5211 mm
= get_task_mm(tsk
);
5215 ret
= __access_remote_vm(mm
, addr
, buf
, len
, gup_flags
);
5221 EXPORT_SYMBOL_GPL(access_process_vm
);
5224 * Print the name of a VMA.
5226 void print_vma_addr(char *prefix
, unsigned long ip
)
5228 struct mm_struct
*mm
= current
->mm
;
5229 struct vm_area_struct
*vma
;
5232 * we might be running from an atomic context so we cannot sleep
5234 if (!mmap_read_trylock(mm
))
5237 vma
= find_vma(mm
, ip
);
5238 if (vma
&& vma
->vm_file
) {
5239 struct file
*f
= vma
->vm_file
;
5240 char *buf
= (char *)__get_free_page(GFP_NOWAIT
);
5244 p
= file_path(f
, buf
, PAGE_SIZE
);
5247 printk("%s%s[%lx+%lx]", prefix
, kbasename(p
),
5249 vma
->vm_end
- vma
->vm_start
);
5250 free_page((unsigned long)buf
);
5253 mmap_read_unlock(mm
);
5256 #if defined(CONFIG_PROVE_LOCKING) || defined(CONFIG_DEBUG_ATOMIC_SLEEP)
5257 void __might_fault(const char *file
, int line
)
5260 * Some code (nfs/sunrpc) uses socket ops on kernel memory while
5261 * holding the mmap_lock, this is safe because kernel memory doesn't
5262 * get paged out, therefore we'll never actually fault, and the
5263 * below annotations will generate false positives.
5265 if (uaccess_kernel())
5267 if (pagefault_disabled())
5269 __might_sleep(file
, line
, 0);
5270 #if defined(CONFIG_DEBUG_ATOMIC_SLEEP)
5272 might_lock_read(¤t
->mm
->mmap_lock
);
5275 EXPORT_SYMBOL(__might_fault
);
5278 #if defined(CONFIG_TRANSPARENT_HUGEPAGE) || defined(CONFIG_HUGETLBFS)
5280 * Process all subpages of the specified huge page with the specified
5281 * operation. The target subpage will be processed last to keep its
5284 static inline void process_huge_page(
5285 unsigned long addr_hint
, unsigned int pages_per_huge_page
,
5286 void (*process_subpage
)(unsigned long addr
, int idx
, void *arg
),
5290 unsigned long addr
= addr_hint
&
5291 ~(((unsigned long)pages_per_huge_page
<< PAGE_SHIFT
) - 1);
5293 /* Process target subpage last to keep its cache lines hot */
5295 n
= (addr_hint
- addr
) / PAGE_SIZE
;
5296 if (2 * n
<= pages_per_huge_page
) {
5297 /* If target subpage in first half of huge page */
5300 /* Process subpages at the end of huge page */
5301 for (i
= pages_per_huge_page
- 1; i
>= 2 * n
; i
--) {
5303 process_subpage(addr
+ i
* PAGE_SIZE
, i
, arg
);
5306 /* If target subpage in second half of huge page */
5307 base
= pages_per_huge_page
- 2 * (pages_per_huge_page
- n
);
5308 l
= pages_per_huge_page
- n
;
5309 /* Process subpages at the begin of huge page */
5310 for (i
= 0; i
< base
; i
++) {
5312 process_subpage(addr
+ i
* PAGE_SIZE
, i
, arg
);
5316 * Process remaining subpages in left-right-left-right pattern
5317 * towards the target subpage
5319 for (i
= 0; i
< l
; i
++) {
5320 int left_idx
= base
+ i
;
5321 int right_idx
= base
+ 2 * l
- 1 - i
;
5324 process_subpage(addr
+ left_idx
* PAGE_SIZE
, left_idx
, arg
);
5326 process_subpage(addr
+ right_idx
* PAGE_SIZE
, right_idx
, arg
);
5330 static void clear_gigantic_page(struct page
*page
,
5332 unsigned int pages_per_huge_page
)
5335 struct page
*p
= page
;
5338 for (i
= 0; i
< pages_per_huge_page
;
5339 i
++, p
= mem_map_next(p
, page
, i
)) {
5341 clear_user_highpage(p
, addr
+ i
* PAGE_SIZE
);
5345 static void clear_subpage(unsigned long addr
, int idx
, void *arg
)
5347 struct page
*page
= arg
;
5349 clear_user_highpage(page
+ idx
, addr
);
5352 void clear_huge_page(struct page
*page
,
5353 unsigned long addr_hint
, unsigned int pages_per_huge_page
)
5355 unsigned long addr
= addr_hint
&
5356 ~(((unsigned long)pages_per_huge_page
<< PAGE_SHIFT
) - 1);
5358 if (unlikely(pages_per_huge_page
> MAX_ORDER_NR_PAGES
)) {
5359 clear_gigantic_page(page
, addr
, pages_per_huge_page
);
5363 process_huge_page(addr_hint
, pages_per_huge_page
, clear_subpage
, page
);
5366 static void copy_user_gigantic_page(struct page
*dst
, struct page
*src
,
5368 struct vm_area_struct
*vma
,
5369 unsigned int pages_per_huge_page
)
5372 struct page
*dst_base
= dst
;
5373 struct page
*src_base
= src
;
5375 for (i
= 0; i
< pages_per_huge_page
; ) {
5377 copy_user_highpage(dst
, src
, addr
+ i
*PAGE_SIZE
, vma
);
5380 dst
= mem_map_next(dst
, dst_base
, i
);
5381 src
= mem_map_next(src
, src_base
, i
);
5385 struct copy_subpage_arg
{
5388 struct vm_area_struct
*vma
;
5391 static void copy_subpage(unsigned long addr
, int idx
, void *arg
)
5393 struct copy_subpage_arg
*copy_arg
= arg
;
5395 copy_user_highpage(copy_arg
->dst
+ idx
, copy_arg
->src
+ idx
,
5396 addr
, copy_arg
->vma
);
5399 void copy_user_huge_page(struct page
*dst
, struct page
*src
,
5400 unsigned long addr_hint
, struct vm_area_struct
*vma
,
5401 unsigned int pages_per_huge_page
)
5403 unsigned long addr
= addr_hint
&
5404 ~(((unsigned long)pages_per_huge_page
<< PAGE_SHIFT
) - 1);
5405 struct copy_subpage_arg arg
= {
5411 if (unlikely(pages_per_huge_page
> MAX_ORDER_NR_PAGES
)) {
5412 copy_user_gigantic_page(dst
, src
, addr
, vma
,
5413 pages_per_huge_page
);
5417 process_huge_page(addr_hint
, pages_per_huge_page
, copy_subpage
, &arg
);
5420 long copy_huge_page_from_user(struct page
*dst_page
,
5421 const void __user
*usr_src
,
5422 unsigned int pages_per_huge_page
,
5423 bool allow_pagefault
)
5425 void *src
= (void *)usr_src
;
5427 unsigned long i
, rc
= 0;
5428 unsigned long ret_val
= pages_per_huge_page
* PAGE_SIZE
;
5429 struct page
*subpage
= dst_page
;
5431 for (i
= 0; i
< pages_per_huge_page
;
5432 i
++, subpage
= mem_map_next(subpage
, dst_page
, i
)) {
5433 if (allow_pagefault
)
5434 page_kaddr
= kmap(subpage
);
5436 page_kaddr
= kmap_atomic(subpage
);
5437 rc
= copy_from_user(page_kaddr
,
5438 (const void __user
*)(src
+ i
* PAGE_SIZE
),
5440 if (allow_pagefault
)
5443 kunmap_atomic(page_kaddr
);
5445 ret_val
-= (PAGE_SIZE
- rc
);
5453 #endif /* CONFIG_TRANSPARENT_HUGEPAGE || CONFIG_HUGETLBFS */
5455 #if USE_SPLIT_PTE_PTLOCKS && ALLOC_SPLIT_PTLOCKS
5457 static struct kmem_cache
*page_ptl_cachep
;
5459 void __init
ptlock_cache_init(void)
5461 page_ptl_cachep
= kmem_cache_create("page->ptl", sizeof(spinlock_t
), 0,
5465 bool ptlock_alloc(struct page
*page
)
5469 ptl
= kmem_cache_alloc(page_ptl_cachep
, GFP_KERNEL
);
5476 void ptlock_free(struct page
*page
)
5478 kmem_cache_free(page_ptl_cachep
, page
->ptl
);