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/rmap.h>
49 #include <linux/module.h>
50 #include <linux/delayacct.h>
51 #include <linux/init.h>
52 #include <linux/writeback.h>
53 #include <linux/memcontrol.h>
54 #include <linux/mmu_notifier.h>
56 #include <asm/pgalloc.h>
57 #include <asm/uaccess.h>
59 #include <asm/tlbflush.h>
60 #include <asm/pgtable.h>
62 #include <linux/swapops.h>
63 #include <linux/elf.h>
67 #ifndef CONFIG_NEED_MULTIPLE_NODES
68 /* use the per-pgdat data instead for discontigmem - mbligh */
69 unsigned long max_mapnr
;
72 EXPORT_SYMBOL(max_mapnr
);
73 EXPORT_SYMBOL(mem_map
);
76 unsigned long num_physpages
;
78 * A number of key systems in x86 including ioremap() rely on the assumption
79 * that high_memory defines the upper bound on direct map memory, then end
80 * of ZONE_NORMAL. Under CONFIG_DISCONTIG this means that max_low_pfn and
81 * highstart_pfn must be the same; there must be no gap between ZONE_NORMAL
86 EXPORT_SYMBOL(num_physpages
);
87 EXPORT_SYMBOL(high_memory
);
90 * Randomize the address space (stacks, mmaps, brk, etc.).
92 * ( When CONFIG_COMPAT_BRK=y we exclude brk from randomization,
93 * as ancient (libc5 based) binaries can segfault. )
95 int randomize_va_space __read_mostly
=
96 #ifdef CONFIG_COMPAT_BRK
102 static int __init
disable_randmaps(char *s
)
104 randomize_va_space
= 0;
107 __setup("norandmaps", disable_randmaps
);
111 * If a p?d_bad entry is found while walking page tables, report
112 * the error, before resetting entry to p?d_none. Usually (but
113 * very seldom) called out from the p?d_none_or_clear_bad macros.
116 void pgd_clear_bad(pgd_t
*pgd
)
122 void pud_clear_bad(pud_t
*pud
)
128 void pmd_clear_bad(pmd_t
*pmd
)
135 * Note: this doesn't free the actual pages themselves. That
136 * has been handled earlier when unmapping all the memory regions.
138 static void free_pte_range(struct mmu_gather
*tlb
, pmd_t
*pmd
)
140 pgtable_t token
= pmd_pgtable(*pmd
);
142 pte_free_tlb(tlb
, token
);
146 static inline void free_pmd_range(struct mmu_gather
*tlb
, pud_t
*pud
,
147 unsigned long addr
, unsigned long end
,
148 unsigned long floor
, unsigned long ceiling
)
155 pmd
= pmd_offset(pud
, addr
);
157 next
= pmd_addr_end(addr
, end
);
158 if (pmd_none_or_clear_bad(pmd
))
160 free_pte_range(tlb
, pmd
);
161 } while (pmd
++, addr
= next
, addr
!= end
);
171 if (end
- 1 > ceiling
- 1)
174 pmd
= pmd_offset(pud
, start
);
176 pmd_free_tlb(tlb
, pmd
);
179 static inline void free_pud_range(struct mmu_gather
*tlb
, pgd_t
*pgd
,
180 unsigned long addr
, unsigned long end
,
181 unsigned long floor
, unsigned long ceiling
)
188 pud
= pud_offset(pgd
, addr
);
190 next
= pud_addr_end(addr
, end
);
191 if (pud_none_or_clear_bad(pud
))
193 free_pmd_range(tlb
, pud
, addr
, next
, floor
, ceiling
);
194 } while (pud
++, addr
= next
, addr
!= end
);
200 ceiling
&= PGDIR_MASK
;
204 if (end
- 1 > ceiling
- 1)
207 pud
= pud_offset(pgd
, start
);
209 pud_free_tlb(tlb
, pud
);
213 * This function frees user-level page tables of a process.
215 * Must be called with pagetable lock held.
217 void free_pgd_range(struct mmu_gather
*tlb
,
218 unsigned long addr
, unsigned long end
,
219 unsigned long floor
, unsigned long ceiling
)
226 * The next few lines have given us lots of grief...
228 * Why are we testing PMD* at this top level? Because often
229 * there will be no work to do at all, and we'd prefer not to
230 * go all the way down to the bottom just to discover that.
232 * Why all these "- 1"s? Because 0 represents both the bottom
233 * of the address space and the top of it (using -1 for the
234 * top wouldn't help much: the masks would do the wrong thing).
235 * The rule is that addr 0 and floor 0 refer to the bottom of
236 * the address space, but end 0 and ceiling 0 refer to the top
237 * Comparisons need to use "end - 1" and "ceiling - 1" (though
238 * that end 0 case should be mythical).
240 * Wherever addr is brought up or ceiling brought down, we must
241 * be careful to reject "the opposite 0" before it confuses the
242 * subsequent tests. But what about where end is brought down
243 * by PMD_SIZE below? no, end can't go down to 0 there.
245 * Whereas we round start (addr) and ceiling down, by different
246 * masks at different levels, in order to test whether a table
247 * now has no other vmas using it, so can be freed, we don't
248 * bother to round floor or end up - the tests don't need that.
262 if (end
- 1 > ceiling
- 1)
268 pgd
= pgd_offset(tlb
->mm
, addr
);
270 next
= pgd_addr_end(addr
, end
);
271 if (pgd_none_or_clear_bad(pgd
))
273 free_pud_range(tlb
, pgd
, addr
, next
, floor
, ceiling
);
274 } while (pgd
++, addr
= next
, addr
!= end
);
277 void free_pgtables(struct mmu_gather
*tlb
, struct vm_area_struct
*vma
,
278 unsigned long floor
, unsigned long ceiling
)
281 struct vm_area_struct
*next
= vma
->vm_next
;
282 unsigned long addr
= vma
->vm_start
;
285 * Hide vma from rmap and vmtruncate before freeing pgtables
287 anon_vma_unlink(vma
);
288 unlink_file_vma(vma
);
290 if (is_vm_hugetlb_page(vma
)) {
291 hugetlb_free_pgd_range(tlb
, addr
, vma
->vm_end
,
292 floor
, next
? next
->vm_start
: ceiling
);
295 * Optimization: gather nearby vmas into one call down
297 while (next
&& next
->vm_start
<= vma
->vm_end
+ PMD_SIZE
298 && !is_vm_hugetlb_page(next
)) {
301 anon_vma_unlink(vma
);
302 unlink_file_vma(vma
);
304 free_pgd_range(tlb
, addr
, vma
->vm_end
,
305 floor
, next
? next
->vm_start
: ceiling
);
311 int __pte_alloc(struct mm_struct
*mm
, pmd_t
*pmd
, unsigned long address
)
313 pgtable_t
new = pte_alloc_one(mm
, address
);
318 * Ensure all pte setup (eg. pte page lock and page clearing) are
319 * visible before the pte is made visible to other CPUs by being
320 * put into page tables.
322 * The other side of the story is the pointer chasing in the page
323 * table walking code (when walking the page table without locking;
324 * ie. most of the time). Fortunately, these data accesses consist
325 * of a chain of data-dependent loads, meaning most CPUs (alpha
326 * being the notable exception) will already guarantee loads are
327 * seen in-order. See the alpha page table accessors for the
328 * smp_read_barrier_depends() barriers in page table walking code.
330 smp_wmb(); /* Could be smp_wmb__xxx(before|after)_spin_lock */
332 spin_lock(&mm
->page_table_lock
);
333 if (!pmd_present(*pmd
)) { /* Has another populated it ? */
335 pmd_populate(mm
, pmd
, new);
338 spin_unlock(&mm
->page_table_lock
);
344 int __pte_alloc_kernel(pmd_t
*pmd
, unsigned long address
)
346 pte_t
*new = pte_alloc_one_kernel(&init_mm
, address
);
350 smp_wmb(); /* See comment in __pte_alloc */
352 spin_lock(&init_mm
.page_table_lock
);
353 if (!pmd_present(*pmd
)) { /* Has another populated it ? */
354 pmd_populate_kernel(&init_mm
, pmd
, new);
357 spin_unlock(&init_mm
.page_table_lock
);
359 pte_free_kernel(&init_mm
, new);
363 static inline void add_mm_rss(struct mm_struct
*mm
, int file_rss
, int anon_rss
)
366 add_mm_counter(mm
, file_rss
, file_rss
);
368 add_mm_counter(mm
, anon_rss
, anon_rss
);
372 * This function is called to print an error when a bad pte
373 * is found. For example, we might have a PFN-mapped pte in
374 * a region that doesn't allow it.
376 * The calling function must still handle the error.
378 static void print_bad_pte(struct vm_area_struct
*vma
, pte_t pte
,
381 printk(KERN_ERR
"Bad pte = %08llx, process = %s, "
382 "vm_flags = %lx, vaddr = %lx\n",
383 (long long)pte_val(pte
),
384 (vma
->vm_mm
== current
->mm
? current
->comm
: "???"),
385 vma
->vm_flags
, vaddr
);
389 static inline int is_cow_mapping(unsigned int flags
)
391 return (flags
& (VM_SHARED
| VM_MAYWRITE
)) == VM_MAYWRITE
;
395 * vm_normal_page -- This function gets the "struct page" associated with a pte.
397 * "Special" mappings do not wish to be associated with a "struct page" (either
398 * it doesn't exist, or it exists but they don't want to touch it). In this
399 * case, NULL is returned here. "Normal" mappings do have a struct page.
401 * There are 2 broad cases. Firstly, an architecture may define a pte_special()
402 * pte bit, in which case this function is trivial. Secondly, an architecture
403 * may not have a spare pte bit, which requires a more complicated scheme,
406 * A raw VM_PFNMAP mapping (ie. one that is not COWed) is always considered a
407 * special mapping (even if there are underlying and valid "struct pages").
408 * COWed pages of a VM_PFNMAP are always normal.
410 * The way we recognize COWed pages within VM_PFNMAP mappings is through the
411 * rules set up by "remap_pfn_range()": the vma will have the VM_PFNMAP bit
412 * set, and the vm_pgoff will point to the first PFN mapped: thus every special
413 * mapping will always honor the rule
415 * pfn_of_page == vma->vm_pgoff + ((addr - vma->vm_start) >> PAGE_SHIFT)
417 * And for normal mappings this is false.
419 * This restricts such mappings to be a linear translation from virtual address
420 * to pfn. To get around this restriction, we allow arbitrary mappings so long
421 * as the vma is not a COW mapping; in that case, we know that all ptes are
422 * special (because none can have been COWed).
425 * In order to support COW of arbitrary special mappings, we have VM_MIXEDMAP.
427 * VM_MIXEDMAP mappings can likewise contain memory with or without "struct
428 * page" backing, however the difference is that _all_ pages with a struct
429 * page (that is, those where pfn_valid is true) are refcounted and considered
430 * normal pages by the VM. The disadvantage is that pages are refcounted
431 * (which can be slower and simply not an option for some PFNMAP users). The
432 * advantage is that we don't have to follow the strict linearity rule of
433 * PFNMAP mappings in order to support COWable mappings.
436 #ifdef __HAVE_ARCH_PTE_SPECIAL
437 # define HAVE_PTE_SPECIAL 1
439 # define HAVE_PTE_SPECIAL 0
441 struct page
*vm_normal_page(struct vm_area_struct
*vma
, unsigned long addr
,
446 if (HAVE_PTE_SPECIAL
) {
447 if (likely(!pte_special(pte
))) {
448 VM_BUG_ON(!pfn_valid(pte_pfn(pte
)));
449 return pte_page(pte
);
451 VM_BUG_ON(!(vma
->vm_flags
& (VM_PFNMAP
| VM_MIXEDMAP
)));
455 /* !HAVE_PTE_SPECIAL case follows: */
459 if (unlikely(vma
->vm_flags
& (VM_PFNMAP
|VM_MIXEDMAP
))) {
460 if (vma
->vm_flags
& VM_MIXEDMAP
) {
466 off
= (addr
- vma
->vm_start
) >> PAGE_SHIFT
;
467 if (pfn
== vma
->vm_pgoff
+ off
)
469 if (!is_cow_mapping(vma
->vm_flags
))
474 VM_BUG_ON(!pfn_valid(pfn
));
477 * NOTE! We still have PageReserved() pages in the page tables.
479 * eg. VDSO mappings can cause them to exist.
482 return pfn_to_page(pfn
);
486 * copy one vm_area from one task to the other. Assumes the page tables
487 * already present in the new task to be cleared in the whole range
488 * covered by this vma.
492 copy_one_pte(struct mm_struct
*dst_mm
, struct mm_struct
*src_mm
,
493 pte_t
*dst_pte
, pte_t
*src_pte
, struct vm_area_struct
*vma
,
494 unsigned long addr
, int *rss
)
496 unsigned long vm_flags
= vma
->vm_flags
;
497 pte_t pte
= *src_pte
;
500 /* pte contains position in swap or file, so copy. */
501 if (unlikely(!pte_present(pte
))) {
502 if (!pte_file(pte
)) {
503 swp_entry_t entry
= pte_to_swp_entry(pte
);
505 swap_duplicate(entry
);
506 /* make sure dst_mm is on swapoff's mmlist. */
507 if (unlikely(list_empty(&dst_mm
->mmlist
))) {
508 spin_lock(&mmlist_lock
);
509 if (list_empty(&dst_mm
->mmlist
))
510 list_add(&dst_mm
->mmlist
,
512 spin_unlock(&mmlist_lock
);
514 if (is_write_migration_entry(entry
) &&
515 is_cow_mapping(vm_flags
)) {
517 * COW mappings require pages in both parent
518 * and child to be set to read.
520 make_migration_entry_read(&entry
);
521 pte
= swp_entry_to_pte(entry
);
522 set_pte_at(src_mm
, addr
, src_pte
, pte
);
529 * If it's a COW mapping, write protect it both
530 * in the parent and the child
532 if (is_cow_mapping(vm_flags
)) {
533 ptep_set_wrprotect(src_mm
, addr
, src_pte
);
534 pte
= pte_wrprotect(pte
);
538 * If it's a shared mapping, mark it clean in
541 if (vm_flags
& VM_SHARED
)
542 pte
= pte_mkclean(pte
);
543 pte
= pte_mkold(pte
);
545 page
= vm_normal_page(vma
, addr
, pte
);
548 page_dup_rmap(page
, vma
, addr
);
549 rss
[!!PageAnon(page
)]++;
553 set_pte_at(dst_mm
, addr
, dst_pte
, pte
);
556 static int copy_pte_range(struct mm_struct
*dst_mm
, struct mm_struct
*src_mm
,
557 pmd_t
*dst_pmd
, pmd_t
*src_pmd
, struct vm_area_struct
*vma
,
558 unsigned long addr
, unsigned long end
)
560 pte_t
*src_pte
, *dst_pte
;
561 spinlock_t
*src_ptl
, *dst_ptl
;
567 dst_pte
= pte_alloc_map_lock(dst_mm
, dst_pmd
, addr
, &dst_ptl
);
570 src_pte
= pte_offset_map_nested(src_pmd
, addr
);
571 src_ptl
= pte_lockptr(src_mm
, src_pmd
);
572 spin_lock_nested(src_ptl
, SINGLE_DEPTH_NESTING
);
573 arch_enter_lazy_mmu_mode();
577 * We are holding two locks at this point - either of them
578 * could generate latencies in another task on another CPU.
580 if (progress
>= 32) {
582 if (need_resched() ||
583 spin_needbreak(src_ptl
) || spin_needbreak(dst_ptl
))
586 if (pte_none(*src_pte
)) {
590 copy_one_pte(dst_mm
, src_mm
, dst_pte
, src_pte
, vma
, addr
, rss
);
592 } while (dst_pte
++, src_pte
++, addr
+= PAGE_SIZE
, addr
!= end
);
594 arch_leave_lazy_mmu_mode();
595 spin_unlock(src_ptl
);
596 pte_unmap_nested(src_pte
- 1);
597 add_mm_rss(dst_mm
, rss
[0], rss
[1]);
598 pte_unmap_unlock(dst_pte
- 1, dst_ptl
);
605 static inline int copy_pmd_range(struct mm_struct
*dst_mm
, struct mm_struct
*src_mm
,
606 pud_t
*dst_pud
, pud_t
*src_pud
, struct vm_area_struct
*vma
,
607 unsigned long addr
, unsigned long end
)
609 pmd_t
*src_pmd
, *dst_pmd
;
612 dst_pmd
= pmd_alloc(dst_mm
, dst_pud
, addr
);
615 src_pmd
= pmd_offset(src_pud
, addr
);
617 next
= pmd_addr_end(addr
, end
);
618 if (pmd_none_or_clear_bad(src_pmd
))
620 if (copy_pte_range(dst_mm
, src_mm
, dst_pmd
, src_pmd
,
623 } while (dst_pmd
++, src_pmd
++, addr
= next
, addr
!= end
);
627 static inline int copy_pud_range(struct mm_struct
*dst_mm
, struct mm_struct
*src_mm
,
628 pgd_t
*dst_pgd
, pgd_t
*src_pgd
, struct vm_area_struct
*vma
,
629 unsigned long addr
, unsigned long end
)
631 pud_t
*src_pud
, *dst_pud
;
634 dst_pud
= pud_alloc(dst_mm
, dst_pgd
, addr
);
637 src_pud
= pud_offset(src_pgd
, addr
);
639 next
= pud_addr_end(addr
, end
);
640 if (pud_none_or_clear_bad(src_pud
))
642 if (copy_pmd_range(dst_mm
, src_mm
, dst_pud
, src_pud
,
645 } while (dst_pud
++, src_pud
++, addr
= next
, addr
!= end
);
649 int copy_page_range(struct mm_struct
*dst_mm
, struct mm_struct
*src_mm
,
650 struct vm_area_struct
*vma
)
652 pgd_t
*src_pgd
, *dst_pgd
;
654 unsigned long addr
= vma
->vm_start
;
655 unsigned long end
= vma
->vm_end
;
659 * Don't copy ptes where a page fault will fill them correctly.
660 * Fork becomes much lighter when there are big shared or private
661 * readonly mappings. The tradeoff is that copy_page_range is more
662 * efficient than faulting.
664 if (!(vma
->vm_flags
& (VM_HUGETLB
|VM_NONLINEAR
|VM_PFNMAP
|VM_INSERTPAGE
))) {
669 if (is_vm_hugetlb_page(vma
))
670 return copy_hugetlb_page_range(dst_mm
, src_mm
, vma
);
673 * We need to invalidate the secondary MMU mappings only when
674 * there could be a permission downgrade on the ptes of the
675 * parent mm. And a permission downgrade will only happen if
676 * is_cow_mapping() returns true.
678 if (is_cow_mapping(vma
->vm_flags
))
679 mmu_notifier_invalidate_range_start(src_mm
, addr
, end
);
682 dst_pgd
= pgd_offset(dst_mm
, addr
);
683 src_pgd
= pgd_offset(src_mm
, addr
);
685 next
= pgd_addr_end(addr
, end
);
686 if (pgd_none_or_clear_bad(src_pgd
))
688 if (unlikely(copy_pud_range(dst_mm
, src_mm
, dst_pgd
, src_pgd
,
693 } while (dst_pgd
++, src_pgd
++, addr
= next
, addr
!= end
);
695 if (is_cow_mapping(vma
->vm_flags
))
696 mmu_notifier_invalidate_range_end(src_mm
,
701 static unsigned long zap_pte_range(struct mmu_gather
*tlb
,
702 struct vm_area_struct
*vma
, pmd_t
*pmd
,
703 unsigned long addr
, unsigned long end
,
704 long *zap_work
, struct zap_details
*details
)
706 struct mm_struct
*mm
= tlb
->mm
;
712 pte
= pte_offset_map_lock(mm
, pmd
, addr
, &ptl
);
713 arch_enter_lazy_mmu_mode();
716 if (pte_none(ptent
)) {
721 (*zap_work
) -= PAGE_SIZE
;
723 if (pte_present(ptent
)) {
726 page
= vm_normal_page(vma
, addr
, ptent
);
727 if (unlikely(details
) && page
) {
729 * unmap_shared_mapping_pages() wants to
730 * invalidate cache without truncating:
731 * unmap shared but keep private pages.
733 if (details
->check_mapping
&&
734 details
->check_mapping
!= page
->mapping
)
737 * Each page->index must be checked when
738 * invalidating or truncating nonlinear.
740 if (details
->nonlinear_vma
&&
741 (page
->index
< details
->first_index
||
742 page
->index
> details
->last_index
))
745 ptent
= ptep_get_and_clear_full(mm
, addr
, pte
,
747 tlb_remove_tlb_entry(tlb
, pte
, addr
);
750 if (unlikely(details
) && details
->nonlinear_vma
751 && linear_page_index(details
->nonlinear_vma
,
752 addr
) != page
->index
)
753 set_pte_at(mm
, addr
, pte
,
754 pgoff_to_pte(page
->index
));
758 if (pte_dirty(ptent
))
759 set_page_dirty(page
);
760 if (pte_young(ptent
))
761 SetPageReferenced(page
);
764 page_remove_rmap(page
, vma
);
765 tlb_remove_page(tlb
, page
);
769 * If details->check_mapping, we leave swap entries;
770 * if details->nonlinear_vma, we leave file entries.
772 if (unlikely(details
))
774 if (!pte_file(ptent
))
775 free_swap_and_cache(pte_to_swp_entry(ptent
));
776 pte_clear_not_present_full(mm
, addr
, pte
, tlb
->fullmm
);
777 } while (pte
++, addr
+= PAGE_SIZE
, (addr
!= end
&& *zap_work
> 0));
779 add_mm_rss(mm
, file_rss
, anon_rss
);
780 arch_leave_lazy_mmu_mode();
781 pte_unmap_unlock(pte
- 1, ptl
);
786 static inline unsigned long zap_pmd_range(struct mmu_gather
*tlb
,
787 struct vm_area_struct
*vma
, pud_t
*pud
,
788 unsigned long addr
, unsigned long end
,
789 long *zap_work
, struct zap_details
*details
)
794 pmd
= pmd_offset(pud
, addr
);
796 next
= pmd_addr_end(addr
, end
);
797 if (pmd_none_or_clear_bad(pmd
)) {
801 next
= zap_pte_range(tlb
, vma
, pmd
, addr
, next
,
803 } while (pmd
++, addr
= next
, (addr
!= end
&& *zap_work
> 0));
808 static inline unsigned long zap_pud_range(struct mmu_gather
*tlb
,
809 struct vm_area_struct
*vma
, pgd_t
*pgd
,
810 unsigned long addr
, unsigned long end
,
811 long *zap_work
, struct zap_details
*details
)
816 pud
= pud_offset(pgd
, addr
);
818 next
= pud_addr_end(addr
, end
);
819 if (pud_none_or_clear_bad(pud
)) {
823 next
= zap_pmd_range(tlb
, vma
, pud
, addr
, next
,
825 } while (pud
++, addr
= next
, (addr
!= end
&& *zap_work
> 0));
830 static unsigned long unmap_page_range(struct mmu_gather
*tlb
,
831 struct vm_area_struct
*vma
,
832 unsigned long addr
, unsigned long end
,
833 long *zap_work
, struct zap_details
*details
)
838 if (details
&& !details
->check_mapping
&& !details
->nonlinear_vma
)
842 tlb_start_vma(tlb
, vma
);
843 pgd
= pgd_offset(vma
->vm_mm
, addr
);
845 next
= pgd_addr_end(addr
, end
);
846 if (pgd_none_or_clear_bad(pgd
)) {
850 next
= zap_pud_range(tlb
, vma
, pgd
, addr
, next
,
852 } while (pgd
++, addr
= next
, (addr
!= end
&& *zap_work
> 0));
853 tlb_end_vma(tlb
, vma
);
858 #ifdef CONFIG_PREEMPT
859 # define ZAP_BLOCK_SIZE (8 * PAGE_SIZE)
861 /* No preempt: go for improved straight-line efficiency */
862 # define ZAP_BLOCK_SIZE (1024 * PAGE_SIZE)
866 * unmap_vmas - unmap a range of memory covered by a list of vma's
867 * @tlbp: address of the caller's struct mmu_gather
868 * @vma: the starting vma
869 * @start_addr: virtual address at which to start unmapping
870 * @end_addr: virtual address at which to end unmapping
871 * @nr_accounted: Place number of unmapped pages in vm-accountable vma's here
872 * @details: details of nonlinear truncation or shared cache invalidation
874 * Returns the end address of the unmapping (restart addr if interrupted).
876 * Unmap all pages in the vma list.
878 * We aim to not hold locks for too long (for scheduling latency reasons).
879 * So zap pages in ZAP_BLOCK_SIZE bytecounts. This means we need to
880 * return the ending mmu_gather to the caller.
882 * Only addresses between `start' and `end' will be unmapped.
884 * The VMA list must be sorted in ascending virtual address order.
886 * unmap_vmas() assumes that the caller will flush the whole unmapped address
887 * range after unmap_vmas() returns. So the only responsibility here is to
888 * ensure that any thus-far unmapped pages are flushed before unmap_vmas()
889 * drops the lock and schedules.
891 unsigned long unmap_vmas(struct mmu_gather
**tlbp
,
892 struct vm_area_struct
*vma
, unsigned long start_addr
,
893 unsigned long end_addr
, unsigned long *nr_accounted
,
894 struct zap_details
*details
)
896 long zap_work
= ZAP_BLOCK_SIZE
;
897 unsigned long tlb_start
= 0; /* For tlb_finish_mmu */
898 int tlb_start_valid
= 0;
899 unsigned long start
= start_addr
;
900 spinlock_t
*i_mmap_lock
= details
? details
->i_mmap_lock
: NULL
;
901 int fullmm
= (*tlbp
)->fullmm
;
902 struct mm_struct
*mm
= vma
->vm_mm
;
904 mmu_notifier_invalidate_range_start(mm
, start_addr
, end_addr
);
905 for ( ; vma
&& vma
->vm_start
< end_addr
; vma
= vma
->vm_next
) {
908 start
= max(vma
->vm_start
, start_addr
);
909 if (start
>= vma
->vm_end
)
911 end
= min(vma
->vm_end
, end_addr
);
912 if (end
<= vma
->vm_start
)
915 if (vma
->vm_flags
& VM_ACCOUNT
)
916 *nr_accounted
+= (end
- start
) >> PAGE_SHIFT
;
918 while (start
!= end
) {
919 if (!tlb_start_valid
) {
924 if (unlikely(is_vm_hugetlb_page(vma
))) {
926 * It is undesirable to test vma->vm_file as it
927 * should be non-null for valid hugetlb area.
928 * However, vm_file will be NULL in the error
929 * cleanup path of do_mmap_pgoff. When
930 * hugetlbfs ->mmap method fails,
931 * do_mmap_pgoff() nullifies vma->vm_file
932 * before calling this function to clean up.
933 * Since no pte has actually been setup, it is
934 * safe to do nothing in this case.
937 unmap_hugepage_range(vma
, start
, end
, NULL
);
938 zap_work
-= (end
- start
) /
939 pages_per_huge_page(hstate_vma(vma
));
944 start
= unmap_page_range(*tlbp
, vma
,
945 start
, end
, &zap_work
, details
);
948 BUG_ON(start
!= end
);
952 tlb_finish_mmu(*tlbp
, tlb_start
, start
);
954 if (need_resched() ||
955 (i_mmap_lock
&& spin_needbreak(i_mmap_lock
))) {
963 *tlbp
= tlb_gather_mmu(vma
->vm_mm
, fullmm
);
965 zap_work
= ZAP_BLOCK_SIZE
;
969 mmu_notifier_invalidate_range_end(mm
, start_addr
, end_addr
);
970 return start
; /* which is now the end (or restart) address */
974 * zap_page_range - remove user pages in a given range
975 * @vma: vm_area_struct holding the applicable pages
976 * @address: starting address of pages to zap
977 * @size: number of bytes to zap
978 * @details: details of nonlinear truncation or shared cache invalidation
980 unsigned long zap_page_range(struct vm_area_struct
*vma
, unsigned long address
,
981 unsigned long size
, struct zap_details
*details
)
983 struct mm_struct
*mm
= vma
->vm_mm
;
984 struct mmu_gather
*tlb
;
985 unsigned long end
= address
+ size
;
986 unsigned long nr_accounted
= 0;
989 tlb
= tlb_gather_mmu(mm
, 0);
990 update_hiwater_rss(mm
);
991 end
= unmap_vmas(&tlb
, vma
, address
, end
, &nr_accounted
, details
);
993 tlb_finish_mmu(tlb
, address
, end
);
998 * zap_vma_ptes - remove ptes mapping the vma
999 * @vma: vm_area_struct holding ptes to be zapped
1000 * @address: starting address of pages to zap
1001 * @size: number of bytes to zap
1003 * This function only unmaps ptes assigned to VM_PFNMAP vmas.
1005 * The entire address range must be fully contained within the vma.
1007 * Returns 0 if successful.
1009 int zap_vma_ptes(struct vm_area_struct
*vma
, unsigned long address
,
1012 if (address
< vma
->vm_start
|| address
+ size
> vma
->vm_end
||
1013 !(vma
->vm_flags
& VM_PFNMAP
))
1015 zap_page_range(vma
, address
, size
, NULL
);
1018 EXPORT_SYMBOL_GPL(zap_vma_ptes
);
1021 * Do a quick page-table lookup for a single page.
1023 struct page
*follow_page(struct vm_area_struct
*vma
, unsigned long address
,
1032 struct mm_struct
*mm
= vma
->vm_mm
;
1034 page
= follow_huge_addr(mm
, address
, flags
& FOLL_WRITE
);
1035 if (!IS_ERR(page
)) {
1036 BUG_ON(flags
& FOLL_GET
);
1041 pgd
= pgd_offset(mm
, address
);
1042 if (pgd_none(*pgd
) || unlikely(pgd_bad(*pgd
)))
1045 pud
= pud_offset(pgd
, address
);
1048 if (pud_huge(*pud
)) {
1049 BUG_ON(flags
& FOLL_GET
);
1050 page
= follow_huge_pud(mm
, address
, pud
, flags
& FOLL_WRITE
);
1053 if (unlikely(pud_bad(*pud
)))
1056 pmd
= pmd_offset(pud
, address
);
1059 if (pmd_huge(*pmd
)) {
1060 BUG_ON(flags
& FOLL_GET
);
1061 page
= follow_huge_pmd(mm
, address
, pmd
, flags
& FOLL_WRITE
);
1064 if (unlikely(pmd_bad(*pmd
)))
1067 ptep
= pte_offset_map_lock(mm
, pmd
, address
, &ptl
);
1070 if (!pte_present(pte
))
1072 if ((flags
& FOLL_WRITE
) && !pte_write(pte
))
1074 page
= vm_normal_page(vma
, address
, pte
);
1075 if (unlikely(!page
))
1078 if (flags
& FOLL_GET
)
1080 if (flags
& FOLL_TOUCH
) {
1081 if ((flags
& FOLL_WRITE
) &&
1082 !pte_dirty(pte
) && !PageDirty(page
))
1083 set_page_dirty(page
);
1084 mark_page_accessed(page
);
1087 pte_unmap_unlock(ptep
, ptl
);
1092 pte_unmap_unlock(ptep
, ptl
);
1093 return ERR_PTR(-EFAULT
);
1096 pte_unmap_unlock(ptep
, ptl
);
1099 /* Fall through to ZERO_PAGE handling */
1102 * When core dumping an enormous anonymous area that nobody
1103 * has touched so far, we don't want to allocate page tables.
1105 if (flags
& FOLL_ANON
) {
1106 page
= ZERO_PAGE(0);
1107 if (flags
& FOLL_GET
)
1109 BUG_ON(flags
& FOLL_WRITE
);
1114 /* Can we do the FOLL_ANON optimization? */
1115 static inline int use_zero_page(struct vm_area_struct
*vma
)
1118 * We don't want to optimize FOLL_ANON for make_pages_present()
1119 * when it tries to page in a VM_LOCKED region. As to VM_SHARED,
1120 * we want to get the page from the page tables to make sure
1121 * that we serialize and update with any other user of that
1124 if (vma
->vm_flags
& (VM_LOCKED
| VM_SHARED
))
1127 * And if we have a fault routine, it's not an anonymous region.
1129 return !vma
->vm_ops
|| !vma
->vm_ops
->fault
;
1132 int get_user_pages(struct task_struct
*tsk
, struct mm_struct
*mm
,
1133 unsigned long start
, int len
, int write
, int force
,
1134 struct page
**pages
, struct vm_area_struct
**vmas
)
1137 unsigned int vm_flags
;
1142 * Require read or write permissions.
1143 * If 'force' is set, we only require the "MAY" flags.
1145 vm_flags
= write
? (VM_WRITE
| VM_MAYWRITE
) : (VM_READ
| VM_MAYREAD
);
1146 vm_flags
&= force
? (VM_MAYREAD
| VM_MAYWRITE
) : (VM_READ
| VM_WRITE
);
1150 struct vm_area_struct
*vma
;
1151 unsigned int foll_flags
;
1153 vma
= find_extend_vma(mm
, start
);
1154 if (!vma
&& in_gate_area(tsk
, start
)) {
1155 unsigned long pg
= start
& PAGE_MASK
;
1156 struct vm_area_struct
*gate_vma
= get_gate_vma(tsk
);
1161 if (write
) /* user gate pages are read-only */
1162 return i
? : -EFAULT
;
1164 pgd
= pgd_offset_k(pg
);
1166 pgd
= pgd_offset_gate(mm
, pg
);
1167 BUG_ON(pgd_none(*pgd
));
1168 pud
= pud_offset(pgd
, pg
);
1169 BUG_ON(pud_none(*pud
));
1170 pmd
= pmd_offset(pud
, pg
);
1172 return i
? : -EFAULT
;
1173 pte
= pte_offset_map(pmd
, pg
);
1174 if (pte_none(*pte
)) {
1176 return i
? : -EFAULT
;
1179 struct page
*page
= vm_normal_page(gate_vma
, start
, *pte
);
1193 if (!vma
|| (vma
->vm_flags
& (VM_IO
| VM_PFNMAP
))
1194 || !(vm_flags
& vma
->vm_flags
))
1195 return i
? : -EFAULT
;
1197 if (is_vm_hugetlb_page(vma
)) {
1198 i
= follow_hugetlb_page(mm
, vma
, pages
, vmas
,
1199 &start
, &len
, i
, write
);
1203 foll_flags
= FOLL_TOUCH
;
1205 foll_flags
|= FOLL_GET
;
1206 if (!write
&& use_zero_page(vma
))
1207 foll_flags
|= FOLL_ANON
;
1213 * If tsk is ooming, cut off its access to large memory
1214 * allocations. It has a pending SIGKILL, but it can't
1215 * be processed until returning to user space.
1217 if (unlikely(test_tsk_thread_flag(tsk
, TIF_MEMDIE
)))
1218 return i
? i
: -ENOMEM
;
1221 foll_flags
|= FOLL_WRITE
;
1224 while (!(page
= follow_page(vma
, start
, foll_flags
))) {
1226 ret
= handle_mm_fault(mm
, vma
, start
,
1227 foll_flags
& FOLL_WRITE
);
1228 if (ret
& VM_FAULT_ERROR
) {
1229 if (ret
& VM_FAULT_OOM
)
1230 return i
? i
: -ENOMEM
;
1231 else if (ret
& VM_FAULT_SIGBUS
)
1232 return i
? i
: -EFAULT
;
1235 if (ret
& VM_FAULT_MAJOR
)
1241 * The VM_FAULT_WRITE bit tells us that
1242 * do_wp_page has broken COW when necessary,
1243 * even if maybe_mkwrite decided not to set
1244 * pte_write. We can thus safely do subsequent
1245 * page lookups as if they were reads.
1247 if (ret
& VM_FAULT_WRITE
)
1248 foll_flags
&= ~FOLL_WRITE
;
1253 return i
? i
: PTR_ERR(page
);
1257 flush_anon_page(vma
, page
, start
);
1258 flush_dcache_page(page
);
1265 } while (len
&& start
< vma
->vm_end
);
1269 EXPORT_SYMBOL(get_user_pages
);
1271 pte_t
*get_locked_pte(struct mm_struct
*mm
, unsigned long addr
,
1274 pgd_t
* pgd
= pgd_offset(mm
, addr
);
1275 pud_t
* pud
= pud_alloc(mm
, pgd
, addr
);
1277 pmd_t
* pmd
= pmd_alloc(mm
, pud
, addr
);
1279 return pte_alloc_map_lock(mm
, pmd
, addr
, ptl
);
1285 * This is the old fallback for page remapping.
1287 * For historical reasons, it only allows reserved pages. Only
1288 * old drivers should use this, and they needed to mark their
1289 * pages reserved for the old functions anyway.
1291 static int insert_page(struct vm_area_struct
*vma
, unsigned long addr
,
1292 struct page
*page
, pgprot_t prot
)
1294 struct mm_struct
*mm
= vma
->vm_mm
;
1299 retval
= mem_cgroup_charge(page
, mm
, GFP_KERNEL
);
1307 flush_dcache_page(page
);
1308 pte
= get_locked_pte(mm
, addr
, &ptl
);
1312 if (!pte_none(*pte
))
1315 /* Ok, finally just insert the thing.. */
1317 inc_mm_counter(mm
, file_rss
);
1318 page_add_file_rmap(page
);
1319 set_pte_at(mm
, addr
, pte
, mk_pte(page
, prot
));
1322 pte_unmap_unlock(pte
, ptl
);
1325 pte_unmap_unlock(pte
, ptl
);
1327 mem_cgroup_uncharge_page(page
);
1333 * vm_insert_page - insert single page into user vma
1334 * @vma: user vma to map to
1335 * @addr: target user address of this page
1336 * @page: source kernel page
1338 * This allows drivers to insert individual pages they've allocated
1341 * The page has to be a nice clean _individual_ kernel allocation.
1342 * If you allocate a compound page, you need to have marked it as
1343 * such (__GFP_COMP), or manually just split the page up yourself
1344 * (see split_page()).
1346 * NOTE! Traditionally this was done with "remap_pfn_range()" which
1347 * took an arbitrary page protection parameter. This doesn't allow
1348 * that. Your vma protection will have to be set up correctly, which
1349 * means that if you want a shared writable mapping, you'd better
1350 * ask for a shared writable mapping!
1352 * The page does not need to be reserved.
1354 int vm_insert_page(struct vm_area_struct
*vma
, unsigned long addr
,
1357 if (addr
< vma
->vm_start
|| addr
>= vma
->vm_end
)
1359 if (!page_count(page
))
1361 vma
->vm_flags
|= VM_INSERTPAGE
;
1362 return insert_page(vma
, addr
, page
, vma
->vm_page_prot
);
1364 EXPORT_SYMBOL(vm_insert_page
);
1366 static int insert_pfn(struct vm_area_struct
*vma
, unsigned long addr
,
1367 unsigned long pfn
, pgprot_t prot
)
1369 struct mm_struct
*mm
= vma
->vm_mm
;
1375 pte
= get_locked_pte(mm
, addr
, &ptl
);
1379 if (!pte_none(*pte
))
1382 /* Ok, finally just insert the thing.. */
1383 entry
= pte_mkspecial(pfn_pte(pfn
, prot
));
1384 set_pte_at(mm
, addr
, pte
, entry
);
1385 update_mmu_cache(vma
, addr
, entry
); /* XXX: why not for insert_page? */
1389 pte_unmap_unlock(pte
, ptl
);
1395 * vm_insert_pfn - insert single pfn into user vma
1396 * @vma: user vma to map to
1397 * @addr: target user address of this page
1398 * @pfn: source kernel pfn
1400 * Similar to vm_inert_page, this allows drivers to insert individual pages
1401 * they've allocated into a user vma. Same comments apply.
1403 * This function should only be called from a vm_ops->fault handler, and
1404 * in that case the handler should return NULL.
1406 * vma cannot be a COW mapping.
1408 * As this is called only for pages that do not currently exist, we
1409 * do not need to flush old virtual caches or the TLB.
1411 int vm_insert_pfn(struct vm_area_struct
*vma
, unsigned long addr
,
1415 * Technically, architectures with pte_special can avoid all these
1416 * restrictions (same for remap_pfn_range). However we would like
1417 * consistency in testing and feature parity among all, so we should
1418 * try to keep these invariants in place for everybody.
1420 BUG_ON(!(vma
->vm_flags
& (VM_PFNMAP
|VM_MIXEDMAP
)));
1421 BUG_ON((vma
->vm_flags
& (VM_PFNMAP
|VM_MIXEDMAP
)) ==
1422 (VM_PFNMAP
|VM_MIXEDMAP
));
1423 BUG_ON((vma
->vm_flags
& VM_PFNMAP
) && is_cow_mapping(vma
->vm_flags
));
1424 BUG_ON((vma
->vm_flags
& VM_MIXEDMAP
) && pfn_valid(pfn
));
1426 if (addr
< vma
->vm_start
|| addr
>= vma
->vm_end
)
1428 return insert_pfn(vma
, addr
, pfn
, vma
->vm_page_prot
);
1430 EXPORT_SYMBOL(vm_insert_pfn
);
1432 int vm_insert_mixed(struct vm_area_struct
*vma
, unsigned long addr
,
1435 BUG_ON(!(vma
->vm_flags
& VM_MIXEDMAP
));
1437 if (addr
< vma
->vm_start
|| addr
>= vma
->vm_end
)
1441 * If we don't have pte special, then we have to use the pfn_valid()
1442 * based VM_MIXEDMAP scheme (see vm_normal_page), and thus we *must*
1443 * refcount the page if pfn_valid is true (hence insert_page rather
1446 if (!HAVE_PTE_SPECIAL
&& pfn_valid(pfn
)) {
1449 page
= pfn_to_page(pfn
);
1450 return insert_page(vma
, addr
, page
, vma
->vm_page_prot
);
1452 return insert_pfn(vma
, addr
, pfn
, vma
->vm_page_prot
);
1454 EXPORT_SYMBOL(vm_insert_mixed
);
1457 * maps a range of physical memory into the requested pages. the old
1458 * mappings are removed. any references to nonexistent pages results
1459 * in null mappings (currently treated as "copy-on-access")
1461 static int remap_pte_range(struct mm_struct
*mm
, pmd_t
*pmd
,
1462 unsigned long addr
, unsigned long end
,
1463 unsigned long pfn
, pgprot_t prot
)
1468 pte
= pte_alloc_map_lock(mm
, pmd
, addr
, &ptl
);
1471 arch_enter_lazy_mmu_mode();
1473 BUG_ON(!pte_none(*pte
));
1474 set_pte_at(mm
, addr
, pte
, pte_mkspecial(pfn_pte(pfn
, prot
)));
1476 } while (pte
++, addr
+= PAGE_SIZE
, addr
!= end
);
1477 arch_leave_lazy_mmu_mode();
1478 pte_unmap_unlock(pte
- 1, ptl
);
1482 static inline int remap_pmd_range(struct mm_struct
*mm
, pud_t
*pud
,
1483 unsigned long addr
, unsigned long end
,
1484 unsigned long pfn
, pgprot_t prot
)
1489 pfn
-= addr
>> PAGE_SHIFT
;
1490 pmd
= pmd_alloc(mm
, pud
, addr
);
1494 next
= pmd_addr_end(addr
, end
);
1495 if (remap_pte_range(mm
, pmd
, addr
, next
,
1496 pfn
+ (addr
>> PAGE_SHIFT
), prot
))
1498 } while (pmd
++, addr
= next
, addr
!= end
);
1502 static inline int remap_pud_range(struct mm_struct
*mm
, pgd_t
*pgd
,
1503 unsigned long addr
, unsigned long end
,
1504 unsigned long pfn
, pgprot_t prot
)
1509 pfn
-= addr
>> PAGE_SHIFT
;
1510 pud
= pud_alloc(mm
, pgd
, addr
);
1514 next
= pud_addr_end(addr
, end
);
1515 if (remap_pmd_range(mm
, pud
, addr
, next
,
1516 pfn
+ (addr
>> PAGE_SHIFT
), prot
))
1518 } while (pud
++, addr
= next
, addr
!= end
);
1523 * remap_pfn_range - remap kernel memory to userspace
1524 * @vma: user vma to map to
1525 * @addr: target user address to start at
1526 * @pfn: physical address of kernel memory
1527 * @size: size of map area
1528 * @prot: page protection flags for this mapping
1530 * Note: this is only safe if the mm semaphore is held when called.
1532 int remap_pfn_range(struct vm_area_struct
*vma
, unsigned long addr
,
1533 unsigned long pfn
, unsigned long size
, pgprot_t prot
)
1537 unsigned long end
= addr
+ PAGE_ALIGN(size
);
1538 struct mm_struct
*mm
= vma
->vm_mm
;
1542 * Physically remapped pages are special. Tell the
1543 * rest of the world about it:
1544 * VM_IO tells people not to look at these pages
1545 * (accesses can have side effects).
1546 * VM_RESERVED is specified all over the place, because
1547 * in 2.4 it kept swapout's vma scan off this vma; but
1548 * in 2.6 the LRU scan won't even find its pages, so this
1549 * flag means no more than count its pages in reserved_vm,
1550 * and omit it from core dump, even when VM_IO turned off.
1551 * VM_PFNMAP tells the core MM that the base pages are just
1552 * raw PFN mappings, and do not have a "struct page" associated
1555 * There's a horrible special case to handle copy-on-write
1556 * behaviour that some programs depend on. We mark the "original"
1557 * un-COW'ed pages by matching them up with "vma->vm_pgoff".
1559 if (is_cow_mapping(vma
->vm_flags
)) {
1560 if (addr
!= vma
->vm_start
|| end
!= vma
->vm_end
)
1562 vma
->vm_pgoff
= pfn
;
1565 vma
->vm_flags
|= VM_IO
| VM_RESERVED
| VM_PFNMAP
;
1567 BUG_ON(addr
>= end
);
1568 pfn
-= addr
>> PAGE_SHIFT
;
1569 pgd
= pgd_offset(mm
, addr
);
1570 flush_cache_range(vma
, addr
, end
);
1572 next
= pgd_addr_end(addr
, end
);
1573 err
= remap_pud_range(mm
, pgd
, addr
, next
,
1574 pfn
+ (addr
>> PAGE_SHIFT
), prot
);
1577 } while (pgd
++, addr
= next
, addr
!= end
);
1580 EXPORT_SYMBOL(remap_pfn_range
);
1582 static int apply_to_pte_range(struct mm_struct
*mm
, pmd_t
*pmd
,
1583 unsigned long addr
, unsigned long end
,
1584 pte_fn_t fn
, void *data
)
1589 spinlock_t
*uninitialized_var(ptl
);
1591 pte
= (mm
== &init_mm
) ?
1592 pte_alloc_kernel(pmd
, addr
) :
1593 pte_alloc_map_lock(mm
, pmd
, addr
, &ptl
);
1597 BUG_ON(pmd_huge(*pmd
));
1599 token
= pmd_pgtable(*pmd
);
1602 err
= fn(pte
, token
, addr
, data
);
1605 } while (pte
++, addr
+= PAGE_SIZE
, addr
!= end
);
1608 pte_unmap_unlock(pte
-1, ptl
);
1612 static int apply_to_pmd_range(struct mm_struct
*mm
, pud_t
*pud
,
1613 unsigned long addr
, unsigned long end
,
1614 pte_fn_t fn
, void *data
)
1620 BUG_ON(pud_huge(*pud
));
1622 pmd
= pmd_alloc(mm
, pud
, addr
);
1626 next
= pmd_addr_end(addr
, end
);
1627 err
= apply_to_pte_range(mm
, pmd
, addr
, next
, fn
, data
);
1630 } while (pmd
++, addr
= next
, addr
!= end
);
1634 static int apply_to_pud_range(struct mm_struct
*mm
, pgd_t
*pgd
,
1635 unsigned long addr
, unsigned long end
,
1636 pte_fn_t fn
, void *data
)
1642 pud
= pud_alloc(mm
, pgd
, addr
);
1646 next
= pud_addr_end(addr
, end
);
1647 err
= apply_to_pmd_range(mm
, pud
, addr
, next
, fn
, data
);
1650 } while (pud
++, addr
= next
, addr
!= end
);
1655 * Scan a region of virtual memory, filling in page tables as necessary
1656 * and calling a provided function on each leaf page table.
1658 int apply_to_page_range(struct mm_struct
*mm
, unsigned long addr
,
1659 unsigned long size
, pte_fn_t fn
, void *data
)
1663 unsigned long start
= addr
, end
= addr
+ size
;
1666 BUG_ON(addr
>= end
);
1667 mmu_notifier_invalidate_range_start(mm
, start
, end
);
1668 pgd
= pgd_offset(mm
, addr
);
1670 next
= pgd_addr_end(addr
, end
);
1671 err
= apply_to_pud_range(mm
, pgd
, addr
, next
, fn
, data
);
1674 } while (pgd
++, addr
= next
, addr
!= end
);
1675 mmu_notifier_invalidate_range_end(mm
, start
, end
);
1678 EXPORT_SYMBOL_GPL(apply_to_page_range
);
1681 * handle_pte_fault chooses page fault handler according to an entry
1682 * which was read non-atomically. Before making any commitment, on
1683 * those architectures or configurations (e.g. i386 with PAE) which
1684 * might give a mix of unmatched parts, do_swap_page and do_file_page
1685 * must check under lock before unmapping the pte and proceeding
1686 * (but do_wp_page is only called after already making such a check;
1687 * and do_anonymous_page and do_no_page can safely check later on).
1689 static inline int pte_unmap_same(struct mm_struct
*mm
, pmd_t
*pmd
,
1690 pte_t
*page_table
, pte_t orig_pte
)
1693 #if defined(CONFIG_SMP) || defined(CONFIG_PREEMPT)
1694 if (sizeof(pte_t
) > sizeof(unsigned long)) {
1695 spinlock_t
*ptl
= pte_lockptr(mm
, pmd
);
1697 same
= pte_same(*page_table
, orig_pte
);
1701 pte_unmap(page_table
);
1706 * Do pte_mkwrite, but only if the vma says VM_WRITE. We do this when
1707 * servicing faults for write access. In the normal case, do always want
1708 * pte_mkwrite. But get_user_pages can cause write faults for mappings
1709 * that do not have writing enabled, when used by access_process_vm.
1711 static inline pte_t
maybe_mkwrite(pte_t pte
, struct vm_area_struct
*vma
)
1713 if (likely(vma
->vm_flags
& VM_WRITE
))
1714 pte
= pte_mkwrite(pte
);
1718 static inline void cow_user_page(struct page
*dst
, struct page
*src
, unsigned long va
, struct vm_area_struct
*vma
)
1721 * If the source page was a PFN mapping, we don't have
1722 * a "struct page" for it. We do a best-effort copy by
1723 * just copying from the original user address. If that
1724 * fails, we just zero-fill it. Live with it.
1726 if (unlikely(!src
)) {
1727 void *kaddr
= kmap_atomic(dst
, KM_USER0
);
1728 void __user
*uaddr
= (void __user
*)(va
& PAGE_MASK
);
1731 * This really shouldn't fail, because the page is there
1732 * in the page tables. But it might just be unreadable,
1733 * in which case we just give up and fill the result with
1736 if (__copy_from_user_inatomic(kaddr
, uaddr
, PAGE_SIZE
))
1737 memset(kaddr
, 0, PAGE_SIZE
);
1738 kunmap_atomic(kaddr
, KM_USER0
);
1739 flush_dcache_page(dst
);
1741 copy_user_highpage(dst
, src
, va
, vma
);
1745 * This routine handles present pages, when users try to write
1746 * to a shared page. It is done by copying the page to a new address
1747 * and decrementing the shared-page counter for the old page.
1749 * Note that this routine assumes that the protection checks have been
1750 * done by the caller (the low-level page fault routine in most cases).
1751 * Thus we can safely just mark it writable once we've done any necessary
1754 * We also mark the page dirty at this point even though the page will
1755 * change only once the write actually happens. This avoids a few races,
1756 * and potentially makes it more efficient.
1758 * We enter with non-exclusive mmap_sem (to exclude vma changes,
1759 * but allow concurrent faults), with pte both mapped and locked.
1760 * We return with mmap_sem still held, but pte unmapped and unlocked.
1762 static int do_wp_page(struct mm_struct
*mm
, struct vm_area_struct
*vma
,
1763 unsigned long address
, pte_t
*page_table
, pmd_t
*pmd
,
1764 spinlock_t
*ptl
, pte_t orig_pte
)
1766 struct page
*old_page
, *new_page
;
1768 int reuse
= 0, ret
= 0;
1769 int page_mkwrite
= 0;
1770 struct page
*dirty_page
= NULL
;
1772 old_page
= vm_normal_page(vma
, address
, orig_pte
);
1775 * VM_MIXEDMAP !pfn_valid() case
1777 * We should not cow pages in a shared writeable mapping.
1778 * Just mark the pages writable as we can't do any dirty
1779 * accounting on raw pfn maps.
1781 if ((vma
->vm_flags
& (VM_WRITE
|VM_SHARED
)) ==
1782 (VM_WRITE
|VM_SHARED
))
1788 * Take out anonymous pages first, anonymous shared vmas are
1789 * not dirty accountable.
1791 if (PageAnon(old_page
)) {
1792 if (trylock_page(old_page
)) {
1793 reuse
= can_share_swap_page(old_page
);
1794 unlock_page(old_page
);
1796 } else if (unlikely((vma
->vm_flags
& (VM_WRITE
|VM_SHARED
)) ==
1797 (VM_WRITE
|VM_SHARED
))) {
1799 * Only catch write-faults on shared writable pages,
1800 * read-only shared pages can get COWed by
1801 * get_user_pages(.write=1, .force=1).
1803 if (vma
->vm_ops
&& vma
->vm_ops
->page_mkwrite
) {
1805 * Notify the address space that the page is about to
1806 * become writable so that it can prohibit this or wait
1807 * for the page to get into an appropriate state.
1809 * We do this without the lock held, so that it can
1810 * sleep if it needs to.
1812 page_cache_get(old_page
);
1813 pte_unmap_unlock(page_table
, ptl
);
1815 if (vma
->vm_ops
->page_mkwrite(vma
, old_page
) < 0)
1816 goto unwritable_page
;
1819 * Since we dropped the lock we need to revalidate
1820 * the PTE as someone else may have changed it. If
1821 * they did, we just return, as we can count on the
1822 * MMU to tell us if they didn't also make it writable.
1824 page_table
= pte_offset_map_lock(mm
, pmd
, address
,
1826 page_cache_release(old_page
);
1827 if (!pte_same(*page_table
, orig_pte
))
1832 dirty_page
= old_page
;
1833 get_page(dirty_page
);
1839 flush_cache_page(vma
, address
, pte_pfn(orig_pte
));
1840 entry
= pte_mkyoung(orig_pte
);
1841 entry
= maybe_mkwrite(pte_mkdirty(entry
), vma
);
1842 if (ptep_set_access_flags(vma
, address
, page_table
, entry
,1))
1843 update_mmu_cache(vma
, address
, entry
);
1844 ret
|= VM_FAULT_WRITE
;
1849 * Ok, we need to copy. Oh, well..
1851 page_cache_get(old_page
);
1853 pte_unmap_unlock(page_table
, ptl
);
1855 if (unlikely(anon_vma_prepare(vma
)))
1857 VM_BUG_ON(old_page
== ZERO_PAGE(0));
1858 new_page
= alloc_page_vma(GFP_HIGHUSER_MOVABLE
, vma
, address
);
1861 cow_user_page(new_page
, old_page
, address
, vma
);
1862 __SetPageUptodate(new_page
);
1864 if (mem_cgroup_charge(new_page
, mm
, GFP_KERNEL
))
1868 * Re-check the pte - we dropped the lock
1870 page_table
= pte_offset_map_lock(mm
, pmd
, address
, &ptl
);
1871 if (likely(pte_same(*page_table
, orig_pte
))) {
1873 if (!PageAnon(old_page
)) {
1874 dec_mm_counter(mm
, file_rss
);
1875 inc_mm_counter(mm
, anon_rss
);
1878 inc_mm_counter(mm
, anon_rss
);
1879 flush_cache_page(vma
, address
, pte_pfn(orig_pte
));
1880 entry
= mk_pte(new_page
, vma
->vm_page_prot
);
1881 entry
= maybe_mkwrite(pte_mkdirty(entry
), vma
);
1883 * Clear the pte entry and flush it first, before updating the
1884 * pte with the new entry. This will avoid a race condition
1885 * seen in the presence of one thread doing SMC and another
1888 ptep_clear_flush_notify(vma
, address
, page_table
);
1889 set_pte_at(mm
, address
, page_table
, entry
);
1890 update_mmu_cache(vma
, address
, entry
);
1891 SetPageSwapBacked(new_page
);
1892 lru_cache_add_active(new_page
);
1893 page_add_new_anon_rmap(new_page
, vma
, address
);
1897 * Only after switching the pte to the new page may
1898 * we remove the mapcount here. Otherwise another
1899 * process may come and find the rmap count decremented
1900 * before the pte is switched to the new page, and
1901 * "reuse" the old page writing into it while our pte
1902 * here still points into it and can be read by other
1905 * The critical issue is to order this
1906 * page_remove_rmap with the ptp_clear_flush above.
1907 * Those stores are ordered by (if nothing else,)
1908 * the barrier present in the atomic_add_negative
1909 * in page_remove_rmap.
1911 * Then the TLB flush in ptep_clear_flush ensures that
1912 * no process can access the old page before the
1913 * decremented mapcount is visible. And the old page
1914 * cannot be reused until after the decremented
1915 * mapcount is visible. So transitively, TLBs to
1916 * old page will be flushed before it can be reused.
1918 page_remove_rmap(old_page
, vma
);
1921 /* Free the old page.. */
1922 new_page
= old_page
;
1923 ret
|= VM_FAULT_WRITE
;
1925 mem_cgroup_uncharge_page(new_page
);
1928 page_cache_release(new_page
);
1930 page_cache_release(old_page
);
1932 pte_unmap_unlock(page_table
, ptl
);
1935 file_update_time(vma
->vm_file
);
1938 * Yes, Virginia, this is actually required to prevent a race
1939 * with clear_page_dirty_for_io() from clearing the page dirty
1940 * bit after it clear all dirty ptes, but before a racing
1941 * do_wp_page installs a dirty pte.
1943 * do_no_page is protected similarly.
1945 wait_on_page_locked(dirty_page
);
1946 set_page_dirty_balance(dirty_page
, page_mkwrite
);
1947 put_page(dirty_page
);
1951 page_cache_release(new_page
);
1954 page_cache_release(old_page
);
1955 return VM_FAULT_OOM
;
1958 page_cache_release(old_page
);
1959 return VM_FAULT_SIGBUS
;
1963 * Helper functions for unmap_mapping_range().
1965 * __ Notes on dropping i_mmap_lock to reduce latency while unmapping __
1967 * We have to restart searching the prio_tree whenever we drop the lock,
1968 * since the iterator is only valid while the lock is held, and anyway
1969 * a later vma might be split and reinserted earlier while lock dropped.
1971 * The list of nonlinear vmas could be handled more efficiently, using
1972 * a placeholder, but handle it in the same way until a need is shown.
1973 * It is important to search the prio_tree before nonlinear list: a vma
1974 * may become nonlinear and be shifted from prio_tree to nonlinear list
1975 * while the lock is dropped; but never shifted from list to prio_tree.
1977 * In order to make forward progress despite restarting the search,
1978 * vm_truncate_count is used to mark a vma as now dealt with, so we can
1979 * quickly skip it next time around. Since the prio_tree search only
1980 * shows us those vmas affected by unmapping the range in question, we
1981 * can't efficiently keep all vmas in step with mapping->truncate_count:
1982 * so instead reset them all whenever it wraps back to 0 (then go to 1).
1983 * mapping->truncate_count and vma->vm_truncate_count are protected by
1986 * In order to make forward progress despite repeatedly restarting some
1987 * large vma, note the restart_addr from unmap_vmas when it breaks out:
1988 * and restart from that address when we reach that vma again. It might
1989 * have been split or merged, shrunk or extended, but never shifted: so
1990 * restart_addr remains valid so long as it remains in the vma's range.
1991 * unmap_mapping_range forces truncate_count to leap over page-aligned
1992 * values so we can save vma's restart_addr in its truncate_count field.
1994 #define is_restart_addr(truncate_count) (!((truncate_count) & ~PAGE_MASK))
1996 static void reset_vma_truncate_counts(struct address_space
*mapping
)
1998 struct vm_area_struct
*vma
;
1999 struct prio_tree_iter iter
;
2001 vma_prio_tree_foreach(vma
, &iter
, &mapping
->i_mmap
, 0, ULONG_MAX
)
2002 vma
->vm_truncate_count
= 0;
2003 list_for_each_entry(vma
, &mapping
->i_mmap_nonlinear
, shared
.vm_set
.list
)
2004 vma
->vm_truncate_count
= 0;
2007 static int unmap_mapping_range_vma(struct vm_area_struct
*vma
,
2008 unsigned long start_addr
, unsigned long end_addr
,
2009 struct zap_details
*details
)
2011 unsigned long restart_addr
;
2015 * files that support invalidating or truncating portions of the
2016 * file from under mmaped areas must have their ->fault function
2017 * return a locked page (and set VM_FAULT_LOCKED in the return).
2018 * This provides synchronisation against concurrent unmapping here.
2022 restart_addr
= vma
->vm_truncate_count
;
2023 if (is_restart_addr(restart_addr
) && start_addr
< restart_addr
) {
2024 start_addr
= restart_addr
;
2025 if (start_addr
>= end_addr
) {
2026 /* Top of vma has been split off since last time */
2027 vma
->vm_truncate_count
= details
->truncate_count
;
2032 restart_addr
= zap_page_range(vma
, start_addr
,
2033 end_addr
- start_addr
, details
);
2034 need_break
= need_resched() || spin_needbreak(details
->i_mmap_lock
);
2036 if (restart_addr
>= end_addr
) {
2037 /* We have now completed this vma: mark it so */
2038 vma
->vm_truncate_count
= details
->truncate_count
;
2042 /* Note restart_addr in vma's truncate_count field */
2043 vma
->vm_truncate_count
= restart_addr
;
2048 spin_unlock(details
->i_mmap_lock
);
2050 spin_lock(details
->i_mmap_lock
);
2054 static inline void unmap_mapping_range_tree(struct prio_tree_root
*root
,
2055 struct zap_details
*details
)
2057 struct vm_area_struct
*vma
;
2058 struct prio_tree_iter iter
;
2059 pgoff_t vba
, vea
, zba
, zea
;
2062 vma_prio_tree_foreach(vma
, &iter
, root
,
2063 details
->first_index
, details
->last_index
) {
2064 /* Skip quickly over those we have already dealt with */
2065 if (vma
->vm_truncate_count
== details
->truncate_count
)
2068 vba
= vma
->vm_pgoff
;
2069 vea
= vba
+ ((vma
->vm_end
- vma
->vm_start
) >> PAGE_SHIFT
) - 1;
2070 /* Assume for now that PAGE_CACHE_SHIFT == PAGE_SHIFT */
2071 zba
= details
->first_index
;
2074 zea
= details
->last_index
;
2078 if (unmap_mapping_range_vma(vma
,
2079 ((zba
- vba
) << PAGE_SHIFT
) + vma
->vm_start
,
2080 ((zea
- vba
+ 1) << PAGE_SHIFT
) + vma
->vm_start
,
2086 static inline void unmap_mapping_range_list(struct list_head
*head
,
2087 struct zap_details
*details
)
2089 struct vm_area_struct
*vma
;
2092 * In nonlinear VMAs there is no correspondence between virtual address
2093 * offset and file offset. So we must perform an exhaustive search
2094 * across *all* the pages in each nonlinear VMA, not just the pages
2095 * whose virtual address lies outside the file truncation point.
2098 list_for_each_entry(vma
, head
, shared
.vm_set
.list
) {
2099 /* Skip quickly over those we have already dealt with */
2100 if (vma
->vm_truncate_count
== details
->truncate_count
)
2102 details
->nonlinear_vma
= vma
;
2103 if (unmap_mapping_range_vma(vma
, vma
->vm_start
,
2104 vma
->vm_end
, details
) < 0)
2110 * unmap_mapping_range - unmap the portion of all mmaps in the specified address_space corresponding to the specified page range in the underlying file.
2111 * @mapping: the address space containing mmaps to be unmapped.
2112 * @holebegin: byte in first page to unmap, relative to the start of
2113 * the underlying file. This will be rounded down to a PAGE_SIZE
2114 * boundary. Note that this is different from vmtruncate(), which
2115 * must keep the partial page. In contrast, we must get rid of
2117 * @holelen: size of prospective hole in bytes. This will be rounded
2118 * up to a PAGE_SIZE boundary. A holelen of zero truncates to the
2120 * @even_cows: 1 when truncating a file, unmap even private COWed pages;
2121 * but 0 when invalidating pagecache, don't throw away private data.
2123 void unmap_mapping_range(struct address_space
*mapping
,
2124 loff_t
const holebegin
, loff_t
const holelen
, int even_cows
)
2126 struct zap_details details
;
2127 pgoff_t hba
= holebegin
>> PAGE_SHIFT
;
2128 pgoff_t hlen
= (holelen
+ PAGE_SIZE
- 1) >> PAGE_SHIFT
;
2130 /* Check for overflow. */
2131 if (sizeof(holelen
) > sizeof(hlen
)) {
2133 (holebegin
+ holelen
+ PAGE_SIZE
- 1) >> PAGE_SHIFT
;
2134 if (holeend
& ~(long long)ULONG_MAX
)
2135 hlen
= ULONG_MAX
- hba
+ 1;
2138 details
.check_mapping
= even_cows
? NULL
: mapping
;
2139 details
.nonlinear_vma
= NULL
;
2140 details
.first_index
= hba
;
2141 details
.last_index
= hba
+ hlen
- 1;
2142 if (details
.last_index
< details
.first_index
)
2143 details
.last_index
= ULONG_MAX
;
2144 details
.i_mmap_lock
= &mapping
->i_mmap_lock
;
2146 spin_lock(&mapping
->i_mmap_lock
);
2148 /* Protect against endless unmapping loops */
2149 mapping
->truncate_count
++;
2150 if (unlikely(is_restart_addr(mapping
->truncate_count
))) {
2151 if (mapping
->truncate_count
== 0)
2152 reset_vma_truncate_counts(mapping
);
2153 mapping
->truncate_count
++;
2155 details
.truncate_count
= mapping
->truncate_count
;
2157 if (unlikely(!prio_tree_empty(&mapping
->i_mmap
)))
2158 unmap_mapping_range_tree(&mapping
->i_mmap
, &details
);
2159 if (unlikely(!list_empty(&mapping
->i_mmap_nonlinear
)))
2160 unmap_mapping_range_list(&mapping
->i_mmap_nonlinear
, &details
);
2161 spin_unlock(&mapping
->i_mmap_lock
);
2163 EXPORT_SYMBOL(unmap_mapping_range
);
2166 * vmtruncate - unmap mappings "freed" by truncate() syscall
2167 * @inode: inode of the file used
2168 * @offset: file offset to start truncating
2170 * NOTE! We have to be ready to update the memory sharing
2171 * between the file and the memory map for a potential last
2172 * incomplete page. Ugly, but necessary.
2174 int vmtruncate(struct inode
* inode
, loff_t offset
)
2176 if (inode
->i_size
< offset
) {
2177 unsigned long limit
;
2179 limit
= current
->signal
->rlim
[RLIMIT_FSIZE
].rlim_cur
;
2180 if (limit
!= RLIM_INFINITY
&& offset
> limit
)
2182 if (offset
> inode
->i_sb
->s_maxbytes
)
2184 i_size_write(inode
, offset
);
2186 struct address_space
*mapping
= inode
->i_mapping
;
2189 * truncation of in-use swapfiles is disallowed - it would
2190 * cause subsequent swapout to scribble on the now-freed
2193 if (IS_SWAPFILE(inode
))
2195 i_size_write(inode
, offset
);
2198 * unmap_mapping_range is called twice, first simply for
2199 * efficiency so that truncate_inode_pages does fewer
2200 * single-page unmaps. However after this first call, and
2201 * before truncate_inode_pages finishes, it is possible for
2202 * private pages to be COWed, which remain after
2203 * truncate_inode_pages finishes, hence the second
2204 * unmap_mapping_range call must be made for correctness.
2206 unmap_mapping_range(mapping
, offset
+ PAGE_SIZE
- 1, 0, 1);
2207 truncate_inode_pages(mapping
, offset
);
2208 unmap_mapping_range(mapping
, offset
+ PAGE_SIZE
- 1, 0, 1);
2211 if (inode
->i_op
&& inode
->i_op
->truncate
)
2212 inode
->i_op
->truncate(inode
);
2216 send_sig(SIGXFSZ
, current
, 0);
2220 EXPORT_SYMBOL(vmtruncate
);
2222 int vmtruncate_range(struct inode
*inode
, loff_t offset
, loff_t end
)
2224 struct address_space
*mapping
= inode
->i_mapping
;
2227 * If the underlying filesystem is not going to provide
2228 * a way to truncate a range of blocks (punch a hole) -
2229 * we should return failure right now.
2231 if (!inode
->i_op
|| !inode
->i_op
->truncate_range
)
2234 mutex_lock(&inode
->i_mutex
);
2235 down_write(&inode
->i_alloc_sem
);
2236 unmap_mapping_range(mapping
, offset
, (end
- offset
), 1);
2237 truncate_inode_pages_range(mapping
, offset
, end
);
2238 unmap_mapping_range(mapping
, offset
, (end
- offset
), 1);
2239 inode
->i_op
->truncate_range(inode
, offset
, end
);
2240 up_write(&inode
->i_alloc_sem
);
2241 mutex_unlock(&inode
->i_mutex
);
2247 * We enter with non-exclusive mmap_sem (to exclude vma changes,
2248 * but allow concurrent faults), and pte mapped but not yet locked.
2249 * We return with mmap_sem still held, but pte unmapped and unlocked.
2251 static int do_swap_page(struct mm_struct
*mm
, struct vm_area_struct
*vma
,
2252 unsigned long address
, pte_t
*page_table
, pmd_t
*pmd
,
2253 int write_access
, pte_t orig_pte
)
2261 if (!pte_unmap_same(mm
, pmd
, page_table
, orig_pte
))
2264 entry
= pte_to_swp_entry(orig_pte
);
2265 if (is_migration_entry(entry
)) {
2266 migration_entry_wait(mm
, pmd
, address
);
2269 delayacct_set_flag(DELAYACCT_PF_SWAPIN
);
2270 page
= lookup_swap_cache(entry
);
2272 grab_swap_token(); /* Contend for token _before_ read-in */
2273 page
= swapin_readahead(entry
,
2274 GFP_HIGHUSER_MOVABLE
, vma
, address
);
2277 * Back out if somebody else faulted in this pte
2278 * while we released the pte lock.
2280 page_table
= pte_offset_map_lock(mm
, pmd
, address
, &ptl
);
2281 if (likely(pte_same(*page_table
, orig_pte
)))
2283 delayacct_clear_flag(DELAYACCT_PF_SWAPIN
);
2287 /* Had to read the page from swap area: Major fault */
2288 ret
= VM_FAULT_MAJOR
;
2289 count_vm_event(PGMAJFAULT
);
2292 if (mem_cgroup_charge(page
, mm
, GFP_KERNEL
)) {
2293 delayacct_clear_flag(DELAYACCT_PF_SWAPIN
);
2298 mark_page_accessed(page
);
2300 delayacct_clear_flag(DELAYACCT_PF_SWAPIN
);
2303 * Back out if somebody else already faulted in this pte.
2305 page_table
= pte_offset_map_lock(mm
, pmd
, address
, &ptl
);
2306 if (unlikely(!pte_same(*page_table
, orig_pte
)))
2309 if (unlikely(!PageUptodate(page
))) {
2310 ret
= VM_FAULT_SIGBUS
;
2314 /* The page isn't present yet, go ahead with the fault. */
2316 inc_mm_counter(mm
, anon_rss
);
2317 pte
= mk_pte(page
, vma
->vm_page_prot
);
2318 if (write_access
&& can_share_swap_page(page
)) {
2319 pte
= maybe_mkwrite(pte_mkdirty(pte
), vma
);
2323 flush_icache_page(vma
, page
);
2324 set_pte_at(mm
, address
, page_table
, pte
);
2325 page_add_anon_rmap(page
, vma
, address
);
2329 remove_exclusive_swap_page(page
);
2333 ret
|= do_wp_page(mm
, vma
, address
, page_table
, pmd
, ptl
, pte
);
2334 if (ret
& VM_FAULT_ERROR
)
2335 ret
&= VM_FAULT_ERROR
;
2339 /* No need to invalidate - it was non-present before */
2340 update_mmu_cache(vma
, address
, pte
);
2342 pte_unmap_unlock(page_table
, ptl
);
2346 mem_cgroup_uncharge_page(page
);
2347 pte_unmap_unlock(page_table
, ptl
);
2349 page_cache_release(page
);
2354 * We enter with non-exclusive mmap_sem (to exclude vma changes,
2355 * but allow concurrent faults), and pte mapped but not yet locked.
2356 * We return with mmap_sem still held, but pte unmapped and unlocked.
2358 static int do_anonymous_page(struct mm_struct
*mm
, struct vm_area_struct
*vma
,
2359 unsigned long address
, pte_t
*page_table
, pmd_t
*pmd
,
2366 /* Allocate our own private page. */
2367 pte_unmap(page_table
);
2369 if (unlikely(anon_vma_prepare(vma
)))
2371 page
= alloc_zeroed_user_highpage_movable(vma
, address
);
2374 __SetPageUptodate(page
);
2376 if (mem_cgroup_charge(page
, mm
, GFP_KERNEL
))
2379 entry
= mk_pte(page
, vma
->vm_page_prot
);
2380 entry
= maybe_mkwrite(pte_mkdirty(entry
), vma
);
2382 page_table
= pte_offset_map_lock(mm
, pmd
, address
, &ptl
);
2383 if (!pte_none(*page_table
))
2385 inc_mm_counter(mm
, anon_rss
);
2386 SetPageSwapBacked(page
);
2387 lru_cache_add_active(page
);
2388 page_add_new_anon_rmap(page
, vma
, address
);
2389 set_pte_at(mm
, address
, page_table
, entry
);
2391 /* No need to invalidate - it was non-present before */
2392 update_mmu_cache(vma
, address
, entry
);
2394 pte_unmap_unlock(page_table
, ptl
);
2397 mem_cgroup_uncharge_page(page
);
2398 page_cache_release(page
);
2401 page_cache_release(page
);
2403 return VM_FAULT_OOM
;
2407 * __do_fault() tries to create a new page mapping. It aggressively
2408 * tries to share with existing pages, but makes a separate copy if
2409 * the FAULT_FLAG_WRITE is set in the flags parameter in order to avoid
2410 * the next page fault.
2412 * As this is called only for pages that do not currently exist, we
2413 * do not need to flush old virtual caches or the TLB.
2415 * We enter with non-exclusive mmap_sem (to exclude vma changes,
2416 * but allow concurrent faults), and pte neither mapped nor locked.
2417 * We return with mmap_sem still held, but pte unmapped and unlocked.
2419 static int __do_fault(struct mm_struct
*mm
, struct vm_area_struct
*vma
,
2420 unsigned long address
, pmd_t
*pmd
,
2421 pgoff_t pgoff
, unsigned int flags
, pte_t orig_pte
)
2428 struct page
*dirty_page
= NULL
;
2429 struct vm_fault vmf
;
2431 int page_mkwrite
= 0;
2433 vmf
.virtual_address
= (void __user
*)(address
& PAGE_MASK
);
2438 ret
= vma
->vm_ops
->fault(vma
, &vmf
);
2439 if (unlikely(ret
& (VM_FAULT_ERROR
| VM_FAULT_NOPAGE
)))
2443 * For consistency in subsequent calls, make the faulted page always
2446 if (unlikely(!(ret
& VM_FAULT_LOCKED
)))
2447 lock_page(vmf
.page
);
2449 VM_BUG_ON(!PageLocked(vmf
.page
));
2452 * Should we do an early C-O-W break?
2455 if (flags
& FAULT_FLAG_WRITE
) {
2456 if (!(vma
->vm_flags
& VM_SHARED
)) {
2458 if (unlikely(anon_vma_prepare(vma
))) {
2462 page
= alloc_page_vma(GFP_HIGHUSER_MOVABLE
,
2468 copy_user_highpage(page
, vmf
.page
, address
, vma
);
2469 __SetPageUptodate(page
);
2472 * If the page will be shareable, see if the backing
2473 * address space wants to know that the page is about
2474 * to become writable
2476 if (vma
->vm_ops
->page_mkwrite
) {
2478 if (vma
->vm_ops
->page_mkwrite(vma
, page
) < 0) {
2479 ret
= VM_FAULT_SIGBUS
;
2480 anon
= 1; /* no anon but release vmf.page */
2485 * XXX: this is not quite right (racy vs
2486 * invalidate) to unlock and relock the page
2487 * like this, however a better fix requires
2488 * reworking page_mkwrite locking API, which
2489 * is better done later.
2491 if (!page
->mapping
) {
2493 anon
= 1; /* no anon but release vmf.page */
2502 if (mem_cgroup_charge(page
, mm
, GFP_KERNEL
)) {
2507 page_table
= pte_offset_map_lock(mm
, pmd
, address
, &ptl
);
2510 * This silly early PAGE_DIRTY setting removes a race
2511 * due to the bad i386 page protection. But it's valid
2512 * for other architectures too.
2514 * Note that if write_access is true, we either now have
2515 * an exclusive copy of the page, or this is a shared mapping,
2516 * so we can make it writable and dirty to avoid having to
2517 * handle that later.
2519 /* Only go through if we didn't race with anybody else... */
2520 if (likely(pte_same(*page_table
, orig_pte
))) {
2521 flush_icache_page(vma
, page
);
2522 entry
= mk_pte(page
, vma
->vm_page_prot
);
2523 if (flags
& FAULT_FLAG_WRITE
)
2524 entry
= maybe_mkwrite(pte_mkdirty(entry
), vma
);
2525 set_pte_at(mm
, address
, page_table
, entry
);
2527 inc_mm_counter(mm
, anon_rss
);
2528 SetPageSwapBacked(page
);
2529 lru_cache_add_active(page
);
2530 page_add_new_anon_rmap(page
, vma
, address
);
2532 inc_mm_counter(mm
, file_rss
);
2533 page_add_file_rmap(page
);
2534 if (flags
& FAULT_FLAG_WRITE
) {
2536 get_page(dirty_page
);
2540 /* no need to invalidate: a not-present page won't be cached */
2541 update_mmu_cache(vma
, address
, entry
);
2543 mem_cgroup_uncharge_page(page
);
2545 page_cache_release(page
);
2547 anon
= 1; /* no anon but release faulted_page */
2550 pte_unmap_unlock(page_table
, ptl
);
2553 unlock_page(vmf
.page
);
2556 page_cache_release(vmf
.page
);
2557 else if (dirty_page
) {
2559 file_update_time(vma
->vm_file
);
2561 set_page_dirty_balance(dirty_page
, page_mkwrite
);
2562 put_page(dirty_page
);
2568 static int do_linear_fault(struct mm_struct
*mm
, struct vm_area_struct
*vma
,
2569 unsigned long address
, pte_t
*page_table
, pmd_t
*pmd
,
2570 int write_access
, pte_t orig_pte
)
2572 pgoff_t pgoff
= (((address
& PAGE_MASK
)
2573 - vma
->vm_start
) >> PAGE_SHIFT
) + vma
->vm_pgoff
;
2574 unsigned int flags
= (write_access
? FAULT_FLAG_WRITE
: 0);
2576 pte_unmap(page_table
);
2577 return __do_fault(mm
, vma
, address
, pmd
, pgoff
, flags
, orig_pte
);
2581 * Fault of a previously existing named mapping. Repopulate the pte
2582 * from the encoded file_pte if possible. This enables swappable
2585 * We enter with non-exclusive mmap_sem (to exclude vma changes,
2586 * but allow concurrent faults), and pte mapped but not yet locked.
2587 * We return with mmap_sem still held, but pte unmapped and unlocked.
2589 static int do_nonlinear_fault(struct mm_struct
*mm
, struct vm_area_struct
*vma
,
2590 unsigned long address
, pte_t
*page_table
, pmd_t
*pmd
,
2591 int write_access
, pte_t orig_pte
)
2593 unsigned int flags
= FAULT_FLAG_NONLINEAR
|
2594 (write_access
? FAULT_FLAG_WRITE
: 0);
2597 if (!pte_unmap_same(mm
, pmd
, page_table
, orig_pte
))
2600 if (unlikely(!(vma
->vm_flags
& VM_NONLINEAR
) ||
2601 !(vma
->vm_flags
& VM_CAN_NONLINEAR
))) {
2603 * Page table corrupted: show pte and kill process.
2605 print_bad_pte(vma
, orig_pte
, address
);
2606 return VM_FAULT_OOM
;
2609 pgoff
= pte_to_pgoff(orig_pte
);
2610 return __do_fault(mm
, vma
, address
, pmd
, pgoff
, flags
, orig_pte
);
2614 * These routines also need to handle stuff like marking pages dirty
2615 * and/or accessed for architectures that don't do it in hardware (most
2616 * RISC architectures). The early dirtying is also good on the i386.
2618 * There is also a hook called "update_mmu_cache()" that architectures
2619 * with external mmu caches can use to update those (ie the Sparc or
2620 * PowerPC hashed page tables that act as extended TLBs).
2622 * We enter with non-exclusive mmap_sem (to exclude vma changes,
2623 * but allow concurrent faults), and pte mapped but not yet locked.
2624 * We return with mmap_sem still held, but pte unmapped and unlocked.
2626 static inline int handle_pte_fault(struct mm_struct
*mm
,
2627 struct vm_area_struct
*vma
, unsigned long address
,
2628 pte_t
*pte
, pmd_t
*pmd
, int write_access
)
2634 if (!pte_present(entry
)) {
2635 if (pte_none(entry
)) {
2637 if (likely(vma
->vm_ops
->fault
))
2638 return do_linear_fault(mm
, vma
, address
,
2639 pte
, pmd
, write_access
, entry
);
2641 return do_anonymous_page(mm
, vma
, address
,
2642 pte
, pmd
, write_access
);
2644 if (pte_file(entry
))
2645 return do_nonlinear_fault(mm
, vma
, address
,
2646 pte
, pmd
, write_access
, entry
);
2647 return do_swap_page(mm
, vma
, address
,
2648 pte
, pmd
, write_access
, entry
);
2651 ptl
= pte_lockptr(mm
, pmd
);
2653 if (unlikely(!pte_same(*pte
, entry
)))
2656 if (!pte_write(entry
))
2657 return do_wp_page(mm
, vma
, address
,
2658 pte
, pmd
, ptl
, entry
);
2659 entry
= pte_mkdirty(entry
);
2661 entry
= pte_mkyoung(entry
);
2662 if (ptep_set_access_flags(vma
, address
, pte
, entry
, write_access
)) {
2663 update_mmu_cache(vma
, address
, entry
);
2666 * This is needed only for protection faults but the arch code
2667 * is not yet telling us if this is a protection fault or not.
2668 * This still avoids useless tlb flushes for .text page faults
2672 flush_tlb_page(vma
, address
);
2675 pte_unmap_unlock(pte
, ptl
);
2680 * By the time we get here, we already hold the mm semaphore
2682 int handle_mm_fault(struct mm_struct
*mm
, struct vm_area_struct
*vma
,
2683 unsigned long address
, int write_access
)
2690 __set_current_state(TASK_RUNNING
);
2692 count_vm_event(PGFAULT
);
2694 if (unlikely(is_vm_hugetlb_page(vma
)))
2695 return hugetlb_fault(mm
, vma
, address
, write_access
);
2697 pgd
= pgd_offset(mm
, address
);
2698 pud
= pud_alloc(mm
, pgd
, address
);
2700 return VM_FAULT_OOM
;
2701 pmd
= pmd_alloc(mm
, pud
, address
);
2703 return VM_FAULT_OOM
;
2704 pte
= pte_alloc_map(mm
, pmd
, address
);
2706 return VM_FAULT_OOM
;
2708 return handle_pte_fault(mm
, vma
, address
, pte
, pmd
, write_access
);
2711 #ifndef __PAGETABLE_PUD_FOLDED
2713 * Allocate page upper directory.
2714 * We've already handled the fast-path in-line.
2716 int __pud_alloc(struct mm_struct
*mm
, pgd_t
*pgd
, unsigned long address
)
2718 pud_t
*new = pud_alloc_one(mm
, address
);
2722 smp_wmb(); /* See comment in __pte_alloc */
2724 spin_lock(&mm
->page_table_lock
);
2725 if (pgd_present(*pgd
)) /* Another has populated it */
2728 pgd_populate(mm
, pgd
, new);
2729 spin_unlock(&mm
->page_table_lock
);
2732 #endif /* __PAGETABLE_PUD_FOLDED */
2734 #ifndef __PAGETABLE_PMD_FOLDED
2736 * Allocate page middle directory.
2737 * We've already handled the fast-path in-line.
2739 int __pmd_alloc(struct mm_struct
*mm
, pud_t
*pud
, unsigned long address
)
2741 pmd_t
*new = pmd_alloc_one(mm
, address
);
2745 smp_wmb(); /* See comment in __pte_alloc */
2747 spin_lock(&mm
->page_table_lock
);
2748 #ifndef __ARCH_HAS_4LEVEL_HACK
2749 if (pud_present(*pud
)) /* Another has populated it */
2752 pud_populate(mm
, pud
, new);
2754 if (pgd_present(*pud
)) /* Another has populated it */
2757 pgd_populate(mm
, pud
, new);
2758 #endif /* __ARCH_HAS_4LEVEL_HACK */
2759 spin_unlock(&mm
->page_table_lock
);
2762 #endif /* __PAGETABLE_PMD_FOLDED */
2764 int make_pages_present(unsigned long addr
, unsigned long end
)
2766 int ret
, len
, write
;
2767 struct vm_area_struct
* vma
;
2769 vma
= find_vma(current
->mm
, addr
);
2772 write
= (vma
->vm_flags
& VM_WRITE
) != 0;
2773 BUG_ON(addr
>= end
);
2774 BUG_ON(end
> vma
->vm_end
);
2775 len
= DIV_ROUND_UP(end
, PAGE_SIZE
) - addr
/PAGE_SIZE
;
2776 ret
= get_user_pages(current
, current
->mm
, addr
,
2777 len
, write
, 0, NULL
, NULL
);
2780 SUS require strange return value to mlock
2781 - invalid addr generate to ENOMEM.
2782 - out of memory should generate EAGAIN.
2786 else if (ret
== -ENOMEM
)
2790 return ret
== len
? 0 : -ENOMEM
;
2793 #if !defined(__HAVE_ARCH_GATE_AREA)
2795 #if defined(AT_SYSINFO_EHDR)
2796 static struct vm_area_struct gate_vma
;
2798 static int __init
gate_vma_init(void)
2800 gate_vma
.vm_mm
= NULL
;
2801 gate_vma
.vm_start
= FIXADDR_USER_START
;
2802 gate_vma
.vm_end
= FIXADDR_USER_END
;
2803 gate_vma
.vm_flags
= VM_READ
| VM_MAYREAD
| VM_EXEC
| VM_MAYEXEC
;
2804 gate_vma
.vm_page_prot
= __P101
;
2806 * Make sure the vDSO gets into every core dump.
2807 * Dumping its contents makes post-mortem fully interpretable later
2808 * without matching up the same kernel and hardware config to see
2809 * what PC values meant.
2811 gate_vma
.vm_flags
|= VM_ALWAYSDUMP
;
2814 __initcall(gate_vma_init
);
2817 struct vm_area_struct
*get_gate_vma(struct task_struct
*tsk
)
2819 #ifdef AT_SYSINFO_EHDR
2826 int in_gate_area_no_task(unsigned long addr
)
2828 #ifdef AT_SYSINFO_EHDR
2829 if ((addr
>= FIXADDR_USER_START
) && (addr
< FIXADDR_USER_END
))
2835 #endif /* __HAVE_ARCH_GATE_AREA */
2837 #ifdef CONFIG_HAVE_IOREMAP_PROT
2838 static resource_size_t
follow_phys(struct vm_area_struct
*vma
,
2839 unsigned long address
, unsigned int flags
,
2840 unsigned long *prot
)
2847 resource_size_t phys_addr
= 0;
2848 struct mm_struct
*mm
= vma
->vm_mm
;
2850 VM_BUG_ON(!(vma
->vm_flags
& (VM_IO
| VM_PFNMAP
)));
2852 pgd
= pgd_offset(mm
, address
);
2853 if (pgd_none(*pgd
) || unlikely(pgd_bad(*pgd
)))
2856 pud
= pud_offset(pgd
, address
);
2857 if (pud_none(*pud
) || unlikely(pud_bad(*pud
)))
2860 pmd
= pmd_offset(pud
, address
);
2861 if (pmd_none(*pmd
) || unlikely(pmd_bad(*pmd
)))
2864 /* We cannot handle huge page PFN maps. Luckily they don't exist. */
2868 ptep
= pte_offset_map_lock(mm
, pmd
, address
, &ptl
);
2873 if (!pte_present(pte
))
2875 if ((flags
& FOLL_WRITE
) && !pte_write(pte
))
2877 phys_addr
= pte_pfn(pte
);
2878 phys_addr
<<= PAGE_SHIFT
; /* Shift here to avoid overflow on PAE */
2880 *prot
= pgprot_val(pte_pgprot(pte
));
2883 pte_unmap_unlock(ptep
, ptl
);
2890 int generic_access_phys(struct vm_area_struct
*vma
, unsigned long addr
,
2891 void *buf
, int len
, int write
)
2893 resource_size_t phys_addr
;
2894 unsigned long prot
= 0;
2896 int offset
= addr
& (PAGE_SIZE
-1);
2898 if (!(vma
->vm_flags
& (VM_IO
| VM_PFNMAP
)))
2901 phys_addr
= follow_phys(vma
, addr
, write
, &prot
);
2906 maddr
= ioremap_prot(phys_addr
, PAGE_SIZE
, prot
);
2908 memcpy_toio(maddr
+ offset
, buf
, len
);
2910 memcpy_fromio(buf
, maddr
+ offset
, len
);
2918 * Access another process' address space.
2919 * Source/target buffer must be kernel space,
2920 * Do not walk the page table directly, use get_user_pages
2922 int access_process_vm(struct task_struct
*tsk
, unsigned long addr
, void *buf
, int len
, int write
)
2924 struct mm_struct
*mm
;
2925 struct vm_area_struct
*vma
;
2926 void *old_buf
= buf
;
2928 mm
= get_task_mm(tsk
);
2932 down_read(&mm
->mmap_sem
);
2933 /* ignore errors, just check how much was successfully transferred */
2935 int bytes
, ret
, offset
;
2937 struct page
*page
= NULL
;
2939 ret
= get_user_pages(tsk
, mm
, addr
, 1,
2940 write
, 1, &page
, &vma
);
2943 * Check if this is a VM_IO | VM_PFNMAP VMA, which
2944 * we can access using slightly different code.
2946 #ifdef CONFIG_HAVE_IOREMAP_PROT
2947 vma
= find_vma(mm
, addr
);
2950 if (vma
->vm_ops
&& vma
->vm_ops
->access
)
2951 ret
= vma
->vm_ops
->access(vma
, addr
, buf
,
2959 offset
= addr
& (PAGE_SIZE
-1);
2960 if (bytes
> PAGE_SIZE
-offset
)
2961 bytes
= PAGE_SIZE
-offset
;
2965 copy_to_user_page(vma
, page
, addr
,
2966 maddr
+ offset
, buf
, bytes
);
2967 set_page_dirty_lock(page
);
2969 copy_from_user_page(vma
, page
, addr
,
2970 buf
, maddr
+ offset
, bytes
);
2973 page_cache_release(page
);
2979 up_read(&mm
->mmap_sem
);
2982 return buf
- old_buf
;
2986 * Print the name of a VMA.
2988 void print_vma_addr(char *prefix
, unsigned long ip
)
2990 struct mm_struct
*mm
= current
->mm
;
2991 struct vm_area_struct
*vma
;
2994 * Do not print if we are in atomic
2995 * contexts (in exception stacks, etc.):
2997 if (preempt_count())
3000 down_read(&mm
->mmap_sem
);
3001 vma
= find_vma(mm
, ip
);
3002 if (vma
&& vma
->vm_file
) {
3003 struct file
*f
= vma
->vm_file
;
3004 char *buf
= (char *)__get_free_page(GFP_KERNEL
);
3008 p
= d_path(&f
->f_path
, buf
, PAGE_SIZE
);
3011 s
= strrchr(p
, '/');
3014 printk("%s%s[%lx+%lx]", prefix
, p
,
3016 vma
->vm_end
- vma
->vm_start
);
3017 free_page((unsigned long)buf
);
3020 up_read(¤t
->mm
->mmap_sem
);