4 * Copyright (C) 1991, 1992, 1993, 1994 Linus Torvalds
8 * demand-loading started 01.12.91 - seems it is high on the list of
9 * things wanted, and it should be easy to implement. - Linus
13 * Ok, demand-loading was easy, shared pages a little bit tricker. Shared
14 * pages started 02.12.91, seems to work. - Linus.
16 * Tested sharing by executing about 30 /bin/sh: under the old kernel it
17 * would have taken more than the 6M I have free, but it worked well as
20 * Also corrected some "invalidate()"s - I wasn't doing enough of them.
24 * Real VM (paging to/from disk) started 18.12.91. Much more work and
25 * thought has to go into this. Oh, well..
26 * 19.12.91 - works, somewhat. Sometimes I get faults, don't know why.
27 * Found it. Everything seems to work now.
28 * 20.12.91 - Ok, making the swap-device changeable like the root.
32 * 05.04.94 - Multi-page memory management added for v1.1.
33 * Idea by Alex Bligh (alex@cconcepts.co.uk)
35 * 16.07.99 - Support of BIGMEM added by Gerhard Wichert, Siemens AG
36 * (Gerhard.Wichert@pdb.siemens.de)
38 * Aug/Sep 2004 Changed to four level page tables (Andi Kleen)
41 #include <linux/kernel_stat.h>
43 #include <linux/sched/mm.h>
44 #include <linux/sched/coredump.h>
45 #include <linux/sched/numa_balancing.h>
46 #include <linux/sched/task.h>
47 #include <linux/hugetlb.h>
48 #include <linux/mman.h>
49 #include <linux/swap.h>
50 #include <linux/highmem.h>
51 #include <linux/pagemap.h>
52 #include <linux/memremap.h>
53 #include <linux/ksm.h>
54 #include <linux/rmap.h>
55 #include <linux/export.h>
56 #include <linux/delayacct.h>
57 #include <linux/init.h>
58 #include <linux/pfn_t.h>
59 #include <linux/writeback.h>
60 #include <linux/memcontrol.h>
61 #include <linux/mmu_notifier.h>
62 #include <linux/swapops.h>
63 #include <linux/elf.h>
64 #include <linux/gfp.h>
65 #include <linux/migrate.h>
66 #include <linux/string.h>
67 #include <linux/dma-debug.h>
68 #include <linux/debugfs.h>
69 #include <linux/userfaultfd_k.h>
70 #include <linux/dax.h>
71 #include <linux/oom.h>
74 #include <asm/mmu_context.h>
75 #include <asm/pgalloc.h>
76 #include <linux/uaccess.h>
78 #include <asm/tlbflush.h>
79 #include <asm/pgtable.h>
83 #if defined(LAST_CPUPID_NOT_IN_PAGE_FLAGS) && !defined(CONFIG_COMPILE_TEST)
84 #warning Unfortunate NUMA and NUMA Balancing config, growing page-frame for last_cpupid.
87 #ifndef CONFIG_NEED_MULTIPLE_NODES
88 /* use the per-pgdat data instead for discontigmem - mbligh */
89 unsigned long max_mapnr
;
90 EXPORT_SYMBOL(max_mapnr
);
93 EXPORT_SYMBOL(mem_map
);
97 * A number of key systems in x86 including ioremap() rely on the assumption
98 * that high_memory defines the upper bound on direct map memory, then end
99 * of ZONE_NORMAL. Under CONFIG_DISCONTIG this means that max_low_pfn and
100 * highstart_pfn must be the same; there must be no gap between ZONE_NORMAL
104 EXPORT_SYMBOL(high_memory
);
107 * Randomize the address space (stacks, mmaps, brk, etc.).
109 * ( When CONFIG_COMPAT_BRK=y we exclude brk from randomization,
110 * as ancient (libc5 based) binaries can segfault. )
112 int randomize_va_space __read_mostly
=
113 #ifdef CONFIG_COMPAT_BRK
119 static int __init
disable_randmaps(char *s
)
121 randomize_va_space
= 0;
124 __setup("norandmaps", disable_randmaps
);
126 unsigned long zero_pfn __read_mostly
;
127 EXPORT_SYMBOL(zero_pfn
);
129 unsigned long highest_memmap_pfn __read_mostly
;
132 * CONFIG_MMU architectures set up ZERO_PAGE in their paging_init()
134 static int __init
init_zero_pfn(void)
136 zero_pfn
= page_to_pfn(ZERO_PAGE(0));
139 core_initcall(init_zero_pfn
);
142 #if defined(SPLIT_RSS_COUNTING)
144 void sync_mm_rss(struct mm_struct
*mm
)
148 for (i
= 0; i
< NR_MM_COUNTERS
; i
++) {
149 if (current
->rss_stat
.count
[i
]) {
150 add_mm_counter(mm
, i
, current
->rss_stat
.count
[i
]);
151 current
->rss_stat
.count
[i
] = 0;
154 current
->rss_stat
.events
= 0;
157 static void add_mm_counter_fast(struct mm_struct
*mm
, int member
, int val
)
159 struct task_struct
*task
= current
;
161 if (likely(task
->mm
== mm
))
162 task
->rss_stat
.count
[member
] += val
;
164 add_mm_counter(mm
, member
, val
);
166 #define inc_mm_counter_fast(mm, member) add_mm_counter_fast(mm, member, 1)
167 #define dec_mm_counter_fast(mm, member) add_mm_counter_fast(mm, member, -1)
169 /* sync counter once per 64 page faults */
170 #define TASK_RSS_EVENTS_THRESH (64)
171 static void check_sync_rss_stat(struct task_struct
*task
)
173 if (unlikely(task
!= current
))
175 if (unlikely(task
->rss_stat
.events
++ > TASK_RSS_EVENTS_THRESH
))
176 sync_mm_rss(task
->mm
);
178 #else /* SPLIT_RSS_COUNTING */
180 #define inc_mm_counter_fast(mm, member) inc_mm_counter(mm, member)
181 #define dec_mm_counter_fast(mm, member) dec_mm_counter(mm, member)
183 static void check_sync_rss_stat(struct task_struct
*task
)
187 #endif /* SPLIT_RSS_COUNTING */
190 * Note: this doesn't free the actual pages themselves. That
191 * has been handled earlier when unmapping all the memory regions.
193 static void free_pte_range(struct mmu_gather
*tlb
, pmd_t
*pmd
,
196 pgtable_t token
= pmd_pgtable(*pmd
);
198 pte_free_tlb(tlb
, token
, addr
);
199 mm_dec_nr_ptes(tlb
->mm
);
202 static inline void free_pmd_range(struct mmu_gather
*tlb
, pud_t
*pud
,
203 unsigned long addr
, unsigned long end
,
204 unsigned long floor
, unsigned long ceiling
)
211 pmd
= pmd_offset(pud
, addr
);
213 next
= pmd_addr_end(addr
, end
);
214 if (pmd_none_or_clear_bad(pmd
))
216 free_pte_range(tlb
, pmd
, addr
);
217 } while (pmd
++, addr
= next
, addr
!= end
);
227 if (end
- 1 > ceiling
- 1)
230 pmd
= pmd_offset(pud
, start
);
232 pmd_free_tlb(tlb
, pmd
, start
);
233 mm_dec_nr_pmds(tlb
->mm
);
236 static inline void free_pud_range(struct mmu_gather
*tlb
, p4d_t
*p4d
,
237 unsigned long addr
, unsigned long end
,
238 unsigned long floor
, unsigned long ceiling
)
245 pud
= pud_offset(p4d
, addr
);
247 next
= pud_addr_end(addr
, end
);
248 if (pud_none_or_clear_bad(pud
))
250 free_pmd_range(tlb
, pud
, addr
, next
, floor
, ceiling
);
251 } while (pud
++, addr
= next
, addr
!= end
);
261 if (end
- 1 > ceiling
- 1)
264 pud
= pud_offset(p4d
, start
);
266 pud_free_tlb(tlb
, pud
, start
);
267 mm_dec_nr_puds(tlb
->mm
);
270 static inline void free_p4d_range(struct mmu_gather
*tlb
, pgd_t
*pgd
,
271 unsigned long addr
, unsigned long end
,
272 unsigned long floor
, unsigned long ceiling
)
279 p4d
= p4d_offset(pgd
, addr
);
281 next
= p4d_addr_end(addr
, end
);
282 if (p4d_none_or_clear_bad(p4d
))
284 free_pud_range(tlb
, p4d
, addr
, next
, floor
, ceiling
);
285 } while (p4d
++, addr
= next
, addr
!= end
);
291 ceiling
&= PGDIR_MASK
;
295 if (end
- 1 > ceiling
- 1)
298 p4d
= p4d_offset(pgd
, start
);
300 p4d_free_tlb(tlb
, p4d
, start
);
304 * This function frees user-level page tables of a process.
306 void free_pgd_range(struct mmu_gather
*tlb
,
307 unsigned long addr
, unsigned long end
,
308 unsigned long floor
, unsigned long ceiling
)
314 * The next few lines have given us lots of grief...
316 * Why are we testing PMD* at this top level? Because often
317 * there will be no work to do at all, and we'd prefer not to
318 * go all the way down to the bottom just to discover that.
320 * Why all these "- 1"s? Because 0 represents both the bottom
321 * of the address space and the top of it (using -1 for the
322 * top wouldn't help much: the masks would do the wrong thing).
323 * The rule is that addr 0 and floor 0 refer to the bottom of
324 * the address space, but end 0 and ceiling 0 refer to the top
325 * Comparisons need to use "end - 1" and "ceiling - 1" (though
326 * that end 0 case should be mythical).
328 * Wherever addr is brought up or ceiling brought down, we must
329 * be careful to reject "the opposite 0" before it confuses the
330 * subsequent tests. But what about where end is brought down
331 * by PMD_SIZE below? no, end can't go down to 0 there.
333 * Whereas we round start (addr) and ceiling down, by different
334 * masks at different levels, in order to test whether a table
335 * now has no other vmas using it, so can be freed, we don't
336 * bother to round floor or end up - the tests don't need that.
350 if (end
- 1 > ceiling
- 1)
355 * We add page table cache pages with PAGE_SIZE,
356 * (see pte_free_tlb()), flush the tlb if we need
358 tlb_remove_check_page_size_change(tlb
, PAGE_SIZE
);
359 pgd
= pgd_offset(tlb
->mm
, addr
);
361 next
= pgd_addr_end(addr
, end
);
362 if (pgd_none_or_clear_bad(pgd
))
364 free_p4d_range(tlb
, pgd
, addr
, next
, floor
, ceiling
);
365 } while (pgd
++, addr
= next
, addr
!= end
);
368 void free_pgtables(struct mmu_gather
*tlb
, struct vm_area_struct
*vma
,
369 unsigned long floor
, unsigned long ceiling
)
372 struct vm_area_struct
*next
= vma
->vm_next
;
373 unsigned long addr
= vma
->vm_start
;
376 * Hide vma from rmap and truncate_pagecache before freeing
379 unlink_anon_vmas(vma
);
380 unlink_file_vma(vma
);
382 if (is_vm_hugetlb_page(vma
)) {
383 hugetlb_free_pgd_range(tlb
, addr
, vma
->vm_end
,
384 floor
, next
? next
->vm_start
: ceiling
);
387 * Optimization: gather nearby vmas into one call down
389 while (next
&& next
->vm_start
<= vma
->vm_end
+ PMD_SIZE
390 && !is_vm_hugetlb_page(next
)) {
393 unlink_anon_vmas(vma
);
394 unlink_file_vma(vma
);
396 free_pgd_range(tlb
, addr
, vma
->vm_end
,
397 floor
, next
? next
->vm_start
: ceiling
);
403 int __pte_alloc(struct mm_struct
*mm
, pmd_t
*pmd
, unsigned long address
)
406 pgtable_t
new = pte_alloc_one(mm
, address
);
411 * Ensure all pte setup (eg. pte page lock and page clearing) are
412 * visible before the pte is made visible to other CPUs by being
413 * put into page tables.
415 * The other side of the story is the pointer chasing in the page
416 * table walking code (when walking the page table without locking;
417 * ie. most of the time). Fortunately, these data accesses consist
418 * of a chain of data-dependent loads, meaning most CPUs (alpha
419 * being the notable exception) will already guarantee loads are
420 * seen in-order. See the alpha page table accessors for the
421 * smp_read_barrier_depends() barriers in page table walking code.
423 smp_wmb(); /* Could be smp_wmb__xxx(before|after)_spin_lock */
425 ptl
= pmd_lock(mm
, pmd
);
426 if (likely(pmd_none(*pmd
))) { /* Has another populated it ? */
428 pmd_populate(mm
, pmd
, new);
437 int __pte_alloc_kernel(pmd_t
*pmd
, unsigned long address
)
439 pte_t
*new = pte_alloc_one_kernel(&init_mm
, address
);
443 smp_wmb(); /* See comment in __pte_alloc */
445 spin_lock(&init_mm
.page_table_lock
);
446 if (likely(pmd_none(*pmd
))) { /* Has another populated it ? */
447 pmd_populate_kernel(&init_mm
, pmd
, new);
450 spin_unlock(&init_mm
.page_table_lock
);
452 pte_free_kernel(&init_mm
, new);
456 static inline void init_rss_vec(int *rss
)
458 memset(rss
, 0, sizeof(int) * NR_MM_COUNTERS
);
461 static inline void add_mm_rss_vec(struct mm_struct
*mm
, int *rss
)
465 if (current
->mm
== mm
)
467 for (i
= 0; i
< NR_MM_COUNTERS
; i
++)
469 add_mm_counter(mm
, i
, rss
[i
]);
473 * This function is called to print an error when a bad pte
474 * is found. For example, we might have a PFN-mapped pte in
475 * a region that doesn't allow it.
477 * The calling function must still handle the error.
479 static void print_bad_pte(struct vm_area_struct
*vma
, unsigned long addr
,
480 pte_t pte
, struct page
*page
)
482 pgd_t
*pgd
= pgd_offset(vma
->vm_mm
, addr
);
483 p4d_t
*p4d
= p4d_offset(pgd
, addr
);
484 pud_t
*pud
= pud_offset(p4d
, addr
);
485 pmd_t
*pmd
= pmd_offset(pud
, addr
);
486 struct address_space
*mapping
;
488 static unsigned long resume
;
489 static unsigned long nr_shown
;
490 static unsigned long nr_unshown
;
493 * Allow a burst of 60 reports, then keep quiet for that minute;
494 * or allow a steady drip of one report per second.
496 if (nr_shown
== 60) {
497 if (time_before(jiffies
, resume
)) {
502 pr_alert("BUG: Bad page map: %lu messages suppressed\n",
509 resume
= jiffies
+ 60 * HZ
;
511 mapping
= vma
->vm_file
? vma
->vm_file
->f_mapping
: NULL
;
512 index
= linear_page_index(vma
, addr
);
514 pr_alert("BUG: Bad page map in process %s pte:%08llx pmd:%08llx\n",
516 (long long)pte_val(pte
), (long long)pmd_val(*pmd
));
518 dump_page(page
, "bad pte");
519 pr_alert("addr:%p vm_flags:%08lx anon_vma:%p mapping:%p index:%lx\n",
520 (void *)addr
, vma
->vm_flags
, vma
->anon_vma
, mapping
, index
);
521 pr_alert("file:%pD fault:%pf mmap:%pf readpage:%pf\n",
523 vma
->vm_ops
? vma
->vm_ops
->fault
: NULL
,
524 vma
->vm_file
? vma
->vm_file
->f_op
->mmap
: NULL
,
525 mapping
? mapping
->a_ops
->readpage
: NULL
);
527 add_taint(TAINT_BAD_PAGE
, LOCKDEP_NOW_UNRELIABLE
);
531 * vm_normal_page -- This function gets the "struct page" associated with a pte.
533 * "Special" mappings do not wish to be associated with a "struct page" (either
534 * it doesn't exist, or it exists but they don't want to touch it). In this
535 * case, NULL is returned here. "Normal" mappings do have a struct page.
537 * There are 2 broad cases. Firstly, an architecture may define a pte_special()
538 * pte bit, in which case this function is trivial. Secondly, an architecture
539 * may not have a spare pte bit, which requires a more complicated scheme,
542 * A raw VM_PFNMAP mapping (ie. one that is not COWed) is always considered a
543 * special mapping (even if there are underlying and valid "struct pages").
544 * COWed pages of a VM_PFNMAP are always normal.
546 * The way we recognize COWed pages within VM_PFNMAP mappings is through the
547 * rules set up by "remap_pfn_range()": the vma will have the VM_PFNMAP bit
548 * set, and the vm_pgoff will point to the first PFN mapped: thus every special
549 * mapping will always honor the rule
551 * pfn_of_page == vma->vm_pgoff + ((addr - vma->vm_start) >> PAGE_SHIFT)
553 * And for normal mappings this is false.
555 * This restricts such mappings to be a linear translation from virtual address
556 * to pfn. To get around this restriction, we allow arbitrary mappings so long
557 * as the vma is not a COW mapping; in that case, we know that all ptes are
558 * special (because none can have been COWed).
561 * In order to support COW of arbitrary special mappings, we have VM_MIXEDMAP.
563 * VM_MIXEDMAP mappings can likewise contain memory with or without "struct
564 * page" backing, however the difference is that _all_ pages with a struct
565 * page (that is, those where pfn_valid is true) are refcounted and considered
566 * normal pages by the VM. The disadvantage is that pages are refcounted
567 * (which can be slower and simply not an option for some PFNMAP users). The
568 * advantage is that we don't have to follow the strict linearity rule of
569 * PFNMAP mappings in order to support COWable mappings.
572 struct page
*_vm_normal_page(struct vm_area_struct
*vma
, unsigned long addr
,
573 pte_t pte
, bool with_public_device
)
575 unsigned long pfn
= pte_pfn(pte
);
577 if (IS_ENABLED(CONFIG_ARCH_HAS_PTE_SPECIAL
)) {
578 if (likely(!pte_special(pte
)))
580 if (vma
->vm_ops
&& vma
->vm_ops
->find_special_page
)
581 return vma
->vm_ops
->find_special_page(vma
, addr
);
582 if (vma
->vm_flags
& (VM_PFNMAP
| VM_MIXEDMAP
))
584 if (is_zero_pfn(pfn
))
588 * Device public pages are special pages (they are ZONE_DEVICE
589 * pages but different from persistent memory). They behave
590 * allmost like normal pages. The difference is that they are
591 * not on the lru and thus should never be involve with any-
592 * thing that involve lru manipulation (mlock, numa balancing,
595 * This is why we still want to return NULL for such page from
596 * vm_normal_page() so that we do not have to special case all
597 * call site of vm_normal_page().
599 if (likely(pfn
<= highest_memmap_pfn
)) {
600 struct page
*page
= pfn_to_page(pfn
);
602 if (is_device_public_page(page
)) {
603 if (with_public_device
)
612 print_bad_pte(vma
, addr
, pte
, NULL
);
616 /* !CONFIG_ARCH_HAS_PTE_SPECIAL case follows: */
618 if (unlikely(vma
->vm_flags
& (VM_PFNMAP
|VM_MIXEDMAP
))) {
619 if (vma
->vm_flags
& VM_MIXEDMAP
) {
625 off
= (addr
- vma
->vm_start
) >> PAGE_SHIFT
;
626 if (pfn
== vma
->vm_pgoff
+ off
)
628 if (!is_cow_mapping(vma
->vm_flags
))
633 if (is_zero_pfn(pfn
))
637 if (unlikely(pfn
> highest_memmap_pfn
)) {
638 print_bad_pte(vma
, addr
, pte
, NULL
);
643 * NOTE! We still have PageReserved() pages in the page tables.
644 * eg. VDSO mappings can cause them to exist.
647 return pfn_to_page(pfn
);
650 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
651 struct page
*vm_normal_page_pmd(struct vm_area_struct
*vma
, unsigned long addr
,
654 unsigned long pfn
= pmd_pfn(pmd
);
657 * There is no pmd_special() but there may be special pmds, e.g.
658 * in a direct-access (dax) mapping, so let's just replicate the
659 * !CONFIG_ARCH_HAS_PTE_SPECIAL case from vm_normal_page() here.
661 if (unlikely(vma
->vm_flags
& (VM_PFNMAP
|VM_MIXEDMAP
))) {
662 if (vma
->vm_flags
& VM_MIXEDMAP
) {
668 off
= (addr
- vma
->vm_start
) >> PAGE_SHIFT
;
669 if (pfn
== vma
->vm_pgoff
+ off
)
671 if (!is_cow_mapping(vma
->vm_flags
))
678 if (is_zero_pfn(pfn
))
680 if (unlikely(pfn
> highest_memmap_pfn
))
684 * NOTE! We still have PageReserved() pages in the page tables.
685 * eg. VDSO mappings can cause them to exist.
688 return pfn_to_page(pfn
);
693 * copy one vm_area from one task to the other. Assumes the page tables
694 * already present in the new task to be cleared in the whole range
695 * covered by this vma.
698 static inline unsigned long
699 copy_one_pte(struct mm_struct
*dst_mm
, struct mm_struct
*src_mm
,
700 pte_t
*dst_pte
, pte_t
*src_pte
, struct vm_area_struct
*vma
,
701 unsigned long addr
, int *rss
)
703 unsigned long vm_flags
= vma
->vm_flags
;
704 pte_t pte
= *src_pte
;
707 /* pte contains position in swap or file, so copy. */
708 if (unlikely(!pte_present(pte
))) {
709 swp_entry_t entry
= pte_to_swp_entry(pte
);
711 if (likely(!non_swap_entry(entry
))) {
712 if (swap_duplicate(entry
) < 0)
715 /* make sure dst_mm is on swapoff's mmlist. */
716 if (unlikely(list_empty(&dst_mm
->mmlist
))) {
717 spin_lock(&mmlist_lock
);
718 if (list_empty(&dst_mm
->mmlist
))
719 list_add(&dst_mm
->mmlist
,
721 spin_unlock(&mmlist_lock
);
724 } else if (is_migration_entry(entry
)) {
725 page
= migration_entry_to_page(entry
);
727 rss
[mm_counter(page
)]++;
729 if (is_write_migration_entry(entry
) &&
730 is_cow_mapping(vm_flags
)) {
732 * COW mappings require pages in both
733 * parent and child to be set to read.
735 make_migration_entry_read(&entry
);
736 pte
= swp_entry_to_pte(entry
);
737 if (pte_swp_soft_dirty(*src_pte
))
738 pte
= pte_swp_mksoft_dirty(pte
);
739 set_pte_at(src_mm
, addr
, src_pte
, pte
);
741 } else if (is_device_private_entry(entry
)) {
742 page
= device_private_entry_to_page(entry
);
745 * Update rss count even for unaddressable pages, as
746 * they should treated just like normal pages in this
749 * We will likely want to have some new rss counters
750 * for unaddressable pages, at some point. But for now
751 * keep things as they are.
754 rss
[mm_counter(page
)]++;
755 page_dup_rmap(page
, false);
758 * We do not preserve soft-dirty information, because so
759 * far, checkpoint/restore is the only feature that
760 * requires that. And checkpoint/restore does not work
761 * when a device driver is involved (you cannot easily
762 * save and restore device driver state).
764 if (is_write_device_private_entry(entry
) &&
765 is_cow_mapping(vm_flags
)) {
766 make_device_private_entry_read(&entry
);
767 pte
= swp_entry_to_pte(entry
);
768 set_pte_at(src_mm
, addr
, src_pte
, pte
);
775 * If it's a COW mapping, write protect it both
776 * in the parent and the child
778 if (is_cow_mapping(vm_flags
) && pte_write(pte
)) {
779 ptep_set_wrprotect(src_mm
, addr
, src_pte
);
780 pte
= pte_wrprotect(pte
);
784 * If it's a shared mapping, mark it clean in
787 if (vm_flags
& VM_SHARED
)
788 pte
= pte_mkclean(pte
);
789 pte
= pte_mkold(pte
);
791 page
= vm_normal_page(vma
, addr
, pte
);
794 page_dup_rmap(page
, false);
795 rss
[mm_counter(page
)]++;
796 } else if (pte_devmap(pte
)) {
797 page
= pte_page(pte
);
800 * Cache coherent device memory behave like regular page and
801 * not like persistent memory page. For more informations see
802 * MEMORY_DEVICE_CACHE_COHERENT in memory_hotplug.h
804 if (is_device_public_page(page
)) {
806 page_dup_rmap(page
, false);
807 rss
[mm_counter(page
)]++;
812 set_pte_at(dst_mm
, addr
, dst_pte
, pte
);
816 static int copy_pte_range(struct mm_struct
*dst_mm
, struct mm_struct
*src_mm
,
817 pmd_t
*dst_pmd
, pmd_t
*src_pmd
, struct vm_area_struct
*vma
,
818 unsigned long addr
, unsigned long end
)
820 pte_t
*orig_src_pte
, *orig_dst_pte
;
821 pte_t
*src_pte
, *dst_pte
;
822 spinlock_t
*src_ptl
, *dst_ptl
;
824 int rss
[NR_MM_COUNTERS
];
825 swp_entry_t entry
= (swp_entry_t
){0};
830 dst_pte
= pte_alloc_map_lock(dst_mm
, dst_pmd
, addr
, &dst_ptl
);
833 src_pte
= pte_offset_map(src_pmd
, addr
);
834 src_ptl
= pte_lockptr(src_mm
, src_pmd
);
835 spin_lock_nested(src_ptl
, SINGLE_DEPTH_NESTING
);
836 orig_src_pte
= src_pte
;
837 orig_dst_pte
= dst_pte
;
838 arch_enter_lazy_mmu_mode();
842 * We are holding two locks at this point - either of them
843 * could generate latencies in another task on another CPU.
845 if (progress
>= 32) {
847 if (need_resched() ||
848 spin_needbreak(src_ptl
) || spin_needbreak(dst_ptl
))
851 if (pte_none(*src_pte
)) {
855 entry
.val
= copy_one_pte(dst_mm
, src_mm
, dst_pte
, src_pte
,
860 } while (dst_pte
++, src_pte
++, addr
+= PAGE_SIZE
, addr
!= end
);
862 arch_leave_lazy_mmu_mode();
863 spin_unlock(src_ptl
);
864 pte_unmap(orig_src_pte
);
865 add_mm_rss_vec(dst_mm
, rss
);
866 pte_unmap_unlock(orig_dst_pte
, dst_ptl
);
870 if (add_swap_count_continuation(entry
, GFP_KERNEL
) < 0)
879 static inline int copy_pmd_range(struct mm_struct
*dst_mm
, struct mm_struct
*src_mm
,
880 pud_t
*dst_pud
, pud_t
*src_pud
, struct vm_area_struct
*vma
,
881 unsigned long addr
, unsigned long end
)
883 pmd_t
*src_pmd
, *dst_pmd
;
886 dst_pmd
= pmd_alloc(dst_mm
, dst_pud
, addr
);
889 src_pmd
= pmd_offset(src_pud
, addr
);
891 next
= pmd_addr_end(addr
, end
);
892 if (is_swap_pmd(*src_pmd
) || pmd_trans_huge(*src_pmd
)
893 || pmd_devmap(*src_pmd
)) {
895 VM_BUG_ON_VMA(next
-addr
!= HPAGE_PMD_SIZE
, vma
);
896 err
= copy_huge_pmd(dst_mm
, src_mm
,
897 dst_pmd
, src_pmd
, addr
, vma
);
904 if (pmd_none_or_clear_bad(src_pmd
))
906 if (copy_pte_range(dst_mm
, src_mm
, dst_pmd
, src_pmd
,
909 } while (dst_pmd
++, src_pmd
++, addr
= next
, addr
!= end
);
913 static inline int copy_pud_range(struct mm_struct
*dst_mm
, struct mm_struct
*src_mm
,
914 p4d_t
*dst_p4d
, p4d_t
*src_p4d
, struct vm_area_struct
*vma
,
915 unsigned long addr
, unsigned long end
)
917 pud_t
*src_pud
, *dst_pud
;
920 dst_pud
= pud_alloc(dst_mm
, dst_p4d
, addr
);
923 src_pud
= pud_offset(src_p4d
, addr
);
925 next
= pud_addr_end(addr
, end
);
926 if (pud_trans_huge(*src_pud
) || pud_devmap(*src_pud
)) {
929 VM_BUG_ON_VMA(next
-addr
!= HPAGE_PUD_SIZE
, vma
);
930 err
= copy_huge_pud(dst_mm
, src_mm
,
931 dst_pud
, src_pud
, addr
, vma
);
938 if (pud_none_or_clear_bad(src_pud
))
940 if (copy_pmd_range(dst_mm
, src_mm
, dst_pud
, src_pud
,
943 } while (dst_pud
++, src_pud
++, addr
= next
, addr
!= end
);
947 static inline int copy_p4d_range(struct mm_struct
*dst_mm
, struct mm_struct
*src_mm
,
948 pgd_t
*dst_pgd
, pgd_t
*src_pgd
, struct vm_area_struct
*vma
,
949 unsigned long addr
, unsigned long end
)
951 p4d_t
*src_p4d
, *dst_p4d
;
954 dst_p4d
= p4d_alloc(dst_mm
, dst_pgd
, addr
);
957 src_p4d
= p4d_offset(src_pgd
, addr
);
959 next
= p4d_addr_end(addr
, end
);
960 if (p4d_none_or_clear_bad(src_p4d
))
962 if (copy_pud_range(dst_mm
, src_mm
, dst_p4d
, src_p4d
,
965 } while (dst_p4d
++, src_p4d
++, addr
= next
, addr
!= end
);
969 int copy_page_range(struct mm_struct
*dst_mm
, struct mm_struct
*src_mm
,
970 struct vm_area_struct
*vma
)
972 pgd_t
*src_pgd
, *dst_pgd
;
974 unsigned long addr
= vma
->vm_start
;
975 unsigned long end
= vma
->vm_end
;
976 unsigned long mmun_start
; /* For mmu_notifiers */
977 unsigned long mmun_end
; /* For mmu_notifiers */
982 * Don't copy ptes where a page fault will fill them correctly.
983 * Fork becomes much lighter when there are big shared or private
984 * readonly mappings. The tradeoff is that copy_page_range is more
985 * efficient than faulting.
987 if (!(vma
->vm_flags
& (VM_HUGETLB
| VM_PFNMAP
| VM_MIXEDMAP
)) &&
991 if (is_vm_hugetlb_page(vma
))
992 return copy_hugetlb_page_range(dst_mm
, src_mm
, vma
);
994 if (unlikely(vma
->vm_flags
& VM_PFNMAP
)) {
996 * We do not free on error cases below as remove_vma
997 * gets called on error from higher level routine
999 ret
= track_pfn_copy(vma
);
1005 * We need to invalidate the secondary MMU mappings only when
1006 * there could be a permission downgrade on the ptes of the
1007 * parent mm. And a permission downgrade will only happen if
1008 * is_cow_mapping() returns true.
1010 is_cow
= is_cow_mapping(vma
->vm_flags
);
1014 mmu_notifier_invalidate_range_start(src_mm
, mmun_start
,
1018 dst_pgd
= pgd_offset(dst_mm
, addr
);
1019 src_pgd
= pgd_offset(src_mm
, addr
);
1021 next
= pgd_addr_end(addr
, end
);
1022 if (pgd_none_or_clear_bad(src_pgd
))
1024 if (unlikely(copy_p4d_range(dst_mm
, src_mm
, dst_pgd
, src_pgd
,
1025 vma
, addr
, next
))) {
1029 } while (dst_pgd
++, src_pgd
++, addr
= next
, addr
!= end
);
1032 mmu_notifier_invalidate_range_end(src_mm
, mmun_start
, mmun_end
);
1036 static unsigned long zap_pte_range(struct mmu_gather
*tlb
,
1037 struct vm_area_struct
*vma
, pmd_t
*pmd
,
1038 unsigned long addr
, unsigned long end
,
1039 struct zap_details
*details
)
1041 struct mm_struct
*mm
= tlb
->mm
;
1042 int force_flush
= 0;
1043 int rss
[NR_MM_COUNTERS
];
1049 tlb_remove_check_page_size_change(tlb
, PAGE_SIZE
);
1052 start_pte
= pte_offset_map_lock(mm
, pmd
, addr
, &ptl
);
1054 flush_tlb_batched_pending(mm
);
1055 arch_enter_lazy_mmu_mode();
1058 if (pte_none(ptent
))
1061 if (pte_present(ptent
)) {
1064 page
= _vm_normal_page(vma
, addr
, ptent
, true);
1065 if (unlikely(details
) && page
) {
1067 * unmap_shared_mapping_pages() wants to
1068 * invalidate cache without truncating:
1069 * unmap shared but keep private pages.
1071 if (details
->check_mapping
&&
1072 details
->check_mapping
!= page_rmapping(page
))
1075 ptent
= ptep_get_and_clear_full(mm
, addr
, pte
,
1077 tlb_remove_tlb_entry(tlb
, pte
, addr
);
1078 if (unlikely(!page
))
1081 if (!PageAnon(page
)) {
1082 if (pte_dirty(ptent
)) {
1084 set_page_dirty(page
);
1086 if (pte_young(ptent
) &&
1087 likely(!(vma
->vm_flags
& VM_SEQ_READ
)))
1088 mark_page_accessed(page
);
1090 rss
[mm_counter(page
)]--;
1091 page_remove_rmap(page
, false);
1092 if (unlikely(page_mapcount(page
) < 0))
1093 print_bad_pte(vma
, addr
, ptent
, page
);
1094 if (unlikely(__tlb_remove_page(tlb
, page
))) {
1102 entry
= pte_to_swp_entry(ptent
);
1103 if (non_swap_entry(entry
) && is_device_private_entry(entry
)) {
1104 struct page
*page
= device_private_entry_to_page(entry
);
1106 if (unlikely(details
&& details
->check_mapping
)) {
1108 * unmap_shared_mapping_pages() wants to
1109 * invalidate cache without truncating:
1110 * unmap shared but keep private pages.
1112 if (details
->check_mapping
!=
1113 page_rmapping(page
))
1117 pte_clear_not_present_full(mm
, addr
, pte
, tlb
->fullmm
);
1118 rss
[mm_counter(page
)]--;
1119 page_remove_rmap(page
, false);
1124 /* If details->check_mapping, we leave swap entries. */
1125 if (unlikely(details
))
1128 entry
= pte_to_swp_entry(ptent
);
1129 if (!non_swap_entry(entry
))
1131 else if (is_migration_entry(entry
)) {
1134 page
= migration_entry_to_page(entry
);
1135 rss
[mm_counter(page
)]--;
1137 if (unlikely(!free_swap_and_cache(entry
)))
1138 print_bad_pte(vma
, addr
, ptent
, NULL
);
1139 pte_clear_not_present_full(mm
, addr
, pte
, tlb
->fullmm
);
1140 } while (pte
++, addr
+= PAGE_SIZE
, addr
!= end
);
1142 add_mm_rss_vec(mm
, rss
);
1143 arch_leave_lazy_mmu_mode();
1145 /* Do the actual TLB flush before dropping ptl */
1147 tlb_flush_mmu_tlbonly(tlb
);
1148 pte_unmap_unlock(start_pte
, ptl
);
1151 * If we forced a TLB flush (either due to running out of
1152 * batch buffers or because we needed to flush dirty TLB
1153 * entries before releasing the ptl), free the batched
1154 * memory too. Restart if we didn't do everything.
1158 tlb_flush_mmu_free(tlb
);
1166 static inline unsigned long zap_pmd_range(struct mmu_gather
*tlb
,
1167 struct vm_area_struct
*vma
, pud_t
*pud
,
1168 unsigned long addr
, unsigned long end
,
1169 struct zap_details
*details
)
1174 pmd
= pmd_offset(pud
, addr
);
1176 next
= pmd_addr_end(addr
, end
);
1177 if (is_swap_pmd(*pmd
) || pmd_trans_huge(*pmd
) || pmd_devmap(*pmd
)) {
1178 if (next
- addr
!= HPAGE_PMD_SIZE
)
1179 __split_huge_pmd(vma
, pmd
, addr
, false, NULL
);
1180 else if (zap_huge_pmd(tlb
, vma
, pmd
, addr
))
1185 * Here there can be other concurrent MADV_DONTNEED or
1186 * trans huge page faults running, and if the pmd is
1187 * none or trans huge it can change under us. This is
1188 * because MADV_DONTNEED holds the mmap_sem in read
1191 if (pmd_none_or_trans_huge_or_clear_bad(pmd
))
1193 next
= zap_pte_range(tlb
, vma
, pmd
, addr
, next
, details
);
1196 } while (pmd
++, addr
= next
, addr
!= end
);
1201 static inline unsigned long zap_pud_range(struct mmu_gather
*tlb
,
1202 struct vm_area_struct
*vma
, p4d_t
*p4d
,
1203 unsigned long addr
, unsigned long end
,
1204 struct zap_details
*details
)
1209 pud
= pud_offset(p4d
, addr
);
1211 next
= pud_addr_end(addr
, end
);
1212 if (pud_trans_huge(*pud
) || pud_devmap(*pud
)) {
1213 if (next
- addr
!= HPAGE_PUD_SIZE
) {
1214 VM_BUG_ON_VMA(!rwsem_is_locked(&tlb
->mm
->mmap_sem
), vma
);
1215 split_huge_pud(vma
, pud
, addr
);
1216 } else if (zap_huge_pud(tlb
, vma
, pud
, addr
))
1220 if (pud_none_or_clear_bad(pud
))
1222 next
= zap_pmd_range(tlb
, vma
, pud
, addr
, next
, details
);
1225 } while (pud
++, addr
= next
, addr
!= end
);
1230 static inline unsigned long zap_p4d_range(struct mmu_gather
*tlb
,
1231 struct vm_area_struct
*vma
, pgd_t
*pgd
,
1232 unsigned long addr
, unsigned long end
,
1233 struct zap_details
*details
)
1238 p4d
= p4d_offset(pgd
, addr
);
1240 next
= p4d_addr_end(addr
, end
);
1241 if (p4d_none_or_clear_bad(p4d
))
1243 next
= zap_pud_range(tlb
, vma
, p4d
, addr
, next
, details
);
1244 } while (p4d
++, addr
= next
, addr
!= end
);
1249 void unmap_page_range(struct mmu_gather
*tlb
,
1250 struct vm_area_struct
*vma
,
1251 unsigned long addr
, unsigned long end
,
1252 struct zap_details
*details
)
1257 BUG_ON(addr
>= end
);
1258 tlb_start_vma(tlb
, vma
);
1259 pgd
= pgd_offset(vma
->vm_mm
, addr
);
1261 next
= pgd_addr_end(addr
, end
);
1262 if (pgd_none_or_clear_bad(pgd
))
1264 next
= zap_p4d_range(tlb
, vma
, pgd
, addr
, next
, details
);
1265 } while (pgd
++, addr
= next
, addr
!= end
);
1266 tlb_end_vma(tlb
, vma
);
1270 static void unmap_single_vma(struct mmu_gather
*tlb
,
1271 struct vm_area_struct
*vma
, unsigned long start_addr
,
1272 unsigned long end_addr
,
1273 struct zap_details
*details
)
1275 unsigned long start
= max(vma
->vm_start
, start_addr
);
1278 if (start
>= vma
->vm_end
)
1280 end
= min(vma
->vm_end
, end_addr
);
1281 if (end
<= vma
->vm_start
)
1285 uprobe_munmap(vma
, start
, end
);
1287 if (unlikely(vma
->vm_flags
& VM_PFNMAP
))
1288 untrack_pfn(vma
, 0, 0);
1291 if (unlikely(is_vm_hugetlb_page(vma
))) {
1293 * It is undesirable to test vma->vm_file as it
1294 * should be non-null for valid hugetlb area.
1295 * However, vm_file will be NULL in the error
1296 * cleanup path of mmap_region. When
1297 * hugetlbfs ->mmap method fails,
1298 * mmap_region() nullifies vma->vm_file
1299 * before calling this function to clean up.
1300 * Since no pte has actually been setup, it is
1301 * safe to do nothing in this case.
1304 i_mmap_lock_write(vma
->vm_file
->f_mapping
);
1305 __unmap_hugepage_range_final(tlb
, vma
, start
, end
, NULL
);
1306 i_mmap_unlock_write(vma
->vm_file
->f_mapping
);
1309 unmap_page_range(tlb
, vma
, start
, end
, details
);
1314 * unmap_vmas - unmap a range of memory covered by a list of vma's
1315 * @tlb: address of the caller's struct mmu_gather
1316 * @vma: the starting vma
1317 * @start_addr: virtual address at which to start unmapping
1318 * @end_addr: virtual address at which to end unmapping
1320 * Unmap all pages in the vma list.
1322 * Only addresses between `start' and `end' will be unmapped.
1324 * The VMA list must be sorted in ascending virtual address order.
1326 * unmap_vmas() assumes that the caller will flush the whole unmapped address
1327 * range after unmap_vmas() returns. So the only responsibility here is to
1328 * ensure that any thus-far unmapped pages are flushed before unmap_vmas()
1329 * drops the lock and schedules.
1331 void unmap_vmas(struct mmu_gather
*tlb
,
1332 struct vm_area_struct
*vma
, unsigned long start_addr
,
1333 unsigned long end_addr
)
1335 struct mm_struct
*mm
= vma
->vm_mm
;
1337 mmu_notifier_invalidate_range_start(mm
, start_addr
, end_addr
);
1338 for ( ; vma
&& vma
->vm_start
< end_addr
; vma
= vma
->vm_next
)
1339 unmap_single_vma(tlb
, vma
, start_addr
, end_addr
, NULL
);
1340 mmu_notifier_invalidate_range_end(mm
, start_addr
, end_addr
);
1344 * zap_page_range - remove user pages in a given range
1345 * @vma: vm_area_struct holding the applicable pages
1346 * @start: starting address of pages to zap
1347 * @size: number of bytes to zap
1349 * Caller must protect the VMA list
1351 void zap_page_range(struct vm_area_struct
*vma
, unsigned long start
,
1354 struct mm_struct
*mm
= vma
->vm_mm
;
1355 struct mmu_gather tlb
;
1356 unsigned long end
= start
+ size
;
1359 tlb_gather_mmu(&tlb
, mm
, start
, end
);
1360 update_hiwater_rss(mm
);
1361 mmu_notifier_invalidate_range_start(mm
, start
, end
);
1362 for ( ; vma
&& vma
->vm_start
< end
; vma
= vma
->vm_next
)
1363 unmap_single_vma(&tlb
, vma
, start
, end
, NULL
);
1364 mmu_notifier_invalidate_range_end(mm
, start
, end
);
1365 tlb_finish_mmu(&tlb
, start
, end
);
1369 * zap_page_range_single - remove user pages in a given range
1370 * @vma: vm_area_struct holding the applicable pages
1371 * @address: starting address of pages to zap
1372 * @size: number of bytes to zap
1373 * @details: details of shared cache invalidation
1375 * The range must fit into one VMA.
1377 static void zap_page_range_single(struct vm_area_struct
*vma
, unsigned long address
,
1378 unsigned long size
, struct zap_details
*details
)
1380 struct mm_struct
*mm
= vma
->vm_mm
;
1381 struct mmu_gather tlb
;
1382 unsigned long end
= address
+ size
;
1385 tlb_gather_mmu(&tlb
, mm
, address
, end
);
1386 update_hiwater_rss(mm
);
1387 mmu_notifier_invalidate_range_start(mm
, address
, end
);
1388 unmap_single_vma(&tlb
, vma
, address
, end
, details
);
1389 mmu_notifier_invalidate_range_end(mm
, address
, end
);
1390 tlb_finish_mmu(&tlb
, address
, end
);
1394 * zap_vma_ptes - remove ptes mapping the vma
1395 * @vma: vm_area_struct holding ptes to be zapped
1396 * @address: starting address of pages to zap
1397 * @size: number of bytes to zap
1399 * This function only unmaps ptes assigned to VM_PFNMAP vmas.
1401 * The entire address range must be fully contained within the vma.
1404 void zap_vma_ptes(struct vm_area_struct
*vma
, unsigned long address
,
1407 if (address
< vma
->vm_start
|| address
+ size
> vma
->vm_end
||
1408 !(vma
->vm_flags
& VM_PFNMAP
))
1411 zap_page_range_single(vma
, address
, size
, NULL
);
1413 EXPORT_SYMBOL_GPL(zap_vma_ptes
);
1415 pte_t
*__get_locked_pte(struct mm_struct
*mm
, unsigned long addr
,
1423 pgd
= pgd_offset(mm
, addr
);
1424 p4d
= p4d_alloc(mm
, pgd
, addr
);
1427 pud
= pud_alloc(mm
, p4d
, addr
);
1430 pmd
= pmd_alloc(mm
, pud
, addr
);
1434 VM_BUG_ON(pmd_trans_huge(*pmd
));
1435 return pte_alloc_map_lock(mm
, pmd
, addr
, ptl
);
1439 * This is the old fallback for page remapping.
1441 * For historical reasons, it only allows reserved pages. Only
1442 * old drivers should use this, and they needed to mark their
1443 * pages reserved for the old functions anyway.
1445 static int insert_page(struct vm_area_struct
*vma
, unsigned long addr
,
1446 struct page
*page
, pgprot_t prot
)
1448 struct mm_struct
*mm
= vma
->vm_mm
;
1457 flush_dcache_page(page
);
1458 pte
= get_locked_pte(mm
, addr
, &ptl
);
1462 if (!pte_none(*pte
))
1465 /* Ok, finally just insert the thing.. */
1467 inc_mm_counter_fast(mm
, mm_counter_file(page
));
1468 page_add_file_rmap(page
, false);
1469 set_pte_at(mm
, addr
, pte
, mk_pte(page
, prot
));
1472 pte_unmap_unlock(pte
, ptl
);
1475 pte_unmap_unlock(pte
, ptl
);
1481 * vm_insert_page - insert single page into user vma
1482 * @vma: user vma to map to
1483 * @addr: target user address of this page
1484 * @page: source kernel page
1486 * This allows drivers to insert individual pages they've allocated
1489 * The page has to be a nice clean _individual_ kernel allocation.
1490 * If you allocate a compound page, you need to have marked it as
1491 * such (__GFP_COMP), or manually just split the page up yourself
1492 * (see split_page()).
1494 * NOTE! Traditionally this was done with "remap_pfn_range()" which
1495 * took an arbitrary page protection parameter. This doesn't allow
1496 * that. Your vma protection will have to be set up correctly, which
1497 * means that if you want a shared writable mapping, you'd better
1498 * ask for a shared writable mapping!
1500 * The page does not need to be reserved.
1502 * Usually this function is called from f_op->mmap() handler
1503 * under mm->mmap_sem write-lock, so it can change vma->vm_flags.
1504 * Caller must set VM_MIXEDMAP on vma if it wants to call this
1505 * function from other places, for example from page-fault handler.
1507 int vm_insert_page(struct vm_area_struct
*vma
, unsigned long addr
,
1510 if (addr
< vma
->vm_start
|| addr
>= vma
->vm_end
)
1512 if (!page_count(page
))
1514 if (!(vma
->vm_flags
& VM_MIXEDMAP
)) {
1515 BUG_ON(down_read_trylock(&vma
->vm_mm
->mmap_sem
));
1516 BUG_ON(vma
->vm_flags
& VM_PFNMAP
);
1517 vma
->vm_flags
|= VM_MIXEDMAP
;
1519 return insert_page(vma
, addr
, page
, vma
->vm_page_prot
);
1521 EXPORT_SYMBOL(vm_insert_page
);
1523 static vm_fault_t
insert_pfn(struct vm_area_struct
*vma
, unsigned long addr
,
1524 pfn_t pfn
, pgprot_t prot
, bool mkwrite
)
1526 struct mm_struct
*mm
= vma
->vm_mm
;
1530 pte
= get_locked_pte(mm
, addr
, &ptl
);
1532 return VM_FAULT_OOM
;
1533 if (!pte_none(*pte
)) {
1536 * For read faults on private mappings the PFN passed
1537 * in may not match the PFN we have mapped if the
1538 * mapped PFN is a writeable COW page. In the mkwrite
1539 * case we are creating a writable PTE for a shared
1540 * mapping and we expect the PFNs to match. If they
1541 * don't match, we are likely racing with block
1542 * allocation and mapping invalidation so just skip the
1545 if (pte_pfn(*pte
) != pfn_t_to_pfn(pfn
)) {
1546 WARN_ON_ONCE(!is_zero_pfn(pte_pfn(*pte
)));
1555 /* Ok, finally just insert the thing.. */
1556 if (pfn_t_devmap(pfn
))
1557 entry
= pte_mkdevmap(pfn_t_pte(pfn
, prot
));
1559 entry
= pte_mkspecial(pfn_t_pte(pfn
, prot
));
1563 entry
= pte_mkyoung(entry
);
1564 entry
= maybe_mkwrite(pte_mkdirty(entry
), vma
);
1567 set_pte_at(mm
, addr
, pte
, entry
);
1568 update_mmu_cache(vma
, addr
, pte
); /* XXX: why not for insert_page? */
1571 pte_unmap_unlock(pte
, ptl
);
1572 return VM_FAULT_NOPAGE
;
1576 * vmf_insert_pfn_prot - insert single pfn into user vma with specified pgprot
1577 * @vma: user vma to map to
1578 * @addr: target user address of this page
1579 * @pfn: source kernel pfn
1580 * @pgprot: pgprot flags for the inserted page
1582 * This is exactly like vmf_insert_pfn(), except that it allows drivers to
1583 * to override pgprot on a per-page basis.
1585 * This only makes sense for IO mappings, and it makes no sense for
1586 * COW mappings. In general, using multiple vmas is preferable;
1587 * vmf_insert_pfn_prot should only be used if using multiple VMAs is
1590 * Context: Process context. May allocate using %GFP_KERNEL.
1591 * Return: vm_fault_t value.
1593 vm_fault_t
vmf_insert_pfn_prot(struct vm_area_struct
*vma
, unsigned long addr
,
1594 unsigned long pfn
, pgprot_t pgprot
)
1597 * Technically, architectures with pte_special can avoid all these
1598 * restrictions (same for remap_pfn_range). However we would like
1599 * consistency in testing and feature parity among all, so we should
1600 * try to keep these invariants in place for everybody.
1602 BUG_ON(!(vma
->vm_flags
& (VM_PFNMAP
|VM_MIXEDMAP
)));
1603 BUG_ON((vma
->vm_flags
& (VM_PFNMAP
|VM_MIXEDMAP
)) ==
1604 (VM_PFNMAP
|VM_MIXEDMAP
));
1605 BUG_ON((vma
->vm_flags
& VM_PFNMAP
) && is_cow_mapping(vma
->vm_flags
));
1606 BUG_ON((vma
->vm_flags
& VM_MIXEDMAP
) && pfn_valid(pfn
));
1608 if (addr
< vma
->vm_start
|| addr
>= vma
->vm_end
)
1609 return VM_FAULT_SIGBUS
;
1611 if (!pfn_modify_allowed(pfn
, pgprot
))
1612 return VM_FAULT_SIGBUS
;
1614 track_pfn_insert(vma
, &pgprot
, __pfn_to_pfn_t(pfn
, PFN_DEV
));
1616 return insert_pfn(vma
, addr
, __pfn_to_pfn_t(pfn
, PFN_DEV
), pgprot
,
1619 EXPORT_SYMBOL(vmf_insert_pfn_prot
);
1622 * vmf_insert_pfn - insert single pfn into user vma
1623 * @vma: user vma to map to
1624 * @addr: target user address of this page
1625 * @pfn: source kernel pfn
1627 * Similar to vm_insert_page, this allows drivers to insert individual pages
1628 * they've allocated into a user vma. Same comments apply.
1630 * This function should only be called from a vm_ops->fault handler, and
1631 * in that case the handler should return the result of this function.
1633 * vma cannot be a COW mapping.
1635 * As this is called only for pages that do not currently exist, we
1636 * do not need to flush old virtual caches or the TLB.
1638 * Context: Process context. May allocate using %GFP_KERNEL.
1639 * Return: vm_fault_t value.
1641 vm_fault_t
vmf_insert_pfn(struct vm_area_struct
*vma
, unsigned long addr
,
1644 return vmf_insert_pfn_prot(vma
, addr
, pfn
, vma
->vm_page_prot
);
1646 EXPORT_SYMBOL(vmf_insert_pfn
);
1648 static bool vm_mixed_ok(struct vm_area_struct
*vma
, pfn_t pfn
)
1650 /* these checks mirror the abort conditions in vm_normal_page */
1651 if (vma
->vm_flags
& VM_MIXEDMAP
)
1653 if (pfn_t_devmap(pfn
))
1655 if (pfn_t_special(pfn
))
1657 if (is_zero_pfn(pfn_t_to_pfn(pfn
)))
1662 static vm_fault_t
__vm_insert_mixed(struct vm_area_struct
*vma
,
1663 unsigned long addr
, pfn_t pfn
, bool mkwrite
)
1665 pgprot_t pgprot
= vma
->vm_page_prot
;
1668 BUG_ON(!vm_mixed_ok(vma
, pfn
));
1670 if (addr
< vma
->vm_start
|| addr
>= vma
->vm_end
)
1671 return VM_FAULT_SIGBUS
;
1673 track_pfn_insert(vma
, &pgprot
, pfn
);
1675 if (!pfn_modify_allowed(pfn_t_to_pfn(pfn
), pgprot
))
1676 return VM_FAULT_SIGBUS
;
1679 * If we don't have pte special, then we have to use the pfn_valid()
1680 * based VM_MIXEDMAP scheme (see vm_normal_page), and thus we *must*
1681 * refcount the page if pfn_valid is true (hence insert_page rather
1682 * than insert_pfn). If a zero_pfn were inserted into a VM_MIXEDMAP
1683 * without pte special, it would there be refcounted as a normal page.
1685 if (!IS_ENABLED(CONFIG_ARCH_HAS_PTE_SPECIAL
) &&
1686 !pfn_t_devmap(pfn
) && pfn_t_valid(pfn
)) {
1690 * At this point we are committed to insert_page()
1691 * regardless of whether the caller specified flags that
1692 * result in pfn_t_has_page() == false.
1694 page
= pfn_to_page(pfn_t_to_pfn(pfn
));
1695 err
= insert_page(vma
, addr
, page
, pgprot
);
1697 return insert_pfn(vma
, addr
, pfn
, pgprot
, mkwrite
);
1701 return VM_FAULT_OOM
;
1702 if (err
< 0 && err
!= -EBUSY
)
1703 return VM_FAULT_SIGBUS
;
1705 return VM_FAULT_NOPAGE
;
1708 vm_fault_t
vmf_insert_mixed(struct vm_area_struct
*vma
, unsigned long addr
,
1711 return __vm_insert_mixed(vma
, addr
, pfn
, false);
1713 EXPORT_SYMBOL(vmf_insert_mixed
);
1716 * If the insertion of PTE failed because someone else already added a
1717 * different entry in the mean time, we treat that as success as we assume
1718 * the same entry was actually inserted.
1720 vm_fault_t
vmf_insert_mixed_mkwrite(struct vm_area_struct
*vma
,
1721 unsigned long addr
, pfn_t pfn
)
1723 return __vm_insert_mixed(vma
, addr
, pfn
, true);
1725 EXPORT_SYMBOL(vmf_insert_mixed_mkwrite
);
1728 * maps a range of physical memory into the requested pages. the old
1729 * mappings are removed. any references to nonexistent pages results
1730 * in null mappings (currently treated as "copy-on-access")
1732 static int remap_pte_range(struct mm_struct
*mm
, pmd_t
*pmd
,
1733 unsigned long addr
, unsigned long end
,
1734 unsigned long pfn
, pgprot_t prot
)
1740 pte
= pte_alloc_map_lock(mm
, pmd
, addr
, &ptl
);
1743 arch_enter_lazy_mmu_mode();
1745 BUG_ON(!pte_none(*pte
));
1746 if (!pfn_modify_allowed(pfn
, prot
)) {
1750 set_pte_at(mm
, addr
, pte
, pte_mkspecial(pfn_pte(pfn
, prot
)));
1752 } while (pte
++, addr
+= PAGE_SIZE
, addr
!= end
);
1753 arch_leave_lazy_mmu_mode();
1754 pte_unmap_unlock(pte
- 1, ptl
);
1758 static inline int remap_pmd_range(struct mm_struct
*mm
, pud_t
*pud
,
1759 unsigned long addr
, unsigned long end
,
1760 unsigned long pfn
, pgprot_t prot
)
1766 pfn
-= addr
>> PAGE_SHIFT
;
1767 pmd
= pmd_alloc(mm
, pud
, addr
);
1770 VM_BUG_ON(pmd_trans_huge(*pmd
));
1772 next
= pmd_addr_end(addr
, end
);
1773 err
= remap_pte_range(mm
, pmd
, addr
, next
,
1774 pfn
+ (addr
>> PAGE_SHIFT
), prot
);
1777 } while (pmd
++, addr
= next
, addr
!= end
);
1781 static inline int remap_pud_range(struct mm_struct
*mm
, p4d_t
*p4d
,
1782 unsigned long addr
, unsigned long end
,
1783 unsigned long pfn
, pgprot_t prot
)
1789 pfn
-= addr
>> PAGE_SHIFT
;
1790 pud
= pud_alloc(mm
, p4d
, addr
);
1794 next
= pud_addr_end(addr
, end
);
1795 err
= remap_pmd_range(mm
, pud
, addr
, next
,
1796 pfn
+ (addr
>> PAGE_SHIFT
), prot
);
1799 } while (pud
++, addr
= next
, addr
!= end
);
1803 static inline int remap_p4d_range(struct mm_struct
*mm
, pgd_t
*pgd
,
1804 unsigned long addr
, unsigned long end
,
1805 unsigned long pfn
, pgprot_t prot
)
1811 pfn
-= addr
>> PAGE_SHIFT
;
1812 p4d
= p4d_alloc(mm
, pgd
, addr
);
1816 next
= p4d_addr_end(addr
, end
);
1817 err
= remap_pud_range(mm
, p4d
, addr
, next
,
1818 pfn
+ (addr
>> PAGE_SHIFT
), prot
);
1821 } while (p4d
++, addr
= next
, addr
!= end
);
1826 * remap_pfn_range - remap kernel memory to userspace
1827 * @vma: user vma to map to
1828 * @addr: target user address to start at
1829 * @pfn: physical address of kernel memory
1830 * @size: size of map area
1831 * @prot: page protection flags for this mapping
1833 * Note: this is only safe if the mm semaphore is held when called.
1835 int remap_pfn_range(struct vm_area_struct
*vma
, unsigned long addr
,
1836 unsigned long pfn
, unsigned long size
, pgprot_t prot
)
1840 unsigned long end
= addr
+ PAGE_ALIGN(size
);
1841 struct mm_struct
*mm
= vma
->vm_mm
;
1842 unsigned long remap_pfn
= pfn
;
1846 * Physically remapped pages are special. Tell the
1847 * rest of the world about it:
1848 * VM_IO tells people not to look at these pages
1849 * (accesses can have side effects).
1850 * VM_PFNMAP tells the core MM that the base pages are just
1851 * raw PFN mappings, and do not have a "struct page" associated
1854 * Disable vma merging and expanding with mremap().
1856 * Omit vma from core dump, even when VM_IO turned off.
1858 * There's a horrible special case to handle copy-on-write
1859 * behaviour that some programs depend on. We mark the "original"
1860 * un-COW'ed pages by matching them up with "vma->vm_pgoff".
1861 * See vm_normal_page() for details.
1863 if (is_cow_mapping(vma
->vm_flags
)) {
1864 if (addr
!= vma
->vm_start
|| end
!= vma
->vm_end
)
1866 vma
->vm_pgoff
= pfn
;
1869 err
= track_pfn_remap(vma
, &prot
, remap_pfn
, addr
, PAGE_ALIGN(size
));
1873 vma
->vm_flags
|= VM_IO
| VM_PFNMAP
| VM_DONTEXPAND
| VM_DONTDUMP
;
1875 BUG_ON(addr
>= end
);
1876 pfn
-= addr
>> PAGE_SHIFT
;
1877 pgd
= pgd_offset(mm
, addr
);
1878 flush_cache_range(vma
, addr
, end
);
1880 next
= pgd_addr_end(addr
, end
);
1881 err
= remap_p4d_range(mm
, pgd
, addr
, next
,
1882 pfn
+ (addr
>> PAGE_SHIFT
), prot
);
1885 } while (pgd
++, addr
= next
, addr
!= end
);
1888 untrack_pfn(vma
, remap_pfn
, PAGE_ALIGN(size
));
1892 EXPORT_SYMBOL(remap_pfn_range
);
1895 * vm_iomap_memory - remap memory to userspace
1896 * @vma: user vma to map to
1897 * @start: start of area
1898 * @len: size of area
1900 * This is a simplified io_remap_pfn_range() for common driver use. The
1901 * driver just needs to give us the physical memory range to be mapped,
1902 * we'll figure out the rest from the vma information.
1904 * NOTE! Some drivers might want to tweak vma->vm_page_prot first to get
1905 * whatever write-combining details or similar.
1907 int vm_iomap_memory(struct vm_area_struct
*vma
, phys_addr_t start
, unsigned long len
)
1909 unsigned long vm_len
, pfn
, pages
;
1911 /* Check that the physical memory area passed in looks valid */
1912 if (start
+ len
< start
)
1915 * You *really* shouldn't map things that aren't page-aligned,
1916 * but we've historically allowed it because IO memory might
1917 * just have smaller alignment.
1919 len
+= start
& ~PAGE_MASK
;
1920 pfn
= start
>> PAGE_SHIFT
;
1921 pages
= (len
+ ~PAGE_MASK
) >> PAGE_SHIFT
;
1922 if (pfn
+ pages
< pfn
)
1925 /* We start the mapping 'vm_pgoff' pages into the area */
1926 if (vma
->vm_pgoff
> pages
)
1928 pfn
+= vma
->vm_pgoff
;
1929 pages
-= vma
->vm_pgoff
;
1931 /* Can we fit all of the mapping? */
1932 vm_len
= vma
->vm_end
- vma
->vm_start
;
1933 if (vm_len
>> PAGE_SHIFT
> pages
)
1936 /* Ok, let it rip */
1937 return io_remap_pfn_range(vma
, vma
->vm_start
, pfn
, vm_len
, vma
->vm_page_prot
);
1939 EXPORT_SYMBOL(vm_iomap_memory
);
1941 static int apply_to_pte_range(struct mm_struct
*mm
, pmd_t
*pmd
,
1942 unsigned long addr
, unsigned long end
,
1943 pte_fn_t fn
, void *data
)
1948 spinlock_t
*uninitialized_var(ptl
);
1950 pte
= (mm
== &init_mm
) ?
1951 pte_alloc_kernel(pmd
, addr
) :
1952 pte_alloc_map_lock(mm
, pmd
, addr
, &ptl
);
1956 BUG_ON(pmd_huge(*pmd
));
1958 arch_enter_lazy_mmu_mode();
1960 token
= pmd_pgtable(*pmd
);
1963 err
= fn(pte
++, token
, addr
, data
);
1966 } while (addr
+= PAGE_SIZE
, addr
!= end
);
1968 arch_leave_lazy_mmu_mode();
1971 pte_unmap_unlock(pte
-1, ptl
);
1975 static int apply_to_pmd_range(struct mm_struct
*mm
, pud_t
*pud
,
1976 unsigned long addr
, unsigned long end
,
1977 pte_fn_t fn
, void *data
)
1983 BUG_ON(pud_huge(*pud
));
1985 pmd
= pmd_alloc(mm
, pud
, addr
);
1989 next
= pmd_addr_end(addr
, end
);
1990 err
= apply_to_pte_range(mm
, pmd
, addr
, next
, fn
, data
);
1993 } while (pmd
++, addr
= next
, addr
!= end
);
1997 static int apply_to_pud_range(struct mm_struct
*mm
, p4d_t
*p4d
,
1998 unsigned long addr
, unsigned long end
,
1999 pte_fn_t fn
, void *data
)
2005 pud
= pud_alloc(mm
, p4d
, addr
);
2009 next
= pud_addr_end(addr
, end
);
2010 err
= apply_to_pmd_range(mm
, pud
, addr
, next
, fn
, data
);
2013 } while (pud
++, addr
= next
, addr
!= end
);
2017 static int apply_to_p4d_range(struct mm_struct
*mm
, pgd_t
*pgd
,
2018 unsigned long addr
, unsigned long end
,
2019 pte_fn_t fn
, void *data
)
2025 p4d
= p4d_alloc(mm
, pgd
, addr
);
2029 next
= p4d_addr_end(addr
, end
);
2030 err
= apply_to_pud_range(mm
, p4d
, addr
, next
, fn
, data
);
2033 } while (p4d
++, addr
= next
, addr
!= end
);
2038 * Scan a region of virtual memory, filling in page tables as necessary
2039 * and calling a provided function on each leaf page table.
2041 int apply_to_page_range(struct mm_struct
*mm
, unsigned long addr
,
2042 unsigned long size
, pte_fn_t fn
, void *data
)
2046 unsigned long end
= addr
+ size
;
2049 if (WARN_ON(addr
>= end
))
2052 pgd
= pgd_offset(mm
, addr
);
2054 next
= pgd_addr_end(addr
, end
);
2055 err
= apply_to_p4d_range(mm
, pgd
, addr
, next
, fn
, data
);
2058 } while (pgd
++, addr
= next
, addr
!= end
);
2062 EXPORT_SYMBOL_GPL(apply_to_page_range
);
2065 * handle_pte_fault chooses page fault handler according to an entry which was
2066 * read non-atomically. Before making any commitment, on those architectures
2067 * or configurations (e.g. i386 with PAE) which might give a mix of unmatched
2068 * parts, do_swap_page must check under lock before unmapping the pte and
2069 * proceeding (but do_wp_page is only called after already making such a check;
2070 * and do_anonymous_page can safely check later on).
2072 static inline int pte_unmap_same(struct mm_struct
*mm
, pmd_t
*pmd
,
2073 pte_t
*page_table
, pte_t orig_pte
)
2076 #if defined(CONFIG_SMP) || defined(CONFIG_PREEMPT)
2077 if (sizeof(pte_t
) > sizeof(unsigned long)) {
2078 spinlock_t
*ptl
= pte_lockptr(mm
, pmd
);
2080 same
= pte_same(*page_table
, orig_pte
);
2084 pte_unmap(page_table
);
2088 static inline void cow_user_page(struct page
*dst
, struct page
*src
, unsigned long va
, struct vm_area_struct
*vma
)
2090 debug_dma_assert_idle(src
);
2093 * If the source page was a PFN mapping, we don't have
2094 * a "struct page" for it. We do a best-effort copy by
2095 * just copying from the original user address. If that
2096 * fails, we just zero-fill it. Live with it.
2098 if (unlikely(!src
)) {
2099 void *kaddr
= kmap_atomic(dst
);
2100 void __user
*uaddr
= (void __user
*)(va
& PAGE_MASK
);
2103 * This really shouldn't fail, because the page is there
2104 * in the page tables. But it might just be unreadable,
2105 * in which case we just give up and fill the result with
2108 if (__copy_from_user_inatomic(kaddr
, uaddr
, PAGE_SIZE
))
2110 kunmap_atomic(kaddr
);
2111 flush_dcache_page(dst
);
2113 copy_user_highpage(dst
, src
, va
, vma
);
2116 static gfp_t
__get_fault_gfp_mask(struct vm_area_struct
*vma
)
2118 struct file
*vm_file
= vma
->vm_file
;
2121 return mapping_gfp_mask(vm_file
->f_mapping
) | __GFP_FS
| __GFP_IO
;
2124 * Special mappings (e.g. VDSO) do not have any file so fake
2125 * a default GFP_KERNEL for them.
2131 * Notify the address space that the page is about to become writable so that
2132 * it can prohibit this or wait for the page to get into an appropriate state.
2134 * We do this without the lock held, so that it can sleep if it needs to.
2136 static vm_fault_t
do_page_mkwrite(struct vm_fault
*vmf
)
2139 struct page
*page
= vmf
->page
;
2140 unsigned int old_flags
= vmf
->flags
;
2142 vmf
->flags
= FAULT_FLAG_WRITE
|FAULT_FLAG_MKWRITE
;
2144 ret
= vmf
->vma
->vm_ops
->page_mkwrite(vmf
);
2145 /* Restore original flags so that caller is not surprised */
2146 vmf
->flags
= old_flags
;
2147 if (unlikely(ret
& (VM_FAULT_ERROR
| VM_FAULT_NOPAGE
)))
2149 if (unlikely(!(ret
& VM_FAULT_LOCKED
))) {
2151 if (!page
->mapping
) {
2153 return 0; /* retry */
2155 ret
|= VM_FAULT_LOCKED
;
2157 VM_BUG_ON_PAGE(!PageLocked(page
), page
);
2162 * Handle dirtying of a page in shared file mapping on a write fault.
2164 * The function expects the page to be locked and unlocks it.
2166 static void fault_dirty_shared_page(struct vm_area_struct
*vma
,
2169 struct address_space
*mapping
;
2171 bool page_mkwrite
= vma
->vm_ops
&& vma
->vm_ops
->page_mkwrite
;
2173 dirtied
= set_page_dirty(page
);
2174 VM_BUG_ON_PAGE(PageAnon(page
), page
);
2176 * Take a local copy of the address_space - page.mapping may be zeroed
2177 * by truncate after unlock_page(). The address_space itself remains
2178 * pinned by vma->vm_file's reference. We rely on unlock_page()'s
2179 * release semantics to prevent the compiler from undoing this copying.
2181 mapping
= page_rmapping(page
);
2184 if ((dirtied
|| page_mkwrite
) && mapping
) {
2186 * Some device drivers do not set page.mapping
2187 * but still dirty their pages
2189 balance_dirty_pages_ratelimited(mapping
);
2193 file_update_time(vma
->vm_file
);
2197 * Handle write page faults for pages that can be reused in the current vma
2199 * This can happen either due to the mapping being with the VM_SHARED flag,
2200 * or due to us being the last reference standing to the page. In either
2201 * case, all we need to do here is to mark the page as writable and update
2202 * any related book-keeping.
2204 static inline void wp_page_reuse(struct vm_fault
*vmf
)
2205 __releases(vmf
->ptl
)
2207 struct vm_area_struct
*vma
= vmf
->vma
;
2208 struct page
*page
= vmf
->page
;
2211 * Clear the pages cpupid information as the existing
2212 * information potentially belongs to a now completely
2213 * unrelated process.
2216 page_cpupid_xchg_last(page
, (1 << LAST_CPUPID_SHIFT
) - 1);
2218 flush_cache_page(vma
, vmf
->address
, pte_pfn(vmf
->orig_pte
));
2219 entry
= pte_mkyoung(vmf
->orig_pte
);
2220 entry
= maybe_mkwrite(pte_mkdirty(entry
), vma
);
2221 if (ptep_set_access_flags(vma
, vmf
->address
, vmf
->pte
, entry
, 1))
2222 update_mmu_cache(vma
, vmf
->address
, vmf
->pte
);
2223 pte_unmap_unlock(vmf
->pte
, vmf
->ptl
);
2227 * Handle the case of a page which we actually need to copy to a new page.
2229 * Called with mmap_sem locked and the old page referenced, but
2230 * without the ptl held.
2232 * High level logic flow:
2234 * - Allocate a page, copy the content of the old page to the new one.
2235 * - Handle book keeping and accounting - cgroups, mmu-notifiers, etc.
2236 * - Take the PTL. If the pte changed, bail out and release the allocated page
2237 * - If the pte is still the way we remember it, update the page table and all
2238 * relevant references. This includes dropping the reference the page-table
2239 * held to the old page, as well as updating the rmap.
2240 * - In any case, unlock the PTL and drop the reference we took to the old page.
2242 static vm_fault_t
wp_page_copy(struct vm_fault
*vmf
)
2244 struct vm_area_struct
*vma
= vmf
->vma
;
2245 struct mm_struct
*mm
= vma
->vm_mm
;
2246 struct page
*old_page
= vmf
->page
;
2247 struct page
*new_page
= NULL
;
2249 int page_copied
= 0;
2250 const unsigned long mmun_start
= vmf
->address
& PAGE_MASK
;
2251 const unsigned long mmun_end
= mmun_start
+ PAGE_SIZE
;
2252 struct mem_cgroup
*memcg
;
2254 if (unlikely(anon_vma_prepare(vma
)))
2257 if (is_zero_pfn(pte_pfn(vmf
->orig_pte
))) {
2258 new_page
= alloc_zeroed_user_highpage_movable(vma
,
2263 new_page
= alloc_page_vma(GFP_HIGHUSER_MOVABLE
, vma
,
2267 cow_user_page(new_page
, old_page
, vmf
->address
, vma
);
2270 if (mem_cgroup_try_charge_delay(new_page
, mm
, GFP_KERNEL
, &memcg
, false))
2273 __SetPageUptodate(new_page
);
2275 mmu_notifier_invalidate_range_start(mm
, mmun_start
, mmun_end
);
2278 * Re-check the pte - we dropped the lock
2280 vmf
->pte
= pte_offset_map_lock(mm
, vmf
->pmd
, vmf
->address
, &vmf
->ptl
);
2281 if (likely(pte_same(*vmf
->pte
, vmf
->orig_pte
))) {
2283 if (!PageAnon(old_page
)) {
2284 dec_mm_counter_fast(mm
,
2285 mm_counter_file(old_page
));
2286 inc_mm_counter_fast(mm
, MM_ANONPAGES
);
2289 inc_mm_counter_fast(mm
, MM_ANONPAGES
);
2291 flush_cache_page(vma
, vmf
->address
, pte_pfn(vmf
->orig_pte
));
2292 entry
= mk_pte(new_page
, vma
->vm_page_prot
);
2293 entry
= maybe_mkwrite(pte_mkdirty(entry
), vma
);
2295 * Clear the pte entry and flush it first, before updating the
2296 * pte with the new entry. This will avoid a race condition
2297 * seen in the presence of one thread doing SMC and another
2300 ptep_clear_flush_notify(vma
, vmf
->address
, vmf
->pte
);
2301 page_add_new_anon_rmap(new_page
, vma
, vmf
->address
, false);
2302 mem_cgroup_commit_charge(new_page
, memcg
, false, false);
2303 lru_cache_add_active_or_unevictable(new_page
, vma
);
2305 * We call the notify macro here because, when using secondary
2306 * mmu page tables (such as kvm shadow page tables), we want the
2307 * new page to be mapped directly into the secondary page table.
2309 set_pte_at_notify(mm
, vmf
->address
, vmf
->pte
, entry
);
2310 update_mmu_cache(vma
, vmf
->address
, vmf
->pte
);
2313 * Only after switching the pte to the new page may
2314 * we remove the mapcount here. Otherwise another
2315 * process may come and find the rmap count decremented
2316 * before the pte is switched to the new page, and
2317 * "reuse" the old page writing into it while our pte
2318 * here still points into it and can be read by other
2321 * The critical issue is to order this
2322 * page_remove_rmap with the ptp_clear_flush above.
2323 * Those stores are ordered by (if nothing else,)
2324 * the barrier present in the atomic_add_negative
2325 * in page_remove_rmap.
2327 * Then the TLB flush in ptep_clear_flush ensures that
2328 * no process can access the old page before the
2329 * decremented mapcount is visible. And the old page
2330 * cannot be reused until after the decremented
2331 * mapcount is visible. So transitively, TLBs to
2332 * old page will be flushed before it can be reused.
2334 page_remove_rmap(old_page
, false);
2337 /* Free the old page.. */
2338 new_page
= old_page
;
2341 mem_cgroup_cancel_charge(new_page
, memcg
, false);
2347 pte_unmap_unlock(vmf
->pte
, vmf
->ptl
);
2349 * No need to double call mmu_notifier->invalidate_range() callback as
2350 * the above ptep_clear_flush_notify() did already call it.
2352 mmu_notifier_invalidate_range_only_end(mm
, mmun_start
, mmun_end
);
2355 * Don't let another task, with possibly unlocked vma,
2356 * keep the mlocked page.
2358 if (page_copied
&& (vma
->vm_flags
& VM_LOCKED
)) {
2359 lock_page(old_page
); /* LRU manipulation */
2360 if (PageMlocked(old_page
))
2361 munlock_vma_page(old_page
);
2362 unlock_page(old_page
);
2366 return page_copied
? VM_FAULT_WRITE
: 0;
2372 return VM_FAULT_OOM
;
2376 * finish_mkwrite_fault - finish page fault for a shared mapping, making PTE
2377 * writeable once the page is prepared
2379 * @vmf: structure describing the fault
2381 * This function handles all that is needed to finish a write page fault in a
2382 * shared mapping due to PTE being read-only once the mapped page is prepared.
2383 * It handles locking of PTE and modifying it. The function returns
2384 * VM_FAULT_WRITE on success, 0 when PTE got changed before we acquired PTE
2387 * The function expects the page to be locked or other protection against
2388 * concurrent faults / writeback (such as DAX radix tree locks).
2390 vm_fault_t
finish_mkwrite_fault(struct vm_fault
*vmf
)
2392 WARN_ON_ONCE(!(vmf
->vma
->vm_flags
& VM_SHARED
));
2393 vmf
->pte
= pte_offset_map_lock(vmf
->vma
->vm_mm
, vmf
->pmd
, vmf
->address
,
2396 * We might have raced with another page fault while we released the
2397 * pte_offset_map_lock.
2399 if (!pte_same(*vmf
->pte
, vmf
->orig_pte
)) {
2400 pte_unmap_unlock(vmf
->pte
, vmf
->ptl
);
2401 return VM_FAULT_NOPAGE
;
2408 * Handle write page faults for VM_MIXEDMAP or VM_PFNMAP for a VM_SHARED
2411 static vm_fault_t
wp_pfn_shared(struct vm_fault
*vmf
)
2413 struct vm_area_struct
*vma
= vmf
->vma
;
2415 if (vma
->vm_ops
&& vma
->vm_ops
->pfn_mkwrite
) {
2418 pte_unmap_unlock(vmf
->pte
, vmf
->ptl
);
2419 vmf
->flags
|= FAULT_FLAG_MKWRITE
;
2420 ret
= vma
->vm_ops
->pfn_mkwrite(vmf
);
2421 if (ret
& (VM_FAULT_ERROR
| VM_FAULT_NOPAGE
))
2423 return finish_mkwrite_fault(vmf
);
2426 return VM_FAULT_WRITE
;
2429 static vm_fault_t
wp_page_shared(struct vm_fault
*vmf
)
2430 __releases(vmf
->ptl
)
2432 struct vm_area_struct
*vma
= vmf
->vma
;
2434 get_page(vmf
->page
);
2436 if (vma
->vm_ops
&& vma
->vm_ops
->page_mkwrite
) {
2439 pte_unmap_unlock(vmf
->pte
, vmf
->ptl
);
2440 tmp
= do_page_mkwrite(vmf
);
2441 if (unlikely(!tmp
|| (tmp
&
2442 (VM_FAULT_ERROR
| VM_FAULT_NOPAGE
)))) {
2443 put_page(vmf
->page
);
2446 tmp
= finish_mkwrite_fault(vmf
);
2447 if (unlikely(tmp
& (VM_FAULT_ERROR
| VM_FAULT_NOPAGE
))) {
2448 unlock_page(vmf
->page
);
2449 put_page(vmf
->page
);
2454 lock_page(vmf
->page
);
2456 fault_dirty_shared_page(vma
, vmf
->page
);
2457 put_page(vmf
->page
);
2459 return VM_FAULT_WRITE
;
2463 * This routine handles present pages, when users try to write
2464 * to a shared page. It is done by copying the page to a new address
2465 * and decrementing the shared-page counter for the old page.
2467 * Note that this routine assumes that the protection checks have been
2468 * done by the caller (the low-level page fault routine in most cases).
2469 * Thus we can safely just mark it writable once we've done any necessary
2472 * We also mark the page dirty at this point even though the page will
2473 * change only once the write actually happens. This avoids a few races,
2474 * and potentially makes it more efficient.
2476 * We enter with non-exclusive mmap_sem (to exclude vma changes,
2477 * but allow concurrent faults), with pte both mapped and locked.
2478 * We return with mmap_sem still held, but pte unmapped and unlocked.
2480 static vm_fault_t
do_wp_page(struct vm_fault
*vmf
)
2481 __releases(vmf
->ptl
)
2483 struct vm_area_struct
*vma
= vmf
->vma
;
2485 vmf
->page
= vm_normal_page(vma
, vmf
->address
, vmf
->orig_pte
);
2488 * VM_MIXEDMAP !pfn_valid() case, or VM_SOFTDIRTY clear on a
2491 * We should not cow pages in a shared writeable mapping.
2492 * Just mark the pages writable and/or call ops->pfn_mkwrite.
2494 if ((vma
->vm_flags
& (VM_WRITE
|VM_SHARED
)) ==
2495 (VM_WRITE
|VM_SHARED
))
2496 return wp_pfn_shared(vmf
);
2498 pte_unmap_unlock(vmf
->pte
, vmf
->ptl
);
2499 return wp_page_copy(vmf
);
2503 * Take out anonymous pages first, anonymous shared vmas are
2504 * not dirty accountable.
2506 if (PageAnon(vmf
->page
) && !PageKsm(vmf
->page
)) {
2507 int total_map_swapcount
;
2508 if (!trylock_page(vmf
->page
)) {
2509 get_page(vmf
->page
);
2510 pte_unmap_unlock(vmf
->pte
, vmf
->ptl
);
2511 lock_page(vmf
->page
);
2512 vmf
->pte
= pte_offset_map_lock(vma
->vm_mm
, vmf
->pmd
,
2513 vmf
->address
, &vmf
->ptl
);
2514 if (!pte_same(*vmf
->pte
, vmf
->orig_pte
)) {
2515 unlock_page(vmf
->page
);
2516 pte_unmap_unlock(vmf
->pte
, vmf
->ptl
);
2517 put_page(vmf
->page
);
2520 put_page(vmf
->page
);
2522 if (reuse_swap_page(vmf
->page
, &total_map_swapcount
)) {
2523 if (total_map_swapcount
== 1) {
2525 * The page is all ours. Move it to
2526 * our anon_vma so the rmap code will
2527 * not search our parent or siblings.
2528 * Protected against the rmap code by
2531 page_move_anon_rmap(vmf
->page
, vma
);
2533 unlock_page(vmf
->page
);
2535 return VM_FAULT_WRITE
;
2537 unlock_page(vmf
->page
);
2538 } else if (unlikely((vma
->vm_flags
& (VM_WRITE
|VM_SHARED
)) ==
2539 (VM_WRITE
|VM_SHARED
))) {
2540 return wp_page_shared(vmf
);
2544 * Ok, we need to copy. Oh, well..
2546 get_page(vmf
->page
);
2548 pte_unmap_unlock(vmf
->pte
, vmf
->ptl
);
2549 return wp_page_copy(vmf
);
2552 static void unmap_mapping_range_vma(struct vm_area_struct
*vma
,
2553 unsigned long start_addr
, unsigned long end_addr
,
2554 struct zap_details
*details
)
2556 zap_page_range_single(vma
, start_addr
, end_addr
- start_addr
, details
);
2559 static inline void unmap_mapping_range_tree(struct rb_root_cached
*root
,
2560 struct zap_details
*details
)
2562 struct vm_area_struct
*vma
;
2563 pgoff_t vba
, vea
, zba
, zea
;
2565 vma_interval_tree_foreach(vma
, root
,
2566 details
->first_index
, details
->last_index
) {
2568 vba
= vma
->vm_pgoff
;
2569 vea
= vba
+ vma_pages(vma
) - 1;
2570 zba
= details
->first_index
;
2573 zea
= details
->last_index
;
2577 unmap_mapping_range_vma(vma
,
2578 ((zba
- vba
) << PAGE_SHIFT
) + vma
->vm_start
,
2579 ((zea
- vba
+ 1) << PAGE_SHIFT
) + vma
->vm_start
,
2585 * unmap_mapping_pages() - Unmap pages from processes.
2586 * @mapping: The address space containing pages to be unmapped.
2587 * @start: Index of first page to be unmapped.
2588 * @nr: Number of pages to be unmapped. 0 to unmap to end of file.
2589 * @even_cows: Whether to unmap even private COWed pages.
2591 * Unmap the pages in this address space from any userspace process which
2592 * has them mmaped. Generally, you want to remove COWed pages as well when
2593 * a file is being truncated, but not when invalidating pages from the page
2596 void unmap_mapping_pages(struct address_space
*mapping
, pgoff_t start
,
2597 pgoff_t nr
, bool even_cows
)
2599 struct zap_details details
= { };
2601 details
.check_mapping
= even_cows
? NULL
: mapping
;
2602 details
.first_index
= start
;
2603 details
.last_index
= start
+ nr
- 1;
2604 if (details
.last_index
< details
.first_index
)
2605 details
.last_index
= ULONG_MAX
;
2607 i_mmap_lock_write(mapping
);
2608 if (unlikely(!RB_EMPTY_ROOT(&mapping
->i_mmap
.rb_root
)))
2609 unmap_mapping_range_tree(&mapping
->i_mmap
, &details
);
2610 i_mmap_unlock_write(mapping
);
2614 * unmap_mapping_range - unmap the portion of all mmaps in the specified
2615 * address_space corresponding to the specified byte range in the underlying
2618 * @mapping: the address space containing mmaps to be unmapped.
2619 * @holebegin: byte in first page to unmap, relative to the start of
2620 * the underlying file. This will be rounded down to a PAGE_SIZE
2621 * boundary. Note that this is different from truncate_pagecache(), which
2622 * must keep the partial page. In contrast, we must get rid of
2624 * @holelen: size of prospective hole in bytes. This will be rounded
2625 * up to a PAGE_SIZE boundary. A holelen of zero truncates to the
2627 * @even_cows: 1 when truncating a file, unmap even private COWed pages;
2628 * but 0 when invalidating pagecache, don't throw away private data.
2630 void unmap_mapping_range(struct address_space
*mapping
,
2631 loff_t
const holebegin
, loff_t
const holelen
, int even_cows
)
2633 pgoff_t hba
= holebegin
>> PAGE_SHIFT
;
2634 pgoff_t hlen
= (holelen
+ PAGE_SIZE
- 1) >> PAGE_SHIFT
;
2636 /* Check for overflow. */
2637 if (sizeof(holelen
) > sizeof(hlen
)) {
2639 (holebegin
+ holelen
+ PAGE_SIZE
- 1) >> PAGE_SHIFT
;
2640 if (holeend
& ~(long long)ULONG_MAX
)
2641 hlen
= ULONG_MAX
- hba
+ 1;
2644 unmap_mapping_pages(mapping
, hba
, hlen
, even_cows
);
2646 EXPORT_SYMBOL(unmap_mapping_range
);
2649 * We enter with non-exclusive mmap_sem (to exclude vma changes,
2650 * but allow concurrent faults), and pte mapped but not yet locked.
2651 * We return with pte unmapped and unlocked.
2653 * We return with the mmap_sem locked or unlocked in the same cases
2654 * as does filemap_fault().
2656 vm_fault_t
do_swap_page(struct vm_fault
*vmf
)
2658 struct vm_area_struct
*vma
= vmf
->vma
;
2659 struct page
*page
= NULL
, *swapcache
;
2660 struct mem_cgroup
*memcg
;
2667 if (!pte_unmap_same(vma
->vm_mm
, vmf
->pmd
, vmf
->pte
, vmf
->orig_pte
))
2670 entry
= pte_to_swp_entry(vmf
->orig_pte
);
2671 if (unlikely(non_swap_entry(entry
))) {
2672 if (is_migration_entry(entry
)) {
2673 migration_entry_wait(vma
->vm_mm
, vmf
->pmd
,
2675 } else if (is_device_private_entry(entry
)) {
2677 * For un-addressable device memory we call the pgmap
2678 * fault handler callback. The callback must migrate
2679 * the page back to some CPU accessible page.
2681 ret
= device_private_entry_fault(vma
, vmf
->address
, entry
,
2682 vmf
->flags
, vmf
->pmd
);
2683 } else if (is_hwpoison_entry(entry
)) {
2684 ret
= VM_FAULT_HWPOISON
;
2686 print_bad_pte(vma
, vmf
->address
, vmf
->orig_pte
, NULL
);
2687 ret
= VM_FAULT_SIGBUS
;
2693 delayacct_set_flag(DELAYACCT_PF_SWAPIN
);
2694 page
= lookup_swap_cache(entry
, vma
, vmf
->address
);
2698 struct swap_info_struct
*si
= swp_swap_info(entry
);
2700 if (si
->flags
& SWP_SYNCHRONOUS_IO
&&
2701 __swap_count(si
, entry
) == 1) {
2702 /* skip swapcache */
2703 page
= alloc_page_vma(GFP_HIGHUSER_MOVABLE
, vma
,
2706 __SetPageLocked(page
);
2707 __SetPageSwapBacked(page
);
2708 set_page_private(page
, entry
.val
);
2709 lru_cache_add_anon(page
);
2710 swap_readpage(page
, true);
2713 page
= swapin_readahead(entry
, GFP_HIGHUSER_MOVABLE
,
2720 * Back out if somebody else faulted in this pte
2721 * while we released the pte lock.
2723 vmf
->pte
= pte_offset_map_lock(vma
->vm_mm
, vmf
->pmd
,
2724 vmf
->address
, &vmf
->ptl
);
2725 if (likely(pte_same(*vmf
->pte
, vmf
->orig_pte
)))
2727 delayacct_clear_flag(DELAYACCT_PF_SWAPIN
);
2731 /* Had to read the page from swap area: Major fault */
2732 ret
= VM_FAULT_MAJOR
;
2733 count_vm_event(PGMAJFAULT
);
2734 count_memcg_event_mm(vma
->vm_mm
, PGMAJFAULT
);
2735 } else if (PageHWPoison(page
)) {
2737 * hwpoisoned dirty swapcache pages are kept for killing
2738 * owner processes (which may be unknown at hwpoison time)
2740 ret
= VM_FAULT_HWPOISON
;
2741 delayacct_clear_flag(DELAYACCT_PF_SWAPIN
);
2745 locked
= lock_page_or_retry(page
, vma
->vm_mm
, vmf
->flags
);
2747 delayacct_clear_flag(DELAYACCT_PF_SWAPIN
);
2749 ret
|= VM_FAULT_RETRY
;
2754 * Make sure try_to_free_swap or reuse_swap_page or swapoff did not
2755 * release the swapcache from under us. The page pin, and pte_same
2756 * test below, are not enough to exclude that. Even if it is still
2757 * swapcache, we need to check that the page's swap has not changed.
2759 if (unlikely((!PageSwapCache(page
) ||
2760 page_private(page
) != entry
.val
)) && swapcache
)
2763 page
= ksm_might_need_to_copy(page
, vma
, vmf
->address
);
2764 if (unlikely(!page
)) {
2770 if (mem_cgroup_try_charge_delay(page
, vma
->vm_mm
, GFP_KERNEL
,
2777 * Back out if somebody else already faulted in this pte.
2779 vmf
->pte
= pte_offset_map_lock(vma
->vm_mm
, vmf
->pmd
, vmf
->address
,
2781 if (unlikely(!pte_same(*vmf
->pte
, vmf
->orig_pte
)))
2784 if (unlikely(!PageUptodate(page
))) {
2785 ret
= VM_FAULT_SIGBUS
;
2790 * The page isn't present yet, go ahead with the fault.
2792 * Be careful about the sequence of operations here.
2793 * To get its accounting right, reuse_swap_page() must be called
2794 * while the page is counted on swap but not yet in mapcount i.e.
2795 * before page_add_anon_rmap() and swap_free(); try_to_free_swap()
2796 * must be called after the swap_free(), or it will never succeed.
2799 inc_mm_counter_fast(vma
->vm_mm
, MM_ANONPAGES
);
2800 dec_mm_counter_fast(vma
->vm_mm
, MM_SWAPENTS
);
2801 pte
= mk_pte(page
, vma
->vm_page_prot
);
2802 if ((vmf
->flags
& FAULT_FLAG_WRITE
) && reuse_swap_page(page
, NULL
)) {
2803 pte
= maybe_mkwrite(pte_mkdirty(pte
), vma
);
2804 vmf
->flags
&= ~FAULT_FLAG_WRITE
;
2805 ret
|= VM_FAULT_WRITE
;
2806 exclusive
= RMAP_EXCLUSIVE
;
2808 flush_icache_page(vma
, page
);
2809 if (pte_swp_soft_dirty(vmf
->orig_pte
))
2810 pte
= pte_mksoft_dirty(pte
);
2811 set_pte_at(vma
->vm_mm
, vmf
->address
, vmf
->pte
, pte
);
2812 arch_do_swap_page(vma
->vm_mm
, vma
, vmf
->address
, pte
, vmf
->orig_pte
);
2813 vmf
->orig_pte
= pte
;
2815 /* ksm created a completely new copy */
2816 if (unlikely(page
!= swapcache
&& swapcache
)) {
2817 page_add_new_anon_rmap(page
, vma
, vmf
->address
, false);
2818 mem_cgroup_commit_charge(page
, memcg
, false, false);
2819 lru_cache_add_active_or_unevictable(page
, vma
);
2821 do_page_add_anon_rmap(page
, vma
, vmf
->address
, exclusive
);
2822 mem_cgroup_commit_charge(page
, memcg
, true, false);
2823 activate_page(page
);
2827 if (mem_cgroup_swap_full(page
) ||
2828 (vma
->vm_flags
& VM_LOCKED
) || PageMlocked(page
))
2829 try_to_free_swap(page
);
2831 if (page
!= swapcache
&& swapcache
) {
2833 * Hold the lock to avoid the swap entry to be reused
2834 * until we take the PT lock for the pte_same() check
2835 * (to avoid false positives from pte_same). For
2836 * further safety release the lock after the swap_free
2837 * so that the swap count won't change under a
2838 * parallel locked swapcache.
2840 unlock_page(swapcache
);
2841 put_page(swapcache
);
2844 if (vmf
->flags
& FAULT_FLAG_WRITE
) {
2845 ret
|= do_wp_page(vmf
);
2846 if (ret
& VM_FAULT_ERROR
)
2847 ret
&= VM_FAULT_ERROR
;
2851 /* No need to invalidate - it was non-present before */
2852 update_mmu_cache(vma
, vmf
->address
, vmf
->pte
);
2854 pte_unmap_unlock(vmf
->pte
, vmf
->ptl
);
2858 mem_cgroup_cancel_charge(page
, memcg
, false);
2859 pte_unmap_unlock(vmf
->pte
, vmf
->ptl
);
2864 if (page
!= swapcache
&& swapcache
) {
2865 unlock_page(swapcache
);
2866 put_page(swapcache
);
2872 * We enter with non-exclusive mmap_sem (to exclude vma changes,
2873 * but allow concurrent faults), and pte mapped but not yet locked.
2874 * We return with mmap_sem still held, but pte unmapped and unlocked.
2876 static vm_fault_t
do_anonymous_page(struct vm_fault
*vmf
)
2878 struct vm_area_struct
*vma
= vmf
->vma
;
2879 struct mem_cgroup
*memcg
;
2884 /* File mapping without ->vm_ops ? */
2885 if (vma
->vm_flags
& VM_SHARED
)
2886 return VM_FAULT_SIGBUS
;
2889 * Use pte_alloc() instead of pte_alloc_map(). We can't run
2890 * pte_offset_map() on pmds where a huge pmd might be created
2891 * from a different thread.
2893 * pte_alloc_map() is safe to use under down_write(mmap_sem) or when
2894 * parallel threads are excluded by other means.
2896 * Here we only have down_read(mmap_sem).
2898 if (pte_alloc(vma
->vm_mm
, vmf
->pmd
, vmf
->address
))
2899 return VM_FAULT_OOM
;
2901 /* See the comment in pte_alloc_one_map() */
2902 if (unlikely(pmd_trans_unstable(vmf
->pmd
)))
2905 /* Use the zero-page for reads */
2906 if (!(vmf
->flags
& FAULT_FLAG_WRITE
) &&
2907 !mm_forbids_zeropage(vma
->vm_mm
)) {
2908 entry
= pte_mkspecial(pfn_pte(my_zero_pfn(vmf
->address
),
2909 vma
->vm_page_prot
));
2910 vmf
->pte
= pte_offset_map_lock(vma
->vm_mm
, vmf
->pmd
,
2911 vmf
->address
, &vmf
->ptl
);
2912 if (!pte_none(*vmf
->pte
))
2914 ret
= check_stable_address_space(vma
->vm_mm
);
2917 /* Deliver the page fault to userland, check inside PT lock */
2918 if (userfaultfd_missing(vma
)) {
2919 pte_unmap_unlock(vmf
->pte
, vmf
->ptl
);
2920 return handle_userfault(vmf
, VM_UFFD_MISSING
);
2925 /* Allocate our own private page. */
2926 if (unlikely(anon_vma_prepare(vma
)))
2928 page
= alloc_zeroed_user_highpage_movable(vma
, vmf
->address
);
2932 if (mem_cgroup_try_charge_delay(page
, vma
->vm_mm
, GFP_KERNEL
, &memcg
,
2937 * The memory barrier inside __SetPageUptodate makes sure that
2938 * preceeding stores to the page contents become visible before
2939 * the set_pte_at() write.
2941 __SetPageUptodate(page
);
2943 entry
= mk_pte(page
, vma
->vm_page_prot
);
2944 if (vma
->vm_flags
& VM_WRITE
)
2945 entry
= pte_mkwrite(pte_mkdirty(entry
));
2947 vmf
->pte
= pte_offset_map_lock(vma
->vm_mm
, vmf
->pmd
, vmf
->address
,
2949 if (!pte_none(*vmf
->pte
))
2952 ret
= check_stable_address_space(vma
->vm_mm
);
2956 /* Deliver the page fault to userland, check inside PT lock */
2957 if (userfaultfd_missing(vma
)) {
2958 pte_unmap_unlock(vmf
->pte
, vmf
->ptl
);
2959 mem_cgroup_cancel_charge(page
, memcg
, false);
2961 return handle_userfault(vmf
, VM_UFFD_MISSING
);
2964 inc_mm_counter_fast(vma
->vm_mm
, MM_ANONPAGES
);
2965 page_add_new_anon_rmap(page
, vma
, vmf
->address
, false);
2966 mem_cgroup_commit_charge(page
, memcg
, false, false);
2967 lru_cache_add_active_or_unevictable(page
, vma
);
2969 set_pte_at(vma
->vm_mm
, vmf
->address
, vmf
->pte
, entry
);
2971 /* No need to invalidate - it was non-present before */
2972 update_mmu_cache(vma
, vmf
->address
, vmf
->pte
);
2974 pte_unmap_unlock(vmf
->pte
, vmf
->ptl
);
2977 mem_cgroup_cancel_charge(page
, memcg
, false);
2983 return VM_FAULT_OOM
;
2987 * The mmap_sem must have been held on entry, and may have been
2988 * released depending on flags and vma->vm_ops->fault() return value.
2989 * See filemap_fault() and __lock_page_retry().
2991 static vm_fault_t
__do_fault(struct vm_fault
*vmf
)
2993 struct vm_area_struct
*vma
= vmf
->vma
;
2996 ret
= vma
->vm_ops
->fault(vmf
);
2997 if (unlikely(ret
& (VM_FAULT_ERROR
| VM_FAULT_NOPAGE
| VM_FAULT_RETRY
|
2998 VM_FAULT_DONE_COW
)))
3001 if (unlikely(PageHWPoison(vmf
->page
))) {
3002 if (ret
& VM_FAULT_LOCKED
)
3003 unlock_page(vmf
->page
);
3004 put_page(vmf
->page
);
3006 return VM_FAULT_HWPOISON
;
3009 if (unlikely(!(ret
& VM_FAULT_LOCKED
)))
3010 lock_page(vmf
->page
);
3012 VM_BUG_ON_PAGE(!PageLocked(vmf
->page
), vmf
->page
);
3018 * The ordering of these checks is important for pmds with _PAGE_DEVMAP set.
3019 * If we check pmd_trans_unstable() first we will trip the bad_pmd() check
3020 * inside of pmd_none_or_trans_huge_or_clear_bad(). This will end up correctly
3021 * returning 1 but not before it spams dmesg with the pmd_clear_bad() output.
3023 static int pmd_devmap_trans_unstable(pmd_t
*pmd
)
3025 return pmd_devmap(*pmd
) || pmd_trans_unstable(pmd
);
3028 static vm_fault_t
pte_alloc_one_map(struct vm_fault
*vmf
)
3030 struct vm_area_struct
*vma
= vmf
->vma
;
3032 if (!pmd_none(*vmf
->pmd
))
3034 if (vmf
->prealloc_pte
) {
3035 vmf
->ptl
= pmd_lock(vma
->vm_mm
, vmf
->pmd
);
3036 if (unlikely(!pmd_none(*vmf
->pmd
))) {
3037 spin_unlock(vmf
->ptl
);
3041 mm_inc_nr_ptes(vma
->vm_mm
);
3042 pmd_populate(vma
->vm_mm
, vmf
->pmd
, vmf
->prealloc_pte
);
3043 spin_unlock(vmf
->ptl
);
3044 vmf
->prealloc_pte
= NULL
;
3045 } else if (unlikely(pte_alloc(vma
->vm_mm
, vmf
->pmd
, vmf
->address
))) {
3046 return VM_FAULT_OOM
;
3050 * If a huge pmd materialized under us just retry later. Use
3051 * pmd_trans_unstable() via pmd_devmap_trans_unstable() instead of
3052 * pmd_trans_huge() to ensure the pmd didn't become pmd_trans_huge
3053 * under us and then back to pmd_none, as a result of MADV_DONTNEED
3054 * running immediately after a huge pmd fault in a different thread of
3055 * this mm, in turn leading to a misleading pmd_trans_huge() retval.
3056 * All we have to ensure is that it is a regular pmd that we can walk
3057 * with pte_offset_map() and we can do that through an atomic read in
3058 * C, which is what pmd_trans_unstable() provides.
3060 if (pmd_devmap_trans_unstable(vmf
->pmd
))
3061 return VM_FAULT_NOPAGE
;
3064 * At this point we know that our vmf->pmd points to a page of ptes
3065 * and it cannot become pmd_none(), pmd_devmap() or pmd_trans_huge()
3066 * for the duration of the fault. If a racing MADV_DONTNEED runs and
3067 * we zap the ptes pointed to by our vmf->pmd, the vmf->ptl will still
3068 * be valid and we will re-check to make sure the vmf->pte isn't
3069 * pte_none() under vmf->ptl protection when we return to
3072 vmf
->pte
= pte_offset_map_lock(vma
->vm_mm
, vmf
->pmd
, vmf
->address
,
3077 #ifdef CONFIG_TRANSPARENT_HUGE_PAGECACHE
3079 #define HPAGE_CACHE_INDEX_MASK (HPAGE_PMD_NR - 1)
3080 static inline bool transhuge_vma_suitable(struct vm_area_struct
*vma
,
3081 unsigned long haddr
)
3083 if (((vma
->vm_start
>> PAGE_SHIFT
) & HPAGE_CACHE_INDEX_MASK
) !=
3084 (vma
->vm_pgoff
& HPAGE_CACHE_INDEX_MASK
))
3086 if (haddr
< vma
->vm_start
|| haddr
+ HPAGE_PMD_SIZE
> vma
->vm_end
)
3091 static void deposit_prealloc_pte(struct vm_fault
*vmf
)
3093 struct vm_area_struct
*vma
= vmf
->vma
;
3095 pgtable_trans_huge_deposit(vma
->vm_mm
, vmf
->pmd
, vmf
->prealloc_pte
);
3097 * We are going to consume the prealloc table,
3098 * count that as nr_ptes.
3100 mm_inc_nr_ptes(vma
->vm_mm
);
3101 vmf
->prealloc_pte
= NULL
;
3104 static vm_fault_t
do_set_pmd(struct vm_fault
*vmf
, struct page
*page
)
3106 struct vm_area_struct
*vma
= vmf
->vma
;
3107 bool write
= vmf
->flags
& FAULT_FLAG_WRITE
;
3108 unsigned long haddr
= vmf
->address
& HPAGE_PMD_MASK
;
3113 if (!transhuge_vma_suitable(vma
, haddr
))
3114 return VM_FAULT_FALLBACK
;
3116 ret
= VM_FAULT_FALLBACK
;
3117 page
= compound_head(page
);
3120 * Archs like ppc64 need additonal space to store information
3121 * related to pte entry. Use the preallocated table for that.
3123 if (arch_needs_pgtable_deposit() && !vmf
->prealloc_pte
) {
3124 vmf
->prealloc_pte
= pte_alloc_one(vma
->vm_mm
, vmf
->address
);
3125 if (!vmf
->prealloc_pte
)
3126 return VM_FAULT_OOM
;
3127 smp_wmb(); /* See comment in __pte_alloc() */
3130 vmf
->ptl
= pmd_lock(vma
->vm_mm
, vmf
->pmd
);
3131 if (unlikely(!pmd_none(*vmf
->pmd
)))
3134 for (i
= 0; i
< HPAGE_PMD_NR
; i
++)
3135 flush_icache_page(vma
, page
+ i
);
3137 entry
= mk_huge_pmd(page
, vma
->vm_page_prot
);
3139 entry
= maybe_pmd_mkwrite(pmd_mkdirty(entry
), vma
);
3141 add_mm_counter(vma
->vm_mm
, mm_counter_file(page
), HPAGE_PMD_NR
);
3142 page_add_file_rmap(page
, true);
3144 * deposit and withdraw with pmd lock held
3146 if (arch_needs_pgtable_deposit())
3147 deposit_prealloc_pte(vmf
);
3149 set_pmd_at(vma
->vm_mm
, haddr
, vmf
->pmd
, entry
);
3151 update_mmu_cache_pmd(vma
, haddr
, vmf
->pmd
);
3153 /* fault is handled */
3155 count_vm_event(THP_FILE_MAPPED
);
3157 spin_unlock(vmf
->ptl
);
3161 static vm_fault_t
do_set_pmd(struct vm_fault
*vmf
, struct page
*page
)
3169 * alloc_set_pte - setup new PTE entry for given page and add reverse page
3170 * mapping. If needed, the fucntion allocates page table or use pre-allocated.
3172 * @vmf: fault environment
3173 * @memcg: memcg to charge page (only for private mappings)
3174 * @page: page to map
3176 * Caller must take care of unlocking vmf->ptl, if vmf->pte is non-NULL on
3179 * Target users are page handler itself and implementations of
3180 * vm_ops->map_pages.
3182 vm_fault_t
alloc_set_pte(struct vm_fault
*vmf
, struct mem_cgroup
*memcg
,
3185 struct vm_area_struct
*vma
= vmf
->vma
;
3186 bool write
= vmf
->flags
& FAULT_FLAG_WRITE
;
3190 if (pmd_none(*vmf
->pmd
) && PageTransCompound(page
) &&
3191 IS_ENABLED(CONFIG_TRANSPARENT_HUGE_PAGECACHE
)) {
3193 VM_BUG_ON_PAGE(memcg
, page
);
3195 ret
= do_set_pmd(vmf
, page
);
3196 if (ret
!= VM_FAULT_FALLBACK
)
3201 ret
= pte_alloc_one_map(vmf
);
3206 /* Re-check under ptl */
3207 if (unlikely(!pte_none(*vmf
->pte
)))
3208 return VM_FAULT_NOPAGE
;
3210 flush_icache_page(vma
, page
);
3211 entry
= mk_pte(page
, vma
->vm_page_prot
);
3213 entry
= maybe_mkwrite(pte_mkdirty(entry
), vma
);
3214 /* copy-on-write page */
3215 if (write
&& !(vma
->vm_flags
& VM_SHARED
)) {
3216 inc_mm_counter_fast(vma
->vm_mm
, MM_ANONPAGES
);
3217 page_add_new_anon_rmap(page
, vma
, vmf
->address
, false);
3218 mem_cgroup_commit_charge(page
, memcg
, false, false);
3219 lru_cache_add_active_or_unevictable(page
, vma
);
3221 inc_mm_counter_fast(vma
->vm_mm
, mm_counter_file(page
));
3222 page_add_file_rmap(page
, false);
3224 set_pte_at(vma
->vm_mm
, vmf
->address
, vmf
->pte
, entry
);
3226 /* no need to invalidate: a not-present page won't be cached */
3227 update_mmu_cache(vma
, vmf
->address
, vmf
->pte
);
3234 * finish_fault - finish page fault once we have prepared the page to fault
3236 * @vmf: structure describing the fault
3238 * This function handles all that is needed to finish a page fault once the
3239 * page to fault in is prepared. It handles locking of PTEs, inserts PTE for
3240 * given page, adds reverse page mapping, handles memcg charges and LRU
3241 * addition. The function returns 0 on success, VM_FAULT_ code in case of
3244 * The function expects the page to be locked and on success it consumes a
3245 * reference of a page being mapped (for the PTE which maps it).
3247 vm_fault_t
finish_fault(struct vm_fault
*vmf
)
3252 /* Did we COW the page? */
3253 if ((vmf
->flags
& FAULT_FLAG_WRITE
) &&
3254 !(vmf
->vma
->vm_flags
& VM_SHARED
))
3255 page
= vmf
->cow_page
;
3260 * check even for read faults because we might have lost our CoWed
3263 if (!(vmf
->vma
->vm_flags
& VM_SHARED
))
3264 ret
= check_stable_address_space(vmf
->vma
->vm_mm
);
3266 ret
= alloc_set_pte(vmf
, vmf
->memcg
, page
);
3268 pte_unmap_unlock(vmf
->pte
, vmf
->ptl
);
3272 static unsigned long fault_around_bytes __read_mostly
=
3273 rounddown_pow_of_two(65536);
3275 #ifdef CONFIG_DEBUG_FS
3276 static int fault_around_bytes_get(void *data
, u64
*val
)
3278 *val
= fault_around_bytes
;
3283 * fault_around_bytes must be rounded down to the nearest page order as it's
3284 * what do_fault_around() expects to see.
3286 static int fault_around_bytes_set(void *data
, u64 val
)
3288 if (val
/ PAGE_SIZE
> PTRS_PER_PTE
)
3290 if (val
> PAGE_SIZE
)
3291 fault_around_bytes
= rounddown_pow_of_two(val
);
3293 fault_around_bytes
= PAGE_SIZE
; /* rounddown_pow_of_two(0) is undefined */
3296 DEFINE_DEBUGFS_ATTRIBUTE(fault_around_bytes_fops
,
3297 fault_around_bytes_get
, fault_around_bytes_set
, "%llu\n");
3299 static int __init
fault_around_debugfs(void)
3303 ret
= debugfs_create_file_unsafe("fault_around_bytes", 0644, NULL
, NULL
,
3304 &fault_around_bytes_fops
);
3306 pr_warn("Failed to create fault_around_bytes in debugfs");
3309 late_initcall(fault_around_debugfs
);
3313 * do_fault_around() tries to map few pages around the fault address. The hope
3314 * is that the pages will be needed soon and this will lower the number of
3317 * It uses vm_ops->map_pages() to map the pages, which skips the page if it's
3318 * not ready to be mapped: not up-to-date, locked, etc.
3320 * This function is called with the page table lock taken. In the split ptlock
3321 * case the page table lock only protects only those entries which belong to
3322 * the page table corresponding to the fault address.
3324 * This function doesn't cross the VMA boundaries, in order to call map_pages()
3327 * fault_around_bytes defines how many bytes we'll try to map.
3328 * do_fault_around() expects it to be set to a power of two less than or equal
3331 * The virtual address of the area that we map is naturally aligned to
3332 * fault_around_bytes rounded down to the machine page size
3333 * (and therefore to page order). This way it's easier to guarantee
3334 * that we don't cross page table boundaries.
3336 static vm_fault_t
do_fault_around(struct vm_fault
*vmf
)
3338 unsigned long address
= vmf
->address
, nr_pages
, mask
;
3339 pgoff_t start_pgoff
= vmf
->pgoff
;
3344 nr_pages
= READ_ONCE(fault_around_bytes
) >> PAGE_SHIFT
;
3345 mask
= ~(nr_pages
* PAGE_SIZE
- 1) & PAGE_MASK
;
3347 vmf
->address
= max(address
& mask
, vmf
->vma
->vm_start
);
3348 off
= ((address
- vmf
->address
) >> PAGE_SHIFT
) & (PTRS_PER_PTE
- 1);
3352 * end_pgoff is either the end of the page table, the end of
3353 * the vma or nr_pages from start_pgoff, depending what is nearest.
3355 end_pgoff
= start_pgoff
-
3356 ((vmf
->address
>> PAGE_SHIFT
) & (PTRS_PER_PTE
- 1)) +
3358 end_pgoff
= min3(end_pgoff
, vma_pages(vmf
->vma
) + vmf
->vma
->vm_pgoff
- 1,
3359 start_pgoff
+ nr_pages
- 1);
3361 if (pmd_none(*vmf
->pmd
)) {
3362 vmf
->prealloc_pte
= pte_alloc_one(vmf
->vma
->vm_mm
,
3364 if (!vmf
->prealloc_pte
)
3366 smp_wmb(); /* See comment in __pte_alloc() */
3369 vmf
->vma
->vm_ops
->map_pages(vmf
, start_pgoff
, end_pgoff
);
3371 /* Huge page is mapped? Page fault is solved */
3372 if (pmd_trans_huge(*vmf
->pmd
)) {
3373 ret
= VM_FAULT_NOPAGE
;
3377 /* ->map_pages() haven't done anything useful. Cold page cache? */
3381 /* check if the page fault is solved */
3382 vmf
->pte
-= (vmf
->address
>> PAGE_SHIFT
) - (address
>> PAGE_SHIFT
);
3383 if (!pte_none(*vmf
->pte
))
3384 ret
= VM_FAULT_NOPAGE
;
3385 pte_unmap_unlock(vmf
->pte
, vmf
->ptl
);
3387 vmf
->address
= address
;
3392 static vm_fault_t
do_read_fault(struct vm_fault
*vmf
)
3394 struct vm_area_struct
*vma
= vmf
->vma
;
3398 * Let's call ->map_pages() first and use ->fault() as fallback
3399 * if page by the offset is not ready to be mapped (cold cache or
3402 if (vma
->vm_ops
->map_pages
&& fault_around_bytes
>> PAGE_SHIFT
> 1) {
3403 ret
= do_fault_around(vmf
);
3408 ret
= __do_fault(vmf
);
3409 if (unlikely(ret
& (VM_FAULT_ERROR
| VM_FAULT_NOPAGE
| VM_FAULT_RETRY
)))
3412 ret
|= finish_fault(vmf
);
3413 unlock_page(vmf
->page
);
3414 if (unlikely(ret
& (VM_FAULT_ERROR
| VM_FAULT_NOPAGE
| VM_FAULT_RETRY
)))
3415 put_page(vmf
->page
);
3419 static vm_fault_t
do_cow_fault(struct vm_fault
*vmf
)
3421 struct vm_area_struct
*vma
= vmf
->vma
;
3424 if (unlikely(anon_vma_prepare(vma
)))
3425 return VM_FAULT_OOM
;
3427 vmf
->cow_page
= alloc_page_vma(GFP_HIGHUSER_MOVABLE
, vma
, vmf
->address
);
3429 return VM_FAULT_OOM
;
3431 if (mem_cgroup_try_charge_delay(vmf
->cow_page
, vma
->vm_mm
, GFP_KERNEL
,
3432 &vmf
->memcg
, false)) {
3433 put_page(vmf
->cow_page
);
3434 return VM_FAULT_OOM
;
3437 ret
= __do_fault(vmf
);
3438 if (unlikely(ret
& (VM_FAULT_ERROR
| VM_FAULT_NOPAGE
| VM_FAULT_RETRY
)))
3440 if (ret
& VM_FAULT_DONE_COW
)
3443 copy_user_highpage(vmf
->cow_page
, vmf
->page
, vmf
->address
, vma
);
3444 __SetPageUptodate(vmf
->cow_page
);
3446 ret
|= finish_fault(vmf
);
3447 unlock_page(vmf
->page
);
3448 put_page(vmf
->page
);
3449 if (unlikely(ret
& (VM_FAULT_ERROR
| VM_FAULT_NOPAGE
| VM_FAULT_RETRY
)))
3453 mem_cgroup_cancel_charge(vmf
->cow_page
, vmf
->memcg
, false);
3454 put_page(vmf
->cow_page
);
3458 static vm_fault_t
do_shared_fault(struct vm_fault
*vmf
)
3460 struct vm_area_struct
*vma
= vmf
->vma
;
3461 vm_fault_t ret
, tmp
;
3463 ret
= __do_fault(vmf
);
3464 if (unlikely(ret
& (VM_FAULT_ERROR
| VM_FAULT_NOPAGE
| VM_FAULT_RETRY
)))
3468 * Check if the backing address space wants to know that the page is
3469 * about to become writable
3471 if (vma
->vm_ops
->page_mkwrite
) {
3472 unlock_page(vmf
->page
);
3473 tmp
= do_page_mkwrite(vmf
);
3474 if (unlikely(!tmp
||
3475 (tmp
& (VM_FAULT_ERROR
| VM_FAULT_NOPAGE
)))) {
3476 put_page(vmf
->page
);
3481 ret
|= finish_fault(vmf
);
3482 if (unlikely(ret
& (VM_FAULT_ERROR
| VM_FAULT_NOPAGE
|
3484 unlock_page(vmf
->page
);
3485 put_page(vmf
->page
);
3489 fault_dirty_shared_page(vma
, vmf
->page
);
3494 * We enter with non-exclusive mmap_sem (to exclude vma changes,
3495 * but allow concurrent faults).
3496 * The mmap_sem may have been released depending on flags and our
3497 * return value. See filemap_fault() and __lock_page_or_retry().
3499 static vm_fault_t
do_fault(struct vm_fault
*vmf
)
3501 struct vm_area_struct
*vma
= vmf
->vma
;
3505 * The VMA was not fully populated on mmap() or missing VM_DONTEXPAND
3507 if (!vma
->vm_ops
->fault
) {
3509 * If we find a migration pmd entry or a none pmd entry, which
3510 * should never happen, return SIGBUS
3512 if (unlikely(!pmd_present(*vmf
->pmd
)))
3513 ret
= VM_FAULT_SIGBUS
;
3515 vmf
->pte
= pte_offset_map_lock(vmf
->vma
->vm_mm
,
3520 * Make sure this is not a temporary clearing of pte
3521 * by holding ptl and checking again. A R/M/W update
3522 * of pte involves: take ptl, clearing the pte so that
3523 * we don't have concurrent modification by hardware
3524 * followed by an update.
3526 if (unlikely(pte_none(*vmf
->pte
)))
3527 ret
= VM_FAULT_SIGBUS
;
3529 ret
= VM_FAULT_NOPAGE
;
3531 pte_unmap_unlock(vmf
->pte
, vmf
->ptl
);
3533 } else if (!(vmf
->flags
& FAULT_FLAG_WRITE
))
3534 ret
= do_read_fault(vmf
);
3535 else if (!(vma
->vm_flags
& VM_SHARED
))
3536 ret
= do_cow_fault(vmf
);
3538 ret
= do_shared_fault(vmf
);
3540 /* preallocated pagetable is unused: free it */
3541 if (vmf
->prealloc_pte
) {
3542 pte_free(vma
->vm_mm
, vmf
->prealloc_pte
);
3543 vmf
->prealloc_pte
= NULL
;
3548 static int numa_migrate_prep(struct page
*page
, struct vm_area_struct
*vma
,
3549 unsigned long addr
, int page_nid
,
3554 count_vm_numa_event(NUMA_HINT_FAULTS
);
3555 if (page_nid
== numa_node_id()) {
3556 count_vm_numa_event(NUMA_HINT_FAULTS_LOCAL
);
3557 *flags
|= TNF_FAULT_LOCAL
;
3560 return mpol_misplaced(page
, vma
, addr
);
3563 static vm_fault_t
do_numa_page(struct vm_fault
*vmf
)
3565 struct vm_area_struct
*vma
= vmf
->vma
;
3566 struct page
*page
= NULL
;
3570 bool migrated
= false;
3572 bool was_writable
= pte_savedwrite(vmf
->orig_pte
);
3576 * The "pte" at this point cannot be used safely without
3577 * validation through pte_unmap_same(). It's of NUMA type but
3578 * the pfn may be screwed if the read is non atomic.
3580 vmf
->ptl
= pte_lockptr(vma
->vm_mm
, vmf
->pmd
);
3581 spin_lock(vmf
->ptl
);
3582 if (unlikely(!pte_same(*vmf
->pte
, vmf
->orig_pte
))) {
3583 pte_unmap_unlock(vmf
->pte
, vmf
->ptl
);
3588 * Make it present again, Depending on how arch implementes non
3589 * accessible ptes, some can allow access by kernel mode.
3591 pte
= ptep_modify_prot_start(vma
->vm_mm
, vmf
->address
, vmf
->pte
);
3592 pte
= pte_modify(pte
, vma
->vm_page_prot
);
3593 pte
= pte_mkyoung(pte
);
3595 pte
= pte_mkwrite(pte
);
3596 ptep_modify_prot_commit(vma
->vm_mm
, vmf
->address
, vmf
->pte
, pte
);
3597 update_mmu_cache(vma
, vmf
->address
, vmf
->pte
);
3599 page
= vm_normal_page(vma
, vmf
->address
, pte
);
3601 pte_unmap_unlock(vmf
->pte
, vmf
->ptl
);
3605 /* TODO: handle PTE-mapped THP */
3606 if (PageCompound(page
)) {
3607 pte_unmap_unlock(vmf
->pte
, vmf
->ptl
);
3612 * Avoid grouping on RO pages in general. RO pages shouldn't hurt as
3613 * much anyway since they can be in shared cache state. This misses
3614 * the case where a mapping is writable but the process never writes
3615 * to it but pte_write gets cleared during protection updates and
3616 * pte_dirty has unpredictable behaviour between PTE scan updates,
3617 * background writeback, dirty balancing and application behaviour.
3619 if (!pte_write(pte
))
3620 flags
|= TNF_NO_GROUP
;
3623 * Flag if the page is shared between multiple address spaces. This
3624 * is later used when determining whether to group tasks together
3626 if (page_mapcount(page
) > 1 && (vma
->vm_flags
& VM_SHARED
))
3627 flags
|= TNF_SHARED
;
3629 last_cpupid
= page_cpupid_last(page
);
3630 page_nid
= page_to_nid(page
);
3631 target_nid
= numa_migrate_prep(page
, vma
, vmf
->address
, page_nid
,
3633 pte_unmap_unlock(vmf
->pte
, vmf
->ptl
);
3634 if (target_nid
== -1) {
3639 /* Migrate to the requested node */
3640 migrated
= migrate_misplaced_page(page
, vma
, target_nid
);
3642 page_nid
= target_nid
;
3643 flags
|= TNF_MIGRATED
;
3645 flags
|= TNF_MIGRATE_FAIL
;
3649 task_numa_fault(last_cpupid
, page_nid
, 1, flags
);
3653 static inline vm_fault_t
create_huge_pmd(struct vm_fault
*vmf
)
3655 if (vma_is_anonymous(vmf
->vma
))
3656 return do_huge_pmd_anonymous_page(vmf
);
3657 if (vmf
->vma
->vm_ops
->huge_fault
)
3658 return vmf
->vma
->vm_ops
->huge_fault(vmf
, PE_SIZE_PMD
);
3659 return VM_FAULT_FALLBACK
;
3662 /* `inline' is required to avoid gcc 4.1.2 build error */
3663 static inline vm_fault_t
wp_huge_pmd(struct vm_fault
*vmf
, pmd_t orig_pmd
)
3665 if (vma_is_anonymous(vmf
->vma
))
3666 return do_huge_pmd_wp_page(vmf
, orig_pmd
);
3667 if (vmf
->vma
->vm_ops
->huge_fault
)
3668 return vmf
->vma
->vm_ops
->huge_fault(vmf
, PE_SIZE_PMD
);
3670 /* COW handled on pte level: split pmd */
3671 VM_BUG_ON_VMA(vmf
->vma
->vm_flags
& VM_SHARED
, vmf
->vma
);
3672 __split_huge_pmd(vmf
->vma
, vmf
->pmd
, vmf
->address
, false, NULL
);
3674 return VM_FAULT_FALLBACK
;
3677 static inline bool vma_is_accessible(struct vm_area_struct
*vma
)
3679 return vma
->vm_flags
& (VM_READ
| VM_EXEC
| VM_WRITE
);
3682 static vm_fault_t
create_huge_pud(struct vm_fault
*vmf
)
3684 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
3685 /* No support for anonymous transparent PUD pages yet */
3686 if (vma_is_anonymous(vmf
->vma
))
3687 return VM_FAULT_FALLBACK
;
3688 if (vmf
->vma
->vm_ops
->huge_fault
)
3689 return vmf
->vma
->vm_ops
->huge_fault(vmf
, PE_SIZE_PUD
);
3690 #endif /* CONFIG_TRANSPARENT_HUGEPAGE */
3691 return VM_FAULT_FALLBACK
;
3694 static vm_fault_t
wp_huge_pud(struct vm_fault
*vmf
, pud_t orig_pud
)
3696 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
3697 /* No support for anonymous transparent PUD pages yet */
3698 if (vma_is_anonymous(vmf
->vma
))
3699 return VM_FAULT_FALLBACK
;
3700 if (vmf
->vma
->vm_ops
->huge_fault
)
3701 return vmf
->vma
->vm_ops
->huge_fault(vmf
, PE_SIZE_PUD
);
3702 #endif /* CONFIG_TRANSPARENT_HUGEPAGE */
3703 return VM_FAULT_FALLBACK
;
3707 * These routines also need to handle stuff like marking pages dirty
3708 * and/or accessed for architectures that don't do it in hardware (most
3709 * RISC architectures). The early dirtying is also good on the i386.
3711 * There is also a hook called "update_mmu_cache()" that architectures
3712 * with external mmu caches can use to update those (ie the Sparc or
3713 * PowerPC hashed page tables that act as extended TLBs).
3715 * We enter with non-exclusive mmap_sem (to exclude vma changes, but allow
3716 * concurrent faults).
3718 * The mmap_sem may have been released depending on flags and our return value.
3719 * See filemap_fault() and __lock_page_or_retry().
3721 static vm_fault_t
handle_pte_fault(struct vm_fault
*vmf
)
3725 if (unlikely(pmd_none(*vmf
->pmd
))) {
3727 * Leave __pte_alloc() until later: because vm_ops->fault may
3728 * want to allocate huge page, and if we expose page table
3729 * for an instant, it will be difficult to retract from
3730 * concurrent faults and from rmap lookups.
3734 /* See comment in pte_alloc_one_map() */
3735 if (pmd_devmap_trans_unstable(vmf
->pmd
))
3738 * A regular pmd is established and it can't morph into a huge
3739 * pmd from under us anymore at this point because we hold the
3740 * mmap_sem read mode and khugepaged takes it in write mode.
3741 * So now it's safe to run pte_offset_map().
3743 vmf
->pte
= pte_offset_map(vmf
->pmd
, vmf
->address
);
3744 vmf
->orig_pte
= *vmf
->pte
;
3747 * some architectures can have larger ptes than wordsize,
3748 * e.g.ppc44x-defconfig has CONFIG_PTE_64BIT=y and
3749 * CONFIG_32BIT=y, so READ_ONCE cannot guarantee atomic
3750 * accesses. The code below just needs a consistent view
3751 * for the ifs and we later double check anyway with the
3752 * ptl lock held. So here a barrier will do.
3755 if (pte_none(vmf
->orig_pte
)) {
3756 pte_unmap(vmf
->pte
);
3762 if (vma_is_anonymous(vmf
->vma
))
3763 return do_anonymous_page(vmf
);
3765 return do_fault(vmf
);
3768 if (!pte_present(vmf
->orig_pte
))
3769 return do_swap_page(vmf
);
3771 if (pte_protnone(vmf
->orig_pte
) && vma_is_accessible(vmf
->vma
))
3772 return do_numa_page(vmf
);
3774 vmf
->ptl
= pte_lockptr(vmf
->vma
->vm_mm
, vmf
->pmd
);
3775 spin_lock(vmf
->ptl
);
3776 entry
= vmf
->orig_pte
;
3777 if (unlikely(!pte_same(*vmf
->pte
, entry
)))
3779 if (vmf
->flags
& FAULT_FLAG_WRITE
) {
3780 if (!pte_write(entry
))
3781 return do_wp_page(vmf
);
3782 entry
= pte_mkdirty(entry
);
3784 entry
= pte_mkyoung(entry
);
3785 if (ptep_set_access_flags(vmf
->vma
, vmf
->address
, vmf
->pte
, entry
,
3786 vmf
->flags
& FAULT_FLAG_WRITE
)) {
3787 update_mmu_cache(vmf
->vma
, vmf
->address
, vmf
->pte
);
3790 * This is needed only for protection faults but the arch code
3791 * is not yet telling us if this is a protection fault or not.
3792 * This still avoids useless tlb flushes for .text page faults
3795 if (vmf
->flags
& FAULT_FLAG_WRITE
)
3796 flush_tlb_fix_spurious_fault(vmf
->vma
, vmf
->address
);
3799 pte_unmap_unlock(vmf
->pte
, vmf
->ptl
);
3804 * By the time we get here, we already hold the mm semaphore
3806 * The mmap_sem may have been released depending on flags and our
3807 * return value. See filemap_fault() and __lock_page_or_retry().
3809 static vm_fault_t
__handle_mm_fault(struct vm_area_struct
*vma
,
3810 unsigned long address
, unsigned int flags
)
3812 struct vm_fault vmf
= {
3814 .address
= address
& PAGE_MASK
,
3816 .pgoff
= linear_page_index(vma
, address
),
3817 .gfp_mask
= __get_fault_gfp_mask(vma
),
3819 unsigned int dirty
= flags
& FAULT_FLAG_WRITE
;
3820 struct mm_struct
*mm
= vma
->vm_mm
;
3825 pgd
= pgd_offset(mm
, address
);
3826 p4d
= p4d_alloc(mm
, pgd
, address
);
3828 return VM_FAULT_OOM
;
3830 vmf
.pud
= pud_alloc(mm
, p4d
, address
);
3832 return VM_FAULT_OOM
;
3833 if (pud_none(*vmf
.pud
) && transparent_hugepage_enabled(vma
)) {
3834 ret
= create_huge_pud(&vmf
);
3835 if (!(ret
& VM_FAULT_FALLBACK
))
3838 pud_t orig_pud
= *vmf
.pud
;
3841 if (pud_trans_huge(orig_pud
) || pud_devmap(orig_pud
)) {
3843 /* NUMA case for anonymous PUDs would go here */
3845 if (dirty
&& !pud_write(orig_pud
)) {
3846 ret
= wp_huge_pud(&vmf
, orig_pud
);
3847 if (!(ret
& VM_FAULT_FALLBACK
))
3850 huge_pud_set_accessed(&vmf
, orig_pud
);
3856 vmf
.pmd
= pmd_alloc(mm
, vmf
.pud
, address
);
3858 return VM_FAULT_OOM
;
3859 if (pmd_none(*vmf
.pmd
) && transparent_hugepage_enabled(vma
)) {
3860 ret
= create_huge_pmd(&vmf
);
3861 if (!(ret
& VM_FAULT_FALLBACK
))
3864 pmd_t orig_pmd
= *vmf
.pmd
;
3867 if (unlikely(is_swap_pmd(orig_pmd
))) {
3868 VM_BUG_ON(thp_migration_supported() &&
3869 !is_pmd_migration_entry(orig_pmd
));
3870 if (is_pmd_migration_entry(orig_pmd
))
3871 pmd_migration_entry_wait(mm
, vmf
.pmd
);
3874 if (pmd_trans_huge(orig_pmd
) || pmd_devmap(orig_pmd
)) {
3875 if (pmd_protnone(orig_pmd
) && vma_is_accessible(vma
))
3876 return do_huge_pmd_numa_page(&vmf
, orig_pmd
);
3878 if (dirty
&& !pmd_write(orig_pmd
)) {
3879 ret
= wp_huge_pmd(&vmf
, orig_pmd
);
3880 if (!(ret
& VM_FAULT_FALLBACK
))
3883 huge_pmd_set_accessed(&vmf
, orig_pmd
);
3889 return handle_pte_fault(&vmf
);
3893 * By the time we get here, we already hold the mm semaphore
3895 * The mmap_sem may have been released depending on flags and our
3896 * return value. See filemap_fault() and __lock_page_or_retry().
3898 vm_fault_t
handle_mm_fault(struct vm_area_struct
*vma
, unsigned long address
,
3903 __set_current_state(TASK_RUNNING
);
3905 count_vm_event(PGFAULT
);
3906 count_memcg_event_mm(vma
->vm_mm
, PGFAULT
);
3908 /* do counter updates before entering really critical section. */
3909 check_sync_rss_stat(current
);
3911 if (!arch_vma_access_permitted(vma
, flags
& FAULT_FLAG_WRITE
,
3912 flags
& FAULT_FLAG_INSTRUCTION
,
3913 flags
& FAULT_FLAG_REMOTE
))
3914 return VM_FAULT_SIGSEGV
;
3917 * Enable the memcg OOM handling for faults triggered in user
3918 * space. Kernel faults are handled more gracefully.
3920 if (flags
& FAULT_FLAG_USER
)
3921 mem_cgroup_enter_user_fault();
3923 if (unlikely(is_vm_hugetlb_page(vma
)))
3924 ret
= hugetlb_fault(vma
->vm_mm
, vma
, address
, flags
);
3926 ret
= __handle_mm_fault(vma
, address
, flags
);
3928 if (flags
& FAULT_FLAG_USER
) {
3929 mem_cgroup_exit_user_fault();
3931 * The task may have entered a memcg OOM situation but
3932 * if the allocation error was handled gracefully (no
3933 * VM_FAULT_OOM), there is no need to kill anything.
3934 * Just clean up the OOM state peacefully.
3936 if (task_in_memcg_oom(current
) && !(ret
& VM_FAULT_OOM
))
3937 mem_cgroup_oom_synchronize(false);
3942 EXPORT_SYMBOL_GPL(handle_mm_fault
);
3944 #ifndef __PAGETABLE_P4D_FOLDED
3946 * Allocate p4d page table.
3947 * We've already handled the fast-path in-line.
3949 int __p4d_alloc(struct mm_struct
*mm
, pgd_t
*pgd
, unsigned long address
)
3951 p4d_t
*new = p4d_alloc_one(mm
, address
);
3955 smp_wmb(); /* See comment in __pte_alloc */
3957 spin_lock(&mm
->page_table_lock
);
3958 if (pgd_present(*pgd
)) /* Another has populated it */
3961 pgd_populate(mm
, pgd
, new);
3962 spin_unlock(&mm
->page_table_lock
);
3965 #endif /* __PAGETABLE_P4D_FOLDED */
3967 #ifndef __PAGETABLE_PUD_FOLDED
3969 * Allocate page upper directory.
3970 * We've already handled the fast-path in-line.
3972 int __pud_alloc(struct mm_struct
*mm
, p4d_t
*p4d
, unsigned long address
)
3974 pud_t
*new = pud_alloc_one(mm
, address
);
3978 smp_wmb(); /* See comment in __pte_alloc */
3980 spin_lock(&mm
->page_table_lock
);
3981 #ifndef __ARCH_HAS_5LEVEL_HACK
3982 if (!p4d_present(*p4d
)) {
3984 p4d_populate(mm
, p4d
, new);
3985 } else /* Another has populated it */
3988 if (!pgd_present(*p4d
)) {
3990 pgd_populate(mm
, p4d
, new);
3991 } else /* Another has populated it */
3993 #endif /* __ARCH_HAS_5LEVEL_HACK */
3994 spin_unlock(&mm
->page_table_lock
);
3997 #endif /* __PAGETABLE_PUD_FOLDED */
3999 #ifndef __PAGETABLE_PMD_FOLDED
4001 * Allocate page middle directory.
4002 * We've already handled the fast-path in-line.
4004 int __pmd_alloc(struct mm_struct
*mm
, pud_t
*pud
, unsigned long address
)
4007 pmd_t
*new = pmd_alloc_one(mm
, address
);
4011 smp_wmb(); /* See comment in __pte_alloc */
4013 ptl
= pud_lock(mm
, pud
);
4014 #ifndef __ARCH_HAS_4LEVEL_HACK
4015 if (!pud_present(*pud
)) {
4017 pud_populate(mm
, pud
, new);
4018 } else /* Another has populated it */
4021 if (!pgd_present(*pud
)) {
4023 pgd_populate(mm
, pud
, new);
4024 } else /* Another has populated it */
4026 #endif /* __ARCH_HAS_4LEVEL_HACK */
4030 #endif /* __PAGETABLE_PMD_FOLDED */
4032 static int __follow_pte_pmd(struct mm_struct
*mm
, unsigned long address
,
4033 unsigned long *start
, unsigned long *end
,
4034 pte_t
**ptepp
, pmd_t
**pmdpp
, spinlock_t
**ptlp
)
4042 pgd
= pgd_offset(mm
, address
);
4043 if (pgd_none(*pgd
) || unlikely(pgd_bad(*pgd
)))
4046 p4d
= p4d_offset(pgd
, address
);
4047 if (p4d_none(*p4d
) || unlikely(p4d_bad(*p4d
)))
4050 pud
= pud_offset(p4d
, address
);
4051 if (pud_none(*pud
) || unlikely(pud_bad(*pud
)))
4054 pmd
= pmd_offset(pud
, address
);
4055 VM_BUG_ON(pmd_trans_huge(*pmd
));
4057 if (pmd_huge(*pmd
)) {
4062 *start
= address
& PMD_MASK
;
4063 *end
= *start
+ PMD_SIZE
;
4064 mmu_notifier_invalidate_range_start(mm
, *start
, *end
);
4066 *ptlp
= pmd_lock(mm
, pmd
);
4067 if (pmd_huge(*pmd
)) {
4073 mmu_notifier_invalidate_range_end(mm
, *start
, *end
);
4076 if (pmd_none(*pmd
) || unlikely(pmd_bad(*pmd
)))
4080 *start
= address
& PAGE_MASK
;
4081 *end
= *start
+ PAGE_SIZE
;
4082 mmu_notifier_invalidate_range_start(mm
, *start
, *end
);
4084 ptep
= pte_offset_map_lock(mm
, pmd
, address
, ptlp
);
4085 if (!pte_present(*ptep
))
4090 pte_unmap_unlock(ptep
, *ptlp
);
4092 mmu_notifier_invalidate_range_end(mm
, *start
, *end
);
4097 static inline int follow_pte(struct mm_struct
*mm
, unsigned long address
,
4098 pte_t
**ptepp
, spinlock_t
**ptlp
)
4102 /* (void) is needed to make gcc happy */
4103 (void) __cond_lock(*ptlp
,
4104 !(res
= __follow_pte_pmd(mm
, address
, NULL
, NULL
,
4105 ptepp
, NULL
, ptlp
)));
4109 int follow_pte_pmd(struct mm_struct
*mm
, unsigned long address
,
4110 unsigned long *start
, unsigned long *end
,
4111 pte_t
**ptepp
, pmd_t
**pmdpp
, spinlock_t
**ptlp
)
4115 /* (void) is needed to make gcc happy */
4116 (void) __cond_lock(*ptlp
,
4117 !(res
= __follow_pte_pmd(mm
, address
, start
, end
,
4118 ptepp
, pmdpp
, ptlp
)));
4121 EXPORT_SYMBOL(follow_pte_pmd
);
4124 * follow_pfn - look up PFN at a user virtual address
4125 * @vma: memory mapping
4126 * @address: user virtual address
4127 * @pfn: location to store found PFN
4129 * Only IO mappings and raw PFN mappings are allowed.
4131 * Returns zero and the pfn at @pfn on success, -ve otherwise.
4133 int follow_pfn(struct vm_area_struct
*vma
, unsigned long address
,
4140 if (!(vma
->vm_flags
& (VM_IO
| VM_PFNMAP
)))
4143 ret
= follow_pte(vma
->vm_mm
, address
, &ptep
, &ptl
);
4146 *pfn
= pte_pfn(*ptep
);
4147 pte_unmap_unlock(ptep
, ptl
);
4150 EXPORT_SYMBOL(follow_pfn
);
4152 #ifdef CONFIG_HAVE_IOREMAP_PROT
4153 int follow_phys(struct vm_area_struct
*vma
,
4154 unsigned long address
, unsigned int flags
,
4155 unsigned long *prot
, resource_size_t
*phys
)
4161 if (!(vma
->vm_flags
& (VM_IO
| VM_PFNMAP
)))
4164 if (follow_pte(vma
->vm_mm
, address
, &ptep
, &ptl
))
4168 if ((flags
& FOLL_WRITE
) && !pte_write(pte
))
4171 *prot
= pgprot_val(pte_pgprot(pte
));
4172 *phys
= (resource_size_t
)pte_pfn(pte
) << PAGE_SHIFT
;
4176 pte_unmap_unlock(ptep
, ptl
);
4181 int generic_access_phys(struct vm_area_struct
*vma
, unsigned long addr
,
4182 void *buf
, int len
, int write
)
4184 resource_size_t phys_addr
;
4185 unsigned long prot
= 0;
4186 void __iomem
*maddr
;
4187 int offset
= addr
& (PAGE_SIZE
-1);
4189 if (follow_phys(vma
, addr
, write
, &prot
, &phys_addr
))
4192 maddr
= ioremap_prot(phys_addr
, PAGE_ALIGN(len
+ offset
), prot
);
4197 memcpy_toio(maddr
+ offset
, buf
, len
);
4199 memcpy_fromio(buf
, maddr
+ offset
, len
);
4204 EXPORT_SYMBOL_GPL(generic_access_phys
);
4208 * Access another process' address space as given in mm. If non-NULL, use the
4209 * given task for page fault accounting.
4211 int __access_remote_vm(struct task_struct
*tsk
, struct mm_struct
*mm
,
4212 unsigned long addr
, void *buf
, int len
, unsigned int gup_flags
)
4214 struct vm_area_struct
*vma
;
4215 void *old_buf
= buf
;
4216 int write
= gup_flags
& FOLL_WRITE
;
4218 down_read(&mm
->mmap_sem
);
4219 /* ignore errors, just check how much was successfully transferred */
4221 int bytes
, ret
, offset
;
4223 struct page
*page
= NULL
;
4225 ret
= get_user_pages_remote(tsk
, mm
, addr
, 1,
4226 gup_flags
, &page
, &vma
, NULL
);
4228 #ifndef CONFIG_HAVE_IOREMAP_PROT
4232 * Check if this is a VM_IO | VM_PFNMAP VMA, which
4233 * we can access using slightly different code.
4235 vma
= find_vma(mm
, addr
);
4236 if (!vma
|| vma
->vm_start
> addr
)
4238 if (vma
->vm_ops
&& vma
->vm_ops
->access
)
4239 ret
= vma
->vm_ops
->access(vma
, addr
, buf
,
4247 offset
= addr
& (PAGE_SIZE
-1);
4248 if (bytes
> PAGE_SIZE
-offset
)
4249 bytes
= PAGE_SIZE
-offset
;
4253 copy_to_user_page(vma
, page
, addr
,
4254 maddr
+ offset
, buf
, bytes
);
4255 set_page_dirty_lock(page
);
4257 copy_from_user_page(vma
, page
, addr
,
4258 buf
, maddr
+ offset
, bytes
);
4267 up_read(&mm
->mmap_sem
);
4269 return buf
- old_buf
;
4273 * access_remote_vm - access another process' address space
4274 * @mm: the mm_struct of the target address space
4275 * @addr: start address to access
4276 * @buf: source or destination buffer
4277 * @len: number of bytes to transfer
4278 * @gup_flags: flags modifying lookup behaviour
4280 * The caller must hold a reference on @mm.
4282 int access_remote_vm(struct mm_struct
*mm
, unsigned long addr
,
4283 void *buf
, int len
, unsigned int gup_flags
)
4285 return __access_remote_vm(NULL
, mm
, addr
, buf
, len
, gup_flags
);
4289 * Access another process' address space.
4290 * Source/target buffer must be kernel space,
4291 * Do not walk the page table directly, use get_user_pages
4293 int access_process_vm(struct task_struct
*tsk
, unsigned long addr
,
4294 void *buf
, int len
, unsigned int gup_flags
)
4296 struct mm_struct
*mm
;
4299 mm
= get_task_mm(tsk
);
4303 ret
= __access_remote_vm(tsk
, mm
, addr
, buf
, len
, gup_flags
);
4309 EXPORT_SYMBOL_GPL(access_process_vm
);
4312 * Print the name of a VMA.
4314 void print_vma_addr(char *prefix
, unsigned long ip
)
4316 struct mm_struct
*mm
= current
->mm
;
4317 struct vm_area_struct
*vma
;
4320 * we might be running from an atomic context so we cannot sleep
4322 if (!down_read_trylock(&mm
->mmap_sem
))
4325 vma
= find_vma(mm
, ip
);
4326 if (vma
&& vma
->vm_file
) {
4327 struct file
*f
= vma
->vm_file
;
4328 char *buf
= (char *)__get_free_page(GFP_NOWAIT
);
4332 p
= file_path(f
, buf
, PAGE_SIZE
);
4335 printk("%s%s[%lx+%lx]", prefix
, kbasename(p
),
4337 vma
->vm_end
- vma
->vm_start
);
4338 free_page((unsigned long)buf
);
4341 up_read(&mm
->mmap_sem
);
4344 #if defined(CONFIG_PROVE_LOCKING) || defined(CONFIG_DEBUG_ATOMIC_SLEEP)
4345 void __might_fault(const char *file
, int line
)
4348 * Some code (nfs/sunrpc) uses socket ops on kernel memory while
4349 * holding the mmap_sem, this is safe because kernel memory doesn't
4350 * get paged out, therefore we'll never actually fault, and the
4351 * below annotations will generate false positives.
4353 if (uaccess_kernel())
4355 if (pagefault_disabled())
4357 __might_sleep(file
, line
, 0);
4358 #if defined(CONFIG_DEBUG_ATOMIC_SLEEP)
4360 might_lock_read(¤t
->mm
->mmap_sem
);
4363 EXPORT_SYMBOL(__might_fault
);
4366 #if defined(CONFIG_TRANSPARENT_HUGEPAGE) || defined(CONFIG_HUGETLBFS)
4368 * Process all subpages of the specified huge page with the specified
4369 * operation. The target subpage will be processed last to keep its
4372 static inline void process_huge_page(
4373 unsigned long addr_hint
, unsigned int pages_per_huge_page
,
4374 void (*process_subpage
)(unsigned long addr
, int idx
, void *arg
),
4378 unsigned long addr
= addr_hint
&
4379 ~(((unsigned long)pages_per_huge_page
<< PAGE_SHIFT
) - 1);
4381 /* Process target subpage last to keep its cache lines hot */
4383 n
= (addr_hint
- addr
) / PAGE_SIZE
;
4384 if (2 * n
<= pages_per_huge_page
) {
4385 /* If target subpage in first half of huge page */
4388 /* Process subpages at the end of huge page */
4389 for (i
= pages_per_huge_page
- 1; i
>= 2 * n
; i
--) {
4391 process_subpage(addr
+ i
* PAGE_SIZE
, i
, arg
);
4394 /* If target subpage in second half of huge page */
4395 base
= pages_per_huge_page
- 2 * (pages_per_huge_page
- n
);
4396 l
= pages_per_huge_page
- n
;
4397 /* Process subpages at the begin of huge page */
4398 for (i
= 0; i
< base
; i
++) {
4400 process_subpage(addr
+ i
* PAGE_SIZE
, i
, arg
);
4404 * Process remaining subpages in left-right-left-right pattern
4405 * towards the target subpage
4407 for (i
= 0; i
< l
; i
++) {
4408 int left_idx
= base
+ i
;
4409 int right_idx
= base
+ 2 * l
- 1 - i
;
4412 process_subpage(addr
+ left_idx
* PAGE_SIZE
, left_idx
, arg
);
4414 process_subpage(addr
+ right_idx
* PAGE_SIZE
, right_idx
, arg
);
4418 static void clear_gigantic_page(struct page
*page
,
4420 unsigned int pages_per_huge_page
)
4423 struct page
*p
= page
;
4426 for (i
= 0; i
< pages_per_huge_page
;
4427 i
++, p
= mem_map_next(p
, page
, i
)) {
4429 clear_user_highpage(p
, addr
+ i
* PAGE_SIZE
);
4433 static void clear_subpage(unsigned long addr
, int idx
, void *arg
)
4435 struct page
*page
= arg
;
4437 clear_user_highpage(page
+ idx
, addr
);
4440 void clear_huge_page(struct page
*page
,
4441 unsigned long addr_hint
, unsigned int pages_per_huge_page
)
4443 unsigned long addr
= addr_hint
&
4444 ~(((unsigned long)pages_per_huge_page
<< PAGE_SHIFT
) - 1);
4446 if (unlikely(pages_per_huge_page
> MAX_ORDER_NR_PAGES
)) {
4447 clear_gigantic_page(page
, addr
, pages_per_huge_page
);
4451 process_huge_page(addr_hint
, pages_per_huge_page
, clear_subpage
, page
);
4454 static void copy_user_gigantic_page(struct page
*dst
, struct page
*src
,
4456 struct vm_area_struct
*vma
,
4457 unsigned int pages_per_huge_page
)
4460 struct page
*dst_base
= dst
;
4461 struct page
*src_base
= src
;
4463 for (i
= 0; i
< pages_per_huge_page
; ) {
4465 copy_user_highpage(dst
, src
, addr
+ i
*PAGE_SIZE
, vma
);
4468 dst
= mem_map_next(dst
, dst_base
, i
);
4469 src
= mem_map_next(src
, src_base
, i
);
4473 struct copy_subpage_arg
{
4476 struct vm_area_struct
*vma
;
4479 static void copy_subpage(unsigned long addr
, int idx
, void *arg
)
4481 struct copy_subpage_arg
*copy_arg
= arg
;
4483 copy_user_highpage(copy_arg
->dst
+ idx
, copy_arg
->src
+ idx
,
4484 addr
, copy_arg
->vma
);
4487 void copy_user_huge_page(struct page
*dst
, struct page
*src
,
4488 unsigned long addr_hint
, struct vm_area_struct
*vma
,
4489 unsigned int pages_per_huge_page
)
4491 unsigned long addr
= addr_hint
&
4492 ~(((unsigned long)pages_per_huge_page
<< PAGE_SHIFT
) - 1);
4493 struct copy_subpage_arg arg
= {
4499 if (unlikely(pages_per_huge_page
> MAX_ORDER_NR_PAGES
)) {
4500 copy_user_gigantic_page(dst
, src
, addr
, vma
,
4501 pages_per_huge_page
);
4505 process_huge_page(addr_hint
, pages_per_huge_page
, copy_subpage
, &arg
);
4508 long copy_huge_page_from_user(struct page
*dst_page
,
4509 const void __user
*usr_src
,
4510 unsigned int pages_per_huge_page
,
4511 bool allow_pagefault
)
4513 void *src
= (void *)usr_src
;
4515 unsigned long i
, rc
= 0;
4516 unsigned long ret_val
= pages_per_huge_page
* PAGE_SIZE
;
4518 for (i
= 0; i
< pages_per_huge_page
; i
++) {
4519 if (allow_pagefault
)
4520 page_kaddr
= kmap(dst_page
+ i
);
4522 page_kaddr
= kmap_atomic(dst_page
+ i
);
4523 rc
= copy_from_user(page_kaddr
,
4524 (const void __user
*)(src
+ i
* PAGE_SIZE
),
4526 if (allow_pagefault
)
4527 kunmap(dst_page
+ i
);
4529 kunmap_atomic(page_kaddr
);
4531 ret_val
-= (PAGE_SIZE
- rc
);
4539 #endif /* CONFIG_TRANSPARENT_HUGEPAGE || CONFIG_HUGETLBFS */
4541 #if USE_SPLIT_PTE_PTLOCKS && ALLOC_SPLIT_PTLOCKS
4543 static struct kmem_cache
*page_ptl_cachep
;
4545 void __init
ptlock_cache_init(void)
4547 page_ptl_cachep
= kmem_cache_create("page->ptl", sizeof(spinlock_t
), 0,
4551 bool ptlock_alloc(struct page
*page
)
4555 ptl
= kmem_cache_alloc(page_ptl_cachep
, GFP_KERNEL
);
4562 void ptlock_free(struct page
*page
)
4564 kmem_cache_free(page_ptl_cachep
, page
->ptl
);