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/delay.h>
53 #include <linux/init.h>
54 #include <linux/writeback.h>
55 #include <linux/memcontrol.h>
56 #include <linux/mmu_notifier.h>
57 #include <linux/kallsyms.h>
58 #include <linux/swapops.h>
59 #include <linux/elf.h>
60 #include <linux/gfp.h>
61 #include <linux/migrate.h>
62 #include <linux/string.h>
65 #include <asm/pgalloc.h>
66 #include <asm/uaccess.h>
68 #include <asm/tlbflush.h>
69 #include <asm/pgtable.h>
73 #ifdef LAST_NID_NOT_IN_PAGE_FLAGS
74 #warning Unfortunate NUMA and NUMA Balancing config, growing page-frame for last_nid.
77 #ifndef CONFIG_NEED_MULTIPLE_NODES
78 /* use the per-pgdat data instead for discontigmem - mbligh */
79 unsigned long max_mapnr;
82 EXPORT_SYMBOL(max_mapnr);
83 EXPORT_SYMBOL(mem_map);
86 unsigned long num_physpages;
88 * A number of key systems in x86 including ioremap() rely on the assumption
89 * that high_memory defines the upper bound on direct map memory, then end
90 * of ZONE_NORMAL. Under CONFIG_DISCONTIG this means that max_low_pfn and
91 * highstart_pfn must be the same; there must be no gap between ZONE_NORMAL
96 EXPORT_SYMBOL(num_physpages);
97 EXPORT_SYMBOL(high_memory);
100 * Randomize the address space (stacks, mmaps, brk, etc.).
102 * ( When CONFIG_COMPAT_BRK=y we exclude brk from randomization,
103 * as ancient (libc5 based) binaries can segfault. )
105 int randomize_va_space __read_mostly =
106 #ifdef CONFIG_COMPAT_BRK
112 static int __init disable_randmaps(char *s)
114 randomize_va_space = 0;
117 __setup("norandmaps", disable_randmaps);
119 unsigned long zero_pfn __read_mostly;
120 unsigned long highest_memmap_pfn __read_mostly;
122 EXPORT_SYMBOL(zero_pfn);
125 * CONFIG_MMU architectures set up ZERO_PAGE in their paging_init()
127 static int __init init_zero_pfn(void)
129 zero_pfn = page_to_pfn(ZERO_PAGE(0));
132 core_initcall(init_zero_pfn);
135 #if defined(SPLIT_RSS_COUNTING)
137 void sync_mm_rss(struct mm_struct *mm)
141 for (i = 0; i < NR_MM_COUNTERS; i++) {
142 if (current->rss_stat.count[i]) {
143 add_mm_counter(mm, i, current->rss_stat.count[i]);
144 current->rss_stat.count[i] = 0;
147 current->rss_stat.events = 0;
150 static void add_mm_counter_fast(struct mm_struct *mm, int member, int val)
152 struct task_struct *task = current;
154 if (likely(task->mm == mm))
155 task->rss_stat.count[member] += val;
157 add_mm_counter(mm, member, val);
159 #define inc_mm_counter_fast(mm, member) add_mm_counter_fast(mm, member, 1)
160 #define dec_mm_counter_fast(mm, member) add_mm_counter_fast(mm, member, -1)
162 /* sync counter once per 64 page faults */
163 #define TASK_RSS_EVENTS_THRESH (64)
164 static void check_sync_rss_stat(struct task_struct *task)
166 if (unlikely(task != current))
168 if (unlikely(task->rss_stat.events++ > TASK_RSS_EVENTS_THRESH))
169 sync_mm_rss(task->mm);
171 #else /* SPLIT_RSS_COUNTING */
173 #define inc_mm_counter_fast(mm, member) inc_mm_counter(mm, member)
174 #define dec_mm_counter_fast(mm, member) dec_mm_counter(mm, member)
176 static void check_sync_rss_stat(struct task_struct *task)
180 #endif /* SPLIT_RSS_COUNTING */
182 #ifdef HAVE_GENERIC_MMU_GATHER
184 static int tlb_next_batch(struct mmu_gather *tlb)
186 struct mmu_gather_batch *batch;
190 tlb->active = batch->next;
194 if (tlb->batch_count == MAX_GATHER_BATCH_COUNT)
197 #ifndef CONFIG_SPRD_PAGERECORDER
198 batch = (void *)__get_free_pages(GFP_NOWAIT | __GFP_NOWARN, 0);
200 batch = (void *)__get_free_pages_nopagedebug(GFP_NOWAIT | __GFP_NOWARN, 0);
208 batch->max = MAX_GATHER_BATCH;
210 tlb->active->next = batch;
217 * Called to initialize an (on-stack) mmu_gather structure for page-table
218 * tear-down from @mm. The @fullmm argument is used when @mm is without
219 * users and we're going to destroy the full address space (exit/execve).
221 void tlb_gather_mmu(struct mmu_gather *tlb, struct mm_struct *mm, unsigned long start, unsigned long end)
225 /* Is it from 0 to ~0? */
226 tlb->fullmm = !(start | (end+1));
227 tlb->need_flush_all = 0;
231 tlb->local.next = NULL;
233 tlb->local.max = ARRAY_SIZE(tlb->__pages);
234 tlb->active = &tlb->local;
235 tlb->batch_count = 0;
237 #ifdef CONFIG_HAVE_RCU_TABLE_FREE
242 void tlb_flush_mmu(struct mmu_gather *tlb)
244 struct mmu_gather_batch *batch;
246 if (!tlb->need_flush)
250 #ifdef CONFIG_HAVE_RCU_TABLE_FREE
251 tlb_table_flush(tlb);
254 for (batch = &tlb->local; batch; batch = batch->next) {
255 free_pages_and_swap_cache(batch->pages, batch->nr);
258 tlb->active = &tlb->local;
262 * Called at the end of the shootdown operation to free up any resources
263 * that were required.
265 void tlb_finish_mmu(struct mmu_gather *tlb, unsigned long start, unsigned long end)
267 struct mmu_gather_batch *batch, *next;
271 /* keep the page table cache within bounds */
274 for (batch = tlb->local.next; batch; batch = next) {
276 free_pages((unsigned long)batch, 0);
278 tlb->local.next = NULL;
282 * Must perform the equivalent to __free_pte(pte_get_and_clear(ptep)), while
283 * handling the additional races in SMP caused by other CPUs caching valid
284 * mappings in their TLBs. Returns the number of free page slots left.
285 * When out of page slots we must call tlb_flush_mmu().
287 int __tlb_remove_page(struct mmu_gather *tlb, struct page *page)
289 struct mmu_gather_batch *batch;
291 VM_BUG_ON(!tlb->need_flush);
294 batch->pages[batch->nr++] = page;
295 if (batch->nr == batch->max) {
296 if (!tlb_next_batch(tlb))
300 VM_BUG_ON(batch->nr > batch->max);
302 return batch->max - batch->nr;
305 #endif /* HAVE_GENERIC_MMU_GATHER */
307 #ifdef CONFIG_HAVE_RCU_TABLE_FREE
310 * See the comment near struct mmu_table_batch.
313 static void tlb_remove_table_smp_sync(void *arg)
315 /* Simply deliver the interrupt */
318 static void tlb_remove_table_one(void *table)
321 * This isn't an RCU grace period and hence the page-tables cannot be
322 * assumed to be actually RCU-freed.
324 * It is however sufficient for software page-table walkers that rely on
325 * IRQ disabling. See the comment near struct mmu_table_batch.
327 smp_call_function(tlb_remove_table_smp_sync, NULL, 1);
328 __tlb_remove_table(table);
331 static void tlb_remove_table_rcu(struct rcu_head *head)
333 struct mmu_table_batch *batch;
336 batch = container_of(head, struct mmu_table_batch, rcu);
338 for (i = 0; i < batch->nr; i++)
339 __tlb_remove_table(batch->tables[i]);
341 free_page((unsigned long)batch);
344 void tlb_table_flush(struct mmu_gather *tlb)
346 struct mmu_table_batch **batch = &tlb->batch;
349 call_rcu_sched(&(*batch)->rcu, tlb_remove_table_rcu);
354 void tlb_remove_table(struct mmu_gather *tlb, void *table)
356 struct mmu_table_batch **batch = &tlb->batch;
361 * When there's less then two users of this mm there cannot be a
362 * concurrent page-table walk.
364 if (atomic_read(&tlb->mm->mm_users) < 2) {
365 __tlb_remove_table(table);
369 if (*batch == NULL) {
370 *batch = (struct mmu_table_batch *)__get_free_page(GFP_NOWAIT | __GFP_NOWARN);
371 if (*batch == NULL) {
372 tlb_remove_table_one(table);
377 (*batch)->tables[(*batch)->nr++] = table;
378 if ((*batch)->nr == MAX_TABLE_BATCH)
379 tlb_table_flush(tlb);
382 #endif /* CONFIG_HAVE_RCU_TABLE_FREE */
385 * If a p?d_bad entry is found while walking page tables, report
386 * the error, before resetting entry to p?d_none. Usually (but
387 * very seldom) called out from the p?d_none_or_clear_bad macros.
390 void pgd_clear_bad(pgd_t *pgd)
396 void pud_clear_bad(pud_t *pud)
402 void pmd_clear_bad(pmd_t *pmd)
409 * Note: this doesn't free the actual pages themselves. That
410 * has been handled earlier when unmapping all the memory regions.
412 static void free_pte_range(struct mmu_gather *tlb, pmd_t *pmd,
415 pgtable_t token = pmd_pgtable(*pmd);
417 pte_free_tlb(tlb, token, addr);
421 static inline void free_pmd_range(struct mmu_gather *tlb, pud_t *pud,
422 unsigned long addr, unsigned long end,
423 unsigned long floor, unsigned long ceiling)
430 pmd = pmd_offset(pud, addr);
432 next = pmd_addr_end(addr, end);
433 if (pmd_none_or_clear_bad(pmd))
435 free_pte_range(tlb, pmd, addr);
436 } while (pmd++, addr = next, addr != end);
446 if (end - 1 > ceiling - 1)
449 pmd = pmd_offset(pud, start);
451 pmd_free_tlb(tlb, pmd, start);
454 static inline void free_pud_range(struct mmu_gather *tlb, pgd_t *pgd,
455 unsigned long addr, unsigned long end,
456 unsigned long floor, unsigned long ceiling)
463 pud = pud_offset(pgd, addr);
465 next = pud_addr_end(addr, end);
466 if (pud_none_or_clear_bad(pud))
468 free_pmd_range(tlb, pud, addr, next, floor, ceiling);
469 } while (pud++, addr = next, addr != end);
475 ceiling &= PGDIR_MASK;
479 if (end - 1 > ceiling - 1)
482 pud = pud_offset(pgd, start);
484 pud_free_tlb(tlb, pud, start);
488 * This function frees user-level page tables of a process.
490 * Must be called with pagetable lock held.
492 void free_pgd_range(struct mmu_gather *tlb,
493 unsigned long addr, unsigned long end,
494 unsigned long floor, unsigned long ceiling)
500 * The next few lines have given us lots of grief...
502 * Why are we testing PMD* at this top level? Because often
503 * there will be no work to do at all, and we'd prefer not to
504 * go all the way down to the bottom just to discover that.
506 * Why all these "- 1"s? Because 0 represents both the bottom
507 * of the address space and the top of it (using -1 for the
508 * top wouldn't help much: the masks would do the wrong thing).
509 * The rule is that addr 0 and floor 0 refer to the bottom of
510 * the address space, but end 0 and ceiling 0 refer to the top
511 * Comparisons need to use "end - 1" and "ceiling - 1" (though
512 * that end 0 case should be mythical).
514 * Wherever addr is brought up or ceiling brought down, we must
515 * be careful to reject "the opposite 0" before it confuses the
516 * subsequent tests. But what about where end is brought down
517 * by PMD_SIZE below? no, end can't go down to 0 there.
519 * Whereas we round start (addr) and ceiling down, by different
520 * masks at different levels, in order to test whether a table
521 * now has no other vmas using it, so can be freed, we don't
522 * bother to round floor or end up - the tests don't need that.
536 if (end - 1 > ceiling - 1)
541 pgd = pgd_offset(tlb->mm, addr);
543 next = pgd_addr_end(addr, end);
544 if (pgd_none_or_clear_bad(pgd))
546 free_pud_range(tlb, pgd, addr, next, floor, ceiling);
547 } while (pgd++, addr = next, addr != end);
550 void free_pgtables(struct mmu_gather *tlb, struct vm_area_struct *vma,
551 unsigned long floor, unsigned long ceiling)
554 struct vm_area_struct *next = vma->vm_next;
555 unsigned long addr = vma->vm_start;
558 * Hide vma from rmap and truncate_pagecache before freeing
561 unlink_anon_vmas(vma);
562 unlink_file_vma(vma);
564 if (is_vm_hugetlb_page(vma)) {
565 hugetlb_free_pgd_range(tlb, addr, vma->vm_end,
566 floor, next? next->vm_start: ceiling);
569 * Optimization: gather nearby vmas into one call down
571 while (next && next->vm_start <= vma->vm_end + PMD_SIZE
572 && !is_vm_hugetlb_page(next)) {
575 unlink_anon_vmas(vma);
576 unlink_file_vma(vma);
578 free_pgd_range(tlb, addr, vma->vm_end,
579 floor, next? next->vm_start: ceiling);
585 int __pte_alloc(struct mm_struct *mm, struct vm_area_struct *vma,
586 pmd_t *pmd, unsigned long address)
588 pgtable_t new = pte_alloc_one(mm, address);
589 int wait_split_huge_page;
594 * Ensure all pte setup (eg. pte page lock and page clearing) are
595 * visible before the pte is made visible to other CPUs by being
596 * put into page tables.
598 * The other side of the story is the pointer chasing in the page
599 * table walking code (when walking the page table without locking;
600 * ie. most of the time). Fortunately, these data accesses consist
601 * of a chain of data-dependent loads, meaning most CPUs (alpha
602 * being the notable exception) will already guarantee loads are
603 * seen in-order. See the alpha page table accessors for the
604 * smp_read_barrier_depends() barriers in page table walking code.
606 smp_wmb(); /* Could be smp_wmb__xxx(before|after)_spin_lock */
608 spin_lock(&mm->page_table_lock);
609 wait_split_huge_page = 0;
610 if (likely(pmd_none(*pmd))) { /* Has another populated it ? */
612 pmd_populate(mm, pmd, new);
614 } else if (unlikely(pmd_trans_splitting(*pmd)))
615 wait_split_huge_page = 1;
616 spin_unlock(&mm->page_table_lock);
619 if (wait_split_huge_page)
620 wait_split_huge_page(vma->anon_vma, pmd);
624 int __pte_alloc_kernel(pmd_t *pmd, unsigned long address)
626 pte_t *new = pte_alloc_one_kernel(&init_mm, address);
630 smp_wmb(); /* See comment in __pte_alloc */
632 spin_lock(&init_mm.page_table_lock);
633 if (likely(pmd_none(*pmd))) { /* Has another populated it ? */
634 pmd_populate_kernel(&init_mm, pmd, new);
637 VM_BUG_ON(pmd_trans_splitting(*pmd));
638 spin_unlock(&init_mm.page_table_lock);
640 pte_free_kernel(&init_mm, new);
644 static inline void init_rss_vec(int *rss)
646 memset(rss, 0, sizeof(int) * NR_MM_COUNTERS);
649 static inline void add_mm_rss_vec(struct mm_struct *mm, int *rss)
653 if (current->mm == mm)
655 for (i = 0; i < NR_MM_COUNTERS; i++)
657 add_mm_counter(mm, i, rss[i]);
661 * This function is called to print an error when a bad pte
662 * is found. For example, we might have a PFN-mapped pte in
663 * a region that doesn't allow it.
665 * The calling function must still handle the error.
667 static void print_bad_pte(struct vm_area_struct *vma, unsigned long addr,
668 pte_t pte, struct page *page)
670 pgd_t *pgd = pgd_offset(vma->vm_mm, addr);
671 pud_t *pud = pud_offset(pgd, addr);
672 pmd_t *pmd = pmd_offset(pud, addr);
673 struct address_space *mapping;
675 static unsigned long resume;
676 static unsigned long nr_shown;
677 static unsigned long nr_unshown;
680 * Allow a burst of 60 reports, then keep quiet for that minute;
681 * or allow a steady drip of one report per second.
683 if (nr_shown == 60) {
684 if (time_before(jiffies, resume)) {
690 "BUG: Bad page map: %lu messages suppressed\n",
697 resume = jiffies + 60 * HZ;
699 mapping = vma->vm_file ? vma->vm_file->f_mapping : NULL;
700 index = linear_page_index(vma, addr);
703 "BUG: Bad page map in process %s pte:%08llx pmd:%08llx\n",
705 (long long)pte_val(pte), (long long)pmd_val(*pmd));
709 "addr:%p vm_flags:%08lx anon_vma:%p mapping:%p index:%lx\n",
710 (void *)addr, vma->vm_flags, vma->anon_vma, mapping, index);
712 * Choose text because data symbols depend on CONFIG_KALLSYMS_ALL=y
715 printk(KERN_ALERT "vma->vm_ops->fault: %pSR\n",
717 if (vma->vm_file && vma->vm_file->f_op)
718 printk(KERN_ALERT "vma->vm_file->f_op->mmap: %pSR\n",
719 vma->vm_file->f_op->mmap);
721 add_taint(TAINT_BAD_PAGE, LOCKDEP_NOW_UNRELIABLE);
724 static inline bool is_cow_mapping(vm_flags_t flags)
726 return (flags & (VM_SHARED | VM_MAYWRITE)) == VM_MAYWRITE;
730 * vm_normal_page -- This function gets the "struct page" associated with a pte.
732 * "Special" mappings do not wish to be associated with a "struct page" (either
733 * it doesn't exist, or it exists but they don't want to touch it). In this
734 * case, NULL is returned here. "Normal" mappings do have a struct page.
736 * There are 2 broad cases. Firstly, an architecture may define a pte_special()
737 * pte bit, in which case this function is trivial. Secondly, an architecture
738 * may not have a spare pte bit, which requires a more complicated scheme,
741 * A raw VM_PFNMAP mapping (ie. one that is not COWed) is always considered a
742 * special mapping (even if there are underlying and valid "struct pages").
743 * COWed pages of a VM_PFNMAP are always normal.
745 * The way we recognize COWed pages within VM_PFNMAP mappings is through the
746 * rules set up by "remap_pfn_range()": the vma will have the VM_PFNMAP bit
747 * set, and the vm_pgoff will point to the first PFN mapped: thus every special
748 * mapping will always honor the rule
750 * pfn_of_page == vma->vm_pgoff + ((addr - vma->vm_start) >> PAGE_SHIFT)
752 * And for normal mappings this is false.
754 * This restricts such mappings to be a linear translation from virtual address
755 * to pfn. To get around this restriction, we allow arbitrary mappings so long
756 * as the vma is not a COW mapping; in that case, we know that all ptes are
757 * special (because none can have been COWed).
760 * In order to support COW of arbitrary special mappings, we have VM_MIXEDMAP.
762 * VM_MIXEDMAP mappings can likewise contain memory with or without "struct
763 * page" backing, however the difference is that _all_ pages with a struct
764 * page (that is, those where pfn_valid is true) are refcounted and considered
765 * normal pages by the VM. The disadvantage is that pages are refcounted
766 * (which can be slower and simply not an option for some PFNMAP users). The
767 * advantage is that we don't have to follow the strict linearity rule of
768 * PFNMAP mappings in order to support COWable mappings.
771 #ifdef __HAVE_ARCH_PTE_SPECIAL
772 # define HAVE_PTE_SPECIAL 1
774 # define HAVE_PTE_SPECIAL 0
776 struct page *vm_normal_page(struct vm_area_struct *vma, unsigned long addr,
779 unsigned long pfn = pte_pfn(pte);
781 if (HAVE_PTE_SPECIAL) {
782 if (likely(!pte_special(pte)))
784 if (vma->vm_flags & (VM_PFNMAP | VM_MIXEDMAP))
786 if (!is_zero_pfn(pfn))
787 print_bad_pte(vma, addr, pte, NULL);
791 /* !HAVE_PTE_SPECIAL case follows: */
793 if (unlikely(vma->vm_flags & (VM_PFNMAP|VM_MIXEDMAP))) {
794 if (vma->vm_flags & VM_MIXEDMAP) {
800 off = (addr - vma->vm_start) >> PAGE_SHIFT;
801 if (pfn == vma->vm_pgoff + off)
803 if (!is_cow_mapping(vma->vm_flags))
808 if (is_zero_pfn(pfn))
811 if (unlikely(pfn > highest_memmap_pfn)) {
812 print_bad_pte(vma, addr, pte, NULL);
817 * NOTE! We still have PageReserved() pages in the page tables.
818 * eg. VDSO mappings can cause them to exist.
821 return pfn_to_page(pfn);
825 * copy one vm_area from one task to the other. Assumes the page tables
826 * already present in the new task to be cleared in the whole range
827 * covered by this vma.
830 static inline unsigned long
831 copy_one_pte(struct mm_struct *dst_mm, struct mm_struct *src_mm,
832 pte_t *dst_pte, pte_t *src_pte, struct vm_area_struct *vma,
833 unsigned long addr, int *rss)
835 unsigned long vm_flags = vma->vm_flags;
836 pte_t pte = *src_pte;
839 /* pte contains position in swap or file, so copy. */
840 if (unlikely(!pte_present(pte))) {
841 if (!pte_file(pte)) {
842 swp_entry_t entry = pte_to_swp_entry(pte);
844 if (likely(!non_swap_entry(entry))) {
845 if (swap_duplicate(entry) < 0)
848 /* make sure dst_mm is on swapoff's mmlist. */
849 if (unlikely(list_empty(&dst_mm->mmlist))) {
850 spin_lock(&mmlist_lock);
851 if (list_empty(&dst_mm->mmlist))
852 list_add(&dst_mm->mmlist,
854 spin_unlock(&mmlist_lock);
857 } else if (is_migration_entry(entry)) {
858 page = migration_entry_to_page(entry);
865 if (is_write_migration_entry(entry) &&
866 is_cow_mapping(vm_flags)) {
868 * COW mappings require pages in both
869 * parent and child to be set to read.
871 make_migration_entry_read(&entry);
872 pte = swp_entry_to_pte(entry);
873 set_pte_at(src_mm, addr, src_pte, pte);
881 * If it's a COW mapping, write protect it both
882 * in the parent and the child
884 if (is_cow_mapping(vm_flags)) {
885 ptep_set_wrprotect(src_mm, addr, src_pte);
886 pte = pte_wrprotect(pte);
890 * If it's a shared mapping, mark it clean in
893 if (vm_flags & VM_SHARED)
894 pte = pte_mkclean(pte);
895 pte = pte_mkold(pte);
897 page = vm_normal_page(vma, addr, pte);
908 set_pte_at(dst_mm, addr, dst_pte, pte);
912 int copy_pte_range(struct mm_struct *dst_mm, struct mm_struct *src_mm,
913 pmd_t *dst_pmd, pmd_t *src_pmd, struct vm_area_struct *vma,
914 unsigned long addr, unsigned long end)
916 pte_t *orig_src_pte, *orig_dst_pte;
917 pte_t *src_pte, *dst_pte;
918 spinlock_t *src_ptl, *dst_ptl;
920 int rss[NR_MM_COUNTERS];
921 swp_entry_t entry = (swp_entry_t){0};
926 dst_pte = pte_alloc_map_lock(dst_mm, dst_pmd, addr, &dst_ptl);
929 src_pte = pte_offset_map(src_pmd, addr);
930 src_ptl = pte_lockptr(src_mm, src_pmd);
931 spin_lock_nested(src_ptl, SINGLE_DEPTH_NESTING);
932 orig_src_pte = src_pte;
933 orig_dst_pte = dst_pte;
934 arch_enter_lazy_mmu_mode();
938 * We are holding two locks at this point - either of them
939 * could generate latencies in another task on another CPU.
941 if (progress >= 32) {
943 if (need_resched() ||
944 spin_needbreak(src_ptl) || spin_needbreak(dst_ptl))
947 if (pte_none(*src_pte)) {
951 entry.val = copy_one_pte(dst_mm, src_mm, dst_pte, src_pte,
956 } while (dst_pte++, src_pte++, addr += PAGE_SIZE, addr != end);
958 arch_leave_lazy_mmu_mode();
959 spin_unlock(src_ptl);
960 pte_unmap(orig_src_pte);
961 add_mm_rss_vec(dst_mm, rss);
962 pte_unmap_unlock(orig_dst_pte, dst_ptl);
966 if (add_swap_count_continuation(entry, GFP_KERNEL) < 0)
975 static inline int copy_pmd_range(struct mm_struct *dst_mm, struct mm_struct *src_mm,
976 pud_t *dst_pud, pud_t *src_pud, struct vm_area_struct *vma,
977 unsigned long addr, unsigned long end)
979 pmd_t *src_pmd, *dst_pmd;
982 dst_pmd = pmd_alloc(dst_mm, dst_pud, addr);
985 src_pmd = pmd_offset(src_pud, addr);
987 next = pmd_addr_end(addr, end);
988 if (pmd_trans_huge(*src_pmd)) {
990 VM_BUG_ON(next-addr != HPAGE_PMD_SIZE);
991 err = copy_huge_pmd(dst_mm, src_mm,
992 dst_pmd, src_pmd, addr, vma);
999 if (pmd_none_or_clear_bad(src_pmd))
1001 if (copy_pte_range(dst_mm, src_mm, dst_pmd, src_pmd,
1004 } while (dst_pmd++, src_pmd++, addr = next, addr != end);
1008 static inline int copy_pud_range(struct mm_struct *dst_mm, struct mm_struct *src_mm,
1009 pgd_t *dst_pgd, pgd_t *src_pgd, struct vm_area_struct *vma,
1010 unsigned long addr, unsigned long end)
1012 pud_t *src_pud, *dst_pud;
1015 dst_pud = pud_alloc(dst_mm, dst_pgd, addr);
1018 src_pud = pud_offset(src_pgd, addr);
1020 next = pud_addr_end(addr, end);
1021 if (pud_none_or_clear_bad(src_pud))
1023 if (copy_pmd_range(dst_mm, src_mm, dst_pud, src_pud,
1026 } while (dst_pud++, src_pud++, addr = next, addr != end);
1030 int copy_page_range(struct mm_struct *dst_mm, struct mm_struct *src_mm,
1031 struct vm_area_struct *vma)
1033 pgd_t *src_pgd, *dst_pgd;
1035 unsigned long addr = vma->vm_start;
1036 unsigned long end = vma->vm_end;
1037 unsigned long mmun_start; /* For mmu_notifiers */
1038 unsigned long mmun_end; /* For mmu_notifiers */
1043 * Don't copy ptes where a page fault will fill them correctly.
1044 * Fork becomes much lighter when there are big shared or private
1045 * readonly mappings. The tradeoff is that copy_page_range is more
1046 * efficient than faulting.
1048 if (!(vma->vm_flags & (VM_HUGETLB | VM_NONLINEAR |
1049 VM_PFNMAP | VM_MIXEDMAP))) {
1054 if (is_vm_hugetlb_page(vma))
1055 return copy_hugetlb_page_range(dst_mm, src_mm, vma);
1057 if (unlikely(vma->vm_flags & VM_PFNMAP)) {
1059 * We do not free on error cases below as remove_vma
1060 * gets called on error from higher level routine
1062 ret = track_pfn_copy(vma);
1068 * We need to invalidate the secondary MMU mappings only when
1069 * there could be a permission downgrade on the ptes of the
1070 * parent mm. And a permission downgrade will only happen if
1071 * is_cow_mapping() returns true.
1073 is_cow = is_cow_mapping(vma->vm_flags);
1077 mmu_notifier_invalidate_range_start(src_mm, mmun_start,
1081 dst_pgd = pgd_offset(dst_mm, addr);
1082 src_pgd = pgd_offset(src_mm, addr);
1084 next = pgd_addr_end(addr, end);
1085 if (pgd_none_or_clear_bad(src_pgd))
1087 if (unlikely(copy_pud_range(dst_mm, src_mm, dst_pgd, src_pgd,
1088 vma, addr, next))) {
1092 } while (dst_pgd++, src_pgd++, addr = next, addr != end);
1095 mmu_notifier_invalidate_range_end(src_mm, mmun_start, mmun_end);
1099 static unsigned long zap_pte_range(struct mmu_gather *tlb,
1100 struct vm_area_struct *vma, pmd_t *pmd,
1101 unsigned long addr, unsigned long end,
1102 struct zap_details *details)
1104 struct mm_struct *mm = tlb->mm;
1105 int force_flush = 0;
1106 int rss[NR_MM_COUNTERS];
1113 start_pte = pte_offset_map_lock(mm, pmd, addr, &ptl);
1115 arch_enter_lazy_mmu_mode();
1118 if (pte_none(ptent)) {
1122 if (pte_present(ptent)) {
1125 page = vm_normal_page(vma, addr, ptent);
1126 if (unlikely(details) && page) {
1128 * unmap_shared_mapping_pages() wants to
1129 * invalidate cache without truncating:
1130 * unmap shared but keep private pages.
1132 if (details->check_mapping &&
1133 details->check_mapping != page->mapping)
1136 * Each page->index must be checked when
1137 * invalidating or truncating nonlinear.
1139 if (details->nonlinear_vma &&
1140 (page->index < details->first_index ||
1141 page->index > details->last_index))
1144 ptent = ptep_get_and_clear_full(mm, addr, pte,
1146 tlb_remove_tlb_entry(tlb, pte, addr);
1147 if (unlikely(!page))
1149 if (unlikely(details) && details->nonlinear_vma
1150 && linear_page_index(details->nonlinear_vma,
1151 addr) != page->index)
1152 set_pte_at(mm, addr, pte,
1153 pgoff_to_pte(page->index));
1155 rss[MM_ANONPAGES]--;
1157 if (pte_dirty(ptent))
1158 set_page_dirty(page);
1159 if (pte_young(ptent) &&
1160 likely(!VM_SequentialReadHint(vma)))
1161 mark_page_accessed(page);
1162 rss[MM_FILEPAGES]--;
1164 page_remove_rmap(page);
1165 if (unlikely(page_mapcount(page) < 0))
1166 print_bad_pte(vma, addr, ptent, page);
1167 force_flush = !__tlb_remove_page(tlb, page);
1173 * If details->check_mapping, we leave swap entries;
1174 * if details->nonlinear_vma, we leave file entries.
1176 if (unlikely(details))
1178 if (pte_file(ptent)) {
1179 if (unlikely(!(vma->vm_flags & VM_NONLINEAR)))
1180 print_bad_pte(vma, addr, ptent, NULL);
1182 swp_entry_t entry = pte_to_swp_entry(ptent);
1184 if (!non_swap_entry(entry))
1186 else if (is_migration_entry(entry)) {
1189 page = migration_entry_to_page(entry);
1192 rss[MM_ANONPAGES]--;
1194 rss[MM_FILEPAGES]--;
1196 if (unlikely(!free_swap_and_cache(entry)))
1197 print_bad_pte(vma, addr, ptent, NULL);
1199 pte_clear_not_present_full(mm, addr, pte, tlb->fullmm);
1200 } while (pte++, addr += PAGE_SIZE, addr != end);
1202 add_mm_rss_vec(mm, rss);
1203 arch_leave_lazy_mmu_mode();
1204 pte_unmap_unlock(start_pte, ptl);
1207 * mmu_gather ran out of room to batch pages, we break out of
1208 * the PTE lock to avoid doing the potential expensive TLB invalidate
1209 * and page-free while holding it.
1212 unsigned long old_end;
1217 * Flush the TLB just for the previous segment,
1218 * then update the range to be the remaining
1236 static inline unsigned long zap_pmd_range(struct mmu_gather *tlb,
1237 struct vm_area_struct *vma, pud_t *pud,
1238 unsigned long addr, unsigned long end,
1239 struct zap_details *details)
1244 pmd = pmd_offset(pud, addr);
1246 next = pmd_addr_end(addr, end);
1247 if (pmd_trans_huge(*pmd)) {
1248 if (next - addr != HPAGE_PMD_SIZE) {
1249 #ifdef CONFIG_DEBUG_VM
1250 if (!rwsem_is_locked(&tlb->mm->mmap_sem)) {
1251 pr_err("%s: mmap_sem is unlocked! addr=0x%lx end=0x%lx vma->vm_start=0x%lx vma->vm_end=0x%lx\n",
1252 __func__, addr, end,
1258 split_huge_page_pmd(vma, addr, pmd);
1259 } else if (zap_huge_pmd(tlb, vma, pmd, addr))
1264 * Here there can be other concurrent MADV_DONTNEED or
1265 * trans huge page faults running, and if the pmd is
1266 * none or trans huge it can change under us. This is
1267 * because MADV_DONTNEED holds the mmap_sem in read
1270 if (pmd_none_or_trans_huge_or_clear_bad(pmd))
1272 next = zap_pte_range(tlb, vma, pmd, addr, next, details);
1275 } while (pmd++, addr = next, addr != end);
1280 static inline unsigned long zap_pud_range(struct mmu_gather *tlb,
1281 struct vm_area_struct *vma, pgd_t *pgd,
1282 unsigned long addr, unsigned long end,
1283 struct zap_details *details)
1288 pud = pud_offset(pgd, addr);
1290 next = pud_addr_end(addr, end);
1291 if (pud_none_or_clear_bad(pud))
1293 next = zap_pmd_range(tlb, vma, pud, addr, next, details);
1294 } while (pud++, addr = next, addr != end);
1299 static void unmap_page_range(struct mmu_gather *tlb,
1300 struct vm_area_struct *vma,
1301 unsigned long addr, unsigned long end,
1302 struct zap_details *details)
1307 if (details && !details->check_mapping && !details->nonlinear_vma)
1310 BUG_ON(addr >= end);
1311 mem_cgroup_uncharge_start();
1312 tlb_start_vma(tlb, vma);
1313 pgd = pgd_offset(vma->vm_mm, addr);
1315 next = pgd_addr_end(addr, end);
1316 if (pgd_none_or_clear_bad(pgd))
1318 next = zap_pud_range(tlb, vma, pgd, addr, next, details);
1319 } while (pgd++, addr = next, addr != end);
1320 tlb_end_vma(tlb, vma);
1321 mem_cgroup_uncharge_end();
1325 static void unmap_single_vma(struct mmu_gather *tlb,
1326 struct vm_area_struct *vma, unsigned long start_addr,
1327 unsigned long end_addr,
1328 struct zap_details *details)
1330 unsigned long start = max(vma->vm_start, start_addr);
1333 if (start >= vma->vm_end)
1335 end = min(vma->vm_end, end_addr);
1336 if (end <= vma->vm_start)
1340 uprobe_munmap(vma, start, end);
1342 if (unlikely(vma->vm_flags & VM_PFNMAP))
1343 untrack_pfn(vma, 0, 0);
1346 if (unlikely(is_vm_hugetlb_page(vma))) {
1348 * It is undesirable to test vma->vm_file as it
1349 * should be non-null for valid hugetlb area.
1350 * However, vm_file will be NULL in the error
1351 * cleanup path of do_mmap_pgoff. When
1352 * hugetlbfs ->mmap method fails,
1353 * do_mmap_pgoff() nullifies vma->vm_file
1354 * before calling this function to clean up.
1355 * Since no pte has actually been setup, it is
1356 * safe to do nothing in this case.
1359 mutex_lock(&vma->vm_file->f_mapping->i_mmap_mutex);
1360 __unmap_hugepage_range_final(tlb, vma, start, end, NULL);
1361 mutex_unlock(&vma->vm_file->f_mapping->i_mmap_mutex);
1364 unmap_page_range(tlb, vma, start, end, details);
1369 * unmap_vmas - unmap a range of memory covered by a list of vma's
1370 * @tlb: address of the caller's struct mmu_gather
1371 * @vma: the starting vma
1372 * @start_addr: virtual address at which to start unmapping
1373 * @end_addr: virtual address at which to end unmapping
1375 * Unmap all pages in the vma list.
1377 * Only addresses between `start' and `end' will be unmapped.
1379 * The VMA list must be sorted in ascending virtual address order.
1381 * unmap_vmas() assumes that the caller will flush the whole unmapped address
1382 * range after unmap_vmas() returns. So the only responsibility here is to
1383 * ensure that any thus-far unmapped pages are flushed before unmap_vmas()
1384 * drops the lock and schedules.
1386 void unmap_vmas(struct mmu_gather *tlb,
1387 struct vm_area_struct *vma, unsigned long start_addr,
1388 unsigned long end_addr)
1390 struct mm_struct *mm = vma->vm_mm;
1392 mmu_notifier_invalidate_range_start(mm, start_addr, end_addr);
1393 for ( ; vma && vma->vm_start < end_addr; vma = vma->vm_next)
1394 unmap_single_vma(tlb, vma, start_addr, end_addr, NULL);
1395 mmu_notifier_invalidate_range_end(mm, start_addr, end_addr);
1399 * zap_page_range - remove user pages in a given range
1400 * @vma: vm_area_struct holding the applicable pages
1401 * @start: starting address of pages to zap
1402 * @size: number of bytes to zap
1403 * @details: details of nonlinear truncation or shared cache invalidation
1405 * Caller must protect the VMA list
1407 void zap_page_range(struct vm_area_struct *vma, unsigned long start,
1408 unsigned long size, struct zap_details *details)
1410 struct mm_struct *mm = vma->vm_mm;
1411 struct mmu_gather tlb;
1412 unsigned long end = start + size;
1415 tlb_gather_mmu(&tlb, mm, start, end);
1416 update_hiwater_rss(mm);
1417 mmu_notifier_invalidate_range_start(mm, start, end);
1418 for ( ; vma && vma->vm_start < end; vma = vma->vm_next)
1419 unmap_single_vma(&tlb, vma, start, end, details);
1420 mmu_notifier_invalidate_range_end(mm, start, end);
1421 tlb_finish_mmu(&tlb, start, end);
1425 * zap_page_range_single - remove user pages in a given range
1426 * @vma: vm_area_struct holding the applicable pages
1427 * @address: starting address of pages to zap
1428 * @size: number of bytes to zap
1429 * @details: details of nonlinear truncation or shared cache invalidation
1431 * The range must fit into one VMA.
1433 static void zap_page_range_single(struct vm_area_struct *vma, unsigned long address,
1434 unsigned long size, struct zap_details *details)
1436 struct mm_struct *mm = vma->vm_mm;
1437 struct mmu_gather tlb;
1438 unsigned long end = address + size;
1441 tlb_gather_mmu(&tlb, mm, address, end);
1442 update_hiwater_rss(mm);
1443 mmu_notifier_invalidate_range_start(mm, address, end);
1444 unmap_single_vma(&tlb, vma, address, end, details);
1445 mmu_notifier_invalidate_range_end(mm, address, end);
1446 tlb_finish_mmu(&tlb, address, end);
1450 * zap_vma_ptes - remove ptes mapping the vma
1451 * @vma: vm_area_struct holding ptes to be zapped
1452 * @address: starting address of pages to zap
1453 * @size: number of bytes to zap
1455 * This function only unmaps ptes assigned to VM_PFNMAP vmas.
1457 * The entire address range must be fully contained within the vma.
1459 * Returns 0 if successful.
1461 int zap_vma_ptes(struct vm_area_struct *vma, unsigned long address,
1464 if (address < vma->vm_start || address + size > vma->vm_end ||
1465 !(vma->vm_flags & VM_PFNMAP))
1467 zap_page_range_single(vma, address, size, NULL);
1470 EXPORT_SYMBOL_GPL(zap_vma_ptes);
1473 * follow_page_mask - look up a page descriptor from a user-virtual address
1474 * @vma: vm_area_struct mapping @address
1475 * @address: virtual address to look up
1476 * @flags: flags modifying lookup behaviour
1477 * @page_mask: on output, *page_mask is set according to the size of the page
1479 * @flags can have FOLL_ flags set, defined in <linux/mm.h>
1481 * Returns the mapped (struct page *), %NULL if no mapping exists, or
1482 * an error pointer if there is a mapping to something not represented
1483 * by a page descriptor (see also vm_normal_page()).
1485 struct page *follow_page_mask(struct vm_area_struct *vma,
1486 unsigned long address, unsigned int flags,
1487 unsigned int *page_mask)
1495 struct mm_struct *mm = vma->vm_mm;
1499 page = follow_huge_addr(mm, address, flags & FOLL_WRITE);
1500 if (!IS_ERR(page)) {
1501 BUG_ON(flags & FOLL_GET);
1506 pgd = pgd_offset(mm, address);
1507 if (pgd_none(*pgd) || unlikely(pgd_bad(*pgd)))
1510 pud = pud_offset(pgd, address);
1513 if (pud_huge(*pud) && vma->vm_flags & VM_HUGETLB) {
1514 BUG_ON(flags & FOLL_GET);
1515 page = follow_huge_pud(mm, address, pud, flags & FOLL_WRITE);
1518 if (unlikely(pud_bad(*pud)))
1521 pmd = pmd_offset(pud, address);
1524 if (pmd_huge(*pmd) && vma->vm_flags & VM_HUGETLB) {
1525 BUG_ON(flags & FOLL_GET);
1526 page = follow_huge_pmd(mm, address, pmd, flags & FOLL_WRITE);
1529 if ((flags & FOLL_NUMA) && pmd_numa(*pmd))
1531 if (pmd_trans_huge(*pmd)) {
1532 if (flags & FOLL_SPLIT) {
1533 split_huge_page_pmd(vma, address, pmd);
1534 goto split_fallthrough;
1536 spin_lock(&mm->page_table_lock);
1537 if (likely(pmd_trans_huge(*pmd))) {
1538 if (unlikely(pmd_trans_splitting(*pmd))) {
1539 spin_unlock(&mm->page_table_lock);
1540 wait_split_huge_page(vma->anon_vma, pmd);
1542 page = follow_trans_huge_pmd(vma, address,
1544 spin_unlock(&mm->page_table_lock);
1545 *page_mask = HPAGE_PMD_NR - 1;
1549 spin_unlock(&mm->page_table_lock);
1553 if (unlikely(pmd_bad(*pmd)))
1556 ptep = pte_offset_map_lock(mm, pmd, address, &ptl);
1559 if (!pte_present(pte)) {
1562 * KSM's break_ksm() relies upon recognizing a ksm page
1563 * even while it is being migrated, so for that case we
1564 * need migration_entry_wait().
1566 if (likely(!(flags & FOLL_MIGRATION)))
1568 if (pte_none(pte) || pte_file(pte))
1570 entry = pte_to_swp_entry(pte);
1571 if (!is_migration_entry(entry))
1573 pte_unmap_unlock(ptep, ptl);
1574 migration_entry_wait(mm, pmd, address);
1575 goto split_fallthrough;
1577 if ((flags & FOLL_NUMA) && pte_numa(pte))
1579 if ((flags & FOLL_WRITE) && !pte_write(pte))
1582 page = vm_normal_page(vma, address, pte);
1583 if (unlikely(!page)) {
1584 if ((flags & FOLL_DUMP) ||
1585 !is_zero_pfn(pte_pfn(pte)))
1587 page = pte_page(pte);
1590 if (flags & FOLL_GET)
1591 get_page_foll(page);
1592 if (flags & FOLL_TOUCH) {
1593 if ((flags & FOLL_WRITE) &&
1594 !pte_dirty(pte) && !PageDirty(page))
1595 set_page_dirty(page);
1597 * pte_mkyoung() would be more correct here, but atomic care
1598 * is needed to avoid losing the dirty bit: it is easier to use
1599 * mark_page_accessed().
1601 mark_page_accessed(page);
1603 if ((flags & FOLL_MLOCK) && (vma->vm_flags & VM_LOCKED)) {
1605 * The preliminary mapping check is mainly to avoid the
1606 * pointless overhead of lock_page on the ZERO_PAGE
1607 * which might bounce very badly if there is contention.
1609 * If the page is already locked, we don't need to
1610 * handle it now - vmscan will handle it later if and
1611 * when it attempts to reclaim the page.
1613 if (page->mapping && trylock_page(page)) {
1614 lru_add_drain(); /* push cached pages to LRU */
1616 * Because we lock page here, and migration is
1617 * blocked by the pte's page reference, and we
1618 * know the page is still mapped, we don't even
1619 * need to check for file-cache page truncation.
1621 mlock_vma_page(page);
1626 pte_unmap_unlock(ptep, ptl);
1631 pte_unmap_unlock(ptep, ptl);
1632 return ERR_PTR(-EFAULT);
1635 pte_unmap_unlock(ptep, ptl);
1641 * When core dumping an enormous anonymous area that nobody
1642 * has touched so far, we don't want to allocate unnecessary pages or
1643 * page tables. Return error instead of NULL to skip handle_mm_fault,
1644 * then get_dump_page() will return NULL to leave a hole in the dump.
1645 * But we can only make this optimization where a hole would surely
1646 * be zero-filled if handle_mm_fault() actually did handle it.
1648 if ((flags & FOLL_DUMP) &&
1649 (!vma->vm_ops || !vma->vm_ops->fault))
1650 return ERR_PTR(-EFAULT);
1654 static inline int stack_guard_page(struct vm_area_struct *vma, unsigned long addr)
1656 return stack_guard_page_start(vma, addr) ||
1657 stack_guard_page_end(vma, addr+PAGE_SIZE);
1661 * __get_user_pages() - pin user pages in memory
1662 * @tsk: task_struct of target task
1663 * @mm: mm_struct of target mm
1664 * @start: starting user address
1665 * @nr_pages: number of pages from start to pin
1666 * @gup_flags: flags modifying pin behaviour
1667 * @pages: array that receives pointers to the pages pinned.
1668 * Should be at least nr_pages long. Or NULL, if caller
1669 * only intends to ensure the pages are faulted in.
1670 * @vmas: array of pointers to vmas corresponding to each page.
1671 * Or NULL if the caller does not require them.
1672 * @nonblocking: whether waiting for disk IO or mmap_sem contention
1674 * Returns number of pages pinned. This may be fewer than the number
1675 * requested. If nr_pages is 0 or negative, returns 0. If no pages
1676 * were pinned, returns -errno. Each page returned must be released
1677 * with a put_page() call when it is finished with. vmas will only
1678 * remain valid while mmap_sem is held.
1680 * Must be called with mmap_sem held for read or write.
1682 * __get_user_pages walks a process's page tables and takes a reference to
1683 * each struct page that each user address corresponds to at a given
1684 * instant. That is, it takes the page that would be accessed if a user
1685 * thread accesses the given user virtual address at that instant.
1687 * This does not guarantee that the page exists in the user mappings when
1688 * __get_user_pages returns, and there may even be a completely different
1689 * page there in some cases (eg. if mmapped pagecache has been invalidated
1690 * and subsequently re faulted). However it does guarantee that the page
1691 * won't be freed completely. And mostly callers simply care that the page
1692 * contains data that was valid *at some point in time*. Typically, an IO
1693 * or similar operation cannot guarantee anything stronger anyway because
1694 * locks can't be held over the syscall boundary.
1696 * If @gup_flags & FOLL_WRITE == 0, the page must not be written to. If
1697 * the page is written to, set_page_dirty (or set_page_dirty_lock, as
1698 * appropriate) must be called after the page is finished with, and
1699 * before put_page is called.
1701 * If @nonblocking != NULL, __get_user_pages will not wait for disk IO
1702 * or mmap_sem contention, and if waiting is needed to pin all pages,
1703 * *@nonblocking will be set to 0.
1705 * In most cases, get_user_pages or get_user_pages_fast should be used
1706 * instead of __get_user_pages. __get_user_pages should be used only if
1707 * you need some special @gup_flags.
1709 long __get_user_pages(struct task_struct *tsk, struct mm_struct *mm,
1710 unsigned long start, unsigned long nr_pages,
1711 unsigned int gup_flags, struct page **pages,
1712 struct vm_area_struct **vmas, int *nonblocking)
1715 unsigned long vm_flags;
1716 unsigned int page_mask;
1721 VM_BUG_ON(!!pages != !!(gup_flags & FOLL_GET));
1724 * Require read or write permissions.
1725 * If FOLL_FORCE is set, we only require the "MAY" flags.
1727 vm_flags = (gup_flags & FOLL_WRITE) ?
1728 (VM_WRITE | VM_MAYWRITE) : (VM_READ | VM_MAYREAD);
1729 vm_flags &= (gup_flags & FOLL_FORCE) ?
1730 (VM_MAYREAD | VM_MAYWRITE) : (VM_READ | VM_WRITE);
1733 * If FOLL_FORCE and FOLL_NUMA are both set, handle_mm_fault
1734 * would be called on PROT_NONE ranges. We must never invoke
1735 * handle_mm_fault on PROT_NONE ranges or the NUMA hinting
1736 * page faults would unprotect the PROT_NONE ranges if
1737 * _PAGE_NUMA and _PAGE_PROTNONE are sharing the same pte/pmd
1738 * bitflag. So to avoid that, don't set FOLL_NUMA if
1739 * FOLL_FORCE is set.
1741 if (!(gup_flags & FOLL_FORCE))
1742 gup_flags |= FOLL_NUMA;
1747 struct vm_area_struct *vma;
1749 vma = find_extend_vma(mm, start);
1750 if (!vma && in_gate_area(mm, start)) {
1751 unsigned long pg = start & PAGE_MASK;
1757 /* user gate pages are read-only */
1758 if (gup_flags & FOLL_WRITE)
1759 return i ? : -EFAULT;
1761 pgd = pgd_offset_k(pg);
1763 pgd = pgd_offset_gate(mm, pg);
1764 BUG_ON(pgd_none(*pgd));
1765 pud = pud_offset(pgd, pg);
1766 BUG_ON(pud_none(*pud));
1767 pmd = pmd_offset(pud, pg);
1769 return i ? : -EFAULT;
1770 VM_BUG_ON(pmd_trans_huge(*pmd));
1771 pte = pte_offset_map(pmd, pg);
1772 if (pte_none(*pte)) {
1774 return i ? : -EFAULT;
1776 vma = get_gate_vma(mm);
1780 page = vm_normal_page(vma, start, *pte);
1782 if (!(gup_flags & FOLL_DUMP) &&
1783 is_zero_pfn(pte_pfn(*pte)))
1784 page = pte_page(*pte);
1787 return i ? : -EFAULT;
1799 (vma->vm_flags & (VM_IO | VM_PFNMAP)) ||
1800 !(vm_flags & vma->vm_flags))
1801 return i ? : -EFAULT;
1803 if (is_vm_hugetlb_page(vma)) {
1804 i = follow_hugetlb_page(mm, vma, pages, vmas,
1805 &start, &nr_pages, i, gup_flags);
1811 unsigned int foll_flags = gup_flags;
1812 unsigned int page_increm;
1815 * If we have a pending SIGKILL, don't keep faulting
1816 * pages and potentially allocating memory.
1818 if (unlikely(fatal_signal_pending(current)))
1819 return i ? i : -ERESTARTSYS;
1822 while (!(page = follow_page_mask(vma, start,
1823 foll_flags, &page_mask))) {
1825 unsigned int fault_flags = 0;
1827 /* For mlock, just skip the stack guard page. */
1828 if (foll_flags & FOLL_MLOCK) {
1829 if (stack_guard_page(vma, start))
1832 if (foll_flags & FOLL_WRITE)
1833 fault_flags |= FAULT_FLAG_WRITE;
1835 fault_flags |= FAULT_FLAG_ALLOW_RETRY;
1836 if (foll_flags & FOLL_NOWAIT)
1837 fault_flags |= (FAULT_FLAG_ALLOW_RETRY | FAULT_FLAG_RETRY_NOWAIT);
1839 ret = handle_mm_fault(mm, vma, start,
1842 if (ret & VM_FAULT_ERROR) {
1843 if (ret & VM_FAULT_OOM)
1844 return i ? i : -ENOMEM;
1845 if (ret & (VM_FAULT_HWPOISON |
1846 VM_FAULT_HWPOISON_LARGE)) {
1849 else if (gup_flags & FOLL_HWPOISON)
1854 if (ret & VM_FAULT_SIGBUS)
1855 return i ? i : -EFAULT;
1860 if (ret & VM_FAULT_MAJOR)
1866 if (ret & VM_FAULT_RETRY) {
1873 * The VM_FAULT_WRITE bit tells us that
1874 * do_wp_page has broken COW when necessary,
1875 * even if maybe_mkwrite decided not to set
1876 * pte_write. We can thus safely do subsequent
1877 * page lookups as if they were reads. But only
1878 * do so when looping for pte_write is futile:
1879 * in some cases userspace may also be wanting
1880 * to write to the gotten user page, which a
1881 * read fault here might prevent (a readonly
1882 * page might get reCOWed by userspace write).
1884 if ((ret & VM_FAULT_WRITE) &&
1885 !(vma->vm_flags & VM_WRITE))
1886 foll_flags &= ~FOLL_WRITE;
1891 return i ? i : PTR_ERR(page);
1895 flush_anon_page(vma, page, start);
1896 flush_dcache_page(page);
1904 page_increm = 1 + (~(start >> PAGE_SHIFT) & page_mask);
1905 if (page_increm > nr_pages)
1906 page_increm = nr_pages;
1908 start += page_increm * PAGE_SIZE;
1909 nr_pages -= page_increm;
1910 } while (nr_pages && start < vma->vm_end);
1914 EXPORT_SYMBOL(__get_user_pages);
1917 * fixup_user_fault() - manually resolve a user page fault
1918 * @tsk: the task_struct to use for page fault accounting, or
1919 * NULL if faults are not to be recorded.
1920 * @mm: mm_struct of target mm
1921 * @address: user address
1922 * @fault_flags:flags to pass down to handle_mm_fault()
1924 * This is meant to be called in the specific scenario where for locking reasons
1925 * we try to access user memory in atomic context (within a pagefault_disable()
1926 * section), this returns -EFAULT, and we want to resolve the user fault before
1929 * Typically this is meant to be used by the futex code.
1931 * The main difference with get_user_pages() is that this function will
1932 * unconditionally call handle_mm_fault() which will in turn perform all the
1933 * necessary SW fixup of the dirty and young bits in the PTE, while
1934 * handle_mm_fault() only guarantees to update these in the struct page.
1936 * This is important for some architectures where those bits also gate the
1937 * access permission to the page because they are maintained in software. On
1938 * such architectures, gup() will not be enough to make a subsequent access
1941 * This should be called with the mm_sem held for read.
1943 int fixup_user_fault(struct task_struct *tsk, struct mm_struct *mm,
1944 unsigned long address, unsigned int fault_flags)
1946 struct vm_area_struct *vma;
1947 vm_flags_t vm_flags;
1950 vma = find_extend_vma(mm, address);
1951 if (!vma || address < vma->vm_start)
1954 vm_flags = (fault_flags & FAULT_FLAG_WRITE) ? VM_WRITE : VM_READ;
1955 if (!(vm_flags & vma->vm_flags))
1958 ret = handle_mm_fault(mm, vma, address, fault_flags);
1959 if (ret & VM_FAULT_ERROR) {
1960 if (ret & VM_FAULT_OOM)
1962 if (ret & (VM_FAULT_HWPOISON | VM_FAULT_HWPOISON_LARGE))
1964 if (ret & VM_FAULT_SIGBUS)
1969 if (ret & VM_FAULT_MAJOR)
1978 * get_user_pages() - pin user pages in memory
1979 * @tsk: the task_struct to use for page fault accounting, or
1980 * NULL if faults are not to be recorded.
1981 * @mm: mm_struct of target mm
1982 * @start: starting user address
1983 * @nr_pages: number of pages from start to pin
1984 * @write: whether pages will be written to by the caller
1985 * @force: whether to force write access even if user mapping is
1986 * readonly. This will result in the page being COWed even
1987 * in MAP_SHARED mappings. You do not want this.
1988 * @pages: array that receives pointers to the pages pinned.
1989 * Should be at least nr_pages long. Or NULL, if caller
1990 * only intends to ensure the pages are faulted in.
1991 * @vmas: array of pointers to vmas corresponding to each page.
1992 * Or NULL if the caller does not require them.
1994 * Returns number of pages pinned. This may be fewer than the number
1995 * requested. If nr_pages is 0 or negative, returns 0. If no pages
1996 * were pinned, returns -errno. Each page returned must be released
1997 * with a put_page() call when it is finished with. vmas will only
1998 * remain valid while mmap_sem is held.
2000 * Must be called with mmap_sem held for read or write.
2002 * get_user_pages walks a process's page tables and takes a reference to
2003 * each struct page that each user address corresponds to at a given
2004 * instant. That is, it takes the page that would be accessed if a user
2005 * thread accesses the given user virtual address at that instant.
2007 * This does not guarantee that the page exists in the user mappings when
2008 * get_user_pages returns, and there may even be a completely different
2009 * page there in some cases (eg. if mmapped pagecache has been invalidated
2010 * and subsequently re faulted). However it does guarantee that the page
2011 * won't be freed completely. And mostly callers simply care that the page
2012 * contains data that was valid *at some point in time*. Typically, an IO
2013 * or similar operation cannot guarantee anything stronger anyway because
2014 * locks can't be held over the syscall boundary.
2016 * If write=0, the page must not be written to. If the page is written to,
2017 * set_page_dirty (or set_page_dirty_lock, as appropriate) must be called
2018 * after the page is finished with, and before put_page is called.
2020 * get_user_pages is typically used for fewer-copy IO operations, to get a
2021 * handle on the memory by some means other than accesses via the user virtual
2022 * addresses. The pages may be submitted for DMA to devices or accessed via
2023 * their kernel linear mapping (via the kmap APIs). Care should be taken to
2024 * use the correct cache flushing APIs.
2026 * See also get_user_pages_fast, for performance critical applications.
2028 long get_user_pages(struct task_struct *tsk, struct mm_struct *mm,
2029 unsigned long start, unsigned long nr_pages, int write,
2030 int force, struct page **pages, struct vm_area_struct **vmas)
2032 int flags = FOLL_TOUCH;
2037 flags |= FOLL_WRITE;
2039 flags |= FOLL_FORCE;
2041 return __get_user_pages(tsk, mm, start, nr_pages, flags, pages, vmas,
2044 EXPORT_SYMBOL(get_user_pages);
2047 * get_dump_page() - pin user page in memory while writing it to core dump
2048 * @addr: user address
2050 * Returns struct page pointer of user page pinned for dump,
2051 * to be freed afterwards by page_cache_release() or put_page().
2053 * Returns NULL on any kind of failure - a hole must then be inserted into
2054 * the corefile, to preserve alignment with its headers; and also returns
2055 * NULL wherever the ZERO_PAGE, or an anonymous pte_none, has been found -
2056 * allowing a hole to be left in the corefile to save diskspace.
2058 * Called without mmap_sem, but after all other threads have been killed.
2060 #ifdef CONFIG_ELF_CORE
2061 struct page *get_dump_page(unsigned long addr)
2063 struct vm_area_struct *vma;
2066 if (__get_user_pages(current, current->mm, addr, 1,
2067 FOLL_FORCE | FOLL_DUMP | FOLL_GET, &page, &vma,
2070 flush_cache_page(vma, addr, page_to_pfn(page));
2073 #endif /* CONFIG_ELF_CORE */
2075 pte_t *__get_locked_pte(struct mm_struct *mm, unsigned long addr,
2078 pgd_t * pgd = pgd_offset(mm, addr);
2079 pud_t * pud = pud_alloc(mm, pgd, addr);
2081 pmd_t * pmd = pmd_alloc(mm, pud, addr);
2083 VM_BUG_ON(pmd_trans_huge(*pmd));
2084 return pte_alloc_map_lock(mm, pmd, addr, ptl);
2091 * This is the old fallback for page remapping.
2093 * For historical reasons, it only allows reserved pages. Only
2094 * old drivers should use this, and they needed to mark their
2095 * pages reserved for the old functions anyway.
2097 static int insert_page(struct vm_area_struct *vma, unsigned long addr,
2098 struct page *page, pgprot_t prot)
2100 struct mm_struct *mm = vma->vm_mm;
2109 flush_dcache_page(page);
2110 pte = get_locked_pte(mm, addr, &ptl);
2114 if (!pte_none(*pte))
2117 /* Ok, finally just insert the thing.. */
2119 inc_mm_counter_fast(mm, MM_FILEPAGES);
2120 page_add_file_rmap(page);
2121 set_pte_at(mm, addr, pte, mk_pte(page, prot));
2124 pte_unmap_unlock(pte, ptl);
2127 pte_unmap_unlock(pte, ptl);
2133 * vm_insert_page - insert single page into user vma
2134 * @vma: user vma to map to
2135 * @addr: target user address of this page
2136 * @page: source kernel page
2138 * This allows drivers to insert individual pages they've allocated
2141 * The page has to be a nice clean _individual_ kernel allocation.
2142 * If you allocate a compound page, you need to have marked it as
2143 * such (__GFP_COMP), or manually just split the page up yourself
2144 * (see split_page()).
2146 * NOTE! Traditionally this was done with "remap_pfn_range()" which
2147 * took an arbitrary page protection parameter. This doesn't allow
2148 * that. Your vma protection will have to be set up correctly, which
2149 * means that if you want a shared writable mapping, you'd better
2150 * ask for a shared writable mapping!
2152 * The page does not need to be reserved.
2154 * Usually this function is called from f_op->mmap() handler
2155 * under mm->mmap_sem write-lock, so it can change vma->vm_flags.
2156 * Caller must set VM_MIXEDMAP on vma if it wants to call this
2157 * function from other places, for example from page-fault handler.
2159 int vm_insert_page(struct vm_area_struct *vma, unsigned long addr,
2162 if (addr < vma->vm_start || addr >= vma->vm_end)
2164 if (!page_count(page))
2166 if (!(vma->vm_flags & VM_MIXEDMAP)) {
2167 BUG_ON(down_read_trylock(&vma->vm_mm->mmap_sem));
2168 BUG_ON(vma->vm_flags & VM_PFNMAP);
2169 vma->vm_flags |= VM_MIXEDMAP;
2171 return insert_page(vma, addr, page, vma->vm_page_prot);
2173 EXPORT_SYMBOL(vm_insert_page);
2175 static int insert_pfn(struct vm_area_struct *vma, unsigned long addr,
2176 unsigned long pfn, pgprot_t prot)
2178 struct mm_struct *mm = vma->vm_mm;
2184 pte = get_locked_pte(mm, addr, &ptl);
2188 if (!pte_none(*pte))
2191 /* Ok, finally just insert the thing.. */
2192 entry = pte_mkspecial(pfn_pte(pfn, prot));
2193 set_pte_at(mm, addr, pte, entry);
2194 update_mmu_cache(vma, addr, pte); /* XXX: why not for insert_page? */
2198 pte_unmap_unlock(pte, ptl);
2204 * vm_insert_pfn - insert single pfn into user vma
2205 * @vma: user vma to map to
2206 * @addr: target user address of this page
2207 * @pfn: source kernel pfn
2209 * Similar to vm_insert_page, this allows drivers to insert individual pages
2210 * they've allocated into a user vma. Same comments apply.
2212 * This function should only be called from a vm_ops->fault handler, and
2213 * in that case the handler should return NULL.
2215 * vma cannot be a COW mapping.
2217 * As this is called only for pages that do not currently exist, we
2218 * do not need to flush old virtual caches or the TLB.
2220 int vm_insert_pfn(struct vm_area_struct *vma, unsigned long addr,
2224 pgprot_t pgprot = vma->vm_page_prot;
2226 * Technically, architectures with pte_special can avoid all these
2227 * restrictions (same for remap_pfn_range). However we would like
2228 * consistency in testing and feature parity among all, so we should
2229 * try to keep these invariants in place for everybody.
2231 BUG_ON(!(vma->vm_flags & (VM_PFNMAP|VM_MIXEDMAP)));
2232 BUG_ON((vma->vm_flags & (VM_PFNMAP|VM_MIXEDMAP)) ==
2233 (VM_PFNMAP|VM_MIXEDMAP));
2234 BUG_ON((vma->vm_flags & VM_PFNMAP) && is_cow_mapping(vma->vm_flags));
2235 BUG_ON((vma->vm_flags & VM_MIXEDMAP) && pfn_valid(pfn));
2237 if (addr < vma->vm_start || addr >= vma->vm_end)
2239 if (track_pfn_insert(vma, &pgprot, pfn))
2242 ret = insert_pfn(vma, addr, pfn, pgprot);
2246 EXPORT_SYMBOL(vm_insert_pfn);
2248 int vm_insert_mixed(struct vm_area_struct *vma, unsigned long addr,
2251 BUG_ON(!(vma->vm_flags & VM_MIXEDMAP));
2253 if (addr < vma->vm_start || addr >= vma->vm_end)
2257 * If we don't have pte special, then we have to use the pfn_valid()
2258 * based VM_MIXEDMAP scheme (see vm_normal_page), and thus we *must*
2259 * refcount the page if pfn_valid is true (hence insert_page rather
2260 * than insert_pfn). If a zero_pfn were inserted into a VM_MIXEDMAP
2261 * without pte special, it would there be refcounted as a normal page.
2263 if (!HAVE_PTE_SPECIAL && pfn_valid(pfn)) {
2266 page = pfn_to_page(pfn);
2267 return insert_page(vma, addr, page, vma->vm_page_prot);
2269 return insert_pfn(vma, addr, pfn, vma->vm_page_prot);
2271 EXPORT_SYMBOL(vm_insert_mixed);
2274 * maps a range of physical memory into the requested pages. the old
2275 * mappings are removed. any references to nonexistent pages results
2276 * in null mappings (currently treated as "copy-on-access")
2278 static int remap_pte_range(struct mm_struct *mm, pmd_t *pmd,
2279 unsigned long addr, unsigned long end,
2280 unsigned long pfn, pgprot_t prot)
2285 pte = pte_alloc_map_lock(mm, pmd, addr, &ptl);
2288 arch_enter_lazy_mmu_mode();
2290 BUG_ON(!pte_none(*pte));
2291 set_pte_at(mm, addr, pte, pte_mkspecial(pfn_pte(pfn, prot)));
2293 } while (pte++, addr += PAGE_SIZE, addr != end);
2294 arch_leave_lazy_mmu_mode();
2295 pte_unmap_unlock(pte - 1, ptl);
2299 static inline int remap_pmd_range(struct mm_struct *mm, pud_t *pud,
2300 unsigned long addr, unsigned long end,
2301 unsigned long pfn, pgprot_t prot)
2306 pfn -= addr >> PAGE_SHIFT;
2307 pmd = pmd_alloc(mm, pud, addr);
2310 VM_BUG_ON(pmd_trans_huge(*pmd));
2312 next = pmd_addr_end(addr, end);
2313 if (remap_pte_range(mm, pmd, addr, next,
2314 pfn + (addr >> PAGE_SHIFT), prot))
2316 } while (pmd++, addr = next, addr != end);
2320 static inline int remap_pud_range(struct mm_struct *mm, pgd_t *pgd,
2321 unsigned long addr, unsigned long end,
2322 unsigned long pfn, pgprot_t prot)
2327 pfn -= addr >> PAGE_SHIFT;
2328 pud = pud_alloc(mm, pgd, addr);
2332 next = pud_addr_end(addr, end);
2333 if (remap_pmd_range(mm, pud, addr, next,
2334 pfn + (addr >> PAGE_SHIFT), prot))
2336 } while (pud++, addr = next, addr != end);
2341 * remap_pfn_range - remap kernel memory to userspace
2342 * @vma: user vma to map to
2343 * @addr: target user address to start at
2344 * @pfn: physical address of kernel memory
2345 * @size: size of map area
2346 * @prot: page protection flags for this mapping
2348 * Note: this is only safe if the mm semaphore is held when called.
2350 int remap_pfn_range(struct vm_area_struct *vma, unsigned long addr,
2351 unsigned long pfn, unsigned long size, pgprot_t prot)
2355 unsigned long end = addr + PAGE_ALIGN(size);
2356 struct mm_struct *mm = vma->vm_mm;
2360 * Physically remapped pages are special. Tell the
2361 * rest of the world about it:
2362 * VM_IO tells people not to look at these pages
2363 * (accesses can have side effects).
2364 * VM_PFNMAP tells the core MM that the base pages are just
2365 * raw PFN mappings, and do not have a "struct page" associated
2368 * Disable vma merging and expanding with mremap().
2370 * Omit vma from core dump, even when VM_IO turned off.
2372 * There's a horrible special case to handle copy-on-write
2373 * behaviour that some programs depend on. We mark the "original"
2374 * un-COW'ed pages by matching them up with "vma->vm_pgoff".
2375 * See vm_normal_page() for details.
2377 if (is_cow_mapping(vma->vm_flags)) {
2378 if (addr != vma->vm_start || end != vma->vm_end)
2380 vma->vm_pgoff = pfn;
2383 err = track_pfn_remap(vma, &prot, pfn, addr, PAGE_ALIGN(size));
2387 vma->vm_flags |= VM_IO | VM_PFNMAP | VM_DONTEXPAND | VM_DONTDUMP;
2389 BUG_ON(addr >= end);
2390 pfn -= addr >> PAGE_SHIFT;
2391 pgd = pgd_offset(mm, addr);
2392 flush_cache_range(vma, addr, end);
2394 next = pgd_addr_end(addr, end);
2395 err = remap_pud_range(mm, pgd, addr, next,
2396 pfn + (addr >> PAGE_SHIFT), prot);
2399 } while (pgd++, addr = next, addr != end);
2402 untrack_pfn(vma, pfn, PAGE_ALIGN(size));
2406 EXPORT_SYMBOL(remap_pfn_range);
2409 * vm_iomap_memory - remap memory to userspace
2410 * @vma: user vma to map to
2411 * @start: start of area
2412 * @len: size of area
2414 * This is a simplified io_remap_pfn_range() for common driver use. The
2415 * driver just needs to give us the physical memory range to be mapped,
2416 * we'll figure out the rest from the vma information.
2418 * NOTE! Some drivers might want to tweak vma->vm_page_prot first to get
2419 * whatever write-combining details or similar.
2421 int vm_iomap_memory(struct vm_area_struct *vma, phys_addr_t start, unsigned long len)
2423 unsigned long vm_len, pfn, pages;
2425 /* Check that the physical memory area passed in looks valid */
2426 if (start + len < start)
2429 * You *really* shouldn't map things that aren't page-aligned,
2430 * but we've historically allowed it because IO memory might
2431 * just have smaller alignment.
2433 len += start & ~PAGE_MASK;
2434 pfn = start >> PAGE_SHIFT;
2435 pages = (len + ~PAGE_MASK) >> PAGE_SHIFT;
2436 if (pfn + pages < pfn)
2439 /* We start the mapping 'vm_pgoff' pages into the area */
2440 if (vma->vm_pgoff > pages)
2442 pfn += vma->vm_pgoff;
2443 pages -= vma->vm_pgoff;
2445 /* Can we fit all of the mapping? */
2446 vm_len = vma->vm_end - vma->vm_start;
2447 if (vm_len >> PAGE_SHIFT > pages)
2450 /* Ok, let it rip */
2451 return io_remap_pfn_range(vma, vma->vm_start, pfn, vm_len, vma->vm_page_prot);
2453 EXPORT_SYMBOL(vm_iomap_memory);
2455 static int apply_to_pte_range(struct mm_struct *mm, pmd_t *pmd,
2456 unsigned long addr, unsigned long end,
2457 pte_fn_t fn, void *data)
2462 spinlock_t *uninitialized_var(ptl);
2464 pte = (mm == &init_mm) ?
2465 pte_alloc_kernel(pmd, addr) :
2466 pte_alloc_map_lock(mm, pmd, addr, &ptl);
2470 BUG_ON(pmd_huge(*pmd));
2472 arch_enter_lazy_mmu_mode();
2474 token = pmd_pgtable(*pmd);
2477 err = fn(pte++, token, addr, data);
2480 } while (addr += PAGE_SIZE, addr != end);
2482 arch_leave_lazy_mmu_mode();
2485 pte_unmap_unlock(pte-1, ptl);
2489 static int apply_to_pmd_range(struct mm_struct *mm, pud_t *pud,
2490 unsigned long addr, unsigned long end,
2491 pte_fn_t fn, void *data)
2497 BUG_ON(pud_huge(*pud));
2499 pmd = pmd_alloc(mm, pud, addr);
2503 next = pmd_addr_end(addr, end);
2504 err = apply_to_pte_range(mm, pmd, addr, next, fn, data);
2507 } while (pmd++, addr = next, addr != end);
2511 static int apply_to_pud_range(struct mm_struct *mm, pgd_t *pgd,
2512 unsigned long addr, unsigned long end,
2513 pte_fn_t fn, void *data)
2519 pud = pud_alloc(mm, pgd, addr);
2523 next = pud_addr_end(addr, end);
2524 err = apply_to_pmd_range(mm, pud, addr, next, fn, data);
2527 } while (pud++, addr = next, addr != end);
2532 * Scan a region of virtual memory, filling in page tables as necessary
2533 * and calling a provided function on each leaf page table.
2535 int apply_to_page_range(struct mm_struct *mm, unsigned long addr,
2536 unsigned long size, pte_fn_t fn, void *data)
2540 unsigned long end = addr + size;
2543 BUG_ON(addr >= end);
2544 pgd = pgd_offset(mm, addr);
2546 next = pgd_addr_end(addr, end);
2547 err = apply_to_pud_range(mm, pgd, addr, next, fn, data);
2550 } while (pgd++, addr = next, addr != end);
2554 EXPORT_SYMBOL_GPL(apply_to_page_range);
2557 * handle_pte_fault chooses page fault handler according to an entry
2558 * which was read non-atomically. Before making any commitment, on
2559 * those architectures or configurations (e.g. i386 with PAE) which
2560 * might give a mix of unmatched parts, do_swap_page and do_nonlinear_fault
2561 * must check under lock before unmapping the pte and proceeding
2562 * (but do_wp_page is only called after already making such a check;
2563 * and do_anonymous_page can safely check later on).
2565 static inline int pte_unmap_same(struct mm_struct *mm, pmd_t *pmd,
2566 pte_t *page_table, pte_t orig_pte)
2569 #if defined(CONFIG_SMP) || defined(CONFIG_PREEMPT)
2570 if (sizeof(pte_t) > sizeof(unsigned long)) {
2571 spinlock_t *ptl = pte_lockptr(mm, pmd);
2573 same = pte_same(*page_table, orig_pte);
2577 pte_unmap(page_table);
2581 static inline void cow_user_page(struct page *dst, struct page *src, unsigned long va, struct vm_area_struct *vma)
2584 * If the source page was a PFN mapping, we don't have
2585 * a "struct page" for it. We do a best-effort copy by
2586 * just copying from the original user address. If that
2587 * fails, we just zero-fill it. Live with it.
2589 if (unlikely(!src)) {
2590 void *kaddr = kmap_atomic(dst);
2591 void __user *uaddr = (void __user *)(va & PAGE_MASK);
2594 * This really shouldn't fail, because the page is there
2595 * in the page tables. But it might just be unreadable,
2596 * in which case we just give up and fill the result with
2599 if (__copy_from_user_inatomic(kaddr, uaddr, PAGE_SIZE))
2601 kunmap_atomic(kaddr);
2602 flush_dcache_page(dst);
2604 copy_user_highpage(dst, src, va, vma);
2608 * This routine handles present pages, when users try to write
2609 * to a shared page. It is done by copying the page to a new address
2610 * and decrementing the shared-page counter for the old page.
2612 * Note that this routine assumes that the protection checks have been
2613 * done by the caller (the low-level page fault routine in most cases).
2614 * Thus we can safely just mark it writable once we've done any necessary
2617 * We also mark the page dirty at this point even though the page will
2618 * change only once the write actually happens. This avoids a few races,
2619 * and potentially makes it more efficient.
2621 * We enter with non-exclusive mmap_sem (to exclude vma changes,
2622 * but allow concurrent faults), with pte both mapped and locked.
2623 * We return with mmap_sem still held, but pte unmapped and unlocked.
2625 static int do_wp_page(struct mm_struct *mm, struct vm_area_struct *vma,
2626 unsigned long address, pte_t *page_table, pmd_t *pmd,
2627 spinlock_t *ptl, pte_t orig_pte)
2630 struct page *old_page, *new_page = NULL;
2633 int page_mkwrite = 0;
2634 struct page *dirty_page = NULL;
2635 unsigned long mmun_start = 0; /* For mmu_notifiers */
2636 unsigned long mmun_end = 0; /* For mmu_notifiers */
2638 old_page = vm_normal_page(vma, address, orig_pte);
2641 * VM_MIXEDMAP !pfn_valid() case
2643 * We should not cow pages in a shared writeable mapping.
2644 * Just mark the pages writable as we can't do any dirty
2645 * accounting on raw pfn maps.
2647 if ((vma->vm_flags & (VM_WRITE|VM_SHARED)) ==
2648 (VM_WRITE|VM_SHARED))
2654 * Take out anonymous pages first, anonymous shared vmas are
2655 * not dirty accountable.
2657 if (PageAnon(old_page) && !PageKsm(old_page)) {
2658 if (!trylock_page(old_page)) {
2659 page_cache_get(old_page);
2660 pte_unmap_unlock(page_table, ptl);
2661 lock_page(old_page);
2662 page_table = pte_offset_map_lock(mm, pmd, address,
2664 if (!pte_same(*page_table, orig_pte)) {
2665 unlock_page(old_page);
2668 page_cache_release(old_page);
2670 if (reuse_swap_page(old_page)) {
2672 * The page is all ours. Move it to our anon_vma so
2673 * the rmap code will not search our parent or siblings.
2674 * Protected against the rmap code by the page lock.
2676 page_move_anon_rmap(old_page, vma, address);
2677 unlock_page(old_page);
2680 unlock_page(old_page);
2681 } else if (unlikely((vma->vm_flags & (VM_WRITE|VM_SHARED)) ==
2682 (VM_WRITE|VM_SHARED))) {
2684 * Only catch write-faults on shared writable pages,
2685 * read-only shared pages can get COWed by
2686 * get_user_pages(.write=1, .force=1).
2688 if (vma->vm_ops && vma->vm_ops->page_mkwrite) {
2689 struct vm_fault vmf;
2692 vmf.virtual_address = (void __user *)(address &
2694 vmf.pgoff = old_page->index;
2695 vmf.flags = FAULT_FLAG_WRITE|FAULT_FLAG_MKWRITE;
2696 vmf.page = old_page;
2699 * Notify the address space that the page is about to
2700 * become writable so that it can prohibit this or wait
2701 * for the page to get into an appropriate state.
2703 * We do this without the lock held, so that it can
2704 * sleep if it needs to.
2706 page_cache_get(old_page);
2707 pte_unmap_unlock(page_table, ptl);
2709 tmp = vma->vm_ops->page_mkwrite(vma, &vmf);
2711 (VM_FAULT_ERROR | VM_FAULT_NOPAGE))) {
2713 goto unwritable_page;
2715 if (unlikely(!(tmp & VM_FAULT_LOCKED))) {
2716 lock_page(old_page);
2717 if (!old_page->mapping) {
2718 ret = 0; /* retry the fault */
2719 unlock_page(old_page);
2720 goto unwritable_page;
2723 VM_BUG_ON(!PageLocked(old_page));
2726 * Since we dropped the lock we need to revalidate
2727 * the PTE as someone else may have changed it. If
2728 * they did, we just return, as we can count on the
2729 * MMU to tell us if they didn't also make it writable.
2731 page_table = pte_offset_map_lock(mm, pmd, address,
2733 if (!pte_same(*page_table, orig_pte)) {
2734 unlock_page(old_page);
2740 dirty_page = old_page;
2741 get_page(dirty_page);
2744 flush_cache_page(vma, address, pte_pfn(orig_pte));
2745 entry = pte_mkyoung(orig_pte);
2746 entry = maybe_mkwrite(pte_mkdirty(entry), vma);
2747 if (ptep_set_access_flags(vma, address, page_table, entry,1))
2748 update_mmu_cache(vma, address, page_table);
2749 pte_unmap_unlock(page_table, ptl);
2750 ret |= VM_FAULT_WRITE;
2756 * Yes, Virginia, this is actually required to prevent a race
2757 * with clear_page_dirty_for_io() from clearing the page dirty
2758 * bit after it clear all dirty ptes, but before a racing
2759 * do_wp_page installs a dirty pte.
2761 * __do_fault is protected similarly.
2763 if (!page_mkwrite) {
2764 wait_on_page_locked(dirty_page);
2765 set_page_dirty_balance(dirty_page, page_mkwrite);
2766 /* file_update_time outside page_lock */
2768 file_update_time(vma->vm_file);
2770 put_page(dirty_page);
2772 struct address_space *mapping = dirty_page->mapping;
2774 set_page_dirty(dirty_page);
2775 unlock_page(dirty_page);
2776 page_cache_release(dirty_page);
2779 * Some device drivers do not set page.mapping
2780 * but still dirty their pages
2782 balance_dirty_pages_ratelimited(mapping);
2790 * Ok, we need to copy. Oh, well..
2792 page_cache_get(old_page);
2794 pte_unmap_unlock(page_table, ptl);
2796 if (unlikely(anon_vma_prepare(vma)))
2799 if (is_zero_pfn(pte_pfn(orig_pte))) {
2800 new_page = alloc_zeroed_user_highpage_movable(vma, address);
2804 new_page = alloc_page_vma(GFP_HIGHUSER_MOVABLE, vma, address);
2807 cow_user_page(new_page, old_page, address, vma);
2809 __SetPageUptodate(new_page);
2811 if (mem_cgroup_newpage_charge(new_page, mm, GFP_KERNEL))
2814 mmun_start = address & PAGE_MASK;
2815 mmun_end = mmun_start + PAGE_SIZE;
2816 mmu_notifier_invalidate_range_start(mm, mmun_start, mmun_end);
2819 * Re-check the pte - we dropped the lock
2821 page_table = pte_offset_map_lock(mm, pmd, address, &ptl);
2822 if (likely(pte_same(*page_table, orig_pte))) {
2824 if (!PageAnon(old_page)) {
2825 dec_mm_counter_fast(mm, MM_FILEPAGES);
2826 inc_mm_counter_fast(mm, MM_ANONPAGES);
2829 inc_mm_counter_fast(mm, MM_ANONPAGES);
2830 flush_cache_page(vma, address, pte_pfn(orig_pte));
2831 entry = mk_pte(new_page, vma->vm_page_prot);
2832 entry = maybe_mkwrite(pte_mkdirty(entry), vma);
2834 * Clear the pte entry and flush it first, before updating the
2835 * pte with the new entry. This will avoid a race condition
2836 * seen in the presence of one thread doing SMC and another
2839 ptep_clear_flush(vma, address, page_table);
2840 page_add_new_anon_rmap(new_page, vma, address);
2842 * We call the notify macro here because, when using secondary
2843 * mmu page tables (such as kvm shadow page tables), we want the
2844 * new page to be mapped directly into the secondary page table.
2846 set_pte_at_notify(mm, address, page_table, entry);
2847 update_mmu_cache(vma, address, page_table);
2850 * Only after switching the pte to the new page may
2851 * we remove the mapcount here. Otherwise another
2852 * process may come and find the rmap count decremented
2853 * before the pte is switched to the new page, and
2854 * "reuse" the old page writing into it while our pte
2855 * here still points into it and can be read by other
2858 * The critical issue is to order this
2859 * page_remove_rmap with the ptp_clear_flush above.
2860 * Those stores are ordered by (if nothing else,)
2861 * the barrier present in the atomic_add_negative
2862 * in page_remove_rmap.
2864 * Then the TLB flush in ptep_clear_flush ensures that
2865 * no process can access the old page before the
2866 * decremented mapcount is visible. And the old page
2867 * cannot be reused until after the decremented
2868 * mapcount is visible. So transitively, TLBs to
2869 * old page will be flushed before it can be reused.
2871 page_remove_rmap(old_page);
2874 /* Free the old page.. */
2875 new_page = old_page;
2876 ret |= VM_FAULT_WRITE;
2878 mem_cgroup_uncharge_page(new_page);
2881 page_cache_release(new_page);
2883 pte_unmap_unlock(page_table, ptl);
2884 if (mmun_end > mmun_start)
2885 mmu_notifier_invalidate_range_end(mm, mmun_start, mmun_end);
2888 * Don't let another task, with possibly unlocked vma,
2889 * keep the mlocked page.
2891 if ((ret & VM_FAULT_WRITE) && (vma->vm_flags & VM_LOCKED)) {
2892 lock_page(old_page); /* LRU manipulation */
2893 munlock_vma_page(old_page);
2894 unlock_page(old_page);
2896 page_cache_release(old_page);
2900 page_cache_release(new_page);
2903 page_cache_release(old_page);
2904 return VM_FAULT_OOM;
2907 page_cache_release(old_page);
2911 static void unmap_mapping_range_vma(struct vm_area_struct *vma,
2912 unsigned long start_addr, unsigned long end_addr,
2913 struct zap_details *details)
2915 zap_page_range_single(vma, start_addr, end_addr - start_addr, details);
2918 static inline void unmap_mapping_range_tree(struct rb_root *root,
2919 struct zap_details *details)
2921 struct vm_area_struct *vma;
2922 pgoff_t vba, vea, zba, zea;
2924 vma_interval_tree_foreach(vma, root,
2925 details->first_index, details->last_index) {
2927 vba = vma->vm_pgoff;
2928 vea = vba + ((vma->vm_end - vma->vm_start) >> PAGE_SHIFT) - 1;
2929 /* Assume for now that PAGE_CACHE_SHIFT == PAGE_SHIFT */
2930 zba = details->first_index;
2933 zea = details->last_index;
2937 unmap_mapping_range_vma(vma,
2938 ((zba - vba) << PAGE_SHIFT) + vma->vm_start,
2939 ((zea - vba + 1) << PAGE_SHIFT) + vma->vm_start,
2944 static inline void unmap_mapping_range_list(struct list_head *head,
2945 struct zap_details *details)
2947 struct vm_area_struct *vma;
2950 * In nonlinear VMAs there is no correspondence between virtual address
2951 * offset and file offset. So we must perform an exhaustive search
2952 * across *all* the pages in each nonlinear VMA, not just the pages
2953 * whose virtual address lies outside the file truncation point.
2955 list_for_each_entry(vma, head, shared.nonlinear) {
2956 details->nonlinear_vma = vma;
2957 unmap_mapping_range_vma(vma, vma->vm_start, vma->vm_end, details);
2962 * unmap_mapping_range - unmap the portion of all mmaps in the specified address_space corresponding to the specified page range in the underlying file.
2963 * @mapping: the address space containing mmaps to be unmapped.
2964 * @holebegin: byte in first page to unmap, relative to the start of
2965 * the underlying file. This will be rounded down to a PAGE_SIZE
2966 * boundary. Note that this is different from truncate_pagecache(), which
2967 * must keep the partial page. In contrast, we must get rid of
2969 * @holelen: size of prospective hole in bytes. This will be rounded
2970 * up to a PAGE_SIZE boundary. A holelen of zero truncates to the
2972 * @even_cows: 1 when truncating a file, unmap even private COWed pages;
2973 * but 0 when invalidating pagecache, don't throw away private data.
2975 void unmap_mapping_range(struct address_space *mapping,
2976 loff_t const holebegin, loff_t const holelen, int even_cows)
2978 struct zap_details details;
2979 pgoff_t hba = holebegin >> PAGE_SHIFT;
2980 pgoff_t hlen = (holelen + PAGE_SIZE - 1) >> PAGE_SHIFT;
2982 /* Check for overflow. */
2983 if (sizeof(holelen) > sizeof(hlen)) {
2985 (holebegin + holelen + PAGE_SIZE - 1) >> PAGE_SHIFT;
2986 if (holeend & ~(long long)ULONG_MAX)
2987 hlen = ULONG_MAX - hba + 1;
2990 details.check_mapping = even_cows? NULL: mapping;
2991 details.nonlinear_vma = NULL;
2992 details.first_index = hba;
2993 details.last_index = hba + hlen - 1;
2994 if (details.last_index < details.first_index)
2995 details.last_index = ULONG_MAX;
2998 mutex_lock(&mapping->i_mmap_mutex);
2999 if (unlikely(!RB_EMPTY_ROOT(&mapping->i_mmap)))
3000 unmap_mapping_range_tree(&mapping->i_mmap, &details);
3001 if (unlikely(!list_empty(&mapping->i_mmap_nonlinear)))
3002 unmap_mapping_range_list(&mapping->i_mmap_nonlinear, &details);
3003 mutex_unlock(&mapping->i_mmap_mutex);
3005 EXPORT_SYMBOL(unmap_mapping_range);
3008 #include <linux/module.h>
3009 // always try to free swap in zram swap case
3010 static int keep_to_free_swap = 1;
3011 module_param_named(keep_to_free_swap,keep_to_free_swap, int, S_IRUGO | S_IWUSR);
3016 * We enter with non-exclusive mmap_sem (to exclude vma changes,
3017 * but allow concurrent faults), and pte mapped but not yet locked.
3018 * We return with mmap_sem still held, but pte unmapped and unlocked.
3020 static int do_swap_page(struct mm_struct *mm, struct vm_area_struct *vma,
3021 unsigned long address, pte_t *page_table, pmd_t *pmd,
3022 unsigned int flags, pte_t orig_pte)
3025 struct page *page, *swapcache;
3029 struct mem_cgroup *ptr;
3033 if (!pte_unmap_same(mm, pmd, page_table, orig_pte))
3036 entry = pte_to_swp_entry(orig_pte);
3037 if (unlikely(non_swap_entry(entry))) {
3038 if (is_migration_entry(entry)) {
3041 * FIXME: mszyprow: cruel, brute-force method for
3042 * letting cma/migration to finish it's job without
3043 * stealing the lock migration_entry_wait() and creating
3044 * a live-lock on the faulted page
3045 * (page->_count == 2 migration failure issue)
3049 migration_entry_wait(mm, pmd, address);
3050 } else if (is_hwpoison_entry(entry)) {
3051 ret = VM_FAULT_HWPOISON;
3053 print_bad_pte(vma, address, orig_pte, NULL);
3054 ret = VM_FAULT_SIGBUS;
3058 delayacct_set_flag(DELAYACCT_PF_SWAPIN);
3059 page = lookup_swap_cache(entry);
3061 page = swapin_readahead(entry,
3062 GFP_HIGHUSER_MOVABLE, vma, address);
3065 * Back out if somebody else faulted in this pte
3066 * while we released the pte lock.
3068 page_table = pte_offset_map_lock(mm, pmd, address, &ptl);
3069 if (likely(pte_same(*page_table, orig_pte)))
3071 delayacct_clear_flag(DELAYACCT_PF_SWAPIN);
3075 /* Had to read the page from swap area: Major fault */
3076 ret = VM_FAULT_MAJOR;
3077 count_vm_event(PGMAJFAULT);
3078 mem_cgroup_count_vm_event(mm, PGMAJFAULT);
3079 } else if (PageHWPoison(page)) {
3081 * hwpoisoned dirty swapcache pages are kept for killing
3082 * owner processes (which may be unknown at hwpoison time)
3084 ret = VM_FAULT_HWPOISON;
3085 delayacct_clear_flag(DELAYACCT_PF_SWAPIN);
3091 locked = lock_page_or_retry(page, mm, flags);
3093 delayacct_clear_flag(DELAYACCT_PF_SWAPIN);
3095 ret |= VM_FAULT_RETRY;
3100 * Make sure try_to_free_swap or reuse_swap_page or swapoff did not
3101 * release the swapcache from under us. The page pin, and pte_same
3102 * test below, are not enough to exclude that. Even if it is still
3103 * swapcache, we need to check that the page's swap has not changed.
3105 if (unlikely(!PageSwapCache(page) || page_private(page) != entry.val))
3108 page = ksm_might_need_to_copy(page, vma, address);
3109 if (unlikely(!page)) {
3115 if (mem_cgroup_try_charge_swapin(mm, page, GFP_KERNEL, &ptr)) {
3121 * Back out if somebody else already faulted in this pte.
3123 page_table = pte_offset_map_lock(mm, pmd, address, &ptl);
3124 if (unlikely(!pte_same(*page_table, orig_pte)))
3127 if (unlikely(!PageUptodate(page))) {
3128 ret = VM_FAULT_SIGBUS;
3133 * The page isn't present yet, go ahead with the fault.
3135 * Be careful about the sequence of operations here.
3136 * To get its accounting right, reuse_swap_page() must be called
3137 * while the page is counted on swap but not yet in mapcount i.e.
3138 * before page_add_anon_rmap() and swap_free(); try_to_free_swap()
3139 * must be called after the swap_free(), or it will never succeed.
3140 * Because delete_from_swap_page() may be called by reuse_swap_page(),
3141 * mem_cgroup_commit_charge_swapin() may not be able to find swp_entry
3142 * in page->private. In this case, a record in swap_cgroup is silently
3143 * discarded at swap_free().
3146 inc_mm_counter_fast(mm, MM_ANONPAGES);
3147 dec_mm_counter_fast(mm, MM_SWAPENTS);
3148 pte = mk_pte(page, vma->vm_page_prot);
3149 if ((flags & FAULT_FLAG_WRITE) && reuse_swap_page(page)) {
3150 pte = maybe_mkwrite(pte_mkdirty(pte), vma);
3151 flags &= ~FAULT_FLAG_WRITE;
3152 ret |= VM_FAULT_WRITE;
3155 flush_icache_page(vma, page);
3156 set_pte_at(mm, address, page_table, pte);
3157 if (page == swapcache)
3158 do_page_add_anon_rmap(page, vma, address, exclusive);
3159 else /* ksm created a completely new copy */
3160 page_add_new_anon_rmap(page, vma, address);
3161 /* It's better to call commit-charge after rmap is established */
3162 mem_cgroup_commit_charge_swapin(page, ptr);
3167 if (keep_to_free_swap || vm_swap_full() || (vma->vm_flags & VM_LOCKED) || PageMlocked(page))
3169 if (vm_swap_full() || (vma->vm_flags & VM_LOCKED) || PageMlocked(page))
3171 try_to_free_swap(page);
3173 if (page != swapcache) {
3175 * Hold the lock to avoid the swap entry to be reused
3176 * until we take the PT lock for the pte_same() check
3177 * (to avoid false positives from pte_same). For
3178 * further safety release the lock after the swap_free
3179 * so that the swap count won't change under a
3180 * parallel locked swapcache.
3182 unlock_page(swapcache);
3183 page_cache_release(swapcache);
3186 if (flags & FAULT_FLAG_WRITE) {
3187 ret |= do_wp_page(mm, vma, address, page_table, pmd, ptl, pte);
3188 if (ret & VM_FAULT_ERROR)
3189 ret &= VM_FAULT_ERROR;
3193 /* No need to invalidate - it was non-present before */
3194 update_mmu_cache(vma, address, page_table);
3196 pte_unmap_unlock(page_table, ptl);
3200 mem_cgroup_cancel_charge_swapin(ptr);
3201 pte_unmap_unlock(page_table, ptl);
3205 page_cache_release(page);
3206 if (page != swapcache) {
3207 unlock_page(swapcache);
3208 page_cache_release(swapcache);
3214 * This is like a special single-page "expand_{down|up}wards()",
3215 * except we must first make sure that 'address{-|+}PAGE_SIZE'
3216 * doesn't hit another vma.
3218 static inline int check_stack_guard_page(struct vm_area_struct *vma, unsigned long address)
3220 address &= PAGE_MASK;
3221 if ((vma->vm_flags & VM_GROWSDOWN) && address == vma->vm_start) {
3222 struct vm_area_struct *prev = vma->vm_prev;
3225 * Is there a mapping abutting this one below?
3227 * That's only ok if it's the same stack mapping
3228 * that has gotten split..
3230 if (prev && prev->vm_end == address)
3231 return prev->vm_flags & VM_GROWSDOWN ? 0 : -ENOMEM;
3233 return expand_downwards(vma, address - PAGE_SIZE);
3235 if ((vma->vm_flags & VM_GROWSUP) && address + PAGE_SIZE == vma->vm_end) {
3236 struct vm_area_struct *next = vma->vm_next;
3238 /* As VM_GROWSDOWN but s/below/above/ */
3239 if (next && next->vm_start == address + PAGE_SIZE)
3240 return next->vm_flags & VM_GROWSUP ? 0 : -ENOMEM;
3242 return expand_upwards(vma, address + PAGE_SIZE);
3248 * We enter with non-exclusive mmap_sem (to exclude vma changes,
3249 * but allow concurrent faults), and pte mapped but not yet locked.
3250 * We return with mmap_sem still held, but pte unmapped and unlocked.
3252 static int do_anonymous_page(struct mm_struct *mm, struct vm_area_struct *vma,
3253 unsigned long address, pte_t *page_table, pmd_t *pmd,
3260 pte_unmap(page_table);
3262 /* Check if we need to add a guard page to the stack */
3263 if (check_stack_guard_page(vma, address) < 0)
3264 return VM_FAULT_SIGBUS;
3266 /* Use the zero-page for reads */
3267 if (!(flags & FAULT_FLAG_WRITE)) {
3268 entry = pte_mkspecial(pfn_pte(my_zero_pfn(address),
3269 vma->vm_page_prot));
3270 page_table = pte_offset_map_lock(mm, pmd, address, &ptl);
3271 if (!pte_none(*page_table))
3276 /* Allocate our own private page. */
3277 if (unlikely(anon_vma_prepare(vma)))
3279 page = alloc_zeroed_user_highpage_movable(vma, address);
3283 * The memory barrier inside __SetPageUptodate makes sure that
3284 * preceeding stores to the page contents become visible before
3285 * the set_pte_at() write.
3287 __SetPageUptodate(page);
3289 if (mem_cgroup_newpage_charge(page, mm, GFP_KERNEL))
3292 entry = mk_pte(page, vma->vm_page_prot);
3293 if (vma->vm_flags & VM_WRITE)
3294 entry = pte_mkwrite(pte_mkdirty(entry));
3296 page_table = pte_offset_map_lock(mm, pmd, address, &ptl);
3297 if (!pte_none(*page_table))
3300 inc_mm_counter_fast(mm, MM_ANONPAGES);
3301 page_add_new_anon_rmap(page, vma, address);
3303 set_pte_at(mm, address, page_table, entry);
3305 /* No need to invalidate - it was non-present before */
3306 update_mmu_cache(vma, address, page_table);
3308 pte_unmap_unlock(page_table, ptl);
3311 mem_cgroup_uncharge_page(page);
3312 page_cache_release(page);
3315 page_cache_release(page);
3317 return VM_FAULT_OOM;
3321 * __do_fault() tries to create a new page mapping. It aggressively
3322 * tries to share with existing pages, but makes a separate copy if
3323 * the FAULT_FLAG_WRITE is set in the flags parameter in order to avoid
3324 * the next page fault.
3326 * As this is called only for pages that do not currently exist, we
3327 * do not need to flush old virtual caches or the TLB.
3329 * We enter with non-exclusive mmap_sem (to exclude vma changes,
3330 * but allow concurrent faults), and pte neither mapped nor locked.
3331 * We return with mmap_sem still held, but pte unmapped and unlocked.
3333 static int __do_fault(struct mm_struct *mm, struct vm_area_struct *vma,
3334 unsigned long address, pmd_t *pmd,
3335 pgoff_t pgoff, unsigned int flags, pte_t orig_pte)
3340 struct page *cow_page;
3343 struct page *dirty_page = NULL;
3344 struct vm_fault vmf;
3346 int page_mkwrite = 0;
3349 * If we do COW later, allocate page befor taking lock_page()
3350 * on the file cache page. This will reduce lock holding time.
3352 if ((flags & FAULT_FLAG_WRITE) && !(vma->vm_flags & VM_SHARED)) {
3354 if (unlikely(anon_vma_prepare(vma)))
3355 return VM_FAULT_OOM;
3357 cow_page = alloc_page_vma(GFP_HIGHUSER_MOVABLE, vma, address);
3359 return VM_FAULT_OOM;
3361 if (mem_cgroup_newpage_charge(cow_page, mm, GFP_KERNEL)) {
3362 page_cache_release(cow_page);
3363 return VM_FAULT_OOM;
3368 vmf.virtual_address = (void __user *)(address & PAGE_MASK);
3373 ret = vma->vm_ops->fault(vma, &vmf);
3374 if (unlikely(ret & (VM_FAULT_ERROR | VM_FAULT_NOPAGE |
3378 if (unlikely(PageHWPoison(vmf.page))) {
3379 if (ret & VM_FAULT_LOCKED)
3380 unlock_page(vmf.page);
3381 ret = VM_FAULT_HWPOISON;
3386 * For consistency in subsequent calls, make the faulted page always
3389 if (unlikely(!(ret & VM_FAULT_LOCKED)))
3390 lock_page(vmf.page);
3392 VM_BUG_ON(!PageLocked(vmf.page));
3395 * Should we do an early C-O-W break?
3398 if (flags & FAULT_FLAG_WRITE) {
3399 if (!(vma->vm_flags & VM_SHARED)) {
3402 copy_user_highpage(page, vmf.page, address, vma);
3403 __SetPageUptodate(page);
3406 * If the page will be shareable, see if the backing
3407 * address space wants to know that the page is about
3408 * to become writable
3410 if (vma->vm_ops->page_mkwrite) {
3414 vmf.flags = FAULT_FLAG_WRITE|FAULT_FLAG_MKWRITE;
3415 tmp = vma->vm_ops->page_mkwrite(vma, &vmf);
3417 (VM_FAULT_ERROR | VM_FAULT_NOPAGE))) {
3419 goto unwritable_page;
3421 if (unlikely(!(tmp & VM_FAULT_LOCKED))) {
3423 if (!page->mapping) {
3424 ret = 0; /* retry the fault */
3426 goto unwritable_page;
3429 VM_BUG_ON(!PageLocked(page));
3436 page_table = pte_offset_map_lock(mm, pmd, address, &ptl);
3439 * This silly early PAGE_DIRTY setting removes a race
3440 * due to the bad i386 page protection. But it's valid
3441 * for other architectures too.
3443 * Note that if FAULT_FLAG_WRITE is set, we either now have
3444 * an exclusive copy of the page, or this is a shared mapping,
3445 * so we can make it writable and dirty to avoid having to
3446 * handle that later.
3448 /* Only go through if we didn't race with anybody else... */
3449 if (likely(pte_same(*page_table, orig_pte))) {
3450 flush_icache_page(vma, page);
3451 entry = mk_pte(page, vma->vm_page_prot);
3452 if (flags & FAULT_FLAG_WRITE)
3453 entry = maybe_mkwrite(pte_mkdirty(entry), vma);
3455 inc_mm_counter_fast(mm, MM_ANONPAGES);
3456 page_add_new_anon_rmap(page, vma, address);
3458 inc_mm_counter_fast(mm, MM_FILEPAGES);
3459 page_add_file_rmap(page);
3460 if (flags & FAULT_FLAG_WRITE) {
3462 get_page(dirty_page);
3465 set_pte_at(mm, address, page_table, entry);
3467 /* no need to invalidate: a not-present page won't be cached */
3468 update_mmu_cache(vma, address, page_table);
3471 mem_cgroup_uncharge_page(cow_page);
3473 page_cache_release(page);
3475 anon = 1; /* no anon but release faulted_page */
3478 pte_unmap_unlock(page_table, ptl);
3481 struct address_space *mapping = page->mapping;
3484 if (set_page_dirty(dirty_page))
3486 unlock_page(dirty_page);
3487 put_page(dirty_page);
3488 if ((dirtied || page_mkwrite) && mapping) {
3490 * Some device drivers do not set page.mapping but still
3493 balance_dirty_pages_ratelimited(mapping);
3496 /* file_update_time outside page_lock */
3497 if (vma->vm_file && !page_mkwrite)
3498 file_update_time(vma->vm_file);
3500 unlock_page(vmf.page);
3502 page_cache_release(vmf.page);
3508 page_cache_release(page);
3511 /* fs's fault handler get error */
3513 mem_cgroup_uncharge_page(cow_page);
3514 page_cache_release(cow_page);
3519 static int do_linear_fault(struct mm_struct *mm, struct vm_area_struct *vma,
3520 unsigned long address, pte_t *page_table, pmd_t *pmd,
3521 unsigned int flags, pte_t orig_pte)
3523 pgoff_t pgoff = (((address & PAGE_MASK)
3524 - vma->vm_start) >> PAGE_SHIFT) + vma->vm_pgoff;
3526 pte_unmap(page_table);
3527 return __do_fault(mm, vma, address, pmd, pgoff, flags, orig_pte);
3531 * Fault of a previously existing named mapping. Repopulate the pte
3532 * from the encoded file_pte if possible. This enables swappable
3535 * We enter with non-exclusive mmap_sem (to exclude vma changes,
3536 * but allow concurrent faults), and pte mapped but not yet locked.
3537 * We return with mmap_sem still held, but pte unmapped and unlocked.
3539 static int do_nonlinear_fault(struct mm_struct *mm, struct vm_area_struct *vma,
3540 unsigned long address, pte_t *page_table, pmd_t *pmd,
3541 unsigned int flags, pte_t orig_pte)
3545 flags |= FAULT_FLAG_NONLINEAR;
3547 if (!pte_unmap_same(mm, pmd, page_table, orig_pte))
3550 if (unlikely(!(vma->vm_flags & VM_NONLINEAR))) {
3552 * Page table corrupted: show pte and kill process.
3554 print_bad_pte(vma, address, orig_pte, NULL);
3555 return VM_FAULT_SIGBUS;
3558 pgoff = pte_to_pgoff(orig_pte);
3559 return __do_fault(mm, vma, address, pmd, pgoff, flags, orig_pte);
3562 int numa_migrate_prep(struct page *page, struct vm_area_struct *vma,
3563 unsigned long addr, int page_nid)
3567 count_vm_numa_event(NUMA_HINT_FAULTS);
3568 if (page_nid == numa_node_id())
3569 count_vm_numa_event(NUMA_HINT_FAULTS_LOCAL);
3571 return mpol_misplaced(page, vma, addr);
3574 int do_numa_page(struct mm_struct *mm, struct vm_area_struct *vma,
3575 unsigned long addr, pte_t pte, pte_t *ptep, pmd_t *pmd)
3577 struct page *page = NULL;
3581 bool migrated = false;
3584 * The "pte" at this point cannot be used safely without
3585 * validation through pte_unmap_same(). It's of NUMA type but
3586 * the pfn may be screwed if the read is non atomic.
3588 * ptep_modify_prot_start is not called as this is clearing
3589 * the _PAGE_NUMA bit and it is not really expected that there
3590 * would be concurrent hardware modifications to the PTE.
3592 ptl = pte_lockptr(mm, pmd);
3594 if (unlikely(!pte_same(*ptep, pte))) {
3595 pte_unmap_unlock(ptep, ptl);
3599 pte = pte_mknonnuma(pte);
3600 set_pte_at(mm, addr, ptep, pte);
3601 update_mmu_cache(vma, addr, ptep);
3603 page = vm_normal_page(vma, addr, pte);
3605 pte_unmap_unlock(ptep, ptl);
3609 page_nid = page_to_nid(page);
3610 target_nid = numa_migrate_prep(page, vma, addr, page_nid);
3611 pte_unmap_unlock(ptep, ptl);
3612 if (target_nid == -1) {
3617 /* Migrate to the requested node */
3618 migrated = migrate_misplaced_page(page, target_nid);
3620 page_nid = target_nid;
3624 task_numa_fault(page_nid, 1, migrated);
3628 /* NUMA hinting page fault entry point for regular pmds */
3629 #ifdef CONFIG_NUMA_BALANCING
3630 static int do_pmd_numa_page(struct mm_struct *mm, struct vm_area_struct *vma,
3631 unsigned long addr, pmd_t *pmdp)
3634 pte_t *pte, *orig_pte;
3635 unsigned long _addr = addr & PMD_MASK;
3636 unsigned long offset;
3640 spin_lock(&mm->page_table_lock);
3642 if (pmd_numa(pmd)) {
3643 set_pmd_at(mm, _addr, pmdp, pmd_mknonnuma(pmd));
3646 spin_unlock(&mm->page_table_lock);
3651 /* we're in a page fault so some vma must be in the range */
3653 BUG_ON(vma->vm_start >= _addr + PMD_SIZE);
3654 offset = max(_addr, vma->vm_start) & ~PMD_MASK;
3655 VM_BUG_ON(offset >= PMD_SIZE);
3656 orig_pte = pte = pte_offset_map_lock(mm, pmdp, _addr, &ptl);
3657 pte += offset >> PAGE_SHIFT;
3658 for (addr = _addr + offset; addr < _addr + PMD_SIZE; pte++, addr += PAGE_SIZE) {
3659 pte_t pteval = *pte;
3663 bool migrated = false;
3665 if (!pte_present(pteval))
3667 if (!pte_numa(pteval))
3669 if (addr >= vma->vm_end) {
3670 vma = find_vma(mm, addr);
3671 /* there's a pte present so there must be a vma */
3673 BUG_ON(addr < vma->vm_start);
3675 if (pte_numa(pteval)) {
3676 pteval = pte_mknonnuma(pteval);
3677 set_pte_at(mm, addr, pte, pteval);
3679 page = vm_normal_page(vma, addr, pteval);
3680 if (unlikely(!page))
3682 /* only check non-shared pages */
3683 if (unlikely(page_mapcount(page) != 1))
3686 page_nid = page_to_nid(page);
3687 target_nid = numa_migrate_prep(page, vma, addr, page_nid);
3688 pte_unmap_unlock(pte, ptl);
3689 if (target_nid != -1) {
3690 migrated = migrate_misplaced_page(page, target_nid);
3692 page_nid = target_nid;
3698 task_numa_fault(page_nid, 1, migrated);
3700 pte = pte_offset_map_lock(mm, pmdp, addr, &ptl);
3702 pte_unmap_unlock(orig_pte, ptl);
3707 static int do_pmd_numa_page(struct mm_struct *mm, struct vm_area_struct *vma,
3708 unsigned long addr, pmd_t *pmdp)
3713 #endif /* CONFIG_NUMA_BALANCING */
3716 * These routines also need to handle stuff like marking pages dirty
3717 * and/or accessed for architectures that don't do it in hardware (most
3718 * RISC architectures). The early dirtying is also good on the i386.
3720 * There is also a hook called "update_mmu_cache()" that architectures
3721 * with external mmu caches can use to update those (ie the Sparc or
3722 * PowerPC hashed page tables that act as extended TLBs).
3724 * We enter with non-exclusive mmap_sem (to exclude vma changes,
3725 * but allow concurrent faults), and pte mapped but not yet locked.
3726 * We return with mmap_sem still held, but pte unmapped and unlocked.
3728 int handle_pte_fault(struct mm_struct *mm,
3729 struct vm_area_struct *vma, unsigned long address,
3730 pte_t *pte, pmd_t *pmd, unsigned int flags)
3736 if (!pte_present(entry)) {
3737 if (pte_none(entry)) {
3739 if (likely(vma->vm_ops->fault))
3740 return do_linear_fault(mm, vma, address,
3741 pte, pmd, flags, entry);
3743 return do_anonymous_page(mm, vma, address,
3746 if (pte_file(entry))
3747 return do_nonlinear_fault(mm, vma, address,
3748 pte, pmd, flags, entry);
3749 return do_swap_page(mm, vma, address,
3750 pte, pmd, flags, entry);
3753 if (pte_numa(entry))
3754 return do_numa_page(mm, vma, address, entry, pte, pmd);
3756 ptl = pte_lockptr(mm, pmd);
3758 if (unlikely(!pte_same(*pte, entry)))
3760 if (flags & FAULT_FLAG_WRITE) {
3761 if (!pte_write(entry))
3762 return do_wp_page(mm, vma, address,
3763 pte, pmd, ptl, entry);
3764 entry = pte_mkdirty(entry);
3766 entry = pte_mkyoung(entry);
3767 if (ptep_set_access_flags(vma, address, pte, entry, flags & FAULT_FLAG_WRITE)) {
3768 update_mmu_cache(vma, address, pte);
3771 * This is needed only for protection faults but the arch code
3772 * is not yet telling us if this is a protection fault or not.
3773 * This still avoids useless tlb flushes for .text page faults
3776 if (flags & FAULT_FLAG_WRITE)
3777 flush_tlb_fix_spurious_fault(vma, address);
3780 pte_unmap_unlock(pte, ptl);
3785 * By the time we get here, we already hold the mm semaphore
3787 static int __handle_mm_fault(struct mm_struct *mm, struct vm_area_struct *vma,
3788 unsigned long address, unsigned int flags)
3795 if (unlikely(is_vm_hugetlb_page(vma)))
3796 return hugetlb_fault(mm, vma, address, flags);
3799 pgd = pgd_offset(mm, address);
3800 pud = pud_alloc(mm, pgd, address);
3802 return VM_FAULT_OOM;
3803 pmd = pmd_alloc(mm, pud, address);
3805 return VM_FAULT_OOM;
3806 if (pmd_none(*pmd) && transparent_hugepage_enabled(vma)) {
3808 return do_huge_pmd_anonymous_page(mm, vma, address,
3811 pmd_t orig_pmd = *pmd;
3815 if (pmd_trans_huge(orig_pmd)) {
3816 unsigned int dirty = flags & FAULT_FLAG_WRITE;
3819 * If the pmd is splitting, return and retry the
3820 * the fault. Alternative: wait until the split
3821 * is done, and goto retry.
3823 if (pmd_trans_splitting(orig_pmd))
3826 if (pmd_numa(orig_pmd))
3827 return do_huge_pmd_numa_page(mm, vma, address,
3830 if (dirty && !pmd_write(orig_pmd)) {
3831 ret = do_huge_pmd_wp_page(mm, vma, address, pmd,
3834 * If COW results in an oom, the huge pmd will
3835 * have been split, so retry the fault on the
3836 * pte for a smaller charge.
3838 if (unlikely(ret & VM_FAULT_OOM))
3842 huge_pmd_set_accessed(mm, vma, address, pmd,
3851 return do_pmd_numa_page(mm, vma, address, pmd);
3854 * Use __pte_alloc instead of pte_alloc_map, because we can't
3855 * run pte_offset_map on the pmd, if an huge pmd could
3856 * materialize from under us from a different thread.
3858 if (unlikely(pmd_none(*pmd)) &&
3859 unlikely(__pte_alloc(mm, vma, pmd, address)))
3860 return VM_FAULT_OOM;
3861 /* if an huge pmd materialized from under us just retry later */
3862 if (unlikely(pmd_trans_huge(*pmd)))
3865 * A regular pmd is established and it can't morph into a huge pmd
3866 * from under us anymore at this point because we hold the mmap_sem
3867 * read mode and khugepaged takes it in write mode. So now it's
3868 * safe to run pte_offset_map().
3870 pte = pte_offset_map(pmd, address);
3872 return handle_pte_fault(mm, vma, address, pte, pmd, flags);
3875 int handle_mm_fault(struct mm_struct *mm, struct vm_area_struct *vma,
3876 unsigned long address, unsigned int flags)
3880 __set_current_state(TASK_RUNNING);
3882 count_vm_event(PGFAULT);
3883 mem_cgroup_count_vm_event(mm, PGFAULT);
3885 /* do counter updates before entering really critical section. */
3886 check_sync_rss_stat(current);
3889 * Enable the memcg OOM handling for faults triggered in user
3890 * space. Kernel faults are handled more gracefully.
3892 if (flags & FAULT_FLAG_USER)
3893 mem_cgroup_oom_enable();
3895 ret = __handle_mm_fault(mm, vma, address, flags);
3897 if (flags & FAULT_FLAG_USER) {
3898 mem_cgroup_oom_disable();
3900 * The task may have entered a memcg OOM situation but
3901 * if the allocation error was handled gracefully (no
3902 * VM_FAULT_OOM), there is no need to kill anything.
3903 * Just clean up the OOM state peacefully.
3905 if (task_in_memcg_oom(current) && !(ret & VM_FAULT_OOM))
3906 mem_cgroup_oom_synchronize(false);
3912 #ifndef __PAGETABLE_PUD_FOLDED
3914 * Allocate page upper directory.
3915 * We've already handled the fast-path in-line.
3917 int __pud_alloc(struct mm_struct *mm, pgd_t *pgd, unsigned long address)
3919 pud_t *new = pud_alloc_one(mm, address);
3923 smp_wmb(); /* See comment in __pte_alloc */
3925 spin_lock(&mm->page_table_lock);
3926 if (pgd_present(*pgd)) /* Another has populated it */
3929 pgd_populate(mm, pgd, new);
3930 spin_unlock(&mm->page_table_lock);
3933 #endif /* __PAGETABLE_PUD_FOLDED */
3935 #ifndef __PAGETABLE_PMD_FOLDED
3937 * Allocate page middle directory.
3938 * We've already handled the fast-path in-line.
3940 int __pmd_alloc(struct mm_struct *mm, pud_t *pud, unsigned long address)
3942 pmd_t *new = pmd_alloc_one(mm, address);
3946 smp_wmb(); /* See comment in __pte_alloc */
3948 spin_lock(&mm->page_table_lock);
3949 #ifndef __ARCH_HAS_4LEVEL_HACK
3950 if (pud_present(*pud)) /* Another has populated it */
3953 pud_populate(mm, pud, new);
3955 if (pgd_present(*pud)) /* Another has populated it */
3958 pgd_populate(mm, pud, new);
3959 #endif /* __ARCH_HAS_4LEVEL_HACK */
3960 spin_unlock(&mm->page_table_lock);
3963 #endif /* __PAGETABLE_PMD_FOLDED */
3965 #if !defined(__HAVE_ARCH_GATE_AREA)
3967 #if defined(AT_SYSINFO_EHDR)
3968 static struct vm_area_struct gate_vma;
3970 static int __init gate_vma_init(void)
3972 gate_vma.vm_mm = NULL;
3973 gate_vma.vm_start = FIXADDR_USER_START;
3974 gate_vma.vm_end = FIXADDR_USER_END;
3975 gate_vma.vm_flags = VM_READ | VM_MAYREAD | VM_EXEC | VM_MAYEXEC;
3976 gate_vma.vm_page_prot = __P101;
3980 __initcall(gate_vma_init);
3983 struct vm_area_struct *get_gate_vma(struct mm_struct *mm)
3985 #ifdef AT_SYSINFO_EHDR
3992 int in_gate_area_no_mm(unsigned long addr)
3994 #ifdef AT_SYSINFO_EHDR
3995 if ((addr >= FIXADDR_USER_START) && (addr < FIXADDR_USER_END))
4001 #endif /* __HAVE_ARCH_GATE_AREA */
4003 static int __follow_pte(struct mm_struct *mm, unsigned long address,
4004 pte_t **ptepp, spinlock_t **ptlp)
4011 pgd = pgd_offset(mm, address);
4012 if (pgd_none(*pgd) || unlikely(pgd_bad(*pgd)))
4015 pud = pud_offset(pgd, address);
4016 if (pud_none(*pud) || unlikely(pud_bad(*pud)))
4019 pmd = pmd_offset(pud, address);
4020 VM_BUG_ON(pmd_trans_huge(*pmd));
4021 if (pmd_none(*pmd) || unlikely(pmd_bad(*pmd)))
4024 /* We cannot handle huge page PFN maps. Luckily they don't exist. */
4028 ptep = pte_offset_map_lock(mm, pmd, address, ptlp);
4031 if (!pte_present(*ptep))
4036 pte_unmap_unlock(ptep, *ptlp);
4041 static inline int follow_pte(struct mm_struct *mm, unsigned long address,
4042 pte_t **ptepp, spinlock_t **ptlp)
4046 /* (void) is needed to make gcc happy */
4047 (void) __cond_lock(*ptlp,
4048 !(res = __follow_pte(mm, address, ptepp, ptlp)));
4053 * follow_pfn - look up PFN at a user virtual address
4054 * @vma: memory mapping
4055 * @address: user virtual address
4056 * @pfn: location to store found PFN
4058 * Only IO mappings and raw PFN mappings are allowed.
4060 * Returns zero and the pfn at @pfn on success, -ve otherwise.
4062 int follow_pfn(struct vm_area_struct *vma, unsigned long address,
4069 if (!(vma->vm_flags & (VM_IO | VM_PFNMAP)))
4072 ret = follow_pte(vma->vm_mm, address, &ptep, &ptl);
4075 *pfn = pte_pfn(*ptep);
4076 pte_unmap_unlock(ptep, ptl);
4079 EXPORT_SYMBOL(follow_pfn);
4081 #ifdef CONFIG_HAVE_IOREMAP_PROT
4082 int follow_phys(struct vm_area_struct *vma,
4083 unsigned long address, unsigned int flags,
4084 unsigned long *prot, resource_size_t *phys)
4090 if (!(vma->vm_flags & (VM_IO | VM_PFNMAP)))
4093 if (follow_pte(vma->vm_mm, address, &ptep, &ptl))
4097 if ((flags & FOLL_WRITE) && !pte_write(pte))
4100 *prot = pgprot_val(pte_pgprot(pte));
4101 *phys = (resource_size_t)pte_pfn(pte) << PAGE_SHIFT;
4105 pte_unmap_unlock(ptep, ptl);
4110 int generic_access_phys(struct vm_area_struct *vma, unsigned long addr,
4111 void *buf, int len, int write)
4113 resource_size_t phys_addr;
4114 unsigned long prot = 0;
4115 void __iomem *maddr;
4116 int offset = addr & (PAGE_SIZE-1);
4118 if (follow_phys(vma, addr, write, &prot, &phys_addr))
4121 maddr = ioremap_prot(phys_addr, PAGE_ALIGN(len + offset), prot);
4123 memcpy_toio(maddr + offset, buf, len);
4125 memcpy_fromio(buf, maddr + offset, len);
4130 EXPORT_SYMBOL_GPL(generic_access_phys);
4134 * Access another process' address space as given in mm. If non-NULL, use the
4135 * given task for page fault accounting.
4137 static int __access_remote_vm(struct task_struct *tsk, struct mm_struct *mm,
4138 unsigned long addr, void *buf, int len, int write)
4140 struct vm_area_struct *vma;
4141 void *old_buf = buf;
4143 down_read(&mm->mmap_sem);
4144 /* ignore errors, just check how much was successfully transferred */
4146 int bytes, ret, offset;
4148 struct page *page = NULL;
4150 ret = get_user_pages(tsk, mm, addr, 1,
4151 write, 1, &page, &vma);
4154 * Check if this is a VM_IO | VM_PFNMAP VMA, which
4155 * we can access using slightly different code.
4157 #ifdef CONFIG_HAVE_IOREMAP_PROT
4158 vma = find_vma(mm, addr);
4159 if (!vma || vma->vm_start > addr)
4161 if (vma->vm_ops && vma->vm_ops->access)
4162 ret = vma->vm_ops->access(vma, addr, buf,
4170 offset = addr & (PAGE_SIZE-1);
4171 if (bytes > PAGE_SIZE-offset)
4172 bytes = PAGE_SIZE-offset;
4176 copy_to_user_page(vma, page, addr,
4177 maddr + offset, buf, bytes);
4178 set_page_dirty_lock(page);
4180 copy_from_user_page(vma, page, addr,
4181 buf, maddr + offset, bytes);
4184 page_cache_release(page);
4190 up_read(&mm->mmap_sem);
4192 return buf - old_buf;
4196 * access_remote_vm - access another process' address space
4197 * @mm: the mm_struct of the target address space
4198 * @addr: start address to access
4199 * @buf: source or destination buffer
4200 * @len: number of bytes to transfer
4201 * @write: whether the access is a write
4203 * The caller must hold a reference on @mm.
4205 int access_remote_vm(struct mm_struct *mm, unsigned long addr,
4206 void *buf, int len, int write)
4208 return __access_remote_vm(NULL, mm, addr, buf, len, write);
4212 * Access another process' address space.
4213 * Source/target buffer must be kernel space,
4214 * Do not walk the page table directly, use get_user_pages
4216 int access_process_vm(struct task_struct *tsk, unsigned long addr,
4217 void *buf, int len, int write)
4219 struct mm_struct *mm;
4222 mm = get_task_mm(tsk);
4226 ret = __access_remote_vm(tsk, mm, addr, buf, len, write);
4233 * Print the name of a VMA.
4235 void print_vma_addr(char *prefix, unsigned long ip)
4237 struct mm_struct *mm = current->mm;
4238 struct vm_area_struct *vma;
4241 * Do not print if we are in atomic
4242 * contexts (in exception stacks, etc.):
4244 if (preempt_count())
4247 down_read(&mm->mmap_sem);
4248 vma = find_vma(mm, ip);
4249 if (vma && vma->vm_file) {
4250 struct file *f = vma->vm_file;
4251 char *buf = (char *)__get_free_page(GFP_KERNEL);
4255 p = d_path(&f->f_path, buf, PAGE_SIZE);
4258 printk("%s%s[%lx+%lx]", prefix, kbasename(p),
4260 vma->vm_end - vma->vm_start);
4261 free_page((unsigned long)buf);
4264 up_read(&mm->mmap_sem);
4267 #ifdef CONFIG_PROVE_LOCKING
4268 void might_fault(void)
4271 * Some code (nfs/sunrpc) uses socket ops on kernel memory while
4272 * holding the mmap_sem, this is safe because kernel memory doesn't
4273 * get paged out, therefore we'll never actually fault, and the
4274 * below annotations will generate false positives.
4276 if (segment_eq(get_fs(), KERNEL_DS))
4281 * it would be nicer only to annotate paths which are not under
4282 * pagefault_disable, however that requires a larger audit and
4283 * providing helpers like get_user_atomic.
4285 if (!in_atomic() && current->mm)
4286 might_lock_read(¤t->mm->mmap_sem);
4288 EXPORT_SYMBOL(might_fault);
4291 #if defined(CONFIG_TRANSPARENT_HUGEPAGE) || defined(CONFIG_HUGETLBFS)
4292 static void clear_gigantic_page(struct page *page,
4294 unsigned int pages_per_huge_page)
4297 struct page *p = page;
4300 for (i = 0; i < pages_per_huge_page;
4301 i++, p = mem_map_next(p, page, i)) {
4303 clear_user_highpage(p, addr + i * PAGE_SIZE);
4306 void clear_huge_page(struct page *page,
4307 unsigned long addr, unsigned int pages_per_huge_page)
4311 if (unlikely(pages_per_huge_page > MAX_ORDER_NR_PAGES)) {
4312 clear_gigantic_page(page, addr, pages_per_huge_page);
4317 for (i = 0; i < pages_per_huge_page; i++) {
4319 clear_user_highpage(page + i, addr + i * PAGE_SIZE);
4323 static void copy_user_gigantic_page(struct page *dst, struct page *src,
4325 struct vm_area_struct *vma,
4326 unsigned int pages_per_huge_page)
4329 struct page *dst_base = dst;
4330 struct page *src_base = src;
4332 for (i = 0; i < pages_per_huge_page; ) {
4334 copy_user_highpage(dst, src, addr + i*PAGE_SIZE, vma);
4337 dst = mem_map_next(dst, dst_base, i);
4338 src = mem_map_next(src, src_base, i);
4342 void copy_user_huge_page(struct page *dst, struct page *src,
4343 unsigned long addr, struct vm_area_struct *vma,
4344 unsigned int pages_per_huge_page)
4348 if (unlikely(pages_per_huge_page > MAX_ORDER_NR_PAGES)) {
4349 copy_user_gigantic_page(dst, src, addr, vma,
4350 pages_per_huge_page);
4355 for (i = 0; i < pages_per_huge_page; i++) {
4357 copy_user_highpage(dst + i, src + i, addr + i*PAGE_SIZE, vma);
4360 #endif /* CONFIG_TRANSPARENT_HUGEPAGE || CONFIG_HUGETLBFS */