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/hugetlb.h>
44 #include <linux/mman.h>
45 #include <linux/swap.h>
46 #include <linux/highmem.h>
47 #include <linux/pagemap.h>
48 #include <linux/ksm.h>
49 #include <linux/rmap.h>
50 #include <linux/export.h>
51 #include <linux/delayacct.h>
52 #include <linux/init.h>
53 #include <linux/writeback.h>
54 #include <linux/memcontrol.h>
55 #include <linux/mmu_notifier.h>
56 #include <linux/kallsyms.h>
57 #include <linux/swapops.h>
58 #include <linux/elf.h>
59 #include <linux/gfp.h>
60 #include <linux/migrate.h>
61 #include <linux/string.h>
64 #include <asm/pgalloc.h>
65 #include <asm/uaccess.h>
67 #include <asm/tlbflush.h>
68 #include <asm/pgtable.h>
72 #ifdef CONFIG_MTK_EXTMEM
73 extern bool extmem_in_mspace(struct vm_area_struct
*vma
);
74 extern unsigned long get_virt_from_mspace(unsigned long pa
);
77 #ifdef LAST_NID_NOT_IN_PAGE_FLAGS
78 #warning Unfortunate NUMA and NUMA Balancing config, growing page-frame for last_nid.
81 #ifndef CONFIG_NEED_MULTIPLE_NODES
82 /* use the per-pgdat data instead for discontigmem - mbligh */
83 unsigned long max_mapnr
;
86 EXPORT_SYMBOL(max_mapnr
);
87 EXPORT_SYMBOL(mem_map
);
90 unsigned long num_physpages
;
92 * A number of key systems in x86 including ioremap() rely on the assumption
93 * that high_memory defines the upper bound on direct map memory, then end
94 * of ZONE_NORMAL. Under CONFIG_DISCONTIG this means that max_low_pfn and
95 * highstart_pfn must be the same; there must be no gap between ZONE_NORMAL
100 EXPORT_SYMBOL(num_physpages
);
101 EXPORT_SYMBOL(high_memory
);
104 * Randomize the address space (stacks, mmaps, brk, etc.).
106 * ( When CONFIG_COMPAT_BRK=y we exclude brk from randomization,
107 * as ancient (libc5 based) binaries can segfault. )
109 int randomize_va_space __read_mostly
=
110 #ifdef CONFIG_COMPAT_BRK
116 static int __init
disable_randmaps(char *s
)
118 randomize_va_space
= 0;
121 __setup("norandmaps", disable_randmaps
);
123 unsigned long zero_pfn __read_mostly
;
124 unsigned long highest_memmap_pfn __read_mostly
;
127 * CONFIG_MMU architectures set up ZERO_PAGE in their paging_init()
129 static int __init
init_zero_pfn(void)
131 zero_pfn
= page_to_pfn(ZERO_PAGE(0));
134 core_initcall(init_zero_pfn
);
137 #if defined(SPLIT_RSS_COUNTING)
139 void sync_mm_rss(struct mm_struct
*mm
)
143 for (i
= 0; i
< NR_MM_COUNTERS
; i
++) {
144 if (current
->rss_stat
.count
[i
]) {
145 add_mm_counter(mm
, i
, current
->rss_stat
.count
[i
]);
146 current
->rss_stat
.count
[i
] = 0;
149 current
->rss_stat
.events
= 0;
152 static void add_mm_counter_fast(struct mm_struct
*mm
, int member
, int val
)
154 struct task_struct
*task
= current
;
156 if (likely(task
->mm
== mm
))
157 task
->rss_stat
.count
[member
] += val
;
159 add_mm_counter(mm
, member
, val
);
161 #define inc_mm_counter_fast(mm, member) add_mm_counter_fast(mm, member, 1)
162 #define dec_mm_counter_fast(mm, member) add_mm_counter_fast(mm, member, -1)
164 /* sync counter once per 64 page faults */
165 #define TASK_RSS_EVENTS_THRESH (64)
166 static void check_sync_rss_stat(struct task_struct
*task
)
168 if (unlikely(task
!= current
))
170 if (unlikely(task
->rss_stat
.events
++ > TASK_RSS_EVENTS_THRESH
))
171 sync_mm_rss(task
->mm
);
173 #else /* SPLIT_RSS_COUNTING */
175 #define inc_mm_counter_fast(mm, member) inc_mm_counter(mm, member)
176 #define dec_mm_counter_fast(mm, member) dec_mm_counter(mm, member)
178 static void check_sync_rss_stat(struct task_struct
*task
)
182 #endif /* SPLIT_RSS_COUNTING */
184 #ifdef HAVE_GENERIC_MMU_GATHER
186 static int tlb_next_batch(struct mmu_gather
*tlb
)
188 struct mmu_gather_batch
*batch
;
192 tlb
->active
= batch
->next
;
196 if (tlb
->batch_count
== MAX_GATHER_BATCH_COUNT
)
199 batch
= (void *)__get_free_pages(GFP_NOWAIT
| __GFP_NOWARN
, 0);
206 batch
->max
= MAX_GATHER_BATCH
;
208 tlb
->active
->next
= batch
;
215 * Called to initialize an (on-stack) mmu_gather structure for page-table
216 * tear-down from @mm. The @fullmm argument is used when @mm is without
217 * users and we're going to destroy the full address space (exit/execve).
219 void tlb_gather_mmu(struct mmu_gather
*tlb
, struct mm_struct
*mm
, unsigned long start
, unsigned long end
)
223 /* Is it from 0 to ~0? */
224 tlb
->fullmm
= !(start
| (end
+1));
225 tlb
->need_flush_all
= 0;
229 tlb
->local
.next
= NULL
;
231 tlb
->local
.max
= ARRAY_SIZE(tlb
->__pages
);
232 tlb
->active
= &tlb
->local
;
233 tlb
->batch_count
= 0;
235 #ifdef CONFIG_HAVE_RCU_TABLE_FREE
240 void tlb_flush_mmu(struct mmu_gather
*tlb
)
242 struct mmu_gather_batch
*batch
;
244 if (!tlb
->need_flush
)
248 #ifdef CONFIG_HAVE_RCU_TABLE_FREE
249 tlb_table_flush(tlb
);
252 for (batch
= &tlb
->local
; batch
; batch
= batch
->next
) {
253 free_pages_and_swap_cache(batch
->pages
, batch
->nr
);
256 tlb
->active
= &tlb
->local
;
260 * Called at the end of the shootdown operation to free up any resources
261 * that were required.
263 void tlb_finish_mmu(struct mmu_gather
*tlb
, unsigned long start
, unsigned long end
)
265 struct mmu_gather_batch
*batch
, *next
;
269 /* keep the page table cache within bounds */
272 for (batch
= tlb
->local
.next
; batch
; batch
= next
) {
274 free_pages((unsigned long)batch
, 0);
276 tlb
->local
.next
= NULL
;
280 * Must perform the equivalent to __free_pte(pte_get_and_clear(ptep)), while
281 * handling the additional races in SMP caused by other CPUs caching valid
282 * mappings in their TLBs. Returns the number of free page slots left.
283 * When out of page slots we must call tlb_flush_mmu().
285 int __tlb_remove_page(struct mmu_gather
*tlb
, struct page
*page
)
287 struct mmu_gather_batch
*batch
;
289 VM_BUG_ON(!tlb
->need_flush
);
292 batch
->pages
[batch
->nr
++] = page
;
293 if (batch
->nr
== batch
->max
) {
294 if (!tlb_next_batch(tlb
))
298 VM_BUG_ON(batch
->nr
> batch
->max
);
300 return batch
->max
- batch
->nr
;
303 #endif /* HAVE_GENERIC_MMU_GATHER */
305 #ifdef CONFIG_HAVE_RCU_TABLE_FREE
308 * See the comment near struct mmu_table_batch.
311 static void tlb_remove_table_smp_sync(void *arg
)
313 /* Simply deliver the interrupt */
316 static void tlb_remove_table_one(void *table
)
319 * This isn't an RCU grace period and hence the page-tables cannot be
320 * assumed to be actually RCU-freed.
322 * It is however sufficient for software page-table walkers that rely on
323 * IRQ disabling. See the comment near struct mmu_table_batch.
325 smp_call_function(tlb_remove_table_smp_sync
, NULL
, 1);
326 __tlb_remove_table(table
);
329 static void tlb_remove_table_rcu(struct rcu_head
*head
)
331 struct mmu_table_batch
*batch
;
334 batch
= container_of(head
, struct mmu_table_batch
, rcu
);
336 for (i
= 0; i
< batch
->nr
; i
++)
337 __tlb_remove_table(batch
->tables
[i
]);
339 free_page((unsigned long)batch
);
342 void tlb_table_flush(struct mmu_gather
*tlb
)
344 struct mmu_table_batch
**batch
= &tlb
->batch
;
347 call_rcu_sched(&(*batch
)->rcu
, tlb_remove_table_rcu
);
352 void tlb_remove_table(struct mmu_gather
*tlb
, void *table
)
354 struct mmu_table_batch
**batch
= &tlb
->batch
;
359 * When there's less then two users of this mm there cannot be a
360 * concurrent page-table walk.
362 if (atomic_read(&tlb
->mm
->mm_users
) < 2) {
363 __tlb_remove_table(table
);
367 if (*batch
== NULL
) {
368 *batch
= (struct mmu_table_batch
*)__get_free_page(GFP_NOWAIT
| __GFP_NOWARN
);
369 if (*batch
== NULL
) {
370 tlb_remove_table_one(table
);
375 (*batch
)->tables
[(*batch
)->nr
++] = table
;
376 if ((*batch
)->nr
== MAX_TABLE_BATCH
)
377 tlb_table_flush(tlb
);
380 #endif /* CONFIG_HAVE_RCU_TABLE_FREE */
383 * If a p?d_bad entry is found while walking page tables, report
384 * the error, before resetting entry to p?d_none. Usually (but
385 * very seldom) called out from the p?d_none_or_clear_bad macros.
388 void pgd_clear_bad(pgd_t
*pgd
)
394 void pud_clear_bad(pud_t
*pud
)
400 void pmd_clear_bad(pmd_t
*pmd
)
407 * Note: this doesn't free the actual pages themselves. That
408 * has been handled earlier when unmapping all the memory regions.
410 static void free_pte_range(struct mmu_gather
*tlb
, pmd_t
*pmd
,
413 pgtable_t token
= pmd_pgtable(*pmd
);
415 pte_free_tlb(tlb
, token
, addr
);
419 static inline void free_pmd_range(struct mmu_gather
*tlb
, pud_t
*pud
,
420 unsigned long addr
, unsigned long end
,
421 unsigned long floor
, unsigned long ceiling
)
428 pmd
= pmd_offset(pud
, addr
);
430 next
= pmd_addr_end(addr
, end
);
431 if (pmd_none_or_clear_bad(pmd
))
433 free_pte_range(tlb
, pmd
, addr
);
434 } while (pmd
++, addr
= next
, addr
!= end
);
444 if (end
- 1 > ceiling
- 1)
447 pmd
= pmd_offset(pud
, start
);
449 pmd_free_tlb(tlb
, pmd
, start
);
452 static inline void free_pud_range(struct mmu_gather
*tlb
, pgd_t
*pgd
,
453 unsigned long addr
, unsigned long end
,
454 unsigned long floor
, unsigned long ceiling
)
461 pud
= pud_offset(pgd
, addr
);
463 next
= pud_addr_end(addr
, end
);
464 if (pud_none_or_clear_bad(pud
))
466 free_pmd_range(tlb
, pud
, addr
, next
, floor
, ceiling
);
467 } while (pud
++, addr
= next
, addr
!= end
);
473 ceiling
&= PGDIR_MASK
;
477 if (end
- 1 > ceiling
- 1)
480 pud
= pud_offset(pgd
, start
);
482 pud_free_tlb(tlb
, pud
, start
);
486 * This function frees user-level page tables of a process.
488 * Must be called with pagetable lock held.
490 void free_pgd_range(struct mmu_gather
*tlb
,
491 unsigned long addr
, unsigned long end
,
492 unsigned long floor
, unsigned long ceiling
)
498 * The next few lines have given us lots of grief...
500 * Why are we testing PMD* at this top level? Because often
501 * there will be no work to do at all, and we'd prefer not to
502 * go all the way down to the bottom just to discover that.
504 * Why all these "- 1"s? Because 0 represents both the bottom
505 * of the address space and the top of it (using -1 for the
506 * top wouldn't help much: the masks would do the wrong thing).
507 * The rule is that addr 0 and floor 0 refer to the bottom of
508 * the address space, but end 0 and ceiling 0 refer to the top
509 * Comparisons need to use "end - 1" and "ceiling - 1" (though
510 * that end 0 case should be mythical).
512 * Wherever addr is brought up or ceiling brought down, we must
513 * be careful to reject "the opposite 0" before it confuses the
514 * subsequent tests. But what about where end is brought down
515 * by PMD_SIZE below? no, end can't go down to 0 there.
517 * Whereas we round start (addr) and ceiling down, by different
518 * masks at different levels, in order to test whether a table
519 * now has no other vmas using it, so can be freed, we don't
520 * bother to round floor or end up - the tests don't need that.
534 if (end
- 1 > ceiling
- 1)
539 pgd
= pgd_offset(tlb
->mm
, addr
);
541 next
= pgd_addr_end(addr
, end
);
542 if (pgd_none_or_clear_bad(pgd
))
544 free_pud_range(tlb
, pgd
, addr
, next
, floor
, ceiling
);
545 } while (pgd
++, addr
= next
, addr
!= end
);
548 void free_pgtables(struct mmu_gather
*tlb
, struct vm_area_struct
*vma
,
549 unsigned long floor
, unsigned long ceiling
)
552 struct vm_area_struct
*next
= vma
->vm_next
;
553 unsigned long addr
= vma
->vm_start
;
556 * Hide vma from rmap and truncate_pagecache before freeing
559 unlink_anon_vmas(vma
);
560 unlink_file_vma(vma
);
562 if (is_vm_hugetlb_page(vma
)) {
563 hugetlb_free_pgd_range(tlb
, addr
, vma
->vm_end
,
564 floor
, next
? next
->vm_start
: ceiling
);
567 * Optimization: gather nearby vmas into one call down
569 while (next
&& next
->vm_start
<= vma
->vm_end
+ PMD_SIZE
570 && !is_vm_hugetlb_page(next
)) {
573 unlink_anon_vmas(vma
);
574 unlink_file_vma(vma
);
576 free_pgd_range(tlb
, addr
, vma
->vm_end
,
577 floor
, next
? next
->vm_start
: ceiling
);
583 int __pte_alloc(struct mm_struct
*mm
, struct vm_area_struct
*vma
,
584 pmd_t
*pmd
, unsigned long address
)
586 pgtable_t
new = pte_alloc_one(mm
, address
);
587 int wait_split_huge_page
;
592 * Ensure all pte setup (eg. pte page lock and page clearing) are
593 * visible before the pte is made visible to other CPUs by being
594 * put into page tables.
596 * The other side of the story is the pointer chasing in the page
597 * table walking code (when walking the page table without locking;
598 * ie. most of the time). Fortunately, these data accesses consist
599 * of a chain of data-dependent loads, meaning most CPUs (alpha
600 * being the notable exception) will already guarantee loads are
601 * seen in-order. See the alpha page table accessors for the
602 * smp_read_barrier_depends() barriers in page table walking code.
604 smp_wmb(); /* Could be smp_wmb__xxx(before|after)_spin_lock */
606 spin_lock(&mm
->page_table_lock
);
607 wait_split_huge_page
= 0;
608 if (likely(pmd_none(*pmd
))) { /* Has another populated it ? */
610 pmd_populate(mm
, pmd
, new);
612 } else if (unlikely(pmd_trans_splitting(*pmd
)))
613 wait_split_huge_page
= 1;
614 spin_unlock(&mm
->page_table_lock
);
617 if (wait_split_huge_page
)
618 wait_split_huge_page(vma
->anon_vma
, pmd
);
622 int __pte_alloc_kernel(pmd_t
*pmd
, unsigned long address
)
624 pte_t
*new = pte_alloc_one_kernel(&init_mm
, address
);
628 smp_wmb(); /* See comment in __pte_alloc */
630 spin_lock(&init_mm
.page_table_lock
);
631 if (likely(pmd_none(*pmd
))) { /* Has another populated it ? */
632 pmd_populate_kernel(&init_mm
, pmd
, new);
635 VM_BUG_ON(pmd_trans_splitting(*pmd
));
636 spin_unlock(&init_mm
.page_table_lock
);
638 pte_free_kernel(&init_mm
, new);
642 static inline void init_rss_vec(int *rss
)
644 memset(rss
, 0, sizeof(int) * NR_MM_COUNTERS
);
647 static inline void add_mm_rss_vec(struct mm_struct
*mm
, int *rss
)
651 if (current
->mm
== mm
)
653 for (i
= 0; i
< NR_MM_COUNTERS
; i
++)
655 add_mm_counter(mm
, i
, rss
[i
]);
659 * This function is called to print an error when a bad pte
660 * is found. For example, we might have a PFN-mapped pte in
661 * a region that doesn't allow it.
663 * The calling function must still handle the error.
665 static void print_bad_pte(struct vm_area_struct
*vma
, unsigned long addr
,
666 pte_t pte
, struct page
*page
)
668 pgd_t
*pgd
= pgd_offset(vma
->vm_mm
, addr
);
669 pud_t
*pud
= pud_offset(pgd
, addr
);
670 pmd_t
*pmd
= pmd_offset(pud
, addr
);
671 struct address_space
*mapping
;
673 static unsigned long resume
;
674 static unsigned long nr_shown
;
675 static unsigned long nr_unshown
;
678 * Allow a burst of 60 reports, then keep quiet for that minute;
679 * or allow a steady drip of one report per second.
681 if (nr_shown
== 60) {
682 if (time_before(jiffies
, resume
)) {
688 "BUG: Bad page map: %lu messages suppressed\n",
695 resume
= jiffies
+ 60 * HZ
;
697 mapping
= vma
->vm_file
? vma
->vm_file
->f_mapping
: NULL
;
698 index
= linear_page_index(vma
, addr
);
701 "BUG: Bad page map in process %s pte:%08llx pmd:%08llx\n",
703 (long long)pte_val(pte
), (long long)pmd_val(*pmd
));
707 "addr:%p vm_flags:%08lx anon_vma:%p mapping:%p index:%lx\n",
708 (void *)addr
, vma
->vm_flags
, vma
->anon_vma
, mapping
, index
);
710 * Choose text because data symbols depend on CONFIG_KALLSYMS_ALL=y
713 printk(KERN_ALERT
"vma->vm_ops->fault: %pSR\n",
715 if (vma
->vm_file
&& vma
->vm_file
->f_op
)
716 printk(KERN_ALERT
"vma->vm_file->f_op->mmap: %pSR\n",
717 vma
->vm_file
->f_op
->mmap
);
719 add_taint(TAINT_BAD_PAGE
, LOCKDEP_NOW_UNRELIABLE
);
722 static inline bool is_cow_mapping(vm_flags_t flags
)
724 return (flags
& (VM_SHARED
| VM_MAYWRITE
)) == VM_MAYWRITE
;
728 * vm_normal_page -- This function gets the "struct page" associated with a pte.
730 * "Special" mappings do not wish to be associated with a "struct page" (either
731 * it doesn't exist, or it exists but they don't want to touch it). In this
732 * case, NULL is returned here. "Normal" mappings do have a struct page.
734 * There are 2 broad cases. Firstly, an architecture may define a pte_special()
735 * pte bit, in which case this function is trivial. Secondly, an architecture
736 * may not have a spare pte bit, which requires a more complicated scheme,
739 * A raw VM_PFNMAP mapping (ie. one that is not COWed) is always considered a
740 * special mapping (even if there are underlying and valid "struct pages").
741 * COWed pages of a VM_PFNMAP are always normal.
743 * The way we recognize COWed pages within VM_PFNMAP mappings is through the
744 * rules set up by "remap_pfn_range()": the vma will have the VM_PFNMAP bit
745 * set, and the vm_pgoff will point to the first PFN mapped: thus every special
746 * mapping will always honor the rule
748 * pfn_of_page == vma->vm_pgoff + ((addr - vma->vm_start) >> PAGE_SHIFT)
750 * And for normal mappings this is false.
752 * This restricts such mappings to be a linear translation from virtual address
753 * to pfn. To get around this restriction, we allow arbitrary mappings so long
754 * as the vma is not a COW mapping; in that case, we know that all ptes are
755 * special (because none can have been COWed).
758 * In order to support COW of arbitrary special mappings, we have VM_MIXEDMAP.
760 * VM_MIXEDMAP mappings can likewise contain memory with or without "struct
761 * page" backing, however the difference is that _all_ pages with a struct
762 * page (that is, those where pfn_valid is true) are refcounted and considered
763 * normal pages by the VM. The disadvantage is that pages are refcounted
764 * (which can be slower and simply not an option for some PFNMAP users). The
765 * advantage is that we don't have to follow the strict linearity rule of
766 * PFNMAP mappings in order to support COWable mappings.
769 #ifdef __HAVE_ARCH_PTE_SPECIAL
770 # define HAVE_PTE_SPECIAL 1
772 # define HAVE_PTE_SPECIAL 0
774 struct page
*vm_normal_page(struct vm_area_struct
*vma
, unsigned long addr
,
777 unsigned long pfn
= pte_pfn(pte
);
779 if (HAVE_PTE_SPECIAL
) {
780 if (likely(!pte_special(pte
)))
782 if (vma
->vm_flags
& (VM_PFNMAP
| VM_MIXEDMAP
))
784 if (!is_zero_pfn(pfn
))
785 print_bad_pte(vma
, addr
, pte
, NULL
);
789 /* !HAVE_PTE_SPECIAL case follows: */
791 if (unlikely(vma
->vm_flags
& (VM_PFNMAP
|VM_MIXEDMAP
))) {
792 if (vma
->vm_flags
& VM_MIXEDMAP
) {
798 off
= (addr
- vma
->vm_start
) >> PAGE_SHIFT
;
799 if (pfn
== vma
->vm_pgoff
+ off
)
801 if (!is_cow_mapping(vma
->vm_flags
))
806 if (is_zero_pfn(pfn
))
809 if (unlikely(pfn
> highest_memmap_pfn
)) {
810 print_bad_pte(vma
, addr
, pte
, NULL
);
815 * NOTE! We still have PageReserved() pages in the page tables.
816 * eg. VDSO mappings can cause them to exist.
819 return pfn_to_page(pfn
);
823 * copy one vm_area from one task to the other. Assumes the page tables
824 * already present in the new task to be cleared in the whole range
825 * covered by this vma.
828 static inline unsigned long
829 copy_one_pte(struct mm_struct
*dst_mm
, struct mm_struct
*src_mm
,
830 pte_t
*dst_pte
, pte_t
*src_pte
, struct vm_area_struct
*vma
,
831 unsigned long addr
, int *rss
)
833 unsigned long vm_flags
= vma
->vm_flags
;
834 pte_t pte
= *src_pte
;
837 /* pte contains position in swap or file, so copy. */
838 if (unlikely(!pte_present(pte
))) {
839 if (!pte_file(pte
)) {
840 swp_entry_t entry
= pte_to_swp_entry(pte
);
842 if (likely(!non_swap_entry(entry
))) {
843 if (swap_duplicate(entry
) < 0)
846 /* make sure dst_mm is on swapoff's mmlist. */
847 if (unlikely(list_empty(&dst_mm
->mmlist
))) {
848 spin_lock(&mmlist_lock
);
849 if (list_empty(&dst_mm
->mmlist
))
850 list_add(&dst_mm
->mmlist
,
852 spin_unlock(&mmlist_lock
);
855 } else if (is_migration_entry(entry
)) {
856 page
= migration_entry_to_page(entry
);
863 if (is_write_migration_entry(entry
) &&
864 is_cow_mapping(vm_flags
)) {
866 * COW mappings require pages in both
867 * parent and child to be set to read.
869 make_migration_entry_read(&entry
);
870 pte
= swp_entry_to_pte(entry
);
871 set_pte_at(src_mm
, addr
, src_pte
, pte
);
879 * If it's a COW mapping, write protect it both
880 * in the parent and the child
882 if (is_cow_mapping(vm_flags
)) {
883 ptep_set_wrprotect(src_mm
, addr
, src_pte
);
884 pte
= pte_wrprotect(pte
);
888 * If it's a shared mapping, mark it clean in
891 if (vm_flags
& VM_SHARED
)
892 pte
= pte_mkclean(pte
);
893 pte
= pte_mkold(pte
);
895 page
= vm_normal_page(vma
, addr
, pte
);
906 set_pte_at(dst_mm
, addr
, dst_pte
, pte
);
910 int copy_pte_range(struct mm_struct
*dst_mm
, struct mm_struct
*src_mm
,
911 pmd_t
*dst_pmd
, pmd_t
*src_pmd
, struct vm_area_struct
*vma
,
912 unsigned long addr
, unsigned long end
)
914 pte_t
*orig_src_pte
, *orig_dst_pte
;
915 pte_t
*src_pte
, *dst_pte
;
916 spinlock_t
*src_ptl
, *dst_ptl
;
918 int rss
[NR_MM_COUNTERS
];
919 swp_entry_t entry
= (swp_entry_t
){0};
924 dst_pte
= pte_alloc_map_lock(dst_mm
, dst_pmd
, addr
, &dst_ptl
);
927 src_pte
= pte_offset_map(src_pmd
, addr
);
928 src_ptl
= pte_lockptr(src_mm
, src_pmd
);
929 spin_lock_nested(src_ptl
, SINGLE_DEPTH_NESTING
);
930 orig_src_pte
= src_pte
;
931 orig_dst_pte
= dst_pte
;
932 arch_enter_lazy_mmu_mode();
936 * We are holding two locks at this point - either of them
937 * could generate latencies in another task on another CPU.
939 if (progress
>= 32) {
941 if (need_resched() ||
942 spin_needbreak(src_ptl
) || spin_needbreak(dst_ptl
))
945 if (pte_none(*src_pte
)) {
949 entry
.val
= copy_one_pte(dst_mm
, src_mm
, dst_pte
, src_pte
,
954 } while (dst_pte
++, src_pte
++, addr
+= PAGE_SIZE
, addr
!= end
);
956 arch_leave_lazy_mmu_mode();
957 spin_unlock(src_ptl
);
958 pte_unmap(orig_src_pte
);
959 add_mm_rss_vec(dst_mm
, rss
);
960 pte_unmap_unlock(orig_dst_pte
, dst_ptl
);
964 if (add_swap_count_continuation(entry
, GFP_KERNEL
) < 0)
973 static inline int copy_pmd_range(struct mm_struct
*dst_mm
, struct mm_struct
*src_mm
,
974 pud_t
*dst_pud
, pud_t
*src_pud
, struct vm_area_struct
*vma
,
975 unsigned long addr
, unsigned long end
)
977 pmd_t
*src_pmd
, *dst_pmd
;
980 dst_pmd
= pmd_alloc(dst_mm
, dst_pud
, addr
);
983 src_pmd
= pmd_offset(src_pud
, addr
);
985 next
= pmd_addr_end(addr
, end
);
986 if (pmd_trans_huge(*src_pmd
)) {
988 VM_BUG_ON(next
-addr
!= HPAGE_PMD_SIZE
);
989 err
= copy_huge_pmd(dst_mm
, src_mm
,
990 dst_pmd
, src_pmd
, addr
, vma
);
997 if (pmd_none_or_clear_bad(src_pmd
))
999 if (copy_pte_range(dst_mm
, src_mm
, dst_pmd
, src_pmd
,
1002 } while (dst_pmd
++, src_pmd
++, addr
= next
, addr
!= end
);
1006 static inline int copy_pud_range(struct mm_struct
*dst_mm
, struct mm_struct
*src_mm
,
1007 pgd_t
*dst_pgd
, pgd_t
*src_pgd
, struct vm_area_struct
*vma
,
1008 unsigned long addr
, unsigned long end
)
1010 pud_t
*src_pud
, *dst_pud
;
1013 dst_pud
= pud_alloc(dst_mm
, dst_pgd
, addr
);
1016 src_pud
= pud_offset(src_pgd
, addr
);
1018 next
= pud_addr_end(addr
, end
);
1019 if (pud_none_or_clear_bad(src_pud
))
1021 if (copy_pmd_range(dst_mm
, src_mm
, dst_pud
, src_pud
,
1024 } while (dst_pud
++, src_pud
++, addr
= next
, addr
!= end
);
1028 int copy_page_range(struct mm_struct
*dst_mm
, struct mm_struct
*src_mm
,
1029 struct vm_area_struct
*vma
)
1031 pgd_t
*src_pgd
, *dst_pgd
;
1033 unsigned long addr
= vma
->vm_start
;
1034 unsigned long end
= vma
->vm_end
;
1035 unsigned long mmun_start
; /* For mmu_notifiers */
1036 unsigned long mmun_end
; /* For mmu_notifiers */
1041 * Don't copy ptes where a page fault will fill them correctly.
1042 * Fork becomes much lighter when there are big shared or private
1043 * readonly mappings. The tradeoff is that copy_page_range is more
1044 * efficient than faulting.
1046 if (!(vma
->vm_flags
& (VM_HUGETLB
| VM_NONLINEAR
|
1047 VM_PFNMAP
| VM_MIXEDMAP
))) {
1052 if (is_vm_hugetlb_page(vma
))
1053 return copy_hugetlb_page_range(dst_mm
, src_mm
, vma
);
1055 if (unlikely(vma
->vm_flags
& VM_PFNMAP
)) {
1057 * We do not free on error cases below as remove_vma
1058 * gets called on error from higher level routine
1060 ret
= track_pfn_copy(vma
);
1066 * We need to invalidate the secondary MMU mappings only when
1067 * there could be a permission downgrade on the ptes of the
1068 * parent mm. And a permission downgrade will only happen if
1069 * is_cow_mapping() returns true.
1071 is_cow
= is_cow_mapping(vma
->vm_flags
);
1075 mmu_notifier_invalidate_range_start(src_mm
, mmun_start
,
1079 dst_pgd
= pgd_offset(dst_mm
, addr
);
1080 src_pgd
= pgd_offset(src_mm
, addr
);
1082 next
= pgd_addr_end(addr
, end
);
1083 if (pgd_none_or_clear_bad(src_pgd
))
1085 if (unlikely(copy_pud_range(dst_mm
, src_mm
, dst_pgd
, src_pgd
,
1086 vma
, addr
, next
))) {
1090 } while (dst_pgd
++, src_pgd
++, addr
= next
, addr
!= end
);
1093 mmu_notifier_invalidate_range_end(src_mm
, mmun_start
, mmun_end
);
1097 static unsigned long zap_pte_range(struct mmu_gather
*tlb
,
1098 struct vm_area_struct
*vma
, pmd_t
*pmd
,
1099 unsigned long addr
, unsigned long end
,
1100 struct zap_details
*details
)
1102 struct mm_struct
*mm
= tlb
->mm
;
1103 int force_flush
= 0;
1104 int rss
[NR_MM_COUNTERS
];
1111 start_pte
= pte_offset_map_lock(mm
, pmd
, addr
, &ptl
);
1113 arch_enter_lazy_mmu_mode();
1116 if (pte_none(ptent
)) {
1120 if (pte_present(ptent
)) {
1123 page
= vm_normal_page(vma
, addr
, ptent
);
1124 if (unlikely(details
) && page
) {
1126 * unmap_shared_mapping_pages() wants to
1127 * invalidate cache without truncating:
1128 * unmap shared but keep private pages.
1130 if (details
->check_mapping
&&
1131 details
->check_mapping
!= page
->mapping
)
1134 * Each page->index must be checked when
1135 * invalidating or truncating nonlinear.
1137 if (details
->nonlinear_vma
&&
1138 (page
->index
< details
->first_index
||
1139 page
->index
> details
->last_index
))
1142 ptent
= ptep_get_and_clear_full(mm
, addr
, pte
,
1144 tlb_remove_tlb_entry(tlb
, pte
, addr
);
1145 if (unlikely(!page
))
1147 if (unlikely(details
) && details
->nonlinear_vma
1148 && linear_page_index(details
->nonlinear_vma
,
1149 addr
) != page
->index
)
1150 set_pte_at(mm
, addr
, pte
,
1151 pgoff_to_pte(page
->index
));
1153 rss
[MM_ANONPAGES
]--;
1155 if (pte_dirty(ptent
))
1156 set_page_dirty(page
);
1157 if (pte_young(ptent
) &&
1158 likely(!VM_SequentialReadHint(vma
)))
1159 mark_page_accessed(page
);
1160 rss
[MM_FILEPAGES
]--;
1162 page_remove_rmap(page
);
1163 if (unlikely(page_mapcount(page
) < 0))
1164 print_bad_pte(vma
, addr
, ptent
, page
);
1165 force_flush
= !__tlb_remove_page(tlb
, page
);
1171 * If details->check_mapping, we leave swap entries;
1172 * if details->nonlinear_vma, we leave file entries.
1174 if (unlikely(details
))
1176 if (pte_file(ptent
)) {
1177 if (unlikely(!(vma
->vm_flags
& VM_NONLINEAR
)))
1178 print_bad_pte(vma
, addr
, ptent
, NULL
);
1180 swp_entry_t entry
= pte_to_swp_entry(ptent
);
1182 if (!non_swap_entry(entry
))
1184 else if (is_migration_entry(entry
)) {
1187 page
= migration_entry_to_page(entry
);
1190 rss
[MM_ANONPAGES
]--;
1192 rss
[MM_FILEPAGES
]--;
1194 if (unlikely(!free_swap_and_cache(entry
)))
1195 print_bad_pte(vma
, addr
, ptent
, NULL
);
1197 pte_clear_not_present_full(mm
, addr
, pte
, tlb
->fullmm
);
1198 } while (pte
++, addr
+= PAGE_SIZE
, addr
!= end
);
1200 add_mm_rss_vec(mm
, rss
);
1201 arch_leave_lazy_mmu_mode();
1202 pte_unmap_unlock(start_pte
, ptl
);
1205 * mmu_gather ran out of room to batch pages, we break out of
1206 * the PTE lock to avoid doing the potential expensive TLB invalidate
1207 * and page-free while holding it.
1210 unsigned long old_end
;
1215 * Flush the TLB just for the previous segment,
1216 * then update the range to be the remaining
1234 static inline unsigned long zap_pmd_range(struct mmu_gather
*tlb
,
1235 struct vm_area_struct
*vma
, pud_t
*pud
,
1236 unsigned long addr
, unsigned long end
,
1237 struct zap_details
*details
)
1242 pmd
= pmd_offset(pud
, addr
);
1244 next
= pmd_addr_end(addr
, end
);
1245 if (pmd_trans_huge(*pmd
)) {
1246 if (next
- addr
!= HPAGE_PMD_SIZE
) {
1247 #ifdef CONFIG_DEBUG_VM
1248 if (!rwsem_is_locked(&tlb
->mm
->mmap_sem
)) {
1249 pr_err("%s: mmap_sem is unlocked! addr=0x%lx end=0x%lx vma->vm_start=0x%lx vma->vm_end=0x%lx\n",
1250 __func__
, addr
, end
,
1256 split_huge_page_pmd(vma
, addr
, pmd
);
1257 } else if (zap_huge_pmd(tlb
, vma
, pmd
, addr
))
1262 * Here there can be other concurrent MADV_DONTNEED or
1263 * trans huge page faults running, and if the pmd is
1264 * none or trans huge it can change under us. This is
1265 * because MADV_DONTNEED holds the mmap_sem in read
1268 if (pmd_none_or_trans_huge_or_clear_bad(pmd
))
1270 next
= zap_pte_range(tlb
, vma
, pmd
, addr
, next
, details
);
1273 } while (pmd
++, addr
= next
, addr
!= end
);
1278 static inline unsigned long zap_pud_range(struct mmu_gather
*tlb
,
1279 struct vm_area_struct
*vma
, pgd_t
*pgd
,
1280 unsigned long addr
, unsigned long end
,
1281 struct zap_details
*details
)
1286 pud
= pud_offset(pgd
, addr
);
1288 next
= pud_addr_end(addr
, end
);
1289 if (pud_none_or_clear_bad(pud
))
1291 next
= zap_pmd_range(tlb
, vma
, pud
, addr
, next
, details
);
1292 } while (pud
++, addr
= next
, addr
!= end
);
1297 static void unmap_page_range(struct mmu_gather
*tlb
,
1298 struct vm_area_struct
*vma
,
1299 unsigned long addr
, unsigned long end
,
1300 struct zap_details
*details
)
1305 if (details
&& !details
->check_mapping
&& !details
->nonlinear_vma
)
1308 BUG_ON(addr
>= end
);
1309 mem_cgroup_uncharge_start();
1310 tlb_start_vma(tlb
, vma
);
1311 pgd
= pgd_offset(vma
->vm_mm
, addr
);
1313 next
= pgd_addr_end(addr
, end
);
1314 if (pgd_none_or_clear_bad(pgd
))
1316 next
= zap_pud_range(tlb
, vma
, pgd
, addr
, next
, details
);
1317 } while (pgd
++, addr
= next
, addr
!= end
);
1318 tlb_end_vma(tlb
, vma
);
1319 mem_cgroup_uncharge_end();
1323 static void unmap_single_vma(struct mmu_gather
*tlb
,
1324 struct vm_area_struct
*vma
, unsigned long start_addr
,
1325 unsigned long end_addr
,
1326 struct zap_details
*details
)
1328 unsigned long start
= max(vma
->vm_start
, start_addr
);
1331 if (start
>= vma
->vm_end
)
1333 end
= min(vma
->vm_end
, end_addr
);
1334 if (end
<= vma
->vm_start
)
1338 uprobe_munmap(vma
, start
, end
);
1340 if (unlikely(vma
->vm_flags
& VM_PFNMAP
))
1341 untrack_pfn(vma
, 0, 0);
1344 if (unlikely(is_vm_hugetlb_page(vma
))) {
1346 * It is undesirable to test vma->vm_file as it
1347 * should be non-null for valid hugetlb area.
1348 * However, vm_file will be NULL in the error
1349 * cleanup path of do_mmap_pgoff. When
1350 * hugetlbfs ->mmap method fails,
1351 * do_mmap_pgoff() nullifies vma->vm_file
1352 * before calling this function to clean up.
1353 * Since no pte has actually been setup, it is
1354 * safe to do nothing in this case.
1357 mutex_lock(&vma
->vm_file
->f_mapping
->i_mmap_mutex
);
1358 __unmap_hugepage_range_final(tlb
, vma
, start
, end
, NULL
);
1359 mutex_unlock(&vma
->vm_file
->f_mapping
->i_mmap_mutex
);
1362 unmap_page_range(tlb
, vma
, start
, end
, details
);
1367 * unmap_vmas - unmap a range of memory covered by a list of vma's
1368 * @tlb: address of the caller's struct mmu_gather
1369 * @vma: the starting vma
1370 * @start_addr: virtual address at which to start unmapping
1371 * @end_addr: virtual address at which to end unmapping
1373 * Unmap all pages in the vma list.
1375 * Only addresses between `start' and `end' will be unmapped.
1377 * The VMA list must be sorted in ascending virtual address order.
1379 * unmap_vmas() assumes that the caller will flush the whole unmapped address
1380 * range after unmap_vmas() returns. So the only responsibility here is to
1381 * ensure that any thus-far unmapped pages are flushed before unmap_vmas()
1382 * drops the lock and schedules.
1384 void unmap_vmas(struct mmu_gather
*tlb
,
1385 struct vm_area_struct
*vma
, unsigned long start_addr
,
1386 unsigned long end_addr
)
1388 struct mm_struct
*mm
= vma
->vm_mm
;
1390 mmu_notifier_invalidate_range_start(mm
, start_addr
, end_addr
);
1391 for ( ; vma
&& vma
->vm_start
< end_addr
; vma
= vma
->vm_next
)
1392 unmap_single_vma(tlb
, vma
, start_addr
, end_addr
, NULL
);
1393 mmu_notifier_invalidate_range_end(mm
, start_addr
, end_addr
);
1397 * zap_page_range - remove user pages in a given range
1398 * @vma: vm_area_struct holding the applicable pages
1399 * @start: starting address of pages to zap
1400 * @size: number of bytes to zap
1401 * @details: details of nonlinear truncation or shared cache invalidation
1403 * Caller must protect the VMA list
1405 void zap_page_range(struct vm_area_struct
*vma
, unsigned long start
,
1406 unsigned long size
, struct zap_details
*details
)
1408 struct mm_struct
*mm
= vma
->vm_mm
;
1409 struct mmu_gather tlb
;
1410 unsigned long end
= start
+ size
;
1413 tlb_gather_mmu(&tlb
, mm
, start
, end
);
1414 update_hiwater_rss(mm
);
1415 mmu_notifier_invalidate_range_start(mm
, start
, end
);
1416 for ( ; vma
&& vma
->vm_start
< end
; vma
= vma
->vm_next
)
1417 unmap_single_vma(&tlb
, vma
, start
, end
, details
);
1418 mmu_notifier_invalidate_range_end(mm
, start
, end
);
1419 tlb_finish_mmu(&tlb
, start
, end
);
1423 * zap_page_range_single - remove user pages in a given range
1424 * @vma: vm_area_struct holding the applicable pages
1425 * @address: starting address of pages to zap
1426 * @size: number of bytes to zap
1427 * @details: details of nonlinear truncation or shared cache invalidation
1429 * The range must fit into one VMA.
1431 static void zap_page_range_single(struct vm_area_struct
*vma
, unsigned long address
,
1432 unsigned long size
, struct zap_details
*details
)
1434 struct mm_struct
*mm
= vma
->vm_mm
;
1435 struct mmu_gather tlb
;
1436 unsigned long end
= address
+ size
;
1439 tlb_gather_mmu(&tlb
, mm
, address
, end
);
1440 update_hiwater_rss(mm
);
1441 mmu_notifier_invalidate_range_start(mm
, address
, end
);
1442 unmap_single_vma(&tlb
, vma
, address
, end
, details
);
1443 mmu_notifier_invalidate_range_end(mm
, address
, end
);
1444 tlb_finish_mmu(&tlb
, address
, end
);
1448 * zap_vma_ptes - remove ptes mapping the vma
1449 * @vma: vm_area_struct holding ptes to be zapped
1450 * @address: starting address of pages to zap
1451 * @size: number of bytes to zap
1453 * This function only unmaps ptes assigned to VM_PFNMAP vmas.
1455 * The entire address range must be fully contained within the vma.
1457 * Returns 0 if successful.
1459 int zap_vma_ptes(struct vm_area_struct
*vma
, unsigned long address
,
1462 if (address
< vma
->vm_start
|| address
+ size
> vma
->vm_end
||
1463 !(vma
->vm_flags
& VM_PFNMAP
))
1465 zap_page_range_single(vma
, address
, size
, NULL
);
1468 EXPORT_SYMBOL_GPL(zap_vma_ptes
);
1471 * FOLL_FORCE can write to even unwritable pte's, but only
1472 * after we've gone through a COW cycle and they are dirty.
1474 static inline bool can_follow_write_pte(pte_t pte
, unsigned int flags
)
1476 return pte_write(pte
) ||
1477 ((flags
& FOLL_FORCE
) && (flags
& FOLL_COW
) && pte_dirty(pte
));
1481 * follow_page_mask - look up a page descriptor from a user-virtual address
1482 * @vma: vm_area_struct mapping @address
1483 * @address: virtual address to look up
1484 * @flags: flags modifying lookup behaviour
1485 * @page_mask: on output, *page_mask is set according to the size of the page
1487 * @flags can have FOLL_ flags set, defined in <linux/mm.h>
1489 * Returns the mapped (struct page *), %NULL if no mapping exists, or
1490 * an error pointer if there is a mapping to something not represented
1491 * by a page descriptor (see also vm_normal_page()).
1493 struct page
*follow_page_mask(struct vm_area_struct
*vma
,
1494 unsigned long address
, unsigned int flags
,
1495 unsigned int *page_mask
)
1503 struct mm_struct
*mm
= vma
->vm_mm
;
1507 page
= follow_huge_addr(mm
, address
, flags
& FOLL_WRITE
);
1508 if (!IS_ERR(page
)) {
1509 BUG_ON(flags
& FOLL_GET
);
1514 pgd
= pgd_offset(mm
, address
);
1515 if (pgd_none(*pgd
) || unlikely(pgd_bad(*pgd
)))
1518 pud
= pud_offset(pgd
, address
);
1521 if (pud_huge(*pud
) && vma
->vm_flags
& VM_HUGETLB
) {
1522 BUG_ON(flags
& FOLL_GET
);
1523 page
= follow_huge_pud(mm
, address
, pud
, flags
& FOLL_WRITE
);
1526 if (unlikely(pud_bad(*pud
)))
1529 pmd
= pmd_offset(pud
, address
);
1532 if (pmd_huge(*pmd
) && vma
->vm_flags
& VM_HUGETLB
) {
1533 BUG_ON(flags
& FOLL_GET
);
1534 page
= follow_huge_pmd(mm
, address
, pmd
, flags
& FOLL_WRITE
);
1537 if ((flags
& FOLL_NUMA
) && pmd_numa(*pmd
))
1539 if (pmd_trans_huge(*pmd
)) {
1540 if (flags
& FOLL_SPLIT
) {
1541 split_huge_page_pmd(vma
, address
, pmd
);
1542 goto split_fallthrough
;
1544 spin_lock(&mm
->page_table_lock
);
1545 if (likely(pmd_trans_huge(*pmd
))) {
1546 if (unlikely(pmd_trans_splitting(*pmd
))) {
1547 spin_unlock(&mm
->page_table_lock
);
1548 wait_split_huge_page(vma
->anon_vma
, pmd
);
1550 page
= follow_trans_huge_pmd(vma
, address
,
1552 spin_unlock(&mm
->page_table_lock
);
1553 *page_mask
= HPAGE_PMD_NR
- 1;
1557 spin_unlock(&mm
->page_table_lock
);
1561 if (unlikely(pmd_bad(*pmd
)))
1564 ptep
= pte_offset_map_lock(mm
, pmd
, address
, &ptl
);
1567 if (!pte_present(pte
)) {
1570 * KSM's break_ksm() relies upon recognizing a ksm page
1571 * even while it is being migrated, so for that case we
1572 * need migration_entry_wait().
1574 if (likely(!(flags
& FOLL_MIGRATION
)))
1576 if (pte_none(pte
) || pte_file(pte
))
1578 entry
= pte_to_swp_entry(pte
);
1579 if (!is_migration_entry(entry
))
1581 pte_unmap_unlock(ptep
, ptl
);
1582 migration_entry_wait(mm
, pmd
, address
);
1583 goto split_fallthrough
;
1585 if ((flags
& FOLL_NUMA
) && pte_numa(pte
))
1587 if ((flags
& FOLL_WRITE
) && !can_follow_write_pte(pte
, flags
))
1590 page
= vm_normal_page(vma
, address
, pte
);
1591 if (unlikely(!page
)) {
1592 if ((flags
& FOLL_DUMP
) ||
1593 !is_zero_pfn(pte_pfn(pte
)))
1595 page
= pte_page(pte
);
1598 if (flags
& FOLL_GET
)
1599 get_page_foll(page
);
1600 if (flags
& FOLL_TOUCH
) {
1601 if ((flags
& FOLL_WRITE
) &&
1602 !pte_dirty(pte
) && !PageDirty(page
))
1603 set_page_dirty(page
);
1605 * pte_mkyoung() would be more correct here, but atomic care
1606 * is needed to avoid losing the dirty bit: it is easier to use
1607 * mark_page_accessed().
1609 mark_page_accessed(page
);
1611 if ((flags
& FOLL_MLOCK
) && (vma
->vm_flags
& VM_LOCKED
)) {
1613 * The preliminary mapping check is mainly to avoid the
1614 * pointless overhead of lock_page on the ZERO_PAGE
1615 * which might bounce very badly if there is contention.
1617 * If the page is already locked, we don't need to
1618 * handle it now - vmscan will handle it later if and
1619 * when it attempts to reclaim the page.
1621 if (page
->mapping
&& trylock_page(page
)) {
1622 lru_add_drain(); /* push cached pages to LRU */
1624 * Because we lock page here, and migration is
1625 * blocked by the pte's page reference, and we
1626 * know the page is still mapped, we don't even
1627 * need to check for file-cache page truncation.
1629 mlock_vma_page(page
);
1634 pte_unmap_unlock(ptep
, ptl
);
1639 pte_unmap_unlock(ptep
, ptl
);
1640 return ERR_PTR(-EFAULT
);
1643 pte_unmap_unlock(ptep
, ptl
);
1649 * When core dumping an enormous anonymous area that nobody
1650 * has touched so far, we don't want to allocate unnecessary pages or
1651 * page tables. Return error instead of NULL to skip handle_mm_fault,
1652 * then get_dump_page() will return NULL to leave a hole in the dump.
1653 * But we can only make this optimization where a hole would surely
1654 * be zero-filled if handle_mm_fault() actually did handle it.
1656 if ((flags
& FOLL_DUMP
) &&
1657 (!vma
->vm_ops
|| !vma
->vm_ops
->fault
))
1658 return ERR_PTR(-EFAULT
);
1661 EXPORT_SYMBOL_GPL(follow_page_mask
);
1663 static inline int stack_guard_page(struct vm_area_struct
*vma
, unsigned long addr
)
1665 return stack_guard_page_start(vma
, addr
) ||
1666 stack_guard_page_end(vma
, addr
+PAGE_SIZE
);
1670 * __get_user_pages() - pin user pages in memory
1671 * @tsk: task_struct of target task
1672 * @mm: mm_struct of target mm
1673 * @start: starting user address
1674 * @nr_pages: number of pages from start to pin
1675 * @gup_flags: flags modifying pin behaviour
1676 * @pages: array that receives pointers to the pages pinned.
1677 * Should be at least nr_pages long. Or NULL, if caller
1678 * only intends to ensure the pages are faulted in.
1679 * @vmas: array of pointers to vmas corresponding to each page.
1680 * Or NULL if the caller does not require them.
1681 * @nonblocking: whether waiting for disk IO or mmap_sem contention
1683 * Returns number of pages pinned. This may be fewer than the number
1684 * requested. If nr_pages is 0 or negative, returns 0. If no pages
1685 * were pinned, returns -errno. Each page returned must be released
1686 * with a put_page() call when it is finished with. vmas will only
1687 * remain valid while mmap_sem is held.
1689 * Must be called with mmap_sem held for read or write.
1691 * __get_user_pages walks a process's page tables and takes a reference to
1692 * each struct page that each user address corresponds to at a given
1693 * instant. That is, it takes the page that would be accessed if a user
1694 * thread accesses the given user virtual address at that instant.
1696 * This does not guarantee that the page exists in the user mappings when
1697 * __get_user_pages returns, and there may even be a completely different
1698 * page there in some cases (eg. if mmapped pagecache has been invalidated
1699 * and subsequently re faulted). However it does guarantee that the page
1700 * won't be freed completely. And mostly callers simply care that the page
1701 * contains data that was valid *at some point in time*. Typically, an IO
1702 * or similar operation cannot guarantee anything stronger anyway because
1703 * locks can't be held over the syscall boundary.
1705 * If @gup_flags & FOLL_WRITE == 0, the page must not be written to. If
1706 * the page is written to, set_page_dirty (or set_page_dirty_lock, as
1707 * appropriate) must be called after the page is finished with, and
1708 * before put_page is called.
1710 * If @nonblocking != NULL, __get_user_pages will not wait for disk IO
1711 * or mmap_sem contention, and if waiting is needed to pin all pages,
1712 * *@nonblocking will be set to 0.
1714 * In most cases, get_user_pages or get_user_pages_fast should be used
1715 * instead of __get_user_pages. __get_user_pages should be used only if
1716 * you need some special @gup_flags.
1718 long __get_user_pages(struct task_struct
*tsk
, struct mm_struct
*mm
,
1719 unsigned long start
, unsigned long nr_pages
,
1720 unsigned int gup_flags
, struct page
**pages
,
1721 struct vm_area_struct
**vmas
, int *nonblocking
)
1724 unsigned long vm_flags
;
1725 unsigned int page_mask
;
1730 VM_BUG_ON(!!pages
!= !!(gup_flags
& FOLL_GET
));
1733 * Require read or write permissions.
1734 * If FOLL_FORCE is set, we only require the "MAY" flags.
1736 vm_flags
= (gup_flags
& FOLL_WRITE
) ?
1737 (VM_WRITE
| VM_MAYWRITE
) : (VM_READ
| VM_MAYREAD
);
1738 vm_flags
&= (gup_flags
& FOLL_FORCE
) ?
1739 (VM_MAYREAD
| VM_MAYWRITE
) : (VM_READ
| VM_WRITE
);
1742 * If FOLL_FORCE and FOLL_NUMA are both set, handle_mm_fault
1743 * would be called on PROT_NONE ranges. We must never invoke
1744 * handle_mm_fault on PROT_NONE ranges or the NUMA hinting
1745 * page faults would unprotect the PROT_NONE ranges if
1746 * _PAGE_NUMA and _PAGE_PROTNONE are sharing the same pte/pmd
1747 * bitflag. So to avoid that, don't set FOLL_NUMA if
1748 * FOLL_FORCE is set.
1750 if (!(gup_flags
& FOLL_FORCE
))
1751 gup_flags
|= FOLL_NUMA
;
1756 struct vm_area_struct
*vma
;
1758 vma
= find_extend_vma(mm
, start
);
1759 if (!vma
&& in_gate_area(mm
, start
)) {
1760 unsigned long pg
= start
& PAGE_MASK
;
1766 /* user gate pages are read-only */
1767 if (gup_flags
& FOLL_WRITE
)
1768 return i
? : -EFAULT
;
1770 pgd
= pgd_offset_k(pg
);
1772 pgd
= pgd_offset_gate(mm
, pg
);
1773 BUG_ON(pgd_none(*pgd
));
1774 pud
= pud_offset(pgd
, pg
);
1775 BUG_ON(pud_none(*pud
));
1776 pmd
= pmd_offset(pud
, pg
);
1778 return i
? : -EFAULT
;
1779 VM_BUG_ON(pmd_trans_huge(*pmd
));
1780 pte
= pte_offset_map(pmd
, pg
);
1781 if (pte_none(*pte
)) {
1783 return i
? : -EFAULT
;
1785 vma
= get_gate_vma(mm
);
1789 page
= vm_normal_page(vma
, start
, *pte
);
1791 if (!(gup_flags
& FOLL_DUMP
) &&
1792 is_zero_pfn(pte_pfn(*pte
)))
1793 page
= pte_page(*pte
);
1796 return i
? : -EFAULT
;
1806 #ifdef CONFIG_MTK_EXTMEM
1807 if (!vma
|| !(vm_flags
& vma
->vm_flags
))
1809 return i
? : -EFAULT
;
1812 if (vma
->vm_flags
& (VM_IO
| VM_PFNMAP
))
1814 /*Would pass VM_IO | VM_RESERVED | VM_PFNMAP. (for Reserved Physical Memory PFN Mapping Usage)*/
1815 if(!((vma
->vm_flags
&VM_IO
)&&(vma
->vm_flags
&VM_RESERVED
)&&(vma
->vm_flags
&VM_PFNMAP
)))
1816 return i
? : -EFAULT
;
1820 (vma
->vm_flags
& (VM_IO
| VM_PFNMAP
)) ||
1821 !(vm_flags
& vma
->vm_flags
))
1822 return i
? : -EFAULT
;
1825 if (is_vm_hugetlb_page(vma
)) {
1826 i
= follow_hugetlb_page(mm
, vma
, pages
, vmas
,
1827 &start
, &nr_pages
, i
, gup_flags
);
1833 unsigned int foll_flags
= gup_flags
;
1834 unsigned int page_increm
;
1837 * If we have a pending SIGKILL, don't keep faulting
1838 * pages and potentially allocating memory.
1840 if (unlikely(fatal_signal_pending(current
)))
1841 return i
? i
: -ERESTARTSYS
;
1844 while (!(page
= follow_page_mask(vma
, start
,
1845 foll_flags
, &page_mask
))) {
1847 unsigned int fault_flags
= 0;
1849 /* For mlock, just skip the stack guard page. */
1850 if (foll_flags
& FOLL_MLOCK
) {
1851 if (stack_guard_page(vma
, start
))
1854 if (foll_flags
& FOLL_WRITE
)
1855 fault_flags
|= FAULT_FLAG_WRITE
;
1857 fault_flags
|= FAULT_FLAG_ALLOW_RETRY
;
1858 if (foll_flags
& FOLL_NOWAIT
)
1859 fault_flags
|= (FAULT_FLAG_ALLOW_RETRY
| FAULT_FLAG_RETRY_NOWAIT
);
1861 ret
= handle_mm_fault(mm
, vma
, start
,
1864 if (ret
& VM_FAULT_ERROR
) {
1865 if (ret
& VM_FAULT_OOM
)
1866 return i
? i
: -ENOMEM
;
1867 if (ret
& (VM_FAULT_HWPOISON
|
1868 VM_FAULT_HWPOISON_LARGE
)) {
1871 else if (gup_flags
& FOLL_HWPOISON
)
1876 if (ret
& (VM_FAULT_SIGBUS
|
1878 return i
? i
: -EFAULT
;
1883 if (ret
& VM_FAULT_MAJOR
)
1889 if (ret
& VM_FAULT_RETRY
) {
1896 * The VM_FAULT_WRITE bit tells us that
1897 * do_wp_page has broken COW when necessary,
1898 * even if maybe_mkwrite decided not to set
1899 * pte_write. We can thus safely do subsequent
1900 * page lookups as if they were reads. But only
1901 * do so when looping for pte_write is futile:
1902 * in some cases userspace may also be wanting
1903 * to write to the gotten user page, which a
1904 * read fault here might prevent (a readonly
1905 * page might get reCOWed by userspace write).
1907 if ((ret
& VM_FAULT_WRITE
) &&
1908 !(vma
->vm_flags
& VM_WRITE
))
1909 foll_flags
|= FOLL_COW
;
1914 return i
? i
: PTR_ERR(page
);
1918 flush_anon_page(vma
, page
, start
);
1919 flush_dcache_page(page
);
1927 page_increm
= 1 + (~(start
>> PAGE_SHIFT
) & page_mask
);
1928 if (page_increm
> nr_pages
)
1929 page_increm
= nr_pages
;
1931 start
+= page_increm
* PAGE_SIZE
;
1932 nr_pages
-= page_increm
;
1933 } while (nr_pages
&& start
< vma
->vm_end
);
1937 EXPORT_SYMBOL(__get_user_pages
);
1940 * fixup_user_fault() - manually resolve a user page fault
1941 * @tsk: the task_struct to use for page fault accounting, or
1942 * NULL if faults are not to be recorded.
1943 * @mm: mm_struct of target mm
1944 * @address: user address
1945 * @fault_flags:flags to pass down to handle_mm_fault()
1947 * This is meant to be called in the specific scenario where for locking reasons
1948 * we try to access user memory in atomic context (within a pagefault_disable()
1949 * section), this returns -EFAULT, and we want to resolve the user fault before
1952 * Typically this is meant to be used by the futex code.
1954 * The main difference with get_user_pages() is that this function will
1955 * unconditionally call handle_mm_fault() which will in turn perform all the
1956 * necessary SW fixup of the dirty and young bits in the PTE, while
1957 * handle_mm_fault() only guarantees to update these in the struct page.
1959 * This is important for some architectures where those bits also gate the
1960 * access permission to the page because they are maintained in software. On
1961 * such architectures, gup() will not be enough to make a subsequent access
1964 * This should be called with the mm_sem held for read.
1966 int fixup_user_fault(struct task_struct
*tsk
, struct mm_struct
*mm
,
1967 unsigned long address
, unsigned int fault_flags
)
1969 struct vm_area_struct
*vma
;
1970 vm_flags_t vm_flags
;
1973 vma
= find_extend_vma(mm
, address
);
1974 if (!vma
|| address
< vma
->vm_start
)
1977 vm_flags
= (fault_flags
& FAULT_FLAG_WRITE
) ? VM_WRITE
: VM_READ
;
1978 if (!(vm_flags
& vma
->vm_flags
))
1981 ret
= handle_mm_fault(mm
, vma
, address
, fault_flags
);
1982 if (ret
& VM_FAULT_ERROR
) {
1983 if (ret
& VM_FAULT_OOM
)
1985 if (ret
& (VM_FAULT_HWPOISON
| VM_FAULT_HWPOISON_LARGE
))
1987 if (ret
& (VM_FAULT_SIGBUS
| VM_FAULT_SIGSEGV
))
1992 if (ret
& VM_FAULT_MAJOR
)
2001 * get_user_pages() - pin user pages in memory
2002 * @tsk: the task_struct to use for page fault accounting, or
2003 * NULL if faults are not to be recorded.
2004 * @mm: mm_struct of target mm
2005 * @start: starting user address
2006 * @nr_pages: number of pages from start to pin
2007 * @write: whether pages will be written to by the caller
2008 * @force: whether to force write access even if user mapping is
2009 * readonly. This will result in the page being COWed even
2010 * in MAP_SHARED mappings. You do not want this.
2011 * @pages: array that receives pointers to the pages pinned.
2012 * Should be at least nr_pages long. Or NULL, if caller
2013 * only intends to ensure the pages are faulted in.
2014 * @vmas: array of pointers to vmas corresponding to each page.
2015 * Or NULL if the caller does not require them.
2017 * Returns number of pages pinned. This may be fewer than the number
2018 * requested. If nr_pages is 0 or negative, returns 0. If no pages
2019 * were pinned, returns -errno. Each page returned must be released
2020 * with a put_page() call when it is finished with. vmas will only
2021 * remain valid while mmap_sem is held.
2023 * Must be called with mmap_sem held for read or write.
2025 * get_user_pages walks a process's page tables and takes a reference to
2026 * each struct page that each user address corresponds to at a given
2027 * instant. That is, it takes the page that would be accessed if a user
2028 * thread accesses the given user virtual address at that instant.
2030 * This does not guarantee that the page exists in the user mappings when
2031 * get_user_pages returns, and there may even be a completely different
2032 * page there in some cases (eg. if mmapped pagecache has been invalidated
2033 * and subsequently re faulted). However it does guarantee that the page
2034 * won't be freed completely. And mostly callers simply care that the page
2035 * contains data that was valid *at some point in time*. Typically, an IO
2036 * or similar operation cannot guarantee anything stronger anyway because
2037 * locks can't be held over the syscall boundary.
2039 * If write=0, the page must not be written to. If the page is written to,
2040 * set_page_dirty (or set_page_dirty_lock, as appropriate) must be called
2041 * after the page is finished with, and before put_page is called.
2043 * get_user_pages is typically used for fewer-copy IO operations, to get a
2044 * handle on the memory by some means other than accesses via the user virtual
2045 * addresses. The pages may be submitted for DMA to devices or accessed via
2046 * their kernel linear mapping (via the kmap APIs). Care should be taken to
2047 * use the correct cache flushing APIs.
2049 * See also get_user_pages_fast, for performance critical applications.
2051 long get_user_pages(struct task_struct
*tsk
, struct mm_struct
*mm
,
2052 unsigned long start
, unsigned long nr_pages
, int write
,
2053 int force
, struct page
**pages
, struct vm_area_struct
**vmas
)
2055 int flags
= FOLL_TOUCH
;
2060 flags
|= FOLL_WRITE
;
2062 flags
|= FOLL_FORCE
;
2064 return __get_user_pages(tsk
, mm
, start
, nr_pages
, flags
, pages
, vmas
,
2067 EXPORT_SYMBOL(get_user_pages
);
2070 * get_dump_page() - pin user page in memory while writing it to core dump
2071 * @addr: user address
2073 * Returns struct page pointer of user page pinned for dump,
2074 * to be freed afterwards by page_cache_release() or put_page().
2076 * Returns NULL on any kind of failure - a hole must then be inserted into
2077 * the corefile, to preserve alignment with its headers; and also returns
2078 * NULL wherever the ZERO_PAGE, or an anonymous pte_none, has been found -
2079 * allowing a hole to be left in the corefile to save diskspace.
2081 * Called without mmap_sem, but after all other threads have been killed.
2083 #ifdef CONFIG_ELF_CORE
2084 struct page
*get_dump_page(unsigned long addr
)
2086 struct vm_area_struct
*vma
;
2089 if (__get_user_pages(current
, current
->mm
, addr
, 1,
2090 FOLL_FORCE
| FOLL_DUMP
| FOLL_GET
, &page
, &vma
,
2093 flush_cache_page(vma
, addr
, page_to_pfn(page
));
2096 #endif /* CONFIG_ELF_CORE */
2098 pte_t
*__get_locked_pte(struct mm_struct
*mm
, unsigned long addr
,
2101 pgd_t
* pgd
= pgd_offset(mm
, addr
);
2102 pud_t
* pud
= pud_alloc(mm
, pgd
, addr
);
2104 pmd_t
* pmd
= pmd_alloc(mm
, pud
, addr
);
2106 VM_BUG_ON(pmd_trans_huge(*pmd
));
2107 return pte_alloc_map_lock(mm
, pmd
, addr
, ptl
);
2114 * This is the old fallback for page remapping.
2116 * For historical reasons, it only allows reserved pages. Only
2117 * old drivers should use this, and they needed to mark their
2118 * pages reserved for the old functions anyway.
2120 static int insert_page(struct vm_area_struct
*vma
, unsigned long addr
,
2121 struct page
*page
, pgprot_t prot
)
2123 struct mm_struct
*mm
= vma
->vm_mm
;
2132 flush_dcache_page(page
);
2133 pte
= get_locked_pte(mm
, addr
, &ptl
);
2137 if (!pte_none(*pte
))
2140 /* Ok, finally just insert the thing.. */
2142 inc_mm_counter_fast(mm
, MM_FILEPAGES
);
2143 page_add_file_rmap(page
);
2144 set_pte_at(mm
, addr
, pte
, mk_pte(page
, prot
));
2147 pte_unmap_unlock(pte
, ptl
);
2150 pte_unmap_unlock(pte
, ptl
);
2156 * vm_insert_page - insert single page into user vma
2157 * @vma: user vma to map to
2158 * @addr: target user address of this page
2159 * @page: source kernel page
2161 * This allows drivers to insert individual pages they've allocated
2164 * The page has to be a nice clean _individual_ kernel allocation.
2165 * If you allocate a compound page, you need to have marked it as
2166 * such (__GFP_COMP), or manually just split the page up yourself
2167 * (see split_page()).
2169 * NOTE! Traditionally this was done with "remap_pfn_range()" which
2170 * took an arbitrary page protection parameter. This doesn't allow
2171 * that. Your vma protection will have to be set up correctly, which
2172 * means that if you want a shared writable mapping, you'd better
2173 * ask for a shared writable mapping!
2175 * The page does not need to be reserved.
2177 * Usually this function is called from f_op->mmap() handler
2178 * under mm->mmap_sem write-lock, so it can change vma->vm_flags.
2179 * Caller must set VM_MIXEDMAP on vma if it wants to call this
2180 * function from other places, for example from page-fault handler.
2182 int vm_insert_page(struct vm_area_struct
*vma
, unsigned long addr
,
2185 if (addr
< vma
->vm_start
|| addr
>= vma
->vm_end
)
2187 if (!page_count(page
))
2189 if (!(vma
->vm_flags
& VM_MIXEDMAP
)) {
2190 BUG_ON(down_read_trylock(&vma
->vm_mm
->mmap_sem
));
2191 BUG_ON(vma
->vm_flags
& VM_PFNMAP
);
2192 vma
->vm_flags
|= VM_MIXEDMAP
;
2194 return insert_page(vma
, addr
, page
, vma
->vm_page_prot
);
2196 EXPORT_SYMBOL(vm_insert_page
);
2198 static int insert_pfn(struct vm_area_struct
*vma
, unsigned long addr
,
2199 unsigned long pfn
, pgprot_t prot
)
2201 struct mm_struct
*mm
= vma
->vm_mm
;
2207 pte
= get_locked_pte(mm
, addr
, &ptl
);
2211 if (!pte_none(*pte
))
2214 /* Ok, finally just insert the thing.. */
2215 entry
= pte_mkspecial(pfn_pte(pfn
, prot
));
2216 set_pte_at(mm
, addr
, pte
, entry
);
2217 update_mmu_cache(vma
, addr
, pte
); /* XXX: why not for insert_page? */
2221 pte_unmap_unlock(pte
, ptl
);
2227 * vm_insert_pfn - insert single pfn into user vma
2228 * @vma: user vma to map to
2229 * @addr: target user address of this page
2230 * @pfn: source kernel pfn
2232 * Similar to vm_insert_page, this allows drivers to insert individual pages
2233 * they've allocated into a user vma. Same comments apply.
2235 * This function should only be called from a vm_ops->fault handler, and
2236 * in that case the handler should return NULL.
2238 * vma cannot be a COW mapping.
2240 * As this is called only for pages that do not currently exist, we
2241 * do not need to flush old virtual caches or the TLB.
2243 int vm_insert_pfn(struct vm_area_struct
*vma
, unsigned long addr
,
2247 pgprot_t pgprot
= vma
->vm_page_prot
;
2249 * Technically, architectures with pte_special can avoid all these
2250 * restrictions (same for remap_pfn_range). However we would like
2251 * consistency in testing and feature parity among all, so we should
2252 * try to keep these invariants in place for everybody.
2254 BUG_ON(!(vma
->vm_flags
& (VM_PFNMAP
|VM_MIXEDMAP
)));
2255 BUG_ON((vma
->vm_flags
& (VM_PFNMAP
|VM_MIXEDMAP
)) ==
2256 (VM_PFNMAP
|VM_MIXEDMAP
));
2257 BUG_ON((vma
->vm_flags
& VM_PFNMAP
) && is_cow_mapping(vma
->vm_flags
));
2258 BUG_ON((vma
->vm_flags
& VM_MIXEDMAP
) && pfn_valid(pfn
));
2260 if (addr
< vma
->vm_start
|| addr
>= vma
->vm_end
)
2262 if (track_pfn_insert(vma
, &pgprot
, pfn
))
2265 ret
= insert_pfn(vma
, addr
, pfn
, pgprot
);
2269 EXPORT_SYMBOL(vm_insert_pfn
);
2271 int vm_insert_mixed(struct vm_area_struct
*vma
, unsigned long addr
,
2274 BUG_ON(!(vma
->vm_flags
& VM_MIXEDMAP
));
2276 if (addr
< vma
->vm_start
|| addr
>= vma
->vm_end
)
2280 * If we don't have pte special, then we have to use the pfn_valid()
2281 * based VM_MIXEDMAP scheme (see vm_normal_page), and thus we *must*
2282 * refcount the page if pfn_valid is true (hence insert_page rather
2283 * than insert_pfn). If a zero_pfn were inserted into a VM_MIXEDMAP
2284 * without pte special, it would there be refcounted as a normal page.
2286 if (!HAVE_PTE_SPECIAL
&& pfn_valid(pfn
)) {
2289 page
= pfn_to_page(pfn
);
2290 return insert_page(vma
, addr
, page
, vma
->vm_page_prot
);
2292 return insert_pfn(vma
, addr
, pfn
, vma
->vm_page_prot
);
2294 EXPORT_SYMBOL(vm_insert_mixed
);
2297 * maps a range of physical memory into the requested pages. the old
2298 * mappings are removed. any references to nonexistent pages results
2299 * in null mappings (currently treated as "copy-on-access")
2301 static int remap_pte_range(struct mm_struct
*mm
, pmd_t
*pmd
,
2302 unsigned long addr
, unsigned long end
,
2303 unsigned long pfn
, pgprot_t prot
)
2308 pte
= pte_alloc_map_lock(mm
, pmd
, addr
, &ptl
);
2311 arch_enter_lazy_mmu_mode();
2313 BUG_ON(!pte_none(*pte
));
2314 set_pte_at(mm
, addr
, pte
, pte_mkspecial(pfn_pte(pfn
, prot
)));
2316 } while (pte
++, addr
+= PAGE_SIZE
, addr
!= end
);
2317 arch_leave_lazy_mmu_mode();
2318 pte_unmap_unlock(pte
- 1, ptl
);
2322 static inline int remap_pmd_range(struct mm_struct
*mm
, pud_t
*pud
,
2323 unsigned long addr
, unsigned long end
,
2324 unsigned long pfn
, pgprot_t prot
)
2329 pfn
-= addr
>> PAGE_SHIFT
;
2330 pmd
= pmd_alloc(mm
, pud
, addr
);
2333 VM_BUG_ON(pmd_trans_huge(*pmd
));
2335 next
= pmd_addr_end(addr
, end
);
2336 if (remap_pte_range(mm
, pmd
, addr
, next
,
2337 pfn
+ (addr
>> PAGE_SHIFT
), prot
))
2339 } while (pmd
++, addr
= next
, addr
!= end
);
2343 static inline int remap_pud_range(struct mm_struct
*mm
, pgd_t
*pgd
,
2344 unsigned long addr
, unsigned long end
,
2345 unsigned long pfn
, pgprot_t prot
)
2350 pfn
-= addr
>> PAGE_SHIFT
;
2351 pud
= pud_alloc(mm
, pgd
, addr
);
2355 next
= pud_addr_end(addr
, end
);
2356 if (remap_pmd_range(mm
, pud
, addr
, next
,
2357 pfn
+ (addr
>> PAGE_SHIFT
), prot
))
2359 } while (pud
++, addr
= next
, addr
!= end
);
2364 * remap_pfn_range - remap kernel memory to userspace
2365 * @vma: user vma to map to
2366 * @addr: target user address to start at
2367 * @pfn: physical address of kernel memory
2368 * @size: size of map area
2369 * @prot: page protection flags for this mapping
2371 * Note: this is only safe if the mm semaphore is held when called.
2373 int remap_pfn_range(struct vm_area_struct
*vma
, unsigned long addr
,
2374 unsigned long pfn
, unsigned long size
, pgprot_t prot
)
2378 unsigned long end
= addr
+ PAGE_ALIGN(size
);
2379 struct mm_struct
*mm
= vma
->vm_mm
;
2383 * Physically remapped pages are special. Tell the
2384 * rest of the world about it:
2385 * VM_IO tells people not to look at these pages
2386 * (accesses can have side effects).
2387 * VM_PFNMAP tells the core MM that the base pages are just
2388 * raw PFN mappings, and do not have a "struct page" associated
2391 * Disable vma merging and expanding with mremap().
2393 * Omit vma from core dump, even when VM_IO turned off.
2395 * There's a horrible special case to handle copy-on-write
2396 * behaviour that some programs depend on. We mark the "original"
2397 * un-COW'ed pages by matching them up with "vma->vm_pgoff".
2398 * See vm_normal_page() for details.
2400 #ifdef CONFIG_MTK_EXTMEM
2401 if (addr
== vma
->vm_start
&& end
== vma
->vm_end
) {
2402 vma
->vm_pgoff
= pfn
;
2403 } else if (is_cow_mapping(vma
->vm_flags
))
2406 if (is_cow_mapping(vma
->vm_flags
)) {
2407 if (addr
!= vma
->vm_start
|| end
!= vma
->vm_end
)
2409 vma
->vm_pgoff
= pfn
;
2412 err
= track_pfn_remap(vma
, &prot
, pfn
, addr
, PAGE_ALIGN(size
));
2416 vma
->vm_flags
|= VM_IO
| VM_PFNMAP
| VM_DONTEXPAND
| VM_DONTDUMP
;
2418 BUG_ON(addr
>= end
);
2419 pfn
-= addr
>> PAGE_SHIFT
;
2420 pgd
= pgd_offset(mm
, addr
);
2421 flush_cache_range(vma
, addr
, end
);
2423 next
= pgd_addr_end(addr
, end
);
2424 err
= remap_pud_range(mm
, pgd
, addr
, next
,
2425 pfn
+ (addr
>> PAGE_SHIFT
), prot
);
2428 } while (pgd
++, addr
= next
, addr
!= end
);
2431 untrack_pfn(vma
, pfn
, PAGE_ALIGN(size
));
2435 EXPORT_SYMBOL(remap_pfn_range
);
2438 * vm_iomap_memory - remap memory to userspace
2439 * @vma: user vma to map to
2440 * @start: start of area
2441 * @len: size of area
2443 * This is a simplified io_remap_pfn_range() for common driver use. The
2444 * driver just needs to give us the physical memory range to be mapped,
2445 * we'll figure out the rest from the vma information.
2447 * NOTE! Some drivers might want to tweak vma->vm_page_prot first to get
2448 * whatever write-combining details or similar.
2450 int vm_iomap_memory(struct vm_area_struct
*vma
, phys_addr_t start
, unsigned long len
)
2452 unsigned long vm_len
, pfn
, pages
;
2454 /* Check that the physical memory area passed in looks valid */
2455 if (start
+ len
< start
)
2458 * You *really* shouldn't map things that aren't page-aligned,
2459 * but we've historically allowed it because IO memory might
2460 * just have smaller alignment.
2462 len
+= start
& ~PAGE_MASK
;
2463 pfn
= start
>> PAGE_SHIFT
;
2464 pages
= (len
+ ~PAGE_MASK
) >> PAGE_SHIFT
;
2465 if (pfn
+ pages
< pfn
)
2468 /* We start the mapping 'vm_pgoff' pages into the area */
2469 if (vma
->vm_pgoff
> pages
)
2471 pfn
+= vma
->vm_pgoff
;
2472 pages
-= vma
->vm_pgoff
;
2474 /* Can we fit all of the mapping? */
2475 vm_len
= vma
->vm_end
- vma
->vm_start
;
2476 if (vm_len
>> PAGE_SHIFT
> pages
)
2479 /* Ok, let it rip */
2480 return io_remap_pfn_range(vma
, vma
->vm_start
, pfn
, vm_len
, vma
->vm_page_prot
);
2482 EXPORT_SYMBOL(vm_iomap_memory
);
2484 static int apply_to_pte_range(struct mm_struct
*mm
, pmd_t
*pmd
,
2485 unsigned long addr
, unsigned long end
,
2486 pte_fn_t fn
, void *data
)
2491 spinlock_t
*uninitialized_var(ptl
);
2493 pte
= (mm
== &init_mm
) ?
2494 pte_alloc_kernel(pmd
, addr
) :
2495 pte_alloc_map_lock(mm
, pmd
, addr
, &ptl
);
2499 BUG_ON(pmd_huge(*pmd
));
2501 arch_enter_lazy_mmu_mode();
2503 token
= pmd_pgtable(*pmd
);
2506 err
= fn(pte
++, token
, addr
, data
);
2509 } while (addr
+= PAGE_SIZE
, addr
!= end
);
2511 arch_leave_lazy_mmu_mode();
2514 pte_unmap_unlock(pte
-1, ptl
);
2518 static int apply_to_pmd_range(struct mm_struct
*mm
, pud_t
*pud
,
2519 unsigned long addr
, unsigned long end
,
2520 pte_fn_t fn
, void *data
)
2526 BUG_ON(pud_huge(*pud
));
2528 pmd
= pmd_alloc(mm
, pud
, addr
);
2532 next
= pmd_addr_end(addr
, end
);
2533 err
= apply_to_pte_range(mm
, pmd
, addr
, next
, fn
, data
);
2536 } while (pmd
++, addr
= next
, addr
!= end
);
2540 static int apply_to_pud_range(struct mm_struct
*mm
, pgd_t
*pgd
,
2541 unsigned long addr
, unsigned long end
,
2542 pte_fn_t fn
, void *data
)
2548 pud
= pud_alloc(mm
, pgd
, addr
);
2552 next
= pud_addr_end(addr
, end
);
2553 err
= apply_to_pmd_range(mm
, pud
, addr
, next
, fn
, data
);
2556 } while (pud
++, addr
= next
, addr
!= end
);
2561 * Scan a region of virtual memory, filling in page tables as necessary
2562 * and calling a provided function on each leaf page table.
2564 int apply_to_page_range(struct mm_struct
*mm
, unsigned long addr
,
2565 unsigned long size
, pte_fn_t fn
, void *data
)
2569 unsigned long end
= addr
+ size
;
2572 BUG_ON(addr
>= end
);
2573 pgd
= pgd_offset(mm
, addr
);
2575 next
= pgd_addr_end(addr
, end
);
2576 err
= apply_to_pud_range(mm
, pgd
, addr
, next
, fn
, data
);
2579 } while (pgd
++, addr
= next
, addr
!= end
);
2583 EXPORT_SYMBOL_GPL(apply_to_page_range
);
2586 * handle_pte_fault chooses page fault handler according to an entry
2587 * which was read non-atomically. Before making any commitment, on
2588 * those architectures or configurations (e.g. i386 with PAE) which
2589 * might give a mix of unmatched parts, do_swap_page and do_nonlinear_fault
2590 * must check under lock before unmapping the pte and proceeding
2591 * (but do_wp_page is only called after already making such a check;
2592 * and do_anonymous_page can safely check later on).
2594 static inline int pte_unmap_same(struct mm_struct
*mm
, pmd_t
*pmd
,
2595 pte_t
*page_table
, pte_t orig_pte
)
2598 #if defined(CONFIG_SMP) || defined(CONFIG_PREEMPT)
2599 if (sizeof(pte_t
) > sizeof(unsigned long)) {
2600 spinlock_t
*ptl
= pte_lockptr(mm
, pmd
);
2602 same
= pte_same(*page_table
, orig_pte
);
2606 pte_unmap(page_table
);
2610 static inline void cow_user_page(struct page
*dst
, struct page
*src
, unsigned long va
, struct vm_area_struct
*vma
)
2613 * If the source page was a PFN mapping, we don't have
2614 * a "struct page" for it. We do a best-effort copy by
2615 * just copying from the original user address. If that
2616 * fails, we just zero-fill it. Live with it.
2618 if (unlikely(!src
)) {
2619 void *kaddr
= kmap_atomic(dst
);
2620 void __user
*uaddr
= (void __user
*)(va
& PAGE_MASK
);
2623 * This really shouldn't fail, because the page is there
2624 * in the page tables. But it might just be unreadable,
2625 * in which case we just give up and fill the result with
2628 if (__copy_from_user_inatomic(kaddr
, uaddr
, PAGE_SIZE
))
2630 kunmap_atomic(kaddr
);
2631 flush_dcache_page(dst
);
2633 copy_user_highpage(dst
, src
, va
, vma
);
2637 * This routine handles present pages, when users try to write
2638 * to a shared page. It is done by copying the page to a new address
2639 * and decrementing the shared-page counter for the old page.
2641 * Note that this routine assumes that the protection checks have been
2642 * done by the caller (the low-level page fault routine in most cases).
2643 * Thus we can safely just mark it writable once we've done any necessary
2646 * We also mark the page dirty at this point even though the page will
2647 * change only once the write actually happens. This avoids a few races,
2648 * and potentially makes it more efficient.
2650 * We enter with non-exclusive mmap_sem (to exclude vma changes,
2651 * but allow concurrent faults), with pte both mapped and locked.
2652 * We return with mmap_sem still held, but pte unmapped and unlocked.
2654 static int do_wp_page(struct mm_struct
*mm
, struct vm_area_struct
*vma
,
2655 unsigned long address
, pte_t
*page_table
, pmd_t
*pmd
,
2656 spinlock_t
*ptl
, pte_t orig_pte
)
2659 struct page
*old_page
, *new_page
= NULL
;
2662 int page_mkwrite
= 0;
2663 struct page
*dirty_page
= NULL
;
2664 unsigned long mmun_start
= 0; /* For mmu_notifiers */
2665 unsigned long mmun_end
= 0; /* For mmu_notifiers */
2667 old_page
= vm_normal_page(vma
, address
, orig_pte
);
2670 * VM_MIXEDMAP !pfn_valid() case
2672 * We should not cow pages in a shared writeable mapping.
2673 * Just mark the pages writable as we can't do any dirty
2674 * accounting on raw pfn maps.
2676 if ((vma
->vm_flags
& (VM_WRITE
|VM_SHARED
)) ==
2677 (VM_WRITE
|VM_SHARED
))
2683 * Take out anonymous pages first, anonymous shared vmas are
2684 * not dirty accountable.
2686 if (PageAnon(old_page
) && !PageKsm(old_page
)) {
2687 if (!trylock_page(old_page
)) {
2688 page_cache_get(old_page
);
2689 pte_unmap_unlock(page_table
, ptl
);
2690 lock_page(old_page
);
2691 page_table
= pte_offset_map_lock(mm
, pmd
, address
,
2693 if (!pte_same(*page_table
, orig_pte
)) {
2694 unlock_page(old_page
);
2697 page_cache_release(old_page
);
2699 if (reuse_swap_page(old_page
)) {
2701 * The page is all ours. Move it to our anon_vma so
2702 * the rmap code will not search our parent or siblings.
2703 * Protected against the rmap code by the page lock.
2705 page_move_anon_rmap(old_page
, vma
, address
);
2706 unlock_page(old_page
);
2709 unlock_page(old_page
);
2710 } else if (unlikely((vma
->vm_flags
& (VM_WRITE
|VM_SHARED
)) ==
2711 (VM_WRITE
|VM_SHARED
))) {
2713 * Only catch write-faults on shared writable pages,
2714 * read-only shared pages can get COWed by
2715 * get_user_pages(.write=1, .force=1).
2717 if (vma
->vm_ops
&& vma
->vm_ops
->page_mkwrite
) {
2718 struct vm_fault vmf
;
2721 vmf
.virtual_address
= (void __user
*)(address
&
2723 vmf
.pgoff
= old_page
->index
;
2724 vmf
.flags
= FAULT_FLAG_WRITE
|FAULT_FLAG_MKWRITE
;
2725 vmf
.page
= old_page
;
2728 * Notify the address space that the page is about to
2729 * become writable so that it can prohibit this or wait
2730 * for the page to get into an appropriate state.
2732 * We do this without the lock held, so that it can
2733 * sleep if it needs to.
2735 page_cache_get(old_page
);
2736 pte_unmap_unlock(page_table
, ptl
);
2738 tmp
= vma
->vm_ops
->page_mkwrite(vma
, &vmf
);
2740 (VM_FAULT_ERROR
| VM_FAULT_NOPAGE
))) {
2742 goto unwritable_page
;
2744 if (unlikely(!(tmp
& VM_FAULT_LOCKED
))) {
2745 lock_page(old_page
);
2746 if (!old_page
->mapping
) {
2747 ret
= 0; /* retry the fault */
2748 unlock_page(old_page
);
2749 goto unwritable_page
;
2752 VM_BUG_ON(!PageLocked(old_page
));
2755 * Since we dropped the lock we need to revalidate
2756 * the PTE as someone else may have changed it. If
2757 * they did, we just return, as we can count on the
2758 * MMU to tell us if they didn't also make it writable.
2760 page_table
= pte_offset_map_lock(mm
, pmd
, address
,
2762 if (!pte_same(*page_table
, orig_pte
)) {
2763 unlock_page(old_page
);
2769 dirty_page
= old_page
;
2770 get_page(dirty_page
);
2773 flush_cache_page(vma
, address
, pte_pfn(orig_pte
));
2774 entry
= pte_mkyoung(orig_pte
);
2775 entry
= maybe_mkwrite(pte_mkdirty(entry
), vma
);
2776 if (ptep_set_access_flags(vma
, address
, page_table
, entry
,1))
2777 update_mmu_cache(vma
, address
, page_table
);
2778 pte_unmap_unlock(page_table
, ptl
);
2779 ret
|= VM_FAULT_WRITE
;
2785 * Yes, Virginia, this is actually required to prevent a race
2786 * with clear_page_dirty_for_io() from clearing the page dirty
2787 * bit after it clear all dirty ptes, but before a racing
2788 * do_wp_page installs a dirty pte.
2790 * __do_fault is protected similarly.
2792 if (!page_mkwrite
) {
2793 wait_on_page_locked(dirty_page
);
2794 set_page_dirty_balance(dirty_page
, page_mkwrite
);
2795 /* file_update_time outside page_lock */
2797 file_update_time(vma
->vm_file
);
2799 put_page(dirty_page
);
2801 struct address_space
*mapping
= dirty_page
->mapping
;
2803 set_page_dirty(dirty_page
);
2804 unlock_page(dirty_page
);
2805 page_cache_release(dirty_page
);
2808 * Some device drivers do not set page.mapping
2809 * but still dirty their pages
2811 balance_dirty_pages_ratelimited(mapping
);
2819 * Ok, we need to copy. Oh, well..
2821 page_cache_get(old_page
);
2823 pte_unmap_unlock(page_table
, ptl
);
2825 if (unlikely(anon_vma_prepare(vma
)))
2828 if (is_zero_pfn(pte_pfn(orig_pte
))) {
2829 new_page
= alloc_zeroed_user_highpage_movable(vma
, address
);
2833 new_page
= alloc_page_vma(GFP_HIGHUSER_MOVABLE
, vma
, address
);
2836 cow_user_page(new_page
, old_page
, address
, vma
);
2838 __SetPageUptodate(new_page
);
2840 if (mem_cgroup_newpage_charge(new_page
, mm
, GFP_KERNEL
))
2843 mmun_start
= address
& PAGE_MASK
;
2844 mmun_end
= mmun_start
+ PAGE_SIZE
;
2845 mmu_notifier_invalidate_range_start(mm
, mmun_start
, mmun_end
);
2848 * Re-check the pte - we dropped the lock
2850 page_table
= pte_offset_map_lock(mm
, pmd
, address
, &ptl
);
2851 if (likely(pte_same(*page_table
, orig_pte
))) {
2853 if (!PageAnon(old_page
)) {
2854 dec_mm_counter_fast(mm
, MM_FILEPAGES
);
2855 inc_mm_counter_fast(mm
, MM_ANONPAGES
);
2858 inc_mm_counter_fast(mm
, MM_ANONPAGES
);
2859 flush_cache_page(vma
, address
, pte_pfn(orig_pte
));
2860 entry
= mk_pte(new_page
, vma
->vm_page_prot
);
2861 entry
= maybe_mkwrite(pte_mkdirty(entry
), vma
);
2863 * Clear the pte entry and flush it first, before updating the
2864 * pte with the new entry. This will avoid a race condition
2865 * seen in the presence of one thread doing SMC and another
2868 ptep_clear_flush(vma
, address
, page_table
);
2869 page_add_new_anon_rmap(new_page
, vma
, address
);
2871 * We call the notify macro here because, when using secondary
2872 * mmu page tables (such as kvm shadow page tables), we want the
2873 * new page to be mapped directly into the secondary page table.
2875 set_pte_at_notify(mm
, address
, page_table
, entry
);
2876 update_mmu_cache(vma
, address
, page_table
);
2879 * Only after switching the pte to the new page may
2880 * we remove the mapcount here. Otherwise another
2881 * process may come and find the rmap count decremented
2882 * before the pte is switched to the new page, and
2883 * "reuse" the old page writing into it while our pte
2884 * here still points into it and can be read by other
2887 * The critical issue is to order this
2888 * page_remove_rmap with the ptp_clear_flush above.
2889 * Those stores are ordered by (if nothing else,)
2890 * the barrier present in the atomic_add_negative
2891 * in page_remove_rmap.
2893 * Then the TLB flush in ptep_clear_flush ensures that
2894 * no process can access the old page before the
2895 * decremented mapcount is visible. And the old page
2896 * cannot be reused until after the decremented
2897 * mapcount is visible. So transitively, TLBs to
2898 * old page will be flushed before it can be reused.
2900 page_remove_rmap(old_page
);
2903 /* Free the old page.. */
2904 new_page
= old_page
;
2905 ret
|= VM_FAULT_WRITE
;
2907 mem_cgroup_uncharge_page(new_page
);
2910 page_cache_release(new_page
);
2912 pte_unmap_unlock(page_table
, ptl
);
2913 if (mmun_end
> mmun_start
)
2914 mmu_notifier_invalidate_range_end(mm
, mmun_start
, mmun_end
);
2917 * Don't let another task, with possibly unlocked vma,
2918 * keep the mlocked page.
2920 if ((ret
& VM_FAULT_WRITE
) && (vma
->vm_flags
& VM_LOCKED
)) {
2921 lock_page(old_page
); /* LRU manipulation */
2922 munlock_vma_page(old_page
);
2923 unlock_page(old_page
);
2925 page_cache_release(old_page
);
2929 page_cache_release(new_page
);
2932 page_cache_release(old_page
);
2933 return VM_FAULT_OOM
;
2936 page_cache_release(old_page
);
2940 static void unmap_mapping_range_vma(struct vm_area_struct
*vma
,
2941 unsigned long start_addr
, unsigned long end_addr
,
2942 struct zap_details
*details
)
2944 zap_page_range_single(vma
, start_addr
, end_addr
- start_addr
, details
);
2947 static inline void unmap_mapping_range_tree(struct rb_root
*root
,
2948 struct zap_details
*details
)
2950 struct vm_area_struct
*vma
;
2951 pgoff_t vba
, vea
, zba
, zea
;
2953 vma_interval_tree_foreach(vma
, root
,
2954 details
->first_index
, details
->last_index
) {
2956 vba
= vma
->vm_pgoff
;
2957 vea
= vba
+ ((vma
->vm_end
- vma
->vm_start
) >> PAGE_SHIFT
) - 1;
2958 /* Assume for now that PAGE_CACHE_SHIFT == PAGE_SHIFT */
2959 zba
= details
->first_index
;
2962 zea
= details
->last_index
;
2966 unmap_mapping_range_vma(vma
,
2967 ((zba
- vba
) << PAGE_SHIFT
) + vma
->vm_start
,
2968 ((zea
- vba
+ 1) << PAGE_SHIFT
) + vma
->vm_start
,
2973 static inline void unmap_mapping_range_list(struct list_head
*head
,
2974 struct zap_details
*details
)
2976 struct vm_area_struct
*vma
;
2979 * In nonlinear VMAs there is no correspondence between virtual address
2980 * offset and file offset. So we must perform an exhaustive search
2981 * across *all* the pages in each nonlinear VMA, not just the pages
2982 * whose virtual address lies outside the file truncation point.
2984 list_for_each_entry(vma
, head
, shared
.nonlinear
) {
2985 details
->nonlinear_vma
= vma
;
2986 unmap_mapping_range_vma(vma
, vma
->vm_start
, vma
->vm_end
, details
);
2991 * unmap_mapping_range - unmap the portion of all mmaps in the specified address_space corresponding to the specified page range in the underlying file.
2992 * @mapping: the address space containing mmaps to be unmapped.
2993 * @holebegin: byte in first page to unmap, relative to the start of
2994 * the underlying file. This will be rounded down to a PAGE_SIZE
2995 * boundary. Note that this is different from truncate_pagecache(), which
2996 * must keep the partial page. In contrast, we must get rid of
2998 * @holelen: size of prospective hole in bytes. This will be rounded
2999 * up to a PAGE_SIZE boundary. A holelen of zero truncates to the
3001 * @even_cows: 1 when truncating a file, unmap even private COWed pages;
3002 * but 0 when invalidating pagecache, don't throw away private data.
3004 void unmap_mapping_range(struct address_space
*mapping
,
3005 loff_t
const holebegin
, loff_t
const holelen
, int even_cows
)
3007 struct zap_details details
;
3008 pgoff_t hba
= holebegin
>> PAGE_SHIFT
;
3009 pgoff_t hlen
= (holelen
+ PAGE_SIZE
- 1) >> PAGE_SHIFT
;
3011 /* Check for overflow. */
3012 if (sizeof(holelen
) > sizeof(hlen
)) {
3014 (holebegin
+ holelen
+ PAGE_SIZE
- 1) >> PAGE_SHIFT
;
3015 if (holeend
& ~(long long)ULONG_MAX
)
3016 hlen
= ULONG_MAX
- hba
+ 1;
3019 details
.check_mapping
= even_cows
? NULL
: mapping
;
3020 details
.nonlinear_vma
= NULL
;
3021 details
.first_index
= hba
;
3022 details
.last_index
= hba
+ hlen
- 1;
3023 if (details
.last_index
< details
.first_index
)
3024 details
.last_index
= ULONG_MAX
;
3027 mutex_lock(&mapping
->i_mmap_mutex
);
3028 if (unlikely(!RB_EMPTY_ROOT(&mapping
->i_mmap
)))
3029 unmap_mapping_range_tree(&mapping
->i_mmap
, &details
);
3030 if (unlikely(!list_empty(&mapping
->i_mmap_nonlinear
)))
3031 unmap_mapping_range_list(&mapping
->i_mmap_nonlinear
, &details
);
3032 mutex_unlock(&mapping
->i_mmap_mutex
);
3034 EXPORT_SYMBOL(unmap_mapping_range
);
3037 * We enter with non-exclusive mmap_sem (to exclude vma changes,
3038 * but allow concurrent faults), and pte mapped but not yet locked.
3039 * We return with mmap_sem still held, but pte unmapped and unlocked.
3041 static int do_swap_page(struct mm_struct
*mm
, struct vm_area_struct
*vma
,
3042 unsigned long address
, pte_t
*page_table
, pmd_t
*pmd
,
3043 unsigned int flags
, pte_t orig_pte
)
3046 struct page
*page
, *swapcache
;
3050 struct mem_cgroup
*ptr
;
3054 if (!pte_unmap_same(mm
, pmd
, page_table
, orig_pte
))
3057 entry
= pte_to_swp_entry(orig_pte
);
3058 if (unlikely(non_swap_entry(entry
))) {
3059 if (is_migration_entry(entry
)) {
3060 migration_entry_wait(mm
, pmd
, address
);
3061 } else if (is_hwpoison_entry(entry
)) {
3062 ret
= VM_FAULT_HWPOISON
;
3064 print_bad_pte(vma
, address
, orig_pte
, NULL
);
3065 ret
= VM_FAULT_SIGBUS
;
3069 delayacct_set_flag(DELAYACCT_PF_SWAPIN
);
3070 page
= lookup_swap_cache(entry
);
3072 page
= swapin_readahead(entry
,
3073 GFP_HIGHUSER_MOVABLE
, vma
, address
);
3076 * Back out if somebody else faulted in this pte
3077 * while we released the pte lock.
3079 page_table
= pte_offset_map_lock(mm
, pmd
, address
, &ptl
);
3080 if (likely(pte_same(*page_table
, orig_pte
)))
3082 delayacct_clear_flag(DELAYACCT_PF_SWAPIN
);
3086 /* Had to read the page from swap area: Major fault */
3087 ret
= VM_FAULT_MAJOR
;
3088 count_vm_event(PGMAJFAULT
);
3089 mem_cgroup_count_vm_event(mm
, PGMAJFAULT
);
3090 } else if (PageHWPoison(page
)) {
3092 * hwpoisoned dirty swapcache pages are kept for killing
3093 * owner processes (which may be unknown at hwpoison time)
3095 ret
= VM_FAULT_HWPOISON
;
3096 delayacct_clear_flag(DELAYACCT_PF_SWAPIN
);
3102 locked
= lock_page_or_retry(page
, mm
, flags
);
3104 delayacct_clear_flag(DELAYACCT_PF_SWAPIN
);
3106 ret
|= VM_FAULT_RETRY
;
3111 * Make sure try_to_free_swap or reuse_swap_page or swapoff did not
3112 * release the swapcache from under us. The page pin, and pte_same
3113 * test below, are not enough to exclude that. Even if it is still
3114 * swapcache, we need to check that the page's swap has not changed.
3116 if (unlikely(!PageSwapCache(page
) || page_private(page
) != entry
.val
))
3119 page
= ksm_might_need_to_copy(page
, vma
, address
);
3120 if (unlikely(!page
)) {
3126 if (mem_cgroup_try_charge_swapin(mm
, page
, GFP_KERNEL
, &ptr
)) {
3132 * Back out if somebody else already faulted in this pte.
3134 page_table
= pte_offset_map_lock(mm
, pmd
, address
, &ptl
);
3135 if (unlikely(!pte_same(*page_table
, orig_pte
)))
3138 if (unlikely(!PageUptodate(page
))) {
3139 ret
= VM_FAULT_SIGBUS
;
3144 * The page isn't present yet, go ahead with the fault.
3146 * Be careful about the sequence of operations here.
3147 * To get its accounting right, reuse_swap_page() must be called
3148 * while the page is counted on swap but not yet in mapcount i.e.
3149 * before page_add_anon_rmap() and swap_free(); try_to_free_swap()
3150 * must be called after the swap_free(), or it will never succeed.
3151 * Because delete_from_swap_page() may be called by reuse_swap_page(),
3152 * mem_cgroup_commit_charge_swapin() may not be able to find swp_entry
3153 * in page->private. In this case, a record in swap_cgroup is silently
3154 * discarded at swap_free().
3157 inc_mm_counter_fast(mm
, MM_ANONPAGES
);
3158 dec_mm_counter_fast(mm
, MM_SWAPENTS
);
3159 pte
= mk_pte(page
, vma
->vm_page_prot
);
3160 if ((flags
& FAULT_FLAG_WRITE
) && reuse_swap_page(page
)) {
3161 pte
= maybe_mkwrite(pte_mkdirty(pte
), vma
);
3162 flags
&= ~FAULT_FLAG_WRITE
;
3163 ret
|= VM_FAULT_WRITE
;
3166 flush_icache_page(vma
, page
);
3167 set_pte_at(mm
, address
, page_table
, pte
);
3168 if (page
== swapcache
)
3169 do_page_add_anon_rmap(page
, vma
, address
, exclusive
);
3170 else /* ksm created a completely new copy */
3171 page_add_new_anon_rmap(page
, vma
, address
);
3172 /* It's better to call commit-charge after rmap is established */
3173 mem_cgroup_commit_charge_swapin(page
, ptr
);
3176 if (vm_swap_full() || (vma
->vm_flags
& VM_LOCKED
) || PageMlocked(page
))
3177 try_to_free_swap(page
);
3179 if (page
!= swapcache
) {
3181 * Hold the lock to avoid the swap entry to be reused
3182 * until we take the PT lock for the pte_same() check
3183 * (to avoid false positives from pte_same). For
3184 * further safety release the lock after the swap_free
3185 * so that the swap count won't change under a
3186 * parallel locked swapcache.
3188 unlock_page(swapcache
);
3189 page_cache_release(swapcache
);
3192 if (flags
& FAULT_FLAG_WRITE
) {
3193 ret
|= do_wp_page(mm
, vma
, address
, page_table
, pmd
, ptl
, pte
);
3194 if (ret
& VM_FAULT_ERROR
)
3195 ret
&= VM_FAULT_ERROR
;
3199 /* No need to invalidate - it was non-present before */
3200 update_mmu_cache(vma
, address
, page_table
);
3202 pte_unmap_unlock(page_table
, ptl
);
3206 mem_cgroup_cancel_charge_swapin(ptr
);
3207 pte_unmap_unlock(page_table
, ptl
);
3211 page_cache_release(page
);
3212 if (page
!= swapcache
) {
3213 unlock_page(swapcache
);
3214 page_cache_release(swapcache
);
3220 * This is like a special single-page "expand_{down|up}wards()",
3221 * except we must first make sure that 'address{-|+}PAGE_SIZE'
3222 * doesn't hit another vma.
3224 static inline int check_stack_guard_page(struct vm_area_struct
*vma
, unsigned long address
)
3226 address
&= PAGE_MASK
;
3227 if ((vma
->vm_flags
& VM_GROWSDOWN
) && address
== vma
->vm_start
) {
3228 struct vm_area_struct
*prev
= vma
->vm_prev
;
3231 * Is there a mapping abutting this one below?
3233 * That's only ok if it's the same stack mapping
3234 * that has gotten split..
3236 if (prev
&& prev
->vm_end
== address
)
3237 return prev
->vm_flags
& VM_GROWSDOWN
? 0 : -ENOMEM
;
3239 return expand_downwards(vma
, address
- PAGE_SIZE
);
3241 if ((vma
->vm_flags
& VM_GROWSUP
) && address
+ PAGE_SIZE
== vma
->vm_end
) {
3242 struct vm_area_struct
*next
= vma
->vm_next
;
3244 /* As VM_GROWSDOWN but s/below/above/ */
3245 if (next
&& next
->vm_start
== address
+ PAGE_SIZE
)
3246 return next
->vm_flags
& VM_GROWSUP
? 0 : -ENOMEM
;
3248 return expand_upwards(vma
, address
+ PAGE_SIZE
);
3254 * We enter with non-exclusive mmap_sem (to exclude vma changes,
3255 * but allow concurrent faults), and pte mapped but not yet locked.
3256 * We return with mmap_sem still held, but pte unmapped and unlocked.
3258 static int do_anonymous_page(struct mm_struct
*mm
, struct vm_area_struct
*vma
,
3259 unsigned long address
, pte_t
*page_table
, pmd_t
*pmd
,
3266 pte_unmap(page_table
);
3268 /* File mapping without ->vm_ops ? */
3269 if (vma
->vm_flags
& VM_SHARED
)
3270 return VM_FAULT_SIGBUS
;
3272 /* Check if we need to add a guard page to the stack */
3273 if (check_stack_guard_page(vma
, address
) < 0)
3274 return VM_FAULT_SIGSEGV
;
3276 /* Use the zero-page for reads */
3277 if (!(flags
& FAULT_FLAG_WRITE
)) {
3278 entry
= pte_mkspecial(pfn_pte(my_zero_pfn(address
),
3279 vma
->vm_page_prot
));
3280 page_table
= pte_offset_map_lock(mm
, pmd
, address
, &ptl
);
3281 if (!pte_none(*page_table
))
3286 /* Allocate our own private page. */
3287 if (unlikely(anon_vma_prepare(vma
)))
3289 page
= alloc_zeroed_user_highpage_movable(vma
, address
);
3293 * The memory barrier inside __SetPageUptodate makes sure that
3294 * preceeding stores to the page contents become visible before
3295 * the set_pte_at() write.
3297 __SetPageUptodate(page
);
3299 if (mem_cgroup_newpage_charge(page
, mm
, GFP_KERNEL
))
3302 entry
= mk_pte(page
, vma
->vm_page_prot
);
3303 if (vma
->vm_flags
& VM_WRITE
)
3304 entry
= pte_mkwrite(pte_mkdirty(entry
));
3306 page_table
= pte_offset_map_lock(mm
, pmd
, address
, &ptl
);
3307 if (!pte_none(*page_table
))
3310 inc_mm_counter_fast(mm
, MM_ANONPAGES
);
3311 page_add_new_anon_rmap(page
, vma
, address
);
3313 set_pte_at(mm
, address
, page_table
, entry
);
3315 /* No need to invalidate - it was non-present before */
3316 update_mmu_cache(vma
, address
, page_table
);
3318 pte_unmap_unlock(page_table
, ptl
);
3321 mem_cgroup_uncharge_page(page
);
3322 page_cache_release(page
);
3325 page_cache_release(page
);
3327 return VM_FAULT_OOM
;
3331 * __do_fault() tries to create a new page mapping. It aggressively
3332 * tries to share with existing pages, but makes a separate copy if
3333 * the FAULT_FLAG_WRITE is set in the flags parameter in order to avoid
3334 * the next page fault.
3336 * As this is called only for pages that do not currently exist, we
3337 * do not need to flush old virtual caches or the TLB.
3339 * We enter with non-exclusive mmap_sem (to exclude vma changes,
3340 * but allow concurrent faults), and pte neither mapped nor locked.
3341 * We return with mmap_sem still held, but pte unmapped and unlocked.
3343 static int __do_fault(struct mm_struct
*mm
, struct vm_area_struct
*vma
,
3344 unsigned long address
, pmd_t
*pmd
,
3345 pgoff_t pgoff
, unsigned int flags
, pte_t orig_pte
)
3350 struct page
*cow_page
;
3353 struct page
*dirty_page
= NULL
;
3354 struct vm_fault vmf
;
3356 int page_mkwrite
= 0;
3359 * If we do COW later, allocate page befor taking lock_page()
3360 * on the file cache page. This will reduce lock holding time.
3362 if ((flags
& FAULT_FLAG_WRITE
) && !(vma
->vm_flags
& VM_SHARED
)) {
3364 if (unlikely(anon_vma_prepare(vma
)))
3365 return VM_FAULT_OOM
;
3367 cow_page
= alloc_page_vma(GFP_HIGHUSER_MOVABLE
, vma
, address
);
3369 return VM_FAULT_OOM
;
3371 if (mem_cgroup_newpage_charge(cow_page
, mm
, GFP_KERNEL
)) {
3372 page_cache_release(cow_page
);
3373 return VM_FAULT_OOM
;
3378 vmf
.virtual_address
= (void __user
*)(address
& PAGE_MASK
);
3383 ret
= vma
->vm_ops
->fault(vma
, &vmf
);
3384 if (unlikely(ret
& (VM_FAULT_ERROR
| VM_FAULT_NOPAGE
|
3388 if (unlikely(PageHWPoison(vmf
.page
))) {
3389 if (ret
& VM_FAULT_LOCKED
)
3390 unlock_page(vmf
.page
);
3391 ret
= VM_FAULT_HWPOISON
;
3396 * For consistency in subsequent calls, make the faulted page always
3399 if (unlikely(!(ret
& VM_FAULT_LOCKED
)))
3400 lock_page(vmf
.page
);
3402 VM_BUG_ON(!PageLocked(vmf
.page
));
3405 * Should we do an early C-O-W break?
3408 if (flags
& FAULT_FLAG_WRITE
) {
3409 if (!(vma
->vm_flags
& VM_SHARED
)) {
3412 copy_user_highpage(page
, vmf
.page
, address
, vma
);
3413 __SetPageUptodate(page
);
3416 * If the page will be shareable, see if the backing
3417 * address space wants to know that the page is about
3418 * to become writable
3420 if (vma
->vm_ops
->page_mkwrite
) {
3424 vmf
.flags
= FAULT_FLAG_WRITE
|FAULT_FLAG_MKWRITE
;
3425 tmp
= vma
->vm_ops
->page_mkwrite(vma
, &vmf
);
3427 (VM_FAULT_ERROR
| VM_FAULT_NOPAGE
))) {
3429 goto unwritable_page
;
3431 if (unlikely(!(tmp
& VM_FAULT_LOCKED
))) {
3433 if (!page
->mapping
) {
3434 ret
= 0; /* retry the fault */
3436 goto unwritable_page
;
3439 VM_BUG_ON(!PageLocked(page
));
3446 page_table
= pte_offset_map_lock(mm
, pmd
, address
, &ptl
);
3449 * This silly early PAGE_DIRTY setting removes a race
3450 * due to the bad i386 page protection. But it's valid
3451 * for other architectures too.
3453 * Note that if FAULT_FLAG_WRITE is set, we either now have
3454 * an exclusive copy of the page, or this is a shared mapping,
3455 * so we can make it writable and dirty to avoid having to
3456 * handle that later.
3458 /* Only go through if we didn't race with anybody else... */
3459 if (likely(pte_same(*page_table
, orig_pte
))) {
3460 flush_icache_page(vma
, page
);
3461 entry
= mk_pte(page
, vma
->vm_page_prot
);
3462 if (flags
& FAULT_FLAG_WRITE
)
3463 entry
= maybe_mkwrite(pte_mkdirty(entry
), vma
);
3465 inc_mm_counter_fast(mm
, MM_ANONPAGES
);
3466 page_add_new_anon_rmap(page
, vma
, address
);
3468 inc_mm_counter_fast(mm
, MM_FILEPAGES
);
3469 page_add_file_rmap(page
);
3470 if (flags
& FAULT_FLAG_WRITE
) {
3472 get_page(dirty_page
);
3475 set_pte_at(mm
, address
, page_table
, entry
);
3477 /* no need to invalidate: a not-present page won't be cached */
3478 update_mmu_cache(vma
, address
, page_table
);
3481 mem_cgroup_uncharge_page(cow_page
);
3483 page_cache_release(page
);
3485 anon
= 1; /* no anon but release faulted_page */
3488 pte_unmap_unlock(page_table
, ptl
);
3491 struct address_space
*mapping
= page
->mapping
;
3494 if (set_page_dirty(dirty_page
))
3496 unlock_page(dirty_page
);
3497 put_page(dirty_page
);
3498 if ((dirtied
|| page_mkwrite
) && mapping
) {
3500 * Some device drivers do not set page.mapping but still
3503 balance_dirty_pages_ratelimited(mapping
);
3506 /* file_update_time outside page_lock */
3507 if (vma
->vm_file
&& !page_mkwrite
)
3508 file_update_time(vma
->vm_file
);
3510 unlock_page(vmf
.page
);
3512 page_cache_release(vmf
.page
);
3518 page_cache_release(page
);
3521 /* fs's fault handler get error */
3523 mem_cgroup_uncharge_page(cow_page
);
3524 page_cache_release(cow_page
);
3529 static int do_linear_fault(struct mm_struct
*mm
, struct vm_area_struct
*vma
,
3530 unsigned long address
, pte_t
*page_table
, pmd_t
*pmd
,
3531 unsigned int flags
, pte_t orig_pte
)
3533 pgoff_t pgoff
= (((address
& PAGE_MASK
)
3534 - vma
->vm_start
) >> PAGE_SHIFT
) + vma
->vm_pgoff
;
3536 /* The VMA was not fully populated on mmap() or missing VM_DONTEXPAND */
3537 if (!vma
->vm_ops
->fault
)
3538 return VM_FAULT_SIGBUS
;
3540 pte_unmap(page_table
);
3541 /* The VMA was not fully populated on mmap() or missing VM_DONTEXPAND */
3542 if (!vma
->vm_ops
->fault
)
3543 return VM_FAULT_SIGBUS
;
3544 return __do_fault(mm
, vma
, address
, pmd
, pgoff
, flags
, orig_pte
);
3548 * Fault of a previously existing named mapping. Repopulate the pte
3549 * from the encoded file_pte if possible. This enables swappable
3552 * We enter with non-exclusive mmap_sem (to exclude vma changes,
3553 * but allow concurrent faults), and pte mapped but not yet locked.
3554 * We return with mmap_sem still held, but pte unmapped and unlocked.
3556 static int do_nonlinear_fault(struct mm_struct
*mm
, struct vm_area_struct
*vma
,
3557 unsigned long address
, pte_t
*page_table
, pmd_t
*pmd
,
3558 unsigned int flags
, pte_t orig_pte
)
3562 flags
|= FAULT_FLAG_NONLINEAR
;
3564 if (!pte_unmap_same(mm
, pmd
, page_table
, orig_pte
))
3567 if (unlikely(!(vma
->vm_flags
& VM_NONLINEAR
))) {
3569 * Page table corrupted: show pte and kill process.
3571 print_bad_pte(vma
, address
, orig_pte
, NULL
);
3572 return VM_FAULT_SIGBUS
;
3575 pgoff
= pte_to_pgoff(orig_pte
);
3576 return __do_fault(mm
, vma
, address
, pmd
, pgoff
, flags
, orig_pte
);
3579 int numa_migrate_prep(struct page
*page
, struct vm_area_struct
*vma
,
3580 unsigned long addr
, int page_nid
)
3584 count_vm_numa_event(NUMA_HINT_FAULTS
);
3585 if (page_nid
== numa_node_id())
3586 count_vm_numa_event(NUMA_HINT_FAULTS_LOCAL
);
3588 return mpol_misplaced(page
, vma
, addr
);
3591 int do_numa_page(struct mm_struct
*mm
, struct vm_area_struct
*vma
,
3592 unsigned long addr
, pte_t pte
, pte_t
*ptep
, pmd_t
*pmd
)
3594 struct page
*page
= NULL
;
3598 bool migrated
= false;
3601 * The "pte" at this point cannot be used safely without
3602 * validation through pte_unmap_same(). It's of NUMA type but
3603 * the pfn may be screwed if the read is non atomic.
3605 * ptep_modify_prot_start is not called as this is clearing
3606 * the _PAGE_NUMA bit and it is not really expected that there
3607 * would be concurrent hardware modifications to the PTE.
3609 ptl
= pte_lockptr(mm
, pmd
);
3611 if (unlikely(!pte_same(*ptep
, pte
))) {
3612 pte_unmap_unlock(ptep
, ptl
);
3616 pte
= pte_mknonnuma(pte
);
3617 set_pte_at(mm
, addr
, ptep
, pte
);
3618 update_mmu_cache(vma
, addr
, ptep
);
3620 page
= vm_normal_page(vma
, addr
, pte
);
3622 pte_unmap_unlock(ptep
, ptl
);
3626 page_nid
= page_to_nid(page
);
3627 target_nid
= numa_migrate_prep(page
, vma
, addr
, page_nid
);
3628 pte_unmap_unlock(ptep
, ptl
);
3629 if (target_nid
== -1) {
3634 /* Migrate to the requested node */
3635 migrated
= migrate_misplaced_page(page
, target_nid
);
3637 page_nid
= target_nid
;
3641 task_numa_fault(page_nid
, 1, migrated
);
3645 /* NUMA hinting page fault entry point for regular pmds */
3646 #ifdef CONFIG_NUMA_BALANCING
3647 static int do_pmd_numa_page(struct mm_struct
*mm
, struct vm_area_struct
*vma
,
3648 unsigned long addr
, pmd_t
*pmdp
)
3651 pte_t
*pte
, *orig_pte
;
3652 unsigned long _addr
= addr
& PMD_MASK
;
3653 unsigned long offset
;
3657 spin_lock(&mm
->page_table_lock
);
3659 if (pmd_numa(pmd
)) {
3660 set_pmd_at(mm
, _addr
, pmdp
, pmd_mknonnuma(pmd
));
3663 spin_unlock(&mm
->page_table_lock
);
3668 /* we're in a page fault so some vma must be in the range */
3670 BUG_ON(vma
->vm_start
>= _addr
+ PMD_SIZE
);
3671 offset
= max(_addr
, vma
->vm_start
) & ~PMD_MASK
;
3672 VM_BUG_ON(offset
>= PMD_SIZE
);
3673 orig_pte
= pte
= pte_offset_map_lock(mm
, pmdp
, _addr
, &ptl
);
3674 pte
+= offset
>> PAGE_SHIFT
;
3675 for (addr
= _addr
+ offset
; addr
< _addr
+ PMD_SIZE
; pte
++, addr
+= PAGE_SIZE
) {
3676 pte_t pteval
= *pte
;
3680 bool migrated
= false;
3682 if (!pte_present(pteval
))
3684 if (!pte_numa(pteval
))
3686 if (addr
>= vma
->vm_end
) {
3687 vma
= find_vma(mm
, addr
);
3688 /* there's a pte present so there must be a vma */
3690 BUG_ON(addr
< vma
->vm_start
);
3692 if (pte_numa(pteval
)) {
3693 pteval
= pte_mknonnuma(pteval
);
3694 set_pte_at(mm
, addr
, pte
, pteval
);
3696 page
= vm_normal_page(vma
, addr
, pteval
);
3697 if (unlikely(!page
))
3699 /* only check non-shared pages */
3700 if (unlikely(page_mapcount(page
) != 1))
3703 page_nid
= page_to_nid(page
);
3704 target_nid
= numa_migrate_prep(page
, vma
, addr
, page_nid
);
3705 pte_unmap_unlock(pte
, ptl
);
3706 if (target_nid
!= -1) {
3707 migrated
= migrate_misplaced_page(page
, target_nid
);
3709 page_nid
= target_nid
;
3715 task_numa_fault(page_nid
, 1, migrated
);
3717 pte
= pte_offset_map_lock(mm
, pmdp
, addr
, &ptl
);
3719 pte_unmap_unlock(orig_pte
, ptl
);
3724 static int do_pmd_numa_page(struct mm_struct
*mm
, struct vm_area_struct
*vma
,
3725 unsigned long addr
, pmd_t
*pmdp
)
3730 #endif /* CONFIG_NUMA_BALANCING */
3733 * These routines also need to handle stuff like marking pages dirty
3734 * and/or accessed for architectures that don't do it in hardware (most
3735 * RISC architectures). The early dirtying is also good on the i386.
3737 * There is also a hook called "update_mmu_cache()" that architectures
3738 * with external mmu caches can use to update those (ie the Sparc or
3739 * PowerPC hashed page tables that act as extended TLBs).
3741 * We enter with non-exclusive mmap_sem (to exclude vma changes,
3742 * but allow concurrent faults), and pte mapped but not yet locked.
3743 * We return with mmap_sem still held, but pte unmapped and unlocked.
3745 int handle_pte_fault(struct mm_struct
*mm
,
3746 struct vm_area_struct
*vma
, unsigned long address
,
3747 pte_t
*pte
, pmd_t
*pmd
, unsigned int flags
)
3753 if (!pte_present(entry
)) {
3754 if (pte_none(entry
)) {
3756 return do_linear_fault(mm
, vma
, address
,
3757 pte
, pmd
, flags
, entry
);
3758 return do_anonymous_page(mm
, vma
, address
,
3761 if (pte_file(entry
))
3762 return do_nonlinear_fault(mm
, vma
, address
,
3763 pte
, pmd
, flags
, entry
);
3764 return do_swap_page(mm
, vma
, address
,
3765 pte
, pmd
, flags
, entry
);
3768 if (pte_numa(entry
))
3769 return do_numa_page(mm
, vma
, address
, entry
, pte
, pmd
);
3771 ptl
= pte_lockptr(mm
, pmd
);
3773 if (unlikely(!pte_same(*pte
, entry
)))
3775 if (flags
& FAULT_FLAG_WRITE
) {
3776 if (!pte_write(entry
))
3777 return do_wp_page(mm
, vma
, address
,
3778 pte
, pmd
, ptl
, entry
);
3779 entry
= pte_mkdirty(entry
);
3781 entry
= pte_mkyoung(entry
);
3782 if (ptep_set_access_flags(vma
, address
, pte
, entry
, flags
& FAULT_FLAG_WRITE
)) {
3783 update_mmu_cache(vma
, address
, pte
);
3786 * This is needed only for protection faults but the arch code
3787 * is not yet telling us if this is a protection fault or not.
3788 * This still avoids useless tlb flushes for .text page faults
3791 if (flags
& FAULT_FLAG_WRITE
)
3792 flush_tlb_fix_spurious_fault(vma
, address
);
3795 pte_unmap_unlock(pte
, ptl
);
3800 * By the time we get here, we already hold the mm semaphore
3802 static int __handle_mm_fault(struct mm_struct
*mm
, struct vm_area_struct
*vma
,
3803 unsigned long address
, unsigned int flags
)
3810 if (unlikely(is_vm_hugetlb_page(vma
)))
3811 return hugetlb_fault(mm
, vma
, address
, flags
);
3814 pgd
= pgd_offset(mm
, address
);
3815 pud
= pud_alloc(mm
, pgd
, address
);
3817 return VM_FAULT_OOM
;
3818 pmd
= pmd_alloc(mm
, pud
, address
);
3820 return VM_FAULT_OOM
;
3821 if (pmd_none(*pmd
) && transparent_hugepage_enabled(vma
)) {
3823 return do_huge_pmd_anonymous_page(mm
, vma
, address
,
3826 pmd_t orig_pmd
= *pmd
;
3830 if (pmd_trans_huge(orig_pmd
)) {
3831 unsigned int dirty
= flags
& FAULT_FLAG_WRITE
;
3834 * If the pmd is splitting, return and retry the
3835 * the fault. Alternative: wait until the split
3836 * is done, and goto retry.
3838 if (pmd_trans_splitting(orig_pmd
))
3841 if (pmd_numa(orig_pmd
))
3842 return do_huge_pmd_numa_page(mm
, vma
, address
,
3845 if (dirty
&& !pmd_write(orig_pmd
)) {
3846 ret
= do_huge_pmd_wp_page(mm
, vma
, address
, pmd
,
3849 * If COW results in an oom, the huge pmd will
3850 * have been split, so retry the fault on the
3851 * pte for a smaller charge.
3853 if (unlikely(ret
& VM_FAULT_OOM
))
3857 huge_pmd_set_accessed(mm
, vma
, address
, pmd
,
3866 return do_pmd_numa_page(mm
, vma
, address
, pmd
);
3869 * Use __pte_alloc instead of pte_alloc_map, because we can't
3870 * run pte_offset_map on the pmd, if an huge pmd could
3871 * materialize from under us from a different thread.
3873 if (unlikely(pmd_none(*pmd
)) &&
3874 unlikely(__pte_alloc(mm
, vma
, pmd
, address
)))
3875 return VM_FAULT_OOM
;
3876 /* if an huge pmd materialized from under us just retry later */
3877 if (unlikely(pmd_trans_huge(*pmd
)))
3880 * A regular pmd is established and it can't morph into a huge pmd
3881 * from under us anymore at this point because we hold the mmap_sem
3882 * read mode and khugepaged takes it in write mode. So now it's
3883 * safe to run pte_offset_map().
3885 pte
= pte_offset_map(pmd
, address
);
3887 return handle_pte_fault(mm
, vma
, address
, pte
, pmd
, flags
);
3890 int handle_mm_fault(struct mm_struct
*mm
, struct vm_area_struct
*vma
,
3891 unsigned long address
, unsigned int flags
)
3895 __set_current_state(TASK_RUNNING
);
3897 count_vm_event(PGFAULT
);
3898 mem_cgroup_count_vm_event(mm
, PGFAULT
);
3900 /* do counter updates before entering really critical section. */
3901 check_sync_rss_stat(current
);
3904 * Enable the memcg OOM handling for faults triggered in user
3905 * space. Kernel faults are handled more gracefully.
3907 if (flags
& FAULT_FLAG_USER
)
3908 mem_cgroup_oom_enable();
3910 ret
= __handle_mm_fault(mm
, vma
, address
, flags
);
3912 if (flags
& FAULT_FLAG_USER
) {
3913 mem_cgroup_oom_disable();
3915 * The task may have entered a memcg OOM situation but
3916 * if the allocation error was handled gracefully (no
3917 * VM_FAULT_OOM), there is no need to kill anything.
3918 * Just clean up the OOM state peacefully.
3920 if (task_in_memcg_oom(current
) && !(ret
& VM_FAULT_OOM
))
3921 mem_cgroup_oom_synchronize(false);
3927 #ifndef __PAGETABLE_PUD_FOLDED
3929 * Allocate page upper directory.
3930 * We've already handled the fast-path in-line.
3932 int __pud_alloc(struct mm_struct
*mm
, pgd_t
*pgd
, unsigned long address
)
3934 pud_t
*new = pud_alloc_one(mm
, address
);
3938 smp_wmb(); /* See comment in __pte_alloc */
3940 spin_lock(&mm
->page_table_lock
);
3941 if (pgd_present(*pgd
)) /* Another has populated it */
3944 pgd_populate(mm
, pgd
, new);
3945 spin_unlock(&mm
->page_table_lock
);
3948 #endif /* __PAGETABLE_PUD_FOLDED */
3950 #ifndef __PAGETABLE_PMD_FOLDED
3952 * Allocate page middle directory.
3953 * We've already handled the fast-path in-line.
3955 int __pmd_alloc(struct mm_struct
*mm
, pud_t
*pud
, unsigned long address
)
3957 pmd_t
*new = pmd_alloc_one(mm
, address
);
3961 smp_wmb(); /* See comment in __pte_alloc */
3963 spin_lock(&mm
->page_table_lock
);
3964 #ifndef __ARCH_HAS_4LEVEL_HACK
3965 if (pud_present(*pud
)) /* Another has populated it */
3968 pud_populate(mm
, pud
, new);
3970 if (pgd_present(*pud
)) /* Another has populated it */
3973 pgd_populate(mm
, pud
, new);
3974 #endif /* __ARCH_HAS_4LEVEL_HACK */
3975 spin_unlock(&mm
->page_table_lock
);
3978 #endif /* __PAGETABLE_PMD_FOLDED */
3980 #if !defined(__HAVE_ARCH_GATE_AREA)
3982 #if defined(AT_SYSINFO_EHDR)
3983 static struct vm_area_struct gate_vma
;
3985 static int __init
gate_vma_init(void)
3987 gate_vma
.vm_mm
= NULL
;
3988 gate_vma
.vm_start
= FIXADDR_USER_START
;
3989 gate_vma
.vm_end
= FIXADDR_USER_END
;
3990 gate_vma
.vm_flags
= VM_READ
| VM_MAYREAD
| VM_EXEC
| VM_MAYEXEC
;
3991 gate_vma
.vm_page_prot
= __P101
;
3995 __initcall(gate_vma_init
);
3998 struct vm_area_struct
*get_gate_vma(struct mm_struct
*mm
)
4000 #ifdef AT_SYSINFO_EHDR
4007 int in_gate_area_no_mm(unsigned long addr
)
4009 #ifdef AT_SYSINFO_EHDR
4010 if ((addr
>= FIXADDR_USER_START
) && (addr
< FIXADDR_USER_END
))
4016 #endif /* __HAVE_ARCH_GATE_AREA */
4018 static int __follow_pte(struct mm_struct
*mm
, unsigned long address
,
4019 pte_t
**ptepp
, spinlock_t
**ptlp
)
4026 pgd
= pgd_offset(mm
, address
);
4027 if (pgd_none(*pgd
) || unlikely(pgd_bad(*pgd
)))
4030 pud
= pud_offset(pgd
, address
);
4031 if (pud_none(*pud
) || unlikely(pud_bad(*pud
)))
4034 pmd
= pmd_offset(pud
, address
);
4035 VM_BUG_ON(pmd_trans_huge(*pmd
));
4036 if (pmd_none(*pmd
) || unlikely(pmd_bad(*pmd
)))
4039 /* We cannot handle huge page PFN maps. Luckily they don't exist. */
4043 ptep
= pte_offset_map_lock(mm
, pmd
, address
, ptlp
);
4046 if (!pte_present(*ptep
))
4051 pte_unmap_unlock(ptep
, *ptlp
);
4056 static inline int follow_pte(struct mm_struct
*mm
, unsigned long address
,
4057 pte_t
**ptepp
, spinlock_t
**ptlp
)
4061 /* (void) is needed to make gcc happy */
4062 (void) __cond_lock(*ptlp
,
4063 !(res
= __follow_pte(mm
, address
, ptepp
, ptlp
)));
4068 * follow_pfn - look up PFN at a user virtual address
4069 * @vma: memory mapping
4070 * @address: user virtual address
4071 * @pfn: location to store found PFN
4073 * Only IO mappings and raw PFN mappings are allowed.
4075 * Returns zero and the pfn at @pfn on success, -ve otherwise.
4077 int follow_pfn(struct vm_area_struct
*vma
, unsigned long address
,
4084 if (!(vma
->vm_flags
& (VM_IO
| VM_PFNMAP
)))
4087 ret
= follow_pte(vma
->vm_mm
, address
, &ptep
, &ptl
);
4090 *pfn
= pte_pfn(*ptep
);
4091 pte_unmap_unlock(ptep
, ptl
);
4094 EXPORT_SYMBOL(follow_pfn
);
4096 #ifdef CONFIG_HAVE_IOREMAP_PROT
4097 int follow_phys(struct vm_area_struct
*vma
,
4098 unsigned long address
, unsigned int flags
,
4099 unsigned long *prot
, resource_size_t
*phys
)
4105 if (!(vma
->vm_flags
& (VM_IO
| VM_PFNMAP
)))
4108 if (follow_pte(vma
->vm_mm
, address
, &ptep
, &ptl
))
4112 if ((flags
& FOLL_WRITE
) && !pte_write(pte
))
4115 *prot
= pgprot_val(pte_pgprot(pte
));
4116 *phys
= (resource_size_t
)pte_pfn(pte
) << PAGE_SHIFT
;
4120 pte_unmap_unlock(ptep
, ptl
);
4125 int generic_access_phys(struct vm_area_struct
*vma
, unsigned long addr
,
4126 void *buf
, int len
, int write
)
4128 resource_size_t phys_addr
;
4129 unsigned long prot
= 0;
4130 void __iomem
*maddr
;
4131 int offset
= addr
& (PAGE_SIZE
-1);
4133 if (follow_phys(vma
, addr
, write
, &prot
, &phys_addr
))
4136 maddr
= ioremap_prot(phys_addr
, PAGE_ALIGN(len
+ offset
), prot
);
4138 memcpy_toio(maddr
+ offset
, buf
, len
);
4140 memcpy_fromio(buf
, maddr
+ offset
, len
);
4145 EXPORT_SYMBOL_GPL(generic_access_phys
);
4149 * Access another process' address space as given in mm. If non-NULL, use the
4150 * given task for page fault accounting.
4152 static int __access_remote_vm(struct task_struct
*tsk
, struct mm_struct
*mm
,
4153 unsigned long addr
, void *buf
, int len
, int write
)
4155 struct vm_area_struct
*vma
;
4156 void *old_buf
= buf
;
4158 down_read(&mm
->mmap_sem
);
4159 /* ignore errors, just check how much was successfully transferred */
4161 int bytes
, ret
, offset
;
4163 struct page
*page
= NULL
;
4165 ret
= get_user_pages(tsk
, mm
, addr
, 1,
4166 write
, 1, &page
, &vma
);
4168 #ifdef CONFIG_MTK_EXTMEM
4170 vma
= find_vma(mm
, addr
);
4171 if (!vma
|| vma
->vm_start
> addr
)
4173 if (vma
->vm_end
< addr
+ len
)
4174 len
= vma
->vm_end
- addr
;
4175 if (extmem_in_mspace(vma
)) {
4176 void *extmem_va
= (void *)get_virt_from_mspace(vma
->vm_pgoff
<< PAGE_SHIFT
) + (addr
- vma
->vm_start
);
4177 memcpy(buf
, extmem_va
, len
);
4184 * Check if this is a VM_IO | VM_PFNMAP VMA, which
4185 * we can access using slightly different code.
4187 #ifdef CONFIG_HAVE_IOREMAP_PROT
4188 vma
= find_vma(mm
, addr
);
4189 if (!vma
|| vma
->vm_start
> addr
)
4191 if (vma
->vm_ops
&& vma
->vm_ops
->access
)
4192 ret
= vma
->vm_ops
->access(vma
, addr
, buf
,
4200 offset
= addr
& (PAGE_SIZE
-1);
4201 if (bytes
> PAGE_SIZE
-offset
)
4202 bytes
= PAGE_SIZE
-offset
;
4206 copy_to_user_page(vma
, page
, addr
,
4207 maddr
+ offset
, buf
, bytes
);
4208 set_page_dirty_lock(page
);
4210 copy_from_user_page(vma
, page
, addr
,
4211 buf
, maddr
+ offset
, bytes
);
4214 page_cache_release(page
);
4220 up_read(&mm
->mmap_sem
);
4222 return buf
- old_buf
;
4226 * access_remote_vm - access another process' address space
4227 * @mm: the mm_struct of the target address space
4228 * @addr: start address to access
4229 * @buf: source or destination buffer
4230 * @len: number of bytes to transfer
4231 * @write: whether the access is a write
4233 * The caller must hold a reference on @mm.
4235 int access_remote_vm(struct mm_struct
*mm
, unsigned long addr
,
4236 void *buf
, int len
, int write
)
4238 return __access_remote_vm(NULL
, mm
, addr
, buf
, len
, write
);
4242 * Access another process' address space.
4243 * Source/target buffer must be kernel space,
4244 * Do not walk the page table directly, use get_user_pages
4246 int access_process_vm(struct task_struct
*tsk
, unsigned long addr
,
4247 void *buf
, int len
, int write
)
4249 struct mm_struct
*mm
;
4252 mm
= get_task_mm(tsk
);
4256 ret
= __access_remote_vm(tsk
, mm
, addr
, buf
, len
, write
);
4263 * Print the name of a VMA.
4265 void print_vma_addr(char *prefix
, unsigned long ip
)
4267 struct mm_struct
*mm
= current
->mm
;
4268 struct vm_area_struct
*vma
;
4271 * Do not print if we are in atomic
4272 * contexts (in exception stacks, etc.):
4274 if (preempt_count())
4277 down_read(&mm
->mmap_sem
);
4278 vma
= find_vma(mm
, ip
);
4279 if (vma
&& vma
->vm_file
) {
4280 struct file
*f
= vma
->vm_file
;
4281 char *buf
= (char *)__get_free_page(GFP_KERNEL
);
4285 p
= d_path(&f
->f_path
, buf
, PAGE_SIZE
);
4288 printk("%s%s[%lx+%lx]", prefix
, kbasename(p
),
4290 vma
->vm_end
- vma
->vm_start
);
4291 free_page((unsigned long)buf
);
4294 up_read(&mm
->mmap_sem
);
4297 #ifdef CONFIG_PROVE_LOCKING
4298 void might_fault(void)
4301 * Some code (nfs/sunrpc) uses socket ops on kernel memory while
4302 * holding the mmap_sem, this is safe because kernel memory doesn't
4303 * get paged out, therefore we'll never actually fault, and the
4304 * below annotations will generate false positives.
4306 if (segment_eq(get_fs(), KERNEL_DS
))
4311 * it would be nicer only to annotate paths which are not under
4312 * pagefault_disable, however that requires a larger audit and
4313 * providing helpers like get_user_atomic.
4315 if (!in_atomic() && current
->mm
)
4316 might_lock_read(¤t
->mm
->mmap_sem
);
4318 EXPORT_SYMBOL(might_fault
);
4321 #if defined(CONFIG_TRANSPARENT_HUGEPAGE) || defined(CONFIG_HUGETLBFS)
4322 static void clear_gigantic_page(struct page
*page
,
4324 unsigned int pages_per_huge_page
)
4327 struct page
*p
= page
;
4330 for (i
= 0; i
< pages_per_huge_page
;
4331 i
++, p
= mem_map_next(p
, page
, i
)) {
4333 clear_user_highpage(p
, addr
+ i
* PAGE_SIZE
);
4336 void clear_huge_page(struct page
*page
,
4337 unsigned long addr
, unsigned int pages_per_huge_page
)
4341 if (unlikely(pages_per_huge_page
> MAX_ORDER_NR_PAGES
)) {
4342 clear_gigantic_page(page
, addr
, pages_per_huge_page
);
4347 for (i
= 0; i
< pages_per_huge_page
; i
++) {
4349 clear_user_highpage(page
+ i
, addr
+ i
* PAGE_SIZE
);
4353 static void copy_user_gigantic_page(struct page
*dst
, struct page
*src
,
4355 struct vm_area_struct
*vma
,
4356 unsigned int pages_per_huge_page
)
4359 struct page
*dst_base
= dst
;
4360 struct page
*src_base
= src
;
4362 for (i
= 0; i
< pages_per_huge_page
; ) {
4364 copy_user_highpage(dst
, src
, addr
+ i
*PAGE_SIZE
, vma
);
4367 dst
= mem_map_next(dst
, dst_base
, i
);
4368 src
= mem_map_next(src
, src_base
, i
);
4372 void copy_user_huge_page(struct page
*dst
, struct page
*src
,
4373 unsigned long addr
, struct vm_area_struct
*vma
,
4374 unsigned int pages_per_huge_page
)
4378 if (unlikely(pages_per_huge_page
> MAX_ORDER_NR_PAGES
)) {
4379 copy_user_gigantic_page(dst
, src
, addr
, vma
,
4380 pages_per_huge_page
);
4385 for (i
= 0; i
< pages_per_huge_page
; i
++) {
4387 copy_user_highpage(dst
+ i
, src
+ i
, addr
+ i
*PAGE_SIZE
, vma
);
4390 #endif /* CONFIG_TRANSPARENT_HUGEPAGE || CONFIG_HUGETLBFS */